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"
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;
279 xloc.file = input_string (data_in, ib);
280 if (xloc.file == NULL)
281 return UNKNOWN_LOCATION;
283 xloc.line = lto_input_sleb128 (ib);
284 xloc.column = lto_input_sleb128 (ib);
286 if (data_in->current_file)
287 linemap_add (line_table, LC_LEAVE, false, NULL, 0);
289 data_in->current_file = canon_file_name (xloc.file);
290 data_in->current_line = xloc.line;
291 data_in->current_col = xloc.column;
293 linemap_add (line_table, LC_ENTER, false, data_in->current_file, xloc.line);
294 LINEMAP_POSITION_FOR_COLUMN (loc, line_table, xloc.column);
300 /* Read a reference to a tree node from DATA_IN using input block IB.
301 TAG is the expected node that should be found in IB, if TAG belongs
302 to one of the indexable trees, expect to read a reference index to
303 be looked up in one of the symbol tables, otherwise read the pysical
304 representation of the tree using lto_input_tree. FN is the
305 function scope for the read tree. */
308 lto_input_tree_ref (struct lto_input_block *ib, struct data_in *data_in,
309 struct function *fn, enum LTO_tags tag)
311 unsigned HOST_WIDE_INT ix_u;
312 tree result = NULL_TREE;
314 lto_tag_check_range (tag, LTO_field_decl_ref, LTO_global_decl_ref);
319 ix_u = lto_input_uleb128 (ib);
320 result = lto_file_decl_data_get_type (data_in->file_data, ix_u);
323 case LTO_ssa_name_ref:
324 ix_u = lto_input_uleb128 (ib);
325 result = VEC_index (tree, SSANAMES (fn), ix_u);
328 case LTO_field_decl_ref:
329 ix_u = lto_input_uleb128 (ib);
330 result = lto_file_decl_data_get_field_decl (data_in->file_data, ix_u);
333 case LTO_function_decl_ref:
334 ix_u = lto_input_uleb128 (ib);
335 result = lto_file_decl_data_get_fn_decl (data_in->file_data, ix_u);
338 case LTO_type_decl_ref:
339 ix_u = lto_input_uleb128 (ib);
340 result = lto_file_decl_data_get_type_decl (data_in->file_data, ix_u);
343 case LTO_namespace_decl_ref:
344 ix_u = lto_input_uleb128 (ib);
345 result = lto_file_decl_data_get_namespace_decl (data_in->file_data, ix_u);
348 case LTO_global_decl_ref:
349 case LTO_result_decl_ref:
350 case LTO_const_decl_ref:
351 case LTO_imported_decl_ref:
352 case LTO_label_decl_ref:
353 ix_u = lto_input_uleb128 (ib);
354 result = lto_file_decl_data_get_var_decl (data_in->file_data, ix_u);
355 if (tag == LTO_global_decl_ref)
356 varpool_mark_needed_node (varpool_node (result));
369 /* Read and return a double-linked list of catch handlers from input
370 block IB, using descriptors in DATA_IN. */
372 static struct eh_catch_d *
373 lto_input_eh_catch_list (struct lto_input_block *ib, struct data_in *data_in,
379 *last_p = first = NULL;
380 tag = input_record_start (ib);
386 lto_tag_check_range (tag, LTO_eh_catch, LTO_eh_catch);
388 /* Read the catch node. */
389 n = GGC_CNEW (struct eh_catch_d);
390 n->type_list = lto_input_tree (ib, data_in);
391 n->filter_list = lto_input_tree (ib, data_in);
392 n->label = lto_input_tree (ib, data_in);
394 /* Register all the types in N->FILTER_LIST. */
395 for (list = n->filter_list; list; list = TREE_CHAIN (list))
396 add_type_for_runtime (TREE_VALUE (list));
398 /* Chain N to the end of the list. */
400 (*last_p)->next_catch = n;
401 n->prev_catch = *last_p;
404 /* Set the head of the list the first time through the loop. */
408 tag = input_record_start (ib);
415 /* Read and return EH region IX from input block IB, using descriptors
419 input_eh_region (struct lto_input_block *ib, struct data_in *data_in, int ix)
424 /* Read the region header. */
425 tag = input_record_start (ib);
429 r = GGC_CNEW (struct eh_region_d);
430 r->index = lto_input_sleb128 (ib);
432 gcc_assert (r->index == ix);
434 /* Read all the region pointers as region numbers. We'll fix up
435 the pointers once the whole array has been read. */
436 r->outer = (eh_region) (intptr_t) lto_input_sleb128 (ib);
437 r->inner = (eh_region) (intptr_t) lto_input_sleb128 (ib);
438 r->next_peer = (eh_region) (intptr_t) lto_input_sleb128 (ib);
442 case LTO_ert_cleanup:
443 r->type = ERT_CLEANUP;
448 struct eh_catch_d *last_catch;
450 r->u.eh_try.first_catch = lto_input_eh_catch_list (ib, data_in,
452 r->u.eh_try.last_catch = last_catch;
456 case LTO_ert_allowed_exceptions:
460 r->type = ERT_ALLOWED_EXCEPTIONS;
461 r->u.allowed.type_list = lto_input_tree (ib, data_in);
462 r->u.allowed.label = lto_input_tree (ib, data_in);
463 r->u.allowed.filter = lto_input_uleb128 (ib);
465 for (l = r->u.allowed.type_list; l ; l = TREE_CHAIN (l))
466 add_type_for_runtime (TREE_VALUE (l));
470 case LTO_ert_must_not_throw:
471 r->type = ERT_MUST_NOT_THROW;
472 r->u.must_not_throw.failure_decl = lto_input_tree (ib, data_in);
473 r->u.must_not_throw.failure_loc = lto_input_location (ib, data_in);
480 r->landing_pads = (eh_landing_pad) (intptr_t) lto_input_sleb128 (ib);
486 /* Read and return EH landing pad IX from input block IB, using descriptors
489 static eh_landing_pad
490 input_eh_lp (struct lto_input_block *ib, struct data_in *data_in, int ix)
495 /* Read the landing pad header. */
496 tag = input_record_start (ib);
500 lto_tag_check_range (tag, LTO_eh_landing_pad, LTO_eh_landing_pad);
502 lp = GGC_CNEW (struct eh_landing_pad_d);
503 lp->index = lto_input_sleb128 (ib);
504 gcc_assert (lp->index == ix);
505 lp->next_lp = (eh_landing_pad) (intptr_t) lto_input_sleb128 (ib);
506 lp->region = (eh_region) (intptr_t) lto_input_sleb128 (ib);
507 lp->post_landing_pad = lto_input_tree (ib, data_in);
513 /* After reading the EH regions, pointers to peer and children regions
514 are region numbers. This converts all these region numbers into
515 real pointers into the rematerialized regions for FN. ROOT_REGION
516 is the region number for the root EH region in FN. */
519 fixup_eh_region_pointers (struct function *fn, HOST_WIDE_INT root_region)
522 VEC(eh_region,gc) *eh_array = fn->eh->region_array;
523 VEC(eh_landing_pad,gc) *lp_array = fn->eh->lp_array;
527 gcc_assert (eh_array && lp_array);
529 gcc_assert (root_region >= 0);
530 fn->eh->region_tree = VEC_index (eh_region, eh_array, root_region);
532 #define FIXUP_EH_REGION(r) (r) = VEC_index (eh_region, eh_array, \
533 (HOST_WIDE_INT) (intptr_t) (r))
534 #define FIXUP_EH_LP(p) (p) = VEC_index (eh_landing_pad, lp_array, \
535 (HOST_WIDE_INT) (intptr_t) (p))
537 /* Convert all the index numbers stored in pointer fields into
538 pointers to the corresponding slots in the EH region array. */
539 for (i = 0; VEC_iterate (eh_region, eh_array, i, r); i++)
541 /* The array may contain NULL regions. */
545 gcc_assert (i == (unsigned) r->index);
546 FIXUP_EH_REGION (r->outer);
547 FIXUP_EH_REGION (r->inner);
548 FIXUP_EH_REGION (r->next_peer);
549 FIXUP_EH_LP (r->landing_pads);
552 /* Convert all the index numbers stored in pointer fields into
553 pointers to the corresponding slots in the EH landing pad array. */
554 for (i = 0; VEC_iterate (eh_landing_pad, lp_array, i, lp); i++)
556 /* The array may contain NULL landing pads. */
560 gcc_assert (i == (unsigned) lp->index);
561 FIXUP_EH_LP (lp->next_lp);
562 FIXUP_EH_REGION (lp->region);
565 #undef FIXUP_EH_REGION
570 /* Initialize EH support. */
575 /* Contrary to most other FEs, we only initialize EH support when at
576 least one of the files in the set contains exception regions in
577 it. Since this happens much later than the call to init_eh in
578 lang_dependent_init, we have to set flag_exceptions and call
579 init_eh again to initialize the EH tables. */
583 /* Initialize dwarf2 tables. Since dwarf2out_do_frame() returns
584 true only when exceptions are enabled, this initialization is
585 never done during lang_dependent_init. */
586 #if defined DWARF2_DEBUGGING_INFO || defined DWARF2_UNWIND_INFO
587 if (dwarf2out_do_frame ())
588 dwarf2out_frame_init ();
593 /* Read the exception table for FN from IB using the data descriptors
597 input_eh_regions (struct lto_input_block *ib, struct data_in *data_in,
600 HOST_WIDE_INT i, root_region, len;
602 static bool eh_initialized_p = false;
604 tag = input_record_start (ib);
608 lto_tag_check_range (tag, LTO_eh_table, LTO_eh_table);
610 /* If the file contains EH regions, then it was compiled with
611 -fexceptions. In that case, initialize the backend EH
613 if (!eh_initialized_p)
616 eh_initialized_p = true;
621 root_region = lto_input_sleb128 (ib);
622 gcc_assert (root_region == (int) root_region);
624 /* Read the EH region array. */
625 len = lto_input_sleb128 (ib);
626 gcc_assert (len == (int) len);
629 VEC_safe_grow (eh_region, gc, fn->eh->region_array, len);
630 for (i = 0; i < len; i++)
632 eh_region r = input_eh_region (ib, data_in, i);
633 VEC_replace (eh_region, fn->eh->region_array, i, r);
637 /* Read the landing pads. */
638 len = lto_input_sleb128 (ib);
639 gcc_assert (len == (int) len);
642 VEC_safe_grow (eh_landing_pad, gc, fn->eh->lp_array, len);
643 for (i = 0; i < len; i++)
645 eh_landing_pad lp = input_eh_lp (ib, data_in, i);
646 VEC_replace (eh_landing_pad, fn->eh->lp_array, i, lp);
650 /* Read the runtime type data. */
651 len = lto_input_sleb128 (ib);
652 gcc_assert (len == (int) len);
655 VEC_safe_grow (tree, gc, fn->eh->ttype_data, len);
656 for (i = 0; i < len; i++)
658 tree ttype = lto_input_tree (ib, data_in);
659 VEC_replace (tree, fn->eh->ttype_data, i, ttype);
663 /* Read the table of action chains. */
664 len = lto_input_sleb128 (ib);
665 gcc_assert (len == (int) len);
668 if (targetm.arm_eabi_unwinder)
670 VEC_safe_grow (tree, gc, fn->eh->ehspec_data.arm_eabi, len);
671 for (i = 0; i < len; i++)
673 tree t = lto_input_tree (ib, data_in);
674 VEC_replace (tree, fn->eh->ehspec_data.arm_eabi, i, t);
679 VEC_safe_grow (uchar, gc, fn->eh->ehspec_data.other, len);
680 for (i = 0; i < len; i++)
682 uchar c = lto_input_1_unsigned (ib);
683 VEC_replace (uchar, fn->eh->ehspec_data.other, i, c);
688 /* Reconstruct the EH region tree by fixing up the peer/children
690 fixup_eh_region_pointers (fn, root_region);
692 tag = input_record_start (ib);
693 lto_tag_check_range (tag, LTO_null, LTO_null);
697 /* Make a new basic block with index INDEX in function FN. */
700 make_new_block (struct function *fn, unsigned int index)
702 basic_block bb = alloc_block ();
704 SET_BASIC_BLOCK_FOR_FUNCTION (fn, index, bb);
705 bb->il.gimple = GGC_CNEW (struct gimple_bb_info);
706 n_basic_blocks_for_function (fn)++;
708 set_bb_seq (bb, gimple_seq_alloc ());
713 /* Read the CFG for function FN from input block IB. */
716 input_cfg (struct lto_input_block *ib, struct function *fn)
718 unsigned int bb_count;
723 init_empty_tree_cfg_for_function (fn);
724 init_ssa_operands ();
726 profile_status_for_function (fn) =
727 (enum profile_status_d) lto_input_uleb128 (ib);
729 bb_count = lto_input_uleb128 (ib);
731 last_basic_block_for_function (fn) = bb_count;
732 if (bb_count > VEC_length (basic_block, basic_block_info_for_function (fn)))
733 VEC_safe_grow_cleared (basic_block, gc,
734 basic_block_info_for_function (fn), bb_count);
736 if (bb_count > VEC_length (basic_block, label_to_block_map_for_function (fn)))
737 VEC_safe_grow_cleared (basic_block, gc,
738 label_to_block_map_for_function (fn), bb_count);
740 index = lto_input_sleb128 (ib);
743 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
744 unsigned int edge_count;
747 bb = make_new_block (fn, index);
749 edge_count = lto_input_uleb128 (ib);
751 /* Connect up the CFG. */
752 for (i = 0; i < edge_count; i++)
754 unsigned int dest_index;
755 unsigned int edge_flags;
761 dest_index = lto_input_uleb128 (ib);
762 probability = (int) lto_input_sleb128 (ib);
763 count = (gcov_type) lto_input_sleb128 (ib);
764 edge_flags = lto_input_uleb128 (ib);
766 dest = BASIC_BLOCK_FOR_FUNCTION (fn, dest_index);
769 dest = make_new_block (fn, dest_index);
771 e = make_edge (bb, dest, edge_flags);
772 e->probability = probability;
776 index = lto_input_sleb128 (ib);
779 p_bb = ENTRY_BLOCK_PTR_FOR_FUNCTION(fn);
780 index = lto_input_sleb128 (ib);
783 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
787 index = lto_input_sleb128 (ib);
792 /* Read a PHI function for basic block BB in function FN. DATA_IN is
793 the file being read. IB is the input block to use for reading. */
796 input_phi (struct lto_input_block *ib, basic_block bb, struct data_in *data_in,
799 unsigned HOST_WIDE_INT ix;
804 ix = lto_input_uleb128 (ib);
805 phi_result = VEC_index (tree, SSANAMES (fn), ix);
806 len = EDGE_COUNT (bb->preds);
807 result = create_phi_node (phi_result, bb);
808 SSA_NAME_DEF_STMT (phi_result) = result;
810 /* We have to go through a lookup process here because the preds in the
811 reconstructed graph are generally in a different order than they
812 were in the original program. */
813 for (i = 0; i < len; i++)
815 tree def = lto_input_tree (ib, data_in);
816 int src_index = lto_input_uleb128 (ib);
817 location_t arg_loc = lto_input_location (ib, data_in);
818 basic_block sbb = BASIC_BLOCK_FOR_FUNCTION (fn, src_index);
823 for (j = 0; j < len; j++)
824 if (EDGE_PRED (bb, j)->src == sbb)
826 e = EDGE_PRED (bb, j);
830 add_phi_arg (result, def, e, arg_loc);
837 /* Read the SSA names array for function FN from DATA_IN using input
841 input_ssa_names (struct lto_input_block *ib, struct data_in *data_in,
844 unsigned int i, size;
846 size = lto_input_uleb128 (ib);
847 init_ssanames (fn, size);
849 i = lto_input_uleb128 (ib);
855 /* Skip over the elements that had been freed. */
856 while (VEC_length (tree, SSANAMES (fn)) < i)
857 VEC_quick_push (tree, SSANAMES (fn), NULL_TREE);
859 is_default_def = (lto_input_1_unsigned (ib) != 0);
860 name = lto_input_tree (ib, data_in);
861 ssa_name = make_ssa_name_fn (fn, name, gimple_build_nop ());
864 set_default_def (SSA_NAME_VAR (ssa_name), ssa_name);
866 i = lto_input_uleb128 (ib);
871 /* Read a statement with tag TAG in function FN from block IB using
872 descriptors in DATA_IN. */
875 input_gimple_stmt (struct lto_input_block *ib, struct data_in *data_in,
876 struct function *fn, enum LTO_tags tag)
879 enum gimple_code code;
880 unsigned HOST_WIDE_INT num_ops;
882 struct bitpack_d *bp;
884 code = lto_tag_to_gimple_code (tag);
886 /* Read the tuple header. */
887 bp = lto_input_bitpack (ib);
888 num_ops = bp_unpack_value (bp, sizeof (unsigned) * 8);
889 stmt = gimple_alloc (code, num_ops);
890 stmt->gsbase.no_warning = bp_unpack_value (bp, 1);
891 if (is_gimple_assign (stmt))
892 stmt->gsbase.nontemporal_move = bp_unpack_value (bp, 1);
893 stmt->gsbase.has_volatile_ops = bp_unpack_value (bp, 1);
894 stmt->gsbase.subcode = bp_unpack_value (bp, 16);
897 /* Read location information. */
898 gimple_set_location (stmt, lto_input_location (ib, data_in));
900 /* Read lexical block reference. */
901 gimple_set_block (stmt, lto_input_tree (ib, data_in));
903 /* Read in all the operands. */
907 gimple_resx_set_region (stmt, lto_input_sleb128 (ib));
910 case GIMPLE_EH_MUST_NOT_THROW:
911 gimple_eh_must_not_throw_set_fndecl (stmt, lto_input_tree (ib, data_in));
914 case GIMPLE_EH_DISPATCH:
915 gimple_eh_dispatch_set_region (stmt, lto_input_sleb128 (ib));
920 /* FIXME lto. Move most of this into a new gimple_asm_set_string(). */
922 stmt->gimple_asm.ni = lto_input_uleb128 (ib);
923 stmt->gimple_asm.no = lto_input_uleb128 (ib);
924 stmt->gimple_asm.nc = lto_input_uleb128 (ib);
925 str = input_string_cst (data_in, ib);
926 stmt->gimple_asm.string = TREE_STRING_POINTER (str);
938 for (i = 0; i < num_ops; i++)
940 tree op = lto_input_tree (ib, data_in);
941 gimple_set_op (stmt, i, op);
950 internal_error ("bytecode stream: unknown GIMPLE statement tag %s",
954 /* Update the properties of symbols, SSA names and labels associated
956 if (code == GIMPLE_ASSIGN || code == GIMPLE_CALL)
958 tree lhs = gimple_get_lhs (stmt);
959 if (lhs && TREE_CODE (lhs) == SSA_NAME)
960 SSA_NAME_DEF_STMT (lhs) = stmt;
962 else if (code == GIMPLE_LABEL)
963 gcc_assert (emit_label_in_global_context_p (gimple_label_label (stmt))
964 || DECL_CONTEXT (gimple_label_label (stmt)) == fn->decl);
965 else if (code == GIMPLE_ASM)
969 for (i = 0; i < gimple_asm_noutputs (stmt); i++)
971 tree op = TREE_VALUE (gimple_asm_output_op (stmt, i));
972 if (TREE_CODE (op) == SSA_NAME)
973 SSA_NAME_DEF_STMT (op) = stmt;
977 /* Mark the statement modified so its operand vectors can be filled in. */
978 gimple_set_modified (stmt, true);
984 /* Read a basic block with tag TAG from DATA_IN using input block IB.
985 FN is the function being processed. */
988 input_bb (struct lto_input_block *ib, enum LTO_tags tag,
989 struct data_in *data_in, struct function *fn)
993 gimple_stmt_iterator bsi;
995 /* This routine assumes that CFUN is set to FN, as it needs to call
996 basic GIMPLE routines that use CFUN. */
997 gcc_assert (cfun == fn);
999 index = lto_input_uleb128 (ib);
1000 bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
1002 bb->count = lto_input_sleb128 (ib);
1003 bb->loop_depth = lto_input_sleb128 (ib);
1004 bb->frequency = lto_input_sleb128 (ib);
1005 bb->flags = lto_input_sleb128 (ib);
1007 /* LTO_bb1 has statements. LTO_bb0 does not. */
1011 bsi = gsi_start_bb (bb);
1012 tag = input_record_start (ib);
1015 gimple stmt = input_gimple_stmt (ib, data_in, fn, tag);
1017 /* Change debug stmts to nops on-the-fly if we do not have VTA enabled.
1018 This allows us to build for example static libs with debugging
1019 enabled and do the final link without. */
1020 if (!MAY_HAVE_DEBUG_STMTS
1021 && is_gimple_debug (stmt))
1022 stmt = gimple_build_nop ();
1024 find_referenced_vars_in (stmt);
1025 gsi_insert_after (&bsi, stmt, GSI_NEW_STMT);
1027 /* After the statement, expect a 0 delimiter or the EH region
1028 that the previous statement belongs to. */
1029 tag = input_record_start (ib);
1030 lto_tag_check_set (tag, 2, LTO_eh_region, LTO_null);
1032 if (tag == LTO_eh_region)
1034 HOST_WIDE_INT region = lto_input_sleb128 (ib);
1035 gcc_assert (region == (int) region);
1036 add_stmt_to_eh_lp (stmt, region);
1039 tag = input_record_start (ib);
1042 tag = input_record_start (ib);
1045 gimple phi = input_phi (ib, bb, data_in, fn);
1046 find_referenced_vars_in (phi);
1047 tag = input_record_start (ib);
1051 /* Go through all NODE edges and fixup call_stmt pointers
1052 so they point to STMTS. */
1055 fixup_call_stmt_edges_1 (struct cgraph_node *node, gimple *stmts)
1057 struct cgraph_edge *cedge;
1058 for (cedge = node->callees; cedge; cedge = cedge->next_callee)
1059 cedge->call_stmt = stmts[cedge->lto_stmt_uid];
1062 /* Fixup call_stmt pointers in NODE and all clones. */
1065 fixup_call_stmt_edges (struct cgraph_node *orig, gimple *stmts)
1067 struct cgraph_node *node;
1069 while (orig->clone_of)
1070 orig = orig->clone_of;
1072 fixup_call_stmt_edges_1 (orig, stmts);
1074 for (node = orig->clones; node != orig;)
1076 fixup_call_stmt_edges_1 (node, stmts);
1078 node = node->clones;
1079 else if (node->next_sibling_clone)
1080 node = node->next_sibling_clone;
1083 while (node != orig && !node->next_sibling_clone)
1084 node = node->clone_of;
1086 node = node->next_sibling_clone;
1091 /* Read the body of function FN_DECL from DATA_IN using input block IB. */
1094 input_function (tree fn_decl, struct data_in *data_in,
1095 struct lto_input_block *ib)
1097 struct function *fn;
1101 struct bitpack_d *bp;
1103 fn = DECL_STRUCT_FUNCTION (fn_decl);
1104 tag = input_record_start (ib);
1105 clear_line_info (data_in);
1107 gimple_register_cfg_hooks ();
1108 lto_tag_check (tag, LTO_function);
1110 /* Read all the attributes for FN. */
1111 bp = lto_input_bitpack (ib);
1112 fn->is_thunk = bp_unpack_value (bp, 1);
1113 fn->has_local_explicit_reg_vars = bp_unpack_value (bp, 1);
1114 fn->after_tree_profile = bp_unpack_value (bp, 1);
1115 fn->returns_pcc_struct = bp_unpack_value (bp, 1);
1116 fn->returns_struct = bp_unpack_value (bp, 1);
1117 fn->always_inline_functions_inlined = bp_unpack_value (bp, 1);
1118 fn->after_inlining = bp_unpack_value (bp, 1);
1119 fn->dont_save_pending_sizes_p = bp_unpack_value (bp, 1);
1120 fn->stdarg = bp_unpack_value (bp, 1);
1121 fn->has_nonlocal_label = bp_unpack_value (bp, 1);
1122 fn->calls_alloca = bp_unpack_value (bp, 1);
1123 fn->calls_setjmp = bp_unpack_value (bp, 1);
1124 fn->function_frequency = (enum function_frequency) bp_unpack_value (bp, 2);
1125 fn->va_list_fpr_size = bp_unpack_value (bp, 8);
1126 fn->va_list_gpr_size = bp_unpack_value (bp, 8);
1127 bitpack_delete (bp);
1129 /* Read the static chain and non-local goto save area. */
1130 fn->static_chain_decl = lto_input_tree (ib, data_in);
1131 fn->nonlocal_goto_save_area = lto_input_tree (ib, data_in);
1133 /* Read all the local symbols. */
1134 fn->local_decls = lto_input_tree (ib, data_in);
1136 /* Read all the SSA names. */
1137 input_ssa_names (ib, data_in, fn);
1139 /* Read the exception handling regions in the function. */
1140 input_eh_regions (ib, data_in, fn);
1142 /* Read the tree of lexical scopes for the function. */
1143 DECL_INITIAL (fn_decl) = lto_input_tree (ib, data_in);
1144 gcc_assert (DECL_INITIAL (fn_decl));
1145 DECL_SAVED_TREE (fn_decl) = NULL_TREE;
1147 /* Read all function arguments. */
1148 DECL_ARGUMENTS (fn_decl) = lto_input_tree (ib, data_in);
1150 /* Read all the basic blocks. */
1151 tag = input_record_start (ib);
1154 input_bb (ib, tag, data_in, fn);
1155 tag = input_record_start (ib);
1158 /* Fix up the call statements that are mentioned in the callgraph
1160 renumber_gimple_stmt_uids ();
1161 stmts = (gimple *) xcalloc (gimple_stmt_max_uid (fn), sizeof (gimple));
1164 gimple_stmt_iterator bsi;
1165 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1167 gimple stmt = gsi_stmt (bsi);
1168 stmts[gimple_uid (stmt)] = stmt;
1172 /* Set the gimple body to the statement sequence in the entry
1173 basic block. FIXME lto, this is fairly hacky. The existence
1174 of a gimple body is used by the cgraph routines, but we should
1175 really use the presence of the CFG. */
1177 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs);
1178 gimple_set_body (fn_decl, bb_seq (ei_edge (ei)->dest));
1181 fixup_call_stmt_edges (cgraph_node (fn_decl), stmts);
1183 update_ssa (TODO_update_ssa_only_virtuals);
1188 /* Read initializer expressions for public statics. DATA_IN is the
1189 file being read. IB is the input block used for reading. */
1192 input_alias_pairs (struct lto_input_block *ib, struct data_in *data_in)
1196 clear_line_info (data_in);
1198 /* Skip over all the unreferenced globals. */
1200 var = lto_input_tree (ib, data_in);
1203 var = lto_input_tree (ib, data_in);
1206 const char *orig_name, *new_name;
1209 p = VEC_safe_push (alias_pair, gc, alias_pairs, NULL);
1211 p->target = lto_input_tree (ib, data_in);
1213 /* If the target is a static object, we may have registered a
1214 new name for it to avoid clashes between statics coming from
1215 different files. In that case, use the new name. */
1216 orig_name = IDENTIFIER_POINTER (p->target);
1217 new_name = lto_get_decl_name_mapping (data_in->file_data, orig_name);
1218 if (strcmp (orig_name, new_name) != 0)
1219 p->target = get_identifier (new_name);
1221 var = lto_input_tree (ib, data_in);
1226 /* Read the body from DATA for function FN_DECL and fill it in.
1227 FILE_DATA are the global decls and types. SECTION_TYPE is either
1228 LTO_section_function_body or LTO_section_static_initializer. If
1229 section type is LTO_section_function_body, FN must be the decl for
1233 lto_read_body (struct lto_file_decl_data *file_data, tree fn_decl,
1234 const char *data, enum lto_section_type section_type)
1236 const struct lto_function_header *header;
1237 struct data_in *data_in;
1239 int32_t main_offset;
1240 int32_t string_offset;
1241 struct lto_input_block ib_cfg;
1242 struct lto_input_block ib_main;
1244 header = (const struct lto_function_header *) data;
1245 cfg_offset = sizeof (struct lto_function_header);
1246 main_offset = cfg_offset + header->cfg_size;
1247 string_offset = main_offset + header->main_size;
1249 LTO_INIT_INPUT_BLOCK (ib_cfg,
1254 LTO_INIT_INPUT_BLOCK (ib_main,
1259 data_in = lto_data_in_create (file_data, data + string_offset,
1260 header->string_size, NULL);
1262 /* Make sure the file was generated by the exact same compiler. */
1263 lto_check_version (header->lto_header.major_version,
1264 header->lto_header.minor_version);
1266 if (section_type == LTO_section_function_body)
1268 struct function *fn = DECL_STRUCT_FUNCTION (fn_decl);
1269 struct lto_in_decl_state *decl_state;
1274 /* Use the function's decl state. */
1275 decl_state = lto_get_function_in_decl_state (file_data, fn_decl);
1276 gcc_assert (decl_state);
1277 file_data->current_decl_state = decl_state;
1279 input_cfg (&ib_cfg, fn);
1281 /* Set up the struct function. */
1282 input_function (fn_decl, data_in, &ib_main);
1284 /* We should now be in SSA. */
1285 cfun->gimple_df->in_ssa_p = true;
1287 /* Fill in properties we know hold for the rebuilt CFG. */
1288 cfun->curr_properties = PROP_ssa
1293 | PROP_referenced_vars;
1295 /* Restore decl state */
1296 file_data->current_decl_state = file_data->global_decl_state;
1302 input_alias_pairs (&ib_main, data_in);
1305 clear_line_info (data_in);
1306 lto_data_in_delete (data_in);
1310 /* Read the body of FN_DECL using DATA. FILE_DATA holds the global
1314 lto_input_function_body (struct lto_file_decl_data *file_data,
1315 tree fn_decl, const char *data)
1317 current_function_decl = fn_decl;
1318 lto_read_body (file_data, fn_decl, data, LTO_section_function_body);
1322 /* Read in VAR_DECL using DATA. FILE_DATA holds the global decls and
1326 lto_input_constructors_and_inits (struct lto_file_decl_data *file_data,
1329 lto_read_body (file_data, NULL, data, LTO_section_static_initializer);
1333 /* Return the resolution for the decl with index INDEX from DATA_IN. */
1335 static enum ld_plugin_symbol_resolution
1336 get_resolution (struct data_in *data_in, unsigned index)
1338 if (data_in->globals_resolution)
1340 ld_plugin_symbol_resolution_t ret;
1341 gcc_assert (index < VEC_length (ld_plugin_symbol_resolution_t,
1342 data_in->globals_resolution));
1343 ret = VEC_index (ld_plugin_symbol_resolution_t,
1344 data_in->globals_resolution,
1346 gcc_assert (ret != LDPR_UNKNOWN);
1350 /* Delay resolution finding until decl merging. */
1351 return LDPR_UNKNOWN;
1355 /* Unpack all the non-pointer fields of the TS_BASE structure of
1356 expression EXPR from bitpack BP. */
1359 unpack_ts_base_value_fields (struct bitpack_d *bp, tree expr)
1361 /* Note that the code for EXPR has already been unpacked to create EXPR in
1362 lto_materialize_tree. */
1365 TREE_SIDE_EFFECTS (expr) = (unsigned) bp_unpack_value (bp, 1);
1366 TREE_CONSTANT (expr) = (unsigned) bp_unpack_value (bp, 1);
1367 TREE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
1369 /* TREE_PUBLIC is used on types to indicate that the type
1370 has a TYPE_CACHED_VALUES vector. This is not streamed out,
1371 so we skip it here. */
1372 TREE_PUBLIC (expr) = (unsigned) bp_unpack_value (bp, 1);
1374 TREE_ADDRESSABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
1375 TREE_THIS_VOLATILE (expr) = (unsigned) bp_unpack_value (bp, 1);
1377 DECL_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
1378 else if (TYPE_P (expr))
1379 TYPE_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
1380 TREE_ASM_WRITTEN (expr) = (unsigned) bp_unpack_value (bp, 1);
1381 TREE_NO_WARNING (expr) = (unsigned) bp_unpack_value (bp, 1);
1382 TREE_USED (expr) = (unsigned) bp_unpack_value (bp, 1);
1383 TREE_NOTHROW (expr) = (unsigned) bp_unpack_value (bp, 1);
1384 TREE_STATIC (expr) = (unsigned) bp_unpack_value (bp, 1);
1385 TREE_PRIVATE (expr) = (unsigned) bp_unpack_value (bp, 1);
1386 TREE_PROTECTED (expr) = (unsigned) bp_unpack_value (bp, 1);
1387 TREE_DEPRECATED (expr) = (unsigned) bp_unpack_value (bp, 1);
1389 TYPE_SATURATING (expr) = (unsigned) bp_unpack_value (bp, 1);
1390 if (TREE_CODE (expr) == SSA_NAME)
1391 SSA_NAME_IS_DEFAULT_DEF (expr) = (unsigned) bp_unpack_value (bp, 1);
1395 /* Unpack all the non-pointer fields of the TS_REAL_CST structure of
1396 expression EXPR from bitpack BP. */
1399 unpack_ts_real_cst_value_fields (struct bitpack_d *bp, tree expr)
1403 REAL_VALUE_TYPE *rp;
1405 r.cl = (unsigned) bp_unpack_value (bp, 2);
1406 r.decimal = (unsigned) bp_unpack_value (bp, 1);
1407 r.sign = (unsigned) bp_unpack_value (bp, 1);
1408 r.signalling = (unsigned) bp_unpack_value (bp, 1);
1409 r.canonical = (unsigned) bp_unpack_value (bp, 1);
1410 r.uexp = (unsigned) bp_unpack_value (bp, EXP_BITS);
1411 for (i = 0; i < SIGSZ; i++)
1412 r.sig[i] = (unsigned long) bp_unpack_value (bp, HOST_BITS_PER_LONG);
1414 rp = GGC_NEW (REAL_VALUE_TYPE);
1415 memcpy (rp, &r, sizeof (REAL_VALUE_TYPE));
1416 TREE_REAL_CST_PTR (expr) = rp;
1420 /* Unpack all the non-pointer fields of the TS_FIXED_CST structure of
1421 expression EXPR from bitpack BP. */
1424 unpack_ts_fixed_cst_value_fields (struct bitpack_d *bp, tree expr)
1426 struct fixed_value fv;
1428 fv.data.low = (HOST_WIDE_INT) bp_unpack_value (bp, HOST_BITS_PER_WIDE_INT);
1429 fv.data.high = (HOST_WIDE_INT) bp_unpack_value (bp, HOST_BITS_PER_WIDE_INT);
1430 TREE_FIXED_CST (expr) = fv;
1434 /* Unpack all the non-pointer fields of the TS_DECL_COMMON structure
1435 of expression EXPR from bitpack BP. */
1438 unpack_ts_decl_common_value_fields (struct bitpack_d *bp, tree expr)
1440 DECL_MODE (expr) = (enum machine_mode) bp_unpack_value (bp, 8);
1441 DECL_NONLOCAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1442 DECL_VIRTUAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1443 DECL_IGNORED_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1444 DECL_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
1445 DECL_ARTIFICIAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1446 DECL_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
1447 DECL_PRESERVE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1448 DECL_DEBUG_EXPR_IS_FROM (expr) = (unsigned) bp_unpack_value (bp, 1);
1449 DECL_EXTERNAL (expr) = (unsigned) bp_unpack_value (bp, 1);
1450 DECL_GIMPLE_REG_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1451 DECL_ALIGN (expr) = (unsigned) bp_unpack_value (bp, HOST_BITS_PER_INT);
1453 if (TREE_CODE (expr) == LABEL_DECL)
1455 DECL_ERROR_ISSUED (expr) = (unsigned) bp_unpack_value (bp, 1);
1456 EH_LANDING_PAD_NR (expr) = (int) bp_unpack_value (bp, HOST_BITS_PER_INT);
1458 /* Always assume an initial value of -1 for LABEL_DECL_UID to
1459 force gimple_set_bb to recreate label_to_block_map. */
1460 LABEL_DECL_UID (expr) = -1;
1463 if (TREE_CODE (expr) == FIELD_DECL)
1465 unsigned HOST_WIDE_INT off_align;
1466 DECL_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
1467 DECL_NONADDRESSABLE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1468 off_align = (unsigned HOST_WIDE_INT) bp_unpack_value (bp, 8);
1469 SET_DECL_OFFSET_ALIGN (expr, off_align);
1472 if (TREE_CODE (expr) == RESULT_DECL
1473 || TREE_CODE (expr) == PARM_DECL
1474 || TREE_CODE (expr) == VAR_DECL)
1476 DECL_BY_REFERENCE (expr) = (unsigned) bp_unpack_value (bp, 1);
1477 if (TREE_CODE (expr) == VAR_DECL
1478 || TREE_CODE (expr) == PARM_DECL)
1479 DECL_HAS_VALUE_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1484 /* Unpack all the non-pointer fields of the TS_DECL_WRTL structure
1485 of expression EXPR from bitpack BP. */
1488 unpack_ts_decl_wrtl_value_fields (struct bitpack_d *bp, tree expr)
1490 DECL_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
1494 /* Unpack all the non-pointer fields of the TS_DECL_WITH_VIS structure
1495 of expression EXPR from bitpack BP. */
1498 unpack_ts_decl_with_vis_value_fields (struct bitpack_d *bp, tree expr)
1500 DECL_DEFER_OUTPUT (expr) = (unsigned) bp_unpack_value (bp, 1);
1501 DECL_COMMON (expr) = (unsigned) bp_unpack_value (bp, 1);
1502 DECL_DLLIMPORT_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1503 DECL_WEAK (expr) = (unsigned) bp_unpack_value (bp, 1);
1504 DECL_SEEN_IN_BIND_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1505 DECL_COMDAT (expr) = (unsigned) bp_unpack_value (bp, 1);
1506 DECL_VISIBILITY (expr) = (enum symbol_visibility) bp_unpack_value (bp, 2);
1507 DECL_VISIBILITY_SPECIFIED (expr) = (unsigned) bp_unpack_value (bp, 1);
1509 if (TREE_CODE (expr) == VAR_DECL)
1511 DECL_HARD_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
1512 DECL_IN_TEXT_SECTION (expr) = (unsigned) bp_unpack_value (bp, 1);
1513 DECL_TLS_MODEL (expr) = (enum tls_model) bp_unpack_value (bp, 3);
1516 if (VAR_OR_FUNCTION_DECL_P (expr))
1519 p = (priority_type) bp_unpack_value (bp, HOST_BITS_PER_SHORT);
1520 SET_DECL_INIT_PRIORITY (expr, p);
1525 /* Unpack all the non-pointer fields of the TS_FUNCTION_DECL structure
1526 of expression EXPR from bitpack BP. */
1529 unpack_ts_function_decl_value_fields (struct bitpack_d *bp, tree expr)
1531 DECL_FUNCTION_CODE (expr) = (enum built_in_function) bp_unpack_value (bp, 11);
1532 DECL_BUILT_IN_CLASS (expr) = (enum built_in_class) bp_unpack_value (bp, 2);
1533 DECL_STATIC_CONSTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
1534 DECL_STATIC_DESTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
1535 DECL_UNINLINABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
1536 DECL_POSSIBLY_INLINED (expr) = (unsigned) bp_unpack_value (bp, 1);
1537 DECL_IS_NOVOPS (expr) = (unsigned) bp_unpack_value (bp, 1);
1538 DECL_IS_RETURNS_TWICE (expr) = (unsigned) bp_unpack_value (bp, 1);
1539 DECL_IS_MALLOC (expr) = (unsigned) bp_unpack_value (bp, 1);
1540 DECL_IS_OPERATOR_NEW (expr) = (unsigned) bp_unpack_value (bp, 1);
1541 DECL_DECLARED_INLINE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1542 DECL_STATIC_CHAIN (expr) = (unsigned) bp_unpack_value (bp, 1);
1543 DECL_NO_INLINE_WARNING_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1544 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (expr)
1545 = (unsigned) bp_unpack_value (bp, 1);
1546 DECL_NO_LIMIT_STACK (expr) = (unsigned) bp_unpack_value (bp, 1);
1547 DECL_DISREGARD_INLINE_LIMITS (expr) = (unsigned) bp_unpack_value (bp, 1);
1548 DECL_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1549 DECL_LOOPING_CONST_OR_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
1553 /* Unpack all the non-pointer fields of the TS_TYPE structure
1554 of expression EXPR from bitpack BP. */
1557 unpack_ts_type_value_fields (struct bitpack_d *bp, tree expr)
1559 enum machine_mode mode;
1561 TYPE_PRECISION (expr) = (unsigned) bp_unpack_value (bp, 9);
1562 mode = (enum machine_mode) bp_unpack_value (bp, 7);
1563 SET_TYPE_MODE (expr, mode);
1564 TYPE_STRING_FLAG (expr) = (unsigned) bp_unpack_value (bp, 1);
1565 TYPE_NO_FORCE_BLK (expr) = (unsigned) bp_unpack_value (bp, 1);
1566 TYPE_NEEDS_CONSTRUCTING(expr) = (unsigned) bp_unpack_value (bp, 1);
1567 if (TREE_CODE (expr) == UNION_TYPE)
1568 TYPE_TRANSPARENT_UNION (expr) = (unsigned) bp_unpack_value (bp, 1);
1569 TYPE_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
1570 TYPE_RESTRICT (expr) = (unsigned) bp_unpack_value (bp, 1);
1571 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr)
1572 = (unsigned) bp_unpack_value (bp, 2);
1573 TYPE_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
1574 TYPE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
1575 TYPE_ALIGN (expr) = (unsigned) bp_unpack_value (bp, HOST_BITS_PER_INT);
1576 TYPE_ALIAS_SET (expr) = bp_unpack_value (bp, HOST_BITS_PER_INT);
1580 /* Unpack all the non-pointer fields of the TS_BLOCK structure
1581 of expression EXPR from bitpack BP. */
1584 unpack_ts_block_value_fields (struct bitpack_d *bp, tree expr)
1586 BLOCK_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
1587 BLOCK_NUMBER (expr) = (unsigned) bp_unpack_value (bp, 31);
1591 /* Unpack all the non-pointer fields in EXPR into a bit pack. */
1594 unpack_value_fields (struct bitpack_d *bp, tree expr)
1596 enum tree_code code;
1598 code = TREE_CODE (expr);
1600 /* Note that all these functions are highly sensitive to changes in
1601 the types and sizes of each of the fields being packed. */
1602 unpack_ts_base_value_fields (bp, expr);
1604 if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST))
1605 unpack_ts_real_cst_value_fields (bp, expr);
1607 if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST))
1608 unpack_ts_fixed_cst_value_fields (bp, expr);
1610 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1611 unpack_ts_decl_common_value_fields (bp, expr);
1613 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
1614 unpack_ts_decl_wrtl_value_fields (bp, expr);
1616 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
1617 unpack_ts_decl_with_vis_value_fields (bp, expr);
1619 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
1620 unpack_ts_function_decl_value_fields (bp, expr);
1622 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
1623 unpack_ts_type_value_fields (bp, expr);
1625 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
1626 unpack_ts_block_value_fields (bp, expr);
1628 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
1630 /* We only stream the version number of SSA names. */
1634 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
1636 /* This is only used by GENERIC. */
1640 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
1642 /* This is only used by High GIMPLE. */
1648 /* Read a bitpack from input block IB. */
1651 lto_input_bitpack (struct lto_input_block *ib)
1653 unsigned i, num_words;
1654 struct bitpack_d *bp;
1656 bp = bitpack_create ();
1658 /* If we are about to read more than a handful of words, something
1659 is wrong. This check is overly strict, but it acts as an early
1660 warning. No streamed object has hundreds of bits in its fields. */
1661 num_words = lto_input_uleb128 (ib);
1662 gcc_assert (num_words < 20);
1664 for (i = 0; i < num_words; i++)
1666 bitpack_word_t w = lto_input_uleb128 (ib);
1667 VEC_safe_push (bitpack_word_t, heap, bp->values, w);
1674 /* Materialize a new tree from input block IB using descriptors in
1675 DATA_IN. The code for the new tree should match TAG. Store in
1676 *IX_P the index into the reader cache where the new tree is stored. */
1679 lto_materialize_tree (struct lto_input_block *ib, struct data_in *data_in,
1680 enum LTO_tags tag, int *ix_p)
1682 struct bitpack_d *bp;
1683 enum tree_code code;
1685 #ifdef LTO_STREAMER_DEBUG
1686 HOST_WIDEST_INT orig_address_in_writer;
1692 /* Read the header of the node we are about to create. */
1693 ix = lto_input_sleb128 (ib);
1694 gcc_assert ((int) ix == ix);
1697 #ifdef LTO_STREAMER_DEBUG
1698 /* Read the word representing the memory address for the tree
1699 as it was written by the writer. This is useful when
1700 debugging differences between the writer and reader. */
1701 orig_address_in_writer = lto_input_sleb128 (ib);
1702 gcc_assert ((intptr_t) orig_address_in_writer == orig_address_in_writer);
1705 code = lto_tag_to_tree_code (tag);
1707 /* We should never see an SSA_NAME tree. Only the version numbers of
1708 SSA names are ever written out. See input_ssa_names. */
1709 gcc_assert (code != SSA_NAME);
1711 /* Instantiate a new tree using the header data. */
1712 if (CODE_CONTAINS_STRUCT (code, TS_STRING))
1713 result = input_string_cst (data_in, ib);
1714 else if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER))
1715 result = input_identifier (data_in, ib);
1716 else if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1718 HOST_WIDE_INT len = lto_input_sleb128 (ib);
1719 result = make_tree_vec (len);
1721 else if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1723 unsigned HOST_WIDE_INT len = lto_input_uleb128 (ib);
1724 result = make_tree_binfo (len);
1728 /* All other nodes can be materialized with a raw make_node
1730 result = make_node (code);
1733 #ifdef LTO_STREAMER_DEBUG
1734 /* Store the original address of the tree as seen by the writer
1735 in RESULT's aux field. This is useful when debugging streaming
1736 problems. This way, a debugging session can be started on
1737 both writer and reader with a breakpoint using this address
1739 lto_orig_address_map (result, (intptr_t) orig_address_in_writer);
1742 /* Read the bitpack of non-pointer values from IB. */
1743 bp = lto_input_bitpack (ib);
1745 /* The first word in BP contains the code of the tree that we
1746 are about to read. */
1747 code = (enum tree_code) bp_unpack_value (bp, 16);
1748 lto_tag_check (lto_tree_code_to_tag (code), tag);
1750 /* Unpack all the value fields from BP. */
1751 unpack_value_fields (bp, result);
1752 bitpack_delete (bp);
1754 /* Enter RESULT in the reader cache. This will make RESULT
1755 available so that circular references in the rest of the tree
1756 structure can be resolved in subsequent calls to lto_input_tree. */
1757 lto_streamer_cache_insert_at (data_in->reader_cache, result, ix);
1763 /* Read a chain of tree nodes from input block IB. DATA_IN contains
1764 tables and descriptors for the file being read. */
1767 lto_input_chain (struct lto_input_block *ib, struct data_in *data_in)
1770 tree first, prev, curr;
1772 first = prev = NULL_TREE;
1773 count = lto_input_sleb128 (ib);
1774 for (i = 0; i < count; i++)
1776 curr = lto_input_tree (ib, data_in);
1778 TREE_CHAIN (prev) = curr;
1782 TREE_CHAIN (curr) = NULL_TREE;
1790 /* Read all pointer fields in the TS_COMMON structure of EXPR from input
1791 block IB. DATA_IN contains tables and descriptors for the
1796 lto_input_ts_common_tree_pointers (struct lto_input_block *ib,
1797 struct data_in *data_in, tree expr)
1799 TREE_TYPE (expr) = lto_input_tree (ib, data_in);
1803 /* Read all pointer fields in the TS_VECTOR structure of EXPR from input
1804 block IB. DATA_IN contains tables and descriptors for the
1808 lto_input_ts_vector_tree_pointers (struct lto_input_block *ib,
1809 struct data_in *data_in, tree expr)
1811 TREE_VECTOR_CST_ELTS (expr) = lto_input_chain (ib, data_in);
1815 /* Read all pointer fields in the TS_COMPLEX structure of EXPR from input
1816 block IB. DATA_IN contains tables and descriptors for the
1820 lto_input_ts_complex_tree_pointers (struct lto_input_block *ib,
1821 struct data_in *data_in, tree expr)
1823 TREE_REALPART (expr) = lto_input_tree (ib, data_in);
1824 TREE_IMAGPART (expr) = lto_input_tree (ib, data_in);
1828 /* Read all pointer fields in the TS_DECL_MINIMAL structure of EXPR
1829 from input block IB. DATA_IN contains tables and descriptors for the
1833 lto_input_ts_decl_minimal_tree_pointers (struct lto_input_block *ib,
1834 struct data_in *data_in, tree expr)
1836 DECL_NAME (expr) = lto_input_tree (ib, data_in);
1837 DECL_CONTEXT (expr) = lto_input_tree (ib, data_in);
1838 DECL_SOURCE_LOCATION (expr) = lto_input_location (ib, data_in);
1842 /* Read all pointer fields in the TS_DECL_COMMON structure of EXPR from
1843 input block IB. DATA_IN contains tables and descriptors for the
1847 lto_input_ts_decl_common_tree_pointers (struct lto_input_block *ib,
1848 struct data_in *data_in, tree expr)
1850 DECL_SIZE (expr) = lto_input_tree (ib, data_in);
1851 DECL_SIZE_UNIT (expr) = lto_input_tree (ib, data_in);
1853 if (TREE_CODE (expr) != FUNCTION_DECL)
1854 DECL_INITIAL (expr) = lto_input_tree (ib, data_in);
1856 DECL_ATTRIBUTES (expr) = lto_input_tree (ib, data_in);
1857 DECL_ABSTRACT_ORIGIN (expr) = lto_input_tree (ib, data_in);
1859 if (TREE_CODE (expr) == PARM_DECL)
1860 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
1864 /* Read all pointer fields in the TS_DECL_NON_COMMON structure of
1865 EXPR from input block IB. DATA_IN contains tables and descriptors for the
1869 lto_input_ts_decl_non_common_tree_pointers (struct lto_input_block *ib,
1870 struct data_in *data_in, tree expr)
1872 if (TREE_CODE (expr) == FUNCTION_DECL)
1874 DECL_ARGUMENTS (expr) = lto_input_tree (ib, data_in);
1875 DECL_RESULT (expr) = lto_input_tree (ib, data_in);
1877 DECL_VINDEX (expr) = lto_input_tree (ib, data_in);
1881 /* Read all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
1882 from input block IB. DATA_IN contains tables and descriptors for the
1886 lto_input_ts_decl_with_vis_tree_pointers (struct lto_input_block *ib,
1887 struct data_in *data_in, tree expr)
1891 id = lto_input_tree (ib, data_in);
1894 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
1895 SET_DECL_ASSEMBLER_NAME (expr, id);
1898 DECL_SECTION_NAME (expr) = lto_input_tree (ib, data_in);
1899 DECL_COMDAT_GROUP (expr) = lto_input_tree (ib, data_in);
1903 /* Read all pointer fields in the TS_FIELD_DECL structure of EXPR from
1904 input block IB. DATA_IN contains tables and descriptors for the
1908 lto_input_ts_field_decl_tree_pointers (struct lto_input_block *ib,
1909 struct data_in *data_in, tree expr)
1911 DECL_FIELD_OFFSET (expr) = lto_input_tree (ib, data_in);
1912 DECL_BIT_FIELD_TYPE (expr) = lto_input_tree (ib, data_in);
1913 DECL_QUALIFIER (expr) = lto_input_tree (ib, data_in);
1914 DECL_FIELD_BIT_OFFSET (expr) = lto_input_tree (ib, data_in);
1915 DECL_FCONTEXT (expr) = lto_input_tree (ib, data_in);
1916 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
1920 /* Read all pointer fields in the TS_FUNCTION_DECL structure of EXPR
1921 from input block IB. DATA_IN contains tables and descriptors for the
1925 lto_input_ts_function_decl_tree_pointers (struct lto_input_block *ib,
1926 struct data_in *data_in, tree expr)
1928 /* DECL_STRUCT_FUNCTION is handled by lto_input_function. FIXME lto,
1929 maybe it should be handled here? */
1930 DECL_FUNCTION_PERSONALITY (expr) = lto_input_tree (ib, data_in);
1931 DECL_FUNCTION_SPECIFIC_TARGET (expr) = lto_input_tree (ib, data_in);
1932 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr) = lto_input_tree (ib, data_in);
1936 /* Read all pointer fields in the TS_TYPE structure of EXPR from input
1937 block IB. DATA_IN contains tables and descriptors for the
1941 lto_input_ts_type_tree_pointers (struct lto_input_block *ib,
1942 struct data_in *data_in, tree expr)
1944 if (TREE_CODE (expr) == ENUMERAL_TYPE)
1945 TYPE_VALUES (expr) = lto_input_tree (ib, data_in);
1946 else if (TREE_CODE (expr) == ARRAY_TYPE)
1947 TYPE_DOMAIN (expr) = lto_input_tree (ib, data_in);
1948 else if (TREE_CODE (expr) == RECORD_TYPE || TREE_CODE (expr) == UNION_TYPE)
1949 TYPE_FIELDS (expr) = lto_input_tree (ib, data_in);
1950 else if (TREE_CODE (expr) == FUNCTION_TYPE || TREE_CODE (expr) == METHOD_TYPE)
1951 TYPE_ARG_TYPES (expr) = lto_input_tree (ib, data_in);
1952 else if (TREE_CODE (expr) == VECTOR_TYPE)
1953 TYPE_DEBUG_REPRESENTATION_TYPE (expr) = lto_input_tree (ib, data_in);
1955 TYPE_SIZE (expr) = lto_input_tree (ib, data_in);
1956 TYPE_SIZE_UNIT (expr) = lto_input_tree (ib, data_in);
1957 TYPE_ATTRIBUTES (expr) = lto_input_tree (ib, data_in);
1958 TYPE_NAME (expr) = lto_input_tree (ib, data_in);
1959 /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO nor
1960 TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. */
1961 if (!POINTER_TYPE_P (expr))
1962 TYPE_MINVAL (expr) = lto_input_tree (ib, data_in);
1963 TYPE_MAXVAL (expr) = lto_input_tree (ib, data_in);
1964 TYPE_MAIN_VARIANT (expr) = lto_input_tree (ib, data_in);
1965 /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
1967 if (RECORD_OR_UNION_TYPE_P (expr))
1968 TYPE_BINFO (expr) = lto_input_tree (ib, data_in);
1969 TYPE_CONTEXT (expr) = lto_input_tree (ib, data_in);
1970 TYPE_CANONICAL (expr) = lto_input_tree (ib, data_in);
1974 /* Read all pointer fields in the TS_LIST structure of EXPR from input
1975 block IB. DATA_IN contains tables and descriptors for the
1979 lto_input_ts_list_tree_pointers (struct lto_input_block *ib,
1980 struct data_in *data_in, tree expr)
1982 TREE_PURPOSE (expr) = lto_input_tree (ib, data_in);
1983 TREE_VALUE (expr) = lto_input_tree (ib, data_in);
1984 TREE_CHAIN (expr) = lto_input_chain (ib, data_in);
1988 /* Read all pointer fields in the TS_VEC structure of EXPR from input
1989 block IB. DATA_IN contains tables and descriptors for the
1993 lto_input_ts_vec_tree_pointers (struct lto_input_block *ib,
1994 struct data_in *data_in, tree expr)
1998 /* Note that TREE_VEC_LENGTH was read by lto_materialize_tree to
1999 instantiate EXPR. */
2000 for (i = 0; i < TREE_VEC_LENGTH (expr); i++)
2001 TREE_VEC_ELT (expr, i) = lto_input_tree (ib, data_in);
2005 /* Read all pointer fields in the TS_EXP structure of EXPR from input
2006 block IB. DATA_IN contains tables and descriptors for the
2011 lto_input_ts_exp_tree_pointers (struct lto_input_block *ib,
2012 struct data_in *data_in, tree expr)
2017 length = lto_input_sleb128 (ib);
2018 gcc_assert (length == TREE_OPERAND_LENGTH (expr));
2020 for (i = 0; i < length; i++)
2021 TREE_OPERAND (expr, i) = lto_input_tree (ib, data_in);
2023 loc = lto_input_location (ib, data_in);
2024 SET_EXPR_LOCATION (expr, loc);
2025 TREE_BLOCK (expr) = lto_input_tree (ib, data_in);
2029 /* Read all pointer fields in the TS_BLOCK structure of EXPR from input
2030 block IB. DATA_IN contains tables and descriptors for the
2034 lto_input_ts_block_tree_pointers (struct lto_input_block *ib,
2035 struct data_in *data_in, tree expr)
2039 BLOCK_SOURCE_LOCATION (expr) = lto_input_location (ib, data_in);
2040 BLOCK_VARS (expr) = lto_input_chain (ib, data_in);
2042 len = lto_input_uleb128 (ib);
2043 for (i = 0; i < len; i++)
2045 tree t = lto_input_tree (ib, data_in);
2046 VEC_safe_push (tree, gc, BLOCK_NONLOCALIZED_VARS (expr), t);
2049 BLOCK_SUPERCONTEXT (expr) = lto_input_tree (ib, data_in);
2050 BLOCK_ABSTRACT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2051 BLOCK_FRAGMENT_ORIGIN (expr) = lto_input_tree (ib, data_in);
2052 BLOCK_FRAGMENT_CHAIN (expr) = lto_input_tree (ib, data_in);
2053 BLOCK_SUBBLOCKS (expr) = lto_input_chain (ib, data_in);
2057 /* Read all pointer fields in the TS_BINFO structure of EXPR from input
2058 block IB. DATA_IN contains tables and descriptors for the
2062 lto_input_ts_binfo_tree_pointers (struct lto_input_block *ib,
2063 struct data_in *data_in, tree expr)
2068 /* Note that the number of slots in EXPR was read in
2069 lto_materialize_tree when instantiating EXPR. However, the
2070 vector is empty so we cannot rely on VEC_length to know how many
2071 elements to read. So, this list is emitted as a 0-terminated
2072 list on the writer side. */
2075 t = lto_input_tree (ib, data_in);
2077 VEC_quick_push (tree, BINFO_BASE_BINFOS (expr), t);
2081 BINFO_OFFSET (expr) = lto_input_tree (ib, data_in);
2082 BINFO_VTABLE (expr) = lto_input_tree (ib, data_in);
2083 BINFO_VIRTUALS (expr) = lto_input_tree (ib, data_in);
2084 BINFO_VPTR_FIELD (expr) = lto_input_tree (ib, data_in);
2086 len = lto_input_uleb128 (ib);
2087 for (i = 0; i < len; i++)
2089 tree a = lto_input_tree (ib, data_in);
2090 VEC_safe_push (tree, gc, BINFO_BASE_ACCESSES (expr), a);
2093 BINFO_INHERITANCE_CHAIN (expr) = lto_input_tree (ib, data_in);
2094 BINFO_SUBVTT_INDEX (expr) = lto_input_tree (ib, data_in);
2095 BINFO_VPTR_INDEX (expr) = lto_input_tree (ib, data_in);
2099 /* Read all pointer fields in the TS_CONSTRUCTOR structure of EXPR from
2100 input block IB. DATA_IN contains tables and descriptors for the
2104 lto_input_ts_constructor_tree_pointers (struct lto_input_block *ib,
2105 struct data_in *data_in, tree expr)
2109 len = lto_input_uleb128 (ib);
2110 for (i = 0; i < len; i++)
2114 index = lto_input_tree (ib, data_in);
2115 value = lto_input_tree (ib, data_in);
2116 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (expr), index, value);
2121 /* Helper for lto_input_tree. Read all pointer fields in EXPR from
2122 input block IB. DATA_IN contains tables and descriptors for the
2126 lto_input_tree_pointers (struct lto_input_block *ib, struct data_in *data_in,
2129 enum tree_code code;
2131 code = TREE_CODE (expr);
2133 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
2134 lto_input_ts_common_tree_pointers (ib, data_in, expr);
2136 if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
2137 lto_input_ts_vector_tree_pointers (ib, data_in, expr);
2139 if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX))
2140 lto_input_ts_complex_tree_pointers (ib, data_in, expr);
2142 if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
2143 lto_input_ts_decl_minimal_tree_pointers (ib, data_in, expr);
2145 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
2146 lto_input_ts_decl_common_tree_pointers (ib, data_in, expr);
2148 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
2149 lto_input_ts_decl_non_common_tree_pointers (ib, data_in, expr);
2151 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
2152 lto_input_ts_decl_with_vis_tree_pointers (ib, data_in, expr);
2154 if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
2155 lto_input_ts_field_decl_tree_pointers (ib, data_in, expr);
2157 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
2158 lto_input_ts_function_decl_tree_pointers (ib, data_in, expr);
2160 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
2161 lto_input_ts_type_tree_pointers (ib, data_in, expr);
2163 if (CODE_CONTAINS_STRUCT (code, TS_LIST))
2164 lto_input_ts_list_tree_pointers (ib, data_in, expr);
2166 if (CODE_CONTAINS_STRUCT (code, TS_VEC))
2167 lto_input_ts_vec_tree_pointers (ib, data_in, expr);
2169 if (CODE_CONTAINS_STRUCT (code, TS_EXP))
2170 lto_input_ts_exp_tree_pointers (ib, data_in, expr);
2172 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
2174 /* We only stream the version number of SSA names. */
2178 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
2179 lto_input_ts_block_tree_pointers (ib, data_in, expr);
2181 if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
2182 lto_input_ts_binfo_tree_pointers (ib, data_in, expr);
2184 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
2186 /* This should only appear in GENERIC. */
2190 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
2191 lto_input_ts_constructor_tree_pointers (ib, data_in, expr);
2193 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
2195 /* This should only appear in High GIMPLE. */
2199 if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION))
2201 sorry ("optimization options not supported yet");
2204 if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION))
2206 sorry ("target optimization options not supported yet");
2211 /* Register DECL with the global symbol table and change its
2212 name if necessary to avoid name clashes for static globals across
2216 lto_register_var_decl_in_symtab (struct data_in *data_in, tree decl)
2218 /* Register symbols with file or global scope to mark what input
2219 file has their definition. */
2220 if (decl_function_context (decl) == NULL_TREE)
2222 /* Variable has file scope, not local. Need to ensure static variables
2223 between different files don't clash unexpectedly. */
2224 if (!TREE_PUBLIC (decl))
2226 /* ??? We normally pre-mangle names before we serialize them
2227 out. Here, in lto1, we do not know the language, and
2228 thus cannot do the mangling again. Instead, we just
2229 append a suffix to the mangled name. The resulting name,
2230 however, is not a properly-formed mangled name, and will
2231 confuse any attempt to unmangle it. */
2232 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2235 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
2236 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
2237 rest_of_decl_compilation (decl, 1, 0);
2241 /* If this variable has already been declared, queue the
2242 declaration for merging. */
2243 if (TREE_PUBLIC (decl))
2246 if (!lto_streamer_cache_lookup (data_in->reader_cache, decl, &ix))
2248 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
2249 data_in->file_data);
2255 /* Register DECL with the global symbol table and change its
2256 name if necessary to avoid name clashes for static globals across
2257 different files. DATA_IN contains descriptors and tables for the
2261 lto_register_function_decl_in_symtab (struct data_in *data_in, tree decl)
2263 /* Need to ensure static entities between different files
2264 don't clash unexpectedly. */
2265 if (!TREE_PUBLIC (decl))
2267 /* We must not use the DECL_ASSEMBLER_NAME macro here, as it
2268 may set the assembler name where it was previously empty. */
2269 tree old_assembler_name = decl->decl_with_vis.assembler_name;
2271 /* FIXME lto: We normally pre-mangle names before we serialize
2272 them out. Here, in lto1, we do not know the language, and
2273 thus cannot do the mangling again. Instead, we just append a
2274 suffix to the mangled name. The resulting name, however, is
2275 not a properly-formed mangled name, and will confuse any
2276 attempt to unmangle it. */
2277 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2280 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
2281 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
2283 /* We may arrive here with the old assembler name not set
2284 if the function body is not needed, e.g., it has been
2285 inlined away and does not appear in the cgraph. */
2286 if (old_assembler_name)
2288 tree new_assembler_name = DECL_ASSEMBLER_NAME (decl);
2290 /* Make the original assembler name available for later use.
2291 We may have used it to indicate the section within its
2292 object file where the function body may be found.
2293 FIXME lto: Find a better way to maintain the function decl
2294 to body section mapping so we don't need this hack. */
2295 lto_record_renamed_decl (data_in->file_data,
2296 IDENTIFIER_POINTER (old_assembler_name),
2297 IDENTIFIER_POINTER (new_assembler_name));
2299 /* Also register the reverse mapping so that we can find the
2300 new name given to an existing assembler name (used when
2301 restoring alias pairs in input_constructors_or_inits. */
2302 lto_record_renamed_decl (data_in->file_data,
2303 IDENTIFIER_POINTER (new_assembler_name),
2304 IDENTIFIER_POINTER (old_assembler_name));
2308 /* If this variable has already been declared, queue the
2309 declaration for merging. */
2310 if (TREE_PUBLIC (decl) && !DECL_ABSTRACT (decl))
2313 if (!lto_streamer_cache_lookup (data_in->reader_cache, decl, &ix))
2315 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
2316 data_in->file_data);
2321 /* Read an index IX from input block IB and return the tree node at
2322 DATA_IN->FILE_DATA->GLOBALS_INDEX[IX]. */
2325 lto_get_pickled_tree (struct lto_input_block *ib, struct data_in *data_in)
2329 enum LTO_tags expected_tag;
2330 unsigned HOST_WIDE_INT orig_offset;
2332 ix = lto_input_sleb128 (ib);
2333 expected_tag = (enum LTO_tags) lto_input_uleb128 (ib);
2335 orig_offset = lto_input_uleb128 (ib);
2336 gcc_assert (orig_offset == (unsigned) orig_offset);
2338 result = lto_streamer_cache_get (data_in->reader_cache, ix);
2339 if (result == NULL_TREE)
2341 /* We have not yet read the cache slot IX. Go to the offset
2342 in the stream where the physical tree node is, and materialize
2344 struct lto_input_block fwd_ib;
2346 /* If we are trying to go back in the stream, something is wrong.
2347 We should've read the node at the earlier position already. */
2348 if (ib->p >= orig_offset)
2349 internal_error ("bytecode stream: tried to jump backwards in the "
2352 LTO_INIT_INPUT_BLOCK (fwd_ib, ib->data, orig_offset, ib->len);
2353 result = lto_input_tree (&fwd_ib, data_in);
2357 && TREE_CODE (result) == lto_tag_to_tree_code (expected_tag));
2363 /* Read a code and class from input block IB and return the
2364 corresponding builtin. DATA_IN is as in lto_input_tree. */
2367 lto_get_builtin_tree (struct lto_input_block *ib, struct data_in *data_in)
2369 enum built_in_class fclass;
2370 enum built_in_function fcode;
2371 const char *asmname;
2375 fclass = (enum built_in_class) lto_input_uleb128 (ib);
2376 gcc_assert (fclass == BUILT_IN_NORMAL || fclass == BUILT_IN_MD);
2378 fcode = (enum built_in_function) lto_input_uleb128 (ib);
2380 ix = lto_input_sleb128 (ib);
2381 gcc_assert (ix == (int) ix);
2383 if (fclass == BUILT_IN_NORMAL)
2385 gcc_assert (fcode < END_BUILTINS);
2386 result = built_in_decls[fcode];
2387 gcc_assert (result);
2389 else if (fclass == BUILT_IN_MD)
2391 result = targetm.builtin_decl (fcode, true);
2392 if (!result || result == error_mark_node)
2393 fatal_error ("target specific builtin not available");
2396 asmname = input_string (data_in, ib);
2398 set_builtin_user_assembler_name (result, asmname);
2400 lto_streamer_cache_insert_at (data_in->reader_cache, result, ix);
2406 /* Read the physical representation of a tree node with tag TAG from
2407 input block IB using the per-file context in DATA_IN. */
2410 lto_read_tree (struct lto_input_block *ib, struct data_in *data_in,
2417 result = lto_materialize_tree (ib, data_in, tag, &ix);
2419 /* Read all the pointer fields in RESULT. */
2420 lto_input_tree_pointers (ib, data_in, result);
2422 /* We should never try to instantiate an MD or NORMAL builtin here. */
2423 if (TREE_CODE (result) == FUNCTION_DECL)
2424 gcc_assert (!lto_stream_as_builtin_p (result));
2426 if (TREE_CODE (result) == VAR_DECL)
2427 lto_register_var_decl_in_symtab (data_in, result);
2428 else if (TREE_CODE (result) == FUNCTION_DECL && !DECL_BUILT_IN (result))
2429 lto_register_function_decl_in_symtab (data_in, result);
2431 end_marker = lto_input_1_unsigned (ib);
2433 #ifdef LTO_STREAMER_DEBUG
2434 /* Remove the mapping to RESULT's original address set by
2435 lto_materialize_tree. */
2436 lto_orig_address_remove (result);
2443 /* Read and INTEGER_CST node from input block IB using the per-file
2444 context in DATA_IN. */
2447 lto_input_integer_cst (struct lto_input_block *ib, struct data_in *data_in)
2450 HOST_WIDE_INT low, high;
2453 type = lto_input_tree (ib, data_in);
2454 overflow_p = (lto_input_1_unsigned (ib) != 0);
2455 low = lto_input_uleb128 (ib);
2456 high = lto_input_uleb128 (ib);
2457 result = build_int_cst_wide (type, low, high);
2459 /* If the original constant had overflown, build a replica of RESULT to
2460 avoid modifying the shared constant returned by build_int_cst_wide. */
2463 result = copy_node (result);
2464 TREE_OVERFLOW (result) = 1;
2471 /* Read a tree from input block IB using the per-file context in
2472 DATA_IN. This context is used, for example, to resolve references
2473 to previously read nodes. */
2476 lto_input_tree (struct lto_input_block *ib, struct data_in *data_in)
2481 tag = input_record_start (ib);
2482 gcc_assert ((unsigned) tag < (unsigned) LTO_NUM_TAGS);
2484 if (tag == LTO_null)
2486 else if (tag >= LTO_field_decl_ref && tag <= LTO_global_decl_ref)
2488 /* If TAG is a reference to an indexable tree, the next value
2489 in IB is the index into the table where we expect to find
2491 result = lto_input_tree_ref (ib, data_in, cfun, tag);
2493 else if (tag == LTO_tree_pickle_reference)
2495 /* If TAG is a reference to a previously read tree, look it up in
2496 the reader cache. */
2497 result = lto_get_pickled_tree (ib, data_in);
2499 else if (tag == LTO_builtin_decl)
2501 /* If we are going to read a built-in function, all we need is
2502 the code and class. */
2503 result = lto_get_builtin_tree (ib, data_in);
2505 else if (tag == lto_tree_code_to_tag (INTEGER_CST))
2507 /* For integer constants we only need the type and its hi/low
2509 result = lto_input_integer_cst (ib, data_in);
2513 /* Otherwise, materialize a new node from IB. */
2514 result = lto_read_tree (ib, data_in, tag);
2521 /* Initialization for the LTO reader. */
2524 lto_init_reader (void)
2526 lto_streamer_init ();
2528 memset (<o_stats, 0, sizeof (lto_stats));
2529 bitmap_obstack_initialize (NULL);
2531 file_name_hash_table = htab_create (37, hash_string_slot_node,
2532 eq_string_slot_node, free);
2534 gimple_register_cfg_hooks ();
2538 /* Create a new data_in object for FILE_DATA. STRINGS is the string
2539 table to use with LEN strings. RESOLUTIONS is the vector of linker
2540 resolutions (NULL if not using a linker plugin). */
2543 lto_data_in_create (struct lto_file_decl_data *file_data, const char *strings,
2545 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions)
2547 struct data_in *data_in = XCNEW (struct data_in);
2548 data_in->file_data = file_data;
2549 data_in->strings = strings;
2550 data_in->strings_len = len;
2551 data_in->globals_resolution = resolutions;
2552 data_in->reader_cache = lto_streamer_cache_create ();
2558 /* Remove DATA_IN. */
2561 lto_data_in_delete (struct data_in *data_in)
2563 VEC_free (ld_plugin_symbol_resolution_t, heap, data_in->globals_resolution);
2564 lto_streamer_cache_delete (data_in->reader_cache);
2565 free (data_in->labels);