1 /* Write and read the cgraph to the memory mapped representation of a
4 Copyright (C) 2009-2013 Free Software Foundation, Inc.
5 Contributed by Kenneth Zadeck <zadeck@naturalbridge.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"
33 #include "langhooks.h"
34 #include "basic-block.h"
35 #include "tree-flow.h"
39 #include "diagnostic-core.h"
43 #include "pointer-set.h"
44 #include "lto-streamer.h"
45 #include "data-streamer.h"
46 #include "tree-streamer.h"
48 #include "tree-pass.h"
51 #include "pass_manager.h"
53 static void output_cgraph_opt_summary (void);
54 static void input_cgraph_opt_summary (vec
<symtab_node
> nodes
);
56 /* Number of LDPR values known to GCC. */
57 #define LDPR_NUM_KNOWN (LDPR_PREVAILING_DEF_IRONLY_EXP + 1)
59 /* All node orders are ofsetted by ORDER_BASE. */
60 static int order_base
;
62 /* Cgraph streaming is organized as set of record whose type
63 is indicated by a tag. */
66 /* Must leave 0 for the stopper. */
68 /* Cgraph node without body available. */
69 LTO_symtab_unavail_node
= 1,
70 /* Cgraph node with function body. */
71 LTO_symtab_analyzed_node
,
74 LTO_symtab_indirect_edge
,
79 /* Create a new symtab encoder.
80 if FOR_INPUT, the encoder allocate only datastructures needed
81 to read the symtab. */
84 lto_symtab_encoder_new (bool for_input
)
86 lto_symtab_encoder_t encoder
= XCNEW (struct lto_symtab_encoder_d
);
89 encoder
->map
= pointer_map_create ();
90 encoder
->nodes
.create (0);
95 /* Delete ENCODER and its components. */
98 lto_symtab_encoder_delete (lto_symtab_encoder_t encoder
)
100 encoder
->nodes
.release ();
102 pointer_map_destroy (encoder
->map
);
107 /* Return the existing reference number of NODE in the symtab encoder in
108 output block OB. Assign a new reference if this is the first time
112 lto_symtab_encoder_encode (lto_symtab_encoder_t encoder
,
120 lto_encoder_entry entry
= {node
, false, false, false};
122 ref
= encoder
->nodes
.length ();
123 encoder
->nodes
.safe_push (entry
);
127 slot
= pointer_map_contains (encoder
->map
, node
);
130 lto_encoder_entry entry
= {node
, false, false, false};
131 ref
= encoder
->nodes
.length ();
133 slot
= pointer_map_insert (encoder
->map
, node
);
134 *slot
= (void *) (intptr_t) (ref
+ 1);
135 encoder
->nodes
.safe_push (entry
);
138 ref
= (size_t) *slot
- 1;
143 /* Remove NODE from encoder. */
146 lto_symtab_encoder_delete_node (lto_symtab_encoder_t encoder
,
149 void **slot
, **last_slot
;
151 lto_encoder_entry last_node
;
153 slot
= pointer_map_contains (encoder
->map
, node
);
154 if (slot
== NULL
|| !*slot
)
157 index
= (size_t) *slot
- 1;
158 gcc_checking_assert (encoder
->nodes
[index
].node
== node
);
160 /* Remove from vector. We do this by swapping node with the last element
162 last_node
= encoder
->nodes
.pop ();
163 if (last_node
.node
!= node
)
165 last_slot
= pointer_map_contains (encoder
->map
, last_node
.node
);
166 gcc_checking_assert (last_slot
&& *last_slot
);
167 *last_slot
= (void *)(size_t) (index
+ 1);
169 /* Move the last element to the original spot of NODE. */
170 encoder
->nodes
[index
] = last_node
;
173 /* Remove element from hash table. */
179 /* Return TRUE if we should encode initializer of NODE (if any). */
182 lto_symtab_encoder_encode_body_p (lto_symtab_encoder_t encoder
,
183 struct cgraph_node
*node
)
185 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
186 return encoder
->nodes
[index
].body
;
189 /* Return TRUE if we should encode body of NODE (if any). */
192 lto_set_symtab_encoder_encode_body (lto_symtab_encoder_t encoder
,
193 struct cgraph_node
*node
)
195 int index
= lto_symtab_encoder_encode (encoder
, (symtab_node
)node
);
196 gcc_checking_assert (encoder
->nodes
[index
].node
== (symtab_node
)node
);
197 encoder
->nodes
[index
].body
= true;
200 /* Return TRUE if we should encode initializer of NODE (if any). */
203 lto_symtab_encoder_encode_initializer_p (lto_symtab_encoder_t encoder
,
204 struct varpool_node
*node
)
206 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
207 if (index
== LCC_NOT_FOUND
)
209 return encoder
->nodes
[index
].initializer
;
212 /* Return TRUE if we should encode initializer of NODE (if any). */
215 lto_set_symtab_encoder_encode_initializer (lto_symtab_encoder_t encoder
,
216 struct varpool_node
*node
)
218 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
219 encoder
->nodes
[index
].initializer
= true;
222 /* Return TRUE if we should encode initializer of NODE (if any). */
225 lto_symtab_encoder_in_partition_p (lto_symtab_encoder_t encoder
,
228 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
229 if (index
== LCC_NOT_FOUND
)
231 return encoder
->nodes
[index
].in_partition
;
234 /* Return TRUE if we should encode body of NODE (if any). */
237 lto_set_symtab_encoder_in_partition (lto_symtab_encoder_t encoder
,
240 int index
= lto_symtab_encoder_encode (encoder
, (symtab_node
)node
);
241 encoder
->nodes
[index
].in_partition
= true;
244 /* Output the cgraph EDGE to OB using ENCODER. */
247 lto_output_edge (struct lto_simple_output_block
*ob
, struct cgraph_edge
*edge
,
248 lto_symtab_encoder_t encoder
)
254 if (edge
->indirect_unknown_callee
)
255 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
256 LTO_symtab_indirect_edge
);
258 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
261 ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)edge
->caller
);
262 gcc_assert (ref
!= LCC_NOT_FOUND
);
263 streamer_write_hwi_stream (ob
->main_stream
, ref
);
265 if (!edge
->indirect_unknown_callee
)
267 ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)edge
->callee
);
268 gcc_assert (ref
!= LCC_NOT_FOUND
);
269 streamer_write_hwi_stream (ob
->main_stream
, ref
);
272 streamer_write_gcov_count_stream (ob
->main_stream
, edge
->count
);
274 bp
= bitpack_create (ob
->main_stream
);
275 uid
= (!gimple_has_body_p (edge
->caller
->symbol
.decl
)
276 ? edge
->lto_stmt_uid
: gimple_uid (edge
->call_stmt
));
277 bp_pack_enum (&bp
, cgraph_inline_failed_enum
,
278 CIF_N_REASONS
, edge
->inline_failed
);
279 bp_pack_var_len_unsigned (&bp
, uid
);
280 bp_pack_var_len_unsigned (&bp
, edge
->frequency
);
281 bp_pack_value (&bp
, edge
->indirect_inlining_edge
, 1);
282 bp_pack_value (&bp
, edge
->call_stmt_cannot_inline_p
, 1);
283 bp_pack_value (&bp
, edge
->can_throw_external
, 1);
284 if (edge
->indirect_unknown_callee
)
286 int flags
= edge
->indirect_info
->ecf_flags
;
287 bp_pack_value (&bp
, (flags
& ECF_CONST
) != 0, 1);
288 bp_pack_value (&bp
, (flags
& ECF_PURE
) != 0, 1);
289 bp_pack_value (&bp
, (flags
& ECF_NORETURN
) != 0, 1);
290 bp_pack_value (&bp
, (flags
& ECF_MALLOC
) != 0, 1);
291 bp_pack_value (&bp
, (flags
& ECF_NOTHROW
) != 0, 1);
292 bp_pack_value (&bp
, (flags
& ECF_RETURNS_TWICE
) != 0, 1);
293 /* Flags that should not appear on indirect calls. */
294 gcc_assert (!(flags
& (ECF_LOOPING_CONST_OR_PURE
300 streamer_write_bitpack (&bp
);
303 /* Return if LIST contain references from other partitions. */
306 referenced_from_other_partition_p (struct ipa_ref_list
*list
, lto_symtab_encoder_t encoder
)
310 for (i
= 0; ipa_ref_list_referring_iterate (list
, i
, ref
); i
++)
312 if (ref
->referring
->symbol
.in_other_partition
313 || !lto_symtab_encoder_in_partition_p (encoder
, ref
->referring
))
319 /* Return true when node is reachable from other partition. */
322 reachable_from_other_partition_p (struct cgraph_node
*node
, lto_symtab_encoder_t encoder
)
324 struct cgraph_edge
*e
;
325 if (!node
->symbol
.definition
)
327 if (node
->global
.inlined_to
)
329 for (e
= node
->callers
; e
; e
= e
->next_caller
)
330 if (e
->caller
->symbol
.in_other_partition
331 || !lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)e
->caller
))
336 /* Return if LIST contain references from other partitions. */
339 referenced_from_this_partition_p (struct ipa_ref_list
*list
,
340 lto_symtab_encoder_t encoder
)
344 for (i
= 0; ipa_ref_list_referring_iterate (list
, i
, ref
); i
++)
345 if (lto_symtab_encoder_in_partition_p (encoder
, ref
->referring
))
350 /* Return true when node is reachable from other partition. */
353 reachable_from_this_partition_p (struct cgraph_node
*node
, lto_symtab_encoder_t encoder
)
355 struct cgraph_edge
*e
;
356 for (e
= node
->callers
; e
; e
= e
->next_caller
)
357 if (lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)e
->caller
))
362 /* Output the cgraph NODE to OB. ENCODER is used to find the
363 reference number of NODE->inlined_to. SET is the set of nodes we
364 are writing to the current file. If NODE is not in SET, then NODE
365 is a boundary of a cgraph_node_set and we pretend NODE just has a
366 decl and no callees. WRITTEN_DECLS is the set of FUNCTION_DECLs
367 that have had their callgraph node written so far. This is used to
368 determine if NODE is a clone of a previously written node. */
371 lto_output_node (struct lto_simple_output_block
*ob
, struct cgraph_node
*node
,
372 lto_symtab_encoder_t encoder
)
378 bool in_other_partition
= false;
379 struct cgraph_node
*clone_of
;
380 struct ipa_opt_pass_d
*pass
;
384 boundary_p
= !lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)node
);
386 if (node
->symbol
.analyzed
&& !boundary_p
)
387 tag
= LTO_symtab_analyzed_node
;
389 tag
= LTO_symtab_unavail_node
;
391 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
393 streamer_write_hwi_stream (ob
->main_stream
, node
->symbol
.order
);
395 /* In WPA mode, we only output part of the call-graph. Also, we
396 fake cgraph node attributes. There are two cases that we care.
398 Boundary nodes: There are nodes that are not part of SET but are
399 called from within SET. We artificially make them look like
400 externally visible nodes with no function body.
402 Cherry-picked nodes: These are nodes we pulled from other
403 translation units into SET during IPA-inlining. We make them as
404 local static nodes to prevent clashes with other local statics. */
405 if (boundary_p
&& node
->symbol
.analyzed
&& !DECL_EXTERNAL (node
->symbol
.decl
))
407 /* Inline clones can not be part of boundary.
408 gcc_assert (!node->global.inlined_to);
410 FIXME: At the moment they can be, when partition contains an inline
411 clone that is clone of inline clone from outside partition. We can
412 reshape the clone tree and make other tree to be the root, but it
413 needs a bit extra work and will be promplty done by cgraph_remove_node
414 after reading back. */
415 in_other_partition
= 1;
418 clone_of
= node
->clone_of
;
420 && (ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)clone_of
)) == LCC_NOT_FOUND
)
421 if (clone_of
->prev_sibling_clone
)
422 clone_of
= clone_of
->prev_sibling_clone
;
424 clone_of
= clone_of
->clone_of
;
426 if (LTO_symtab_analyzed_node
)
427 gcc_assert (clone_of
|| !node
->clone_of
);
429 streamer_write_hwi_stream (ob
->main_stream
, LCC_NOT_FOUND
);
431 streamer_write_hwi_stream (ob
->main_stream
, ref
);
434 lto_output_fn_decl_index (ob
->decl_state
, ob
->main_stream
, node
->symbol
.decl
);
435 streamer_write_gcov_count_stream (ob
->main_stream
, node
->count
);
436 streamer_write_hwi_stream (ob
->main_stream
, node
->count_materialization_scale
);
438 streamer_write_hwi_stream (ob
->main_stream
,
439 node
->ipa_transforms_to_apply
.length ());
440 FOR_EACH_VEC_ELT (node
->ipa_transforms_to_apply
, i
, pass
)
441 streamer_write_hwi_stream (ob
->main_stream
, pass
->pass
.static_pass_number
);
443 if (tag
== LTO_symtab_analyzed_node
)
445 if (node
->global
.inlined_to
)
447 ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
->global
.inlined_to
);
448 gcc_assert (ref
!= LCC_NOT_FOUND
);
453 streamer_write_hwi_stream (ob
->main_stream
, ref
);
456 if (node
->symbol
.same_comdat_group
&& !boundary_p
)
458 ref
= lto_symtab_encoder_lookup (encoder
,
459 node
->symbol
.same_comdat_group
);
460 gcc_assert (ref
!= LCC_NOT_FOUND
);
464 streamer_write_hwi_stream (ob
->main_stream
, ref
);
466 bp
= bitpack_create (ob
->main_stream
);
467 bp_pack_value (&bp
, node
->local
.local
, 1);
468 bp_pack_value (&bp
, node
->symbol
.externally_visible
, 1);
469 bp_pack_value (&bp
, node
->symbol
.definition
, 1);
470 bp_pack_value (&bp
, node
->local
.versionable
, 1);
471 bp_pack_value (&bp
, node
->local
.can_change_signature
, 1);
472 bp_pack_value (&bp
, node
->local
.redefined_extern_inline
, 1);
473 bp_pack_value (&bp
, node
->symbol
.force_output
, 1);
474 bp_pack_value (&bp
, node
->symbol
.forced_by_abi
, 1);
475 bp_pack_value (&bp
, node
->symbol
.unique_name
, 1);
476 bp_pack_value (&bp
, node
->symbol
.address_taken
, 1);
477 bp_pack_value (&bp
, tag
== LTO_symtab_analyzed_node
478 && !DECL_EXTERNAL (node
->symbol
.decl
)
479 && !DECL_COMDAT (node
->symbol
.decl
)
480 && (reachable_from_other_partition_p (node
, encoder
)
481 || referenced_from_other_partition_p (&node
->symbol
.ref_list
,
483 bp_pack_value (&bp
, node
->lowered
, 1);
484 bp_pack_value (&bp
, in_other_partition
, 1);
485 /* Real aliases in a boundary become non-aliases. However we still stream
486 alias info on weakrefs.
487 TODO: We lose a bit of information here - when we know that variable is
488 defined in other unit, we may use the info on aliases to resolve
489 symbol1 != symbol2 type tests that we can do only for locally defined objects
491 alias_p
= node
->symbol
.alias
&& (!boundary_p
|| node
->symbol
.weakref
);
492 bp_pack_value (&bp
, alias_p
, 1);
493 bp_pack_value (&bp
, node
->symbol
.weakref
, 1);
494 bp_pack_value (&bp
, node
->frequency
, 2);
495 bp_pack_value (&bp
, node
->only_called_at_startup
, 1);
496 bp_pack_value (&bp
, node
->only_called_at_exit
, 1);
497 bp_pack_value (&bp
, node
->tm_clone
, 1);
498 bp_pack_value (&bp
, node
->thunk
.thunk_p
&& !boundary_p
, 1);
499 bp_pack_enum (&bp
, ld_plugin_symbol_resolution
,
500 LDPR_NUM_KNOWN
, node
->symbol
.resolution
);
501 streamer_write_bitpack (&bp
);
503 if (node
->thunk
.thunk_p
&& !boundary_p
)
505 streamer_write_uhwi_stream
507 1 + (node
->thunk
.this_adjusting
!= 0) * 2
508 + (node
->thunk
.virtual_offset_p
!= 0) * 4);
509 streamer_write_uhwi_stream (ob
->main_stream
, node
->thunk
.fixed_offset
);
510 streamer_write_uhwi_stream (ob
->main_stream
, node
->thunk
.virtual_value
);
514 /* Output the varpool NODE to OB.
515 If NODE is not in SET, then NODE is a boundary. */
518 lto_output_varpool_node (struct lto_simple_output_block
*ob
, struct varpool_node
*node
,
519 lto_symtab_encoder_t encoder
)
521 bool boundary_p
= !lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)node
);
526 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
527 LTO_symtab_variable
);
528 streamer_write_hwi_stream (ob
->main_stream
, node
->symbol
.order
);
529 lto_output_var_decl_index (ob
->decl_state
, ob
->main_stream
, node
->symbol
.decl
);
530 bp
= bitpack_create (ob
->main_stream
);
531 bp_pack_value (&bp
, node
->symbol
.externally_visible
, 1);
532 bp_pack_value (&bp
, node
->symbol
.force_output
, 1);
533 bp_pack_value (&bp
, node
->symbol
.forced_by_abi
, 1);
534 bp_pack_value (&bp
, node
->symbol
.unique_name
, 1);
535 bp_pack_value (&bp
, node
->symbol
.definition
, 1);
536 alias_p
= node
->symbol
.alias
&& (!boundary_p
|| node
->symbol
.weakref
);
537 bp_pack_value (&bp
, alias_p
, 1);
538 bp_pack_value (&bp
, node
->symbol
.weakref
, 1);
539 bp_pack_value (&bp
, node
->symbol
.analyzed
&& !boundary_p
, 1);
540 gcc_assert (node
->symbol
.definition
|| !node
->symbol
.analyzed
);
541 /* Constant pool initializers can be de-unified into individual ltrans units.
542 FIXME: Alternatively at -Os we may want to avoid generating for them the local
543 labels and share them across LTRANS partitions. */
544 if (DECL_IN_CONSTANT_POOL (node
->symbol
.decl
)
545 && !DECL_EXTERNAL (node
->symbol
.decl
)
546 && !DECL_COMDAT (node
->symbol
.decl
))
548 bp_pack_value (&bp
, 0, 1); /* used_from_other_parition. */
549 bp_pack_value (&bp
, 0, 1); /* in_other_partition. */
553 bp_pack_value (&bp
, node
->symbol
.definition
554 && referenced_from_other_partition_p (&node
->symbol
.ref_list
,
556 bp_pack_value (&bp
, node
->symbol
.analyzed
557 && boundary_p
&& !DECL_EXTERNAL (node
->symbol
.decl
), 1);
558 /* in_other_partition. */
560 streamer_write_bitpack (&bp
);
561 if (node
->symbol
.same_comdat_group
&& !boundary_p
)
563 ref
= lto_symtab_encoder_lookup (encoder
,
564 node
->symbol
.same_comdat_group
);
565 gcc_assert (ref
!= LCC_NOT_FOUND
);
569 streamer_write_hwi_stream (ob
->main_stream
, ref
);
570 streamer_write_enum (ob
->main_stream
, ld_plugin_symbol_resolution
,
571 LDPR_NUM_KNOWN
, node
->symbol
.resolution
);
574 /* Output the varpool NODE to OB.
575 If NODE is not in SET, then NODE is a boundary. */
578 lto_output_ref (struct lto_simple_output_block
*ob
, struct ipa_ref
*ref
,
579 lto_symtab_encoder_t encoder
)
584 bp
= bitpack_create (ob
->main_stream
);
585 bp_pack_value (&bp
, ref
->use
, 2);
586 streamer_write_bitpack (&bp
);
587 nref
= lto_symtab_encoder_lookup (encoder
, ref
->referred
);
588 gcc_assert (nref
!= LCC_NOT_FOUND
);
589 streamer_write_hwi_stream (ob
->main_stream
, nref
);
592 /* Stream out profile_summary to OB. */
595 output_profile_summary (struct lto_simple_output_block
*ob
)
602 /* We do not output num and run_max, they are not used by
603 GCC profile feedback and they are difficult to merge from multiple
605 gcc_assert (profile_info
->runs
);
606 streamer_write_uhwi_stream (ob
->main_stream
, profile_info
->runs
);
607 streamer_write_gcov_count_stream (ob
->main_stream
, profile_info
->sum_max
);
609 /* sum_all is needed for computing the working set with the
611 streamer_write_gcov_count_stream (ob
->main_stream
, profile_info
->sum_all
);
613 /* Create and output a bitpack of non-zero histogram entries indices. */
614 bp
= bitpack_create (ob
->main_stream
);
615 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
616 bp_pack_value (&bp
, profile_info
->histogram
[h_ix
].num_counters
> 0, 1);
617 streamer_write_bitpack (&bp
);
618 /* Now stream out only those non-zero entries. */
619 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
621 if (!profile_info
->histogram
[h_ix
].num_counters
)
623 streamer_write_gcov_count_stream (ob
->main_stream
,
624 profile_info
->histogram
[h_ix
].num_counters
);
625 streamer_write_gcov_count_stream (ob
->main_stream
,
626 profile_info
->histogram
[h_ix
].min_value
);
627 streamer_write_gcov_count_stream (ob
->main_stream
,
628 profile_info
->histogram
[h_ix
].cum_value
);
630 /* IPA-profile computes hot bb threshold based on cumulated
631 whole program profile. We need to stream it down to ltrans. */
633 streamer_write_gcov_count_stream (ob
->main_stream
,
634 get_hot_bb_threshold ());
637 streamer_write_uhwi_stream (ob
->main_stream
, 0);
640 /* Output all callees or indirect outgoing edges. EDGE must be the first such
644 output_outgoing_cgraph_edges (struct cgraph_edge
*edge
,
645 struct lto_simple_output_block
*ob
,
646 lto_symtab_encoder_t encoder
)
651 /* Output edges in backward direction, so the reconstructed callgraph match
652 and it is easy to associate call sites in the IPA pass summaries. */
653 while (edge
->next_callee
)
654 edge
= edge
->next_callee
;
655 for (; edge
; edge
= edge
->prev_callee
)
656 lto_output_edge (ob
, edge
, encoder
);
659 /* Output the part of the cgraph in SET. */
662 output_refs (lto_symtab_encoder_t encoder
)
664 lto_symtab_encoder_iterator lsei
;
665 struct lto_simple_output_block
*ob
;
670 ob
= lto_create_simple_output_block (LTO_section_refs
);
672 for (lsei
= lsei_start_in_partition (encoder
); !lsei_end_p (lsei
);
673 lsei_next_in_partition (&lsei
))
675 symtab_node node
= lsei_node (lsei
);
677 count
= ipa_ref_list_nreferences (&node
->symbol
.ref_list
);
680 streamer_write_gcov_count_stream (ob
->main_stream
, count
);
681 streamer_write_uhwi_stream (ob
->main_stream
,
682 lto_symtab_encoder_lookup (encoder
, node
));
683 for (i
= 0; ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
,
685 lto_output_ref (ob
, ref
, encoder
);
689 streamer_write_uhwi_stream (ob
->main_stream
, 0);
691 lto_destroy_simple_output_block (ob
);
694 /* Add NODE into encoder as well as nodes it is cloned from.
695 Do it in a way so clones appear first. */
698 add_node_to (lto_symtab_encoder_t encoder
, struct cgraph_node
*node
,
702 add_node_to (encoder
, node
->clone_of
, include_body
);
703 else if (include_body
)
704 lto_set_symtab_encoder_encode_body (encoder
, node
);
705 lto_symtab_encoder_encode (encoder
, (symtab_node
)node
);
708 /* Add all references in LIST to encoders. */
711 add_references (lto_symtab_encoder_t encoder
,
712 struct ipa_ref_list
*list
)
716 for (i
= 0; ipa_ref_list_reference_iterate (list
, i
, ref
); i
++)
717 if (is_a
<cgraph_node
> (ref
->referred
))
718 add_node_to (encoder
, ipa_ref_node (ref
), false);
720 lto_symtab_encoder_encode (encoder
, ref
->referred
);
723 /* Find all symbols we want to stream into given partition and insert them
726 The function actually replaces IN_ENCODER by new one. The reason is that
727 streaming code needs clone's origin to be streamed before clone. This
728 means that we need to insert the nodes in specific order. This order is
729 ignored by the partitioning logic earlier. */
732 compute_ltrans_boundary (lto_symtab_encoder_t in_encoder
)
734 struct cgraph_node
*node
;
735 struct cgraph_edge
*edge
;
737 lto_symtab_encoder_t encoder
;
738 lto_symtab_encoder_iterator lsei
;
740 encoder
= lto_symtab_encoder_new (false);
742 /* Go over all entries in the IN_ENCODER and duplicate them to
743 ENCODER. At the same time insert masters of clones so
744 every master appears before clone. */
745 for (lsei
= lsei_start_function_in_partition (in_encoder
);
746 !lsei_end_p (lsei
); lsei_next_function_in_partition (&lsei
))
748 node
= lsei_cgraph_node (lsei
);
749 add_node_to (encoder
, node
, true);
750 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)node
);
751 add_references (encoder
, &node
->symbol
.ref_list
);
753 for (lsei
= lsei_start_variable_in_partition (in_encoder
);
754 !lsei_end_p (lsei
); lsei_next_variable_in_partition (&lsei
))
756 struct varpool_node
*vnode
= lsei_varpool_node (lsei
);
758 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)vnode
);
759 lto_set_symtab_encoder_encode_initializer (encoder
, vnode
);
760 add_references (encoder
, &vnode
->symbol
.ref_list
);
762 /* Pickle in also the initializer of all referenced readonly variables
763 to help folding. Constant pool variables are not shared, so we must
765 for (i
= 0; i
< lto_symtab_encoder_size (encoder
); i
++)
767 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
768 if (varpool_node
*vnode
= dyn_cast
<varpool_node
> (node
))
770 if (!lto_symtab_encoder_encode_initializer_p (encoder
,
772 && ctor_for_folding (vnode
->symbol
.decl
) != error_mark_node
)
774 lto_set_symtab_encoder_encode_initializer (encoder
, vnode
);
775 add_references (encoder
, &vnode
->symbol
.ref_list
);
780 /* Go over all the nodes again to include callees that are not in
782 for (lsei
= lsei_start_function_in_partition (encoder
);
783 !lsei_end_p (lsei
); lsei_next_function_in_partition (&lsei
))
785 node
= lsei_cgraph_node (lsei
);
786 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
788 struct cgraph_node
*callee
= edge
->callee
;
789 if (!lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)callee
))
791 /* We should have moved all the inlines. */
792 gcc_assert (!callee
->global
.inlined_to
);
793 add_node_to (encoder
, callee
, false);
797 lto_symtab_encoder_delete (in_encoder
);
801 /* Output the part of the symtab in SET and VSET. */
806 struct cgraph_node
*node
;
807 struct lto_simple_output_block
*ob
;
808 lto_symtab_encoder_iterator lsei
;
810 lto_symtab_encoder_t encoder
;
811 static bool asm_nodes_output
= false;
814 output_cgraph_opt_summary ();
816 ob
= lto_create_simple_output_block (LTO_section_symtab_nodes
);
818 output_profile_summary (ob
);
820 /* An encoder for cgraph nodes should have been created by
821 ipa_write_summaries_1. */
822 gcc_assert (ob
->decl_state
->symtab_node_encoder
);
823 encoder
= ob
->decl_state
->symtab_node_encoder
;
825 /* Write out the nodes. We must first output a node and then its clones,
826 otherwise at a time reading back the node there would be nothing to clone
828 n_nodes
= lto_symtab_encoder_size (encoder
);
829 for (i
= 0; i
< n_nodes
; i
++)
831 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
832 if (cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
))
833 lto_output_node (ob
, cnode
, encoder
);
835 lto_output_varpool_node (ob
, varpool (node
), encoder
);
839 /* Go over the nodes in SET again to write edges. */
840 for (lsei
= lsei_start_function_in_partition (encoder
); !lsei_end_p (lsei
);
841 lsei_next_function_in_partition (&lsei
))
843 node
= lsei_cgraph_node (lsei
);
844 output_outgoing_cgraph_edges (node
->callees
, ob
, encoder
);
845 output_outgoing_cgraph_edges (node
->indirect_calls
, ob
, encoder
);
848 streamer_write_uhwi_stream (ob
->main_stream
, 0);
850 lto_destroy_simple_output_block (ob
);
852 /* Emit toplevel asms.
853 When doing WPA we must output every asm just once. Since we do not partition asm
854 nodes at all, output them to first output. This is kind of hack, but should work
856 if (!asm_nodes_output
)
858 asm_nodes_output
= true;
859 lto_output_toplevel_asms ();
862 output_refs (encoder
);
865 /* Overwrite the information in NODE based on FILE_DATA, TAG, FLAGS,
866 STACK_SIZE, SELF_TIME and SELF_SIZE. This is called either to initialize
867 NODE or to replace the values in it, for instance because the first
868 time we saw it, the function body was not available but now it
869 is. BP is a bitpack with all the bitflags for NODE read from the
873 input_overwrite_node (struct lto_file_decl_data
*file_data
,
874 struct cgraph_node
*node
,
875 enum LTO_symtab_tags tag
,
876 struct bitpack_d
*bp
)
878 node
->symbol
.aux
= (void *) tag
;
879 node
->symbol
.lto_file_data
= file_data
;
881 node
->local
.local
= bp_unpack_value (bp
, 1);
882 node
->symbol
.externally_visible
= bp_unpack_value (bp
, 1);
883 node
->symbol
.definition
= bp_unpack_value (bp
, 1);
884 node
->local
.versionable
= bp_unpack_value (bp
, 1);
885 node
->local
.can_change_signature
= bp_unpack_value (bp
, 1);
886 node
->local
.redefined_extern_inline
= bp_unpack_value (bp
, 1);
887 node
->symbol
.force_output
= bp_unpack_value (bp
, 1);
888 node
->symbol
.forced_by_abi
= bp_unpack_value (bp
, 1);
889 node
->symbol
.unique_name
= bp_unpack_value (bp
, 1);
890 node
->symbol
.address_taken
= bp_unpack_value (bp
, 1);
891 node
->symbol
.used_from_other_partition
= bp_unpack_value (bp
, 1);
892 node
->lowered
= bp_unpack_value (bp
, 1);
893 node
->symbol
.analyzed
= tag
== LTO_symtab_analyzed_node
;
894 node
->symbol
.in_other_partition
= bp_unpack_value (bp
, 1);
895 if (node
->symbol
.in_other_partition
896 /* Avoid updating decl when we are seeing just inline clone.
897 When inlining function that has functions already inlined into it,
898 we produce clones of inline clones.
900 WPA partitioning might put each clone into different unit and
901 we might end up streaming inline clone from other partition
902 to support clone we are interested in. */
904 || node
->clone_of
->symbol
.decl
!= node
->symbol
.decl
))
906 DECL_EXTERNAL (node
->symbol
.decl
) = 1;
907 TREE_STATIC (node
->symbol
.decl
) = 0;
909 node
->symbol
.alias
= bp_unpack_value (bp
, 1);
910 node
->symbol
.weakref
= bp_unpack_value (bp
, 1);
911 node
->frequency
= (enum node_frequency
)bp_unpack_value (bp
, 2);
912 node
->only_called_at_startup
= bp_unpack_value (bp
, 1);
913 node
->only_called_at_exit
= bp_unpack_value (bp
, 1);
914 node
->tm_clone
= bp_unpack_value (bp
, 1);
915 node
->thunk
.thunk_p
= bp_unpack_value (bp
, 1);
916 node
->symbol
.resolution
= bp_unpack_enum (bp
, ld_plugin_symbol_resolution
,
920 /* Return string alias is alias of. */
923 get_alias_symbol (tree decl
)
925 tree alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
926 return get_identifier (TREE_STRING_POINTER
927 (TREE_VALUE (TREE_VALUE (alias
))));
930 /* Read a node from input_block IB. TAG is the node's tag just read.
931 Return the node read or overwriten. */
933 static struct cgraph_node
*
934 input_node (struct lto_file_decl_data
*file_data
,
935 struct lto_input_block
*ib
,
936 enum LTO_symtab_tags tag
,
937 vec
<symtab_node
> nodes
)
939 gcc::pass_manager
*passes
= g
->get_passes ();
941 struct cgraph_node
*node
;
944 int ref
= LCC_NOT_FOUND
, ref2
= LCC_NOT_FOUND
;
949 order
= streamer_read_hwi (ib
) + order_base
;
950 clone_ref
= streamer_read_hwi (ib
);
952 decl_index
= streamer_read_uhwi (ib
);
953 fn_decl
= lto_file_decl_data_get_fn_decl (file_data
, decl_index
);
955 if (clone_ref
!= LCC_NOT_FOUND
)
957 node
= cgraph_clone_node (cgraph (nodes
[clone_ref
]), fn_decl
,
958 0, CGRAPH_FREQ_BASE
, false,
963 /* Declaration of functions can be already merged with a declaration
964 from other input file. We keep cgraph unmerged until after streaming
965 of ipa passes is done. Alays forcingly create a fresh node. */
966 node
= cgraph_create_empty_node ();
967 node
->symbol
.decl
= fn_decl
;
968 symtab_register_node ((symtab_node
)node
);
971 node
->symbol
.order
= order
;
972 if (order
>= symtab_order
)
973 symtab_order
= order
+ 1;
975 node
->count
= streamer_read_gcov_count (ib
);
976 node
->count_materialization_scale
= streamer_read_hwi (ib
);
978 count
= streamer_read_hwi (ib
);
979 node
->ipa_transforms_to_apply
= vNULL
;
980 for (i
= 0; i
< count
; i
++)
982 struct opt_pass
*pass
;
983 int pid
= streamer_read_hwi (ib
);
985 gcc_assert (pid
< passes
->passes_by_id_size
);
986 pass
= passes
->passes_by_id
[pid
];
987 node
->ipa_transforms_to_apply
.safe_push ((struct ipa_opt_pass_d
*) pass
);
990 if (tag
== LTO_symtab_analyzed_node
)
991 ref
= streamer_read_hwi (ib
);
993 ref2
= streamer_read_hwi (ib
);
995 /* Make sure that we have not read this node before. Nodes that
996 have already been read will have their tag stored in the 'aux'
997 field. Since built-in functions can be referenced in multiple
998 functions, they are expected to be read more than once. */
999 if (node
->symbol
.aux
&& !DECL_BUILT_IN (node
->symbol
.decl
))
1000 internal_error ("bytecode stream: found multiple instances of cgraph "
1001 "node with uid %d", node
->uid
);
1003 bp
= streamer_read_bitpack (ib
);
1004 input_overwrite_node (file_data
, node
, tag
, &bp
);
1006 /* Store a reference for now, and fix up later to be a pointer. */
1007 node
->global
.inlined_to
= (cgraph_node_ptr
) (intptr_t) ref
;
1009 /* Store a reference for now, and fix up later to be a pointer. */
1010 node
->symbol
.same_comdat_group
= (symtab_node
) (intptr_t) ref2
;
1012 if (node
->thunk
.thunk_p
)
1014 int type
= streamer_read_uhwi (ib
);
1015 HOST_WIDE_INT fixed_offset
= streamer_read_uhwi (ib
);
1016 HOST_WIDE_INT virtual_value
= streamer_read_uhwi (ib
);
1018 node
->thunk
.fixed_offset
= fixed_offset
;
1019 node
->thunk
.this_adjusting
= (type
& 2);
1020 node
->thunk
.virtual_value
= virtual_value
;
1021 node
->thunk
.virtual_offset_p
= (type
& 4);
1023 if (node
->symbol
.alias
&& !node
->symbol
.analyzed
&& node
->symbol
.weakref
)
1024 node
->symbol
.alias_target
= get_alias_symbol (node
->symbol
.decl
);
1028 /* Read a node from input_block IB. TAG is the node's tag just read.
1029 Return the node read or overwriten. */
1031 static struct varpool_node
*
1032 input_varpool_node (struct lto_file_decl_data
*file_data
,
1033 struct lto_input_block
*ib
)
1037 struct varpool_node
*node
;
1038 struct bitpack_d bp
;
1039 int ref
= LCC_NOT_FOUND
;
1042 order
= streamer_read_hwi (ib
) + order_base
;
1043 decl_index
= streamer_read_uhwi (ib
);
1044 var_decl
= lto_file_decl_data_get_var_decl (file_data
, decl_index
);
1046 /* Declaration of functions can be already merged with a declaration
1047 from other input file. We keep cgraph unmerged until after streaming
1048 of ipa passes is done. Alays forcingly create a fresh node. */
1049 node
= varpool_create_empty_node ();
1050 node
->symbol
.decl
= var_decl
;
1051 symtab_register_node ((symtab_node
)node
);
1053 node
->symbol
.order
= order
;
1054 if (order
>= symtab_order
)
1055 symtab_order
= order
+ 1;
1056 node
->symbol
.lto_file_data
= file_data
;
1058 bp
= streamer_read_bitpack (ib
);
1059 node
->symbol
.externally_visible
= bp_unpack_value (&bp
, 1);
1060 node
->symbol
.force_output
= bp_unpack_value (&bp
, 1);
1061 node
->symbol
.forced_by_abi
= bp_unpack_value (&bp
, 1);
1062 node
->symbol
.unique_name
= bp_unpack_value (&bp
, 1);
1063 node
->symbol
.definition
= bp_unpack_value (&bp
, 1);
1064 node
->symbol
.alias
= bp_unpack_value (&bp
, 1);
1065 node
->symbol
.weakref
= bp_unpack_value (&bp
, 1);
1066 node
->symbol
.analyzed
= bp_unpack_value (&bp
, 1);
1067 node
->symbol
.used_from_other_partition
= bp_unpack_value (&bp
, 1);
1068 node
->symbol
.in_other_partition
= bp_unpack_value (&bp
, 1);
1069 if (node
->symbol
.in_other_partition
)
1071 DECL_EXTERNAL (node
->symbol
.decl
) = 1;
1072 TREE_STATIC (node
->symbol
.decl
) = 0;
1074 if (node
->symbol
.alias
&& !node
->symbol
.analyzed
&& node
->symbol
.weakref
)
1075 node
->symbol
.alias_target
= get_alias_symbol (node
->symbol
.decl
);
1076 ref
= streamer_read_hwi (ib
);
1077 /* Store a reference for now, and fix up later to be a pointer. */
1078 node
->symbol
.same_comdat_group
= (symtab_node
) (intptr_t) ref
;
1079 node
->symbol
.resolution
= streamer_read_enum (ib
, ld_plugin_symbol_resolution
,
1085 /* Read a node from input_block IB. TAG is the node's tag just read.
1086 Return the node read or overwriten. */
1089 input_ref (struct lto_input_block
*ib
,
1090 symtab_node referring_node
,
1091 vec
<symtab_node
> nodes
)
1093 symtab_node node
= NULL
;
1094 struct bitpack_d bp
;
1095 enum ipa_ref_use use
;
1097 bp
= streamer_read_bitpack (ib
);
1098 use
= (enum ipa_ref_use
) bp_unpack_value (&bp
, 2);
1099 node
= nodes
[streamer_read_hwi (ib
)];
1100 ipa_record_reference (referring_node
, node
, use
, NULL
);
1103 /* Read an edge from IB. NODES points to a vector of previously read nodes for
1104 decoding caller and callee of the edge to be read. If INDIRECT is true, the
1105 edge being read is indirect (in the sense that it has
1106 indirect_unknown_callee set). */
1109 input_edge (struct lto_input_block
*ib
, vec
<symtab_node
> nodes
,
1112 struct cgraph_node
*caller
, *callee
;
1113 struct cgraph_edge
*edge
;
1114 unsigned int stmt_id
;
1117 cgraph_inline_failed_t inline_failed
;
1118 struct bitpack_d bp
;
1121 caller
= cgraph (nodes
[streamer_read_hwi (ib
)]);
1122 if (caller
== NULL
|| caller
->symbol
.decl
== NULL_TREE
)
1123 internal_error ("bytecode stream: no caller found while reading edge");
1127 callee
= cgraph (nodes
[streamer_read_hwi (ib
)]);
1128 if (callee
== NULL
|| callee
->symbol
.decl
== NULL_TREE
)
1129 internal_error ("bytecode stream: no callee found while reading edge");
1134 count
= streamer_read_gcov_count (ib
);
1136 bp
= streamer_read_bitpack (ib
);
1137 inline_failed
= bp_unpack_enum (&bp
, cgraph_inline_failed_enum
, CIF_N_REASONS
);
1138 stmt_id
= bp_unpack_var_len_unsigned (&bp
);
1139 freq
= (int) bp_unpack_var_len_unsigned (&bp
);
1142 edge
= cgraph_create_indirect_edge (caller
, NULL
, 0, count
, freq
);
1144 edge
= cgraph_create_edge (caller
, callee
, NULL
, count
, freq
);
1146 edge
->indirect_inlining_edge
= bp_unpack_value (&bp
, 1);
1147 edge
->lto_stmt_uid
= stmt_id
;
1148 edge
->inline_failed
= inline_failed
;
1149 edge
->call_stmt_cannot_inline_p
= bp_unpack_value (&bp
, 1);
1150 edge
->can_throw_external
= bp_unpack_value (&bp
, 1);
1153 if (bp_unpack_value (&bp
, 1))
1154 ecf_flags
|= ECF_CONST
;
1155 if (bp_unpack_value (&bp
, 1))
1156 ecf_flags
|= ECF_PURE
;
1157 if (bp_unpack_value (&bp
, 1))
1158 ecf_flags
|= ECF_NORETURN
;
1159 if (bp_unpack_value (&bp
, 1))
1160 ecf_flags
|= ECF_MALLOC
;
1161 if (bp_unpack_value (&bp
, 1))
1162 ecf_flags
|= ECF_NOTHROW
;
1163 if (bp_unpack_value (&bp
, 1))
1164 ecf_flags
|= ECF_RETURNS_TWICE
;
1165 edge
->indirect_info
->ecf_flags
= ecf_flags
;
1170 /* Read a cgraph from IB using the info in FILE_DATA. */
1172 static vec
<symtab_node
>
1173 input_cgraph_1 (struct lto_file_decl_data
*file_data
,
1174 struct lto_input_block
*ib
)
1176 enum LTO_symtab_tags tag
;
1177 vec
<symtab_node
> nodes
= vNULL
;
1181 tag
= streamer_read_enum (ib
, LTO_symtab_tags
, LTO_symtab_last_tag
);
1182 order_base
= symtab_order
;
1185 if (tag
== LTO_symtab_edge
)
1186 input_edge (ib
, nodes
, false);
1187 else if (tag
== LTO_symtab_indirect_edge
)
1188 input_edge (ib
, nodes
, true);
1189 else if (tag
== LTO_symtab_variable
)
1191 node
= (symtab_node
)input_varpool_node (file_data
, ib
);
1192 nodes
.safe_push (node
);
1193 lto_symtab_encoder_encode (file_data
->symtab_node_encoder
, node
);
1197 node
= (symtab_node
)input_node (file_data
, ib
, tag
, nodes
);
1198 if (node
== NULL
|| node
->symbol
.decl
== NULL_TREE
)
1199 internal_error ("bytecode stream: found empty cgraph node");
1200 nodes
.safe_push (node
);
1201 lto_symtab_encoder_encode (file_data
->symtab_node_encoder
, node
);
1204 tag
= streamer_read_enum (ib
, LTO_symtab_tags
, LTO_symtab_last_tag
);
1207 lto_input_toplevel_asms (file_data
, order_base
);
1209 /* AUX pointers should be all non-zero for function nodes read from the stream. */
1210 #ifdef ENABLE_CHECKING
1211 FOR_EACH_VEC_ELT (nodes
, i
, node
)
1212 gcc_assert (node
->symbol
.aux
|| !is_a
<cgraph_node
> (node
));
1214 FOR_EACH_VEC_ELT (nodes
, i
, node
)
1217 if (cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
))
1219 ref
= (int) (intptr_t) cnode
->global
.inlined_to
;
1221 /* We share declaration of builtins, so we may read same node twice. */
1222 if (!node
->symbol
.aux
)
1224 node
->symbol
.aux
= NULL
;
1226 /* Fixup inlined_to from reference to pointer. */
1227 if (ref
!= LCC_NOT_FOUND
)
1228 cgraph (node
)->global
.inlined_to
= cgraph (nodes
[ref
]);
1230 cnode
->global
.inlined_to
= NULL
;
1233 ref
= (int) (intptr_t) node
->symbol
.same_comdat_group
;
1235 /* Fixup same_comdat_group from reference to pointer. */
1236 if (ref
!= LCC_NOT_FOUND
)
1237 node
->symbol
.same_comdat_group
= nodes
[ref
];
1239 node
->symbol
.same_comdat_group
= NULL
;
1241 FOR_EACH_VEC_ELT (nodes
, i
, node
)
1242 node
->symbol
.aux
= is_a
<cgraph_node
> (node
) ? (void *)1 : NULL
;
1246 /* Input ipa_refs. */
1249 input_refs (struct lto_input_block
*ib
,
1250 vec
<symtab_node
> nodes
)
1257 count
= streamer_read_uhwi (ib
);
1260 idx
= streamer_read_uhwi (ib
);
1264 input_ref (ib
, node
, nodes
);
1271 static struct gcov_ctr_summary lto_gcov_summary
;
1273 /* Input profile_info from IB. */
1275 input_profile_summary (struct lto_input_block
*ib
,
1276 struct lto_file_decl_data
*file_data
)
1279 struct bitpack_d bp
;
1280 unsigned int runs
= streamer_read_uhwi (ib
);
1283 file_data
->profile_info
.runs
= runs
;
1284 file_data
->profile_info
.sum_max
= streamer_read_gcov_count (ib
);
1285 file_data
->profile_info
.sum_all
= streamer_read_gcov_count (ib
);
1287 memset (file_data
->profile_info
.histogram
, 0,
1288 sizeof (gcov_bucket_type
) * GCOV_HISTOGRAM_SIZE
);
1289 /* Input the bitpack of non-zero histogram indices. */
1290 bp
= streamer_read_bitpack (ib
);
1291 /* Read in and unpack the full bitpack, flagging non-zero
1292 histogram entries by setting the num_counters non-zero. */
1293 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
1295 file_data
->profile_info
.histogram
[h_ix
].num_counters
1296 = bp_unpack_value (&bp
, 1);
1298 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
1300 if (!file_data
->profile_info
.histogram
[h_ix
].num_counters
)
1303 file_data
->profile_info
.histogram
[h_ix
].num_counters
1304 = streamer_read_gcov_count (ib
);
1305 file_data
->profile_info
.histogram
[h_ix
].min_value
1306 = streamer_read_gcov_count (ib
);
1307 file_data
->profile_info
.histogram
[h_ix
].cum_value
1308 = streamer_read_gcov_count (ib
);
1310 /* IPA-profile computes hot bb threshold based on cumulated
1311 whole program profile. We need to stream it down to ltrans. */
1313 set_hot_bb_threshold (streamer_read_gcov_count (ib
));
1318 /* Rescale profile summaries to the same number of runs in the whole unit. */
1321 merge_profile_summaries (struct lto_file_decl_data
**file_data_vec
)
1323 struct lto_file_decl_data
*file_data
;
1324 unsigned int j
, h_ix
;
1325 gcov_unsigned_t max_runs
= 0;
1326 struct cgraph_node
*node
;
1327 struct cgraph_edge
*edge
;
1328 gcov_type saved_sum_all
= 0;
1329 gcov_ctr_summary
*saved_profile_info
= 0;
1330 int saved_scale
= 0;
1332 /* Find unit with maximal number of runs. If we ever get serious about
1333 roundoff errors, we might also consider computing smallest common
1335 for (j
= 0; (file_data
= file_data_vec
[j
]) != NULL
; j
++)
1336 if (max_runs
< file_data
->profile_info
.runs
)
1337 max_runs
= file_data
->profile_info
.runs
;
1342 /* Simple overflow check. We probably don't need to support that many train
1343 runs. Such a large value probably imply data corruption anyway. */
1344 if (max_runs
> INT_MAX
/ REG_BR_PROB_BASE
)
1346 sorry ("At most %i profile runs is supported. Perhaps corrupted profile?",
1347 INT_MAX
/ REG_BR_PROB_BASE
);
1351 profile_info
= <o_gcov_summary
;
1352 lto_gcov_summary
.runs
= max_runs
;
1353 lto_gcov_summary
.sum_max
= 0;
1354 memset (lto_gcov_summary
.histogram
, 0,
1355 sizeof (gcov_bucket_type
) * GCOV_HISTOGRAM_SIZE
);
1357 /* Rescale all units to the maximal number of runs.
1358 sum_max can not be easily merged, as we have no idea what files come from
1359 the same run. We do not use the info anyway, so leave it 0. */
1360 for (j
= 0; (file_data
= file_data_vec
[j
]) != NULL
; j
++)
1361 if (file_data
->profile_info
.runs
)
1363 int scale
= GCOV_COMPUTE_SCALE (max_runs
,
1364 file_data
->profile_info
.runs
);
1365 lto_gcov_summary
.sum_max
1366 = MAX (lto_gcov_summary
.sum_max
,
1367 apply_scale (file_data
->profile_info
.sum_max
, scale
));
1368 lto_gcov_summary
.sum_all
1369 = MAX (lto_gcov_summary
.sum_all
,
1370 apply_scale (file_data
->profile_info
.sum_all
, scale
));
1371 /* Save a pointer to the profile_info with the largest
1372 scaled sum_all and the scale for use in merging the
1374 if (!saved_profile_info
1375 || lto_gcov_summary
.sum_all
> saved_sum_all
)
1377 saved_profile_info
= &file_data
->profile_info
;
1378 saved_sum_all
= lto_gcov_summary
.sum_all
;
1379 saved_scale
= scale
;
1383 gcc_assert (saved_profile_info
);
1385 /* Scale up the histogram from the profile that had the largest
1386 scaled sum_all above. */
1387 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
1389 /* Scale up the min value as we did the corresponding sum_all
1390 above. Use that to find the new histogram index. */
1391 gcov_type scaled_min
1392 = apply_scale (saved_profile_info
->histogram
[h_ix
].min_value
,
1394 /* The new index may be shared with another scaled histogram entry,
1395 so we need to account for a non-zero histogram entry at new_ix. */
1396 unsigned new_ix
= gcov_histo_index (scaled_min
);
1397 lto_gcov_summary
.histogram
[new_ix
].min_value
1398 = (lto_gcov_summary
.histogram
[new_ix
].num_counters
1399 ? MIN (lto_gcov_summary
.histogram
[new_ix
].min_value
, scaled_min
)
1401 /* Some of the scaled counter values would ostensibly need to be placed
1402 into different (larger) histogram buckets, but we keep things simple
1403 here and place the scaled cumulative counter value in the bucket
1404 corresponding to the scaled minimum counter value. */
1405 lto_gcov_summary
.histogram
[new_ix
].cum_value
1406 += apply_scale (saved_profile_info
->histogram
[h_ix
].cum_value
,
1408 lto_gcov_summary
.histogram
[new_ix
].num_counters
1409 += saved_profile_info
->histogram
[h_ix
].num_counters
;
1412 /* Watch roundoff errors. */
1413 if (lto_gcov_summary
.sum_max
< max_runs
)
1414 lto_gcov_summary
.sum_max
= max_runs
;
1416 /* If merging already happent at WPA time, we are done. */
1420 /* Now compute count_materialization_scale of each node.
1421 During LTRANS we already have values of count_materialization_scale
1422 computed, so just update them. */
1423 FOR_EACH_FUNCTION (node
)
1424 if (node
->symbol
.lto_file_data
1425 && node
->symbol
.lto_file_data
->profile_info
.runs
)
1429 scale
= RDIV (node
->count_materialization_scale
* max_runs
,
1430 node
->symbol
.lto_file_data
->profile_info
.runs
);
1431 node
->count_materialization_scale
= scale
;
1433 fatal_error ("Profile information in %s corrupted",
1434 file_data
->file_name
);
1436 if (scale
== REG_BR_PROB_BASE
)
1438 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
1439 edge
->count
= apply_scale (edge
->count
, scale
);
1440 node
->count
= apply_scale (node
->count
, scale
);
1444 /* Input and merge the symtab from each of the .o files passed to
1450 struct lto_file_decl_data
**file_data_vec
= lto_get_file_decl_data ();
1451 struct lto_file_decl_data
*file_data
;
1453 struct cgraph_node
*node
;
1455 while ((file_data
= file_data_vec
[j
++]))
1459 struct lto_input_block
*ib
;
1460 vec
<symtab_node
> nodes
;
1462 ib
= lto_create_simple_input_block (file_data
, LTO_section_symtab_nodes
,
1465 fatal_error ("cannot find LTO cgraph in %s", file_data
->file_name
);
1466 input_profile_summary (ib
, file_data
);
1467 file_data
->symtab_node_encoder
= lto_symtab_encoder_new (true);
1468 nodes
= input_cgraph_1 (file_data
, ib
);
1469 lto_destroy_simple_input_block (file_data
, LTO_section_symtab_nodes
,
1472 ib
= lto_create_simple_input_block (file_data
, LTO_section_refs
,
1475 fatal_error("cannot find LTO section refs in %s", file_data
->file_name
);
1476 input_refs (ib
, nodes
);
1477 lto_destroy_simple_input_block (file_data
, LTO_section_refs
,
1480 input_cgraph_opt_summary (nodes
);
1484 merge_profile_summaries (file_data_vec
);
1485 get_working_sets ();
1488 /* Clear out the aux field that was used to store enough state to
1489 tell which nodes should be overwritten. */
1490 FOR_EACH_FUNCTION (node
)
1492 /* Some nodes may have been created by cgraph_node. This
1493 happens when the callgraph contains nested functions. If the
1494 node for the parent function was never emitted to the gimple
1495 file, cgraph_node will create a node for it when setting the
1496 context of the nested function. */
1497 if (node
->symbol
.lto_file_data
)
1498 node
->symbol
.aux
= NULL
;
1502 /* True when we need optimization summary for NODE. */
1505 output_cgraph_opt_summary_p (struct cgraph_node
*node
)
1507 return (node
->clone_of
1508 && (node
->clone
.tree_map
1509 || node
->clone
.args_to_skip
1510 || node
->clone
.combined_args_to_skip
));
1513 /* Output optimization summary for EDGE to OB. */
1515 output_edge_opt_summary (struct output_block
*ob ATTRIBUTE_UNUSED
,
1516 struct cgraph_edge
*edge ATTRIBUTE_UNUSED
)
1520 /* Output optimization summary for NODE to OB. */
1523 output_node_opt_summary (struct output_block
*ob
,
1524 struct cgraph_node
*node
,
1525 lto_symtab_encoder_t encoder
)
1529 struct ipa_replace_map
*map
;
1530 struct bitpack_d bp
;
1532 struct cgraph_edge
*e
;
1534 if (node
->clone
.args_to_skip
)
1536 streamer_write_uhwi (ob
, bitmap_count_bits (node
->clone
.args_to_skip
));
1537 EXECUTE_IF_SET_IN_BITMAP (node
->clone
.args_to_skip
, 0, index
, bi
)
1538 streamer_write_uhwi (ob
, index
);
1541 streamer_write_uhwi (ob
, 0);
1542 if (node
->clone
.combined_args_to_skip
)
1544 streamer_write_uhwi (ob
, bitmap_count_bits (node
->clone
.combined_args_to_skip
));
1545 EXECUTE_IF_SET_IN_BITMAP (node
->clone
.combined_args_to_skip
, 0, index
, bi
)
1546 streamer_write_uhwi (ob
, index
);
1549 streamer_write_uhwi (ob
, 0);
1550 streamer_write_uhwi (ob
, vec_safe_length (node
->clone
.tree_map
));
1551 FOR_EACH_VEC_SAFE_ELT (node
->clone
.tree_map
, i
, map
)
1553 /* At the moment we assume all old trees to be PARM_DECLs, because we have no
1554 mechanism to store function local declarations into summaries. */
1555 gcc_assert (!map
->old_tree
);
1556 streamer_write_uhwi (ob
, map
->parm_num
);
1557 gcc_assert (EXPR_LOCATION (map
->new_tree
) == UNKNOWN_LOCATION
);
1558 stream_write_tree (ob
, map
->new_tree
, true);
1559 bp
= bitpack_create (ob
->main_stream
);
1560 bp_pack_value (&bp
, map
->replace_p
, 1);
1561 bp_pack_value (&bp
, map
->ref_p
, 1);
1562 streamer_write_bitpack (&bp
);
1565 if (lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
) node
))
1567 for (e
= node
->callees
; e
; e
= e
->next_callee
)
1568 output_edge_opt_summary (ob
, e
);
1569 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
1570 output_edge_opt_summary (ob
, e
);
1574 /* Output optimization summaries stored in callgraph.
1575 At the moment it is the clone info structure. */
1578 output_cgraph_opt_summary (void)
1581 lto_symtab_encoder_t encoder
;
1582 struct output_block
*ob
= create_output_block (LTO_section_cgraph_opt_sum
);
1585 ob
->cgraph_node
= NULL
;
1586 encoder
= ob
->decl_state
->symtab_node_encoder
;
1587 n_nodes
= lto_symtab_encoder_size (encoder
);
1588 for (i
= 0; i
< n_nodes
; i
++)
1590 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
1591 cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
);
1592 if (cnode
&& output_cgraph_opt_summary_p (cnode
))
1595 streamer_write_uhwi (ob
, count
);
1596 for (i
= 0; i
< n_nodes
; i
++)
1598 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
1599 cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
);
1600 if (cnode
&& output_cgraph_opt_summary_p (cnode
))
1602 streamer_write_uhwi (ob
, i
);
1603 output_node_opt_summary (ob
, cnode
, encoder
);
1606 produce_asm (ob
, NULL
);
1607 destroy_output_block (ob
);
1610 /* Input optimisation summary of EDGE. */
1613 input_edge_opt_summary (struct cgraph_edge
*edge ATTRIBUTE_UNUSED
,
1614 struct lto_input_block
*ib_main ATTRIBUTE_UNUSED
)
1618 /* Input optimisation summary of NODE. */
1621 input_node_opt_summary (struct cgraph_node
*node
,
1622 struct lto_input_block
*ib_main
,
1623 struct data_in
*data_in
)
1628 struct bitpack_d bp
;
1629 struct cgraph_edge
*e
;
1631 count
= streamer_read_uhwi (ib_main
);
1633 node
->clone
.args_to_skip
= BITMAP_GGC_ALLOC ();
1634 for (i
= 0; i
< count
; i
++)
1636 bit
= streamer_read_uhwi (ib_main
);
1637 bitmap_set_bit (node
->clone
.args_to_skip
, bit
);
1639 count
= streamer_read_uhwi (ib_main
);
1641 node
->clone
.combined_args_to_skip
= BITMAP_GGC_ALLOC ();
1642 for (i
= 0; i
< count
; i
++)
1644 bit
= streamer_read_uhwi (ib_main
);
1645 bitmap_set_bit (node
->clone
.combined_args_to_skip
, bit
);
1647 count
= streamer_read_uhwi (ib_main
);
1648 for (i
= 0; i
< count
; i
++)
1650 struct ipa_replace_map
*map
= ggc_alloc_ipa_replace_map ();
1652 vec_safe_push (node
->clone
.tree_map
, map
);
1653 map
->parm_num
= streamer_read_uhwi (ib_main
);
1654 map
->old_tree
= NULL
;
1655 map
->new_tree
= stream_read_tree (ib_main
, data_in
);
1656 bp
= streamer_read_bitpack (ib_main
);
1657 map
->replace_p
= bp_unpack_value (&bp
, 1);
1658 map
->ref_p
= bp_unpack_value (&bp
, 1);
1660 for (e
= node
->callees
; e
; e
= e
->next_callee
)
1661 input_edge_opt_summary (e
, ib_main
);
1662 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
1663 input_edge_opt_summary (e
, ib_main
);
1666 /* Read section in file FILE_DATA of length LEN with data DATA. */
1669 input_cgraph_opt_section (struct lto_file_decl_data
*file_data
,
1670 const char *data
, size_t len
,
1671 vec
<symtab_node
> nodes
)
1673 const struct lto_function_header
*header
=
1674 (const struct lto_function_header
*) data
;
1675 const int cfg_offset
= sizeof (struct lto_function_header
);
1676 const int main_offset
= cfg_offset
+ header
->cfg_size
;
1677 const int string_offset
= main_offset
+ header
->main_size
;
1678 struct data_in
*data_in
;
1679 struct lto_input_block ib_main
;
1683 LTO_INIT_INPUT_BLOCK (ib_main
, (const char *) data
+ main_offset
, 0,
1687 lto_data_in_create (file_data
, (const char *) data
+ string_offset
,
1688 header
->string_size
, vNULL
);
1689 count
= streamer_read_uhwi (&ib_main
);
1691 for (i
= 0; i
< count
; i
++)
1693 int ref
= streamer_read_uhwi (&ib_main
);
1694 input_node_opt_summary (cgraph (nodes
[ref
]),
1697 lto_free_section_data (file_data
, LTO_section_cgraph_opt_sum
, NULL
, data
,
1699 lto_data_in_delete (data_in
);
1702 /* Input optimization summary of cgraph. */
1705 input_cgraph_opt_summary (vec
<symtab_node
> nodes
)
1707 struct lto_file_decl_data
**file_data_vec
= lto_get_file_decl_data ();
1708 struct lto_file_decl_data
*file_data
;
1711 while ((file_data
= file_data_vec
[j
++]))
1715 lto_get_section_data (file_data
, LTO_section_cgraph_opt_sum
, NULL
,
1719 input_cgraph_opt_section (file_data
, data
, len
, nodes
);