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,
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_by_id_size
);
986 pass
= 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 cgraph_state
= CGRAPH_STATE_IPA_SSA
;
1457 while ((file_data
= file_data_vec
[j
++]))
1461 struct lto_input_block
*ib
;
1462 vec
<symtab_node
> nodes
;
1464 ib
= lto_create_simple_input_block (file_data
, LTO_section_symtab_nodes
,
1467 fatal_error ("cannot find LTO cgraph in %s", file_data
->file_name
);
1468 input_profile_summary (ib
, file_data
);
1469 file_data
->symtab_node_encoder
= lto_symtab_encoder_new (true);
1470 nodes
= input_cgraph_1 (file_data
, ib
);
1471 lto_destroy_simple_input_block (file_data
, LTO_section_symtab_nodes
,
1474 ib
= lto_create_simple_input_block (file_data
, LTO_section_refs
,
1477 fatal_error("cannot find LTO section refs in %s", file_data
->file_name
);
1478 input_refs (ib
, nodes
);
1479 lto_destroy_simple_input_block (file_data
, LTO_section_refs
,
1482 input_cgraph_opt_summary (nodes
);
1486 merge_profile_summaries (file_data_vec
);
1487 get_working_sets ();
1490 /* Clear out the aux field that was used to store enough state to
1491 tell which nodes should be overwritten. */
1492 FOR_EACH_FUNCTION (node
)
1494 /* Some nodes may have been created by cgraph_node. This
1495 happens when the callgraph contains nested functions. If the
1496 node for the parent function was never emitted to the gimple
1497 file, cgraph_node will create a node for it when setting the
1498 context of the nested function. */
1499 if (node
->symbol
.lto_file_data
)
1500 node
->symbol
.aux
= NULL
;
1504 /* True when we need optimization summary for NODE. */
1507 output_cgraph_opt_summary_p (struct cgraph_node
*node
)
1509 return (node
->clone_of
1510 && (node
->clone
.tree_map
1511 || node
->clone
.args_to_skip
1512 || node
->clone
.combined_args_to_skip
));
1515 /* Output optimization summary for EDGE to OB. */
1517 output_edge_opt_summary (struct output_block
*ob ATTRIBUTE_UNUSED
,
1518 struct cgraph_edge
*edge ATTRIBUTE_UNUSED
)
1522 /* Output optimization summary for NODE to OB. */
1525 output_node_opt_summary (struct output_block
*ob
,
1526 struct cgraph_node
*node
,
1527 lto_symtab_encoder_t encoder
)
1531 struct ipa_replace_map
*map
;
1532 struct bitpack_d bp
;
1534 struct cgraph_edge
*e
;
1536 if (node
->clone
.args_to_skip
)
1538 streamer_write_uhwi (ob
, bitmap_count_bits (node
->clone
.args_to_skip
));
1539 EXECUTE_IF_SET_IN_BITMAP (node
->clone
.args_to_skip
, 0, index
, bi
)
1540 streamer_write_uhwi (ob
, index
);
1543 streamer_write_uhwi (ob
, 0);
1544 if (node
->clone
.combined_args_to_skip
)
1546 streamer_write_uhwi (ob
, bitmap_count_bits (node
->clone
.combined_args_to_skip
));
1547 EXECUTE_IF_SET_IN_BITMAP (node
->clone
.combined_args_to_skip
, 0, index
, bi
)
1548 streamer_write_uhwi (ob
, index
);
1551 streamer_write_uhwi (ob
, 0);
1552 streamer_write_uhwi (ob
, vec_safe_length (node
->clone
.tree_map
));
1553 FOR_EACH_VEC_SAFE_ELT (node
->clone
.tree_map
, i
, map
)
1558 for (parm_num
= 0, parm
= DECL_ARGUMENTS (node
->symbol
.decl
); parm
;
1559 parm
= DECL_CHAIN (parm
), parm_num
++)
1560 if (map
->old_tree
== parm
)
1562 /* At the moment we assume all old trees to be PARM_DECLs, because we have no
1563 mechanism to store function local declarations into summaries. */
1565 streamer_write_uhwi (ob
, parm_num
);
1566 gcc_assert (EXPR_LOCATION (map
->new_tree
) == UNKNOWN_LOCATION
);
1567 stream_write_tree (ob
, map
->new_tree
, true);
1568 bp
= bitpack_create (ob
->main_stream
);
1569 bp_pack_value (&bp
, map
->replace_p
, 1);
1570 bp_pack_value (&bp
, map
->ref_p
, 1);
1571 streamer_write_bitpack (&bp
);
1574 if (lto_symtab_encoder_in_partition_p (encoder
, (symtab_node
) node
))
1576 for (e
= node
->callees
; e
; e
= e
->next_callee
)
1577 output_edge_opt_summary (ob
, e
);
1578 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
1579 output_edge_opt_summary (ob
, e
);
1583 /* Output optimization summaries stored in callgraph.
1584 At the moment it is the clone info structure. */
1587 output_cgraph_opt_summary (void)
1590 lto_symtab_encoder_t encoder
;
1591 struct output_block
*ob
= create_output_block (LTO_section_cgraph_opt_sum
);
1594 ob
->cgraph_node
= NULL
;
1595 encoder
= ob
->decl_state
->symtab_node_encoder
;
1596 n_nodes
= lto_symtab_encoder_size (encoder
);
1597 for (i
= 0; i
< n_nodes
; i
++)
1599 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
1600 cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
);
1601 if (cnode
&& output_cgraph_opt_summary_p (cnode
))
1604 streamer_write_uhwi (ob
, count
);
1605 for (i
= 0; i
< n_nodes
; i
++)
1607 symtab_node node
= lto_symtab_encoder_deref (encoder
, i
);
1608 cgraph_node
*cnode
= dyn_cast
<cgraph_node
> (node
);
1609 if (cnode
&& output_cgraph_opt_summary_p (cnode
))
1611 streamer_write_uhwi (ob
, i
);
1612 output_node_opt_summary (ob
, cnode
, encoder
);
1615 produce_asm (ob
, NULL
);
1616 destroy_output_block (ob
);
1619 /* Input optimisation summary of EDGE. */
1622 input_edge_opt_summary (struct cgraph_edge
*edge ATTRIBUTE_UNUSED
,
1623 struct lto_input_block
*ib_main ATTRIBUTE_UNUSED
)
1627 /* Input optimisation summary of NODE. */
1630 input_node_opt_summary (struct cgraph_node
*node
,
1631 struct lto_input_block
*ib_main
,
1632 struct data_in
*data_in
)
1637 struct bitpack_d bp
;
1638 struct cgraph_edge
*e
;
1640 count
= streamer_read_uhwi (ib_main
);
1642 node
->clone
.args_to_skip
= BITMAP_GGC_ALLOC ();
1643 for (i
= 0; i
< count
; i
++)
1645 bit
= streamer_read_uhwi (ib_main
);
1646 bitmap_set_bit (node
->clone
.args_to_skip
, bit
);
1648 count
= streamer_read_uhwi (ib_main
);
1650 node
->clone
.combined_args_to_skip
= BITMAP_GGC_ALLOC ();
1651 for (i
= 0; i
< count
; i
++)
1653 bit
= streamer_read_uhwi (ib_main
);
1654 bitmap_set_bit (node
->clone
.combined_args_to_skip
, bit
);
1656 count
= streamer_read_uhwi (ib_main
);
1657 for (i
= 0; i
< count
; i
++)
1659 struct ipa_replace_map
*map
= ggc_alloc_ipa_replace_map ();
1661 vec_safe_push (node
->clone
.tree_map
, map
);
1662 map
->parm_num
= streamer_read_uhwi (ib_main
);
1663 map
->old_tree
= NULL
;
1664 map
->new_tree
= stream_read_tree (ib_main
, data_in
);
1665 bp
= streamer_read_bitpack (ib_main
);
1666 map
->replace_p
= bp_unpack_value (&bp
, 1);
1667 map
->ref_p
= bp_unpack_value (&bp
, 1);
1669 for (e
= node
->callees
; e
; e
= e
->next_callee
)
1670 input_edge_opt_summary (e
, ib_main
);
1671 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
1672 input_edge_opt_summary (e
, ib_main
);
1675 /* Read section in file FILE_DATA of length LEN with data DATA. */
1678 input_cgraph_opt_section (struct lto_file_decl_data
*file_data
,
1679 const char *data
, size_t len
,
1680 vec
<symtab_node
> nodes
)
1682 const struct lto_function_header
*header
=
1683 (const struct lto_function_header
*) data
;
1684 const int cfg_offset
= sizeof (struct lto_function_header
);
1685 const int main_offset
= cfg_offset
+ header
->cfg_size
;
1686 const int string_offset
= main_offset
+ header
->main_size
;
1687 struct data_in
*data_in
;
1688 struct lto_input_block ib_main
;
1692 LTO_INIT_INPUT_BLOCK (ib_main
, (const char *) data
+ main_offset
, 0,
1696 lto_data_in_create (file_data
, (const char *) data
+ string_offset
,
1697 header
->string_size
, vNULL
);
1698 count
= streamer_read_uhwi (&ib_main
);
1700 for (i
= 0; i
< count
; i
++)
1702 int ref
= streamer_read_uhwi (&ib_main
);
1703 input_node_opt_summary (cgraph (nodes
[ref
]),
1706 lto_free_section_data (file_data
, LTO_section_cgraph_opt_sum
, NULL
, data
,
1708 lto_data_in_delete (data_in
);
1711 /* Input optimization summary of cgraph. */
1714 input_cgraph_opt_summary (vec
<symtab_node
> nodes
)
1716 struct lto_file_decl_data
**file_data_vec
= lto_get_file_decl_data ();
1717 struct lto_file_decl_data
*file_data
;
1720 while ((file_data
= file_data_vec
[j
++]))
1724 lto_get_section_data (file_data
, LTO_section_cgraph_opt_sum
, NULL
,
1728 input_cgraph_opt_section (file_data
, data
, len
, nodes
);