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 ix_u = lto_input_uleb128 (ib);
359 result = lto_file_decl_data_get_var_decl (data_in->file_data, ix_u);
372 /* Read and return a double-linked list of catch handlers from input
373 block IB, using descriptors in DATA_IN. */
375 static struct eh_catch_d *
376 lto_input_eh_catch_list (struct lto_input_block *ib, struct data_in *data_in,
382 *last_p = first = NULL;
383 tag = input_record_start (ib);
389 lto_tag_check_range (tag, LTO_eh_catch, LTO_eh_catch);
391 /* Read the catch node. */
392 n = GGC_CNEW (struct eh_catch_d);
393 n->type_list = lto_input_tree (ib, data_in);
394 n->filter_list = lto_input_tree (ib, data_in);
395 n->label = lto_input_tree (ib, data_in);
397 /* Register all the types in N->FILTER_LIST. */
398 for (list = n->filter_list; list; list = TREE_CHAIN (list))
399 add_type_for_runtime (TREE_VALUE (list));
401 /* Chain N to the end of the list. */
403 (*last_p)->next_catch = n;
404 n->prev_catch = *last_p;
407 /* Set the head of the list the first time through the loop. */
411 tag = input_record_start (ib);
418 /* Read and return EH region IX from input block IB, using descriptors
422 input_eh_region (struct lto_input_block *ib, struct data_in *data_in, int ix)
427 /* Read the region header. */
428 tag = input_record_start (ib);
432 r = GGC_CNEW (struct eh_region_d);
433 r->index = lto_input_sleb128 (ib);
435 gcc_assert (r->index == ix);
437 /* Read all the region pointers as region numbers. We'll fix up
438 the pointers once the whole array has been read. */
439 r->outer = (eh_region) (intptr_t) lto_input_sleb128 (ib);
440 r->inner = (eh_region) (intptr_t) lto_input_sleb128 (ib);
441 r->next_peer = (eh_region) (intptr_t) lto_input_sleb128 (ib);
445 case LTO_ert_cleanup:
446 r->type = ERT_CLEANUP;
451 struct eh_catch_d *last_catch;
453 r->u.eh_try.first_catch = lto_input_eh_catch_list (ib, data_in,
455 r->u.eh_try.last_catch = last_catch;
459 case LTO_ert_allowed_exceptions:
463 r->type = ERT_ALLOWED_EXCEPTIONS;
464 r->u.allowed.type_list = lto_input_tree (ib, data_in);
465 r->u.allowed.label = lto_input_tree (ib, data_in);
466 r->u.allowed.filter = lto_input_uleb128 (ib);
468 for (l = r->u.allowed.type_list; l ; l = TREE_CHAIN (l))
469 add_type_for_runtime (TREE_VALUE (l));
473 case LTO_ert_must_not_throw:
474 r->type = ERT_MUST_NOT_THROW;
475 r->u.must_not_throw.failure_decl = lto_input_tree (ib, data_in);
476 r->u.must_not_throw.failure_loc = lto_input_location (ib, data_in);
483 r->landing_pads = (eh_landing_pad) (intptr_t) lto_input_sleb128 (ib);
489 /* Read and return EH landing pad IX from input block IB, using descriptors
492 static eh_landing_pad
493 input_eh_lp (struct lto_input_block *ib, struct data_in *data_in, int ix)
498 /* Read the landing pad header. */
499 tag = input_record_start (ib);
503 lto_tag_check_range (tag, LTO_eh_landing_pad, LTO_eh_landing_pad);
505 lp = GGC_CNEW (struct eh_landing_pad_d);
506 lp->index = lto_input_sleb128 (ib);
507 gcc_assert (lp->index == ix);
508 lp->next_lp = (eh_landing_pad) (intptr_t) lto_input_sleb128 (ib);
509 lp->region = (eh_region) (intptr_t) lto_input_sleb128 (ib);
510 lp->post_landing_pad = lto_input_tree (ib, data_in);
516 /* After reading the EH regions, pointers to peer and children regions
517 are region numbers. This converts all these region numbers into
518 real pointers into the rematerialized regions for FN. ROOT_REGION
519 is the region number for the root EH region in FN. */
522 fixup_eh_region_pointers (struct function *fn, HOST_WIDE_INT root_region)
525 VEC(eh_region,gc) *eh_array = fn->eh->region_array;
526 VEC(eh_landing_pad,gc) *lp_array = fn->eh->lp_array;
530 gcc_assert (eh_array && lp_array);
532 gcc_assert (root_region >= 0);
533 fn->eh->region_tree = VEC_index (eh_region, eh_array, root_region);
535 #define FIXUP_EH_REGION(r) (r) = VEC_index (eh_region, eh_array, \
536 (HOST_WIDE_INT) (intptr_t) (r))
537 #define FIXUP_EH_LP(p) (p) = VEC_index (eh_landing_pad, lp_array, \
538 (HOST_WIDE_INT) (intptr_t) (p))
540 /* Convert all the index numbers stored in pointer fields into
541 pointers to the corresponding slots in the EH region array. */
542 for (i = 0; VEC_iterate (eh_region, eh_array, i, r); i++)
544 /* The array may contain NULL regions. */
548 gcc_assert (i == (unsigned) r->index);
549 FIXUP_EH_REGION (r->outer);
550 FIXUP_EH_REGION (r->inner);
551 FIXUP_EH_REGION (r->next_peer);
552 FIXUP_EH_LP (r->landing_pads);
555 /* Convert all the index numbers stored in pointer fields into
556 pointers to the corresponding slots in the EH landing pad array. */
557 for (i = 0; VEC_iterate (eh_landing_pad, lp_array, i, lp); i++)
559 /* The array may contain NULL landing pads. */
563 gcc_assert (i == (unsigned) lp->index);
564 FIXUP_EH_LP (lp->next_lp);
565 FIXUP_EH_REGION (lp->region);
568 #undef FIXUP_EH_REGION
573 /* Initialize EH support. */
578 static bool eh_initialized_p = false;
580 if (eh_initialized_p)
583 /* Contrary to most other FEs, we only initialize EH support when at
584 least one of the files in the set contains exception regions in
585 it. Since this happens much later than the call to init_eh in
586 lang_dependent_init, we have to set flag_exceptions and call
587 init_eh again to initialize the EH tables. */
591 /* Initialize dwarf2 tables. Since dwarf2out_do_frame() returns
592 true only when exceptions are enabled, this initialization is
593 never done during lang_dependent_init. */
594 #if defined DWARF2_DEBUGGING_INFO || defined DWARF2_UNWIND_INFO
595 if (dwarf2out_do_frame ())
596 dwarf2out_frame_init ();
599 eh_initialized_p = true;
603 /* Read the exception table for FN from IB using the data descriptors
607 input_eh_regions (struct lto_input_block *ib, struct data_in *data_in,
610 HOST_WIDE_INT i, root_region, len;
613 tag = input_record_start (ib);
617 lto_tag_check_range (tag, LTO_eh_table, LTO_eh_table);
619 /* If the file contains EH regions, then it was compiled with
620 -fexceptions. In that case, initialize the backend EH
626 root_region = lto_input_sleb128 (ib);
627 gcc_assert (root_region == (int) root_region);
629 /* Read the EH region array. */
630 len = lto_input_sleb128 (ib);
631 gcc_assert (len == (int) len);
634 VEC_safe_grow (eh_region, gc, fn->eh->region_array, len);
635 for (i = 0; i < len; i++)
637 eh_region r = input_eh_region (ib, data_in, i);
638 VEC_replace (eh_region, fn->eh->region_array, i, r);
642 /* Read the landing pads. */
643 len = lto_input_sleb128 (ib);
644 gcc_assert (len == (int) len);
647 VEC_safe_grow (eh_landing_pad, gc, fn->eh->lp_array, len);
648 for (i = 0; i < len; i++)
650 eh_landing_pad lp = input_eh_lp (ib, data_in, i);
651 VEC_replace (eh_landing_pad, fn->eh->lp_array, i, lp);
655 /* Read the runtime type data. */
656 len = lto_input_sleb128 (ib);
657 gcc_assert (len == (int) len);
660 VEC_safe_grow (tree, gc, fn->eh->ttype_data, len);
661 for (i = 0; i < len; i++)
663 tree ttype = lto_input_tree (ib, data_in);
664 VEC_replace (tree, fn->eh->ttype_data, i, ttype);
668 /* Read the table of action chains. */
669 len = lto_input_sleb128 (ib);
670 gcc_assert (len == (int) len);
673 if (targetm.arm_eabi_unwinder)
675 VEC_safe_grow (tree, gc, fn->eh->ehspec_data.arm_eabi, len);
676 for (i = 0; i < len; i++)
678 tree t = lto_input_tree (ib, data_in);
679 VEC_replace (tree, fn->eh->ehspec_data.arm_eabi, i, t);
684 VEC_safe_grow (uchar, gc, fn->eh->ehspec_data.other, len);
685 for (i = 0; i < len; i++)
687 uchar c = lto_input_1_unsigned (ib);
688 VEC_replace (uchar, fn->eh->ehspec_data.other, i, c);
693 /* Reconstruct the EH region tree by fixing up the peer/children
695 fixup_eh_region_pointers (fn, root_region);
697 tag = input_record_start (ib);
698 lto_tag_check_range (tag, LTO_null, LTO_null);
702 /* Make a new basic block with index INDEX in function FN. */
705 make_new_block (struct function *fn, unsigned int index)
707 basic_block bb = alloc_block ();
709 SET_BASIC_BLOCK_FOR_FUNCTION (fn, index, bb);
710 bb->il.gimple = GGC_CNEW (struct gimple_bb_info);
711 n_basic_blocks_for_function (fn)++;
713 set_bb_seq (bb, gimple_seq_alloc ());
718 /* Read the CFG for function FN from input block IB. */
721 input_cfg (struct lto_input_block *ib, struct function *fn)
723 unsigned int bb_count;
728 init_empty_tree_cfg_for_function (fn);
729 init_ssa_operands ();
731 profile_status_for_function (fn) =
732 (enum profile_status_d) lto_input_uleb128 (ib);
734 bb_count = lto_input_uleb128 (ib);
736 last_basic_block_for_function (fn) = bb_count;
737 if (bb_count > VEC_length (basic_block, basic_block_info_for_function (fn)))
738 VEC_safe_grow_cleared (basic_block, gc,
739 basic_block_info_for_function (fn), bb_count);
741 if (bb_count > VEC_length (basic_block, label_to_block_map_for_function (fn)))
742 VEC_safe_grow_cleared (basic_block, gc,
743 label_to_block_map_for_function (fn), bb_count);
745 index = lto_input_sleb128 (ib);
748 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
749 unsigned int edge_count;
752 bb = make_new_block (fn, index);
754 edge_count = lto_input_uleb128 (ib);
756 /* Connect up the CFG. */
757 for (i = 0; i < edge_count; i++)
759 unsigned int dest_index;
760 unsigned int edge_flags;
766 dest_index = lto_input_uleb128 (ib);
767 probability = (int) lto_input_sleb128 (ib);
768 count = (gcov_type) lto_input_sleb128 (ib);
769 edge_flags = lto_input_uleb128 (ib);
771 dest = BASIC_BLOCK_FOR_FUNCTION (fn, dest_index);
774 dest = make_new_block (fn, dest_index);
776 e = make_edge (bb, dest, edge_flags);
777 e->probability = probability;
781 index = lto_input_sleb128 (ib);
784 p_bb = ENTRY_BLOCK_PTR_FOR_FUNCTION(fn);
785 index = lto_input_sleb128 (ib);
788 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
792 index = lto_input_sleb128 (ib);
797 /* Read a PHI function for basic block BB in function FN. DATA_IN is
798 the file being read. IB is the input block to use for reading. */
801 input_phi (struct lto_input_block *ib, basic_block bb, struct data_in *data_in,
804 unsigned HOST_WIDE_INT ix;
809 ix = lto_input_uleb128 (ib);
810 phi_result = VEC_index (tree, SSANAMES (fn), ix);
811 len = EDGE_COUNT (bb->preds);
812 result = create_phi_node (phi_result, bb);
813 SSA_NAME_DEF_STMT (phi_result) = result;
815 /* We have to go through a lookup process here because the preds in the
816 reconstructed graph are generally in a different order than they
817 were in the original program. */
818 for (i = 0; i < len; i++)
820 tree def = lto_input_tree (ib, data_in);
821 int src_index = lto_input_uleb128 (ib);
822 location_t arg_loc = lto_input_location (ib, data_in);
823 basic_block sbb = BASIC_BLOCK_FOR_FUNCTION (fn, src_index);
828 for (j = 0; j < len; j++)
829 if (EDGE_PRED (bb, j)->src == sbb)
831 e = EDGE_PRED (bb, j);
835 add_phi_arg (result, def, e, arg_loc);
842 /* Read the SSA names array for function FN from DATA_IN using input
846 input_ssa_names (struct lto_input_block *ib, struct data_in *data_in,
849 unsigned int i, size;
851 size = lto_input_uleb128 (ib);
852 init_ssanames (fn, size);
854 i = lto_input_uleb128 (ib);
860 /* Skip over the elements that had been freed. */
861 while (VEC_length (tree, SSANAMES (fn)) < i)
862 VEC_quick_push (tree, SSANAMES (fn), NULL_TREE);
864 is_default_def = (lto_input_1_unsigned (ib) != 0);
865 name = lto_input_tree (ib, data_in);
866 ssa_name = make_ssa_name_fn (fn, name, gimple_build_nop ());
869 set_default_def (SSA_NAME_VAR (ssa_name), ssa_name);
871 i = lto_input_uleb128 (ib);
876 /* Fixup the reference tree OP for replaced VAR_DECLs with mismatched
880 maybe_fixup_handled_component (tree op)
885 while (handled_component_p (TREE_OPERAND (op, 0)))
886 op = TREE_OPERAND (op, 0);
887 if (TREE_CODE (TREE_OPERAND (op, 0)) != VAR_DECL)
890 decl_type = TREE_TYPE (TREE_OPERAND (op, 0));
892 switch (TREE_CODE (op))
895 /* The DECL_CONTEXT of the field-decl is the record type we look for. */
896 wanted_type = DECL_CONTEXT (TREE_OPERAND (op, 1));
900 if (TREE_CODE (decl_type) == ARRAY_TYPE
901 && (TREE_TYPE (decl_type) == TREE_TYPE (op)
902 || useless_type_conversion_p (TREE_TYPE (op),
903 TREE_TYPE (decl_type))))
905 /* An unknown size array type should be ok. But we do not
906 lower the lower bound in all cases - ugh. */
907 wanted_type = build_array_type (TREE_TYPE (op), NULL_TREE);
910 case ARRAY_RANGE_REF:
911 if (TREE_CODE (decl_type) == ARRAY_TYPE
912 && (TREE_TYPE (decl_type) == TREE_TYPE (TREE_TYPE (op))
913 || useless_type_conversion_p (TREE_TYPE (TREE_TYPE (op)),
914 TREE_TYPE (decl_type))))
916 /* An unknown size array type should be ok. But we do not
917 lower the lower bound in all cases - ugh. */
918 wanted_type = build_array_type (TREE_TYPE (TREE_TYPE (op)), NULL_TREE);
922 case VIEW_CONVERT_EXPR:
923 /* Very nice - nothing to do. */
928 if (TREE_CODE (decl_type) == COMPLEX_TYPE
929 && (TREE_TYPE (decl_type) == TREE_TYPE (op)
930 || useless_type_conversion_p (TREE_TYPE (op),
931 TREE_TYPE (decl_type))))
933 wanted_type = build_complex_type (TREE_TYPE (op));
940 if (!useless_type_conversion_p (wanted_type, decl_type))
941 TREE_OPERAND (op, 0) = build1 (VIEW_CONVERT_EXPR, wanted_type,
942 TREE_OPERAND (op, 0));
945 /* Fixup reference tree operands for substituted prevailing decls
946 with mismatched types in STMT. This handles plain DECLs where
947 we need the stmt for context to lookup the required type. */
950 maybe_fixup_decls (gimple stmt)
952 /* We have to fixup replaced decls here in case there were
953 inter-TU type mismatches. Catch the most common cases
954 for now - this way we'll get testcases for the rest as
955 the type verifier will complain. */
956 if (gimple_assign_single_p (stmt))
958 tree lhs = gimple_assign_lhs (stmt);
959 tree rhs = gimple_assign_rhs1 (stmt);
961 /* First catch loads and aggregate copies by adjusting the rhs. */
962 if (TREE_CODE (rhs) == VAR_DECL)
964 if (!useless_type_conversion_p (TREE_TYPE (lhs), TREE_TYPE (rhs)))
965 gimple_assign_set_rhs1 (stmt, build1 (VIEW_CONVERT_EXPR,
966 TREE_TYPE (lhs), rhs));
968 /* Then catch scalar stores. */
969 else if (TREE_CODE (lhs) == VAR_DECL)
971 if (!useless_type_conversion_p (TREE_TYPE (lhs), TREE_TYPE (rhs)))
972 gimple_assign_set_lhs (stmt, build1 (VIEW_CONVERT_EXPR,
973 TREE_TYPE (rhs), lhs));
976 else if (is_gimple_call (stmt))
978 tree lhs = gimple_call_lhs (stmt);
980 if (lhs && TREE_CODE (lhs) == VAR_DECL)
982 if (!useless_type_conversion_p (TREE_TYPE (lhs),
983 gimple_call_return_type (stmt)))
984 gimple_call_set_lhs (stmt, build1 (VIEW_CONVERT_EXPR,
985 gimple_call_return_type (stmt),
989 /* Arguments, especially for varargs functions will be funny... */
993 /* Read a statement with tag TAG in function FN from block IB using
994 descriptors in DATA_IN. */
997 input_gimple_stmt (struct lto_input_block *ib, struct data_in *data_in,
998 struct function *fn, enum LTO_tags tag)
1001 enum gimple_code code;
1002 unsigned HOST_WIDE_INT num_ops;
1004 struct bitpack_d *bp;
1006 code = lto_tag_to_gimple_code (tag);
1008 /* Read the tuple header. */
1009 bp = lto_input_bitpack (ib);
1010 num_ops = bp_unpack_value (bp, sizeof (unsigned) * 8);
1011 stmt = gimple_alloc (code, num_ops);
1012 stmt->gsbase.no_warning = bp_unpack_value (bp, 1);
1013 if (is_gimple_assign (stmt))
1014 stmt->gsbase.nontemporal_move = bp_unpack_value (bp, 1);
1015 stmt->gsbase.has_volatile_ops = bp_unpack_value (bp, 1);
1016 stmt->gsbase.subcode = bp_unpack_value (bp, 16);
1017 bitpack_delete (bp);
1019 /* Read location information. */
1020 gimple_set_location (stmt, lto_input_location (ib, data_in));
1022 /* Read lexical block reference. */
1023 gimple_set_block (stmt, lto_input_tree (ib, data_in));
1025 /* Read in all the operands. */
1029 gimple_resx_set_region (stmt, lto_input_sleb128 (ib));
1032 case GIMPLE_EH_MUST_NOT_THROW:
1033 gimple_eh_must_not_throw_set_fndecl (stmt, lto_input_tree (ib, data_in));
1036 case GIMPLE_EH_DISPATCH:
1037 gimple_eh_dispatch_set_region (stmt, lto_input_sleb128 (ib));
1042 /* FIXME lto. Move most of this into a new gimple_asm_set_string(). */
1044 stmt->gimple_asm.ni = lto_input_uleb128 (ib);
1045 stmt->gimple_asm.no = lto_input_uleb128 (ib);
1046 stmt->gimple_asm.nc = lto_input_uleb128 (ib);
1047 str = input_string_cst (data_in, ib);
1048 stmt->gimple_asm.string = TREE_STRING_POINTER (str);
1060 for (i = 0; i < num_ops; i++)
1062 tree op = lto_input_tree (ib, data_in);
1063 gimple_set_op (stmt, i, op);
1067 /* Fixup reference tree operands for substituted prevailing decls
1068 with mismatched types. For plain VAR_DECLs we need to look
1069 at context to determine the wanted type - we do that below
1070 after the stmt is completed. */
1071 if (TREE_CODE (op) == ADDR_EXPR
1072 && TREE_CODE (TREE_OPERAND (op, 0)) == VAR_DECL
1073 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (op)),
1076 TREE_OPERAND (op, 0)
1077 = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (TREE_TYPE (op)),
1078 TREE_OPERAND (op, 0));
1082 /* Fixup FIELD_DECLs in COMPONENT_REFs, they are not handled
1084 if (TREE_CODE (op) == ADDR_EXPR)
1085 op = TREE_OPERAND (op, 0);
1086 while (handled_component_p (op))
1088 if (TREE_CODE (op) == COMPONENT_REF)
1090 tree field, type, tem;
1091 field = TREE_OPERAND (op, 1);
1092 type = DECL_CONTEXT (field);
1093 for (tem = TYPE_FIELDS (type); tem; tem = TREE_CHAIN (tem))
1096 || (TREE_TYPE (tem) == TREE_TYPE (field)
1097 && compare_field_offset (tem, field)))
1100 /* In case of type mismatches across units we can fail
1101 to unify some types and thus not find a proper
1102 field-decl here. So only assert here if checking
1104 #ifdef ENABLE_CHECKING
1105 gcc_assert (tem != NULL_TREE);
1107 if (tem != NULL_TREE)
1108 TREE_OPERAND (op, 1) = tem;
1111 /* Preserve the last handled component for the fixup of
1112 its operand below. */
1113 if (!handled_component_p (TREE_OPERAND (op, 0)))
1115 op = TREE_OPERAND (op, 0);
1118 /* Fixup reference tree operands for substituted prevailing decls
1119 with mismatched types. */
1120 if (handled_component_p (op))
1121 maybe_fixup_handled_component (op);
1126 case GIMPLE_PREDICT:
1130 internal_error ("bytecode stream: unknown GIMPLE statement tag %s",
1131 lto_tag_name (tag));
1134 /* Update the properties of symbols, SSA names and labels associated
1136 if (code == GIMPLE_ASSIGN || code == GIMPLE_CALL)
1138 tree lhs = gimple_get_lhs (stmt);
1139 if (lhs && TREE_CODE (lhs) == SSA_NAME)
1140 SSA_NAME_DEF_STMT (lhs) = stmt;
1142 else if (code == GIMPLE_LABEL)
1143 gcc_assert (emit_label_in_global_context_p (gimple_label_label (stmt))
1144 || DECL_CONTEXT (gimple_label_label (stmt)) == fn->decl);
1145 else if (code == GIMPLE_ASM)
1149 for (i = 0; i < gimple_asm_noutputs (stmt); i++)
1151 tree op = TREE_VALUE (gimple_asm_output_op (stmt, i));
1152 if (TREE_CODE (op) == SSA_NAME)
1153 SSA_NAME_DEF_STMT (op) = stmt;
1157 /* Reset alias information. */
1158 if (code == GIMPLE_CALL)
1159 gimple_call_reset_alias_info (stmt);
1161 /* Fixup reference tree operands for substituted prevailing decls
1162 with mismatched types. */
1163 maybe_fixup_decls (stmt);
1165 /* Mark the statement modified so its operand vectors can be filled in. */
1166 gimple_set_modified (stmt, true);
1172 /* Read a basic block with tag TAG from DATA_IN using input block IB.
1173 FN is the function being processed. */
1176 input_bb (struct lto_input_block *ib, enum LTO_tags tag,
1177 struct data_in *data_in, struct function *fn)
1181 gimple_stmt_iterator bsi;
1183 /* This routine assumes that CFUN is set to FN, as it needs to call
1184 basic GIMPLE routines that use CFUN. */
1185 gcc_assert (cfun == fn);
1187 index = lto_input_uleb128 (ib);
1188 bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
1190 bb->count = lto_input_sleb128 (ib);
1191 bb->loop_depth = lto_input_sleb128 (ib);
1192 bb->frequency = lto_input_sleb128 (ib);
1193 bb->flags = lto_input_sleb128 (ib);
1195 /* LTO_bb1 has statements. LTO_bb0 does not. */
1199 bsi = gsi_start_bb (bb);
1200 tag = input_record_start (ib);
1203 gimple stmt = input_gimple_stmt (ib, data_in, fn, tag);
1205 /* Change debug stmts to nops on-the-fly if we do not have VTA enabled.
1206 This allows us to build for example static libs with debugging
1207 enabled and do the final link without. */
1208 if (!MAY_HAVE_DEBUG_STMTS
1209 && is_gimple_debug (stmt))
1210 stmt = gimple_build_nop ();
1212 find_referenced_vars_in (stmt);
1213 gsi_insert_after (&bsi, stmt, GSI_NEW_STMT);
1215 /* After the statement, expect a 0 delimiter or the EH region
1216 that the previous statement belongs to. */
1217 tag = input_record_start (ib);
1218 lto_tag_check_set (tag, 2, LTO_eh_region, LTO_null);
1220 if (tag == LTO_eh_region)
1222 HOST_WIDE_INT region = lto_input_sleb128 (ib);
1223 gcc_assert (region == (int) region);
1224 add_stmt_to_eh_lp (stmt, region);
1227 tag = input_record_start (ib);
1230 tag = input_record_start (ib);
1233 gimple phi = input_phi (ib, bb, data_in, fn);
1234 find_referenced_vars_in (phi);
1235 tag = input_record_start (ib);
1239 /* Go through all NODE edges and fixup call_stmt pointers
1240 so they point to STMTS. */
1243 fixup_call_stmt_edges_1 (struct cgraph_node *node, gimple *stmts)
1245 struct cgraph_edge *cedge;
1246 for (cedge = node->callees; cedge; cedge = cedge->next_callee)
1247 cedge->call_stmt = stmts[cedge->lto_stmt_uid];
1248 for (cedge = node->indirect_calls; cedge; cedge = cedge->next_callee)
1249 cedge->call_stmt = stmts[cedge->lto_stmt_uid];
1252 /* Fixup call_stmt pointers in NODE and all clones. */
1255 fixup_call_stmt_edges (struct cgraph_node *orig, gimple *stmts)
1257 struct cgraph_node *node;
1259 while (orig->clone_of)
1260 orig = orig->clone_of;
1262 fixup_call_stmt_edges_1 (orig, stmts);
1264 for (node = orig->clones; node != orig;)
1266 fixup_call_stmt_edges_1 (node, stmts);
1268 node = node->clones;
1269 else if (node->next_sibling_clone)
1270 node = node->next_sibling_clone;
1273 while (node != orig && !node->next_sibling_clone)
1274 node = node->clone_of;
1276 node = node->next_sibling_clone;
1281 /* Read the body of function FN_DECL from DATA_IN using input block IB. */
1284 input_function (tree fn_decl, struct data_in *data_in,
1285 struct lto_input_block *ib)
1287 struct function *fn;
1291 struct bitpack_d *bp;
1292 struct cgraph_node *node;
1293 tree args, narg, oarg;
1295 fn = DECL_STRUCT_FUNCTION (fn_decl);
1296 tag = input_record_start (ib);
1297 clear_line_info (data_in);
1299 gimple_register_cfg_hooks ();
1300 lto_tag_check (tag, LTO_function);
1302 /* Read all the attributes for FN. */
1303 bp = lto_input_bitpack (ib);
1304 fn->is_thunk = bp_unpack_value (bp, 1);
1305 fn->has_local_explicit_reg_vars = bp_unpack_value (bp, 1);
1306 fn->after_tree_profile = bp_unpack_value (bp, 1);
1307 fn->returns_pcc_struct = bp_unpack_value (bp, 1);
1308 fn->returns_struct = bp_unpack_value (bp, 1);
1309 fn->always_inline_functions_inlined = bp_unpack_value (bp, 1);
1310 fn->after_inlining = bp_unpack_value (bp, 1);
1311 fn->dont_save_pending_sizes_p = bp_unpack_value (bp, 1);
1312 fn->stdarg = bp_unpack_value (bp, 1);
1313 fn->has_nonlocal_label = bp_unpack_value (bp, 1);
1314 fn->calls_alloca = bp_unpack_value (bp, 1);
1315 fn->calls_setjmp = bp_unpack_value (bp, 1);
1316 fn->va_list_fpr_size = bp_unpack_value (bp, 8);
1317 fn->va_list_gpr_size = bp_unpack_value (bp, 8);
1318 bitpack_delete (bp);
1320 /* Input the current IL state of the function. */
1321 fn->curr_properties = lto_input_uleb128 (ib);
1323 /* Read the static chain and non-local goto save area. */
1324 fn->static_chain_decl = lto_input_tree (ib, data_in);
1325 fn->nonlocal_goto_save_area = lto_input_tree (ib, data_in);
1327 /* Read all the local symbols. */
1328 fn->local_decls = lto_input_tree (ib, data_in);
1330 /* Read all function arguments. We need to re-map them here to the
1331 arguments of the merged function declaration. */
1332 args = lto_input_tree (ib, data_in);
1333 for (oarg = args, narg = DECL_ARGUMENTS (fn_decl);
1335 oarg = TREE_CHAIN (oarg), narg = TREE_CHAIN (narg))
1339 res = lto_streamer_cache_lookup (data_in->reader_cache, oarg, &ix);
1341 /* Replace the argument in the streamer cache. */
1342 lto_streamer_cache_insert_at (data_in->reader_cache, narg, ix);
1344 gcc_assert (!oarg && !narg);
1346 /* Read all the SSA names. */
1347 input_ssa_names (ib, data_in, fn);
1349 /* Read the exception handling regions in the function. */
1350 input_eh_regions (ib, data_in, fn);
1352 /* Read the tree of lexical scopes for the function. */
1353 DECL_INITIAL (fn_decl) = lto_input_tree (ib, data_in);
1354 gcc_assert (DECL_INITIAL (fn_decl));
1355 DECL_SAVED_TREE (fn_decl) = NULL_TREE;
1357 /* Read all the basic blocks. */
1358 tag = input_record_start (ib);
1361 input_bb (ib, tag, data_in, fn);
1362 tag = input_record_start (ib);
1365 /* Fix up the call statements that are mentioned in the callgraph
1367 renumber_gimple_stmt_uids ();
1368 stmts = (gimple *) xcalloc (gimple_stmt_max_uid (fn), sizeof (gimple));
1371 gimple_stmt_iterator bsi;
1372 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1374 gimple stmt = gsi_stmt (bsi);
1375 stmts[gimple_uid (stmt)] = stmt;
1379 /* Set the gimple body to the statement sequence in the entry
1380 basic block. FIXME lto, this is fairly hacky. The existence
1381 of a gimple body is used by the cgraph routines, but we should
1382 really use the presence of the CFG. */
1384 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs);
1385 gimple_set_body (fn_decl, bb_seq (ei_edge (ei)->dest));
1388 node = cgraph_node (fn_decl);
1389 fixup_call_stmt_edges (node, stmts);
1390 execute_all_ipa_stmt_fixups (node, stmts);
1392 update_ssa (TODO_update_ssa_only_virtuals);
1393 free_dominance_info (CDI_DOMINATORS);
1394 free_dominance_info (CDI_POST_DOMINATORS);
1399 /* Read initializer expressions for public statics. DATA_IN is the
1400 file being read. IB is the input block used for reading. */
1403 input_alias_pairs (struct lto_input_block *ib, struct data_in *data_in)
1407 clear_line_info (data_in);
1409 /* Skip over all the unreferenced globals. */
1411 var = lto_input_tree (ib, data_in);
1414 var = lto_input_tree (ib, data_in);
1417 const char *orig_name, *new_name;
1420 p = VEC_safe_push (alias_pair, gc, alias_pairs, NULL);
1422 p->target = lto_input_tree (ib, data_in);
1424 /* If the target is a static object, we may have registered a
1425 new name for it to avoid clashes between statics coming from
1426 different files. In that case, use the new name. */
1427 orig_name = IDENTIFIER_POINTER (p->target);
1428 new_name = lto_get_decl_name_mapping (data_in->file_data, orig_name);
1429 if (strcmp (orig_name, new_name) != 0)
1430 p->target = get_identifier (new_name);
1432 var = lto_input_tree (ib, data_in);
1437 /* Read the body from DATA for function FN_DECL and fill it in.
1438 FILE_DATA are the global decls and types. SECTION_TYPE is either
1439 LTO_section_function_body or LTO_section_static_initializer. If
1440 section type is LTO_section_function_body, FN must be the decl for
1444 lto_read_body (struct lto_file_decl_data *file_data, tree fn_decl,
1445 const char *data, enum lto_section_type section_type)
1447 const struct lto_function_header *header;
1448 struct data_in *data_in;
1450 int32_t main_offset;
1451 int32_t string_offset;
1452 struct lto_input_block ib_cfg;
1453 struct lto_input_block ib_main;
1455 header = (const struct lto_function_header *) data;
1456 cfg_offset = sizeof (struct lto_function_header);
1457 main_offset = cfg_offset + header->cfg_size;
1458 string_offset = main_offset + header->main_size;
1460 LTO_INIT_INPUT_BLOCK (ib_cfg,
1465 LTO_INIT_INPUT_BLOCK (ib_main,
1470 data_in = lto_data_in_create (file_data, data + string_offset,
1471 header->string_size, NULL);
1473 /* Make sure the file was generated by the exact same compiler. */
1474 lto_check_version (header->lto_header.major_version,
1475 header->lto_header.minor_version);
1477 if (section_type == LTO_section_function_body)
1479 struct function *fn = DECL_STRUCT_FUNCTION (fn_decl);
1480 struct lto_in_decl_state *decl_state;
1485 /* Use the function's decl state. */
1486 decl_state = lto_get_function_in_decl_state (file_data, fn_decl);
1487 gcc_assert (decl_state);
1488 file_data->current_decl_state = decl_state;
1490 input_cfg (&ib_cfg, fn);
1492 /* Set up the struct function. */
1493 input_function (fn_decl, data_in, &ib_main);
1495 /* We should now be in SSA. */
1496 cfun->gimple_df->in_ssa_p = true;
1498 /* Restore decl state */
1499 file_data->current_decl_state = file_data->global_decl_state;
1505 input_alias_pairs (&ib_main, data_in);
1508 clear_line_info (data_in);
1509 lto_data_in_delete (data_in);
1513 /* Read the body of FN_DECL using DATA. FILE_DATA holds the global
1517 lto_input_function_body (struct lto_file_decl_data *file_data,
1518 tree fn_decl, const char *data)
1520 current_function_decl = fn_decl;
1521 lto_read_body (file_data, fn_decl, data, LTO_section_function_body);
1525 /* Read in VAR_DECL using DATA. FILE_DATA holds the global decls and
1529 lto_input_constructors_and_inits (struct lto_file_decl_data *file_data,
1532 lto_read_body (file_data, NULL, data, LTO_section_static_initializer);
1536 /* Return the resolution for the decl with index INDEX from DATA_IN. */
1538 static enum ld_plugin_symbol_resolution
1539 get_resolution (struct data_in *data_in, unsigned index)
1541 if (data_in->globals_resolution)
1543 ld_plugin_symbol_resolution_t ret;
1544 /* We can have references to not emitted functions in
1545 DECL_FUNCTION_PERSONALITY at least. So we can and have
1546 to indeed return LDPR_UNKNOWN in some cases. */
1547 if (VEC_length (ld_plugin_symbol_resolution_t,
1548 data_in->globals_resolution) <= index)
1549 return LDPR_UNKNOWN;
1550 ret = VEC_index (ld_plugin_symbol_resolution_t,
1551 data_in->globals_resolution,
1556 /* Delay resolution finding until decl merging. */
1557 return LDPR_UNKNOWN;
1561 /* Unpack all the non-pointer fields of the TS_BASE structure of
1562 expression EXPR from bitpack BP. */
1565 unpack_ts_base_value_fields (struct bitpack_d *bp, tree expr)
1567 /* Note that the code for EXPR has already been unpacked to create EXPR in
1568 lto_materialize_tree. */
1571 TREE_SIDE_EFFECTS (expr) = (unsigned) bp_unpack_value (bp, 1);
1572 TREE_CONSTANT (expr) = (unsigned) bp_unpack_value (bp, 1);
1573 TREE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
1575 /* TREE_PUBLIC is used on types to indicate that the type
1576 has a TYPE_CACHED_VALUES vector. This is not streamed out,
1577 so we skip it here. */
1578 TREE_PUBLIC (expr) = (unsigned) bp_unpack_value (bp, 1);
1580 TREE_ADDRESSABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
1581 TREE_THIS_VOLATILE (expr) = (unsigned) bp_unpack_value (bp, 1);
1583 DECL_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
1584 else if (TYPE_P (expr))
1585 TYPE_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
1586 TREE_ASM_WRITTEN (expr) = (unsigned) bp_unpack_value (bp, 1);
1587 TREE_NO_WARNING (expr) = (unsigned) bp_unpack_value (bp, 1);
1588 TREE_USED (expr) = (unsigned) bp_unpack_value (bp, 1);
1589 TREE_NOTHROW (expr) = (unsigned) bp_unpack_value (bp, 1);
1590 TREE_STATIC (expr) = (unsigned) bp_unpack_value (bp, 1);
1591 TREE_PRIVATE (expr) = (unsigned) bp_unpack_value (bp, 1);
1592 TREE_PROTECTED (expr) = (unsigned) bp_unpack_value (bp, 1);
1593 TREE_DEPRECATED (expr) = (unsigned) bp_unpack_value (bp, 1);
1595 TYPE_SATURATING (expr) = (unsigned) bp_unpack_value (bp, 1);
1596 if (TREE_CODE (expr) == SSA_NAME)
1597 SSA_NAME_IS_DEFAULT_DEF (expr) = (unsigned) bp_unpack_value (bp, 1);
1601 /* Unpack all the non-pointer fields of the TS_REAL_CST structure of
1602 expression EXPR from bitpack BP. */
1605 unpack_ts_real_cst_value_fields (struct bitpack_d *bp, tree expr)
1609 REAL_VALUE_TYPE *rp;
1611 r.cl = (unsigned) bp_unpack_value (bp, 2);
1612 r.decimal = (unsigned) bp_unpack_value (bp, 1);
1613 r.sign = (unsigned) bp_unpack_value (bp, 1);
1614 r.signalling = (unsigned) bp_unpack_value (bp, 1);
1615 r.canonical = (unsigned) bp_unpack_value (bp, 1);
1616 r.uexp = (unsigned) bp_unpack_value (bp, EXP_BITS);
1617 for (i = 0; i < SIGSZ; i++)
1618 r.sig[i] = (unsigned long) bp_unpack_value (bp, HOST_BITS_PER_LONG);
1620 rp = GGC_NEW (REAL_VALUE_TYPE);
1621 memcpy (rp, &r, sizeof (REAL_VALUE_TYPE));
1622 TREE_REAL_CST_PTR (expr) = rp;
1626 /* Unpack all the non-pointer fields of the TS_FIXED_CST structure of
1627 expression EXPR from bitpack BP. */
1630 unpack_ts_fixed_cst_value_fields (struct bitpack_d *bp, tree expr)
1632 struct fixed_value fv;
1634 fv.data.low = (HOST_WIDE_INT) bp_unpack_value (bp, HOST_BITS_PER_WIDE_INT);
1635 fv.data.high = (HOST_WIDE_INT) bp_unpack_value (bp, HOST_BITS_PER_WIDE_INT);
1636 TREE_FIXED_CST (expr) = fv;
1640 /* Unpack all the non-pointer fields of the TS_DECL_COMMON structure
1641 of expression EXPR from bitpack BP. */
1644 unpack_ts_decl_common_value_fields (struct bitpack_d *bp, tree expr)
1646 DECL_MODE (expr) = (enum machine_mode) bp_unpack_value (bp, 8);
1647 DECL_NONLOCAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1648 DECL_VIRTUAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1649 DECL_IGNORED_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1650 DECL_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
1651 DECL_ARTIFICIAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1652 DECL_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
1653 DECL_PRESERVE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1654 DECL_DEBUG_EXPR_IS_FROM (expr) = (unsigned) bp_unpack_value (bp, 1);
1655 DECL_EXTERNAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1656 DECL_GIMPLE_REG_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1657 DECL_ALIGN (expr) = (unsigned) bp_unpack_value (bp, HOST_BITS_PER_INT);
1659 if (TREE_CODE (expr) == LABEL_DECL)
1661 DECL_ERROR_ISSUED (expr) = (unsigned) bp_unpack_value (bp, 1);
1662 EH_LANDING_PAD_NR (expr) = (int) bp_unpack_value (bp, HOST_BITS_PER_INT);
1664 /* Always assume an initial value of -1 for LABEL_DECL_UID to
1665 force gimple_set_bb to recreate label_to_block_map. */
1666 LABEL_DECL_UID (expr) = -1;
1669 if (TREE_CODE (expr) == FIELD_DECL)
1671 unsigned HOST_WIDE_INT off_align;
1672 DECL_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
1673 DECL_NONADDRESSABLE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1674 off_align = (unsigned HOST_WIDE_INT) bp_unpack_value (bp, 8);
1675 SET_DECL_OFFSET_ALIGN (expr, off_align);
1678 if (TREE_CODE (expr) == RESULT_DECL
1679 || TREE_CODE (expr) == PARM_DECL
1680 || TREE_CODE (expr) == VAR_DECL)
1682 DECL_BY_REFERENCE (expr) = (unsigned) bp_unpack_value (bp, 1);
1683 if (TREE_CODE (expr) == VAR_DECL
1684 || TREE_CODE (expr) == PARM_DECL)
1685 DECL_HAS_VALUE_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1686 DECL_RESTRICTED_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1691 /* Unpack all the non-pointer fields of the TS_DECL_WRTL structure
1692 of expression EXPR from bitpack BP. */
1695 unpack_ts_decl_wrtl_value_fields (struct bitpack_d *bp, tree expr)
1697 DECL_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
1701 /* Unpack all the non-pointer fields of the TS_DECL_WITH_VIS structure
1702 of expression EXPR from bitpack BP. */
1705 unpack_ts_decl_with_vis_value_fields (struct bitpack_d *bp, tree expr)
1707 DECL_DEFER_OUTPUT (expr) = (unsigned) bp_unpack_value (bp, 1);
1708 DECL_COMMON (expr) = (unsigned) bp_unpack_value (bp, 1);
1709 DECL_DLLIMPORT_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1710 DECL_WEAK (expr) = (unsigned) bp_unpack_value (bp, 1);
1711 DECL_SEEN_IN_BIND_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1712 DECL_COMDAT (expr) = (unsigned) bp_unpack_value (bp, 1);
1713 DECL_VISIBILITY (expr) = (enum symbol_visibility) bp_unpack_value (bp, 2);
1714 DECL_VISIBILITY_SPECIFIED (expr) = (unsigned) bp_unpack_value (bp, 1);
1716 if (TREE_CODE (expr) == VAR_DECL)
1718 DECL_HARD_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
1719 DECL_IN_TEXT_SECTION (expr) = (unsigned) bp_unpack_value (bp, 1);
1720 DECL_IN_CONSTANT_POOL (expr) = (unsigned) bp_unpack_value (bp, 1);
1721 DECL_TLS_MODEL (expr) = (enum tls_model) bp_unpack_value (bp, 3);
1724 if (VAR_OR_FUNCTION_DECL_P (expr))
1727 p = (priority_type) bp_unpack_value (bp, HOST_BITS_PER_SHORT);
1728 SET_DECL_INIT_PRIORITY (expr, p);
1733 /* Unpack all the non-pointer fields of the TS_FUNCTION_DECL structure
1734 of expression EXPR from bitpack BP. */
1737 unpack_ts_function_decl_value_fields (struct bitpack_d *bp, tree expr)
1739 DECL_FUNCTION_CODE (expr) = (enum built_in_function) bp_unpack_value (bp, 11);
1740 DECL_BUILT_IN_CLASS (expr) = (enum built_in_class) bp_unpack_value (bp, 2);
1741 DECL_STATIC_CONSTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
1742 DECL_STATIC_DESTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
1743 DECL_UNINLINABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
1744 DECL_POSSIBLY_INLINED (expr) = (unsigned) bp_unpack_value (bp, 1);
1745 DECL_IS_NOVOPS (expr) = (unsigned) bp_unpack_value (bp, 1);
1746 DECL_IS_RETURNS_TWICE (expr) = (unsigned) bp_unpack_value (bp, 1);
1747 DECL_IS_MALLOC (expr) = (unsigned) bp_unpack_value (bp, 1);
1748 DECL_IS_OPERATOR_NEW (expr) = (unsigned) bp_unpack_value (bp, 1);
1749 DECL_DECLARED_INLINE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1750 DECL_STATIC_CHAIN (expr) = (unsigned) bp_unpack_value (bp, 1);
1751 DECL_NO_INLINE_WARNING_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1752 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (expr)
1753 = (unsigned) bp_unpack_value (bp, 1);
1754 DECL_NO_LIMIT_STACK (expr) = (unsigned) bp_unpack_value (bp, 1);
1755 DECL_DISREGARD_INLINE_LIMITS (expr) = (unsigned) bp_unpack_value (bp, 1);
1756 DECL_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1757 DECL_LOOPING_CONST_OR_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1761 /* Unpack all the non-pointer fields of the TS_TYPE structure
1762 of expression EXPR from bitpack BP. */
1765 unpack_ts_type_value_fields (struct bitpack_d *bp, tree expr)
1767 enum machine_mode mode;
1769 TYPE_PRECISION (expr) = (unsigned) bp_unpack_value (bp, 9);
1770 mode = (enum machine_mode) bp_unpack_value (bp, 7);
1771 SET_TYPE_MODE (expr, mode);
1772 TYPE_STRING_FLAG (expr) = (unsigned) bp_unpack_value (bp, 1);
1773 TYPE_NO_FORCE_BLK (expr) = (unsigned) bp_unpack_value (bp, 1);
1774 TYPE_NEEDS_CONSTRUCTING (expr) = (unsigned) bp_unpack_value (bp, 1);
1775 if (RECORD_OR_UNION_TYPE_P (expr))
1776 TYPE_TRANSPARENT_AGGR (expr) = (unsigned) bp_unpack_value (bp, 1);
1777 TYPE_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
1778 TYPE_RESTRICT (expr) = (unsigned) bp_unpack_value (bp, 1);
1779 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr)
1780 = (unsigned) bp_unpack_value (bp, 2);
1781 TYPE_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
1782 TYPE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
1783 TYPE_ALIGN (expr) = (unsigned) bp_unpack_value (bp, HOST_BITS_PER_INT);
1784 TYPE_ALIAS_SET (expr) = bp_unpack_value (bp, HOST_BITS_PER_INT);
1788 /* Unpack all the non-pointer fields of the TS_BLOCK structure
1789 of expression EXPR from bitpack BP. */
1792 unpack_ts_block_value_fields (struct bitpack_d *bp, tree expr)
1794 BLOCK_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
1795 BLOCK_NUMBER (expr) = (unsigned) bp_unpack_value (bp, 31);
1799 /* Unpack all the non-pointer fields in EXPR into a bit pack. */
1802 unpack_value_fields (struct bitpack_d *bp, tree expr)
1804 enum tree_code code;
1806 code = TREE_CODE (expr);
1808 /* Note that all these functions are highly sensitive to changes in
1809 the types and sizes of each of the fields being packed. */
1810 unpack_ts_base_value_fields (bp, expr);
1812 if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST))
1813 unpack_ts_real_cst_value_fields (bp, expr);
1815 if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST))
1816 unpack_ts_fixed_cst_value_fields (bp, expr);
1818 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1819 unpack_ts_decl_common_value_fields (bp, expr);
1821 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
1822 unpack_ts_decl_wrtl_value_fields (bp, expr);
1824 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
1825 unpack_ts_decl_with_vis_value_fields (bp, expr);
1827 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
1828 unpack_ts_function_decl_value_fields (bp, expr);
1830 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
1831 unpack_ts_type_value_fields (bp, expr);
1833 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
1834 unpack_ts_block_value_fields (bp, expr);
1836 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
1838 /* We only stream the version number of SSA names. */
1842 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
1844 /* This is only used by GENERIC. */
1848 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
1850 /* This is only used by High GIMPLE. */
1856 /* Read a bitpack from input block IB. */
1859 lto_input_bitpack (struct lto_input_block *ib)
1861 unsigned i, num_words;
1862 struct bitpack_d *bp;
1864 bp = bitpack_create ();
1866 /* If we are about to read more than a handful of words, something
1867 is wrong. This check is overly strict, but it acts as an early
1868 warning. No streamed object has hundreds of bits in its fields. */
1869 num_words = lto_input_uleb128 (ib);
1870 gcc_assert (num_words < 20);
1872 for (i = 0; i < num_words; i++)
1874 bitpack_word_t w = lto_input_uleb128 (ib);
1875 VEC_safe_push (bitpack_word_t, heap, bp->values, w);
1882 /* Materialize a new tree from input block IB using descriptors in
1883 DATA_IN. The code for the new tree should match TAG. Store in
1884 *IX_P the index into the reader cache where the new tree is stored. */
1887 lto_materialize_tree (struct lto_input_block *ib, struct data_in *data_in,
1888 enum LTO_tags tag, int *ix_p)
1890 struct bitpack_d *bp;
1891 enum tree_code code;
1893 #ifdef LTO_STREAMER_DEBUG
1894 HOST_WIDEST_INT orig_address_in_writer;
1900 /* Read the header of the node we are about to create. */
1901 ix = lto_input_sleb128 (ib);
1902 gcc_assert ((int) ix == ix);
1905 #ifdef LTO_STREAMER_DEBUG
1906 /* Read the word representing the memory address for the tree
1907 as it was written by the writer. This is useful when
1908 debugging differences between the writer and reader. */
1909 orig_address_in_writer = lto_input_sleb128 (ib);
1910 gcc_assert ((intptr_t) orig_address_in_writer == orig_address_in_writer);
1913 code = lto_tag_to_tree_code (tag);
1915 /* We should never see an SSA_NAME tree. Only the version numbers of
1916 SSA names are ever written out. See input_ssa_names. */
1917 gcc_assert (code != SSA_NAME);
1919 /* Instantiate a new tree using the header data. */
1920 if (CODE_CONTAINS_STRUCT (code, TS_STRING))
1921 result = input_string_cst (data_in, ib);
1922 else if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER))
1923 result = input_identifier (data_in, ib);
1924 else if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1926 HOST_WIDE_INT len = lto_input_sleb128 (ib);
1927 result = make_tree_vec (len);
1929 else if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1931 unsigned HOST_WIDE_INT len = lto_input_uleb128 (ib);
1932 result = make_tree_binfo (len);
1936 /* All other nodes can be materialized with a raw make_node
1938 result = make_node (code);
1941 #ifdef LTO_STREAMER_DEBUG
1942 /* Store the original address of the tree as seen by the writer
1943 in RESULT's aux field. This is useful when debugging streaming
1944 problems. This way, a debugging session can be started on
1945 both writer and reader with a breakpoint using this address
1947 lto_orig_address_map (result, (intptr_t) orig_address_in_writer);
1950 /* Read the bitpack of non-pointer values from IB. */
1951 bp = lto_input_bitpack (ib);
1953 /* The first word in BP contains the code of the tree that we
1954 are about to read. */
1955 code = (enum tree_code) bp_unpack_value (bp, 16);
1956 lto_tag_check (lto_tree_code_to_tag (code), tag);
1958 /* Unpack all the value fields from BP. */
1959 unpack_value_fields (bp, result);
1960 bitpack_delete (bp);
1962 /* Enter RESULT in the reader cache. This will make RESULT
1963 available so that circular references in the rest of the tree
1964 structure can be resolved in subsequent calls to lto_input_tree. */
1965 lto_streamer_cache_insert_at (data_in->reader_cache, result, ix);
1971 /* Read a chain of tree nodes from input block IB. DATA_IN contains
1972 tables and descriptors for the file being read. */
1975 lto_input_chain (struct lto_input_block *ib, struct data_in *data_in)
1978 tree first, prev, curr;
1980 first = prev = NULL_TREE;
1981 count = lto_input_sleb128 (ib);
1982 for (i = 0; i < count; i++)
1984 curr = lto_input_tree (ib, data_in);
1986 TREE_CHAIN (prev) = curr;
1990 TREE_CHAIN (curr) = NULL_TREE;
1998 /* Read all pointer fields in the TS_COMMON structure of EXPR from input
1999 block IB. DATA_IN contains tables and descriptors for the
2004 lto_input_ts_common_tree_pointers (struct lto_input_block *ib,
2005 struct data_in *data_in, tree expr)
2007 TREE_TYPE (expr) = lto_input_tree (ib, data_in);
2011 /* Read all pointer fields in the TS_VECTOR structure of EXPR from input
2012 block IB. DATA_IN contains tables and descriptors for the
2016 lto_input_ts_vector_tree_pointers (struct lto_input_block *ib,
2017 struct data_in *data_in, tree expr)
2019 TREE_VECTOR_CST_ELTS (expr) = lto_input_chain (ib, data_in);
2023 /* Read all pointer fields in the TS_COMPLEX structure of EXPR from input
2024 block IB. DATA_IN contains tables and descriptors for the
2028 lto_input_ts_complex_tree_pointers (struct lto_input_block *ib,
2029 struct data_in *data_in, tree expr)
2031 TREE_REALPART (expr) = lto_input_tree (ib, data_in);
2032 TREE_IMAGPART (expr) = lto_input_tree (ib, data_in);
2036 /* Read all pointer fields in the TS_DECL_MINIMAL structure of EXPR
2037 from input block IB. DATA_IN contains tables and descriptors for the
2041 lto_input_ts_decl_minimal_tree_pointers (struct lto_input_block *ib,
2042 struct data_in *data_in, tree expr)
2044 DECL_NAME (expr) = lto_input_tree (ib, data_in);
2045 DECL_CONTEXT (expr) = lto_input_tree (ib, data_in);
2046 DECL_SOURCE_LOCATION (expr) = lto_input_location (ib, data_in);
2050 /* Read all pointer fields in the TS_DECL_COMMON structure of EXPR from
2051 input block IB. DATA_IN contains tables and descriptors for the
2055 lto_input_ts_decl_common_tree_pointers (struct lto_input_block *ib,
2056 struct data_in *data_in, tree expr)
2058 DECL_SIZE (expr) = lto_input_tree (ib, data_in);
2059 DECL_SIZE_UNIT (expr) = lto_input_tree (ib, data_in);
2061 if (TREE_CODE (expr) != FUNCTION_DECL)
2062 DECL_INITIAL (expr) = lto_input_tree (ib, data_in);
2064 DECL_ATTRIBUTES (expr) = lto_input_tree (ib, data_in);
2065 DECL_ABSTRACT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2067 if (TREE_CODE (expr) == PARM_DECL)
2068 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
2070 if ((TREE_CODE (expr) == VAR_DECL
2071 || TREE_CODE (expr) == PARM_DECL)
2072 && DECL_HAS_VALUE_EXPR_P (expr))
2073 SET_DECL_VALUE_EXPR (expr, lto_input_tree (ib, data_in));
2077 /* Read all pointer fields in the TS_DECL_NON_COMMON structure of
2078 EXPR from input block IB. DATA_IN contains tables and descriptors for the
2082 lto_input_ts_decl_non_common_tree_pointers (struct lto_input_block *ib,
2083 struct data_in *data_in, tree expr)
2085 if (TREE_CODE (expr) == FUNCTION_DECL)
2087 DECL_ARGUMENTS (expr) = lto_input_tree (ib, data_in);
2088 DECL_RESULT (expr) = lto_input_tree (ib, data_in);
2090 DECL_VINDEX (expr) = lto_input_tree (ib, data_in);
2094 /* Read all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
2095 from input block IB. DATA_IN contains tables and descriptors for the
2099 lto_input_ts_decl_with_vis_tree_pointers (struct lto_input_block *ib,
2100 struct data_in *data_in, tree expr)
2104 id = lto_input_tree (ib, data_in);
2107 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
2108 SET_DECL_ASSEMBLER_NAME (expr, id);
2111 DECL_SECTION_NAME (expr) = lto_input_tree (ib, data_in);
2112 DECL_COMDAT_GROUP (expr) = lto_input_tree (ib, data_in);
2116 /* Read all pointer fields in the TS_FIELD_DECL structure of EXPR from
2117 input block IB. DATA_IN contains tables and descriptors for the
2121 lto_input_ts_field_decl_tree_pointers (struct lto_input_block *ib,
2122 struct data_in *data_in, tree expr)
2124 DECL_FIELD_OFFSET (expr) = lto_input_tree (ib, data_in);
2125 DECL_BIT_FIELD_TYPE (expr) = lto_input_tree (ib, data_in);
2126 DECL_QUALIFIER (expr) = lto_input_tree (ib, data_in);
2127 DECL_FIELD_BIT_OFFSET (expr) = lto_input_tree (ib, data_in);
2128 DECL_FCONTEXT (expr) = lto_input_tree (ib, data_in);
2129 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
2133 /* Read all pointer fields in the TS_FUNCTION_DECL structure of EXPR
2134 from input block IB. DATA_IN contains tables and descriptors for the
2138 lto_input_ts_function_decl_tree_pointers (struct lto_input_block *ib,
2139 struct data_in *data_in, tree expr)
2141 /* DECL_STRUCT_FUNCTION is handled by lto_input_function. FIXME lto,
2142 maybe it should be handled here? */
2143 DECL_FUNCTION_PERSONALITY (expr) = lto_input_tree (ib, data_in);
2144 DECL_FUNCTION_SPECIFIC_TARGET (expr) = lto_input_tree (ib, data_in);
2145 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr) = lto_input_tree (ib, data_in);
2147 /* If the file contains a function with an EH personality set,
2148 then it was compiled with -fexceptions. In that case, initialize
2149 the backend EH machinery. */
2150 if (DECL_FUNCTION_PERSONALITY (expr))
2155 /* Read all pointer fields in the TS_TYPE structure of EXPR from input
2156 block IB. DATA_IN contains tables and descriptors for the
2160 lto_input_ts_type_tree_pointers (struct lto_input_block *ib,
2161 struct data_in *data_in, tree expr)
2163 if (TREE_CODE (expr) == ENUMERAL_TYPE)
2164 TYPE_VALUES (expr) = lto_input_tree (ib, data_in);
2165 else if (TREE_CODE (expr) == ARRAY_TYPE)
2166 TYPE_DOMAIN (expr) = lto_input_tree (ib, data_in);
2167 else if (RECORD_OR_UNION_TYPE_P (expr))
2168 TYPE_FIELDS (expr) = lto_input_tree (ib, data_in);
2169 else if (TREE_CODE (expr) == FUNCTION_TYPE
2170 || TREE_CODE (expr) == METHOD_TYPE)
2171 TYPE_ARG_TYPES (expr) = lto_input_tree (ib, data_in);
2172 else if (TREE_CODE (expr) == VECTOR_TYPE)
2173 TYPE_DEBUG_REPRESENTATION_TYPE (expr) = lto_input_tree (ib, data_in);
2175 TYPE_SIZE (expr) = lto_input_tree (ib, data_in);
2176 TYPE_SIZE_UNIT (expr) = lto_input_tree (ib, data_in);
2177 TYPE_ATTRIBUTES (expr) = lto_input_tree (ib, data_in);
2178 TYPE_NAME (expr) = lto_input_tree (ib, data_in);
2179 /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO nor
2180 TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. */
2181 if (!POINTER_TYPE_P (expr))
2182 TYPE_MINVAL (expr) = lto_input_tree (ib, data_in);
2183 TYPE_MAXVAL (expr) = lto_input_tree (ib, data_in);
2184 TYPE_MAIN_VARIANT (expr) = lto_input_tree (ib, data_in);
2185 /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
2187 if (RECORD_OR_UNION_TYPE_P (expr))
2188 TYPE_BINFO (expr) = lto_input_tree (ib, data_in);
2189 TYPE_CONTEXT (expr) = lto_input_tree (ib, data_in);
2190 TYPE_CANONICAL (expr) = lto_input_tree (ib, data_in);
2191 TYPE_STUB_DECL (expr) = lto_input_tree (ib, data_in);
2195 /* Read all pointer fields in the TS_LIST structure of EXPR from input
2196 block IB. DATA_IN contains tables and descriptors for the
2200 lto_input_ts_list_tree_pointers (struct lto_input_block *ib,
2201 struct data_in *data_in, tree expr)
2203 TREE_PURPOSE (expr) = lto_input_tree (ib, data_in);
2204 TREE_VALUE (expr) = lto_input_tree (ib, data_in);
2205 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
2209 /* Read all pointer fields in the TS_VEC structure of EXPR from input
2210 block IB. DATA_IN contains tables and descriptors for the
2214 lto_input_ts_vec_tree_pointers (struct lto_input_block *ib,
2215 struct data_in *data_in, tree expr)
2219 /* Note that TREE_VEC_LENGTH was read by lto_materialize_tree to
2220 instantiate EXPR. */
2221 for (i = 0; i < TREE_VEC_LENGTH (expr); i++)
2222 TREE_VEC_ELT (expr, i) = lto_input_tree (ib, data_in);
2226 /* Read all pointer fields in the TS_EXP structure of EXPR from input
2227 block IB. DATA_IN contains tables and descriptors for the
2232 lto_input_ts_exp_tree_pointers (struct lto_input_block *ib,
2233 struct data_in *data_in, tree expr)
2238 length = lto_input_sleb128 (ib);
2239 gcc_assert (length == TREE_OPERAND_LENGTH (expr));
2241 for (i = 0; i < length; i++)
2242 TREE_OPERAND (expr, i) = lto_input_tree (ib, data_in);
2244 loc = lto_input_location (ib, data_in);
2245 SET_EXPR_LOCATION (expr, loc);
2246 TREE_BLOCK (expr) = lto_input_tree (ib, data_in);
2250 /* Read all pointer fields in the TS_BLOCK structure of EXPR from input
2251 block IB. DATA_IN contains tables and descriptors for the
2255 lto_input_ts_block_tree_pointers (struct lto_input_block *ib,
2256 struct data_in *data_in, tree expr)
2260 BLOCK_SOURCE_LOCATION (expr) = lto_input_location (ib, data_in);
2261 BLOCK_VARS (expr) = lto_input_chain (ib, data_in);
2263 len = lto_input_uleb128 (ib);
2264 for (i = 0; i < len; i++)
2266 tree t = lto_input_tree (ib, data_in);
2267 VEC_safe_push (tree, gc, BLOCK_NONLOCALIZED_VARS (expr), t);
2270 BLOCK_SUPERCONTEXT (expr) = lto_input_tree (ib, data_in);
2271 BLOCK_ABSTRACT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2272 BLOCK_FRAGMENT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2273 BLOCK_FRAGMENT_CHAIN (expr) = lto_input_tree (ib, data_in);
2274 BLOCK_SUBBLOCKS (expr) = lto_input_chain (ib, data_in);
2278 /* Read all pointer fields in the TS_BINFO structure of EXPR from input
2279 block IB. DATA_IN contains tables and descriptors for the
2283 lto_input_ts_binfo_tree_pointers (struct lto_input_block *ib,
2284 struct data_in *data_in, tree expr)
2289 /* Note that the number of slots in EXPR was read in
2290 lto_materialize_tree when instantiating EXPR. However, the
2291 vector is empty so we cannot rely on VEC_length to know how many
2292 elements to read. So, this list is emitted as a 0-terminated
2293 list on the writer side. */
2296 t = lto_input_tree (ib, data_in);
2298 VEC_quick_push (tree, BINFO_BASE_BINFOS (expr), t);
2302 BINFO_OFFSET (expr) = lto_input_tree (ib, data_in);
2303 BINFO_VTABLE (expr) = lto_input_tree (ib, data_in);
2304 BINFO_VIRTUALS (expr) = lto_input_tree (ib, data_in);
2305 BINFO_VPTR_FIELD (expr) = lto_input_tree (ib, data_in);
2307 len = lto_input_uleb128 (ib);
2308 for (i = 0; i < len; i++)
2310 tree a = lto_input_tree (ib, data_in);
2311 VEC_safe_push (tree, gc, BINFO_BASE_ACCESSES (expr), a);
2314 BINFO_INHERITANCE_CHAIN (expr) = lto_input_tree (ib, data_in);
2315 BINFO_SUBVTT_INDEX (expr) = lto_input_tree (ib, data_in);
2316 BINFO_VPTR_INDEX (expr) = lto_input_tree (ib, data_in);
2320 /* Read all pointer fields in the TS_CONSTRUCTOR structure of EXPR from
2321 input block IB. DATA_IN contains tables and descriptors for the
2325 lto_input_ts_constructor_tree_pointers (struct lto_input_block *ib,
2326 struct data_in *data_in, tree expr)
2330 len = lto_input_uleb128 (ib);
2331 for (i = 0; i < len; i++)
2335 index = lto_input_tree (ib, data_in);
2336 value = lto_input_tree (ib, data_in);
2337 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (expr), index, value);
2342 /* Helper for lto_input_tree. Read all pointer fields in EXPR from
2343 input block IB. DATA_IN contains tables and descriptors for the
2347 lto_input_tree_pointers (struct lto_input_block *ib, struct data_in *data_in,
2350 enum tree_code code;
2352 code = TREE_CODE (expr);
2354 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
2355 lto_input_ts_common_tree_pointers (ib, data_in, expr);
2357 if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
2358 lto_input_ts_vector_tree_pointers (ib, data_in, expr);
2360 if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX))
2361 lto_input_ts_complex_tree_pointers (ib, data_in, expr);
2363 if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
2364 lto_input_ts_decl_minimal_tree_pointers (ib, data_in, expr);
2366 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
2367 lto_input_ts_decl_common_tree_pointers (ib, data_in, expr);
2369 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
2370 lto_input_ts_decl_non_common_tree_pointers (ib, data_in, expr);
2372 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
2373 lto_input_ts_decl_with_vis_tree_pointers (ib, data_in, expr);
2375 if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
2376 lto_input_ts_field_decl_tree_pointers (ib, data_in, expr);
2378 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
2379 lto_input_ts_function_decl_tree_pointers (ib, data_in, expr);
2381 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
2382 lto_input_ts_type_tree_pointers (ib, data_in, expr);
2384 if (CODE_CONTAINS_STRUCT (code, TS_LIST))
2385 lto_input_ts_list_tree_pointers (ib, data_in, expr);
2387 if (CODE_CONTAINS_STRUCT (code, TS_VEC))
2388 lto_input_ts_vec_tree_pointers (ib, data_in, expr);
2390 if (CODE_CONTAINS_STRUCT (code, TS_EXP))
2391 lto_input_ts_exp_tree_pointers (ib, data_in, expr);
2393 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
2395 /* We only stream the version number of SSA names. */
2399 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
2400 lto_input_ts_block_tree_pointers (ib, data_in, expr);
2402 if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
2403 lto_input_ts_binfo_tree_pointers (ib, data_in, expr);
2405 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
2407 /* This should only appear in GENERIC. */
2411 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
2412 lto_input_ts_constructor_tree_pointers (ib, data_in, expr);
2414 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
2416 /* This should only appear in High GIMPLE. */
2420 if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION))
2422 sorry ("optimization options not supported yet");
2425 if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION))
2427 sorry ("target optimization options not supported yet");
2432 /* Register DECL with the global symbol table and change its
2433 name if necessary to avoid name clashes for static globals across
2437 lto_register_var_decl_in_symtab (struct data_in *data_in, tree decl)
2439 /* Register symbols with file or global scope to mark what input
2440 file has their definition. */
2441 if (decl_function_context (decl) == NULL_TREE)
2443 /* Variable has file scope, not local. Need to ensure static variables
2444 between different files don't clash unexpectedly. */
2445 if (!TREE_PUBLIC (decl))
2447 /* ??? We normally pre-mangle names before we serialize them
2448 out. Here, in lto1, we do not know the language, and
2449 thus cannot do the mangling again. Instead, we just
2450 append a suffix to the mangled name. The resulting name,
2451 however, is not a properly-formed mangled name, and will
2452 confuse any attempt to unmangle it. */
2453 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2456 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
2457 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
2458 rest_of_decl_compilation (decl, 1, 0);
2462 /* If this variable has already been declared, queue the
2463 declaration for merging. */
2464 if (TREE_PUBLIC (decl))
2467 if (!lto_streamer_cache_lookup (data_in->reader_cache, decl, &ix))
2469 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
2470 data_in->file_data);
2476 /* Register DECL with the global symbol table and change its
2477 name if necessary to avoid name clashes for static globals across
2478 different files. DATA_IN contains descriptors and tables for the
2482 lto_register_function_decl_in_symtab (struct data_in *data_in, tree decl)
2484 /* Need to ensure static entities between different files
2485 don't clash unexpectedly. */
2486 if (!TREE_PUBLIC (decl))
2488 /* We must not use the DECL_ASSEMBLER_NAME macro here, as it
2489 may set the assembler name where it was previously empty. */
2490 tree old_assembler_name = decl->decl_with_vis.assembler_name;
2492 /* FIXME lto: We normally pre-mangle names before we serialize
2493 them out. Here, in lto1, we do not know the language, and
2494 thus cannot do the mangling again. Instead, we just append a
2495 suffix to the mangled name. The resulting name, however, is
2496 not a properly-formed mangled name, and will confuse any
2497 attempt to unmangle it. */
2498 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2501 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
2502 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
2504 /* We may arrive here with the old assembler name not set
2505 if the function body is not needed, e.g., it has been
2506 inlined away and does not appear in the cgraph. */
2507 if (old_assembler_name)
2509 tree new_assembler_name = DECL_ASSEMBLER_NAME (decl);
2511 /* Make the original assembler name available for later use.
2512 We may have used it to indicate the section within its
2513 object file where the function body may be found.
2514 FIXME lto: Find a better way to maintain the function decl
2515 to body section mapping so we don't need this hack. */
2516 lto_record_renamed_decl (data_in->file_data,
2517 IDENTIFIER_POINTER (old_assembler_name),
2518 IDENTIFIER_POINTER (new_assembler_name));
2520 /* Also register the reverse mapping so that we can find the
2521 new name given to an existing assembler name (used when
2522 restoring alias pairs in input_constructors_or_inits. */
2523 lto_record_renamed_decl (data_in->file_data,
2524 IDENTIFIER_POINTER (new_assembler_name),
2525 IDENTIFIER_POINTER (old_assembler_name));
2529 /* If this variable has already been declared, queue the
2530 declaration for merging. */
2531 if (TREE_PUBLIC (decl) && !DECL_ABSTRACT (decl))
2534 if (!lto_streamer_cache_lookup (data_in->reader_cache, decl, &ix))
2536 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
2537 data_in->file_data);
2542 /* Read an index IX from input block IB and return the tree node at
2543 DATA_IN->FILE_DATA->GLOBALS_INDEX[IX]. */
2546 lto_get_pickled_tree (struct lto_input_block *ib, struct data_in *data_in)
2550 enum LTO_tags expected_tag;
2551 unsigned HOST_WIDE_INT orig_offset;
2553 ix = lto_input_sleb128 (ib);
2554 expected_tag = (enum LTO_tags) lto_input_uleb128 (ib);
2556 orig_offset = lto_input_uleb128 (ib);
2557 gcc_assert (orig_offset == (unsigned) orig_offset);
2559 result = lto_streamer_cache_get (data_in->reader_cache, ix);
2560 if (result == NULL_TREE)
2562 /* We have not yet read the cache slot IX. Go to the offset
2563 in the stream where the physical tree node is, and materialize
2565 struct lto_input_block fwd_ib;
2567 /* If we are trying to go back in the stream, something is wrong.
2568 We should've read the node at the earlier position already. */
2569 if (ib->p >= orig_offset)
2570 internal_error ("bytecode stream: tried to jump backwards in the "
2573 LTO_INIT_INPUT_BLOCK (fwd_ib, ib->data, orig_offset, ib->len);
2574 result = lto_input_tree (&fwd_ib, data_in);
2578 && TREE_CODE (result) == lto_tag_to_tree_code (expected_tag));
2584 /* Read a code and class from input block IB and return the
2585 corresponding builtin. DATA_IN is as in lto_input_tree. */
2588 lto_get_builtin_tree (struct lto_input_block *ib, struct data_in *data_in)
2590 enum built_in_class fclass;
2591 enum built_in_function fcode;
2592 const char *asmname;
2596 fclass = (enum built_in_class) lto_input_uleb128 (ib);
2597 gcc_assert (fclass == BUILT_IN_NORMAL || fclass == BUILT_IN_MD);
2599 fcode = (enum built_in_function) lto_input_uleb128 (ib);
2601 ix = lto_input_sleb128 (ib);
2602 gcc_assert (ix == (int) ix);
2604 if (fclass == BUILT_IN_NORMAL)
2606 gcc_assert (fcode < END_BUILTINS);
2607 result = built_in_decls[fcode];
2608 gcc_assert (result);
2610 else if (fclass == BUILT_IN_MD)
2612 result = targetm.builtin_decl (fcode, true);
2613 if (!result || result == error_mark_node)
2614 fatal_error ("target specific builtin not available");
2619 asmname = input_string (data_in, ib);
2621 set_builtin_user_assembler_name (result, asmname);
2623 lto_streamer_cache_insert_at (data_in->reader_cache, result, ix);
2629 /* Read the physical representation of a tree node with tag TAG from
2630 input block IB using the per-file context in DATA_IN. */
2633 lto_read_tree (struct lto_input_block *ib, struct data_in *data_in,
2639 result = lto_materialize_tree (ib, data_in, tag, &ix);
2641 /* Read all the pointer fields in RESULT. */
2642 lto_input_tree_pointers (ib, data_in, result);
2644 /* We should never try to instantiate an MD or NORMAL builtin here. */
2645 if (TREE_CODE (result) == FUNCTION_DECL)
2646 gcc_assert (!lto_stream_as_builtin_p (result));
2648 if (TREE_CODE (result) == VAR_DECL)
2649 lto_register_var_decl_in_symtab (data_in, result);
2650 else if (TREE_CODE (result) == FUNCTION_DECL && !DECL_BUILT_IN (result))
2651 lto_register_function_decl_in_symtab (data_in, result);
2653 /* end_marker = */ lto_input_1_unsigned (ib);
2655 #ifdef LTO_STREAMER_DEBUG
2656 /* Remove the mapping to RESULT's original address set by
2657 lto_materialize_tree. */
2658 lto_orig_address_remove (result);
2665 /* Read and INTEGER_CST node from input block IB using the per-file
2666 context in DATA_IN. */
2669 lto_input_integer_cst (struct lto_input_block *ib, struct data_in *data_in)
2672 HOST_WIDE_INT low, high;
2675 type = lto_input_tree (ib, data_in);
2676 overflow_p = (lto_input_1_unsigned (ib) != 0);
2677 low = lto_input_uleb128 (ib);
2678 high = lto_input_uleb128 (ib);
2679 result = build_int_cst_wide (type, low, high);
2681 /* If the original constant had overflown, build a replica of RESULT to
2682 avoid modifying the shared constant returned by build_int_cst_wide. */
2685 result = copy_node (result);
2686 TREE_OVERFLOW (result) = 1;
2693 /* Read a tree from input block IB using the per-file context in
2694 DATA_IN. This context is used, for example, to resolve references
2695 to previously read nodes. */
2698 lto_input_tree (struct lto_input_block *ib, struct data_in *data_in)
2703 tag = input_record_start (ib);
2704 gcc_assert ((unsigned) tag < (unsigned) LTO_NUM_TAGS);
2706 if (tag == LTO_null)
2708 else if (tag >= LTO_field_decl_ref && tag <= LTO_global_decl_ref)
2710 /* If TAG is a reference to an indexable tree, the next value
2711 in IB is the index into the table where we expect to find
2713 result = lto_input_tree_ref (ib, data_in, cfun, tag);
2715 else if (tag == LTO_tree_pickle_reference)
2717 /* If TAG is a reference to a previously read tree, look it up in
2718 the reader cache. */
2719 result = lto_get_pickled_tree (ib, data_in);
2721 else if (tag == LTO_builtin_decl)
2723 /* If we are going to read a built-in function, all we need is
2724 the code and class. */
2725 result = lto_get_builtin_tree (ib, data_in);
2727 else if (tag == lto_tree_code_to_tag (INTEGER_CST))
2729 /* For integer constants we only need the type and its hi/low
2731 result = lto_input_integer_cst (ib, data_in);
2735 /* Otherwise, materialize a new node from IB. */
2736 result = lto_read_tree (ib, data_in, tag);
2743 /* Initialization for the LTO reader. */
2746 lto_init_reader (void)
2748 lto_streamer_init ();
2750 memset (<o_stats, 0, sizeof (lto_stats));
2751 bitmap_obstack_initialize (NULL);
2753 file_name_hash_table = htab_create (37, hash_string_slot_node,
2754 eq_string_slot_node, free);
2756 gimple_register_cfg_hooks ();
2760 /* Create a new data_in object for FILE_DATA. STRINGS is the string
2761 table to use with LEN strings. RESOLUTIONS is the vector of linker
2762 resolutions (NULL if not using a linker plugin). */
2765 lto_data_in_create (struct lto_file_decl_data *file_data, const char *strings,
2767 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions)
2769 struct data_in *data_in = XCNEW (struct data_in);
2770 data_in->file_data = file_data;
2771 data_in->strings = strings;
2772 data_in->strings_len = len;
2773 data_in->globals_resolution = resolutions;
2774 data_in->reader_cache = lto_streamer_cache_create ();
2780 /* Remove DATA_IN. */
2783 lto_data_in_delete (struct data_in *data_in)
2785 VEC_free (ld_plugin_symbol_resolution_t, heap, data_in->globals_resolution);
2786 lto_streamer_cache_delete (data_in->reader_cache);
2787 free (data_in->labels);