1 /* Read the GIMPLE representation from a file stream.
3 Copyright 2009 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"
35 #include "basic-block.h"
36 #include "tree-flow.h"
37 #include "tree-pass.h"
41 #include "diagnostic.h"
48 #include "ipa-utils.h"
49 #include "lto-streamer.h"
50 #include "tree-pass.h"
52 /* Data structure used to hash file names in the source_location field. */
56 unsigned int slot_num;
59 /* The table to hold the file names. */
60 static htab_t file_name_hash_table;
63 /* Check that tag ACTUAL has one of the given values. NUM_TAGS is the
64 number of valid tag values to check. */
67 lto_tag_check_set (enum LTO_tags actual, int ntags, ...)
73 for (i = 0; i < ntags; i++)
74 if ((unsigned) actual == va_arg (ap, unsigned))
81 internal_error ("bytecode stream: unexpected tag %s", lto_tag_name (actual));
85 /* Check that tag ACTUAL is in the range [TAG1, TAG2]. */
88 lto_tag_check_range (enum LTO_tags actual, enum LTO_tags tag1,
91 if (actual < tag1 || actual > tag2)
92 internal_error ("bytecode stream: tag %s is not in the expected range "
94 lto_tag_name (actual),
100 /* Check that tag ACTUAL == EXPECTED. */
103 lto_tag_check (enum LTO_tags actual, enum LTO_tags expected)
105 if (actual != expected)
106 internal_error ("bytecode stream: expected tag %s instead of %s",
107 lto_tag_name (expected), lto_tag_name (actual));
111 /* Return a hash code for P. */
114 hash_string_slot_node (const void *p)
116 const struct string_slot *ds = (const struct string_slot *) p;
117 return (hashval_t) htab_hash_string (ds->s);
121 /* Returns nonzero if P1 and P2 are equal. */
124 eq_string_slot_node (const void *p1, const void *p2)
126 const struct string_slot *ds1 = (const struct string_slot *) p1;
127 const struct string_slot *ds2 = (const struct string_slot *) p2;
128 return strcmp (ds1->s, ds2->s) == 0;
132 /* Read a string from the string table in DATA_IN using input block
133 IB. Write the length to RLEN. */
136 input_string_internal (struct data_in *data_in, struct lto_input_block *ib,
139 struct lto_input_block str_tab;
144 loc = lto_input_uleb128 (ib);
145 LTO_INIT_INPUT_BLOCK (str_tab, data_in->strings, loc, data_in->strings_len);
146 len = lto_input_uleb128 (&str_tab);
149 if (str_tab.p + len > data_in->strings_len)
150 internal_error ("bytecode stream: string too long for the string table");
152 result = (const char *)(data_in->strings + str_tab.p);
158 /* Read a STRING_CST from the string table in DATA_IN using input
162 input_string_cst (struct data_in *data_in, struct lto_input_block *ib)
166 unsigned int is_null;
168 is_null = lto_input_uleb128 (ib);
172 ptr = input_string_internal (data_in, ib, &len);
173 return build_string (len, ptr);
177 /* Read an IDENTIFIER from the string table in DATA_IN using input
181 input_identifier (struct data_in *data_in, struct lto_input_block *ib)
185 unsigned int is_null;
187 is_null = lto_input_uleb128 (ib);
191 ptr = input_string_internal (data_in, ib, &len);
192 return get_identifier_with_length (ptr, len);
195 /* Read a NULL terminated string from the string table in DATA_IN. */
198 input_string (struct data_in *data_in, struct lto_input_block *ib)
202 unsigned int is_null;
204 is_null = lto_input_uleb128 (ib);
208 ptr = input_string_internal (data_in, ib, &len);
209 if (ptr[len - 1] != '\0')
210 internal_error ("bytecode stream: found non-null terminated string");
216 /* Return the next tag in the input block IB. */
219 input_record_start (struct lto_input_block *ib)
221 enum LTO_tags tag = (enum LTO_tags) lto_input_uleb128 (ib);
226 /* Lookup STRING in file_name_hash_table. If found, return the existing
227 string, otherwise insert STRING as the canonical version. */
230 canon_file_name (const char *string)
233 struct string_slot s_slot;
236 slot = htab_find_slot (file_name_hash_table, &s_slot, INSERT);
241 struct string_slot *new_slot;
243 len = strlen (string);
244 saved_string = (char *) xmalloc (len + 1);
245 new_slot = XCNEW (struct string_slot);
246 strcpy (saved_string, string);
247 new_slot->s = saved_string;
253 struct string_slot *old_slot = (struct string_slot *) *slot;
259 /* Clear the line info stored in DATA_IN. */
262 clear_line_info (struct data_in *data_in)
264 if (data_in->current_file)
265 linemap_add (line_table, LC_LEAVE, false, NULL, 0);
266 data_in->current_file = NULL;
267 data_in->current_line = 0;
268 data_in->current_col = 0;
272 /* Read a location from input block IB. */
275 lto_input_location (struct lto_input_block *ib, struct data_in *data_in)
277 expanded_location xloc;
279 xloc.file = input_string (data_in, ib);
280 if (xloc.file == NULL)
281 return UNKNOWN_LOCATION;
283 xloc.file = canon_file_name (xloc.file);
284 xloc.line = lto_input_sleb128 (ib);
285 xloc.column = lto_input_sleb128 (ib);
286 xloc.sysp = lto_input_sleb128 (ib);
288 if (data_in->current_file != xloc.file)
290 if (data_in->current_file)
291 linemap_add (line_table, LC_LEAVE, false, NULL, 0);
293 linemap_add (line_table, LC_ENTER, xloc.sysp, xloc.file, xloc.line);
295 else if (data_in->current_line != xloc.line)
296 linemap_line_start (line_table, xloc.line, xloc.column);
298 data_in->current_file = xloc.file;
299 data_in->current_line = xloc.line;
300 data_in->current_col = xloc.column;
302 return linemap_position_for_column (line_table, xloc.column);
306 /* Read a reference to a tree node from DATA_IN using input block IB.
307 TAG is the expected node that should be found in IB, if TAG belongs
308 to one of the indexable trees, expect to read a reference index to
309 be looked up in one of the symbol tables, otherwise read the pysical
310 representation of the tree using lto_input_tree. FN is the
311 function scope for the read tree. */
314 lto_input_tree_ref (struct lto_input_block *ib, struct data_in *data_in,
315 struct function *fn, enum LTO_tags tag)
317 unsigned HOST_WIDE_INT ix_u;
318 tree result = NULL_TREE;
320 lto_tag_check_range (tag, LTO_field_decl_ref, LTO_global_decl_ref);
325 ix_u = lto_input_uleb128 (ib);
326 result = lto_file_decl_data_get_type (data_in->file_data, ix_u);
329 case LTO_ssa_name_ref:
330 ix_u = lto_input_uleb128 (ib);
331 result = VEC_index (tree, SSANAMES (fn), ix_u);
334 case LTO_field_decl_ref:
335 ix_u = lto_input_uleb128 (ib);
336 result = lto_file_decl_data_get_field_decl (data_in->file_data, ix_u);
339 case LTO_function_decl_ref:
340 ix_u = lto_input_uleb128 (ib);
341 result = lto_file_decl_data_get_fn_decl (data_in->file_data, ix_u);
344 case LTO_type_decl_ref:
345 ix_u = lto_input_uleb128 (ib);
346 result = lto_file_decl_data_get_type_decl (data_in->file_data, ix_u);
349 case LTO_namespace_decl_ref:
350 ix_u = lto_input_uleb128 (ib);
351 result = lto_file_decl_data_get_namespace_decl (data_in->file_data, ix_u);
354 case LTO_global_decl_ref:
355 case LTO_result_decl_ref:
356 case LTO_const_decl_ref:
357 case LTO_imported_decl_ref:
358 case LTO_label_decl_ref:
359 ix_u = lto_input_uleb128 (ib);
360 result = lto_file_decl_data_get_var_decl (data_in->file_data, ix_u);
361 if (TREE_CODE (result) == VAR_DECL)
362 varpool_mark_needed_node (varpool_node (result));
375 /* Read and return a double-linked list of catch handlers from input
376 block IB, using descriptors in DATA_IN. */
378 static struct eh_catch_d *
379 lto_input_eh_catch_list (struct lto_input_block *ib, struct data_in *data_in,
385 *last_p = first = NULL;
386 tag = input_record_start (ib);
392 lto_tag_check_range (tag, LTO_eh_catch, LTO_eh_catch);
394 /* Read the catch node. */
395 n = GGC_CNEW (struct eh_catch_d);
396 n->type_list = lto_input_tree (ib, data_in);
397 n->filter_list = lto_input_tree (ib, data_in);
398 n->label = lto_input_tree (ib, data_in);
400 /* Register all the types in N->FILTER_LIST. */
401 for (list = n->filter_list; list; list = TREE_CHAIN (list))
402 add_type_for_runtime (TREE_VALUE (list));
404 /* Chain N to the end of the list. */
406 (*last_p)->next_catch = n;
407 n->prev_catch = *last_p;
410 /* Set the head of the list the first time through the loop. */
414 tag = input_record_start (ib);
421 /* Read and return EH region IX from input block IB, using descriptors
425 input_eh_region (struct lto_input_block *ib, struct data_in *data_in, int ix)
430 /* Read the region header. */
431 tag = input_record_start (ib);
435 r = GGC_CNEW (struct eh_region_d);
436 r->index = lto_input_sleb128 (ib);
438 gcc_assert (r->index == ix);
440 /* Read all the region pointers as region numbers. We'll fix up
441 the pointers once the whole array has been read. */
442 r->outer = (eh_region) (intptr_t) lto_input_sleb128 (ib);
443 r->inner = (eh_region) (intptr_t) lto_input_sleb128 (ib);
444 r->next_peer = (eh_region) (intptr_t) lto_input_sleb128 (ib);
448 case LTO_ert_cleanup:
449 r->type = ERT_CLEANUP;
454 struct eh_catch_d *last_catch;
456 r->u.eh_try.first_catch = lto_input_eh_catch_list (ib, data_in,
458 r->u.eh_try.last_catch = last_catch;
462 case LTO_ert_allowed_exceptions:
466 r->type = ERT_ALLOWED_EXCEPTIONS;
467 r->u.allowed.type_list = lto_input_tree (ib, data_in);
468 r->u.allowed.label = lto_input_tree (ib, data_in);
469 r->u.allowed.filter = lto_input_uleb128 (ib);
471 for (l = r->u.allowed.type_list; l ; l = TREE_CHAIN (l))
472 add_type_for_runtime (TREE_VALUE (l));
476 case LTO_ert_must_not_throw:
477 r->type = ERT_MUST_NOT_THROW;
478 r->u.must_not_throw.failure_decl = lto_input_tree (ib, data_in);
479 r->u.must_not_throw.failure_loc = lto_input_location (ib, data_in);
486 r->landing_pads = (eh_landing_pad) (intptr_t) lto_input_sleb128 (ib);
492 /* Read and return EH landing pad IX from input block IB, using descriptors
495 static eh_landing_pad
496 input_eh_lp (struct lto_input_block *ib, struct data_in *data_in, int ix)
501 /* Read the landing pad header. */
502 tag = input_record_start (ib);
506 lto_tag_check_range (tag, LTO_eh_landing_pad, LTO_eh_landing_pad);
508 lp = GGC_CNEW (struct eh_landing_pad_d);
509 lp->index = lto_input_sleb128 (ib);
510 gcc_assert (lp->index == ix);
511 lp->next_lp = (eh_landing_pad) (intptr_t) lto_input_sleb128 (ib);
512 lp->region = (eh_region) (intptr_t) lto_input_sleb128 (ib);
513 lp->post_landing_pad = lto_input_tree (ib, data_in);
519 /* After reading the EH regions, pointers to peer and children regions
520 are region numbers. This converts all these region numbers into
521 real pointers into the rematerialized regions for FN. ROOT_REGION
522 is the region number for the root EH region in FN. */
525 fixup_eh_region_pointers (struct function *fn, HOST_WIDE_INT root_region)
528 VEC(eh_region,gc) *eh_array = fn->eh->region_array;
529 VEC(eh_landing_pad,gc) *lp_array = fn->eh->lp_array;
533 gcc_assert (eh_array && lp_array);
535 gcc_assert (root_region >= 0);
536 fn->eh->region_tree = VEC_index (eh_region, eh_array, root_region);
538 #define FIXUP_EH_REGION(r) (r) = VEC_index (eh_region, eh_array, \
539 (HOST_WIDE_INT) (intptr_t) (r))
540 #define FIXUP_EH_LP(p) (p) = VEC_index (eh_landing_pad, lp_array, \
541 (HOST_WIDE_INT) (intptr_t) (p))
543 /* Convert all the index numbers stored in pointer fields into
544 pointers to the corresponding slots in the EH region array. */
545 for (i = 0; VEC_iterate (eh_region, eh_array, i, r); i++)
547 /* The array may contain NULL regions. */
551 gcc_assert (i == (unsigned) r->index);
552 FIXUP_EH_REGION (r->outer);
553 FIXUP_EH_REGION (r->inner);
554 FIXUP_EH_REGION (r->next_peer);
555 FIXUP_EH_LP (r->landing_pads);
558 /* Convert all the index numbers stored in pointer fields into
559 pointers to the corresponding slots in the EH landing pad array. */
560 for (i = 0; VEC_iterate (eh_landing_pad, lp_array, i, lp); i++)
562 /* The array may contain NULL landing pads. */
566 gcc_assert (i == (unsigned) lp->index);
567 FIXUP_EH_LP (lp->next_lp);
568 FIXUP_EH_REGION (lp->region);
571 #undef FIXUP_EH_REGION
576 /* Initialize EH support. */
581 static bool eh_initialized_p = false;
583 if (eh_initialized_p)
586 /* Contrary to most other FEs, we only initialize EH support when at
587 least one of the files in the set contains exception regions in
588 it. Since this happens much later than the call to init_eh in
589 lang_dependent_init, we have to set flag_exceptions and call
590 init_eh again to initialize the EH tables. */
594 /* Initialize dwarf2 tables. Since dwarf2out_do_frame() returns
595 true only when exceptions are enabled, this initialization is
596 never done during lang_dependent_init. */
597 #if defined DWARF2_DEBUGGING_INFO || defined DWARF2_UNWIND_INFO
598 if (dwarf2out_do_frame ())
599 dwarf2out_frame_init ();
602 eh_initialized_p = true;
606 /* Read the exception table for FN from IB using the data descriptors
610 input_eh_regions (struct lto_input_block *ib, struct data_in *data_in,
613 HOST_WIDE_INT i, root_region, len;
616 tag = input_record_start (ib);
620 lto_tag_check_range (tag, LTO_eh_table, LTO_eh_table);
622 /* If the file contains EH regions, then it was compiled with
623 -fexceptions. In that case, initialize the backend EH
629 root_region = lto_input_sleb128 (ib);
630 gcc_assert (root_region == (int) root_region);
632 /* Read the EH region array. */
633 len = lto_input_sleb128 (ib);
634 gcc_assert (len == (int) len);
637 VEC_safe_grow (eh_region, gc, fn->eh->region_array, len);
638 for (i = 0; i < len; i++)
640 eh_region r = input_eh_region (ib, data_in, i);
641 VEC_replace (eh_region, fn->eh->region_array, i, r);
645 /* Read the landing pads. */
646 len = lto_input_sleb128 (ib);
647 gcc_assert (len == (int) len);
650 VEC_safe_grow (eh_landing_pad, gc, fn->eh->lp_array, len);
651 for (i = 0; i < len; i++)
653 eh_landing_pad lp = input_eh_lp (ib, data_in, i);
654 VEC_replace (eh_landing_pad, fn->eh->lp_array, i, lp);
658 /* Read the runtime type data. */
659 len = lto_input_sleb128 (ib);
660 gcc_assert (len == (int) len);
663 VEC_safe_grow (tree, gc, fn->eh->ttype_data, len);
664 for (i = 0; i < len; i++)
666 tree ttype = lto_input_tree (ib, data_in);
667 VEC_replace (tree, fn->eh->ttype_data, i, ttype);
671 /* Read the table of action chains. */
672 len = lto_input_sleb128 (ib);
673 gcc_assert (len == (int) len);
676 if (targetm.arm_eabi_unwinder)
678 VEC_safe_grow (tree, gc, fn->eh->ehspec_data.arm_eabi, len);
679 for (i = 0; i < len; i++)
681 tree t = lto_input_tree (ib, data_in);
682 VEC_replace (tree, fn->eh->ehspec_data.arm_eabi, i, t);
687 VEC_safe_grow (uchar, gc, fn->eh->ehspec_data.other, len);
688 for (i = 0; i < len; i++)
690 uchar c = lto_input_1_unsigned (ib);
691 VEC_replace (uchar, fn->eh->ehspec_data.other, i, c);
696 /* Reconstruct the EH region tree by fixing up the peer/children
698 fixup_eh_region_pointers (fn, root_region);
700 tag = input_record_start (ib);
701 lto_tag_check_range (tag, LTO_null, LTO_null);
705 /* Make a new basic block with index INDEX in function FN. */
708 make_new_block (struct function *fn, unsigned int index)
710 basic_block bb = alloc_block ();
712 SET_BASIC_BLOCK_FOR_FUNCTION (fn, index, bb);
713 bb->il.gimple = GGC_CNEW (struct gimple_bb_info);
714 n_basic_blocks_for_function (fn)++;
716 set_bb_seq (bb, gimple_seq_alloc ());
721 /* Read the CFG for function FN from input block IB. */
724 input_cfg (struct lto_input_block *ib, struct function *fn)
726 unsigned int bb_count;
731 init_empty_tree_cfg_for_function (fn);
732 init_ssa_operands ();
734 profile_status_for_function (fn) =
735 (enum profile_status_d) lto_input_uleb128 (ib);
737 bb_count = lto_input_uleb128 (ib);
739 last_basic_block_for_function (fn) = bb_count;
740 if (bb_count > VEC_length (basic_block, basic_block_info_for_function (fn)))
741 VEC_safe_grow_cleared (basic_block, gc,
742 basic_block_info_for_function (fn), bb_count);
744 if (bb_count > VEC_length (basic_block, label_to_block_map_for_function (fn)))
745 VEC_safe_grow_cleared (basic_block, gc,
746 label_to_block_map_for_function (fn), bb_count);
748 index = lto_input_sleb128 (ib);
751 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
752 unsigned int edge_count;
755 bb = make_new_block (fn, index);
757 edge_count = lto_input_uleb128 (ib);
759 /* Connect up the CFG. */
760 for (i = 0; i < edge_count; i++)
762 unsigned int dest_index;
763 unsigned int edge_flags;
769 dest_index = lto_input_uleb128 (ib);
770 probability = (int) lto_input_sleb128 (ib);
771 count = (gcov_type) lto_input_sleb128 (ib);
772 edge_flags = lto_input_uleb128 (ib);
774 dest = BASIC_BLOCK_FOR_FUNCTION (fn, dest_index);
777 dest = make_new_block (fn, dest_index);
779 e = make_edge (bb, dest, edge_flags);
780 e->probability = probability;
784 index = lto_input_sleb128 (ib);
787 p_bb = ENTRY_BLOCK_PTR_FOR_FUNCTION(fn);
788 index = lto_input_sleb128 (ib);
791 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
795 index = lto_input_sleb128 (ib);
800 /* Read a PHI function for basic block BB in function FN. DATA_IN is
801 the file being read. IB is the input block to use for reading. */
804 input_phi (struct lto_input_block *ib, basic_block bb, struct data_in *data_in,
807 unsigned HOST_WIDE_INT ix;
812 ix = lto_input_uleb128 (ib);
813 phi_result = VEC_index (tree, SSANAMES (fn), ix);
814 len = EDGE_COUNT (bb->preds);
815 result = create_phi_node (phi_result, bb);
816 SSA_NAME_DEF_STMT (phi_result) = result;
818 /* We have to go through a lookup process here because the preds in the
819 reconstructed graph are generally in a different order than they
820 were in the original program. */
821 for (i = 0; i < len; i++)
823 tree def = lto_input_tree (ib, data_in);
824 int src_index = lto_input_uleb128 (ib);
825 location_t arg_loc = lto_input_location (ib, data_in);
826 basic_block sbb = BASIC_BLOCK_FOR_FUNCTION (fn, src_index);
831 for (j = 0; j < len; j++)
832 if (EDGE_PRED (bb, j)->src == sbb)
834 e = EDGE_PRED (bb, j);
838 add_phi_arg (result, def, e, arg_loc);
845 /* Read the SSA names array for function FN from DATA_IN using input
849 input_ssa_names (struct lto_input_block *ib, struct data_in *data_in,
852 unsigned int i, size;
854 size = lto_input_uleb128 (ib);
855 init_ssanames (fn, size);
857 i = lto_input_uleb128 (ib);
863 /* Skip over the elements that had been freed. */
864 while (VEC_length (tree, SSANAMES (fn)) < i)
865 VEC_quick_push (tree, SSANAMES (fn), NULL_TREE);
867 is_default_def = (lto_input_1_unsigned (ib) != 0);
868 name = lto_input_tree (ib, data_in);
869 ssa_name = make_ssa_name_fn (fn, name, gimple_build_nop ());
872 set_default_def (SSA_NAME_VAR (ssa_name), ssa_name);
874 i = lto_input_uleb128 (ib);
879 /* Fixup the reference tree OP for replaced VAR_DECLs with mismatched
883 maybe_fixup_handled_component (tree op)
888 while (handled_component_p (TREE_OPERAND (op, 0)))
889 op = TREE_OPERAND (op, 0);
890 if (TREE_CODE (TREE_OPERAND (op, 0)) != VAR_DECL)
893 decl_type = TREE_TYPE (TREE_OPERAND (op, 0));
895 switch (TREE_CODE (op))
898 /* The DECL_CONTEXT of the field-decl is the record type we look for. */
899 wanted_type = DECL_CONTEXT (TREE_OPERAND (op, 1));
903 if (TREE_CODE (decl_type) == ARRAY_TYPE
904 && (TREE_TYPE (decl_type) == TREE_TYPE (op)
905 || useless_type_conversion_p (TREE_TYPE (op),
906 TREE_TYPE (decl_type))))
908 /* An unknown size array type should be ok. But we do not
909 lower the lower bound in all cases - ugh. */
910 wanted_type = build_array_type (TREE_TYPE (op), NULL_TREE);
913 case ARRAY_RANGE_REF:
914 if (TREE_CODE (decl_type) == ARRAY_TYPE
915 && (TREE_TYPE (decl_type) == TREE_TYPE (TREE_TYPE (op))
916 || useless_type_conversion_p (TREE_TYPE (TREE_TYPE (op)),
917 TREE_TYPE (decl_type))))
919 /* An unknown size array type should be ok. But we do not
920 lower the lower bound in all cases - ugh. */
921 wanted_type = build_array_type (TREE_TYPE (TREE_TYPE (op)), NULL_TREE);
925 case VIEW_CONVERT_EXPR:
926 /* Very nice - nothing to do. */
931 if (TREE_CODE (decl_type) == COMPLEX_TYPE
932 && (TREE_TYPE (decl_type) == TREE_TYPE (op)
933 || useless_type_conversion_p (TREE_TYPE (op),
934 TREE_TYPE (decl_type))))
936 wanted_type = build_complex_type (TREE_TYPE (op));
943 if (!useless_type_conversion_p (wanted_type, decl_type))
944 TREE_OPERAND (op, 0) = build1 (VIEW_CONVERT_EXPR, wanted_type,
945 TREE_OPERAND (op, 0));
948 /* Fixup reference tree operands for substituted prevailing decls
949 with mismatched types in STMT. */
952 maybe_fixup_decls (gimple stmt)
954 /* We have to fixup replaced decls here in case there were
955 inter-TU type mismatches. Catch the most common cases
956 for now - this way we'll get testcases for the rest as
957 the type verifier will complain. */
958 if (gimple_assign_single_p (stmt))
960 tree lhs = gimple_assign_lhs (stmt);
961 tree rhs = gimple_assign_rhs1 (stmt);
963 /* First catch loads and aggregate copies by adjusting the rhs. */
964 if (TREE_CODE (rhs) == VAR_DECL)
966 if (!useless_type_conversion_p (TREE_TYPE (lhs), TREE_TYPE (rhs)))
967 gimple_assign_set_rhs1 (stmt, build1 (VIEW_CONVERT_EXPR,
968 TREE_TYPE (lhs), rhs));
970 else if (handled_component_p (rhs))
971 maybe_fixup_handled_component (rhs);
972 /* Then catch scalar stores. */
973 else if (TREE_CODE (lhs) == VAR_DECL)
975 if (!useless_type_conversion_p (TREE_TYPE (lhs), TREE_TYPE (rhs)))
976 gimple_assign_set_lhs (stmt, build1 (VIEW_CONVERT_EXPR,
977 TREE_TYPE (rhs), lhs));
979 else if (handled_component_p (lhs))
980 maybe_fixup_handled_component (lhs);
982 else if (is_gimple_call (stmt))
984 tree lhs = gimple_call_lhs (stmt);
986 if (lhs && TREE_CODE (lhs) == VAR_DECL)
988 if (!useless_type_conversion_p (TREE_TYPE (lhs),
989 gimple_call_return_type (stmt)))
990 gimple_call_set_lhs (stmt, build1 (VIEW_CONVERT_EXPR,
991 gimple_call_return_type (stmt),
994 else if (lhs && handled_component_p (lhs))
995 maybe_fixup_handled_component (lhs);
997 /* Arguments, especially for varargs functions will be funny... */
1001 /* Read a statement with tag TAG in function FN from block IB using
1002 descriptors in DATA_IN. */
1005 input_gimple_stmt (struct lto_input_block *ib, struct data_in *data_in,
1006 struct function *fn, enum LTO_tags tag)
1009 enum gimple_code code;
1010 unsigned HOST_WIDE_INT num_ops;
1012 struct bitpack_d *bp;
1014 code = lto_tag_to_gimple_code (tag);
1016 /* Read the tuple header. */
1017 bp = lto_input_bitpack (ib);
1018 num_ops = bp_unpack_value (bp, sizeof (unsigned) * 8);
1019 stmt = gimple_alloc (code, num_ops);
1020 stmt->gsbase.no_warning = bp_unpack_value (bp, 1);
1021 if (is_gimple_assign (stmt))
1022 stmt->gsbase.nontemporal_move = bp_unpack_value (bp, 1);
1023 stmt->gsbase.has_volatile_ops = bp_unpack_value (bp, 1);
1024 stmt->gsbase.subcode = bp_unpack_value (bp, 16);
1025 bitpack_delete (bp);
1027 /* Read location information. */
1028 gimple_set_location (stmt, lto_input_location (ib, data_in));
1030 /* Read lexical block reference. */
1031 gimple_set_block (stmt, lto_input_tree (ib, data_in));
1033 /* Read in all the operands. */
1037 gimple_resx_set_region (stmt, lto_input_sleb128 (ib));
1040 case GIMPLE_EH_MUST_NOT_THROW:
1041 gimple_eh_must_not_throw_set_fndecl (stmt, lto_input_tree (ib, data_in));
1044 case GIMPLE_EH_DISPATCH:
1045 gimple_eh_dispatch_set_region (stmt, lto_input_sleb128 (ib));
1050 /* FIXME lto. Move most of this into a new gimple_asm_set_string(). */
1052 stmt->gimple_asm.ni = lto_input_uleb128 (ib);
1053 stmt->gimple_asm.no = lto_input_uleb128 (ib);
1054 stmt->gimple_asm.nc = lto_input_uleb128 (ib);
1055 str = input_string_cst (data_in, ib);
1056 stmt->gimple_asm.string = TREE_STRING_POINTER (str);
1068 for (i = 0; i < num_ops; i++)
1070 tree op = lto_input_tree (ib, data_in);
1071 gimple_set_op (stmt, i, op);
1073 /* Fixup FIELD_DECLs. */
1074 while (op && handled_component_p (op))
1076 if (TREE_CODE (op) == COMPONENT_REF)
1078 tree field, type, tem;
1079 field = TREE_OPERAND (op, 1);
1080 type = DECL_CONTEXT (field);
1081 for (tem = TYPE_FIELDS (type); tem; tem = TREE_CHAIN (tem))
1084 || (TREE_TYPE (tem) == TREE_TYPE (field)
1085 && compare_field_offset (tem, field)))
1088 /* In case of type mismatches across units we can fail
1089 to unify some types and thus not find a proper
1090 field-decl here. So only assert here if checking
1092 #ifdef ENABLE_CHECKING
1093 gcc_assert (tem != NULL_TREE);
1095 if (tem != NULL_TREE)
1096 TREE_OPERAND (op, 1) = tem;
1099 op = TREE_OPERAND (op, 0);
1105 case GIMPLE_PREDICT:
1109 internal_error ("bytecode stream: unknown GIMPLE statement tag %s",
1110 lto_tag_name (tag));
1113 /* Update the properties of symbols, SSA names and labels associated
1115 if (code == GIMPLE_ASSIGN || code == GIMPLE_CALL)
1117 tree lhs = gimple_get_lhs (stmt);
1118 if (lhs && TREE_CODE (lhs) == SSA_NAME)
1119 SSA_NAME_DEF_STMT (lhs) = stmt;
1121 else if (code == GIMPLE_LABEL)
1122 gcc_assert (emit_label_in_global_context_p (gimple_label_label (stmt))
1123 || DECL_CONTEXT (gimple_label_label (stmt)) == fn->decl);
1124 else if (code == GIMPLE_ASM)
1128 for (i = 0; i < gimple_asm_noutputs (stmt); i++)
1130 tree op = TREE_VALUE (gimple_asm_output_op (stmt, i));
1131 if (TREE_CODE (op) == SSA_NAME)
1132 SSA_NAME_DEF_STMT (op) = stmt;
1136 /* Fixup reference tree operands for substituted prevailing decls
1137 with mismatched types. */
1138 maybe_fixup_decls (stmt);
1140 /* Mark the statement modified so its operand vectors can be filled in. */
1141 gimple_set_modified (stmt, true);
1147 /* Read a basic block with tag TAG from DATA_IN using input block IB.
1148 FN is the function being processed. */
1151 input_bb (struct lto_input_block *ib, enum LTO_tags tag,
1152 struct data_in *data_in, struct function *fn)
1156 gimple_stmt_iterator bsi;
1158 /* This routine assumes that CFUN is set to FN, as it needs to call
1159 basic GIMPLE routines that use CFUN. */
1160 gcc_assert (cfun == fn);
1162 index = lto_input_uleb128 (ib);
1163 bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
1165 bb->count = lto_input_sleb128 (ib);
1166 bb->loop_depth = lto_input_sleb128 (ib);
1167 bb->frequency = lto_input_sleb128 (ib);
1168 bb->flags = lto_input_sleb128 (ib);
1170 /* LTO_bb1 has statements. LTO_bb0 does not. */
1174 bsi = gsi_start_bb (bb);
1175 tag = input_record_start (ib);
1178 gimple stmt = input_gimple_stmt (ib, data_in, fn, tag);
1180 /* Change debug stmts to nops on-the-fly if we do not have VTA enabled.
1181 This allows us to build for example static libs with debugging
1182 enabled and do the final link without. */
1183 if (!MAY_HAVE_DEBUG_STMTS
1184 && is_gimple_debug (stmt))
1185 stmt = gimple_build_nop ();
1187 find_referenced_vars_in (stmt);
1188 gsi_insert_after (&bsi, stmt, GSI_NEW_STMT);
1190 /* After the statement, expect a 0 delimiter or the EH region
1191 that the previous statement belongs to. */
1192 tag = input_record_start (ib);
1193 lto_tag_check_set (tag, 2, LTO_eh_region, LTO_null);
1195 if (tag == LTO_eh_region)
1197 HOST_WIDE_INT region = lto_input_sleb128 (ib);
1198 gcc_assert (region == (int) region);
1199 add_stmt_to_eh_lp (stmt, region);
1202 tag = input_record_start (ib);
1205 tag = input_record_start (ib);
1208 gimple phi = input_phi (ib, bb, data_in, fn);
1209 find_referenced_vars_in (phi);
1210 tag = input_record_start (ib);
1214 /* Go through all NODE edges and fixup call_stmt pointers
1215 so they point to STMTS. */
1218 fixup_call_stmt_edges_1 (struct cgraph_node *node, gimple *stmts)
1220 struct cgraph_edge *cedge;
1221 for (cedge = node->callees; cedge; cedge = cedge->next_callee)
1222 cedge->call_stmt = stmts[cedge->lto_stmt_uid];
1225 /* Fixup call_stmt pointers in NODE and all clones. */
1228 fixup_call_stmt_edges (struct cgraph_node *orig, gimple *stmts)
1230 struct cgraph_node *node;
1232 while (orig->clone_of)
1233 orig = orig->clone_of;
1235 fixup_call_stmt_edges_1 (orig, stmts);
1237 for (node = orig->clones; node != orig;)
1239 fixup_call_stmt_edges_1 (node, stmts);
1241 node = node->clones;
1242 else if (node->next_sibling_clone)
1243 node = node->next_sibling_clone;
1246 while (node != orig && !node->next_sibling_clone)
1247 node = node->clone_of;
1249 node = node->next_sibling_clone;
1254 /* Read the body of function FN_DECL from DATA_IN using input block IB. */
1257 input_function (tree fn_decl, struct data_in *data_in,
1258 struct lto_input_block *ib)
1260 struct function *fn;
1264 struct bitpack_d *bp;
1265 struct cgraph_node *node;
1266 tree args, narg, oarg;
1268 fn = DECL_STRUCT_FUNCTION (fn_decl);
1269 tag = input_record_start (ib);
1270 clear_line_info (data_in);
1272 gimple_register_cfg_hooks ();
1273 lto_tag_check (tag, LTO_function);
1275 /* Read all the attributes for FN. */
1276 bp = lto_input_bitpack (ib);
1277 fn->is_thunk = bp_unpack_value (bp, 1);
1278 fn->has_local_explicit_reg_vars = bp_unpack_value (bp, 1);
1279 fn->after_tree_profile = bp_unpack_value (bp, 1);
1280 fn->returns_pcc_struct = bp_unpack_value (bp, 1);
1281 fn->returns_struct = bp_unpack_value (bp, 1);
1282 fn->always_inline_functions_inlined = bp_unpack_value (bp, 1);
1283 fn->after_inlining = bp_unpack_value (bp, 1);
1284 fn->dont_save_pending_sizes_p = bp_unpack_value (bp, 1);
1285 fn->stdarg = bp_unpack_value (bp, 1);
1286 fn->has_nonlocal_label = bp_unpack_value (bp, 1);
1287 fn->calls_alloca = bp_unpack_value (bp, 1);
1288 fn->calls_setjmp = bp_unpack_value (bp, 1);
1289 fn->function_frequency = (enum function_frequency) bp_unpack_value (bp, 2);
1290 fn->va_list_fpr_size = bp_unpack_value (bp, 8);
1291 fn->va_list_gpr_size = bp_unpack_value (bp, 8);
1292 bitpack_delete (bp);
1294 /* Read the static chain and non-local goto save area. */
1295 fn->static_chain_decl = lto_input_tree (ib, data_in);
1296 fn->nonlocal_goto_save_area = lto_input_tree (ib, data_in);
1298 /* Read all the local symbols. */
1299 fn->local_decls = lto_input_tree (ib, data_in);
1301 /* Read all function arguments. We need to re-map them here to the
1302 arguments of the merged function declaration. */
1303 args = lto_input_tree (ib, data_in);
1304 for (oarg = args, narg = DECL_ARGUMENTS (fn_decl);
1306 oarg = TREE_CHAIN (oarg), narg = TREE_CHAIN (narg))
1310 res = lto_streamer_cache_lookup (data_in->reader_cache, oarg, &ix);
1312 /* Replace the argument in the streamer cache. */
1313 lto_streamer_cache_insert_at (data_in->reader_cache, narg, ix);
1315 gcc_assert (!oarg && !narg);
1317 /* Read all the SSA names. */
1318 input_ssa_names (ib, data_in, fn);
1320 /* Read the exception handling regions in the function. */
1321 input_eh_regions (ib, data_in, fn);
1323 /* Read the tree of lexical scopes for the function. */
1324 DECL_INITIAL (fn_decl) = lto_input_tree (ib, data_in);
1325 gcc_assert (DECL_INITIAL (fn_decl));
1326 DECL_SAVED_TREE (fn_decl) = NULL_TREE;
1328 /* Read all the basic blocks. */
1329 tag = input_record_start (ib);
1332 input_bb (ib, tag, data_in, fn);
1333 tag = input_record_start (ib);
1336 /* Fix up the call statements that are mentioned in the callgraph
1338 renumber_gimple_stmt_uids ();
1339 stmts = (gimple *) xcalloc (gimple_stmt_max_uid (fn), sizeof (gimple));
1342 gimple_stmt_iterator bsi;
1343 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1345 gimple stmt = gsi_stmt (bsi);
1346 stmts[gimple_uid (stmt)] = stmt;
1350 /* Set the gimple body to the statement sequence in the entry
1351 basic block. FIXME lto, this is fairly hacky. The existence
1352 of a gimple body is used by the cgraph routines, but we should
1353 really use the presence of the CFG. */
1355 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs);
1356 gimple_set_body (fn_decl, bb_seq (ei_edge (ei)->dest));
1359 node = cgraph_node (fn_decl);
1360 fixup_call_stmt_edges (node, stmts);
1361 execute_all_ipa_stmt_fixups (node, stmts);
1363 update_ssa (TODO_update_ssa_only_virtuals);
1364 free_dominance_info (CDI_DOMINATORS);
1365 free_dominance_info (CDI_POST_DOMINATORS);
1370 /* Read initializer expressions for public statics. DATA_IN is the
1371 file being read. IB is the input block used for reading. */
1374 input_alias_pairs (struct lto_input_block *ib, struct data_in *data_in)
1378 clear_line_info (data_in);
1380 /* Skip over all the unreferenced globals. */
1382 var = lto_input_tree (ib, data_in);
1385 var = lto_input_tree (ib, data_in);
1388 const char *orig_name, *new_name;
1391 p = VEC_safe_push (alias_pair, gc, alias_pairs, NULL);
1393 p->target = lto_input_tree (ib, data_in);
1395 /* If the target is a static object, we may have registered a
1396 new name for it to avoid clashes between statics coming from
1397 different files. In that case, use the new name. */
1398 orig_name = IDENTIFIER_POINTER (p->target);
1399 new_name = lto_get_decl_name_mapping (data_in->file_data, orig_name);
1400 if (strcmp (orig_name, new_name) != 0)
1401 p->target = get_identifier (new_name);
1403 var = lto_input_tree (ib, data_in);
1408 /* Read the body from DATA for function FN_DECL and fill it in.
1409 FILE_DATA are the global decls and types. SECTION_TYPE is either
1410 LTO_section_function_body or LTO_section_static_initializer. If
1411 section type is LTO_section_function_body, FN must be the decl for
1415 lto_read_body (struct lto_file_decl_data *file_data, tree fn_decl,
1416 const char *data, enum lto_section_type section_type)
1418 const struct lto_function_header *header;
1419 struct data_in *data_in;
1421 int32_t main_offset;
1422 int32_t string_offset;
1423 struct lto_input_block ib_cfg;
1424 struct lto_input_block ib_main;
1426 header = (const struct lto_function_header *) data;
1427 cfg_offset = sizeof (struct lto_function_header);
1428 main_offset = cfg_offset + header->cfg_size;
1429 string_offset = main_offset + header->main_size;
1431 LTO_INIT_INPUT_BLOCK (ib_cfg,
1436 LTO_INIT_INPUT_BLOCK (ib_main,
1441 data_in = lto_data_in_create (file_data, data + string_offset,
1442 header->string_size, NULL);
1444 /* Make sure the file was generated by the exact same compiler. */
1445 lto_check_version (header->lto_header.major_version,
1446 header->lto_header.minor_version);
1448 if (section_type == LTO_section_function_body)
1450 struct function *fn = DECL_STRUCT_FUNCTION (fn_decl);
1451 struct lto_in_decl_state *decl_state;
1456 /* Use the function's decl state. */
1457 decl_state = lto_get_function_in_decl_state (file_data, fn_decl);
1458 gcc_assert (decl_state);
1459 file_data->current_decl_state = decl_state;
1461 input_cfg (&ib_cfg, fn);
1463 /* Set up the struct function. */
1464 input_function (fn_decl, data_in, &ib_main);
1466 /* We should now be in SSA. */
1467 cfun->gimple_df->in_ssa_p = true;
1469 /* Fill in properties we know hold for the rebuilt CFG. */
1470 cfun->curr_properties = PROP_ssa
1475 | PROP_referenced_vars;
1477 /* Restore decl state */
1478 file_data->current_decl_state = file_data->global_decl_state;
1484 input_alias_pairs (&ib_main, data_in);
1487 clear_line_info (data_in);
1488 lto_data_in_delete (data_in);
1492 /* Read the body of FN_DECL using DATA. FILE_DATA holds the global
1496 lto_input_function_body (struct lto_file_decl_data *file_data,
1497 tree fn_decl, const char *data)
1499 current_function_decl = fn_decl;
1500 lto_read_body (file_data, fn_decl, data, LTO_section_function_body);
1504 /* Read in VAR_DECL using DATA. FILE_DATA holds the global decls and
1508 lto_input_constructors_and_inits (struct lto_file_decl_data *file_data,
1511 lto_read_body (file_data, NULL, data, LTO_section_static_initializer);
1515 /* Return the resolution for the decl with index INDEX from DATA_IN. */
1517 static enum ld_plugin_symbol_resolution
1518 get_resolution (struct data_in *data_in, unsigned index)
1520 if (data_in->globals_resolution)
1522 ld_plugin_symbol_resolution_t ret;
1523 gcc_assert (index < VEC_length (ld_plugin_symbol_resolution_t,
1524 data_in->globals_resolution));
1525 ret = VEC_index (ld_plugin_symbol_resolution_t,
1526 data_in->globals_resolution,
1528 gcc_assert (ret != LDPR_UNKNOWN);
1532 /* Delay resolution finding until decl merging. */
1533 return LDPR_UNKNOWN;
1537 /* Unpack all the non-pointer fields of the TS_BASE structure of
1538 expression EXPR from bitpack BP. */
1541 unpack_ts_base_value_fields (struct bitpack_d *bp, tree expr)
1543 /* Note that the code for EXPR has already been unpacked to create EXPR in
1544 lto_materialize_tree. */
1547 TREE_SIDE_EFFECTS (expr) = (unsigned) bp_unpack_value (bp, 1);
1548 TREE_CONSTANT (expr) = (unsigned) bp_unpack_value (bp, 1);
1549 TREE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
1551 /* TREE_PUBLIC is used on types to indicate that the type
1552 has a TYPE_CACHED_VALUES vector. This is not streamed out,
1553 so we skip it here. */
1554 TREE_PUBLIC (expr) = (unsigned) bp_unpack_value (bp, 1);
1556 TREE_ADDRESSABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
1557 TREE_THIS_VOLATILE (expr) = (unsigned) bp_unpack_value (bp, 1);
1559 DECL_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
1560 else if (TYPE_P (expr))
1561 TYPE_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
1562 TREE_ASM_WRITTEN (expr) = (unsigned) bp_unpack_value (bp, 1);
1563 TREE_NO_WARNING (expr) = (unsigned) bp_unpack_value (bp, 1);
1564 TREE_USED (expr) = (unsigned) bp_unpack_value (bp, 1);
1565 TREE_NOTHROW (expr) = (unsigned) bp_unpack_value (bp, 1);
1566 TREE_STATIC (expr) = (unsigned) bp_unpack_value (bp, 1);
1567 TREE_PRIVATE (expr) = (unsigned) bp_unpack_value (bp, 1);
1568 TREE_PROTECTED (expr) = (unsigned) bp_unpack_value (bp, 1);
1569 TREE_DEPRECATED (expr) = (unsigned) bp_unpack_value (bp, 1);
1571 TYPE_SATURATING (expr) = (unsigned) bp_unpack_value (bp, 1);
1572 if (TREE_CODE (expr) == SSA_NAME)
1573 SSA_NAME_IS_DEFAULT_DEF (expr) = (unsigned) bp_unpack_value (bp, 1);
1577 /* Unpack all the non-pointer fields of the TS_REAL_CST structure of
1578 expression EXPR from bitpack BP. */
1581 unpack_ts_real_cst_value_fields (struct bitpack_d *bp, tree expr)
1585 REAL_VALUE_TYPE *rp;
1587 r.cl = (unsigned) bp_unpack_value (bp, 2);
1588 r.decimal = (unsigned) bp_unpack_value (bp, 1);
1589 r.sign = (unsigned) bp_unpack_value (bp, 1);
1590 r.signalling = (unsigned) bp_unpack_value (bp, 1);
1591 r.canonical = (unsigned) bp_unpack_value (bp, 1);
1592 r.uexp = (unsigned) bp_unpack_value (bp, EXP_BITS);
1593 for (i = 0; i < SIGSZ; i++)
1594 r.sig[i] = (unsigned long) bp_unpack_value (bp, HOST_BITS_PER_LONG);
1596 rp = GGC_NEW (REAL_VALUE_TYPE);
1597 memcpy (rp, &r, sizeof (REAL_VALUE_TYPE));
1598 TREE_REAL_CST_PTR (expr) = rp;
1602 /* Unpack all the non-pointer fields of the TS_FIXED_CST structure of
1603 expression EXPR from bitpack BP. */
1606 unpack_ts_fixed_cst_value_fields (struct bitpack_d *bp, tree expr)
1608 struct fixed_value fv;
1610 fv.data.low = (HOST_WIDE_INT) bp_unpack_value (bp, HOST_BITS_PER_WIDE_INT);
1611 fv.data.high = (HOST_WIDE_INT) bp_unpack_value (bp, HOST_BITS_PER_WIDE_INT);
1612 TREE_FIXED_CST (expr) = fv;
1616 /* Unpack all the non-pointer fields of the TS_DECL_COMMON structure
1617 of expression EXPR from bitpack BP. */
1620 unpack_ts_decl_common_value_fields (struct bitpack_d *bp, tree expr)
1622 DECL_MODE (expr) = (enum machine_mode) bp_unpack_value (bp, 8);
1623 DECL_NONLOCAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1624 DECL_VIRTUAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1625 DECL_IGNORED_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1626 DECL_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
1627 DECL_ARTIFICIAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1628 DECL_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
1629 DECL_PRESERVE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1630 DECL_DEBUG_EXPR_IS_FROM (expr) = (unsigned) bp_unpack_value (bp, 1);
1631 DECL_EXTERNAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1632 DECL_GIMPLE_REG_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1633 DECL_ALIGN (expr) = (unsigned) bp_unpack_value (bp, HOST_BITS_PER_INT);
1635 if (TREE_CODE (expr) == LABEL_DECL)
1637 DECL_ERROR_ISSUED (expr) = (unsigned) bp_unpack_value (bp, 1);
1638 EH_LANDING_PAD_NR (expr) = (int) bp_unpack_value (bp, HOST_BITS_PER_INT);
1640 /* Always assume an initial value of -1 for LABEL_DECL_UID to
1641 force gimple_set_bb to recreate label_to_block_map. */
1642 LABEL_DECL_UID (expr) = -1;
1645 if (TREE_CODE (expr) == FIELD_DECL)
1647 unsigned HOST_WIDE_INT off_align;
1648 DECL_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
1649 DECL_NONADDRESSABLE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1650 off_align = (unsigned HOST_WIDE_INT) bp_unpack_value (bp, 8);
1651 SET_DECL_OFFSET_ALIGN (expr, off_align);
1654 if (TREE_CODE (expr) == RESULT_DECL
1655 || TREE_CODE (expr) == PARM_DECL
1656 || TREE_CODE (expr) == VAR_DECL)
1658 DECL_BY_REFERENCE (expr) = (unsigned) bp_unpack_value (bp, 1);
1659 if (TREE_CODE (expr) == VAR_DECL
1660 || TREE_CODE (expr) == PARM_DECL)
1661 DECL_HAS_VALUE_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1662 DECL_RESTRICTED_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1667 /* Unpack all the non-pointer fields of the TS_DECL_WRTL structure
1668 of expression EXPR from bitpack BP. */
1671 unpack_ts_decl_wrtl_value_fields (struct bitpack_d *bp, tree expr)
1673 DECL_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
1677 /* Unpack all the non-pointer fields of the TS_DECL_WITH_VIS structure
1678 of expression EXPR from bitpack BP. */
1681 unpack_ts_decl_with_vis_value_fields (struct bitpack_d *bp, tree expr)
1683 DECL_DEFER_OUTPUT (expr) = (unsigned) bp_unpack_value (bp, 1);
1684 DECL_COMMON (expr) = (unsigned) bp_unpack_value (bp, 1);
1685 DECL_DLLIMPORT_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1686 DECL_WEAK (expr) = (unsigned) bp_unpack_value (bp, 1);
1687 DECL_SEEN_IN_BIND_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1688 DECL_COMDAT (expr) = (unsigned) bp_unpack_value (bp, 1);
1689 DECL_VISIBILITY (expr) = (enum symbol_visibility) bp_unpack_value (bp, 2);
1690 DECL_VISIBILITY_SPECIFIED (expr) = (unsigned) bp_unpack_value (bp, 1);
1692 if (TREE_CODE (expr) == VAR_DECL)
1694 DECL_HARD_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
1695 DECL_IN_TEXT_SECTION (expr) = (unsigned) bp_unpack_value (bp, 1);
1696 DECL_TLS_MODEL (expr) = (enum tls_model) bp_unpack_value (bp, 3);
1699 if (VAR_OR_FUNCTION_DECL_P (expr))
1702 p = (priority_type) bp_unpack_value (bp, HOST_BITS_PER_SHORT);
1703 SET_DECL_INIT_PRIORITY (expr, p);
1708 /* Unpack all the non-pointer fields of the TS_FUNCTION_DECL structure
1709 of expression EXPR from bitpack BP. */
1712 unpack_ts_function_decl_value_fields (struct bitpack_d *bp, tree expr)
1714 DECL_FUNCTION_CODE (expr) = (enum built_in_function) bp_unpack_value (bp, 11);
1715 DECL_BUILT_IN_CLASS (expr) = (enum built_in_class) bp_unpack_value (bp, 2);
1716 DECL_STATIC_CONSTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
1717 DECL_STATIC_DESTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
1718 DECL_UNINLINABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
1719 DECL_POSSIBLY_INLINED (expr) = (unsigned) bp_unpack_value (bp, 1);
1720 DECL_IS_NOVOPS (expr) = (unsigned) bp_unpack_value (bp, 1);
1721 DECL_IS_RETURNS_TWICE (expr) = (unsigned) bp_unpack_value (bp, 1);
1722 DECL_IS_MALLOC (expr) = (unsigned) bp_unpack_value (bp, 1);
1723 DECL_IS_OPERATOR_NEW (expr) = (unsigned) bp_unpack_value (bp, 1);
1724 DECL_DECLARED_INLINE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1725 DECL_STATIC_CHAIN (expr) = (unsigned) bp_unpack_value (bp, 1);
1726 DECL_NO_INLINE_WARNING_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1727 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (expr)
1728 = (unsigned) bp_unpack_value (bp, 1);
1729 DECL_NO_LIMIT_STACK (expr) = (unsigned) bp_unpack_value (bp, 1);
1730 DECL_DISREGARD_INLINE_LIMITS (expr) = (unsigned) bp_unpack_value (bp, 1);
1731 DECL_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1732 DECL_LOOPING_CONST_OR_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1736 /* Unpack all the non-pointer fields of the TS_TYPE structure
1737 of expression EXPR from bitpack BP. */
1740 unpack_ts_type_value_fields (struct bitpack_d *bp, tree expr)
1742 enum machine_mode mode;
1744 TYPE_PRECISION (expr) = (unsigned) bp_unpack_value (bp, 9);
1745 mode = (enum machine_mode) bp_unpack_value (bp, 7);
1746 SET_TYPE_MODE (expr, mode);
1747 TYPE_STRING_FLAG (expr) = (unsigned) bp_unpack_value (bp, 1);
1748 TYPE_NO_FORCE_BLK (expr) = (unsigned) bp_unpack_value (bp, 1);
1749 TYPE_NEEDS_CONSTRUCTING(expr) = (unsigned) bp_unpack_value (bp, 1);
1750 if (TREE_CODE (expr) == UNION_TYPE)
1751 TYPE_TRANSPARENT_UNION (expr) = (unsigned) bp_unpack_value (bp, 1);
1752 TYPE_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
1753 TYPE_RESTRICT (expr) = (unsigned) bp_unpack_value (bp, 1);
1754 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr)
1755 = (unsigned) bp_unpack_value (bp, 2);
1756 TYPE_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
1757 TYPE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
1758 TYPE_ALIGN (expr) = (unsigned) bp_unpack_value (bp, HOST_BITS_PER_INT);
1759 TYPE_ALIAS_SET (expr) = bp_unpack_value (bp, HOST_BITS_PER_INT);
1763 /* Unpack all the non-pointer fields of the TS_BLOCK structure
1764 of expression EXPR from bitpack BP. */
1767 unpack_ts_block_value_fields (struct bitpack_d *bp, tree expr)
1769 BLOCK_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
1770 BLOCK_NUMBER (expr) = (unsigned) bp_unpack_value (bp, 31);
1774 /* Unpack all the non-pointer fields in EXPR into a bit pack. */
1777 unpack_value_fields (struct bitpack_d *bp, tree expr)
1779 enum tree_code code;
1781 code = TREE_CODE (expr);
1783 /* Note that all these functions are highly sensitive to changes in
1784 the types and sizes of each of the fields being packed. */
1785 unpack_ts_base_value_fields (bp, expr);
1787 if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST))
1788 unpack_ts_real_cst_value_fields (bp, expr);
1790 if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST))
1791 unpack_ts_fixed_cst_value_fields (bp, expr);
1793 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1794 unpack_ts_decl_common_value_fields (bp, expr);
1796 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
1797 unpack_ts_decl_wrtl_value_fields (bp, expr);
1799 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
1800 unpack_ts_decl_with_vis_value_fields (bp, expr);
1802 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
1803 unpack_ts_function_decl_value_fields (bp, expr);
1805 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
1806 unpack_ts_type_value_fields (bp, expr);
1808 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
1809 unpack_ts_block_value_fields (bp, expr);
1811 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
1813 /* We only stream the version number of SSA names. */
1817 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
1819 /* This is only used by GENERIC. */
1823 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
1825 /* This is only used by High GIMPLE. */
1831 /* Read a bitpack from input block IB. */
1834 lto_input_bitpack (struct lto_input_block *ib)
1836 unsigned i, num_words;
1837 struct bitpack_d *bp;
1839 bp = bitpack_create ();
1841 /* If we are about to read more than a handful of words, something
1842 is wrong. This check is overly strict, but it acts as an early
1843 warning. No streamed object has hundreds of bits in its fields. */
1844 num_words = lto_input_uleb128 (ib);
1845 gcc_assert (num_words < 20);
1847 for (i = 0; i < num_words; i++)
1849 bitpack_word_t w = lto_input_uleb128 (ib);
1850 VEC_safe_push (bitpack_word_t, heap, bp->values, w);
1857 /* Materialize a new tree from input block IB using descriptors in
1858 DATA_IN. The code for the new tree should match TAG. Store in
1859 *IX_P the index into the reader cache where the new tree is stored. */
1862 lto_materialize_tree (struct lto_input_block *ib, struct data_in *data_in,
1863 enum LTO_tags tag, int *ix_p)
1865 struct bitpack_d *bp;
1866 enum tree_code code;
1868 #ifdef LTO_STREAMER_DEBUG
1869 HOST_WIDEST_INT orig_address_in_writer;
1875 /* Read the header of the node we are about to create. */
1876 ix = lto_input_sleb128 (ib);
1877 gcc_assert ((int) ix == ix);
1880 #ifdef LTO_STREAMER_DEBUG
1881 /* Read the word representing the memory address for the tree
1882 as it was written by the writer. This is useful when
1883 debugging differences between the writer and reader. */
1884 orig_address_in_writer = lto_input_sleb128 (ib);
1885 gcc_assert ((intptr_t) orig_address_in_writer == orig_address_in_writer);
1888 code = lto_tag_to_tree_code (tag);
1890 /* We should never see an SSA_NAME tree. Only the version numbers of
1891 SSA names are ever written out. See input_ssa_names. */
1892 gcc_assert (code != SSA_NAME);
1894 /* Instantiate a new tree using the header data. */
1895 if (CODE_CONTAINS_STRUCT (code, TS_STRING))
1896 result = input_string_cst (data_in, ib);
1897 else if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER))
1898 result = input_identifier (data_in, ib);
1899 else if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1901 HOST_WIDE_INT len = lto_input_sleb128 (ib);
1902 result = make_tree_vec (len);
1904 else if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1906 unsigned HOST_WIDE_INT len = lto_input_uleb128 (ib);
1907 result = make_tree_binfo (len);
1911 /* All other nodes can be materialized with a raw make_node
1913 result = make_node (code);
1916 #ifdef LTO_STREAMER_DEBUG
1917 /* Store the original address of the tree as seen by the writer
1918 in RESULT's aux field. This is useful when debugging streaming
1919 problems. This way, a debugging session can be started on
1920 both writer and reader with a breakpoint using this address
1922 lto_orig_address_map (result, (intptr_t) orig_address_in_writer);
1925 /* Read the bitpack of non-pointer values from IB. */
1926 bp = lto_input_bitpack (ib);
1928 /* The first word in BP contains the code of the tree that we
1929 are about to read. */
1930 code = (enum tree_code) bp_unpack_value (bp, 16);
1931 lto_tag_check (lto_tree_code_to_tag (code), tag);
1933 /* Unpack all the value fields from BP. */
1934 unpack_value_fields (bp, result);
1935 bitpack_delete (bp);
1937 /* Enter RESULT in the reader cache. This will make RESULT
1938 available so that circular references in the rest of the tree
1939 structure can be resolved in subsequent calls to lto_input_tree. */
1940 lto_streamer_cache_insert_at (data_in->reader_cache, result, ix);
1946 /* Read a chain of tree nodes from input block IB. DATA_IN contains
1947 tables and descriptors for the file being read. */
1950 lto_input_chain (struct lto_input_block *ib, struct data_in *data_in)
1953 tree first, prev, curr;
1955 first = prev = NULL_TREE;
1956 count = lto_input_sleb128 (ib);
1957 for (i = 0; i < count; i++)
1959 curr = lto_input_tree (ib, data_in);
1961 TREE_CHAIN (prev) = curr;
1965 TREE_CHAIN (curr) = NULL_TREE;
1973 /* Read all pointer fields in the TS_COMMON structure of EXPR from input
1974 block IB. DATA_IN contains tables and descriptors for the
1979 lto_input_ts_common_tree_pointers (struct lto_input_block *ib,
1980 struct data_in *data_in, tree expr)
1982 TREE_TYPE (expr) = lto_input_tree (ib, data_in);
1986 /* Read all pointer fields in the TS_VECTOR structure of EXPR from input
1987 block IB. DATA_IN contains tables and descriptors for the
1991 lto_input_ts_vector_tree_pointers (struct lto_input_block *ib,
1992 struct data_in *data_in, tree expr)
1994 TREE_VECTOR_CST_ELTS (expr) = lto_input_chain (ib, data_in);
1998 /* Read all pointer fields in the TS_COMPLEX structure of EXPR from input
1999 block IB. DATA_IN contains tables and descriptors for the
2003 lto_input_ts_complex_tree_pointers (struct lto_input_block *ib,
2004 struct data_in *data_in, tree expr)
2006 TREE_REALPART (expr) = lto_input_tree (ib, data_in);
2007 TREE_IMAGPART (expr) = lto_input_tree (ib, data_in);
2011 /* Read all pointer fields in the TS_DECL_MINIMAL structure of EXPR
2012 from input block IB. DATA_IN contains tables and descriptors for the
2016 lto_input_ts_decl_minimal_tree_pointers (struct lto_input_block *ib,
2017 struct data_in *data_in, tree expr)
2019 DECL_NAME (expr) = lto_input_tree (ib, data_in);
2020 DECL_CONTEXT (expr) = lto_input_tree (ib, data_in);
2021 DECL_SOURCE_LOCATION (expr) = lto_input_location (ib, data_in);
2025 /* Read all pointer fields in the TS_DECL_COMMON structure of EXPR from
2026 input block IB. DATA_IN contains tables and descriptors for the
2030 lto_input_ts_decl_common_tree_pointers (struct lto_input_block *ib,
2031 struct data_in *data_in, tree expr)
2033 DECL_SIZE (expr) = lto_input_tree (ib, data_in);
2034 DECL_SIZE_UNIT (expr) = lto_input_tree (ib, data_in);
2036 if (TREE_CODE (expr) != FUNCTION_DECL)
2037 DECL_INITIAL (expr) = lto_input_tree (ib, data_in);
2039 DECL_ATTRIBUTES (expr) = lto_input_tree (ib, data_in);
2040 DECL_ABSTRACT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2042 if (TREE_CODE (expr) == PARM_DECL)
2043 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
2045 if ((TREE_CODE (expr) == VAR_DECL
2046 || TREE_CODE (expr) == PARM_DECL)
2047 && DECL_HAS_VALUE_EXPR_P (expr))
2048 SET_DECL_VALUE_EXPR (expr, lto_input_tree (ib, data_in));
2052 /* Read all pointer fields in the TS_DECL_NON_COMMON structure of
2053 EXPR from input block IB. DATA_IN contains tables and descriptors for the
2057 lto_input_ts_decl_non_common_tree_pointers (struct lto_input_block *ib,
2058 struct data_in *data_in, tree expr)
2060 if (TREE_CODE (expr) == FUNCTION_DECL)
2062 DECL_ARGUMENTS (expr) = lto_input_tree (ib, data_in);
2063 DECL_RESULT (expr) = lto_input_tree (ib, data_in);
2065 DECL_VINDEX (expr) = lto_input_tree (ib, data_in);
2069 /* Read all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
2070 from input block IB. DATA_IN contains tables and descriptors for the
2074 lto_input_ts_decl_with_vis_tree_pointers (struct lto_input_block *ib,
2075 struct data_in *data_in, tree expr)
2079 id = lto_input_tree (ib, data_in);
2082 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
2083 SET_DECL_ASSEMBLER_NAME (expr, id);
2086 DECL_SECTION_NAME (expr) = lto_input_tree (ib, data_in);
2087 DECL_COMDAT_GROUP (expr) = lto_input_tree (ib, data_in);
2091 /* Read all pointer fields in the TS_FIELD_DECL structure of EXPR from
2092 input block IB. DATA_IN contains tables and descriptors for the
2096 lto_input_ts_field_decl_tree_pointers (struct lto_input_block *ib,
2097 struct data_in *data_in, tree expr)
2099 DECL_FIELD_OFFSET (expr) = lto_input_tree (ib, data_in);
2100 DECL_BIT_FIELD_TYPE (expr) = lto_input_tree (ib, data_in);
2101 DECL_QUALIFIER (expr) = lto_input_tree (ib, data_in);
2102 DECL_FIELD_BIT_OFFSET (expr) = lto_input_tree (ib, data_in);
2103 DECL_FCONTEXT (expr) = lto_input_tree (ib, data_in);
2104 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
2108 /* Read all pointer fields in the TS_FUNCTION_DECL structure of EXPR
2109 from input block IB. DATA_IN contains tables and descriptors for the
2113 lto_input_ts_function_decl_tree_pointers (struct lto_input_block *ib,
2114 struct data_in *data_in, tree expr)
2116 /* DECL_STRUCT_FUNCTION is handled by lto_input_function. FIXME lto,
2117 maybe it should be handled here? */
2118 DECL_FUNCTION_PERSONALITY (expr) = lto_input_tree (ib, data_in);
2119 DECL_FUNCTION_SPECIFIC_TARGET (expr) = lto_input_tree (ib, data_in);
2120 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr) = lto_input_tree (ib, data_in);
2122 /* If the file contains a function with an EH personality set,
2123 then it was compiled with -fexceptions. In that case, initialize
2124 the backend EH machinery. */
2125 if (DECL_FUNCTION_PERSONALITY (expr))
2130 /* Read all pointer fields in the TS_TYPE structure of EXPR from input
2131 block IB. DATA_IN contains tables and descriptors for the
2135 lto_input_ts_type_tree_pointers (struct lto_input_block *ib,
2136 struct data_in *data_in, tree expr)
2138 if (TREE_CODE (expr) == ENUMERAL_TYPE)
2139 TYPE_VALUES (expr) = lto_input_tree (ib, data_in);
2140 else if (TREE_CODE (expr) == ARRAY_TYPE)
2141 TYPE_DOMAIN (expr) = lto_input_tree (ib, data_in);
2142 else if (TREE_CODE (expr) == RECORD_TYPE || TREE_CODE (expr) == UNION_TYPE)
2143 TYPE_FIELDS (expr) = lto_input_tree (ib, data_in);
2144 else if (TREE_CODE (expr) == FUNCTION_TYPE || TREE_CODE (expr) == METHOD_TYPE)
2145 TYPE_ARG_TYPES (expr) = lto_input_tree (ib, data_in);
2146 else if (TREE_CODE (expr) == VECTOR_TYPE)
2147 TYPE_DEBUG_REPRESENTATION_TYPE (expr) = lto_input_tree (ib, data_in);
2149 TYPE_SIZE (expr) = lto_input_tree (ib, data_in);
2150 TYPE_SIZE_UNIT (expr) = lto_input_tree (ib, data_in);
2151 TYPE_ATTRIBUTES (expr) = lto_input_tree (ib, data_in);
2152 TYPE_NAME (expr) = lto_input_tree (ib, data_in);
2153 /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO nor
2154 TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. */
2155 if (!POINTER_TYPE_P (expr))
2156 TYPE_MINVAL (expr) = lto_input_tree (ib, data_in);
2157 TYPE_MAXVAL (expr) = lto_input_tree (ib, data_in);
2158 TYPE_MAIN_VARIANT (expr) = lto_input_tree (ib, data_in);
2159 /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
2161 if (RECORD_OR_UNION_TYPE_P (expr))
2162 TYPE_BINFO (expr) = lto_input_tree (ib, data_in);
2163 TYPE_CONTEXT (expr) = lto_input_tree (ib, data_in);
2164 TYPE_CANONICAL (expr) = lto_input_tree (ib, data_in);
2165 TYPE_STUB_DECL (expr) = lto_input_tree (ib, data_in);
2169 /* Read all pointer fields in the TS_LIST structure of EXPR from input
2170 block IB. DATA_IN contains tables and descriptors for the
2174 lto_input_ts_list_tree_pointers (struct lto_input_block *ib,
2175 struct data_in *data_in, tree expr)
2177 TREE_PURPOSE (expr) = lto_input_tree (ib, data_in);
2178 TREE_VALUE (expr) = lto_input_tree (ib, data_in);
2179 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
2183 /* Read all pointer fields in the TS_VEC structure of EXPR from input
2184 block IB. DATA_IN contains tables and descriptors for the
2188 lto_input_ts_vec_tree_pointers (struct lto_input_block *ib,
2189 struct data_in *data_in, tree expr)
2193 /* Note that TREE_VEC_LENGTH was read by lto_materialize_tree to
2194 instantiate EXPR. */
2195 for (i = 0; i < TREE_VEC_LENGTH (expr); i++)
2196 TREE_VEC_ELT (expr, i) = lto_input_tree (ib, data_in);
2200 /* Read all pointer fields in the TS_EXP structure of EXPR from input
2201 block IB. DATA_IN contains tables and descriptors for the
2206 lto_input_ts_exp_tree_pointers (struct lto_input_block *ib,
2207 struct data_in *data_in, tree expr)
2212 length = lto_input_sleb128 (ib);
2213 gcc_assert (length == TREE_OPERAND_LENGTH (expr));
2215 for (i = 0; i < length; i++)
2216 TREE_OPERAND (expr, i) = lto_input_tree (ib, data_in);
2218 loc = lto_input_location (ib, data_in);
2219 SET_EXPR_LOCATION (expr, loc);
2220 TREE_BLOCK (expr) = lto_input_tree (ib, data_in);
2224 /* Read all pointer fields in the TS_BLOCK structure of EXPR from input
2225 block IB. DATA_IN contains tables and descriptors for the
2229 lto_input_ts_block_tree_pointers (struct lto_input_block *ib,
2230 struct data_in *data_in, tree expr)
2234 BLOCK_SOURCE_LOCATION (expr) = lto_input_location (ib, data_in);
2235 BLOCK_VARS (expr) = lto_input_chain (ib, data_in);
2237 len = lto_input_uleb128 (ib);
2238 for (i = 0; i < len; i++)
2240 tree t = lto_input_tree (ib, data_in);
2241 VEC_safe_push (tree, gc, BLOCK_NONLOCALIZED_VARS (expr), t);
2244 BLOCK_SUPERCONTEXT (expr) = lto_input_tree (ib, data_in);
2245 BLOCK_ABSTRACT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2246 BLOCK_FRAGMENT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2247 BLOCK_FRAGMENT_CHAIN (expr) = lto_input_tree (ib, data_in);
2248 BLOCK_SUBBLOCKS (expr) = lto_input_chain (ib, data_in);
2252 /* Read all pointer fields in the TS_BINFO structure of EXPR from input
2253 block IB. DATA_IN contains tables and descriptors for the
2257 lto_input_ts_binfo_tree_pointers (struct lto_input_block *ib,
2258 struct data_in *data_in, tree expr)
2263 /* Note that the number of slots in EXPR was read in
2264 lto_materialize_tree when instantiating EXPR. However, the
2265 vector is empty so we cannot rely on VEC_length to know how many
2266 elements to read. So, this list is emitted as a 0-terminated
2267 list on the writer side. */
2270 t = lto_input_tree (ib, data_in);
2272 VEC_quick_push (tree, BINFO_BASE_BINFOS (expr), t);
2276 BINFO_OFFSET (expr) = lto_input_tree (ib, data_in);
2277 BINFO_VTABLE (expr) = lto_input_tree (ib, data_in);
2278 BINFO_VIRTUALS (expr) = lto_input_tree (ib, data_in);
2279 BINFO_VPTR_FIELD (expr) = lto_input_tree (ib, data_in);
2281 len = lto_input_uleb128 (ib);
2282 for (i = 0; i < len; i++)
2284 tree a = lto_input_tree (ib, data_in);
2285 VEC_safe_push (tree, gc, BINFO_BASE_ACCESSES (expr), a);
2288 BINFO_INHERITANCE_CHAIN (expr) = lto_input_tree (ib, data_in);
2289 BINFO_SUBVTT_INDEX (expr) = lto_input_tree (ib, data_in);
2290 BINFO_VPTR_INDEX (expr) = lto_input_tree (ib, data_in);
2294 /* Read all pointer fields in the TS_CONSTRUCTOR structure of EXPR from
2295 input block IB. DATA_IN contains tables and descriptors for the
2299 lto_input_ts_constructor_tree_pointers (struct lto_input_block *ib,
2300 struct data_in *data_in, tree expr)
2304 len = lto_input_uleb128 (ib);
2305 for (i = 0; i < len; i++)
2309 index = lto_input_tree (ib, data_in);
2310 value = lto_input_tree (ib, data_in);
2311 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (expr), index, value);
2316 /* Helper for lto_input_tree. Read all pointer fields in EXPR from
2317 input block IB. DATA_IN contains tables and descriptors for the
2321 lto_input_tree_pointers (struct lto_input_block *ib, struct data_in *data_in,
2324 enum tree_code code;
2326 code = TREE_CODE (expr);
2328 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
2329 lto_input_ts_common_tree_pointers (ib, data_in, expr);
2331 if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
2332 lto_input_ts_vector_tree_pointers (ib, data_in, expr);
2334 if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX))
2335 lto_input_ts_complex_tree_pointers (ib, data_in, expr);
2337 if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
2338 lto_input_ts_decl_minimal_tree_pointers (ib, data_in, expr);
2340 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
2341 lto_input_ts_decl_common_tree_pointers (ib, data_in, expr);
2343 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
2344 lto_input_ts_decl_non_common_tree_pointers (ib, data_in, expr);
2346 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
2347 lto_input_ts_decl_with_vis_tree_pointers (ib, data_in, expr);
2349 if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
2350 lto_input_ts_field_decl_tree_pointers (ib, data_in, expr);
2352 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
2353 lto_input_ts_function_decl_tree_pointers (ib, data_in, expr);
2355 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
2356 lto_input_ts_type_tree_pointers (ib, data_in, expr);
2358 if (CODE_CONTAINS_STRUCT (code, TS_LIST))
2359 lto_input_ts_list_tree_pointers (ib, data_in, expr);
2361 if (CODE_CONTAINS_STRUCT (code, TS_VEC))
2362 lto_input_ts_vec_tree_pointers (ib, data_in, expr);
2364 if (CODE_CONTAINS_STRUCT (code, TS_EXP))
2365 lto_input_ts_exp_tree_pointers (ib, data_in, expr);
2367 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
2369 /* We only stream the version number of SSA names. */
2373 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
2374 lto_input_ts_block_tree_pointers (ib, data_in, expr);
2376 if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
2377 lto_input_ts_binfo_tree_pointers (ib, data_in, expr);
2379 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
2381 /* This should only appear in GENERIC. */
2385 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
2386 lto_input_ts_constructor_tree_pointers (ib, data_in, expr);
2388 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
2390 /* This should only appear in High GIMPLE. */
2394 if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION))
2396 sorry ("optimization options not supported yet");
2399 if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION))
2401 sorry ("target optimization options not supported yet");
2406 /* Register DECL with the global symbol table and change its
2407 name if necessary to avoid name clashes for static globals across
2411 lto_register_var_decl_in_symtab (struct data_in *data_in, tree decl)
2413 /* Register symbols with file or global scope to mark what input
2414 file has their definition. */
2415 if (decl_function_context (decl) == NULL_TREE)
2417 /* Variable has file scope, not local. Need to ensure static variables
2418 between different files don't clash unexpectedly. */
2419 if (!TREE_PUBLIC (decl))
2421 /* ??? We normally pre-mangle names before we serialize them
2422 out. Here, in lto1, we do not know the language, and
2423 thus cannot do the mangling again. Instead, we just
2424 append a suffix to the mangled name. The resulting name,
2425 however, is not a properly-formed mangled name, and will
2426 confuse any attempt to unmangle it. */
2427 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2430 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
2431 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
2432 rest_of_decl_compilation (decl, 1, 0);
2436 /* If this variable has already been declared, queue the
2437 declaration for merging. */
2438 if (TREE_PUBLIC (decl))
2441 if (!lto_streamer_cache_lookup (data_in->reader_cache, decl, &ix))
2443 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
2444 data_in->file_data);
2450 /* Register DECL with the global symbol table and change its
2451 name if necessary to avoid name clashes for static globals across
2452 different files. DATA_IN contains descriptors and tables for the
2456 lto_register_function_decl_in_symtab (struct data_in *data_in, tree decl)
2458 /* Need to ensure static entities between different files
2459 don't clash unexpectedly. */
2460 if (!TREE_PUBLIC (decl))
2462 /* We must not use the DECL_ASSEMBLER_NAME macro here, as it
2463 may set the assembler name where it was previously empty. */
2464 tree old_assembler_name = decl->decl_with_vis.assembler_name;
2466 /* FIXME lto: We normally pre-mangle names before we serialize
2467 them out. Here, in lto1, we do not know the language, and
2468 thus cannot do the mangling again. Instead, we just append a
2469 suffix to the mangled name. The resulting name, however, is
2470 not a properly-formed mangled name, and will confuse any
2471 attempt to unmangle it. */
2472 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2475 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
2476 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
2478 /* We may arrive here with the old assembler name not set
2479 if the function body is not needed, e.g., it has been
2480 inlined away and does not appear in the cgraph. */
2481 if (old_assembler_name)
2483 tree new_assembler_name = DECL_ASSEMBLER_NAME (decl);
2485 /* Make the original assembler name available for later use.
2486 We may have used it to indicate the section within its
2487 object file where the function body may be found.
2488 FIXME lto: Find a better way to maintain the function decl
2489 to body section mapping so we don't need this hack. */
2490 lto_record_renamed_decl (data_in->file_data,
2491 IDENTIFIER_POINTER (old_assembler_name),
2492 IDENTIFIER_POINTER (new_assembler_name));
2494 /* Also register the reverse mapping so that we can find the
2495 new name given to an existing assembler name (used when
2496 restoring alias pairs in input_constructors_or_inits. */
2497 lto_record_renamed_decl (data_in->file_data,
2498 IDENTIFIER_POINTER (new_assembler_name),
2499 IDENTIFIER_POINTER (old_assembler_name));
2503 /* If this variable has already been declared, queue the
2504 declaration for merging. */
2505 if (TREE_PUBLIC (decl) && !DECL_ABSTRACT (decl))
2508 if (!lto_streamer_cache_lookup (data_in->reader_cache, decl, &ix))
2510 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
2511 data_in->file_data);
2516 /* Read an index IX from input block IB and return the tree node at
2517 DATA_IN->FILE_DATA->GLOBALS_INDEX[IX]. */
2520 lto_get_pickled_tree (struct lto_input_block *ib, struct data_in *data_in)
2524 enum LTO_tags expected_tag;
2525 unsigned HOST_WIDE_INT orig_offset;
2527 ix = lto_input_sleb128 (ib);
2528 expected_tag = (enum LTO_tags) lto_input_uleb128 (ib);
2530 orig_offset = lto_input_uleb128 (ib);
2531 gcc_assert (orig_offset == (unsigned) orig_offset);
2533 result = lto_streamer_cache_get (data_in->reader_cache, ix);
2534 if (result == NULL_TREE)
2536 /* We have not yet read the cache slot IX. Go to the offset
2537 in the stream where the physical tree node is, and materialize
2539 struct lto_input_block fwd_ib;
2541 /* If we are trying to go back in the stream, something is wrong.
2542 We should've read the node at the earlier position already. */
2543 if (ib->p >= orig_offset)
2544 internal_error ("bytecode stream: tried to jump backwards in the "
2547 LTO_INIT_INPUT_BLOCK (fwd_ib, ib->data, orig_offset, ib->len);
2548 result = lto_input_tree (&fwd_ib, data_in);
2552 && TREE_CODE (result) == lto_tag_to_tree_code (expected_tag));
2558 /* Read a code and class from input block IB and return the
2559 corresponding builtin. DATA_IN is as in lto_input_tree. */
2562 lto_get_builtin_tree (struct lto_input_block *ib, struct data_in *data_in)
2564 enum built_in_class fclass;
2565 enum built_in_function fcode;
2566 const char *asmname;
2570 fclass = (enum built_in_class) lto_input_uleb128 (ib);
2571 gcc_assert (fclass == BUILT_IN_NORMAL || fclass == BUILT_IN_MD);
2573 fcode = (enum built_in_function) lto_input_uleb128 (ib);
2575 ix = lto_input_sleb128 (ib);
2576 gcc_assert (ix == (int) ix);
2578 if (fclass == BUILT_IN_NORMAL)
2580 gcc_assert (fcode < END_BUILTINS);
2581 result = built_in_decls[fcode];
2582 gcc_assert (result);
2584 else if (fclass == BUILT_IN_MD)
2586 result = targetm.builtin_decl (fcode, true);
2587 if (!result || result == error_mark_node)
2588 fatal_error ("target specific builtin not available");
2593 asmname = input_string (data_in, ib);
2595 set_builtin_user_assembler_name (result, asmname);
2597 lto_streamer_cache_insert_at (data_in->reader_cache, result, ix);
2603 /* Read the physical representation of a tree node with tag TAG from
2604 input block IB using the per-file context in DATA_IN. */
2607 lto_read_tree (struct lto_input_block *ib, struct data_in *data_in,
2613 result = lto_materialize_tree (ib, data_in, tag, &ix);
2615 /* Read all the pointer fields in RESULT. */
2616 lto_input_tree_pointers (ib, data_in, result);
2618 /* We should never try to instantiate an MD or NORMAL builtin here. */
2619 if (TREE_CODE (result) == FUNCTION_DECL)
2620 gcc_assert (!lto_stream_as_builtin_p (result));
2622 if (TREE_CODE (result) == VAR_DECL)
2623 lto_register_var_decl_in_symtab (data_in, result);
2624 else if (TREE_CODE (result) == FUNCTION_DECL && !DECL_BUILT_IN (result))
2625 lto_register_function_decl_in_symtab (data_in, result);
2627 /* end_marker = */ lto_input_1_unsigned (ib);
2629 #ifdef LTO_STREAMER_DEBUG
2630 /* Remove the mapping to RESULT's original address set by
2631 lto_materialize_tree. */
2632 lto_orig_address_remove (result);
2639 /* Read and INTEGER_CST node from input block IB using the per-file
2640 context in DATA_IN. */
2643 lto_input_integer_cst (struct lto_input_block *ib, struct data_in *data_in)
2646 HOST_WIDE_INT low, high;
2649 type = lto_input_tree (ib, data_in);
2650 overflow_p = (lto_input_1_unsigned (ib) != 0);
2651 low = lto_input_uleb128 (ib);
2652 high = lto_input_uleb128 (ib);
2653 result = build_int_cst_wide (type, low, high);
2655 /* If the original constant had overflown, build a replica of RESULT to
2656 avoid modifying the shared constant returned by build_int_cst_wide. */
2659 result = copy_node (result);
2660 TREE_OVERFLOW (result) = 1;
2667 /* Read a tree from input block IB using the per-file context in
2668 DATA_IN. This context is used, for example, to resolve references
2669 to previously read nodes. */
2672 lto_input_tree (struct lto_input_block *ib, struct data_in *data_in)
2677 tag = input_record_start (ib);
2678 gcc_assert ((unsigned) tag < (unsigned) LTO_NUM_TAGS);
2680 if (tag == LTO_null)
2682 else if (tag >= LTO_field_decl_ref && tag <= LTO_global_decl_ref)
2684 /* If TAG is a reference to an indexable tree, the next value
2685 in IB is the index into the table where we expect to find
2687 result = lto_input_tree_ref (ib, data_in, cfun, tag);
2689 else if (tag == LTO_tree_pickle_reference)
2691 /* If TAG is a reference to a previously read tree, look it up in
2692 the reader cache. */
2693 result = lto_get_pickled_tree (ib, data_in);
2695 else if (tag == LTO_builtin_decl)
2697 /* If we are going to read a built-in function, all we need is
2698 the code and class. */
2699 result = lto_get_builtin_tree (ib, data_in);
2701 else if (tag == lto_tree_code_to_tag (INTEGER_CST))
2703 /* For integer constants we only need the type and its hi/low
2705 result = lto_input_integer_cst (ib, data_in);
2709 /* Otherwise, materialize a new node from IB. */
2710 result = lto_read_tree (ib, data_in, tag);
2717 /* Initialization for the LTO reader. */
2720 lto_init_reader (void)
2722 lto_streamer_init ();
2724 memset (<o_stats, 0, sizeof (lto_stats));
2725 bitmap_obstack_initialize (NULL);
2727 file_name_hash_table = htab_create (37, hash_string_slot_node,
2728 eq_string_slot_node, free);
2730 gimple_register_cfg_hooks ();
2734 /* Create a new data_in object for FILE_DATA. STRINGS is the string
2735 table to use with LEN strings. RESOLUTIONS is the vector of linker
2736 resolutions (NULL if not using a linker plugin). */
2739 lto_data_in_create (struct lto_file_decl_data *file_data, const char *strings,
2741 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions)
2743 struct data_in *data_in = XCNEW (struct data_in);
2744 data_in->file_data = file_data;
2745 data_in->strings = strings;
2746 data_in->strings_len = len;
2747 data_in->globals_resolution = resolutions;
2748 data_in->reader_cache = lto_streamer_cache_create ();
2754 /* Remove DATA_IN. */
2757 lto_data_in_delete (struct data_in *data_in)
2759 VEC_free (ld_plugin_symbol_resolution_t, heap, data_in->globals_resolution);
2760 lto_streamer_cache_delete (data_in->reader_cache);
2761 free (data_in->labels);