1 /* Read the GIMPLE representation from a file stream.
3 Copyright 2009, 2010 Free Software Foundation, Inc.
4 Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
5 Re-implemented by Diego Novillo <dnovillo@google.com>
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
25 #include "coretypes.h"
34 #include "basic-block.h"
35 #include "tree-flow.h"
36 #include "tree-pass.h"
40 #include "diagnostic.h"
47 #include "ipa-utils.h"
48 #include "lto-streamer.h"
49 #include "tree-pass.h"
51 /* Data structure used to hash file names in the source_location field. */
55 unsigned int slot_num
;
58 /* The table to hold the file names. */
59 static htab_t file_name_hash_table
;
62 /* Check that tag ACTUAL has one of the given values. NUM_TAGS is the
63 number of valid tag values to check. */
66 lto_tag_check_set (enum LTO_tags actual
, int ntags
, ...)
72 for (i
= 0; i
< ntags
; i
++)
73 if ((unsigned) actual
== va_arg (ap
, unsigned))
80 internal_error ("bytecode stream: unexpected tag %s", lto_tag_name (actual
));
84 /* Check that tag ACTUAL is in the range [TAG1, TAG2]. */
87 lto_tag_check_range (enum LTO_tags actual
, enum LTO_tags tag1
,
90 if (actual
< tag1
|| actual
> tag2
)
91 internal_error ("bytecode stream: tag %s is not in the expected range "
93 lto_tag_name (actual
),
99 /* Check that tag ACTUAL == EXPECTED. */
102 lto_tag_check (enum LTO_tags actual
, enum LTO_tags expected
)
104 if (actual
!= expected
)
105 internal_error ("bytecode stream: expected tag %s instead of %s",
106 lto_tag_name (expected
), lto_tag_name (actual
));
110 /* Return a hash code for P. */
113 hash_string_slot_node (const void *p
)
115 const struct string_slot
*ds
= (const struct string_slot
*) p
;
116 return (hashval_t
) htab_hash_string (ds
->s
);
120 /* Returns nonzero if P1 and P2 are equal. */
123 eq_string_slot_node (const void *p1
, const void *p2
)
125 const struct string_slot
*ds1
= (const struct string_slot
*) p1
;
126 const struct string_slot
*ds2
= (const struct string_slot
*) p2
;
127 return strcmp (ds1
->s
, ds2
->s
) == 0;
131 /* Read a string from the string table in DATA_IN using input block
132 IB. Write the length to RLEN. */
135 input_string_internal (struct data_in
*data_in
, struct lto_input_block
*ib
,
138 struct lto_input_block str_tab
;
143 loc
= lto_input_uleb128 (ib
);
144 LTO_INIT_INPUT_BLOCK (str_tab
, data_in
->strings
, loc
, data_in
->strings_len
);
145 len
= lto_input_uleb128 (&str_tab
);
148 if (str_tab
.p
+ len
> data_in
->strings_len
)
149 internal_error ("bytecode stream: string too long for the string table");
151 result
= (const char *)(data_in
->strings
+ str_tab
.p
);
157 /* Read a STRING_CST from the string table in DATA_IN using input
161 input_string_cst (struct data_in
*data_in
, struct lto_input_block
*ib
)
165 unsigned int is_null
;
167 is_null
= lto_input_uleb128 (ib
);
171 ptr
= input_string_internal (data_in
, ib
, &len
);
172 return build_string (len
, ptr
);
176 /* Read an IDENTIFIER from the string table in DATA_IN using input
180 input_identifier (struct data_in
*data_in
, struct lto_input_block
*ib
)
184 unsigned int is_null
;
186 is_null
= lto_input_uleb128 (ib
);
190 ptr
= input_string_internal (data_in
, ib
, &len
);
191 return get_identifier_with_length (ptr
, len
);
194 /* Read a NULL terminated string from the string table in DATA_IN. */
197 input_string (struct data_in
*data_in
, struct lto_input_block
*ib
)
201 unsigned int is_null
;
203 is_null
= lto_input_uleb128 (ib
);
207 ptr
= input_string_internal (data_in
, ib
, &len
);
208 if (ptr
[len
- 1] != '\0')
209 internal_error ("bytecode stream: found non-null terminated string");
215 /* Return the next tag in the input block IB. */
218 input_record_start (struct lto_input_block
*ib
)
220 enum LTO_tags tag
= (enum LTO_tags
) lto_input_uleb128 (ib
);
225 /* Lookup STRING in file_name_hash_table. If found, return the existing
226 string, otherwise insert STRING as the canonical version. */
229 canon_file_name (const char *string
)
232 struct string_slot s_slot
;
235 slot
= htab_find_slot (file_name_hash_table
, &s_slot
, INSERT
);
240 struct string_slot
*new_slot
;
242 len
= strlen (string
);
243 saved_string
= (char *) xmalloc (len
+ 1);
244 new_slot
= XCNEW (struct string_slot
);
245 strcpy (saved_string
, string
);
246 new_slot
->s
= saved_string
;
252 struct string_slot
*old_slot
= (struct string_slot
*) *slot
;
258 /* Clear the line info stored in DATA_IN. */
261 clear_line_info (struct data_in
*data_in
)
263 if (data_in
->current_file
)
264 linemap_add (line_table
, LC_LEAVE
, false, NULL
, 0);
265 data_in
->current_file
= NULL
;
266 data_in
->current_line
= 0;
267 data_in
->current_col
= 0;
271 /* Read a location from input block IB. */
274 lto_input_location (struct lto_input_block
*ib
, struct data_in
*data_in
)
276 expanded_location xloc
;
278 xloc
.file
= input_string (data_in
, ib
);
279 if (xloc
.file
== NULL
)
280 return UNKNOWN_LOCATION
;
282 xloc
.file
= canon_file_name (xloc
.file
);
283 xloc
.line
= lto_input_sleb128 (ib
);
284 xloc
.column
= lto_input_sleb128 (ib
);
285 xloc
.sysp
= lto_input_sleb128 (ib
);
287 if (data_in
->current_file
!= xloc
.file
)
289 if (data_in
->current_file
)
290 linemap_add (line_table
, LC_LEAVE
, false, NULL
, 0);
292 linemap_add (line_table
, LC_ENTER
, xloc
.sysp
, xloc
.file
, xloc
.line
);
294 else if (data_in
->current_line
!= xloc
.line
)
295 linemap_line_start (line_table
, xloc
.line
, xloc
.column
);
297 data_in
->current_file
= xloc
.file
;
298 data_in
->current_line
= xloc
.line
;
299 data_in
->current_col
= xloc
.column
;
301 return linemap_position_for_column (line_table
, xloc
.column
);
305 /* Read a reference to a tree node from DATA_IN using input block IB.
306 TAG is the expected node that should be found in IB, if TAG belongs
307 to one of the indexable trees, expect to read a reference index to
308 be looked up in one of the symbol tables, otherwise read the pysical
309 representation of the tree using lto_input_tree. FN is the
310 function scope for the read tree. */
313 lto_input_tree_ref (struct lto_input_block
*ib
, struct data_in
*data_in
,
314 struct function
*fn
, enum LTO_tags tag
)
316 unsigned HOST_WIDE_INT ix_u
;
317 tree result
= NULL_TREE
;
319 lto_tag_check_range (tag
, LTO_field_decl_ref
, LTO_global_decl_ref
);
324 ix_u
= lto_input_uleb128 (ib
);
325 result
= lto_file_decl_data_get_type (data_in
->file_data
, ix_u
);
328 case LTO_ssa_name_ref
:
329 ix_u
= lto_input_uleb128 (ib
);
330 result
= VEC_index (tree
, SSANAMES (fn
), ix_u
);
333 case LTO_field_decl_ref
:
334 ix_u
= lto_input_uleb128 (ib
);
335 result
= lto_file_decl_data_get_field_decl (data_in
->file_data
, ix_u
);
338 case LTO_function_decl_ref
:
339 ix_u
= lto_input_uleb128 (ib
);
340 result
= lto_file_decl_data_get_fn_decl (data_in
->file_data
, ix_u
);
343 case LTO_type_decl_ref
:
344 ix_u
= lto_input_uleb128 (ib
);
345 result
= lto_file_decl_data_get_type_decl (data_in
->file_data
, ix_u
);
348 case LTO_namespace_decl_ref
:
349 ix_u
= lto_input_uleb128 (ib
);
350 result
= lto_file_decl_data_get_namespace_decl (data_in
->file_data
, ix_u
);
353 case LTO_global_decl_ref
:
354 case LTO_result_decl_ref
:
355 case LTO_const_decl_ref
:
356 case LTO_imported_decl_ref
:
357 case LTO_label_decl_ref
:
358 case LTO_translation_unit_decl_ref
:
359 ix_u
= lto_input_uleb128 (ib
);
360 result
= lto_file_decl_data_get_var_decl (data_in
->file_data
, ix_u
);
373 /* Read and return a double-linked list of catch handlers from input
374 block IB, using descriptors in DATA_IN. */
376 static struct eh_catch_d
*
377 lto_input_eh_catch_list (struct lto_input_block
*ib
, struct data_in
*data_in
,
383 *last_p
= first
= NULL
;
384 tag
= input_record_start (ib
);
390 lto_tag_check_range (tag
, LTO_eh_catch
, LTO_eh_catch
);
392 /* Read the catch node. */
393 n
= ggc_alloc_cleared_eh_catch_d ();
394 n
->type_list
= lto_input_tree (ib
, data_in
);
395 n
->filter_list
= lto_input_tree (ib
, data_in
);
396 n
->label
= lto_input_tree (ib
, data_in
);
398 /* Register all the types in N->FILTER_LIST. */
399 for (list
= n
->filter_list
; list
; list
= TREE_CHAIN (list
))
400 add_type_for_runtime (TREE_VALUE (list
));
402 /* Chain N to the end of the list. */
404 (*last_p
)->next_catch
= n
;
405 n
->prev_catch
= *last_p
;
408 /* Set the head of the list the first time through the loop. */
412 tag
= input_record_start (ib
);
419 /* Read and return EH region IX from input block IB, using descriptors
423 input_eh_region (struct lto_input_block
*ib
, struct data_in
*data_in
, int ix
)
428 /* Read the region header. */
429 tag
= input_record_start (ib
);
433 r
= ggc_alloc_cleared_eh_region_d ();
434 r
->index
= lto_input_sleb128 (ib
);
436 gcc_assert (r
->index
== ix
);
438 /* Read all the region pointers as region numbers. We'll fix up
439 the pointers once the whole array has been read. */
440 r
->outer
= (eh_region
) (intptr_t) lto_input_sleb128 (ib
);
441 r
->inner
= (eh_region
) (intptr_t) lto_input_sleb128 (ib
);
442 r
->next_peer
= (eh_region
) (intptr_t) lto_input_sleb128 (ib
);
446 case LTO_ert_cleanup
:
447 r
->type
= ERT_CLEANUP
;
452 struct eh_catch_d
*last_catch
;
454 r
->u
.eh_try
.first_catch
= lto_input_eh_catch_list (ib
, data_in
,
456 r
->u
.eh_try
.last_catch
= last_catch
;
460 case LTO_ert_allowed_exceptions
:
464 r
->type
= ERT_ALLOWED_EXCEPTIONS
;
465 r
->u
.allowed
.type_list
= lto_input_tree (ib
, data_in
);
466 r
->u
.allowed
.label
= lto_input_tree (ib
, data_in
);
467 r
->u
.allowed
.filter
= lto_input_uleb128 (ib
);
469 for (l
= r
->u
.allowed
.type_list
; l
; l
= TREE_CHAIN (l
))
470 add_type_for_runtime (TREE_VALUE (l
));
474 case LTO_ert_must_not_throw
:
475 r
->type
= ERT_MUST_NOT_THROW
;
476 r
->u
.must_not_throw
.failure_decl
= lto_input_tree (ib
, data_in
);
477 r
->u
.must_not_throw
.failure_loc
= lto_input_location (ib
, data_in
);
484 r
->landing_pads
= (eh_landing_pad
) (intptr_t) lto_input_sleb128 (ib
);
490 /* Read and return EH landing pad IX from input block IB, using descriptors
493 static eh_landing_pad
494 input_eh_lp (struct lto_input_block
*ib
, struct data_in
*data_in
, int ix
)
499 /* Read the landing pad header. */
500 tag
= input_record_start (ib
);
504 lto_tag_check_range (tag
, LTO_eh_landing_pad
, LTO_eh_landing_pad
);
506 lp
= ggc_alloc_cleared_eh_landing_pad_d ();
507 lp
->index
= lto_input_sleb128 (ib
);
508 gcc_assert (lp
->index
== ix
);
509 lp
->next_lp
= (eh_landing_pad
) (intptr_t) lto_input_sleb128 (ib
);
510 lp
->region
= (eh_region
) (intptr_t) lto_input_sleb128 (ib
);
511 lp
->post_landing_pad
= lto_input_tree (ib
, data_in
);
517 /* After reading the EH regions, pointers to peer and children regions
518 are region numbers. This converts all these region numbers into
519 real pointers into the rematerialized regions for FN. ROOT_REGION
520 is the region number for the root EH region in FN. */
523 fixup_eh_region_pointers (struct function
*fn
, HOST_WIDE_INT root_region
)
526 VEC(eh_region
,gc
) *eh_array
= fn
->eh
->region_array
;
527 VEC(eh_landing_pad
,gc
) *lp_array
= fn
->eh
->lp_array
;
531 gcc_assert (eh_array
&& lp_array
);
533 gcc_assert (root_region
>= 0);
534 fn
->eh
->region_tree
= VEC_index (eh_region
, eh_array
, root_region
);
536 #define FIXUP_EH_REGION(r) (r) = VEC_index (eh_region, eh_array, \
537 (HOST_WIDE_INT) (intptr_t) (r))
538 #define FIXUP_EH_LP(p) (p) = VEC_index (eh_landing_pad, lp_array, \
539 (HOST_WIDE_INT) (intptr_t) (p))
541 /* Convert all the index numbers stored in pointer fields into
542 pointers to the corresponding slots in the EH region array. */
543 FOR_EACH_VEC_ELT (eh_region
, eh_array
, i
, r
)
545 /* The array may contain NULL regions. */
549 gcc_assert (i
== (unsigned) r
->index
);
550 FIXUP_EH_REGION (r
->outer
);
551 FIXUP_EH_REGION (r
->inner
);
552 FIXUP_EH_REGION (r
->next_peer
);
553 FIXUP_EH_LP (r
->landing_pads
);
556 /* Convert all the index numbers stored in pointer fields into
557 pointers to the corresponding slots in the EH landing pad array. */
558 FOR_EACH_VEC_ELT (eh_landing_pad
, lp_array
, i
, lp
)
560 /* The array may contain NULL landing pads. */
564 gcc_assert (i
== (unsigned) lp
->index
);
565 FIXUP_EH_LP (lp
->next_lp
);
566 FIXUP_EH_REGION (lp
->region
);
569 #undef FIXUP_EH_REGION
574 /* Initialize EH support. */
579 static bool eh_initialized_p
= false;
581 if (eh_initialized_p
)
584 /* Contrary to most other FEs, we only initialize EH support when at
585 least one of the files in the set contains exception regions in
586 it. Since this happens much later than the call to init_eh in
587 lang_dependent_init, we have to set flag_exceptions and call
588 init_eh again to initialize the EH tables. */
592 /* Initialize dwarf2 tables. Since dwarf2out_do_frame() returns
593 true only when exceptions are enabled, this initialization is
594 never done during lang_dependent_init. */
595 #if defined DWARF2_DEBUGGING_INFO || defined DWARF2_UNWIND_INFO
596 if (dwarf2out_do_frame ())
597 dwarf2out_frame_init ();
600 eh_initialized_p
= true;
604 /* Read the exception table for FN from IB using the data descriptors
608 input_eh_regions (struct lto_input_block
*ib
, struct data_in
*data_in
,
611 HOST_WIDE_INT i
, root_region
, len
;
614 tag
= input_record_start (ib
);
618 lto_tag_check_range (tag
, LTO_eh_table
, LTO_eh_table
);
620 /* If the file contains EH regions, then it was compiled with
621 -fexceptions. In that case, initialize the backend EH
627 root_region
= lto_input_sleb128 (ib
);
628 gcc_assert (root_region
== (int) root_region
);
630 /* Read the EH region array. */
631 len
= lto_input_sleb128 (ib
);
632 gcc_assert (len
== (int) len
);
635 VEC_safe_grow (eh_region
, gc
, fn
->eh
->region_array
, len
);
636 for (i
= 0; i
< len
; i
++)
638 eh_region r
= input_eh_region (ib
, data_in
, i
);
639 VEC_replace (eh_region
, fn
->eh
->region_array
, i
, r
);
643 /* Read the landing pads. */
644 len
= lto_input_sleb128 (ib
);
645 gcc_assert (len
== (int) len
);
648 VEC_safe_grow (eh_landing_pad
, gc
, fn
->eh
->lp_array
, len
);
649 for (i
= 0; i
< len
; i
++)
651 eh_landing_pad lp
= input_eh_lp (ib
, data_in
, i
);
652 VEC_replace (eh_landing_pad
, fn
->eh
->lp_array
, i
, lp
);
656 /* Read the runtime type data. */
657 len
= lto_input_sleb128 (ib
);
658 gcc_assert (len
== (int) len
);
661 VEC_safe_grow (tree
, gc
, fn
->eh
->ttype_data
, len
);
662 for (i
= 0; i
< len
; i
++)
664 tree ttype
= lto_input_tree (ib
, data_in
);
665 VEC_replace (tree
, fn
->eh
->ttype_data
, i
, ttype
);
669 /* Read the table of action chains. */
670 len
= lto_input_sleb128 (ib
);
671 gcc_assert (len
== (int) len
);
674 if (targetm
.arm_eabi_unwinder
)
676 VEC_safe_grow (tree
, gc
, fn
->eh
->ehspec_data
.arm_eabi
, len
);
677 for (i
= 0; i
< len
; i
++)
679 tree t
= lto_input_tree (ib
, data_in
);
680 VEC_replace (tree
, fn
->eh
->ehspec_data
.arm_eabi
, i
, t
);
685 VEC_safe_grow (uchar
, gc
, fn
->eh
->ehspec_data
.other
, len
);
686 for (i
= 0; i
< len
; i
++)
688 uchar c
= lto_input_1_unsigned (ib
);
689 VEC_replace (uchar
, fn
->eh
->ehspec_data
.other
, i
, c
);
694 /* Reconstruct the EH region tree by fixing up the peer/children
696 fixup_eh_region_pointers (fn
, root_region
);
698 tag
= input_record_start (ib
);
699 lto_tag_check_range (tag
, LTO_null
, LTO_null
);
703 /* Make a new basic block with index INDEX in function FN. */
706 make_new_block (struct function
*fn
, unsigned int index
)
708 basic_block bb
= alloc_block ();
710 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, index
, bb
);
711 bb
->il
.gimple
= ggc_alloc_cleared_gimple_bb_info ();
712 n_basic_blocks_for_function (fn
)++;
714 set_bb_seq (bb
, gimple_seq_alloc ());
719 /* Read the CFG for function FN from input block IB. */
722 input_cfg (struct lto_input_block
*ib
, struct function
*fn
)
724 unsigned int bb_count
;
729 init_empty_tree_cfg_for_function (fn
);
730 init_ssa_operands ();
732 profile_status_for_function (fn
) =
733 (enum profile_status_d
) lto_input_uleb128 (ib
);
735 bb_count
= lto_input_uleb128 (ib
);
737 last_basic_block_for_function (fn
) = bb_count
;
738 if (bb_count
> VEC_length (basic_block
, basic_block_info_for_function (fn
)))
739 VEC_safe_grow_cleared (basic_block
, gc
,
740 basic_block_info_for_function (fn
), bb_count
);
742 if (bb_count
> VEC_length (basic_block
, label_to_block_map_for_function (fn
)))
743 VEC_safe_grow_cleared (basic_block
, gc
,
744 label_to_block_map_for_function (fn
), bb_count
);
746 index
= lto_input_sleb128 (ib
);
749 basic_block bb
= BASIC_BLOCK_FOR_FUNCTION (fn
, index
);
750 unsigned int edge_count
;
753 bb
= make_new_block (fn
, index
);
755 edge_count
= lto_input_uleb128 (ib
);
757 /* Connect up the CFG. */
758 for (i
= 0; i
< edge_count
; i
++)
760 unsigned int dest_index
;
761 unsigned int edge_flags
;
767 dest_index
= lto_input_uleb128 (ib
);
768 probability
= (int) lto_input_sleb128 (ib
);
769 count
= (gcov_type
) lto_input_sleb128 (ib
);
770 edge_flags
= lto_input_uleb128 (ib
);
772 dest
= BASIC_BLOCK_FOR_FUNCTION (fn
, dest_index
);
775 dest
= make_new_block (fn
, dest_index
);
777 e
= make_edge (bb
, dest
, edge_flags
);
778 e
->probability
= probability
;
782 index
= lto_input_sleb128 (ib
);
785 p_bb
= ENTRY_BLOCK_PTR_FOR_FUNCTION(fn
);
786 index
= lto_input_sleb128 (ib
);
789 basic_block bb
= BASIC_BLOCK_FOR_FUNCTION (fn
, index
);
793 index
= lto_input_sleb128 (ib
);
798 /* Read a PHI function for basic block BB in function FN. DATA_IN is
799 the file being read. IB is the input block to use for reading. */
802 input_phi (struct lto_input_block
*ib
, basic_block bb
, struct data_in
*data_in
,
805 unsigned HOST_WIDE_INT ix
;
810 ix
= lto_input_uleb128 (ib
);
811 phi_result
= VEC_index (tree
, SSANAMES (fn
), ix
);
812 len
= EDGE_COUNT (bb
->preds
);
813 result
= create_phi_node (phi_result
, bb
);
814 SSA_NAME_DEF_STMT (phi_result
) = result
;
816 /* We have to go through a lookup process here because the preds in the
817 reconstructed graph are generally in a different order than they
818 were in the original program. */
819 for (i
= 0; i
< len
; i
++)
821 tree def
= lto_input_tree (ib
, data_in
);
822 int src_index
= lto_input_uleb128 (ib
);
823 location_t arg_loc
= lto_input_location (ib
, data_in
);
824 basic_block sbb
= BASIC_BLOCK_FOR_FUNCTION (fn
, src_index
);
829 for (j
= 0; j
< len
; j
++)
830 if (EDGE_PRED (bb
, j
)->src
== sbb
)
832 e
= EDGE_PRED (bb
, j
);
836 add_phi_arg (result
, def
, e
, arg_loc
);
843 /* Read the SSA names array for function FN from DATA_IN using input
847 input_ssa_names (struct lto_input_block
*ib
, struct data_in
*data_in
,
850 unsigned int i
, size
;
852 size
= lto_input_uleb128 (ib
);
853 init_ssanames (fn
, size
);
855 i
= lto_input_uleb128 (ib
);
861 /* Skip over the elements that had been freed. */
862 while (VEC_length (tree
, SSANAMES (fn
)) < i
)
863 VEC_quick_push (tree
, SSANAMES (fn
), NULL_TREE
);
865 is_default_def
= (lto_input_1_unsigned (ib
) != 0);
866 name
= lto_input_tree (ib
, data_in
);
867 ssa_name
= make_ssa_name_fn (fn
, name
, gimple_build_nop ());
870 set_default_def (SSA_NAME_VAR (ssa_name
), ssa_name
);
872 i
= lto_input_uleb128 (ib
);
876 /* Read a statement with tag TAG in function FN from block IB using
877 descriptors in DATA_IN. */
880 input_gimple_stmt (struct lto_input_block
*ib
, struct data_in
*data_in
,
881 struct function
*fn
, enum LTO_tags tag
)
884 enum gimple_code code
;
885 unsigned HOST_WIDE_INT num_ops
;
889 code
= lto_tag_to_gimple_code (tag
);
891 /* Read the tuple header. */
892 bp
= lto_input_bitpack (ib
);
893 num_ops
= bp_unpack_value (&bp
, sizeof (unsigned) * 8);
894 stmt
= gimple_alloc (code
, num_ops
);
895 stmt
->gsbase
.no_warning
= bp_unpack_value (&bp
, 1);
896 if (is_gimple_assign (stmt
))
897 stmt
->gsbase
.nontemporal_move
= bp_unpack_value (&bp
, 1);
898 stmt
->gsbase
.has_volatile_ops
= bp_unpack_value (&bp
, 1);
899 stmt
->gsbase
.subcode
= bp_unpack_value (&bp
, 16);
901 /* Read location information. */
902 gimple_set_location (stmt
, lto_input_location (ib
, data_in
));
904 /* Read lexical block reference. */
905 gimple_set_block (stmt
, lto_input_tree (ib
, data_in
));
907 /* Read in all the operands. */
911 gimple_resx_set_region (stmt
, lto_input_sleb128 (ib
));
914 case GIMPLE_EH_MUST_NOT_THROW
:
915 gimple_eh_must_not_throw_set_fndecl (stmt
, lto_input_tree (ib
, data_in
));
918 case GIMPLE_EH_DISPATCH
:
919 gimple_eh_dispatch_set_region (stmt
, lto_input_sleb128 (ib
));
924 /* FIXME lto. Move most of this into a new gimple_asm_set_string(). */
926 stmt
->gimple_asm
.ni
= lto_input_uleb128 (ib
);
927 stmt
->gimple_asm
.no
= lto_input_uleb128 (ib
);
928 stmt
->gimple_asm
.nc
= lto_input_uleb128 (ib
);
929 stmt
->gimple_asm
.nl
= lto_input_uleb128 (ib
);
930 str
= input_string_cst (data_in
, ib
);
931 stmt
->gimple_asm
.string
= TREE_STRING_POINTER (str
);
943 for (i
= 0; i
< num_ops
; i
++)
945 tree op
= lto_input_tree (ib
, data_in
);
946 gimple_set_op (stmt
, i
, op
);
950 /* Fixup FIELD_DECLs in COMPONENT_REFs, they are not handled
952 if (TREE_CODE (op
) == ADDR_EXPR
)
953 op
= TREE_OPERAND (op
, 0);
954 while (handled_component_p (op
))
956 if (TREE_CODE (op
) == COMPONENT_REF
)
958 tree field
, type
, tem
;
959 tree closest_match
= NULL_TREE
;
960 field
= TREE_OPERAND (op
, 1);
961 type
= DECL_CONTEXT (field
);
962 for (tem
= TYPE_FIELDS (type
); tem
; tem
= TREE_CHAIN (tem
))
966 if (DECL_NONADDRESSABLE_P (tem
)
967 == DECL_NONADDRESSABLE_P (field
)
968 && gimple_compare_field_offset (tem
, field
))
970 if (types_compatible_p (TREE_TYPE (tem
),
977 /* In case of type mismatches across units we can fail
978 to unify some types and thus not find a proper
980 if (tem
== NULL_TREE
)
982 /* Thus, emit a ODR violation warning. */
983 if (warning_at (gimple_location (stmt
), 0,
984 "use of type %<%E%> with two mismatching "
985 "declarations at field %<%E%>",
986 type
, TREE_OPERAND (op
, 1)))
988 if (TYPE_FIELDS (type
))
989 inform (DECL_SOURCE_LOCATION (TYPE_FIELDS (type
)),
990 "original type declared here");
991 inform (DECL_SOURCE_LOCATION (TREE_OPERAND (op
, 1)),
992 "field in mismatching type declared here");
993 if (TYPE_NAME (TREE_TYPE (field
))
994 && (TREE_CODE (TYPE_NAME (TREE_TYPE (field
)))
996 inform (DECL_SOURCE_LOCATION
997 (TYPE_NAME (TREE_TYPE (field
))),
998 "type of field declared here");
1000 && TYPE_NAME (TREE_TYPE (closest_match
))
1001 && (TREE_CODE (TYPE_NAME
1002 (TREE_TYPE (closest_match
))) == TYPE_DECL
))
1003 inform (DECL_SOURCE_LOCATION
1004 (TYPE_NAME (TREE_TYPE (closest_match
))),
1005 "type of mismatching field declared here");
1007 /* And finally fixup the types. */
1008 TREE_OPERAND (op
, 0)
1009 = build1 (VIEW_CONVERT_EXPR
, type
,
1010 TREE_OPERAND (op
, 0));
1013 TREE_OPERAND (op
, 1) = tem
;
1016 op
= TREE_OPERAND (op
, 0);
1022 case GIMPLE_PREDICT
:
1026 internal_error ("bytecode stream: unknown GIMPLE statement tag %s",
1027 lto_tag_name (tag
));
1030 /* Update the properties of symbols, SSA names and labels associated
1032 if (code
== GIMPLE_ASSIGN
|| code
== GIMPLE_CALL
)
1034 tree lhs
= gimple_get_lhs (stmt
);
1035 if (lhs
&& TREE_CODE (lhs
) == SSA_NAME
)
1036 SSA_NAME_DEF_STMT (lhs
) = stmt
;
1038 else if (code
== GIMPLE_LABEL
)
1039 gcc_assert (emit_label_in_global_context_p (gimple_label_label (stmt
))
1040 || DECL_CONTEXT (gimple_label_label (stmt
)) == fn
->decl
);
1041 else if (code
== GIMPLE_ASM
)
1045 for (i
= 0; i
< gimple_asm_noutputs (stmt
); i
++)
1047 tree op
= TREE_VALUE (gimple_asm_output_op (stmt
, i
));
1048 if (TREE_CODE (op
) == SSA_NAME
)
1049 SSA_NAME_DEF_STMT (op
) = stmt
;
1053 /* Reset alias information. */
1054 if (code
== GIMPLE_CALL
)
1055 gimple_call_reset_alias_info (stmt
);
1057 /* Mark the statement modified so its operand vectors can be filled in. */
1058 gimple_set_modified (stmt
, true);
1064 /* Read a basic block with tag TAG from DATA_IN using input block IB.
1065 FN is the function being processed. */
1068 input_bb (struct lto_input_block
*ib
, enum LTO_tags tag
,
1069 struct data_in
*data_in
, struct function
*fn
)
1073 gimple_stmt_iterator bsi
;
1075 /* This routine assumes that CFUN is set to FN, as it needs to call
1076 basic GIMPLE routines that use CFUN. */
1077 gcc_assert (cfun
== fn
);
1079 index
= lto_input_uleb128 (ib
);
1080 bb
= BASIC_BLOCK_FOR_FUNCTION (fn
, index
);
1082 bb
->count
= lto_input_sleb128 (ib
);
1083 bb
->loop_depth
= lto_input_sleb128 (ib
);
1084 bb
->frequency
= lto_input_sleb128 (ib
);
1085 bb
->flags
= lto_input_sleb128 (ib
);
1087 /* LTO_bb1 has statements. LTO_bb0 does not. */
1091 bsi
= gsi_start_bb (bb
);
1092 tag
= input_record_start (ib
);
1095 gimple stmt
= input_gimple_stmt (ib
, data_in
, fn
, tag
);
1097 find_referenced_vars_in (stmt
);
1098 gsi_insert_after (&bsi
, stmt
, GSI_NEW_STMT
);
1100 /* After the statement, expect a 0 delimiter or the EH region
1101 that the previous statement belongs to. */
1102 tag
= input_record_start (ib
);
1103 lto_tag_check_set (tag
, 2, LTO_eh_region
, LTO_null
);
1105 if (tag
== LTO_eh_region
)
1107 HOST_WIDE_INT region
= lto_input_sleb128 (ib
);
1108 gcc_assert (region
== (int) region
);
1109 add_stmt_to_eh_lp (stmt
, region
);
1112 tag
= input_record_start (ib
);
1115 tag
= input_record_start (ib
);
1118 gimple phi
= input_phi (ib
, bb
, data_in
, fn
);
1119 find_referenced_vars_in (phi
);
1120 tag
= input_record_start (ib
);
1124 /* Go through all NODE edges and fixup call_stmt pointers
1125 so they point to STMTS. */
1128 fixup_call_stmt_edges_1 (struct cgraph_node
*node
, gimple
*stmts
)
1130 struct cgraph_edge
*cedge
;
1131 for (cedge
= node
->callees
; cedge
; cedge
= cedge
->next_callee
)
1132 cedge
->call_stmt
= stmts
[cedge
->lto_stmt_uid
];
1133 for (cedge
= node
->indirect_calls
; cedge
; cedge
= cedge
->next_callee
)
1134 cedge
->call_stmt
= stmts
[cedge
->lto_stmt_uid
];
1137 /* Fixup call_stmt pointers in NODE and all clones. */
1140 fixup_call_stmt_edges (struct cgraph_node
*orig
, gimple
*stmts
)
1142 struct cgraph_node
*node
;
1144 while (orig
->clone_of
)
1145 orig
= orig
->clone_of
;
1147 fixup_call_stmt_edges_1 (orig
, stmts
);
1149 for (node
= orig
->clones
; node
!= orig
;)
1151 fixup_call_stmt_edges_1 (node
, stmts
);
1153 node
= node
->clones
;
1154 else if (node
->next_sibling_clone
)
1155 node
= node
->next_sibling_clone
;
1158 while (node
!= orig
&& !node
->next_sibling_clone
)
1159 node
= node
->clone_of
;
1161 node
= node
->next_sibling_clone
;
1166 /* Read the body of function FN_DECL from DATA_IN using input block IB. */
1169 input_function (tree fn_decl
, struct data_in
*data_in
,
1170 struct lto_input_block
*ib
)
1172 struct function
*fn
;
1176 struct bitpack_d bp
;
1177 struct cgraph_node
*node
;
1178 tree args
, narg
, oarg
;
1181 fn
= DECL_STRUCT_FUNCTION (fn_decl
);
1182 tag
= input_record_start (ib
);
1183 clear_line_info (data_in
);
1185 gimple_register_cfg_hooks ();
1186 lto_tag_check (tag
, LTO_function
);
1188 /* Read all the attributes for FN. */
1189 bp
= lto_input_bitpack (ib
);
1190 fn
->is_thunk
= bp_unpack_value (&bp
, 1);
1191 fn
->has_local_explicit_reg_vars
= bp_unpack_value (&bp
, 1);
1192 fn
->after_tree_profile
= bp_unpack_value (&bp
, 1);
1193 fn
->returns_pcc_struct
= bp_unpack_value (&bp
, 1);
1194 fn
->returns_struct
= bp_unpack_value (&bp
, 1);
1195 fn
->can_throw_non_call_exceptions
= bp_unpack_value (&bp
, 1);
1196 fn
->always_inline_functions_inlined
= bp_unpack_value (&bp
, 1);
1197 fn
->after_inlining
= bp_unpack_value (&bp
, 1);
1198 fn
->dont_save_pending_sizes_p
= bp_unpack_value (&bp
, 1);
1199 fn
->stdarg
= bp_unpack_value (&bp
, 1);
1200 fn
->has_nonlocal_label
= bp_unpack_value (&bp
, 1);
1201 fn
->calls_alloca
= bp_unpack_value (&bp
, 1);
1202 fn
->calls_setjmp
= bp_unpack_value (&bp
, 1);
1203 fn
->va_list_fpr_size
= bp_unpack_value (&bp
, 8);
1204 fn
->va_list_gpr_size
= bp_unpack_value (&bp
, 8);
1206 /* Input the function start and end loci. */
1207 fn
->function_start_locus
= lto_input_location (ib
, data_in
);
1208 fn
->function_end_locus
= lto_input_location (ib
, data_in
);
1210 /* Input the current IL state of the function. */
1211 fn
->curr_properties
= lto_input_uleb128 (ib
);
1213 /* Read the static chain and non-local goto save area. */
1214 fn
->static_chain_decl
= lto_input_tree (ib
, data_in
);
1215 fn
->nonlocal_goto_save_area
= lto_input_tree (ib
, data_in
);
1217 /* Read all the local symbols. */
1218 len
= lto_input_sleb128 (ib
);
1222 VEC_safe_grow (tree
, gc
, fn
->local_decls
, len
);
1223 for (i
= 0; i
< len
; i
++)
1225 tree t
= lto_input_tree (ib
, data_in
);
1226 VEC_replace (tree
, fn
->local_decls
, i
, t
);
1230 /* Read all function arguments. We need to re-map them here to the
1231 arguments of the merged function declaration. */
1232 args
= lto_input_tree (ib
, data_in
);
1233 for (oarg
= args
, narg
= DECL_ARGUMENTS (fn_decl
);
1235 oarg
= TREE_CHAIN (oarg
), narg
= TREE_CHAIN (narg
))
1239 res
= lto_streamer_cache_lookup (data_in
->reader_cache
, oarg
, &ix
);
1241 /* Replace the argument in the streamer cache. */
1242 lto_streamer_cache_insert_at (data_in
->reader_cache
, narg
, ix
);
1244 gcc_assert (!oarg
&& !narg
);
1246 /* Read all the SSA names. */
1247 input_ssa_names (ib
, data_in
, fn
);
1249 /* Read the exception handling regions in the function. */
1250 input_eh_regions (ib
, data_in
, fn
);
1252 /* Read the tree of lexical scopes for the function. */
1253 DECL_INITIAL (fn_decl
) = lto_input_tree (ib
, data_in
);
1254 gcc_assert (DECL_INITIAL (fn_decl
));
1255 DECL_SAVED_TREE (fn_decl
) = NULL_TREE
;
1257 /* Read all the basic blocks. */
1258 tag
= input_record_start (ib
);
1261 input_bb (ib
, tag
, data_in
, fn
);
1262 tag
= input_record_start (ib
);
1265 /* Fix up the call statements that are mentioned in the callgraph
1267 renumber_gimple_stmt_uids ();
1268 stmts
= (gimple
*) xcalloc (gimple_stmt_max_uid (fn
), sizeof (gimple
));
1271 gimple_stmt_iterator bsi
= gsi_start_bb (bb
);
1272 while (!gsi_end_p (bsi
))
1274 gimple stmt
= gsi_stmt (bsi
);
1275 /* If we're recompiling LTO objects with debug stmts but
1276 we're not supposed to have debug stmts, remove them now.
1277 We can't remove them earlier because this would cause uid
1278 mismatches in fixups, but we can do it at this point, as
1279 long as debug stmts don't require fixups. */
1280 if (!MAY_HAVE_DEBUG_STMTS
&& is_gimple_debug (stmt
))
1282 gimple_stmt_iterator gsi
= bsi
;
1284 gsi_remove (&gsi
, true);
1289 stmts
[gimple_uid (stmt
)] = stmt
;
1294 /* Set the gimple body to the statement sequence in the entry
1295 basic block. FIXME lto, this is fairly hacky. The existence
1296 of a gimple body is used by the cgraph routines, but we should
1297 really use the presence of the CFG. */
1299 edge_iterator ei
= ei_start (ENTRY_BLOCK_PTR
->succs
);
1300 gimple_set_body (fn_decl
, bb_seq (ei_edge (ei
)->dest
));
1303 node
= cgraph_node (fn_decl
);
1304 fixup_call_stmt_edges (node
, stmts
);
1305 execute_all_ipa_stmt_fixups (node
, stmts
);
1307 update_ssa (TODO_update_ssa_only_virtuals
);
1308 free_dominance_info (CDI_DOMINATORS
);
1309 free_dominance_info (CDI_POST_DOMINATORS
);
1314 /* Read initializer expressions for public statics. DATA_IN is the
1315 file being read. IB is the input block used for reading. */
1318 input_alias_pairs (struct lto_input_block
*ib
, struct data_in
*data_in
)
1322 clear_line_info (data_in
);
1324 /* Skip over all the unreferenced globals. */
1326 var
= lto_input_tree (ib
, data_in
);
1329 var
= lto_input_tree (ib
, data_in
);
1332 const char *orig_name
, *new_name
;
1335 p
= VEC_safe_push (alias_pair
, gc
, alias_pairs
, NULL
);
1337 p
->target
= lto_input_tree (ib
, data_in
);
1339 /* If the target is a static object, we may have registered a
1340 new name for it to avoid clashes between statics coming from
1341 different files. In that case, use the new name. */
1342 orig_name
= IDENTIFIER_POINTER (p
->target
);
1343 new_name
= lto_get_decl_name_mapping (data_in
->file_data
, orig_name
);
1344 if (strcmp (orig_name
, new_name
) != 0)
1345 p
->target
= get_identifier (new_name
);
1347 var
= lto_input_tree (ib
, data_in
);
1352 /* Read the body from DATA for function FN_DECL and fill it in.
1353 FILE_DATA are the global decls and types. SECTION_TYPE is either
1354 LTO_section_function_body or LTO_section_static_initializer. If
1355 section type is LTO_section_function_body, FN must be the decl for
1359 lto_read_body (struct lto_file_decl_data
*file_data
, tree fn_decl
,
1360 const char *data
, enum lto_section_type section_type
)
1362 const struct lto_function_header
*header
;
1363 struct data_in
*data_in
;
1365 int32_t main_offset
;
1366 int32_t string_offset
;
1367 struct lto_input_block ib_cfg
;
1368 struct lto_input_block ib_main
;
1370 header
= (const struct lto_function_header
*) data
;
1371 cfg_offset
= sizeof (struct lto_function_header
);
1372 main_offset
= cfg_offset
+ header
->cfg_size
;
1373 string_offset
= main_offset
+ header
->main_size
;
1375 LTO_INIT_INPUT_BLOCK (ib_cfg
,
1380 LTO_INIT_INPUT_BLOCK (ib_main
,
1385 data_in
= lto_data_in_create (file_data
, data
+ string_offset
,
1386 header
->string_size
, NULL
);
1388 /* Make sure the file was generated by the exact same compiler. */
1389 lto_check_version (header
->lto_header
.major_version
,
1390 header
->lto_header
.minor_version
);
1392 if (section_type
== LTO_section_function_body
)
1394 struct function
*fn
= DECL_STRUCT_FUNCTION (fn_decl
);
1395 struct lto_in_decl_state
*decl_state
;
1400 /* Use the function's decl state. */
1401 decl_state
= lto_get_function_in_decl_state (file_data
, fn_decl
);
1402 gcc_assert (decl_state
);
1403 file_data
->current_decl_state
= decl_state
;
1405 input_cfg (&ib_cfg
, fn
);
1407 /* Set up the struct function. */
1408 input_function (fn_decl
, data_in
, &ib_main
);
1410 /* We should now be in SSA. */
1411 cfun
->gimple_df
->in_ssa_p
= true;
1413 /* Restore decl state */
1414 file_data
->current_decl_state
= file_data
->global_decl_state
;
1420 input_alias_pairs (&ib_main
, data_in
);
1423 clear_line_info (data_in
);
1424 lto_data_in_delete (data_in
);
1428 /* Read the body of FN_DECL using DATA. FILE_DATA holds the global
1432 lto_input_function_body (struct lto_file_decl_data
*file_data
,
1433 tree fn_decl
, const char *data
)
1435 current_function_decl
= fn_decl
;
1436 lto_read_body (file_data
, fn_decl
, data
, LTO_section_function_body
);
1440 /* Read in VAR_DECL using DATA. FILE_DATA holds the global decls and
1444 lto_input_constructors_and_inits (struct lto_file_decl_data
*file_data
,
1447 lto_read_body (file_data
, NULL
, data
, LTO_section_static_initializer
);
1451 /* Return the resolution for the decl with index INDEX from DATA_IN. */
1453 static enum ld_plugin_symbol_resolution
1454 get_resolution (struct data_in
*data_in
, unsigned index
)
1456 if (data_in
->globals_resolution
)
1458 ld_plugin_symbol_resolution_t ret
;
1459 /* We can have references to not emitted functions in
1460 DECL_FUNCTION_PERSONALITY at least. So we can and have
1461 to indeed return LDPR_UNKNOWN in some cases. */
1462 if (VEC_length (ld_plugin_symbol_resolution_t
,
1463 data_in
->globals_resolution
) <= index
)
1464 return LDPR_UNKNOWN
;
1465 ret
= VEC_index (ld_plugin_symbol_resolution_t
,
1466 data_in
->globals_resolution
,
1471 /* Delay resolution finding until decl merging. */
1472 return LDPR_UNKNOWN
;
1476 /* Unpack all the non-pointer fields of the TS_BASE structure of
1477 expression EXPR from bitpack BP. */
1480 unpack_ts_base_value_fields (struct bitpack_d
*bp
, tree expr
)
1482 /* Note that the code for EXPR has already been unpacked to create EXPR in
1483 lto_materialize_tree. */
1486 TREE_SIDE_EFFECTS (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1487 TREE_CONSTANT (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1488 TREE_READONLY (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1490 /* TREE_PUBLIC is used on types to indicate that the type
1491 has a TYPE_CACHED_VALUES vector. This is not streamed out,
1492 so we skip it here. */
1493 TREE_PUBLIC (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1496 bp_unpack_value (bp
, 4);
1497 TREE_ADDRESSABLE (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1498 TREE_THIS_VOLATILE (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1500 DECL_UNSIGNED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1501 else if (TYPE_P (expr
))
1502 TYPE_UNSIGNED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1504 bp_unpack_value (bp
, 1);
1505 TREE_ASM_WRITTEN (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1506 TREE_NO_WARNING (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1507 TREE_USED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1508 TREE_NOTHROW (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1509 TREE_STATIC (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1510 TREE_PRIVATE (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1511 TREE_PROTECTED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1512 TREE_DEPRECATED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1514 TYPE_SATURATING (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1515 else if (TREE_CODE (expr
) == SSA_NAME
)
1516 SSA_NAME_IS_DEFAULT_DEF (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1518 bp_unpack_value (bp
, 1);
1522 /* Unpack all the non-pointer fields of the TS_REAL_CST structure of
1523 expression EXPR from bitpack BP. */
1526 unpack_ts_real_cst_value_fields (struct bitpack_d
*bp
, tree expr
)
1530 REAL_VALUE_TYPE
*rp
;
1532 r
.cl
= (unsigned) bp_unpack_value (bp
, 2);
1533 r
.decimal
= (unsigned) bp_unpack_value (bp
, 1);
1534 r
.sign
= (unsigned) bp_unpack_value (bp
, 1);
1535 r
.signalling
= (unsigned) bp_unpack_value (bp
, 1);
1536 r
.canonical
= (unsigned) bp_unpack_value (bp
, 1);
1537 r
.uexp
= (unsigned) bp_unpack_value (bp
, EXP_BITS
);
1538 for (i
= 0; i
< SIGSZ
; i
++)
1539 r
.sig
[i
] = (unsigned long) bp_unpack_value (bp
, HOST_BITS_PER_LONG
);
1541 rp
= ggc_alloc_real_value ();
1542 memcpy (rp
, &r
, sizeof (REAL_VALUE_TYPE
));
1543 TREE_REAL_CST_PTR (expr
) = rp
;
1547 /* Unpack all the non-pointer fields of the TS_FIXED_CST structure of
1548 expression EXPR from bitpack BP. */
1551 unpack_ts_fixed_cst_value_fields (struct bitpack_d
*bp
, tree expr
)
1553 struct fixed_value fv
;
1555 fv
.data
.low
= (HOST_WIDE_INT
) bp_unpack_value (bp
, HOST_BITS_PER_WIDE_INT
);
1556 fv
.data
.high
= (HOST_WIDE_INT
) bp_unpack_value (bp
, HOST_BITS_PER_WIDE_INT
);
1557 fv
.mode
= (enum machine_mode
) bp_unpack_value (bp
, HOST_BITS_PER_INT
);
1558 TREE_FIXED_CST (expr
) = fv
;
1562 /* Unpack all the non-pointer fields of the TS_DECL_COMMON structure
1563 of expression EXPR from bitpack BP. */
1566 unpack_ts_decl_common_value_fields (struct bitpack_d
*bp
, tree expr
)
1568 DECL_MODE (expr
) = (enum machine_mode
) bp_unpack_value (bp
, 8);
1569 DECL_NONLOCAL (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1570 DECL_VIRTUAL_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1571 DECL_IGNORED_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1572 DECL_ABSTRACT (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1573 DECL_ARTIFICIAL (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1574 DECL_USER_ALIGN (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1575 DECL_PRESERVE_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1576 DECL_DEBUG_EXPR_IS_FROM (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1577 DECL_EXTERNAL (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1578 DECL_GIMPLE_REG_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1579 DECL_ALIGN (expr
) = (unsigned) bp_unpack_value (bp
, HOST_BITS_PER_INT
);
1581 if (TREE_CODE (expr
) == LABEL_DECL
)
1583 DECL_ERROR_ISSUED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1584 EH_LANDING_PAD_NR (expr
) = (int) bp_unpack_value (bp
, HOST_BITS_PER_INT
);
1586 /* Always assume an initial value of -1 for LABEL_DECL_UID to
1587 force gimple_set_bb to recreate label_to_block_map. */
1588 LABEL_DECL_UID (expr
) = -1;
1591 if (TREE_CODE (expr
) == FIELD_DECL
)
1593 unsigned HOST_WIDE_INT off_align
;
1594 DECL_PACKED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1595 DECL_NONADDRESSABLE_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1596 off_align
= (unsigned HOST_WIDE_INT
) bp_unpack_value (bp
, 8);
1597 SET_DECL_OFFSET_ALIGN (expr
, off_align
);
1600 if (TREE_CODE (expr
) == RESULT_DECL
1601 || TREE_CODE (expr
) == PARM_DECL
1602 || TREE_CODE (expr
) == VAR_DECL
)
1604 DECL_BY_REFERENCE (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1605 if (TREE_CODE (expr
) == VAR_DECL
1606 || TREE_CODE (expr
) == PARM_DECL
)
1607 DECL_HAS_VALUE_EXPR_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1608 DECL_RESTRICTED_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1613 /* Unpack all the non-pointer fields of the TS_DECL_WRTL structure
1614 of expression EXPR from bitpack BP. */
1617 unpack_ts_decl_wrtl_value_fields (struct bitpack_d
*bp
, tree expr
)
1619 DECL_REGISTER (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1623 /* Unpack all the non-pointer fields of the TS_DECL_WITH_VIS structure
1624 of expression EXPR from bitpack BP. */
1627 unpack_ts_decl_with_vis_value_fields (struct bitpack_d
*bp
, tree expr
)
1629 DECL_DEFER_OUTPUT (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1630 DECL_COMMON (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1631 DECL_DLLIMPORT_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1632 DECL_WEAK (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1633 DECL_SEEN_IN_BIND_EXPR_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1634 DECL_COMDAT (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1635 DECL_VISIBILITY (expr
) = (enum symbol_visibility
) bp_unpack_value (bp
, 2);
1636 DECL_VISIBILITY_SPECIFIED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1638 if (TREE_CODE (expr
) == VAR_DECL
)
1640 DECL_HARD_REGISTER (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1641 DECL_IN_TEXT_SECTION (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1642 DECL_IN_CONSTANT_POOL (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1643 DECL_TLS_MODEL (expr
) = (enum tls_model
) bp_unpack_value (bp
, 3);
1646 if (VAR_OR_FUNCTION_DECL_P (expr
))
1649 p
= (priority_type
) bp_unpack_value (bp
, HOST_BITS_PER_SHORT
);
1650 SET_DECL_INIT_PRIORITY (expr
, p
);
1655 /* Unpack all the non-pointer fields of the TS_FUNCTION_DECL structure
1656 of expression EXPR from bitpack BP. */
1659 unpack_ts_function_decl_value_fields (struct bitpack_d
*bp
, tree expr
)
1661 DECL_FUNCTION_CODE (expr
) = (enum built_in_function
) bp_unpack_value (bp
, 11);
1662 DECL_BUILT_IN_CLASS (expr
) = (enum built_in_class
) bp_unpack_value (bp
, 2);
1663 DECL_STATIC_CONSTRUCTOR (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1664 DECL_STATIC_DESTRUCTOR (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1665 DECL_UNINLINABLE (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1666 DECL_POSSIBLY_INLINED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1667 DECL_IS_NOVOPS (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1668 DECL_IS_RETURNS_TWICE (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1669 DECL_IS_MALLOC (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1670 DECL_IS_OPERATOR_NEW (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1671 DECL_DECLARED_INLINE_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1672 DECL_STATIC_CHAIN (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1673 DECL_NO_INLINE_WARNING_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1674 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (expr
)
1675 = (unsigned) bp_unpack_value (bp
, 1);
1676 DECL_NO_LIMIT_STACK (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1677 DECL_DISREGARD_INLINE_LIMITS (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1678 DECL_PURE_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1679 DECL_LOOPING_CONST_OR_PURE_P (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1683 /* Unpack all the non-pointer fields of the TS_TYPE structure
1684 of expression EXPR from bitpack BP. */
1687 unpack_ts_type_value_fields (struct bitpack_d
*bp
, tree expr
)
1689 enum machine_mode mode
;
1691 TYPE_PRECISION (expr
) = (unsigned) bp_unpack_value (bp
, 10);
1692 mode
= (enum machine_mode
) bp_unpack_value (bp
, 8);
1693 SET_TYPE_MODE (expr
, mode
);
1694 TYPE_STRING_FLAG (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1695 TYPE_NO_FORCE_BLK (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1696 TYPE_NEEDS_CONSTRUCTING (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1697 if (RECORD_OR_UNION_TYPE_P (expr
))
1698 TYPE_TRANSPARENT_AGGR (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1699 TYPE_PACKED (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1700 TYPE_RESTRICT (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1701 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr
)
1702 = (unsigned) bp_unpack_value (bp
, 2);
1703 TYPE_USER_ALIGN (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1704 TYPE_READONLY (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1705 TYPE_ALIGN (expr
) = (unsigned) bp_unpack_value (bp
, HOST_BITS_PER_INT
);
1706 TYPE_ALIAS_SET (expr
) = bp_unpack_value (bp
, HOST_BITS_PER_INT
);
1710 /* Unpack all the non-pointer fields of the TS_BLOCK structure
1711 of expression EXPR from bitpack BP. */
1714 unpack_ts_block_value_fields (struct bitpack_d
*bp
, tree expr
)
1716 BLOCK_ABSTRACT (expr
) = (unsigned) bp_unpack_value (bp
, 1);
1717 BLOCK_NUMBER (expr
) = (unsigned) bp_unpack_value (bp
, 31);
1720 /* Unpack all the non-pointer fields of the TS_TRANSLATION_UNIT_DECL
1721 structure of expression EXPR from bitpack BP. */
1724 unpack_ts_translation_unit_decl_value_fields (struct bitpack_d
*bp ATTRIBUTE_UNUSED
, tree expr ATTRIBUTE_UNUSED
)
1728 /* Unpack all the non-pointer fields in EXPR into a bit pack. */
1731 unpack_value_fields (struct bitpack_d
*bp
, tree expr
)
1733 enum tree_code code
;
1735 code
= TREE_CODE (expr
);
1737 /* Note that all these functions are highly sensitive to changes in
1738 the types and sizes of each of the fields being packed. */
1739 unpack_ts_base_value_fields (bp
, expr
);
1741 if (CODE_CONTAINS_STRUCT (code
, TS_REAL_CST
))
1742 unpack_ts_real_cst_value_fields (bp
, expr
);
1744 if (CODE_CONTAINS_STRUCT (code
, TS_FIXED_CST
))
1745 unpack_ts_fixed_cst_value_fields (bp
, expr
);
1747 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1748 unpack_ts_decl_common_value_fields (bp
, expr
);
1750 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WRTL
))
1751 unpack_ts_decl_wrtl_value_fields (bp
, expr
);
1753 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WITH_VIS
))
1754 unpack_ts_decl_with_vis_value_fields (bp
, expr
);
1756 if (CODE_CONTAINS_STRUCT (code
, TS_FUNCTION_DECL
))
1757 unpack_ts_function_decl_value_fields (bp
, expr
);
1759 if (CODE_CONTAINS_STRUCT (code
, TS_TYPE
))
1760 unpack_ts_type_value_fields (bp
, expr
);
1762 if (CODE_CONTAINS_STRUCT (code
, TS_BLOCK
))
1763 unpack_ts_block_value_fields (bp
, expr
);
1765 if (CODE_CONTAINS_STRUCT (code
, TS_SSA_NAME
))
1767 /* We only stream the version number of SSA names. */
1771 if (CODE_CONTAINS_STRUCT (code
, TS_STATEMENT_LIST
))
1773 /* This is only used by GENERIC. */
1777 if (CODE_CONTAINS_STRUCT (code
, TS_OMP_CLAUSE
))
1779 /* This is only used by High GIMPLE. */
1783 if (CODE_CONTAINS_STRUCT (code
, TS_TRANSLATION_UNIT_DECL
))
1784 unpack_ts_translation_unit_decl_value_fields (bp
, expr
);
1788 /* Materialize a new tree from input block IB using descriptors in
1789 DATA_IN. The code for the new tree should match TAG. Store in
1790 *IX_P the index into the reader cache where the new tree is stored. */
1793 lto_materialize_tree (struct lto_input_block
*ib
, struct data_in
*data_in
,
1794 enum LTO_tags tag
, int *ix_p
)
1796 struct bitpack_d bp
;
1797 enum tree_code code
;
1799 #ifdef LTO_STREAMER_DEBUG
1800 HOST_WIDEST_INT orig_address_in_writer
;
1806 /* Read the header of the node we are about to create. */
1807 ix
= lto_input_sleb128 (ib
);
1808 gcc_assert ((int) ix
== ix
);
1811 #ifdef LTO_STREAMER_DEBUG
1812 /* Read the word representing the memory address for the tree
1813 as it was written by the writer. This is useful when
1814 debugging differences between the writer and reader. */
1815 orig_address_in_writer
= lto_input_sleb128 (ib
);
1816 gcc_assert ((intptr_t) orig_address_in_writer
== orig_address_in_writer
);
1819 code
= lto_tag_to_tree_code (tag
);
1821 /* We should never see an SSA_NAME tree. Only the version numbers of
1822 SSA names are ever written out. See input_ssa_names. */
1823 gcc_assert (code
!= SSA_NAME
);
1825 /* Instantiate a new tree using the header data. */
1826 if (CODE_CONTAINS_STRUCT (code
, TS_STRING
))
1827 result
= input_string_cst (data_in
, ib
);
1828 else if (CODE_CONTAINS_STRUCT (code
, TS_IDENTIFIER
))
1829 result
= input_identifier (data_in
, ib
);
1830 else if (CODE_CONTAINS_STRUCT (code
, TS_VEC
))
1832 HOST_WIDE_INT len
= lto_input_sleb128 (ib
);
1833 result
= make_tree_vec (len
);
1835 else if (CODE_CONTAINS_STRUCT (code
, TS_BINFO
))
1837 unsigned HOST_WIDE_INT len
= lto_input_uleb128 (ib
);
1838 result
= make_tree_binfo (len
);
1842 /* All other nodes can be materialized with a raw make_node
1844 result
= make_node (code
);
1847 #ifdef LTO_STREAMER_DEBUG
1848 /* Store the original address of the tree as seen by the writer
1849 in RESULT's aux field. This is useful when debugging streaming
1850 problems. This way, a debugging session can be started on
1851 both writer and reader with a breakpoint using this address
1853 lto_orig_address_map (result
, (intptr_t) orig_address_in_writer
);
1856 /* Read the bitpack of non-pointer values from IB. */
1857 bp
= lto_input_bitpack (ib
);
1859 /* The first word in BP contains the code of the tree that we
1860 are about to read. */
1861 code
= (enum tree_code
) bp_unpack_value (&bp
, 16);
1862 lto_tag_check (lto_tree_code_to_tag (code
), tag
);
1864 /* Unpack all the value fields from BP. */
1865 unpack_value_fields (&bp
, result
);
1867 /* Enter RESULT in the reader cache. This will make RESULT
1868 available so that circular references in the rest of the tree
1869 structure can be resolved in subsequent calls to lto_input_tree. */
1870 lto_streamer_cache_insert_at (data_in
->reader_cache
, result
, ix
);
1876 /* Read a chain of tree nodes from input block IB. DATA_IN contains
1877 tables and descriptors for the file being read. */
1880 lto_input_chain (struct lto_input_block
*ib
, struct data_in
*data_in
)
1883 tree first
, prev
, curr
;
1885 first
= prev
= NULL_TREE
;
1886 count
= lto_input_sleb128 (ib
);
1887 for (i
= 0; i
< count
; i
++)
1889 curr
= lto_input_tree (ib
, data_in
);
1891 TREE_CHAIN (prev
) = curr
;
1895 TREE_CHAIN (curr
) = NULL_TREE
;
1903 /* Read all pointer fields in the TS_COMMON structure of EXPR from input
1904 block IB. DATA_IN contains tables and descriptors for the
1909 lto_input_ts_common_tree_pointers (struct lto_input_block
*ib
,
1910 struct data_in
*data_in
, tree expr
)
1912 if (TREE_CODE (expr
) != IDENTIFIER_NODE
)
1913 TREE_TYPE (expr
) = lto_input_tree (ib
, data_in
);
1917 /* Read all pointer fields in the TS_VECTOR structure of EXPR from input
1918 block IB. DATA_IN contains tables and descriptors for the
1922 lto_input_ts_vector_tree_pointers (struct lto_input_block
*ib
,
1923 struct data_in
*data_in
, tree expr
)
1925 TREE_VECTOR_CST_ELTS (expr
) = lto_input_chain (ib
, data_in
);
1929 /* Read all pointer fields in the TS_COMPLEX structure of EXPR from input
1930 block IB. DATA_IN contains tables and descriptors for the
1934 lto_input_ts_complex_tree_pointers (struct lto_input_block
*ib
,
1935 struct data_in
*data_in
, tree expr
)
1937 TREE_REALPART (expr
) = lto_input_tree (ib
, data_in
);
1938 TREE_IMAGPART (expr
) = lto_input_tree (ib
, data_in
);
1942 /* Read all pointer fields in the TS_DECL_MINIMAL structure of EXPR
1943 from input block IB. DATA_IN contains tables and descriptors for the
1947 lto_input_ts_decl_minimal_tree_pointers (struct lto_input_block
*ib
,
1948 struct data_in
*data_in
, tree expr
)
1950 DECL_NAME (expr
) = lto_input_tree (ib
, data_in
);
1951 DECL_CONTEXT (expr
) = lto_input_tree (ib
, data_in
);
1952 /* We do not stream BLOCK_VARS but lazily construct it here. */
1953 if (DECL_CONTEXT (expr
)
1954 && TREE_CODE (DECL_CONTEXT (expr
)) == BLOCK
)
1956 TREE_CHAIN (expr
) = BLOCK_VARS (DECL_CONTEXT (expr
));
1957 BLOCK_VARS (DECL_CONTEXT (expr
)) = expr
;
1959 DECL_SOURCE_LOCATION (expr
) = lto_input_location (ib
, data_in
);
1963 /* Read all pointer fields in the TS_DECL_COMMON structure of EXPR from
1964 input block IB. DATA_IN contains tables and descriptors for the
1968 lto_input_ts_decl_common_tree_pointers (struct lto_input_block
*ib
,
1969 struct data_in
*data_in
, tree expr
)
1971 DECL_SIZE (expr
) = lto_input_tree (ib
, data_in
);
1972 DECL_SIZE_UNIT (expr
) = lto_input_tree (ib
, data_in
);
1974 if (TREE_CODE (expr
) != FUNCTION_DECL
)
1975 DECL_INITIAL (expr
) = lto_input_tree (ib
, data_in
);
1977 DECL_ATTRIBUTES (expr
) = lto_input_tree (ib
, data_in
);
1978 DECL_ABSTRACT_ORIGIN (expr
) = lto_input_tree (ib
, data_in
);
1980 if (TREE_CODE (expr
) == PARM_DECL
)
1981 TREE_CHAIN (expr
) = lto_input_chain (ib
, data_in
);
1983 if ((TREE_CODE (expr
) == VAR_DECL
1984 || TREE_CODE (expr
) == PARM_DECL
)
1985 && DECL_HAS_VALUE_EXPR_P (expr
))
1986 SET_DECL_VALUE_EXPR (expr
, lto_input_tree (ib
, data_in
));
1988 if (TREE_CODE (expr
) == VAR_DECL
)
1990 tree dexpr
= lto_input_tree (ib
, data_in
);
1992 SET_DECL_DEBUG_EXPR (expr
, dexpr
);
1997 /* Read all pointer fields in the TS_DECL_NON_COMMON structure of
1998 EXPR from input block IB. DATA_IN contains tables and descriptors for the
2002 lto_input_ts_decl_non_common_tree_pointers (struct lto_input_block
*ib
,
2003 struct data_in
*data_in
, tree expr
)
2005 if (TREE_CODE (expr
) == FUNCTION_DECL
)
2007 DECL_ARGUMENTS (expr
) = lto_input_tree (ib
, data_in
);
2008 DECL_RESULT (expr
) = lto_input_tree (ib
, data_in
);
2010 DECL_VINDEX (expr
) = lto_input_tree (ib
, data_in
);
2014 /* Read all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
2015 from input block IB. DATA_IN contains tables and descriptors for the
2019 lto_input_ts_decl_with_vis_tree_pointers (struct lto_input_block
*ib
,
2020 struct data_in
*data_in
, tree expr
)
2024 id
= lto_input_tree (ib
, data_in
);
2027 gcc_assert (TREE_CODE (id
) == IDENTIFIER_NODE
);
2028 SET_DECL_ASSEMBLER_NAME (expr
, id
);
2031 DECL_SECTION_NAME (expr
) = lto_input_tree (ib
, data_in
);
2032 DECL_COMDAT_GROUP (expr
) = lto_input_tree (ib
, data_in
);
2036 /* Read all pointer fields in the TS_FIELD_DECL structure of EXPR from
2037 input block IB. DATA_IN contains tables and descriptors for the
2041 lto_input_ts_field_decl_tree_pointers (struct lto_input_block
*ib
,
2042 struct data_in
*data_in
, tree expr
)
2044 DECL_FIELD_OFFSET (expr
) = lto_input_tree (ib
, data_in
);
2045 DECL_BIT_FIELD_TYPE (expr
) = lto_input_tree (ib
, data_in
);
2046 DECL_QUALIFIER (expr
) = lto_input_tree (ib
, data_in
);
2047 DECL_FIELD_BIT_OFFSET (expr
) = lto_input_tree (ib
, data_in
);
2048 DECL_FCONTEXT (expr
) = lto_input_tree (ib
, data_in
);
2049 TREE_CHAIN (expr
) = lto_input_chain (ib
, data_in
);
2053 /* Read all pointer fields in the TS_FUNCTION_DECL structure of EXPR
2054 from input block IB. DATA_IN contains tables and descriptors for the
2058 lto_input_ts_function_decl_tree_pointers (struct lto_input_block
*ib
,
2059 struct data_in
*data_in
, tree expr
)
2061 /* DECL_STRUCT_FUNCTION is handled by lto_input_function. FIXME lto,
2062 maybe it should be handled here? */
2063 DECL_FUNCTION_PERSONALITY (expr
) = lto_input_tree (ib
, data_in
);
2064 DECL_FUNCTION_SPECIFIC_TARGET (expr
) = lto_input_tree (ib
, data_in
);
2065 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr
) = lto_input_tree (ib
, data_in
);
2067 /* If the file contains a function with an EH personality set,
2068 then it was compiled with -fexceptions. In that case, initialize
2069 the backend EH machinery. */
2070 if (DECL_FUNCTION_PERSONALITY (expr
))
2075 /* Read all pointer fields in the TS_TYPE structure of EXPR from input
2076 block IB. DATA_IN contains tables and descriptors for the
2080 lto_input_ts_type_tree_pointers (struct lto_input_block
*ib
,
2081 struct data_in
*data_in
, tree expr
)
2083 if (TREE_CODE (expr
) == ENUMERAL_TYPE
)
2084 TYPE_VALUES (expr
) = lto_input_tree (ib
, data_in
);
2085 else if (TREE_CODE (expr
) == ARRAY_TYPE
)
2086 TYPE_DOMAIN (expr
) = lto_input_tree (ib
, data_in
);
2087 else if (RECORD_OR_UNION_TYPE_P (expr
))
2088 TYPE_FIELDS (expr
) = lto_input_tree (ib
, data_in
);
2089 else if (TREE_CODE (expr
) == FUNCTION_TYPE
2090 || TREE_CODE (expr
) == METHOD_TYPE
)
2091 TYPE_ARG_TYPES (expr
) = lto_input_tree (ib
, data_in
);
2093 TYPE_SIZE (expr
) = lto_input_tree (ib
, data_in
);
2094 TYPE_SIZE_UNIT (expr
) = lto_input_tree (ib
, data_in
);
2095 TYPE_ATTRIBUTES (expr
) = lto_input_tree (ib
, data_in
);
2096 TYPE_NAME (expr
) = lto_input_tree (ib
, data_in
);
2097 /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO nor
2098 TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. */
2099 if (!POINTER_TYPE_P (expr
))
2100 TYPE_MINVAL (expr
) = lto_input_tree (ib
, data_in
);
2101 TYPE_MAXVAL (expr
) = lto_input_tree (ib
, data_in
);
2102 TYPE_MAIN_VARIANT (expr
) = lto_input_tree (ib
, data_in
);
2103 /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
2105 if (RECORD_OR_UNION_TYPE_P (expr
))
2106 TYPE_BINFO (expr
) = lto_input_tree (ib
, data_in
);
2107 TYPE_CONTEXT (expr
) = lto_input_tree (ib
, data_in
);
2108 /* TYPE_CANONICAL gets re-computed during type merging. */
2109 TYPE_CANONICAL (expr
) = NULL_TREE
;
2110 TYPE_STUB_DECL (expr
) = lto_input_tree (ib
, data_in
);
2114 /* Read all pointer fields in the TS_LIST structure of EXPR from input
2115 block IB. DATA_IN contains tables and descriptors for the
2119 lto_input_ts_list_tree_pointers (struct lto_input_block
*ib
,
2120 struct data_in
*data_in
, tree expr
)
2122 TREE_PURPOSE (expr
) = lto_input_tree (ib
, data_in
);
2123 TREE_VALUE (expr
) = lto_input_tree (ib
, data_in
);
2124 TREE_CHAIN (expr
) = lto_input_chain (ib
, data_in
);
2128 /* Read all pointer fields in the TS_VEC structure of EXPR from input
2129 block IB. DATA_IN contains tables and descriptors for the
2133 lto_input_ts_vec_tree_pointers (struct lto_input_block
*ib
,
2134 struct data_in
*data_in
, tree expr
)
2138 /* Note that TREE_VEC_LENGTH was read by lto_materialize_tree to
2139 instantiate EXPR. */
2140 for (i
= 0; i
< TREE_VEC_LENGTH (expr
); i
++)
2141 TREE_VEC_ELT (expr
, i
) = lto_input_tree (ib
, data_in
);
2145 /* Read all pointer fields in the TS_EXP structure of EXPR from input
2146 block IB. DATA_IN contains tables and descriptors for the
2151 lto_input_ts_exp_tree_pointers (struct lto_input_block
*ib
,
2152 struct data_in
*data_in
, tree expr
)
2157 length
= lto_input_sleb128 (ib
);
2158 gcc_assert (length
== TREE_OPERAND_LENGTH (expr
));
2160 for (i
= 0; i
< length
; i
++)
2161 TREE_OPERAND (expr
, i
) = lto_input_tree (ib
, data_in
);
2163 loc
= lto_input_location (ib
, data_in
);
2164 SET_EXPR_LOCATION (expr
, loc
);
2165 TREE_BLOCK (expr
) = lto_input_tree (ib
, data_in
);
2169 /* Read all pointer fields in the TS_BLOCK structure of EXPR from input
2170 block IB. DATA_IN contains tables and descriptors for the
2174 lto_input_ts_block_tree_pointers (struct lto_input_block
*ib
,
2175 struct data_in
*data_in
, tree expr
)
2179 BLOCK_SOURCE_LOCATION (expr
) = lto_input_location (ib
, data_in
);
2180 /* We do not stream BLOCK_VARS but lazily construct it when reading
2183 len
= lto_input_uleb128 (ib
);
2186 VEC_reserve_exact (tree
, gc
, BLOCK_NONLOCALIZED_VARS (expr
), len
);
2187 for (i
= 0; i
< len
; i
++)
2189 tree t
= lto_input_tree (ib
, data_in
);
2190 VEC_quick_push (tree
, BLOCK_NONLOCALIZED_VARS (expr
), t
);
2194 BLOCK_SUPERCONTEXT (expr
) = lto_input_tree (ib
, data_in
);
2195 BLOCK_ABSTRACT_ORIGIN (expr
) = lto_input_tree (ib
, data_in
);
2196 BLOCK_FRAGMENT_ORIGIN (expr
) = lto_input_tree (ib
, data_in
);
2197 BLOCK_FRAGMENT_CHAIN (expr
) = lto_input_tree (ib
, data_in
);
2198 /* We re-compute BLOCK_SUBBLOCKS of our parent here instead
2199 of streaming it. For non-BLOCK BLOCK_SUPERCONTEXTs we still
2200 stream the child relationship explicitly. */
2201 if (BLOCK_SUPERCONTEXT (expr
)
2202 && TREE_CODE (BLOCK_SUPERCONTEXT (expr
)) == BLOCK
)
2204 BLOCK_CHAIN (expr
) = BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr
));
2205 BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr
)) = expr
;
2210 /* Read all pointer fields in the TS_BINFO structure of EXPR from input
2211 block IB. DATA_IN contains tables and descriptors for the
2215 lto_input_ts_binfo_tree_pointers (struct lto_input_block
*ib
,
2216 struct data_in
*data_in
, tree expr
)
2221 /* Note that the number of slots in EXPR was read in
2222 lto_materialize_tree when instantiating EXPR. However, the
2223 vector is empty so we cannot rely on VEC_length to know how many
2224 elements to read. So, this list is emitted as a 0-terminated
2225 list on the writer side. */
2228 t
= lto_input_tree (ib
, data_in
);
2230 VEC_quick_push (tree
, BINFO_BASE_BINFOS (expr
), t
);
2234 BINFO_OFFSET (expr
) = lto_input_tree (ib
, data_in
);
2235 BINFO_VTABLE (expr
) = lto_input_tree (ib
, data_in
);
2236 BINFO_VIRTUALS (expr
) = lto_input_tree (ib
, data_in
);
2237 BINFO_VPTR_FIELD (expr
) = lto_input_tree (ib
, data_in
);
2239 len
= lto_input_uleb128 (ib
);
2242 VEC_reserve_exact (tree
, gc
, BINFO_BASE_ACCESSES (expr
), len
);
2243 for (i
= 0; i
< len
; i
++)
2245 tree a
= lto_input_tree (ib
, data_in
);
2246 VEC_quick_push (tree
, BINFO_BASE_ACCESSES (expr
), a
);
2250 BINFO_INHERITANCE_CHAIN (expr
) = lto_input_tree (ib
, data_in
);
2251 BINFO_SUBVTT_INDEX (expr
) = lto_input_tree (ib
, data_in
);
2252 BINFO_VPTR_INDEX (expr
) = lto_input_tree (ib
, data_in
);
2256 /* Read all pointer fields in the TS_CONSTRUCTOR structure of EXPR from
2257 input block IB. DATA_IN contains tables and descriptors for the
2261 lto_input_ts_constructor_tree_pointers (struct lto_input_block
*ib
,
2262 struct data_in
*data_in
, tree expr
)
2266 len
= lto_input_uleb128 (ib
);
2267 for (i
= 0; i
< len
; i
++)
2271 index
= lto_input_tree (ib
, data_in
);
2272 value
= lto_input_tree (ib
, data_in
);
2273 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (expr
), index
, value
);
2278 /* Input a TS_TARGET_OPTION tree from IB into EXPR. */
2281 lto_input_ts_target_option (struct lto_input_block
*ib
, tree expr
)
2284 struct bitpack_d bp
;
2285 struct cl_target_option
*t
= TREE_TARGET_OPTION (expr
);
2287 bp
= lto_input_bitpack (ib
);
2288 len
= sizeof (struct cl_target_option
);
2289 for (i
= 0; i
< len
; i
++)
2290 ((unsigned char *)t
)[i
] = bp_unpack_value (&bp
, 8);
2291 if (bp_unpack_value (&bp
, 32) != 0x12345678)
2292 fatal_error ("cl_target_option size mismatch in LTO reader and writer");
2295 /* Input a TS_TRANSLATION_UNIT_DECL tree from IB and DATA_IN into EXPR. */
2298 lto_input_ts_translation_unit_decl_tree_pointers (struct lto_input_block
*ib
,
2299 struct data_in
*data_in
,
2302 TRANSLATION_UNIT_LANGUAGE (expr
) = xstrdup (input_string (data_in
, ib
));
2303 VEC_safe_push (tree
, gc
, all_translation_units
, expr
);
2306 /* Helper for lto_input_tree. Read all pointer fields in EXPR from
2307 input block IB. DATA_IN contains tables and descriptors for the
2311 lto_input_tree_pointers (struct lto_input_block
*ib
, struct data_in
*data_in
,
2314 enum tree_code code
;
2316 code
= TREE_CODE (expr
);
2318 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
2319 lto_input_ts_common_tree_pointers (ib
, data_in
, expr
);
2321 if (CODE_CONTAINS_STRUCT (code
, TS_VECTOR
))
2322 lto_input_ts_vector_tree_pointers (ib
, data_in
, expr
);
2324 if (CODE_CONTAINS_STRUCT (code
, TS_COMPLEX
))
2325 lto_input_ts_complex_tree_pointers (ib
, data_in
, expr
);
2327 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_MINIMAL
))
2328 lto_input_ts_decl_minimal_tree_pointers (ib
, data_in
, expr
);
2330 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
2331 lto_input_ts_decl_common_tree_pointers (ib
, data_in
, expr
);
2333 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_NON_COMMON
))
2334 lto_input_ts_decl_non_common_tree_pointers (ib
, data_in
, expr
);
2336 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WITH_VIS
))
2337 lto_input_ts_decl_with_vis_tree_pointers (ib
, data_in
, expr
);
2339 if (CODE_CONTAINS_STRUCT (code
, TS_FIELD_DECL
))
2340 lto_input_ts_field_decl_tree_pointers (ib
, data_in
, expr
);
2342 if (CODE_CONTAINS_STRUCT (code
, TS_FUNCTION_DECL
))
2343 lto_input_ts_function_decl_tree_pointers (ib
, data_in
, expr
);
2345 if (CODE_CONTAINS_STRUCT (code
, TS_TYPE
))
2346 lto_input_ts_type_tree_pointers (ib
, data_in
, expr
);
2348 if (CODE_CONTAINS_STRUCT (code
, TS_LIST
))
2349 lto_input_ts_list_tree_pointers (ib
, data_in
, expr
);
2351 if (CODE_CONTAINS_STRUCT (code
, TS_VEC
))
2352 lto_input_ts_vec_tree_pointers (ib
, data_in
, expr
);
2354 if (CODE_CONTAINS_STRUCT (code
, TS_EXP
))
2355 lto_input_ts_exp_tree_pointers (ib
, data_in
, expr
);
2357 if (CODE_CONTAINS_STRUCT (code
, TS_SSA_NAME
))
2359 /* We only stream the version number of SSA names. */
2363 if (CODE_CONTAINS_STRUCT (code
, TS_BLOCK
))
2364 lto_input_ts_block_tree_pointers (ib
, data_in
, expr
);
2366 if (CODE_CONTAINS_STRUCT (code
, TS_BINFO
))
2367 lto_input_ts_binfo_tree_pointers (ib
, data_in
, expr
);
2369 if (CODE_CONTAINS_STRUCT (code
, TS_STATEMENT_LIST
))
2371 /* This should only appear in GENERIC. */
2375 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
2376 lto_input_ts_constructor_tree_pointers (ib
, data_in
, expr
);
2378 if (CODE_CONTAINS_STRUCT (code
, TS_OMP_CLAUSE
))
2380 /* This should only appear in High GIMPLE. */
2384 if (CODE_CONTAINS_STRUCT (code
, TS_OPTIMIZATION
))
2386 sorry ("optimization options not supported yet");
2389 if (CODE_CONTAINS_STRUCT (code
, TS_TARGET_OPTION
))
2390 lto_input_ts_target_option (ib
, expr
);
2392 if (CODE_CONTAINS_STRUCT (code
, TS_TRANSLATION_UNIT_DECL
))
2393 lto_input_ts_translation_unit_decl_tree_pointers (ib
, data_in
, expr
);
2397 /* Register DECL with the global symbol table and change its
2398 name if necessary to avoid name clashes for static globals across
2402 lto_register_var_decl_in_symtab (struct data_in
*data_in
, tree decl
)
2406 /* Variable has file scope, not local. Need to ensure static variables
2407 between different files don't clash unexpectedly. */
2408 if (!TREE_PUBLIC (decl
)
2409 && !((context
= decl_function_context (decl
))
2410 && auto_var_in_fn_p (decl
, context
)))
2412 /* ??? We normally pre-mangle names before we serialize them
2413 out. Here, in lto1, we do not know the language, and
2414 thus cannot do the mangling again. Instead, we just
2415 append a suffix to the mangled name. The resulting name,
2416 however, is not a properly-formed mangled name, and will
2417 confuse any attempt to unmangle it. */
2418 const char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
2421 ASM_FORMAT_PRIVATE_NAME (label
, name
, DECL_UID (decl
));
2422 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (label
));
2423 rest_of_decl_compilation (decl
, 1, 0);
2426 /* If this variable has already been declared, queue the
2427 declaration for merging. */
2428 if (TREE_PUBLIC (decl
))
2431 if (!lto_streamer_cache_lookup (data_in
->reader_cache
, decl
, &ix
))
2433 lto_symtab_register_decl (decl
, get_resolution (data_in
, ix
),
2434 data_in
->file_data
);
2440 /* Register DECL with the global symbol table and change its
2441 name if necessary to avoid name clashes for static globals across
2442 different files. DATA_IN contains descriptors and tables for the
2446 lto_register_function_decl_in_symtab (struct data_in
*data_in
, tree decl
)
2448 /* Need to ensure static entities between different files
2449 don't clash unexpectedly. */
2450 if (!TREE_PUBLIC (decl
))
2452 /* We must not use the DECL_ASSEMBLER_NAME macro here, as it
2453 may set the assembler name where it was previously empty. */
2454 tree old_assembler_name
= decl
->decl_with_vis
.assembler_name
;
2456 /* FIXME lto: We normally pre-mangle names before we serialize
2457 them out. Here, in lto1, we do not know the language, and
2458 thus cannot do the mangling again. Instead, we just append a
2459 suffix to the mangled name. The resulting name, however, is
2460 not a properly-formed mangled name, and will confuse any
2461 attempt to unmangle it. */
2462 const char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
2465 ASM_FORMAT_PRIVATE_NAME (label
, name
, DECL_UID (decl
));
2466 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (label
));
2468 /* We may arrive here with the old assembler name not set
2469 if the function body is not needed, e.g., it has been
2470 inlined away and does not appear in the cgraph. */
2471 if (old_assembler_name
)
2473 tree new_assembler_name
= DECL_ASSEMBLER_NAME (decl
);
2475 /* Make the original assembler name available for later use.
2476 We may have used it to indicate the section within its
2477 object file where the function body may be found.
2478 FIXME lto: Find a better way to maintain the function decl
2479 to body section mapping so we don't need this hack. */
2480 lto_record_renamed_decl (data_in
->file_data
,
2481 IDENTIFIER_POINTER (old_assembler_name
),
2482 IDENTIFIER_POINTER (new_assembler_name
));
2484 /* Also register the reverse mapping so that we can find the
2485 new name given to an existing assembler name (used when
2486 restoring alias pairs in input_constructors_or_inits. */
2487 lto_record_renamed_decl (data_in
->file_data
,
2488 IDENTIFIER_POINTER (new_assembler_name
),
2489 IDENTIFIER_POINTER (old_assembler_name
));
2493 /* If this variable has already been declared, queue the
2494 declaration for merging. */
2495 if (TREE_PUBLIC (decl
) && !DECL_ABSTRACT (decl
))
2498 if (!lto_streamer_cache_lookup (data_in
->reader_cache
, decl
, &ix
))
2500 lto_symtab_register_decl (decl
, get_resolution (data_in
, ix
),
2501 data_in
->file_data
);
2506 /* Read an index IX from input block IB and return the tree node at
2507 DATA_IN->FILE_DATA->GLOBALS_INDEX[IX]. */
2510 lto_get_pickled_tree (struct lto_input_block
*ib
, struct data_in
*data_in
)
2514 enum LTO_tags expected_tag
;
2515 unsigned HOST_WIDE_INT orig_offset
;
2517 ix
= lto_input_sleb128 (ib
);
2518 expected_tag
= (enum LTO_tags
) lto_input_uleb128 (ib
);
2520 orig_offset
= lto_input_uleb128 (ib
);
2521 gcc_assert (orig_offset
== (unsigned) orig_offset
);
2523 result
= lto_streamer_cache_get (data_in
->reader_cache
, ix
);
2524 if (result
== NULL_TREE
)
2526 /* We have not yet read the cache slot IX. Go to the offset
2527 in the stream where the physical tree node is, and materialize
2529 struct lto_input_block fwd_ib
;
2531 /* If we are trying to go back in the stream, something is wrong.
2532 We should've read the node at the earlier position already. */
2533 if (ib
->p
>= orig_offset
)
2534 internal_error ("bytecode stream: tried to jump backwards in the "
2537 LTO_INIT_INPUT_BLOCK (fwd_ib
, ib
->data
, orig_offset
, ib
->len
);
2538 result
= lto_input_tree (&fwd_ib
, data_in
);
2542 && TREE_CODE (result
) == lto_tag_to_tree_code (expected_tag
));
2548 /* Read a code and class from input block IB and return the
2549 corresponding builtin. DATA_IN is as in lto_input_tree. */
2552 lto_get_builtin_tree (struct lto_input_block
*ib
, struct data_in
*data_in
)
2554 enum built_in_class fclass
;
2555 enum built_in_function fcode
;
2556 const char *asmname
;
2560 fclass
= (enum built_in_class
) lto_input_uleb128 (ib
);
2561 gcc_assert (fclass
== BUILT_IN_NORMAL
|| fclass
== BUILT_IN_MD
);
2563 fcode
= (enum built_in_function
) lto_input_uleb128 (ib
);
2565 ix
= lto_input_sleb128 (ib
);
2566 gcc_assert (ix
== (int) ix
);
2568 if (fclass
== BUILT_IN_NORMAL
)
2570 gcc_assert (fcode
< END_BUILTINS
);
2571 result
= built_in_decls
[fcode
];
2572 gcc_assert (result
);
2574 else if (fclass
== BUILT_IN_MD
)
2576 result
= targetm
.builtin_decl (fcode
, true);
2577 if (!result
|| result
== error_mark_node
)
2578 fatal_error ("target specific builtin not available");
2583 asmname
= input_string (data_in
, ib
);
2585 set_builtin_user_assembler_name (result
, asmname
);
2587 lto_streamer_cache_insert_at (data_in
->reader_cache
, result
, ix
);
2593 /* Read the physical representation of a tree node with tag TAG from
2594 input block IB using the per-file context in DATA_IN. */
2597 lto_read_tree (struct lto_input_block
*ib
, struct data_in
*data_in
,
2603 result
= lto_materialize_tree (ib
, data_in
, tag
, &ix
);
2605 /* Read all the pointer fields in RESULT. */
2606 lto_input_tree_pointers (ib
, data_in
, result
);
2608 /* We should never try to instantiate an MD or NORMAL builtin here. */
2609 if (TREE_CODE (result
) == FUNCTION_DECL
)
2610 gcc_assert (!lto_stream_as_builtin_p (result
));
2612 if (TREE_CODE (result
) == VAR_DECL
)
2613 lto_register_var_decl_in_symtab (data_in
, result
);
2614 else if (TREE_CODE (result
) == FUNCTION_DECL
&& !DECL_BUILT_IN (result
))
2615 lto_register_function_decl_in_symtab (data_in
, result
);
2617 /* end_marker = */ lto_input_1_unsigned (ib
);
2619 #ifdef LTO_STREAMER_DEBUG
2620 /* Remove the mapping to RESULT's original address set by
2621 lto_materialize_tree. */
2622 lto_orig_address_remove (result
);
2629 /* Read and INTEGER_CST node from input block IB using the per-file
2630 context in DATA_IN. */
2633 lto_input_integer_cst (struct lto_input_block
*ib
, struct data_in
*data_in
)
2636 HOST_WIDE_INT low
, high
;
2639 type
= lto_input_tree (ib
, data_in
);
2640 overflow_p
= (lto_input_1_unsigned (ib
) != 0);
2641 low
= lto_input_uleb128 (ib
);
2642 high
= lto_input_uleb128 (ib
);
2643 result
= build_int_cst_wide (type
, low
, high
);
2645 /* If the original constant had overflown, build a replica of RESULT to
2646 avoid modifying the shared constant returned by build_int_cst_wide. */
2649 result
= copy_node (result
);
2650 TREE_OVERFLOW (result
) = 1;
2657 /* Read a tree from input block IB using the per-file context in
2658 DATA_IN. This context is used, for example, to resolve references
2659 to previously read nodes. */
2662 lto_input_tree (struct lto_input_block
*ib
, struct data_in
*data_in
)
2667 tag
= input_record_start (ib
);
2668 gcc_assert ((unsigned) tag
< (unsigned) LTO_NUM_TAGS
);
2670 if (tag
== LTO_null
)
2672 else if (tag
>= LTO_field_decl_ref
&& tag
<= LTO_global_decl_ref
)
2674 /* If TAG is a reference to an indexable tree, the next value
2675 in IB is the index into the table where we expect to find
2677 result
= lto_input_tree_ref (ib
, data_in
, cfun
, tag
);
2679 else if (tag
== LTO_tree_pickle_reference
)
2681 /* If TAG is a reference to a previously read tree, look it up in
2682 the reader cache. */
2683 result
= lto_get_pickled_tree (ib
, data_in
);
2685 else if (tag
== LTO_builtin_decl
)
2687 /* If we are going to read a built-in function, all we need is
2688 the code and class. */
2689 result
= lto_get_builtin_tree (ib
, data_in
);
2691 else if (tag
== lto_tree_code_to_tag (INTEGER_CST
))
2693 /* For integer constants we only need the type and its hi/low
2695 result
= lto_input_integer_cst (ib
, data_in
);
2699 /* Otherwise, materialize a new node from IB. */
2700 result
= lto_read_tree (ib
, data_in
, tag
);
2707 /* Initialization for the LTO reader. */
2710 lto_init_reader (void)
2712 lto_streamer_init ();
2714 memset (<o_stats
, 0, sizeof (lto_stats
));
2715 bitmap_obstack_initialize (NULL
);
2717 file_name_hash_table
= htab_create (37, hash_string_slot_node
,
2718 eq_string_slot_node
, free
);
2720 gimple_register_cfg_hooks ();
2724 /* Create a new data_in object for FILE_DATA. STRINGS is the string
2725 table to use with LEN strings. RESOLUTIONS is the vector of linker
2726 resolutions (NULL if not using a linker plugin). */
2729 lto_data_in_create (struct lto_file_decl_data
*file_data
, const char *strings
,
2731 VEC(ld_plugin_symbol_resolution_t
,heap
) *resolutions
)
2733 struct data_in
*data_in
= XCNEW (struct data_in
);
2734 data_in
->file_data
= file_data
;
2735 data_in
->strings
= strings
;
2736 data_in
->strings_len
= len
;
2737 data_in
->globals_resolution
= resolutions
;
2738 data_in
->reader_cache
= lto_streamer_cache_create ();
2744 /* Remove DATA_IN. */
2747 lto_data_in_delete (struct data_in
*data_in
)
2749 VEC_free (ld_plugin_symbol_resolution_t
, heap
, data_in
->globals_resolution
);
2750 lto_streamer_cache_delete (data_in
->reader_cache
);
2751 free (data_in
->labels
);