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 static void output_cgraph_opt_summary (void);
52 static void input_cgraph_opt_summary (vec
<symtab_node
> nodes
);
54 /* Number of LDPR values known to GCC. */
55 #define LDPR_NUM_KNOWN (LDPR_PREVAILING_DEF_IRONLY_EXP + 1)
57 /* All node orders are ofsetted by ORDER_BASE. */
58 static int order_base
;
60 /* Cgraph streaming is organized as set of record whose type
61 is indicated by a tag. */
64 /* Must leave 0 for the stopper. */
66 /* Cgraph node without body available. */
67 LTO_symtab_unavail_node
= 1,
68 /* Cgraph node with function body. */
69 LTO_symtab_analyzed_node
,
72 LTO_symtab_indirect_edge
,
77 /* Create a new symtab encoder.
78 if FOR_INPUT, the encoder allocate only datastructures needed
79 to read the symtab. */
82 lto_symtab_encoder_new (bool for_input
)
84 lto_symtab_encoder_t encoder
= XCNEW (struct lto_symtab_encoder_d
);
87 encoder
->map
= pointer_map_create ();
88 encoder
->nodes
.create (0);
93 /* Delete ENCODER and its components. */
96 lto_symtab_encoder_delete (lto_symtab_encoder_t encoder
)
98 encoder
->nodes
.release ();
100 pointer_map_destroy (encoder
->map
);
105 /* Return the existing reference number of NODE in the symtab encoder in
106 output block OB. Assign a new reference if this is the first time
110 lto_symtab_encoder_encode (lto_symtab_encoder_t encoder
,
118 lto_encoder_entry entry
= {node
, false, false, false};
120 ref
= encoder
->nodes
.length ();
121 encoder
->nodes
.safe_push (entry
);
125 slot
= pointer_map_contains (encoder
->map
, node
);
128 lto_encoder_entry entry
= {node
, false, false, false};
129 ref
= encoder
->nodes
.length ();
131 slot
= pointer_map_insert (encoder
->map
, node
);
132 *slot
= (void *) (intptr_t) (ref
+ 1);
133 encoder
->nodes
.safe_push (entry
);
136 ref
= (size_t) *slot
- 1;
141 /* Remove NODE from encoder. */
144 lto_symtab_encoder_delete_node (lto_symtab_encoder_t encoder
,
147 void **slot
, **last_slot
;
149 lto_encoder_entry last_node
;
151 slot
= pointer_map_contains (encoder
->map
, node
);
152 if (slot
== NULL
|| !*slot
)
155 index
= (size_t) *slot
- 1;
156 gcc_checking_assert (encoder
->nodes
[index
].node
== node
);
158 /* Remove from vector. We do this by swapping node with the last element
160 last_node
= encoder
->nodes
.pop ();
161 if (last_node
.node
!= node
)
163 last_slot
= pointer_map_contains (encoder
->map
, last_node
.node
);
164 gcc_checking_assert (last_slot
&& *last_slot
);
165 *last_slot
= (void *)(size_t) (index
+ 1);
167 /* Move the last element to the original spot of NODE. */
168 encoder
->nodes
[index
] = last_node
;
171 /* Remove element from hash table. */
177 /* Return TRUE if we should encode initializer of NODE (if any). */
180 lto_symtab_encoder_encode_body_p (lto_symtab_encoder_t encoder
,
181 struct cgraph_node
*node
)
183 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
184 return encoder
->nodes
[index
].body
;
187 /* Return TRUE if we should encode body of NODE (if any). */
190 lto_set_symtab_encoder_encode_body (lto_symtab_encoder_t encoder
,
191 struct cgraph_node
*node
)
193 int index
= lto_symtab_encoder_encode (encoder
, (symtab_node
)node
);
194 gcc_checking_assert (encoder
->nodes
[index
].node
== (symtab_node
)node
);
195 encoder
->nodes
[index
].body
= true;
198 /* Return TRUE if we should encode initializer of NODE (if any). */
201 lto_symtab_encoder_encode_initializer_p (lto_symtab_encoder_t encoder
,
202 struct varpool_node
*node
)
204 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
205 if (index
== LCC_NOT_FOUND
)
207 return encoder
->nodes
[index
].initializer
;
210 /* Return TRUE if we should encode initializer of NODE (if any). */
213 lto_set_symtab_encoder_encode_initializer (lto_symtab_encoder_t encoder
,
214 struct varpool_node
*node
)
216 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
217 encoder
->nodes
[index
].initializer
= true;
220 /* Return TRUE if we should encode initializer of NODE (if any). */
223 lto_symtab_encoder_in_partition_p (lto_symtab_encoder_t encoder
,
226 int index
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
);
227 if (index
== LCC_NOT_FOUND
)
229 return encoder
->nodes
[index
].in_partition
;
232 /* Return TRUE if we should encode body of NODE (if any). */
235 lto_set_symtab_encoder_in_partition (lto_symtab_encoder_t encoder
,
238 int index
= lto_symtab_encoder_encode (encoder
, (symtab_node
)node
);
239 encoder
->nodes
[index
].in_partition
= true;
242 /* Output the cgraph EDGE to OB using ENCODER. */
245 lto_output_edge (struct lto_simple_output_block
*ob
, struct cgraph_edge
*edge
,
246 lto_symtab_encoder_t encoder
)
252 if (edge
->indirect_unknown_callee
)
253 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
254 LTO_symtab_indirect_edge
);
256 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
259 ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)edge
->caller
);
260 gcc_assert (ref
!= LCC_NOT_FOUND
);
261 streamer_write_hwi_stream (ob
->main_stream
, ref
);
263 if (!edge
->indirect_unknown_callee
)
265 ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)edge
->callee
);
266 gcc_assert (ref
!= LCC_NOT_FOUND
);
267 streamer_write_hwi_stream (ob
->main_stream
, ref
);
270 streamer_write_gcov_count_stream (ob
->main_stream
, edge
->count
);
272 bp
= bitpack_create (ob
->main_stream
);
273 uid
= (!gimple_has_body_p (edge
->caller
->symbol
.decl
)
274 ? edge
->lto_stmt_uid
: gimple_uid (edge
->call_stmt
));
275 bp_pack_enum (&bp
, cgraph_inline_failed_enum
,
276 CIF_N_REASONS
, edge
->inline_failed
);
277 bp_pack_var_len_unsigned (&bp
, uid
);
278 bp_pack_var_len_unsigned (&bp
, edge
->frequency
);
279 bp_pack_value (&bp
, edge
->indirect_inlining_edge
, 1);
280 bp_pack_value (&bp
, edge
->call_stmt_cannot_inline_p
, 1);
281 bp_pack_value (&bp
, edge
->can_throw_external
, 1);
282 if (edge
->indirect_unknown_callee
)
284 int flags
= edge
->indirect_info
->ecf_flags
;
285 bp_pack_value (&bp
, (flags
& ECF_CONST
) != 0, 1);
286 bp_pack_value (&bp
, (flags
& ECF_PURE
) != 0, 1);
287 bp_pack_value (&bp
, (flags
& ECF_NORETURN
) != 0, 1);
288 bp_pack_value (&bp
, (flags
& ECF_MALLOC
) != 0, 1);
289 bp_pack_value (&bp
, (flags
& ECF_NOTHROW
) != 0, 1);
290 bp_pack_value (&bp
, (flags
& ECF_RETURNS_TWICE
) != 0, 1);
291 /* Flags that should not appear on indirect calls. */
292 gcc_assert (!(flags
& (ECF_LOOPING_CONST_OR_PURE
298 streamer_write_bitpack (&bp
);
301 /* Return if LIST contain references from other partitions. */
304 referenced_from_other_partition_p (struct ipa_ref_list
*list
, lto_symtab_encoder_t encoder
)
308 for (i
= 0; ipa_ref_list_referring_iterate (list
, i
, ref
); i
++)
310 if (ref
->referring
->symbol
.in_other_partition
311 || !lto_symtab_encoder_in_partition_p (encoder
, ref
->referring
))
317 /* Return true when node is reachable from other partition. */
320 reachable_from_other_partition_p (struct cgraph_node
*node
, lto_symtab_encoder_t encoder
)
322 struct cgraph_edge
*e
;
323 if (!node
->symbol
.definition
)
325 if (node
->global
.inlined_to
)
327 for (e
= node
->callers
; e
; e
= e
->next_caller
)
328 if (e
->caller
->symbol
.in_other_partition
329 || !lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)e
->caller
))
334 /* Return if LIST contain references from other partitions. */
337 referenced_from_this_partition_p (struct ipa_ref_list
*list
,
338 lto_symtab_encoder_t encoder
)
342 for (i
= 0; ipa_ref_list_referring_iterate (list
, i
, ref
); i
++)
343 if (lto_symtab_encoder_in_partition_p (encoder
, ref
->referring
))
348 /* Return true when node is reachable from other partition. */
351 reachable_from_this_partition_p (struct cgraph_node
*node
, lto_symtab_encoder_t encoder
)
353 struct cgraph_edge
*e
;
354 for (e
= node
->callers
; e
; e
= e
->next_caller
)
355 if (lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)e
->caller
))
360 /* Output the cgraph NODE to OB. ENCODER is used to find the
361 reference number of NODE->inlined_to. SET is the set of nodes we
362 are writing to the current file. If NODE is not in SET, then NODE
363 is a boundary of a cgraph_node_set and we pretend NODE just has a
364 decl and no callees. WRITTEN_DECLS is the set of FUNCTION_DECLs
365 that have had their callgraph node written so far. This is used to
366 determine if NODE is a clone of a previously written node. */
369 lto_output_node (struct lto_simple_output_block
*ob
, struct cgraph_node
*node
,
370 lto_symtab_encoder_t encoder
)
376 bool in_other_partition
= false;
377 struct cgraph_node
*clone_of
;
378 struct ipa_opt_pass_d
*pass
;
382 boundary_p
= !lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)node
);
384 if (node
->symbol
.analyzed
&& !boundary_p
)
385 tag
= LTO_symtab_analyzed_node
;
387 tag
= LTO_symtab_unavail_node
;
389 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
391 streamer_write_hwi_stream (ob
->main_stream
, node
->symbol
.order
);
393 /* In WPA mode, we only output part of the call-graph. Also, we
394 fake cgraph node attributes. There are two cases that we care.
396 Boundary nodes: There are nodes that are not part of SET but are
397 called from within SET. We artificially make them look like
398 externally visible nodes with no function body.
400 Cherry-picked nodes: These are nodes we pulled from other
401 translation units into SET during IPA-inlining. We make them as
402 local static nodes to prevent clashes with other local statics. */
403 if (boundary_p
&& node
->symbol
.analyzed
&& !DECL_EXTERNAL (node
->symbol
.decl
))
405 /* Inline clones can not be part of boundary.
406 gcc_assert (!node->global.inlined_to);
408 FIXME: At the moment they can be, when partition contains an inline
409 clone that is clone of inline clone from outside partition. We can
410 reshape the clone tree and make other tree to be the root, but it
411 needs a bit extra work and will be promplty done by cgraph_remove_node
412 after reading back. */
413 in_other_partition
= 1;
416 clone_of
= node
->clone_of
;
418 && (ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)clone_of
)) == LCC_NOT_FOUND
)
419 if (clone_of
->prev_sibling_clone
)
420 clone_of
= clone_of
->prev_sibling_clone
;
422 clone_of
= clone_of
->clone_of
;
424 if (LTO_symtab_analyzed_node
)
425 gcc_assert (clone_of
|| !node
->clone_of
);
427 streamer_write_hwi_stream (ob
->main_stream
, LCC_NOT_FOUND
);
429 streamer_write_hwi_stream (ob
->main_stream
, ref
);
432 lto_output_fn_decl_index (ob
->decl_state
, ob
->main_stream
, node
->symbol
.decl
);
433 streamer_write_gcov_count_stream (ob
->main_stream
, node
->count
);
434 streamer_write_hwi_stream (ob
->main_stream
, node
->count_materialization_scale
);
436 streamer_write_hwi_stream (ob
->main_stream
,
437 node
->ipa_transforms_to_apply
.length ());
438 FOR_EACH_VEC_ELT (node
->ipa_transforms_to_apply
, i
, pass
)
439 streamer_write_hwi_stream (ob
->main_stream
, pass
->pass
.static_pass_number
);
441 if (tag
== LTO_symtab_analyzed_node
)
443 if (node
->global
.inlined_to
)
445 ref
= lto_symtab_encoder_lookup (encoder
, (symtab_node
)node
->global
.inlined_to
);
446 gcc_assert (ref
!= LCC_NOT_FOUND
);
451 streamer_write_hwi_stream (ob
->main_stream
, ref
);
454 if (node
->symbol
.same_comdat_group
&& !boundary_p
)
456 ref
= lto_symtab_encoder_lookup (encoder
,
457 node
->symbol
.same_comdat_group
);
458 gcc_assert (ref
!= LCC_NOT_FOUND
);
462 streamer_write_hwi_stream (ob
->main_stream
, ref
);
464 bp
= bitpack_create (ob
->main_stream
);
465 bp_pack_value (&bp
, node
->local
.local
, 1);
466 bp_pack_value (&bp
, node
->symbol
.externally_visible
, 1);
467 bp_pack_value (&bp
, node
->symbol
.definition
, 1);
468 bp_pack_value (&bp
, node
->local
.versionable
, 1);
469 bp_pack_value (&bp
, node
->local
.can_change_signature
, 1);
470 bp_pack_value (&bp
, node
->local
.redefined_extern_inline
, 1);
471 bp_pack_value (&bp
, node
->symbol
.force_output
, 1);
472 bp_pack_value (&bp
, node
->symbol
.forced_by_abi
, 1);
473 bp_pack_value (&bp
, node
->symbol
.unique_name
, 1);
474 bp_pack_value (&bp
, node
->symbol
.address_taken
, 1);
475 bp_pack_value (&bp
, node
->abstract_and_needed
, 1);
476 bp_pack_value (&bp
, tag
== LTO_symtab_analyzed_node
477 && !DECL_EXTERNAL (node
->symbol
.decl
)
478 && !DECL_COMDAT (node
->symbol
.decl
)
479 && (reachable_from_other_partition_p (node
, encoder
)
480 || referenced_from_other_partition_p (&node
->symbol
.ref_list
,
482 bp_pack_value (&bp
, node
->lowered
, 1);
483 bp_pack_value (&bp
, in_other_partition
, 1);
484 /* Real aliases in a boundary become non-aliases. However we still stream
485 alias info on weakrefs.
486 TODO: We lose a bit of information here - when we know that variable is
487 defined in other unit, we may use the info on aliases to resolve
488 symbol1 != symbol2 type tests that we can do only for locally defined objects
490 alias_p
= node
->symbol
.alias
&& (!boundary_p
|| node
->symbol
.weakref
);
491 bp_pack_value (&bp
, alias_p
, 1);
492 bp_pack_value (&bp
, node
->symbol
.weakref
, 1);
493 bp_pack_value (&bp
, node
->frequency
, 2);
494 bp_pack_value (&bp
, node
->only_called_at_startup
, 1);
495 bp_pack_value (&bp
, node
->only_called_at_exit
, 1);
496 bp_pack_value (&bp
, node
->tm_clone
, 1);
497 bp_pack_value (&bp
, node
->thunk
.thunk_p
&& !boundary_p
, 1);
498 bp_pack_enum (&bp
, ld_plugin_symbol_resolution
,
499 LDPR_NUM_KNOWN
, node
->symbol
.resolution
);
500 streamer_write_bitpack (&bp
);
502 if (node
->thunk
.thunk_p
&& !boundary_p
)
504 streamer_write_uhwi_stream
506 1 + (node
->thunk
.this_adjusting
!= 0) * 2
507 + (node
->thunk
.virtual_offset_p
!= 0) * 4);
508 streamer_write_uhwi_stream (ob
->main_stream
, node
->thunk
.fixed_offset
);
509 streamer_write_uhwi_stream (ob
->main_stream
, node
->thunk
.virtual_value
);
513 /* Output the varpool NODE to OB.
514 If NODE is not in SET, then NODE is a boundary. */
517 lto_output_varpool_node (struct lto_simple_output_block
*ob
, struct varpool_node
*node
,
518 lto_symtab_encoder_t encoder
)
520 bool boundary_p
= !lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
)node
);
525 streamer_write_enum (ob
->main_stream
, LTO_symtab_tags
, LTO_symtab_last_tag
,
526 LTO_symtab_variable
);
527 streamer_write_hwi_stream (ob
->main_stream
, node
->symbol
.order
);
528 lto_output_var_decl_index (ob
->decl_state
, ob
->main_stream
, node
->symbol
.decl
);
529 bp
= bitpack_create (ob
->main_stream
);
530 bp_pack_value (&bp
, node
->symbol
.externally_visible
, 1);
531 bp_pack_value (&bp
, node
->symbol
.force_output
, 1);
532 bp_pack_value (&bp
, node
->symbol
.forced_by_abi
, 1);
533 bp_pack_value (&bp
, node
->symbol
.unique_name
, 1);
534 bp_pack_value (&bp
, node
->symbol
.definition
, 1);
535 alias_p
= node
->symbol
.alias
&& (!boundary_p
|| node
->symbol
.weakref
);
536 bp_pack_value (&bp
, alias_p
, 1);
537 bp_pack_value (&bp
, node
->symbol
.weakref
, 1);
538 bp_pack_value (&bp
, node
->symbol
.analyzed
&& !boundary_p
, 1);
539 gcc_assert (node
->symbol
.definition
|| !node
->symbol
.analyzed
);
540 /* Constant pool initializers can be de-unified into individual ltrans units.
541 FIXME: Alternatively at -Os we may want to avoid generating for them the local
542 labels and share them across LTRANS partitions. */
543 if (DECL_IN_CONSTANT_POOL (node
->symbol
.decl
)
544 && !DECL_EXTERNAL (node
->symbol
.decl
)
545 && !DECL_COMDAT (node
->symbol
.decl
))
547 bp_pack_value (&bp
, 0, 1); /* used_from_other_parition. */
548 bp_pack_value (&bp
, 0, 1); /* in_other_partition. */
552 bp_pack_value (&bp
, node
->symbol
.definition
553 && referenced_from_other_partition_p (&node
->symbol
.ref_list
,
555 bp_pack_value (&bp
, node
->symbol
.analyzed
556 && boundary_p
&& !DECL_EXTERNAL (node
->symbol
.decl
), 1);
557 /* in_other_partition. */
559 streamer_write_bitpack (&bp
);
560 if (node
->symbol
.same_comdat_group
&& !boundary_p
)
562 ref
= lto_symtab_encoder_lookup (encoder
,
563 node
->symbol
.same_comdat_group
);
564 gcc_assert (ref
!= LCC_NOT_FOUND
);
568 streamer_write_hwi_stream (ob
->main_stream
, ref
);
569 streamer_write_enum (ob
->main_stream
, ld_plugin_symbol_resolution
,
570 LDPR_NUM_KNOWN
, node
->symbol
.resolution
);
573 /* Output the varpool NODE to OB.
574 If NODE is not in SET, then NODE is a boundary. */
577 lto_output_ref (struct lto_simple_output_block
*ob
, struct ipa_ref
*ref
,
578 lto_symtab_encoder_t encoder
)
583 bp
= bitpack_create (ob
->main_stream
);
584 bp_pack_value (&bp
, ref
->use
, 2);
585 streamer_write_bitpack (&bp
);
586 nref
= lto_symtab_encoder_lookup (encoder
, ref
->referred
);
587 gcc_assert (nref
!= LCC_NOT_FOUND
);
588 streamer_write_hwi_stream (ob
->main_stream
, nref
);
591 /* Stream out profile_summary to OB. */
594 output_profile_summary (struct lto_simple_output_block
*ob
)
601 /* We do not output num and run_max, they are not used by
602 GCC profile feedback and they are difficult to merge from multiple
604 gcc_assert (profile_info
->runs
);
605 streamer_write_uhwi_stream (ob
->main_stream
, profile_info
->runs
);
606 streamer_write_gcov_count_stream (ob
->main_stream
, profile_info
->sum_max
);
608 /* sum_all is needed for computing the working set with the
610 streamer_write_gcov_count_stream (ob
->main_stream
, profile_info
->sum_all
);
612 /* Create and output a bitpack of non-zero histogram entries indices. */
613 bp
= bitpack_create (ob
->main_stream
);
614 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
615 bp_pack_value (&bp
, profile_info
->histogram
[h_ix
].num_counters
> 0, 1);
616 streamer_write_bitpack (&bp
);
617 /* Now stream out only those non-zero entries. */
618 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
620 if (!profile_info
->histogram
[h_ix
].num_counters
)
622 streamer_write_gcov_count_stream (ob
->main_stream
,
623 profile_info
->histogram
[h_ix
].num_counters
);
624 streamer_write_gcov_count_stream (ob
->main_stream
,
625 profile_info
->histogram
[h_ix
].min_value
);
626 streamer_write_gcov_count_stream (ob
->main_stream
,
627 profile_info
->histogram
[h_ix
].cum_value
);
629 /* IPA-profile computes hot bb threshold based on cumulated
630 whole program profile. We need to stream it down to ltrans. */
632 streamer_write_gcov_count_stream (ob
->main_stream
,
633 get_hot_bb_threshold ());
636 streamer_write_uhwi_stream (ob
->main_stream
, 0);
639 /* Output all callees or indirect outgoing edges. EDGE must be the first such
643 output_outgoing_cgraph_edges (struct cgraph_edge
*edge
,
644 struct lto_simple_output_block
*ob
,
645 lto_symtab_encoder_t encoder
)
650 /* Output edges in backward direction, so the reconstructed callgraph match
651 and it is easy to associate call sites in the IPA pass summaries. */
652 while (edge
->next_callee
)
653 edge
= edge
->next_callee
;
654 for (; edge
; edge
= edge
->prev_callee
)
655 lto_output_edge (ob
, edge
, encoder
);
658 /* Output the part of the cgraph in SET. */
661 output_refs (lto_symtab_encoder_t encoder
)
663 lto_symtab_encoder_iterator lsei
;
664 struct lto_simple_output_block
*ob
;
669 ob
= lto_create_simple_output_block (LTO_section_refs
);
671 for (lsei
= lsei_start_in_partition (encoder
); !lsei_end_p (lsei
);
672 lsei_next_in_partition (&lsei
))
674 symtab_node node
= lsei_node (lsei
);
676 count
= ipa_ref_list_nreferences (&node
->symbol
.ref_list
);
679 streamer_write_gcov_count_stream (ob
->main_stream
, count
);
680 streamer_write_uhwi_stream (ob
->main_stream
,
681 lto_symtab_encoder_lookup (encoder
, node
));
682 for (i
= 0; ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
,
684 lto_output_ref (ob
, ref
, encoder
);
688 streamer_write_uhwi_stream (ob
->main_stream
, 0);
690 lto_destroy_simple_output_block (ob
);
693 /* Add NODE into encoder as well as nodes it is cloned from.
694 Do it in a way so clones appear first. */
697 add_node_to (lto_symtab_encoder_t encoder
, struct cgraph_node
*node
,
701 add_node_to (encoder
, node
->clone_of
, include_body
);
702 else if (include_body
)
703 lto_set_symtab_encoder_encode_body (encoder
, node
);
704 lto_symtab_encoder_encode (encoder
, (symtab_node
)node
);
707 /* Add all references in LIST to encoders. */
710 add_references (lto_symtab_encoder_t encoder
,
711 struct ipa_ref_list
*list
)
715 for (i
= 0; ipa_ref_list_reference_iterate (list
, i
, ref
); i
++)
716 if (is_a
<cgraph_node
> (ref
->referred
))
717 add_node_to (encoder
, ipa_ref_node (ref
), false);
719 lto_symtab_encoder_encode (encoder
, ref
->referred
);
722 /* Find all symbols we want to stream into given partition and insert them
725 The function actually replaces IN_ENCODER by new one. The reason is that
726 streaming code needs clone's origin to be streamed before clone. This
727 means that we need to insert the nodes in specific order. This order is
728 ignored by the partitioning logic earlier. */
731 compute_ltrans_boundary (lto_symtab_encoder_t in_encoder
)
733 struct cgraph_node
*node
;
734 struct cgraph_edge
*edge
;
736 lto_symtab_encoder_t encoder
;
737 lto_symtab_encoder_iterator lsei
;
739 encoder
= lto_symtab_encoder_new (false);
741 /* Go over all entries in the IN_ENCODER and duplicate them to
742 ENCODER. At the same time insert masters of clones so
743 every master appears before clone. */
744 for (lsei
= lsei_start_function_in_partition (in_encoder
);
745 !lsei_end_p (lsei
); lsei_next_function_in_partition (&lsei
))
747 node
= lsei_cgraph_node (lsei
);
748 add_node_to (encoder
, node
, true);
749 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)node
);
750 add_references (encoder
, &node
->symbol
.ref_list
);
752 for (lsei
= lsei_start_variable_in_partition (in_encoder
);
753 !lsei_end_p (lsei
); lsei_next_variable_in_partition (&lsei
))
755 struct varpool_node
*vnode
= lsei_varpool_node (lsei
);
757 lto_set_symtab_encoder_in_partition (encoder
, (symtab_node
)vnode
);
758 lto_set_symtab_encoder_encode_initializer (encoder
, vnode
);
759 add_references (encoder
, &vnode
->symbol
.ref_list
);
761 /* Pickle in also the initializer of all referenced readonly variables
762 to help folding. Constant pool variables are not shared, so we must
764 for (i
= 0; i
< lto_symtab_encoder_size (encoder
); i
++)
766 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
767 if (varpool_node
*vnode
= dyn_cast
<varpool_node
> (node
))
769 if (DECL_INITIAL (vnode
->symbol
.decl
)
770 && !lto_symtab_encoder_encode_initializer_p (encoder
,
772 && const_value_known_p (vnode
->symbol
.decl
))
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
->abstract_and_needed
= bp_unpack_value (bp
, 1);
892 node
->symbol
.used_from_other_partition
= bp_unpack_value (bp
, 1);
893 node
->lowered
= bp_unpack_value (bp
, 1);
894 node
->symbol
.analyzed
= tag
== LTO_symtab_analyzed_node
;
895 node
->symbol
.in_other_partition
= bp_unpack_value (bp
, 1);
896 if (node
->symbol
.in_other_partition
897 /* Avoid updating decl when we are seeing just inline clone.
898 When inlining function that has functions already inlined into it,
899 we produce clones of inline clones.
901 WPA partitioning might put each clone into different unit and
902 we might end up streaming inline clone from other partition
903 to support clone we are interested in. */
905 || node
->clone_of
->symbol
.decl
!= node
->symbol
.decl
))
907 DECL_EXTERNAL (node
->symbol
.decl
) = 1;
908 TREE_STATIC (node
->symbol
.decl
) = 0;
910 node
->symbol
.alias
= bp_unpack_value (bp
, 1);
911 node
->symbol
.weakref
= bp_unpack_value (bp
, 1);
912 node
->frequency
= (enum node_frequency
)bp_unpack_value (bp
, 2);
913 node
->only_called_at_startup
= bp_unpack_value (bp
, 1);
914 node
->only_called_at_exit
= bp_unpack_value (bp
, 1);
915 node
->tm_clone
= bp_unpack_value (bp
, 1);
916 node
->thunk
.thunk_p
= bp_unpack_value (bp
, 1);
917 node
->symbol
.resolution
= bp_unpack_enum (bp
, ld_plugin_symbol_resolution
,
921 /* Return string alias is alias of. */
924 get_alias_symbol (tree decl
)
926 tree alias
= lookup_attribute ("alias", DECL_ATTRIBUTES (decl
));
927 return get_identifier (TREE_STRING_POINTER
928 (TREE_VALUE (TREE_VALUE (alias
))));
931 /* Read a node from input_block IB. TAG is the node's tag just read.
932 Return the node read or overwriten. */
934 static struct cgraph_node
*
935 input_node (struct lto_file_decl_data
*file_data
,
936 struct lto_input_block
*ib
,
937 enum LTO_symtab_tags tag
,
938 vec
<symtab_node
> nodes
)
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,
962 node
= cgraph_get_create_node (fn_decl
);
964 node
->symbol
.order
= order
;
965 if (order
>= symtab_order
)
966 symtab_order
= order
+ 1;
968 node
->count
= streamer_read_gcov_count (ib
);
969 node
->count_materialization_scale
= streamer_read_hwi (ib
);
971 count
= streamer_read_hwi (ib
);
972 node
->ipa_transforms_to_apply
= vNULL
;
973 for (i
= 0; i
< count
; i
++)
975 struct opt_pass
*pass
;
976 int pid
= streamer_read_hwi (ib
);
978 gcc_assert (pid
< passes_by_id_size
);
979 pass
= passes_by_id
[pid
];
980 node
->ipa_transforms_to_apply
.safe_push ((struct ipa_opt_pass_d
*) pass
);
983 if (tag
== LTO_symtab_analyzed_node
)
984 ref
= streamer_read_hwi (ib
);
986 ref2
= streamer_read_hwi (ib
);
988 /* Make sure that we have not read this node before. Nodes that
989 have already been read will have their tag stored in the 'aux'
990 field. Since built-in functions can be referenced in multiple
991 functions, they are expected to be read more than once. */
992 if (node
->symbol
.aux
&& !DECL_BUILT_IN (node
->symbol
.decl
))
993 internal_error ("bytecode stream: found multiple instances of cgraph "
994 "node with uid %d", node
->uid
);
996 bp
= streamer_read_bitpack (ib
);
997 input_overwrite_node (file_data
, node
, tag
, &bp
);
999 /* Store a reference for now, and fix up later to be a pointer. */
1000 node
->global
.inlined_to
= (cgraph_node_ptr
) (intptr_t) ref
;
1002 /* Store a reference for now, and fix up later to be a pointer. */
1003 node
->symbol
.same_comdat_group
= (symtab_node
) (intptr_t) ref2
;
1005 if (node
->thunk
.thunk_p
)
1007 int type
= streamer_read_uhwi (ib
);
1008 HOST_WIDE_INT fixed_offset
= streamer_read_uhwi (ib
);
1009 HOST_WIDE_INT virtual_value
= streamer_read_uhwi (ib
);
1011 node
->thunk
.fixed_offset
= fixed_offset
;
1012 node
->thunk
.this_adjusting
= (type
& 2);
1013 node
->thunk
.virtual_value
= virtual_value
;
1014 node
->thunk
.virtual_offset_p
= (type
& 4);
1016 if (node
->symbol
.alias
&& !node
->symbol
.analyzed
&& node
->symbol
.weakref
)
1017 node
->symbol
.alias_target
= get_alias_symbol (node
->symbol
.decl
);
1021 /* Read a node from input_block IB. TAG is the node's tag just read.
1022 Return the node read or overwriten. */
1024 static struct varpool_node
*
1025 input_varpool_node (struct lto_file_decl_data
*file_data
,
1026 struct lto_input_block
*ib
)
1030 struct varpool_node
*node
;
1031 struct bitpack_d bp
;
1032 int ref
= LCC_NOT_FOUND
;
1035 order
= streamer_read_hwi (ib
) + order_base
;
1036 decl_index
= streamer_read_uhwi (ib
);
1037 var_decl
= lto_file_decl_data_get_var_decl (file_data
, decl_index
);
1038 node
= varpool_node_for_decl (var_decl
);
1039 node
->symbol
.order
= order
;
1040 if (order
>= symtab_order
)
1041 symtab_order
= order
+ 1;
1042 node
->symbol
.lto_file_data
= file_data
;
1044 bp
= streamer_read_bitpack (ib
);
1045 node
->symbol
.externally_visible
= bp_unpack_value (&bp
, 1);
1046 node
->symbol
.force_output
= bp_unpack_value (&bp
, 1);
1047 node
->symbol
.forced_by_abi
= bp_unpack_value (&bp
, 1);
1048 node
->symbol
.unique_name
= bp_unpack_value (&bp
, 1);
1049 node
->symbol
.definition
= bp_unpack_value (&bp
, 1);
1050 node
->symbol
.alias
= bp_unpack_value (&bp
, 1);
1051 node
->symbol
.weakref
= bp_unpack_value (&bp
, 1);
1052 node
->symbol
.analyzed
= bp_unpack_value (&bp
, 1);
1053 node
->symbol
.used_from_other_partition
= bp_unpack_value (&bp
, 1);
1054 node
->symbol
.in_other_partition
= bp_unpack_value (&bp
, 1);
1055 if (node
->symbol
.in_other_partition
)
1057 DECL_EXTERNAL (node
->symbol
.decl
) = 1;
1058 TREE_STATIC (node
->symbol
.decl
) = 0;
1060 if (node
->symbol
.alias
&& !node
->symbol
.analyzed
&& node
->symbol
.weakref
)
1061 node
->symbol
.alias_target
= get_alias_symbol (node
->symbol
.decl
);
1062 ref
= streamer_read_hwi (ib
);
1063 /* Store a reference for now, and fix up later to be a pointer. */
1064 node
->symbol
.same_comdat_group
= (symtab_node
) (intptr_t) ref
;
1065 node
->symbol
.resolution
= streamer_read_enum (ib
, ld_plugin_symbol_resolution
,
1071 /* Read a node from input_block IB. TAG is the node's tag just read.
1072 Return the node read or overwriten. */
1075 input_ref (struct lto_input_block
*ib
,
1076 symtab_node referring_node
,
1077 vec
<symtab_node
> nodes
)
1079 symtab_node node
= NULL
;
1080 struct bitpack_d bp
;
1081 enum ipa_ref_use use
;
1083 bp
= streamer_read_bitpack (ib
);
1084 use
= (enum ipa_ref_use
) bp_unpack_value (&bp
, 2);
1085 node
= nodes
[streamer_read_hwi (ib
)];
1086 ipa_record_reference (referring_node
, node
, use
, NULL
);
1089 /* Read an edge from IB. NODES points to a vector of previously read nodes for
1090 decoding caller and callee of the edge to be read. If INDIRECT is true, the
1091 edge being read is indirect (in the sense that it has
1092 indirect_unknown_callee set). */
1095 input_edge (struct lto_input_block
*ib
, vec
<symtab_node
> nodes
,
1098 struct cgraph_node
*caller
, *callee
;
1099 struct cgraph_edge
*edge
;
1100 unsigned int stmt_id
;
1103 cgraph_inline_failed_t inline_failed
;
1104 struct bitpack_d bp
;
1107 caller
= cgraph (nodes
[streamer_read_hwi (ib
)]);
1108 if (caller
== NULL
|| caller
->symbol
.decl
== NULL_TREE
)
1109 internal_error ("bytecode stream: no caller found while reading edge");
1113 callee
= cgraph (nodes
[streamer_read_hwi (ib
)]);
1114 if (callee
== NULL
|| callee
->symbol
.decl
== NULL_TREE
)
1115 internal_error ("bytecode stream: no callee found while reading edge");
1120 count
= streamer_read_gcov_count (ib
);
1122 bp
= streamer_read_bitpack (ib
);
1123 inline_failed
= bp_unpack_enum (&bp
, cgraph_inline_failed_enum
, CIF_N_REASONS
);
1124 stmt_id
= bp_unpack_var_len_unsigned (&bp
);
1125 freq
= (int) bp_unpack_var_len_unsigned (&bp
);
1128 edge
= cgraph_create_indirect_edge (caller
, NULL
, 0, count
, freq
);
1130 edge
= cgraph_create_edge (caller
, callee
, NULL
, count
, freq
);
1132 edge
->indirect_inlining_edge
= bp_unpack_value (&bp
, 1);
1133 edge
->lto_stmt_uid
= stmt_id
;
1134 edge
->inline_failed
= inline_failed
;
1135 edge
->call_stmt_cannot_inline_p
= bp_unpack_value (&bp
, 1);
1136 edge
->can_throw_external
= bp_unpack_value (&bp
, 1);
1139 if (bp_unpack_value (&bp
, 1))
1140 ecf_flags
|= ECF_CONST
;
1141 if (bp_unpack_value (&bp
, 1))
1142 ecf_flags
|= ECF_PURE
;
1143 if (bp_unpack_value (&bp
, 1))
1144 ecf_flags
|= ECF_NORETURN
;
1145 if (bp_unpack_value (&bp
, 1))
1146 ecf_flags
|= ECF_MALLOC
;
1147 if (bp_unpack_value (&bp
, 1))
1148 ecf_flags
|= ECF_NOTHROW
;
1149 if (bp_unpack_value (&bp
, 1))
1150 ecf_flags
|= ECF_RETURNS_TWICE
;
1151 edge
->indirect_info
->ecf_flags
= ecf_flags
;
1156 /* Read a cgraph from IB using the info in FILE_DATA. */
1158 static vec
<symtab_node
>
1159 input_cgraph_1 (struct lto_file_decl_data
*file_data
,
1160 struct lto_input_block
*ib
)
1162 enum LTO_symtab_tags tag
;
1163 vec
<symtab_node
> nodes
= vNULL
;
1167 tag
= streamer_read_enum (ib
, LTO_symtab_tags
, LTO_symtab_last_tag
);
1168 order_base
= symtab_order
;
1171 if (tag
== LTO_symtab_edge
)
1172 input_edge (ib
, nodes
, false);
1173 else if (tag
== LTO_symtab_indirect_edge
)
1174 input_edge (ib
, nodes
, true);
1175 else if (tag
== LTO_symtab_variable
)
1177 node
= (symtab_node
)input_varpool_node (file_data
, ib
);
1178 nodes
.safe_push (node
);
1179 lto_symtab_encoder_encode (file_data
->symtab_node_encoder
, node
);
1183 node
= (symtab_node
)input_node (file_data
, ib
, tag
, nodes
);
1184 if (node
== NULL
|| node
->symbol
.decl
== NULL_TREE
)
1185 internal_error ("bytecode stream: found empty cgraph node");
1186 nodes
.safe_push (node
);
1187 lto_symtab_encoder_encode (file_data
->symtab_node_encoder
, node
);
1190 tag
= streamer_read_enum (ib
, LTO_symtab_tags
, LTO_symtab_last_tag
);
1193 lto_input_toplevel_asms (file_data
, order_base
);
1195 /* AUX pointers should be all non-zero for function nodes read from the stream. */
1196 #ifdef ENABLE_CHECKING
1197 FOR_EACH_VEC_ELT (nodes
, i
, node
)
1198 gcc_assert (node
->symbol
.aux
|| !is_a
<cgraph_node
> (node
));
1200 FOR_EACH_VEC_ELT (nodes
, i
, node
)
1203 if (cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
))
1205 ref
= (int) (intptr_t) cnode
->global
.inlined_to
;
1207 /* We share declaration of builtins, so we may read same node twice. */
1208 if (!node
->symbol
.aux
)
1210 node
->symbol
.aux
= NULL
;
1212 /* Fixup inlined_to from reference to pointer. */
1213 if (ref
!= LCC_NOT_FOUND
)
1214 cgraph (node
)->global
.inlined_to
= cgraph (nodes
[ref
]);
1216 cnode
->global
.inlined_to
= NULL
;
1219 ref
= (int) (intptr_t) node
->symbol
.same_comdat_group
;
1221 /* Fixup same_comdat_group from reference to pointer. */
1222 if (ref
!= LCC_NOT_FOUND
)
1223 node
->symbol
.same_comdat_group
= nodes
[ref
];
1225 node
->symbol
.same_comdat_group
= NULL
;
1227 FOR_EACH_VEC_ELT (nodes
, i
, node
)
1228 node
->symbol
.aux
= is_a
<cgraph_node
> (node
) ? (void *)1 : NULL
;
1232 /* Input ipa_refs. */
1235 input_refs (struct lto_input_block
*ib
,
1236 vec
<symtab_node
> nodes
)
1243 count
= streamer_read_uhwi (ib
);
1246 idx
= streamer_read_uhwi (ib
);
1250 input_ref (ib
, node
, nodes
);
1257 static struct gcov_ctr_summary lto_gcov_summary
;
1259 /* Input profile_info from IB. */
1261 input_profile_summary (struct lto_input_block
*ib
,
1262 struct lto_file_decl_data
*file_data
)
1265 struct bitpack_d bp
;
1266 unsigned int runs
= streamer_read_uhwi (ib
);
1269 file_data
->profile_info
.runs
= runs
;
1270 file_data
->profile_info
.sum_max
= streamer_read_gcov_count (ib
);
1271 file_data
->profile_info
.sum_all
= streamer_read_gcov_count (ib
);
1273 memset (file_data
->profile_info
.histogram
, 0,
1274 sizeof (gcov_bucket_type
) * GCOV_HISTOGRAM_SIZE
);
1275 /* Input the bitpack of non-zero histogram indices. */
1276 bp
= streamer_read_bitpack (ib
);
1277 /* Read in and unpack the full bitpack, flagging non-zero
1278 histogram entries by setting the num_counters non-zero. */
1279 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
1281 file_data
->profile_info
.histogram
[h_ix
].num_counters
1282 = bp_unpack_value (&bp
, 1);
1284 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
1286 if (!file_data
->profile_info
.histogram
[h_ix
].num_counters
)
1289 file_data
->profile_info
.histogram
[h_ix
].num_counters
1290 = streamer_read_gcov_count (ib
);
1291 file_data
->profile_info
.histogram
[h_ix
].min_value
1292 = streamer_read_gcov_count (ib
);
1293 file_data
->profile_info
.histogram
[h_ix
].cum_value
1294 = streamer_read_gcov_count (ib
);
1296 /* IPA-profile computes hot bb threshold based on cumulated
1297 whole program profile. We need to stream it down to ltrans. */
1299 set_hot_bb_threshold (streamer_read_gcov_count (ib
));
1304 /* Rescale profile summaries to the same number of runs in the whole unit. */
1307 merge_profile_summaries (struct lto_file_decl_data
**file_data_vec
)
1309 struct lto_file_decl_data
*file_data
;
1310 unsigned int j
, h_ix
;
1311 gcov_unsigned_t max_runs
= 0;
1312 struct cgraph_node
*node
;
1313 struct cgraph_edge
*edge
;
1314 gcov_type saved_sum_all
= 0;
1315 gcov_ctr_summary
*saved_profile_info
= 0;
1316 int saved_scale
= 0;
1318 /* Find unit with maximal number of runs. If we ever get serious about
1319 roundoff errors, we might also consider computing smallest common
1321 for (j
= 0; (file_data
= file_data_vec
[j
]) != NULL
; j
++)
1322 if (max_runs
< file_data
->profile_info
.runs
)
1323 max_runs
= file_data
->profile_info
.runs
;
1328 /* Simple overflow check. We probably don't need to support that many train
1329 runs. Such a large value probably imply data corruption anyway. */
1330 if (max_runs
> INT_MAX
/ REG_BR_PROB_BASE
)
1332 sorry ("At most %i profile runs is supported. Perhaps corrupted profile?",
1333 INT_MAX
/ REG_BR_PROB_BASE
);
1337 profile_info
= <o_gcov_summary
;
1338 lto_gcov_summary
.runs
= max_runs
;
1339 lto_gcov_summary
.sum_max
= 0;
1340 memset (lto_gcov_summary
.histogram
, 0,
1341 sizeof (gcov_bucket_type
) * GCOV_HISTOGRAM_SIZE
);
1343 /* Rescale all units to the maximal number of runs.
1344 sum_max can not be easily merged, as we have no idea what files come from
1345 the same run. We do not use the info anyway, so leave it 0. */
1346 for (j
= 0; (file_data
= file_data_vec
[j
]) != NULL
; j
++)
1347 if (file_data
->profile_info
.runs
)
1349 int scale
= GCOV_COMPUTE_SCALE (max_runs
,
1350 file_data
->profile_info
.runs
);
1351 lto_gcov_summary
.sum_max
1352 = MAX (lto_gcov_summary
.sum_max
,
1353 apply_scale (file_data
->profile_info
.sum_max
, scale
));
1354 lto_gcov_summary
.sum_all
1355 = MAX (lto_gcov_summary
.sum_all
,
1356 apply_scale (file_data
->profile_info
.sum_all
, scale
));
1357 /* Save a pointer to the profile_info with the largest
1358 scaled sum_all and the scale for use in merging the
1360 if (!saved_profile_info
1361 || lto_gcov_summary
.sum_all
> saved_sum_all
)
1363 saved_profile_info
= &file_data
->profile_info
;
1364 saved_sum_all
= lto_gcov_summary
.sum_all
;
1365 saved_scale
= scale
;
1369 gcc_assert (saved_profile_info
);
1371 /* Scale up the histogram from the profile that had the largest
1372 scaled sum_all above. */
1373 for (h_ix
= 0; h_ix
< GCOV_HISTOGRAM_SIZE
; h_ix
++)
1375 /* Scale up the min value as we did the corresponding sum_all
1376 above. Use that to find the new histogram index. */
1377 gcov_type scaled_min
1378 = apply_scale (saved_profile_info
->histogram
[h_ix
].min_value
,
1380 /* The new index may be shared with another scaled histogram entry,
1381 so we need to account for a non-zero histogram entry at new_ix. */
1382 unsigned new_ix
= gcov_histo_index (scaled_min
);
1383 lto_gcov_summary
.histogram
[new_ix
].min_value
1384 = (lto_gcov_summary
.histogram
[new_ix
].num_counters
1385 ? MIN (lto_gcov_summary
.histogram
[new_ix
].min_value
, scaled_min
)
1387 /* Some of the scaled counter values would ostensibly need to be placed
1388 into different (larger) histogram buckets, but we keep things simple
1389 here and place the scaled cumulative counter value in the bucket
1390 corresponding to the scaled minimum counter value. */
1391 lto_gcov_summary
.histogram
[new_ix
].cum_value
1392 += apply_scale (saved_profile_info
->histogram
[h_ix
].cum_value
,
1394 lto_gcov_summary
.histogram
[new_ix
].num_counters
1395 += saved_profile_info
->histogram
[h_ix
].num_counters
;
1398 /* Watch roundoff errors. */
1399 if (lto_gcov_summary
.sum_max
< max_runs
)
1400 lto_gcov_summary
.sum_max
= max_runs
;
1402 /* If merging already happent at WPA time, we are done. */
1406 /* Now compute count_materialization_scale of each node.
1407 During LTRANS we already have values of count_materialization_scale
1408 computed, so just update them. */
1409 FOR_EACH_FUNCTION (node
)
1410 if (node
->symbol
.lto_file_data
1411 && node
->symbol
.lto_file_data
->profile_info
.runs
)
1415 scale
= RDIV (node
->count_materialization_scale
* max_runs
,
1416 node
->symbol
.lto_file_data
->profile_info
.runs
);
1417 node
->count_materialization_scale
= scale
;
1419 fatal_error ("Profile information in %s corrupted",
1420 file_data
->file_name
);
1422 if (scale
== REG_BR_PROB_BASE
)
1424 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
1425 edge
->count
= apply_scale (edge
->count
, scale
);
1426 node
->count
= apply_scale (node
->count
, scale
);
1430 /* Input and merge the symtab from each of the .o files passed to
1436 struct lto_file_decl_data
**file_data_vec
= lto_get_file_decl_data ();
1437 struct lto_file_decl_data
*file_data
;
1439 struct cgraph_node
*node
;
1441 cgraph_state
= CGRAPH_STATE_IPA_SSA
;
1443 while ((file_data
= file_data_vec
[j
++]))
1447 struct lto_input_block
*ib
;
1448 vec
<symtab_node
> nodes
;
1450 ib
= lto_create_simple_input_block (file_data
, LTO_section_symtab_nodes
,
1453 fatal_error ("cannot find LTO cgraph in %s", file_data
->file_name
);
1454 input_profile_summary (ib
, file_data
);
1455 file_data
->symtab_node_encoder
= lto_symtab_encoder_new (true);
1456 nodes
= input_cgraph_1 (file_data
, ib
);
1457 lto_destroy_simple_input_block (file_data
, LTO_section_symtab_nodes
,
1460 ib
= lto_create_simple_input_block (file_data
, LTO_section_refs
,
1463 fatal_error("cannot find LTO section refs in %s", file_data
->file_name
);
1464 input_refs (ib
, nodes
);
1465 lto_destroy_simple_input_block (file_data
, LTO_section_refs
,
1468 input_cgraph_opt_summary (nodes
);
1472 merge_profile_summaries (file_data_vec
);
1473 get_working_sets ();
1476 /* Clear out the aux field that was used to store enough state to
1477 tell which nodes should be overwritten. */
1478 FOR_EACH_FUNCTION (node
)
1480 /* Some nodes may have been created by cgraph_node. This
1481 happens when the callgraph contains nested functions. If the
1482 node for the parent function was never emitted to the gimple
1483 file, cgraph_node will create a node for it when setting the
1484 context of the nested function. */
1485 if (node
->symbol
.lto_file_data
)
1486 node
->symbol
.aux
= NULL
;
1490 /* True when we need optimization summary for NODE. */
1493 output_cgraph_opt_summary_p (struct cgraph_node
*node
)
1495 return (node
->clone_of
1496 && (node
->clone
.tree_map
1497 || node
->clone
.args_to_skip
1498 || node
->clone
.combined_args_to_skip
));
1501 /* Output optimization summary for EDGE to OB. */
1503 output_edge_opt_summary (struct output_block
*ob ATTRIBUTE_UNUSED
,
1504 struct cgraph_edge
*edge ATTRIBUTE_UNUSED
)
1508 /* Output optimization summary for NODE to OB. */
1511 output_node_opt_summary (struct output_block
*ob
,
1512 struct cgraph_node
*node
,
1513 lto_symtab_encoder_t encoder
)
1517 struct ipa_replace_map
*map
;
1518 struct bitpack_d bp
;
1520 struct cgraph_edge
*e
;
1522 if (node
->clone
.args_to_skip
)
1524 streamer_write_uhwi (ob
, bitmap_count_bits (node
->clone
.args_to_skip
));
1525 EXECUTE_IF_SET_IN_BITMAP (node
->clone
.args_to_skip
, 0, index
, bi
)
1526 streamer_write_uhwi (ob
, index
);
1529 streamer_write_uhwi (ob
, 0);
1530 if (node
->clone
.combined_args_to_skip
)
1532 streamer_write_uhwi (ob
, bitmap_count_bits (node
->clone
.combined_args_to_skip
));
1533 EXECUTE_IF_SET_IN_BITMAP (node
->clone
.combined_args_to_skip
, 0, index
, bi
)
1534 streamer_write_uhwi (ob
, index
);
1537 streamer_write_uhwi (ob
, 0);
1538 streamer_write_uhwi (ob
, vec_safe_length (node
->clone
.tree_map
));
1539 FOR_EACH_VEC_SAFE_ELT (node
->clone
.tree_map
, i
, map
)
1544 for (parm_num
= 0, parm
= DECL_ARGUMENTS (node
->symbol
.decl
); parm
;
1545 parm
= DECL_CHAIN (parm
), parm_num
++)
1546 if (map
->old_tree
== parm
)
1548 /* At the moment we assume all old trees to be PARM_DECLs, because we have no
1549 mechanism to store function local declarations into summaries. */
1551 streamer_write_uhwi (ob
, parm_num
);
1552 gcc_assert (EXPR_LOCATION (map
->new_tree
) == UNKNOWN_LOCATION
);
1553 stream_write_tree (ob
, map
->new_tree
, true);
1554 bp
= bitpack_create (ob
->main_stream
);
1555 bp_pack_value (&bp
, map
->replace_p
, 1);
1556 bp_pack_value (&bp
, map
->ref_p
, 1);
1557 streamer_write_bitpack (&bp
);
1560 if (lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
) node
))
1562 for (e
= node
->callees
; e
; e
= e
->next_callee
)
1563 output_edge_opt_summary (ob
, e
);
1564 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
1565 output_edge_opt_summary (ob
, e
);
1569 /* Output optimization summaries stored in callgraph.
1570 At the moment it is the clone info structure. */
1573 output_cgraph_opt_summary (void)
1576 lto_symtab_encoder_t encoder
;
1577 struct output_block
*ob
= create_output_block (LTO_section_cgraph_opt_sum
);
1580 ob
->cgraph_node
= NULL
;
1581 encoder
= ob
->decl_state
->symtab_node_encoder
;
1582 n_nodes
= lto_symtab_encoder_size (encoder
);
1583 for (i
= 0; i
< n_nodes
; i
++)
1585 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
1586 cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
);
1587 if (cnode
&& output_cgraph_opt_summary_p (cnode
))
1590 streamer_write_uhwi (ob
, count
);
1591 for (i
= 0; i
< n_nodes
; i
++)
1593 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
1594 cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
);
1595 if (cnode
&& output_cgraph_opt_summary_p (cnode
))
1597 streamer_write_uhwi (ob
, i
);
1598 output_node_opt_summary (ob
, cnode
, encoder
);
1601 produce_asm (ob
, NULL
);
1602 destroy_output_block (ob
);
1605 /* Input optimisation summary of EDGE. */
1608 input_edge_opt_summary (struct cgraph_edge
*edge ATTRIBUTE_UNUSED
,
1609 struct lto_input_block
*ib_main ATTRIBUTE_UNUSED
)
1613 /* Input optimisation summary of NODE. */
1616 input_node_opt_summary (struct cgraph_node
*node
,
1617 struct lto_input_block
*ib_main
,
1618 struct data_in
*data_in
)
1623 struct bitpack_d bp
;
1624 struct cgraph_edge
*e
;
1626 count
= streamer_read_uhwi (ib_main
);
1628 node
->clone
.args_to_skip
= BITMAP_GGC_ALLOC ();
1629 for (i
= 0; i
< count
; i
++)
1631 bit
= streamer_read_uhwi (ib_main
);
1632 bitmap_set_bit (node
->clone
.args_to_skip
, bit
);
1634 count
= streamer_read_uhwi (ib_main
);
1636 node
->clone
.combined_args_to_skip
= BITMAP_GGC_ALLOC ();
1637 for (i
= 0; i
< count
; i
++)
1639 bit
= streamer_read_uhwi (ib_main
);
1640 bitmap_set_bit (node
->clone
.combined_args_to_skip
, bit
);
1642 count
= streamer_read_uhwi (ib_main
);
1643 for (i
= 0; i
< count
; i
++)
1645 struct ipa_replace_map
*map
= ggc_alloc_ipa_replace_map ();
1647 vec_safe_push (node
->clone
.tree_map
, map
);
1648 map
->parm_num
= streamer_read_uhwi (ib_main
);
1649 map
->old_tree
= NULL
;
1650 map
->new_tree
= stream_read_tree (ib_main
, data_in
);
1651 bp
= streamer_read_bitpack (ib_main
);
1652 map
->replace_p
= bp_unpack_value (&bp
, 1);
1653 map
->ref_p
= bp_unpack_value (&bp
, 1);
1655 for (e
= node
->callees
; e
; e
= e
->next_callee
)
1656 input_edge_opt_summary (e
, ib_main
);
1657 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
1658 input_edge_opt_summary (e
, ib_main
);
1661 /* Read section in file FILE_DATA of length LEN with data DATA. */
1664 input_cgraph_opt_section (struct lto_file_decl_data
*file_data
,
1665 const char *data
, size_t len
,
1666 vec
<symtab_node
> nodes
)
1668 const struct lto_function_header
*header
=
1669 (const struct lto_function_header
*) data
;
1670 const int cfg_offset
= sizeof (struct lto_function_header
);
1671 const int main_offset
= cfg_offset
+ header
->cfg_size
;
1672 const int string_offset
= main_offset
+ header
->main_size
;
1673 struct data_in
*data_in
;
1674 struct lto_input_block ib_main
;
1678 LTO_INIT_INPUT_BLOCK (ib_main
, (const char *) data
+ main_offset
, 0,
1682 lto_data_in_create (file_data
, (const char *) data
+ string_offset
,
1683 header
->string_size
, vNULL
);
1684 count
= streamer_read_uhwi (&ib_main
);
1686 for (i
= 0; i
< count
; i
++)
1688 int ref
= streamer_read_uhwi (&ib_main
);
1689 input_node_opt_summary (cgraph (nodes
[ref
]),
1692 lto_free_section_data (file_data
, LTO_section_cgraph_opt_sum
, NULL
, data
,
1694 lto_data_in_delete (data_in
);
1697 /* Input optimization summary of cgraph. */
1700 input_cgraph_opt_summary (vec
<symtab_node
> nodes
)
1702 struct lto_file_decl_data
**file_data_vec
= lto_get_file_decl_data ();
1703 struct lto_file_decl_data
*file_data
;
1706 while ((file_data
= file_data_vec
[j
++]))
1710 lto_get_section_data (file_data
, LTO_section_cgraph_opt_sum
, NULL
,
1714 input_cgraph_opt_section (file_data
, data
, len
, nodes
);