]> git.ipfire.org Git - thirdparty/gcc.git/blob - gcc/lto-streamer-in.c
* data-streamer.h (streamer_write_zero): Rename from output_zero.
[thirdparty/gcc.git] / gcc / lto-streamer-in.c
1 /* Read the GIMPLE representation from a file stream.
2
3 Copyright 2009, 2010 Free Software Foundation, Inc.
4 Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
5 Re-implemented by Diego Novillo <dnovillo@google.com>
6
7 This file is part of GCC.
8
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
12 version.
13
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
17 for more details.
18
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/>. */
22
23 #include "config.h"
24 #include "system.h"
25 #include "coretypes.h"
26 #include "tm.h"
27 #include "toplev.h"
28 #include "tree.h"
29 #include "expr.h"
30 #include "flags.h"
31 #include "params.h"
32 #include "input.h"
33 #include "hashtab.h"
34 #include "basic-block.h"
35 #include "tree-flow.h"
36 #include "tree-pass.h"
37 #include "cgraph.h"
38 #include "function.h"
39 #include "ggc.h"
40 #include "diagnostic.h"
41 #include "libfuncs.h"
42 #include "except.h"
43 #include "debug.h"
44 #include "vec.h"
45 #include "timevar.h"
46 #include "output.h"
47 #include "ipa-utils.h"
48 #include "data-streamer.h"
49 #include "gimple-streamer.h"
50 #include "lto-streamer.h"
51 #include "tree-streamer.h"
52 #include "tree-pass.h"
53
54 /* The table to hold the file names. */
55 static htab_t file_name_hash_table;
56
57
58 /* Check that tag ACTUAL has one of the given values. NUM_TAGS is the
59 number of valid tag values to check. */
60
61 void
62 lto_tag_check_set (enum LTO_tags actual, int ntags, ...)
63 {
64 va_list ap;
65 int i;
66
67 va_start (ap, ntags);
68 for (i = 0; i < ntags; i++)
69 if ((unsigned) actual == va_arg (ap, unsigned))
70 {
71 va_end (ap);
72 return;
73 }
74
75 va_end (ap);
76 internal_error ("bytecode stream: unexpected tag %s", lto_tag_name (actual));
77 }
78
79
80 /* Read LENGTH bytes from STREAM to ADDR. */
81
82 void
83 lto_input_data_block (struct lto_input_block *ib, void *addr, size_t length)
84 {
85 size_t i;
86 unsigned char *const buffer = (unsigned char *const) addr;
87
88 for (i = 0; i < length; i++)
89 buffer[i] = streamer_read_uchar (ib);
90 }
91
92
93 /* Lookup STRING in file_name_hash_table. If found, return the existing
94 string, otherwise insert STRING as the canonical version. */
95
96 static const char *
97 canon_file_name (const char *string)
98 {
99 void **slot;
100 struct string_slot s_slot;
101 s_slot.s = string;
102 s_slot.len = strlen (string);
103
104 slot = htab_find_slot (file_name_hash_table, &s_slot, INSERT);
105 if (*slot == NULL)
106 {
107 size_t len;
108 char *saved_string;
109 struct string_slot *new_slot;
110
111 len = strlen (string);
112 saved_string = (char *) xmalloc (len + 1);
113 new_slot = XCNEW (struct string_slot);
114 strcpy (saved_string, string);
115 new_slot->s = saved_string;
116 *slot = new_slot;
117 return saved_string;
118 }
119 else
120 {
121 struct string_slot *old_slot = (struct string_slot *) *slot;
122 return old_slot->s;
123 }
124 }
125
126
127 /* Clear the line info stored in DATA_IN. */
128
129 static void
130 clear_line_info (struct data_in *data_in)
131 {
132 if (data_in->current_file)
133 linemap_add (line_table, LC_LEAVE, false, NULL, 0);
134 data_in->current_file = NULL;
135 data_in->current_line = 0;
136 data_in->current_col = 0;
137 }
138
139
140 /* Read a location bitpack from input block IB. */
141
142 static location_t
143 lto_input_location_bitpack (struct data_in *data_in, struct bitpack_d *bp)
144 {
145 bool file_change, line_change, column_change;
146 unsigned len;
147 bool prev_file = data_in->current_file != NULL;
148
149 if (bp_unpack_value (bp, 1))
150 return UNKNOWN_LOCATION;
151
152 file_change = bp_unpack_value (bp, 1);
153 if (file_change)
154 data_in->current_file = canon_file_name
155 (string_for_index (data_in,
156 bp_unpack_var_len_unsigned (bp),
157 &len));
158
159 line_change = bp_unpack_value (bp, 1);
160 if (line_change)
161 data_in->current_line = bp_unpack_var_len_unsigned (bp);
162
163 column_change = bp_unpack_value (bp, 1);
164 if (column_change)
165 data_in->current_col = bp_unpack_var_len_unsigned (bp);
166
167 if (file_change)
168 {
169 if (prev_file)
170 linemap_add (line_table, LC_LEAVE, false, NULL, 0);
171
172 linemap_add (line_table, LC_ENTER, false, data_in->current_file,
173 data_in->current_line);
174 }
175 else if (line_change)
176 linemap_line_start (line_table, data_in->current_line, data_in->current_col);
177
178 return linemap_position_for_column (line_table, data_in->current_col);
179 }
180
181
182 /* Read a location from input block IB. */
183
184 location_t
185 lto_input_location (struct lto_input_block *ib, struct data_in *data_in)
186 {
187 struct bitpack_d bp;
188
189 bp = streamer_read_bitpack (ib);
190 return lto_input_location_bitpack (data_in, &bp);
191 }
192
193
194 /* Read a reference to a tree node from DATA_IN using input block IB.
195 TAG is the expected node that should be found in IB, if TAG belongs
196 to one of the indexable trees, expect to read a reference index to
197 be looked up in one of the symbol tables, otherwise read the pysical
198 representation of the tree using stream_read_tree. FN is the
199 function scope for the read tree. */
200
201 tree
202 lto_input_tree_ref (struct lto_input_block *ib, struct data_in *data_in,
203 struct function *fn, enum LTO_tags tag)
204 {
205 unsigned HOST_WIDE_INT ix_u;
206 tree result = NULL_TREE;
207
208 lto_tag_check_range (tag, LTO_field_decl_ref, LTO_global_decl_ref);
209
210 switch (tag)
211 {
212 case LTO_type_ref:
213 ix_u = streamer_read_uhwi (ib);
214 result = lto_file_decl_data_get_type (data_in->file_data, ix_u);
215 break;
216
217 case LTO_ssa_name_ref:
218 ix_u = streamer_read_uhwi (ib);
219 result = VEC_index (tree, SSANAMES (fn), ix_u);
220 break;
221
222 case LTO_field_decl_ref:
223 ix_u = streamer_read_uhwi (ib);
224 result = lto_file_decl_data_get_field_decl (data_in->file_data, ix_u);
225 break;
226
227 case LTO_function_decl_ref:
228 ix_u = streamer_read_uhwi (ib);
229 result = lto_file_decl_data_get_fn_decl (data_in->file_data, ix_u);
230 break;
231
232 case LTO_type_decl_ref:
233 ix_u = streamer_read_uhwi (ib);
234 result = lto_file_decl_data_get_type_decl (data_in->file_data, ix_u);
235 break;
236
237 case LTO_namespace_decl_ref:
238 ix_u = streamer_read_uhwi (ib);
239 result = lto_file_decl_data_get_namespace_decl (data_in->file_data, ix_u);
240 break;
241
242 case LTO_global_decl_ref:
243 case LTO_result_decl_ref:
244 case LTO_const_decl_ref:
245 case LTO_imported_decl_ref:
246 case LTO_label_decl_ref:
247 case LTO_translation_unit_decl_ref:
248 ix_u = streamer_read_uhwi (ib);
249 result = lto_file_decl_data_get_var_decl (data_in->file_data, ix_u);
250 break;
251
252 default:
253 gcc_unreachable ();
254 }
255
256 gcc_assert (result);
257
258 return result;
259 }
260
261
262 /* Read and return a double-linked list of catch handlers from input
263 block IB, using descriptors in DATA_IN. */
264
265 static struct eh_catch_d *
266 lto_input_eh_catch_list (struct lto_input_block *ib, struct data_in *data_in,
267 eh_catch *last_p)
268 {
269 eh_catch first;
270 enum LTO_tags tag;
271
272 *last_p = first = NULL;
273 tag = streamer_read_record_start (ib);
274 while (tag)
275 {
276 tree list;
277 eh_catch n;
278
279 lto_tag_check_range (tag, LTO_eh_catch, LTO_eh_catch);
280
281 /* Read the catch node. */
282 n = ggc_alloc_cleared_eh_catch_d ();
283 n->type_list = stream_read_tree (ib, data_in);
284 n->filter_list = stream_read_tree (ib, data_in);
285 n->label = stream_read_tree (ib, data_in);
286
287 /* Register all the types in N->FILTER_LIST. */
288 for (list = n->filter_list; list; list = TREE_CHAIN (list))
289 add_type_for_runtime (TREE_VALUE (list));
290
291 /* Chain N to the end of the list. */
292 if (*last_p)
293 (*last_p)->next_catch = n;
294 n->prev_catch = *last_p;
295 *last_p = n;
296
297 /* Set the head of the list the first time through the loop. */
298 if (first == NULL)
299 first = n;
300
301 tag = streamer_read_record_start (ib);
302 }
303
304 return first;
305 }
306
307
308 /* Read and return EH region IX from input block IB, using descriptors
309 in DATA_IN. */
310
311 static eh_region
312 input_eh_region (struct lto_input_block *ib, struct data_in *data_in, int ix)
313 {
314 enum LTO_tags tag;
315 eh_region r;
316
317 /* Read the region header. */
318 tag = streamer_read_record_start (ib);
319 if (tag == LTO_null)
320 return NULL;
321
322 r = ggc_alloc_cleared_eh_region_d ();
323 r->index = streamer_read_hwi (ib);
324
325 gcc_assert (r->index == ix);
326
327 /* Read all the region pointers as region numbers. We'll fix up
328 the pointers once the whole array has been read. */
329 r->outer = (eh_region) (intptr_t) streamer_read_hwi (ib);
330 r->inner = (eh_region) (intptr_t) streamer_read_hwi (ib);
331 r->next_peer = (eh_region) (intptr_t) streamer_read_hwi (ib);
332
333 switch (tag)
334 {
335 case LTO_ert_cleanup:
336 r->type = ERT_CLEANUP;
337 break;
338
339 case LTO_ert_try:
340 {
341 struct eh_catch_d *last_catch;
342 r->type = ERT_TRY;
343 r->u.eh_try.first_catch = lto_input_eh_catch_list (ib, data_in,
344 &last_catch);
345 r->u.eh_try.last_catch = last_catch;
346 break;
347 }
348
349 case LTO_ert_allowed_exceptions:
350 {
351 tree l;
352
353 r->type = ERT_ALLOWED_EXCEPTIONS;
354 r->u.allowed.type_list = stream_read_tree (ib, data_in);
355 r->u.allowed.label = stream_read_tree (ib, data_in);
356 r->u.allowed.filter = streamer_read_uhwi (ib);
357
358 for (l = r->u.allowed.type_list; l ; l = TREE_CHAIN (l))
359 add_type_for_runtime (TREE_VALUE (l));
360 }
361 break;
362
363 case LTO_ert_must_not_throw:
364 r->type = ERT_MUST_NOT_THROW;
365 r->u.must_not_throw.failure_decl = stream_read_tree (ib, data_in);
366 r->u.must_not_throw.failure_loc = lto_input_location (ib, data_in);
367 break;
368
369 default:
370 gcc_unreachable ();
371 }
372
373 r->landing_pads = (eh_landing_pad) (intptr_t) streamer_read_hwi (ib);
374
375 return r;
376 }
377
378
379 /* Read and return EH landing pad IX from input block IB, using descriptors
380 in DATA_IN. */
381
382 static eh_landing_pad
383 input_eh_lp (struct lto_input_block *ib, struct data_in *data_in, int ix)
384 {
385 enum LTO_tags tag;
386 eh_landing_pad lp;
387
388 /* Read the landing pad header. */
389 tag = streamer_read_record_start (ib);
390 if (tag == LTO_null)
391 return NULL;
392
393 lto_tag_check_range (tag, LTO_eh_landing_pad, LTO_eh_landing_pad);
394
395 lp = ggc_alloc_cleared_eh_landing_pad_d ();
396 lp->index = streamer_read_hwi (ib);
397 gcc_assert (lp->index == ix);
398 lp->next_lp = (eh_landing_pad) (intptr_t) streamer_read_hwi (ib);
399 lp->region = (eh_region) (intptr_t) streamer_read_hwi (ib);
400 lp->post_landing_pad = stream_read_tree (ib, data_in);
401
402 return lp;
403 }
404
405
406 /* After reading the EH regions, pointers to peer and children regions
407 are region numbers. This converts all these region numbers into
408 real pointers into the rematerialized regions for FN. ROOT_REGION
409 is the region number for the root EH region in FN. */
410
411 static void
412 fixup_eh_region_pointers (struct function *fn, HOST_WIDE_INT root_region)
413 {
414 unsigned i;
415 VEC(eh_region,gc) *eh_array = fn->eh->region_array;
416 VEC(eh_landing_pad,gc) *lp_array = fn->eh->lp_array;
417 eh_region r;
418 eh_landing_pad lp;
419
420 gcc_assert (eh_array && lp_array);
421
422 gcc_assert (root_region >= 0);
423 fn->eh->region_tree = VEC_index (eh_region, eh_array, root_region);
424
425 #define FIXUP_EH_REGION(r) (r) = VEC_index (eh_region, eh_array, \
426 (HOST_WIDE_INT) (intptr_t) (r))
427 #define FIXUP_EH_LP(p) (p) = VEC_index (eh_landing_pad, lp_array, \
428 (HOST_WIDE_INT) (intptr_t) (p))
429
430 /* Convert all the index numbers stored in pointer fields into
431 pointers to the corresponding slots in the EH region array. */
432 FOR_EACH_VEC_ELT (eh_region, eh_array, i, r)
433 {
434 /* The array may contain NULL regions. */
435 if (r == NULL)
436 continue;
437
438 gcc_assert (i == (unsigned) r->index);
439 FIXUP_EH_REGION (r->outer);
440 FIXUP_EH_REGION (r->inner);
441 FIXUP_EH_REGION (r->next_peer);
442 FIXUP_EH_LP (r->landing_pads);
443 }
444
445 /* Convert all the index numbers stored in pointer fields into
446 pointers to the corresponding slots in the EH landing pad array. */
447 FOR_EACH_VEC_ELT (eh_landing_pad, lp_array, i, lp)
448 {
449 /* The array may contain NULL landing pads. */
450 if (lp == NULL)
451 continue;
452
453 gcc_assert (i == (unsigned) lp->index);
454 FIXUP_EH_LP (lp->next_lp);
455 FIXUP_EH_REGION (lp->region);
456 }
457
458 #undef FIXUP_EH_REGION
459 #undef FIXUP_EH_LP
460 }
461
462
463 /* Initialize EH support. */
464
465 void
466 lto_init_eh (void)
467 {
468 static bool eh_initialized_p = false;
469
470 if (eh_initialized_p)
471 return;
472
473 /* Contrary to most other FEs, we only initialize EH support when at
474 least one of the files in the set contains exception regions in
475 it. Since this happens much later than the call to init_eh in
476 lang_dependent_init, we have to set flag_exceptions and call
477 init_eh again to initialize the EH tables. */
478 flag_exceptions = 1;
479 init_eh ();
480
481 eh_initialized_p = true;
482 }
483
484
485 /* Read the exception table for FN from IB using the data descriptors
486 in DATA_IN. */
487
488 static void
489 input_eh_regions (struct lto_input_block *ib, struct data_in *data_in,
490 struct function *fn)
491 {
492 HOST_WIDE_INT i, root_region, len;
493 enum LTO_tags tag;
494
495 tag = streamer_read_record_start (ib);
496 if (tag == LTO_null)
497 return;
498
499 lto_tag_check_range (tag, LTO_eh_table, LTO_eh_table);
500
501 /* If the file contains EH regions, then it was compiled with
502 -fexceptions. In that case, initialize the backend EH
503 machinery. */
504 lto_init_eh ();
505
506 gcc_assert (fn->eh);
507
508 root_region = streamer_read_hwi (ib);
509 gcc_assert (root_region == (int) root_region);
510
511 /* Read the EH region array. */
512 len = streamer_read_hwi (ib);
513 gcc_assert (len == (int) len);
514 if (len > 0)
515 {
516 VEC_safe_grow (eh_region, gc, fn->eh->region_array, len);
517 for (i = 0; i < len; i++)
518 {
519 eh_region r = input_eh_region (ib, data_in, i);
520 VEC_replace (eh_region, fn->eh->region_array, i, r);
521 }
522 }
523
524 /* Read the landing pads. */
525 len = streamer_read_hwi (ib);
526 gcc_assert (len == (int) len);
527 if (len > 0)
528 {
529 VEC_safe_grow (eh_landing_pad, gc, fn->eh->lp_array, len);
530 for (i = 0; i < len; i++)
531 {
532 eh_landing_pad lp = input_eh_lp (ib, data_in, i);
533 VEC_replace (eh_landing_pad, fn->eh->lp_array, i, lp);
534 }
535 }
536
537 /* Read the runtime type data. */
538 len = streamer_read_hwi (ib);
539 gcc_assert (len == (int) len);
540 if (len > 0)
541 {
542 VEC_safe_grow (tree, gc, fn->eh->ttype_data, len);
543 for (i = 0; i < len; i++)
544 {
545 tree ttype = stream_read_tree (ib, data_in);
546 VEC_replace (tree, fn->eh->ttype_data, i, ttype);
547 }
548 }
549
550 /* Read the table of action chains. */
551 len = streamer_read_hwi (ib);
552 gcc_assert (len == (int) len);
553 if (len > 0)
554 {
555 if (targetm.arm_eabi_unwinder)
556 {
557 VEC_safe_grow (tree, gc, fn->eh->ehspec_data.arm_eabi, len);
558 for (i = 0; i < len; i++)
559 {
560 tree t = stream_read_tree (ib, data_in);
561 VEC_replace (tree, fn->eh->ehspec_data.arm_eabi, i, t);
562 }
563 }
564 else
565 {
566 VEC_safe_grow (uchar, gc, fn->eh->ehspec_data.other, len);
567 for (i = 0; i < len; i++)
568 {
569 uchar c = streamer_read_uchar (ib);
570 VEC_replace (uchar, fn->eh->ehspec_data.other, i, c);
571 }
572 }
573 }
574
575 /* Reconstruct the EH region tree by fixing up the peer/children
576 pointers. */
577 fixup_eh_region_pointers (fn, root_region);
578
579 tag = streamer_read_record_start (ib);
580 lto_tag_check_range (tag, LTO_null, LTO_null);
581 }
582
583
584 /* Make a new basic block with index INDEX in function FN. */
585
586 static basic_block
587 make_new_block (struct function *fn, unsigned int index)
588 {
589 basic_block bb = alloc_block ();
590 bb->index = index;
591 SET_BASIC_BLOCK_FOR_FUNCTION (fn, index, bb);
592 bb->il.gimple = ggc_alloc_cleared_gimple_bb_info ();
593 n_basic_blocks_for_function (fn)++;
594 bb->flags = 0;
595 set_bb_seq (bb, gimple_seq_alloc ());
596 return bb;
597 }
598
599
600 /* Read the CFG for function FN from input block IB. */
601
602 static void
603 input_cfg (struct lto_input_block *ib, struct function *fn,
604 int count_materialization_scale)
605 {
606 unsigned int bb_count;
607 basic_block p_bb;
608 unsigned int i;
609 int index;
610
611 init_empty_tree_cfg_for_function (fn);
612 init_ssa_operands ();
613
614 profile_status_for_function (fn) = streamer_read_enum (ib, profile_status_d,
615 PROFILE_LAST);
616
617 bb_count = streamer_read_uhwi (ib);
618
619 last_basic_block_for_function (fn) = bb_count;
620 if (bb_count > VEC_length (basic_block, basic_block_info_for_function (fn)))
621 VEC_safe_grow_cleared (basic_block, gc,
622 basic_block_info_for_function (fn), bb_count);
623
624 if (bb_count > VEC_length (basic_block, label_to_block_map_for_function (fn)))
625 VEC_safe_grow_cleared (basic_block, gc,
626 label_to_block_map_for_function (fn), bb_count);
627
628 index = streamer_read_hwi (ib);
629 while (index != -1)
630 {
631 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
632 unsigned int edge_count;
633
634 if (bb == NULL)
635 bb = make_new_block (fn, index);
636
637 edge_count = streamer_read_uhwi (ib);
638
639 /* Connect up the CFG. */
640 for (i = 0; i < edge_count; i++)
641 {
642 unsigned int dest_index;
643 unsigned int edge_flags;
644 basic_block dest;
645 int probability;
646 gcov_type count;
647 edge e;
648
649 dest_index = streamer_read_uhwi (ib);
650 probability = (int) streamer_read_hwi (ib);
651 count = ((gcov_type) streamer_read_hwi (ib) * count_materialization_scale
652 + REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE;
653 edge_flags = streamer_read_uhwi (ib);
654
655 dest = BASIC_BLOCK_FOR_FUNCTION (fn, dest_index);
656
657 if (dest == NULL)
658 dest = make_new_block (fn, dest_index);
659
660 e = make_edge (bb, dest, edge_flags);
661 e->probability = probability;
662 e->count = count;
663 }
664
665 index = streamer_read_hwi (ib);
666 }
667
668 p_bb = ENTRY_BLOCK_PTR_FOR_FUNCTION(fn);
669 index = streamer_read_hwi (ib);
670 while (index != -1)
671 {
672 basic_block bb = BASIC_BLOCK_FOR_FUNCTION (fn, index);
673 bb->prev_bb = p_bb;
674 p_bb->next_bb = bb;
675 p_bb = bb;
676 index = streamer_read_hwi (ib);
677 }
678 }
679
680
681 /* Read the SSA names array for function FN from DATA_IN using input
682 block IB. */
683
684 static void
685 input_ssa_names (struct lto_input_block *ib, struct data_in *data_in,
686 struct function *fn)
687 {
688 unsigned int i, size;
689
690 size = streamer_read_uhwi (ib);
691 init_ssanames (fn, size);
692
693 i = streamer_read_uhwi (ib);
694 while (i)
695 {
696 tree ssa_name, name;
697 bool is_default_def;
698
699 /* Skip over the elements that had been freed. */
700 while (VEC_length (tree, SSANAMES (fn)) < i)
701 VEC_quick_push (tree, SSANAMES (fn), NULL_TREE);
702
703 is_default_def = (streamer_read_uchar (ib) != 0);
704 name = stream_read_tree (ib, data_in);
705 ssa_name = make_ssa_name_fn (fn, name, gimple_build_nop ());
706
707 if (is_default_def)
708 set_default_def (SSA_NAME_VAR (ssa_name), ssa_name);
709
710 i = streamer_read_uhwi (ib);
711 }
712 }
713
714
715 /* Go through all NODE edges and fixup call_stmt pointers
716 so they point to STMTS. */
717
718 static void
719 fixup_call_stmt_edges_1 (struct cgraph_node *node, gimple *stmts)
720 {
721 struct cgraph_edge *cedge;
722 for (cedge = node->callees; cedge; cedge = cedge->next_callee)
723 cedge->call_stmt = stmts[cedge->lto_stmt_uid];
724 for (cedge = node->indirect_calls; cedge; cedge = cedge->next_callee)
725 cedge->call_stmt = stmts[cedge->lto_stmt_uid];
726 }
727
728 /* Fixup call_stmt pointers in NODE and all clones. */
729
730 static void
731 fixup_call_stmt_edges (struct cgraph_node *orig, gimple *stmts)
732 {
733 struct cgraph_node *node;
734
735 while (orig->clone_of)
736 orig = orig->clone_of;
737
738 fixup_call_stmt_edges_1 (orig, stmts);
739 if (orig->clones)
740 for (node = orig->clones; node != orig;)
741 {
742 fixup_call_stmt_edges_1 (node, stmts);
743 if (node->clones)
744 node = node->clones;
745 else if (node->next_sibling_clone)
746 node = node->next_sibling_clone;
747 else
748 {
749 while (node != orig && !node->next_sibling_clone)
750 node = node->clone_of;
751 if (node != orig)
752 node = node->next_sibling_clone;
753 }
754 }
755 }
756
757 /* Read the body of function FN_DECL from DATA_IN using input block IB. */
758
759 static void
760 input_function (tree fn_decl, struct data_in *data_in,
761 struct lto_input_block *ib)
762 {
763 struct function *fn;
764 enum LTO_tags tag;
765 gimple *stmts;
766 basic_block bb;
767 struct bitpack_d bp;
768 struct cgraph_node *node;
769 tree args, narg, oarg;
770 int len;
771
772 fn = DECL_STRUCT_FUNCTION (fn_decl);
773 tag = streamer_read_record_start (ib);
774 clear_line_info (data_in);
775
776 gimple_register_cfg_hooks ();
777 lto_tag_check (tag, LTO_function);
778
779 /* Read all the attributes for FN. */
780 bp = streamer_read_bitpack (ib);
781 fn->is_thunk = bp_unpack_value (&bp, 1);
782 fn->has_local_explicit_reg_vars = bp_unpack_value (&bp, 1);
783 fn->after_tree_profile = bp_unpack_value (&bp, 1);
784 fn->returns_pcc_struct = bp_unpack_value (&bp, 1);
785 fn->returns_struct = bp_unpack_value (&bp, 1);
786 fn->can_throw_non_call_exceptions = bp_unpack_value (&bp, 1);
787 fn->always_inline_functions_inlined = bp_unpack_value (&bp, 1);
788 fn->after_inlining = bp_unpack_value (&bp, 1);
789 fn->stdarg = bp_unpack_value (&bp, 1);
790 fn->has_nonlocal_label = bp_unpack_value (&bp, 1);
791 fn->calls_alloca = bp_unpack_value (&bp, 1);
792 fn->calls_setjmp = bp_unpack_value (&bp, 1);
793 fn->va_list_fpr_size = bp_unpack_value (&bp, 8);
794 fn->va_list_gpr_size = bp_unpack_value (&bp, 8);
795
796 /* Input the function start and end loci. */
797 fn->function_start_locus = lto_input_location (ib, data_in);
798 fn->function_end_locus = lto_input_location (ib, data_in);
799
800 /* Input the current IL state of the function. */
801 fn->curr_properties = streamer_read_uhwi (ib);
802
803 /* Read the static chain and non-local goto save area. */
804 fn->static_chain_decl = stream_read_tree (ib, data_in);
805 fn->nonlocal_goto_save_area = stream_read_tree (ib, data_in);
806
807 /* Read all the local symbols. */
808 len = streamer_read_hwi (ib);
809 if (len > 0)
810 {
811 int i;
812 VEC_safe_grow (tree, gc, fn->local_decls, len);
813 for (i = 0; i < len; i++)
814 {
815 tree t = stream_read_tree (ib, data_in);
816 VEC_replace (tree, fn->local_decls, i, t);
817 }
818 }
819
820 /* Read all function arguments. We need to re-map them here to the
821 arguments of the merged function declaration. */
822 args = stream_read_tree (ib, data_in);
823 for (oarg = args, narg = DECL_ARGUMENTS (fn_decl);
824 oarg && narg;
825 oarg = TREE_CHAIN (oarg), narg = TREE_CHAIN (narg))
826 {
827 unsigned ix;
828 bool res;
829 res = streamer_tree_cache_lookup (data_in->reader_cache, oarg, &ix);
830 gcc_assert (res);
831 /* Replace the argument in the streamer cache. */
832 streamer_tree_cache_insert_at (data_in->reader_cache, narg, ix);
833 }
834 gcc_assert (!oarg && !narg);
835
836 /* Read all the SSA names. */
837 input_ssa_names (ib, data_in, fn);
838
839 /* Read the exception handling regions in the function. */
840 input_eh_regions (ib, data_in, fn);
841
842 /* Read the tree of lexical scopes for the function. */
843 DECL_INITIAL (fn_decl) = stream_read_tree (ib, data_in);
844 gcc_assert (DECL_INITIAL (fn_decl));
845 DECL_SAVED_TREE (fn_decl) = NULL_TREE;
846 node = cgraph_get_create_node (fn_decl);
847
848 /* Read all the basic blocks. */
849 tag = streamer_read_record_start (ib);
850 while (tag)
851 {
852 input_bb (ib, tag, data_in, fn,
853 node->count_materialization_scale);
854 tag = streamer_read_record_start (ib);
855 }
856
857 /* Fix up the call statements that are mentioned in the callgraph
858 edges. */
859 set_gimple_stmt_max_uid (cfun, 0);
860 FOR_ALL_BB (bb)
861 {
862 gimple_stmt_iterator gsi;
863 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
864 {
865 gimple stmt = gsi_stmt (gsi);
866 gimple_set_uid (stmt, inc_gimple_stmt_max_uid (cfun));
867 }
868 }
869 stmts = (gimple *) xcalloc (gimple_stmt_max_uid (fn), sizeof (gimple));
870 FOR_ALL_BB (bb)
871 {
872 gimple_stmt_iterator bsi = gsi_start_bb (bb);
873 while (!gsi_end_p (bsi))
874 {
875 gimple stmt = gsi_stmt (bsi);
876 /* If we're recompiling LTO objects with debug stmts but
877 we're not supposed to have debug stmts, remove them now.
878 We can't remove them earlier because this would cause uid
879 mismatches in fixups, but we can do it at this point, as
880 long as debug stmts don't require fixups. */
881 if (!MAY_HAVE_DEBUG_STMTS && is_gimple_debug (stmt))
882 {
883 gimple_stmt_iterator gsi = bsi;
884 gsi_next (&bsi);
885 gsi_remove (&gsi, true);
886 }
887 else
888 {
889 gsi_next (&bsi);
890 stmts[gimple_uid (stmt)] = stmt;
891 }
892 }
893 }
894
895 /* Set the gimple body to the statement sequence in the entry
896 basic block. FIXME lto, this is fairly hacky. The existence
897 of a gimple body is used by the cgraph routines, but we should
898 really use the presence of the CFG. */
899 {
900 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs);
901 gimple_set_body (fn_decl, bb_seq (ei_edge (ei)->dest));
902 }
903
904 fixup_call_stmt_edges (node, stmts);
905 execute_all_ipa_stmt_fixups (node, stmts);
906
907 update_ssa (TODO_update_ssa_only_virtuals);
908 free_dominance_info (CDI_DOMINATORS);
909 free_dominance_info (CDI_POST_DOMINATORS);
910 free (stmts);
911 }
912
913
914 /* Read initializer expressions for public statics. DATA_IN is the
915 file being read. IB is the input block used for reading. */
916
917 static void
918 input_alias_pairs (struct lto_input_block *ib, struct data_in *data_in)
919 {
920 tree var;
921
922 clear_line_info (data_in);
923
924 var = stream_read_tree (ib, data_in);
925 while (var)
926 {
927 const char *orig_name, *new_name;
928 alias_pair *p;
929
930 p = VEC_safe_push (alias_pair, gc, alias_pairs, NULL);
931 p->decl = var;
932 p->target = stream_read_tree (ib, data_in);
933
934 /* If the target is a static object, we may have registered a
935 new name for it to avoid clashes between statics coming from
936 different files. In that case, use the new name. */
937 orig_name = IDENTIFIER_POINTER (p->target);
938 new_name = lto_get_decl_name_mapping (data_in->file_data, orig_name);
939 if (strcmp (orig_name, new_name) != 0)
940 p->target = get_identifier (new_name);
941
942 var = stream_read_tree (ib, data_in);
943 }
944 }
945
946
947 /* Read the body from DATA for function FN_DECL and fill it in.
948 FILE_DATA are the global decls and types. SECTION_TYPE is either
949 LTO_section_function_body or LTO_section_static_initializer. If
950 section type is LTO_section_function_body, FN must be the decl for
951 that function. */
952
953 static void
954 lto_read_body (struct lto_file_decl_data *file_data, tree fn_decl,
955 const char *data, enum lto_section_type section_type)
956 {
957 const struct lto_function_header *header;
958 struct data_in *data_in;
959 int32_t cfg_offset;
960 int32_t main_offset;
961 int32_t string_offset;
962 struct lto_input_block ib_cfg;
963 struct lto_input_block ib_main;
964
965 header = (const struct lto_function_header *) data;
966 cfg_offset = sizeof (struct lto_function_header);
967 main_offset = cfg_offset + header->cfg_size;
968 string_offset = main_offset + header->main_size;
969
970 LTO_INIT_INPUT_BLOCK (ib_cfg,
971 data + cfg_offset,
972 0,
973 header->cfg_size);
974
975 LTO_INIT_INPUT_BLOCK (ib_main,
976 data + main_offset,
977 0,
978 header->main_size);
979
980 data_in = lto_data_in_create (file_data, data + string_offset,
981 header->string_size, NULL);
982
983 /* Make sure the file was generated by the exact same compiler. */
984 lto_check_version (header->lto_header.major_version,
985 header->lto_header.minor_version);
986
987 if (section_type == LTO_section_function_body)
988 {
989 struct function *fn = DECL_STRUCT_FUNCTION (fn_decl);
990 struct lto_in_decl_state *decl_state;
991 struct cgraph_node *node = cgraph_get_node (fn_decl);
992
993 gcc_checking_assert (node);
994 push_cfun (fn);
995 init_tree_ssa (fn);
996
997 /* Use the function's decl state. */
998 decl_state = lto_get_function_in_decl_state (file_data, fn_decl);
999 gcc_assert (decl_state);
1000 file_data->current_decl_state = decl_state;
1001
1002 input_cfg (&ib_cfg, fn, node->count_materialization_scale);
1003
1004 /* Set up the struct function. */
1005 input_function (fn_decl, data_in, &ib_main);
1006
1007 /* We should now be in SSA. */
1008 cfun->gimple_df->in_ssa_p = true;
1009
1010 /* Restore decl state */
1011 file_data->current_decl_state = file_data->global_decl_state;
1012
1013 pop_cfun ();
1014 }
1015 else
1016 {
1017 input_alias_pairs (&ib_main, data_in);
1018 }
1019
1020 clear_line_info (data_in);
1021 lto_data_in_delete (data_in);
1022 }
1023
1024
1025 /* Read the body of FN_DECL using DATA. FILE_DATA holds the global
1026 decls and types. */
1027
1028 void
1029 lto_input_function_body (struct lto_file_decl_data *file_data,
1030 tree fn_decl, const char *data)
1031 {
1032 current_function_decl = fn_decl;
1033 lto_read_body (file_data, fn_decl, data, LTO_section_function_body);
1034 }
1035
1036
1037 /* Read in VAR_DECL using DATA. FILE_DATA holds the global decls and
1038 types. */
1039
1040 void
1041 lto_input_constructors_and_inits (struct lto_file_decl_data *file_data,
1042 const char *data)
1043 {
1044 lto_read_body (file_data, NULL, data, LTO_section_static_initializer);
1045 }
1046
1047
1048 /* Read the physical representation of a tree node with tag TAG from
1049 input block IB using the per-file context in DATA_IN. */
1050
1051 static tree
1052 lto_read_tree (struct lto_input_block *ib, struct data_in *data_in,
1053 enum LTO_tags tag)
1054 {
1055 /* Instantiate a new tree node. */
1056 tree result = streamer_alloc_tree (ib, data_in, tag);
1057
1058 /* Enter RESULT in the reader cache. This will make RESULT
1059 available so that circular references in the rest of the tree
1060 structure can be resolved in subsequent calls to stream_read_tree. */
1061 streamer_tree_cache_append (data_in->reader_cache, result);
1062
1063 /* Read all the bitfield values in RESULT. Note that for LTO, we
1064 only write language-independent bitfields, so no more unpacking is
1065 needed. */
1066 streamer_read_tree_bitfields (ib, result);
1067
1068 /* Read all the pointer fields in RESULT. */
1069 streamer_read_tree_body (ib, data_in, result);
1070
1071 /* Read any LTO-specific data not read by the tree streamer. */
1072 if (DECL_P (result)
1073 && TREE_CODE (result) != FUNCTION_DECL
1074 && TREE_CODE (result) != TRANSLATION_UNIT_DECL)
1075 DECL_INITIAL (result) = stream_read_tree (ib, data_in);
1076
1077 /* We should never try to instantiate an MD or NORMAL builtin here. */
1078 if (TREE_CODE (result) == FUNCTION_DECL)
1079 gcc_assert (!streamer_handle_as_builtin_p (result));
1080
1081 /* end_marker = */ streamer_read_uchar (ib);
1082
1083 #ifdef LTO_STREAMER_DEBUG
1084 /* Remove the mapping to RESULT's original address set by
1085 streamer_alloc_tree. */
1086 lto_orig_address_remove (result);
1087 #endif
1088
1089 return result;
1090 }
1091
1092
1093 /* Read a tree from input block IB using the per-file context in
1094 DATA_IN. This context is used, for example, to resolve references
1095 to previously read nodes. */
1096
1097 tree
1098 lto_input_tree (struct lto_input_block *ib, struct data_in *data_in)
1099 {
1100 enum LTO_tags tag;
1101 tree result;
1102
1103 tag = streamer_read_record_start (ib);
1104 gcc_assert ((unsigned) tag < (unsigned) LTO_NUM_TAGS);
1105
1106 if (tag == LTO_null)
1107 result = NULL_TREE;
1108 else if (tag >= LTO_field_decl_ref && tag <= LTO_global_decl_ref)
1109 {
1110 /* If TAG is a reference to an indexable tree, the next value
1111 in IB is the index into the table where we expect to find
1112 that tree. */
1113 result = lto_input_tree_ref (ib, data_in, cfun, tag);
1114 }
1115 else if (tag == LTO_tree_pickle_reference)
1116 {
1117 /* If TAG is a reference to a previously read tree, look it up in
1118 the reader cache. */
1119 result = streamer_get_pickled_tree (ib, data_in);
1120 }
1121 else if (tag == LTO_builtin_decl)
1122 {
1123 /* If we are going to read a built-in function, all we need is
1124 the code and class. */
1125 result = streamer_get_builtin_tree (ib, data_in);
1126 }
1127 else if (tag == lto_tree_code_to_tag (INTEGER_CST))
1128 {
1129 /* For integer constants we only need the type and its hi/low
1130 words. */
1131 result = streamer_read_integer_cst (ib, data_in);
1132 }
1133 else
1134 {
1135 /* Otherwise, materialize a new node from IB. */
1136 result = lto_read_tree (ib, data_in, tag);
1137 }
1138
1139 return result;
1140 }
1141
1142
1143 /* Initialization for the LTO reader. */
1144
1145 void
1146 lto_reader_init (void)
1147 {
1148 lto_streamer_init ();
1149 file_name_hash_table = htab_create (37, hash_string_slot_node,
1150 eq_string_slot_node, free);
1151 }
1152
1153
1154 /* Create a new data_in object for FILE_DATA. STRINGS is the string
1155 table to use with LEN strings. RESOLUTIONS is the vector of linker
1156 resolutions (NULL if not using a linker plugin). */
1157
1158 struct data_in *
1159 lto_data_in_create (struct lto_file_decl_data *file_data, const char *strings,
1160 unsigned len,
1161 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions)
1162 {
1163 struct data_in *data_in = XCNEW (struct data_in);
1164 data_in->file_data = file_data;
1165 data_in->strings = strings;
1166 data_in->strings_len = len;
1167 data_in->globals_resolution = resolutions;
1168 data_in->reader_cache = streamer_tree_cache_create ();
1169
1170 return data_in;
1171 }
1172
1173
1174 /* Remove DATA_IN. */
1175
1176 void
1177 lto_data_in_delete (struct data_in *data_in)
1178 {
1179 VEC_free (ld_plugin_symbol_resolution_t, heap, data_in->globals_resolution);
1180 streamer_tree_cache_delete (data_in->reader_cache);
1181 free (data_in->labels);
1182 free (data_in);
1183 }