1 /* Write and read the cgraph to the memory mapped representation of a
4 Copyright 2009, 2010, 2011 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"
44 #include "pointer-set.h"
45 #include "lto-streamer.h"
48 static void output_varpool (cgraph_node_set, varpool_node_set);
49 static void output_cgraph_opt_summary (cgraph_node_set set);
50 static void input_cgraph_opt_summary (VEC (cgraph_node_ptr, heap) * nodes);
53 /* Cgraph streaming is organized as set of record whose type
54 is indicated by a tag. */
57 /* Must leave 0 for the stopper. */
59 /* Cgraph node without body available. */
60 LTO_cgraph_unavail_node = 1,
61 /* Cgraph node with function body. */
62 LTO_cgraph_analyzed_node,
65 LTO_cgraph_indirect_edge
68 /* Create a new cgraph encoder. */
71 lto_cgraph_encoder_new (void)
73 lto_cgraph_encoder_t encoder = XCNEW (struct lto_cgraph_encoder_d);
74 encoder->map = pointer_map_create ();
75 encoder->nodes = NULL;
76 encoder->body = pointer_set_create ();
81 /* Delete ENCODER and its components. */
84 lto_cgraph_encoder_delete (lto_cgraph_encoder_t encoder)
86 VEC_free (cgraph_node_ptr, heap, encoder->nodes);
87 pointer_map_destroy (encoder->map);
88 pointer_set_destroy (encoder->body);
93 /* Return the existing reference number of NODE in the cgraph encoder in
94 output block OB. Assign a new reference if this is the first time
98 lto_cgraph_encoder_encode (lto_cgraph_encoder_t encoder,
99 struct cgraph_node *node)
104 slot = pointer_map_contains (encoder->map, node);
107 ref = VEC_length (cgraph_node_ptr, encoder->nodes);
108 slot = pointer_map_insert (encoder->map, node);
109 *slot = (void *) (intptr_t) ref;
110 VEC_safe_push (cgraph_node_ptr, heap, encoder->nodes, node);
113 ref = (int) (intptr_t) *slot;
118 #define LCC_NOT_FOUND (-1)
120 /* Look up NODE in encoder. Return NODE's reference if it has been encoded
121 or LCC_NOT_FOUND if it is not there. */
124 lto_cgraph_encoder_lookup (lto_cgraph_encoder_t encoder,
125 struct cgraph_node *node)
127 void **slot = pointer_map_contains (encoder->map, node);
128 return (slot ? (int) (intptr_t) *slot : LCC_NOT_FOUND);
132 /* Return the cgraph node corresponding to REF using ENCODER. */
135 lto_cgraph_encoder_deref (lto_cgraph_encoder_t encoder, int ref)
137 if (ref == LCC_NOT_FOUND)
140 return VEC_index (cgraph_node_ptr, encoder->nodes, ref);
144 /* Return TRUE if we should encode initializer of NODE (if any). */
147 lto_cgraph_encoder_encode_body_p (lto_cgraph_encoder_t encoder,
148 struct cgraph_node *node)
150 return pointer_set_contains (encoder->body, node);
153 /* Return TRUE if we should encode body of NODE (if any). */
156 lto_set_cgraph_encoder_encode_body (lto_cgraph_encoder_t encoder,
157 struct cgraph_node *node)
159 pointer_set_insert (encoder->body, node);
162 /* Create a new varpool encoder. */
164 lto_varpool_encoder_t
165 lto_varpool_encoder_new (void)
167 lto_varpool_encoder_t encoder = XCNEW (struct lto_varpool_encoder_d);
168 encoder->map = pointer_map_create ();
169 encoder->initializer = pointer_set_create ();
170 encoder->nodes = NULL;
175 /* Delete ENCODER and its components. */
178 lto_varpool_encoder_delete (lto_varpool_encoder_t encoder)
180 VEC_free (varpool_node_ptr, heap, encoder->nodes);
181 pointer_map_destroy (encoder->map);
182 pointer_set_destroy (encoder->initializer);
187 /* Return the existing reference number of NODE in the varpool encoder in
188 output block OB. Assign a new reference if this is the first time
192 lto_varpool_encoder_encode (lto_varpool_encoder_t encoder,
193 struct varpool_node *node)
198 slot = pointer_map_contains (encoder->map, node);
201 ref = VEC_length (varpool_node_ptr, encoder->nodes);
202 slot = pointer_map_insert (encoder->map, node);
203 *slot = (void *) (intptr_t) ref;
204 VEC_safe_push (varpool_node_ptr, heap, encoder->nodes, node);
207 ref = (int) (intptr_t) *slot;
212 /* Look up NODE in encoder. Return NODE's reference if it has been encoded
213 or LCC_NOT_FOUND if it is not there. */
216 lto_varpool_encoder_lookup (lto_varpool_encoder_t encoder,
217 struct varpool_node *node)
219 void **slot = pointer_map_contains (encoder->map, node);
220 return (slot ? (int) (intptr_t) *slot : LCC_NOT_FOUND);
224 /* Return the varpool node corresponding to REF using ENCODER. */
226 struct varpool_node *
227 lto_varpool_encoder_deref (lto_varpool_encoder_t encoder, int ref)
229 if (ref == LCC_NOT_FOUND)
232 return VEC_index (varpool_node_ptr, encoder->nodes, ref);
236 /* Return TRUE if we should encode initializer of NODE (if any). */
239 lto_varpool_encoder_encode_initializer_p (lto_varpool_encoder_t encoder,
240 struct varpool_node *node)
242 return pointer_set_contains (encoder->initializer, node);
245 /* Return TRUE if we should encode initializer of NODE (if any). */
248 lto_set_varpool_encoder_encode_initializer (lto_varpool_encoder_t encoder,
249 struct varpool_node *node)
251 pointer_set_insert (encoder->initializer, node);
254 /* Output the cgraph EDGE to OB using ENCODER. */
257 lto_output_edge (struct lto_simple_output_block *ob, struct cgraph_edge *edge,
258 lto_cgraph_encoder_t encoder)
264 if (edge->indirect_unknown_callee)
265 lto_output_uleb128_stream (ob->main_stream, LTO_cgraph_indirect_edge);
267 lto_output_uleb128_stream (ob->main_stream, LTO_cgraph_edge);
269 ref = lto_cgraph_encoder_lookup (encoder, edge->caller);
270 gcc_assert (ref != LCC_NOT_FOUND);
271 lto_output_sleb128_stream (ob->main_stream, ref);
273 if (!edge->indirect_unknown_callee)
275 ref = lto_cgraph_encoder_lookup (encoder, edge->callee);
276 gcc_assert (ref != LCC_NOT_FOUND);
277 lto_output_sleb128_stream (ob->main_stream, ref);
280 lto_output_sleb128_stream (ob->main_stream, edge->count);
282 bp = bitpack_create (ob->main_stream);
283 uid = (!gimple_has_body_p (edge->caller->decl)
284 ? edge->lto_stmt_uid : gimple_uid (edge->call_stmt));
285 bp_pack_value (&bp, uid, HOST_BITS_PER_INT);
286 bp_pack_value (&bp, edge->inline_failed, HOST_BITS_PER_INT);
287 bp_pack_value (&bp, edge->frequency, HOST_BITS_PER_INT);
288 bp_pack_value (&bp, edge->call_stmt_size, HOST_BITS_PER_INT);
289 bp_pack_value (&bp, edge->call_stmt_time, HOST_BITS_PER_INT);
290 bp_pack_value (&bp, edge->loop_nest, 30);
291 bp_pack_value (&bp, edge->indirect_inlining_edge, 1);
292 bp_pack_value (&bp, edge->call_stmt_cannot_inline_p, 1);
293 bp_pack_value (&bp, edge->can_throw_external, 1);
294 if (edge->indirect_unknown_callee)
296 int flags = edge->indirect_info->ecf_flags;
297 bp_pack_value (&bp, (flags & ECF_CONST) != 0, 1);
298 bp_pack_value (&bp, (flags & ECF_PURE) != 0, 1);
299 bp_pack_value (&bp, (flags & ECF_NORETURN) != 0, 1);
300 bp_pack_value (&bp, (flags & ECF_MALLOC) != 0, 1);
301 bp_pack_value (&bp, (flags & ECF_NOTHROW) != 0, 1);
302 bp_pack_value (&bp, (flags & ECF_RETURNS_TWICE) != 0, 1);
303 /* Flags that should not appear on indirect calls. */
304 gcc_assert (!(flags & (ECF_LOOPING_CONST_OR_PURE
310 lto_output_bitpack (&bp);
313 /* Return if LIST contain references from other partitions. */
316 referenced_from_other_partition_p (struct ipa_ref_list *list, cgraph_node_set set,
317 varpool_node_set vset)
321 for (i = 0; ipa_ref_list_refering_iterate (list, i, ref); i++)
323 if (ref->refering_type == IPA_REF_CGRAPH)
325 if (ipa_ref_refering_node (ref)->in_other_partition
326 || !cgraph_node_in_set_p (ipa_ref_refering_node (ref), set))
331 if (ipa_ref_refering_varpool_node (ref)->in_other_partition
332 || !varpool_node_in_set_p (ipa_ref_refering_varpool_node (ref),
340 /* Return true when node is reachable from other partition. */
343 reachable_from_other_partition_p (struct cgraph_node *node, cgraph_node_set set)
345 struct cgraph_edge *e;
348 if (node->global.inlined_to)
350 for (e = node->callers; e; e = e->next_caller)
351 if (e->caller->in_other_partition
352 || !cgraph_node_in_set_p (e->caller, set))
357 /* Return if LIST contain references from other partitions. */
360 referenced_from_this_partition_p (struct ipa_ref_list *list, cgraph_node_set set,
361 varpool_node_set vset)
365 for (i = 0; ipa_ref_list_refering_iterate (list, i, ref); i++)
367 if (ref->refering_type == IPA_REF_CGRAPH)
369 if (cgraph_node_in_set_p (ipa_ref_refering_node (ref), set))
374 if (varpool_node_in_set_p (ipa_ref_refering_varpool_node (ref),
382 /* Return true when node is reachable from other partition. */
385 reachable_from_this_partition_p (struct cgraph_node *node, cgraph_node_set set)
387 struct cgraph_edge *e;
388 for (e = node->callers; e; e = e->next_caller)
389 if (cgraph_node_in_set_p (e->caller, set))
394 /* Output the cgraph NODE to OB. ENCODER is used to find the
395 reference number of NODE->inlined_to. SET is the set of nodes we
396 are writing to the current file. If NODE is not in SET, then NODE
397 is a boundary of a cgraph_node_set and we pretend NODE just has a
398 decl and no callees. WRITTEN_DECLS is the set of FUNCTION_DECLs
399 that have had their callgraph node written so far. This is used to
400 determine if NODE is a clone of a previously written node. */
403 lto_output_node (struct lto_simple_output_block *ob, struct cgraph_node *node,
404 lto_cgraph_encoder_t encoder, cgraph_node_set set,
405 varpool_node_set vset)
411 bool in_other_partition = false;
412 struct cgraph_node *clone_of;
414 boundary_p = !cgraph_node_in_set_p (node, set);
416 if (node->analyzed && !boundary_p)
417 tag = LTO_cgraph_analyzed_node;
419 tag = LTO_cgraph_unavail_node;
421 lto_output_uleb128_stream (ob->main_stream, tag);
423 /* In WPA mode, we only output part of the call-graph. Also, we
424 fake cgraph node attributes. There are two cases that we care.
426 Boundary nodes: There are nodes that are not part of SET but are
427 called from within SET. We artificially make them look like
428 externally visible nodes with no function body.
430 Cherry-picked nodes: These are nodes we pulled from other
431 translation units into SET during IPA-inlining. We make them as
432 local static nodes to prevent clashes with other local statics. */
433 if (boundary_p && node->analyzed)
435 /* Inline clones can not be part of boundary.
436 gcc_assert (!node->global.inlined_to);
438 FIXME: At the moment they can be, when partition contains an inline
439 clone that is clone of inline clone from outside partition. We can
440 reshape the clone tree and make other tree to be the root, but it
441 needs a bit extra work and will be promplty done by cgraph_remove_node
442 after reading back. */
443 in_other_partition = 1;
446 clone_of = node->clone_of;
448 && (ref = lto_cgraph_encoder_lookup (encoder, clone_of)) == LCC_NOT_FOUND)
449 if (clone_of->prev_sibling_clone)
450 clone_of = clone_of->prev_sibling_clone;
452 clone_of = clone_of->clone_of;
454 if (LTO_cgraph_analyzed_node)
455 gcc_assert (clone_of || !node->clone_of);
457 lto_output_sleb128_stream (ob->main_stream, LCC_NOT_FOUND);
459 lto_output_sleb128_stream (ob->main_stream, ref);
462 lto_output_fn_decl_index (ob->decl_state, ob->main_stream, node->decl);
463 lto_output_sleb128_stream (ob->main_stream, node->count);
464 lto_output_sleb128_stream (ob->main_stream, node->count_materialization_scale);
466 if (tag == LTO_cgraph_analyzed_node)
468 if (node->global.inlined_to)
470 ref = lto_cgraph_encoder_lookup (encoder, node->global.inlined_to);
471 gcc_assert (ref != LCC_NOT_FOUND);
476 lto_output_sleb128_stream (ob->main_stream, ref);
479 if (node->same_comdat_group && !boundary_p)
481 ref = lto_cgraph_encoder_lookup (encoder, node->same_comdat_group);
482 gcc_assert (ref != LCC_NOT_FOUND);
486 lto_output_sleb128_stream (ob->main_stream, ref);
488 bp = bitpack_create (ob->main_stream);
489 bp_pack_value (&bp, node->local.local, 1);
490 bp_pack_value (&bp, node->local.externally_visible, 1);
491 bp_pack_value (&bp, node->local.finalized, 1);
492 bp_pack_value (&bp, node->local.can_change_signature, 1);
493 bp_pack_value (&bp, node->local.redefined_extern_inline, 1);
494 bp_pack_value (&bp, node->needed, 1);
495 bp_pack_value (&bp, node->address_taken, 1);
496 bp_pack_value (&bp, node->abstract_and_needed, 1);
497 bp_pack_value (&bp, tag == LTO_cgraph_analyzed_node
498 && !DECL_EXTERNAL (node->decl)
499 && !DECL_COMDAT (node->decl)
500 && (reachable_from_other_partition_p (node, set)
501 || referenced_from_other_partition_p (&node->ref_list, set, vset)), 1);
502 bp_pack_value (&bp, node->lowered, 1);
503 bp_pack_value (&bp, in_other_partition, 1);
504 bp_pack_value (&bp, node->alias, 1);
505 bp_pack_value (&bp, node->finalized_by_frontend, 1);
506 bp_pack_value (&bp, node->frequency, 2);
507 bp_pack_value (&bp, node->only_called_at_startup, 1);
508 bp_pack_value (&bp, node->only_called_at_exit, 1);
509 lto_output_bitpack (&bp);
510 lto_output_uleb128_stream (ob->main_stream, node->resolution);
514 struct cgraph_node *alias;
515 unsigned long alias_count = 1;
516 for (alias = node->same_body; alias->next; alias = alias->next)
518 lto_output_uleb128_stream (ob->main_stream, alias_count);
521 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
523 if (alias->thunk.thunk_p)
525 lto_output_uleb128_stream
527 1 + (alias->thunk.this_adjusting != 0) * 2
528 + (alias->thunk.virtual_offset_p != 0) * 4);
529 lto_output_uleb128_stream (ob->main_stream,
530 alias->thunk.fixed_offset);
531 lto_output_uleb128_stream (ob->main_stream,
532 alias->thunk.virtual_value);
533 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
538 lto_output_uleb128_stream (ob->main_stream, 0);
539 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
542 gcc_assert (cgraph_get_node (alias->thunk.alias) == node);
543 lto_output_uleb128_stream (ob->main_stream, alias->resolution);
544 alias = alias->previous;
549 lto_output_uleb128_stream (ob->main_stream, 0);
552 /* Output the varpool NODE to OB.
553 If NODE is not in SET, then NODE is a boundary. */
556 lto_output_varpool_node (struct lto_simple_output_block *ob, struct varpool_node *node,
557 lto_varpool_encoder_t varpool_encoder,
558 cgraph_node_set set, varpool_node_set vset)
560 bool boundary_p = !varpool_node_in_set_p (node, vset) && node->analyzed;
562 struct varpool_node *alias;
566 lto_output_var_decl_index (ob->decl_state, ob->main_stream, node->decl);
567 bp = bitpack_create (ob->main_stream);
568 bp_pack_value (&bp, node->externally_visible, 1);
569 bp_pack_value (&bp, node->force_output, 1);
570 bp_pack_value (&bp, node->finalized, 1);
571 bp_pack_value (&bp, node->alias, 1);
572 gcc_assert (!node->alias || !node->extra_name);
573 gcc_assert (node->finalized || !node->analyzed);
574 gcc_assert (node->needed);
575 /* Constant pool initializers can be de-unified into individual ltrans units.
576 FIXME: Alternatively at -Os we may want to avoid generating for them the local
577 labels and share them across LTRANS partitions. */
578 if (DECL_IN_CONSTANT_POOL (node->decl)
579 && !DECL_COMDAT (node->decl))
581 bp_pack_value (&bp, 0, 1); /* used_from_other_parition. */
582 bp_pack_value (&bp, 0, 1); /* in_other_partition. */
586 bp_pack_value (&bp, node->analyzed
587 && referenced_from_other_partition_p (&node->ref_list,
589 bp_pack_value (&bp, boundary_p, 1); /* in_other_partition. */
591 /* Also emit any extra name aliases. */
592 for (alias = node->extra_name; alias; alias = alias->next)
594 bp_pack_value (&bp, count != 0, 1);
595 lto_output_bitpack (&bp);
596 if (node->same_comdat_group && !boundary_p)
598 ref = lto_varpool_encoder_lookup (varpool_encoder, node->same_comdat_group);
599 gcc_assert (ref != LCC_NOT_FOUND);
603 lto_output_sleb128_stream (ob->main_stream, ref);
604 lto_output_uleb128_stream (ob->main_stream, node->resolution);
608 lto_output_uleb128_stream (ob->main_stream, count);
609 for (alias = node->extra_name; alias; alias = alias->next)
611 lto_output_var_decl_index (ob->decl_state, ob->main_stream, alias->decl);
612 lto_output_uleb128_stream (ob->main_stream, alias->resolution);
617 /* Output the varpool NODE to OB.
618 If NODE is not in SET, then NODE is a boundary. */
621 lto_output_ref (struct lto_simple_output_block *ob, struct ipa_ref *ref,
622 lto_cgraph_encoder_t encoder,
623 lto_varpool_encoder_t varpool_encoder)
626 bp = bitpack_create (ob->main_stream);
627 bp_pack_value (&bp, ref->refered_type, 1);
628 bp_pack_value (&bp, ref->use, 2);
629 lto_output_bitpack (&bp);
630 if (ref->refered_type == IPA_REF_CGRAPH)
632 int nref = lto_cgraph_encoder_lookup (encoder, ipa_ref_node (ref));
633 gcc_assert (nref != LCC_NOT_FOUND);
634 lto_output_sleb128_stream (ob->main_stream, nref);
638 int nref = lto_varpool_encoder_lookup (varpool_encoder,
639 ipa_ref_varpool_node (ref));
640 gcc_assert (nref != LCC_NOT_FOUND);
641 lto_output_sleb128_stream (ob->main_stream, nref);
645 /* Stream out profile_summary to OB. */
648 output_profile_summary (struct lto_simple_output_block *ob)
652 /* We do not output num, sum_all and run_max, they are not used by
653 GCC profile feedback and they are difficult to merge from multiple
655 gcc_assert (profile_info->runs);
656 lto_output_uleb128_stream (ob->main_stream, profile_info->runs);
657 lto_output_uleb128_stream (ob->main_stream, profile_info->sum_max);
660 lto_output_uleb128_stream (ob->main_stream, 0);
663 /* Add NODE into encoder as well as nodes it is cloned from.
664 Do it in a way so clones appear first. */
667 add_node_to (lto_cgraph_encoder_t encoder, struct cgraph_node *node,
671 add_node_to (encoder, node->clone_of, include_body);
672 else if (include_body)
673 lto_set_cgraph_encoder_encode_body (encoder, node);
674 lto_cgraph_encoder_encode (encoder, node);
677 /* Add all references in LIST to encoders. */
680 add_references (lto_cgraph_encoder_t encoder,
681 lto_varpool_encoder_t varpool_encoder,
682 struct ipa_ref_list *list)
686 for (i = 0; ipa_ref_list_reference_iterate (list, i, ref); i++)
687 if (ref->refered_type == IPA_REF_CGRAPH)
688 add_node_to (encoder, ipa_ref_node (ref), false);
691 struct varpool_node *vnode = ipa_ref_varpool_node (ref);
692 lto_varpool_encoder_encode (varpool_encoder, vnode);
696 /* Output all callees or indirect outgoing edges. EDGE must be the first such
700 output_outgoing_cgraph_edges (struct cgraph_edge *edge,
701 struct lto_simple_output_block *ob,
702 lto_cgraph_encoder_t encoder)
707 /* Output edges in backward direction, so the reconstructed callgraph match
708 and it is easy to associate call sites in the IPA pass summaries. */
709 while (edge->next_callee)
710 edge = edge->next_callee;
711 for (; edge; edge = edge->prev_callee)
712 lto_output_edge (ob, edge, encoder);
715 /* Output the part of the cgraph in SET. */
718 output_refs (cgraph_node_set set, varpool_node_set vset,
719 lto_cgraph_encoder_t encoder,
720 lto_varpool_encoder_t varpool_encoder)
722 cgraph_node_set_iterator csi;
723 varpool_node_set_iterator vsi;
724 struct lto_simple_output_block *ob;
729 ob = lto_create_simple_output_block (LTO_section_refs);
731 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
733 struct cgraph_node *node = csi_node (csi);
735 count = ipa_ref_list_nreferences (&node->ref_list);
738 lto_output_uleb128_stream (ob->main_stream, count);
739 lto_output_uleb128_stream (ob->main_stream,
740 lto_cgraph_encoder_lookup (encoder, node));
741 for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref); i++)
742 lto_output_ref (ob, ref, encoder, varpool_encoder);
746 lto_output_uleb128_stream (ob->main_stream, 0);
748 for (vsi = vsi_start (vset); !vsi_end_p (vsi); vsi_next (&vsi))
750 struct varpool_node *node = vsi_node (vsi);
752 count = ipa_ref_list_nreferences (&node->ref_list);
755 lto_output_uleb128_stream (ob->main_stream, count);
756 lto_output_uleb128_stream (ob->main_stream,
757 lto_varpool_encoder_lookup (varpool_encoder,
759 for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref); i++)
760 lto_output_ref (ob, ref, encoder, varpool_encoder);
764 lto_output_uleb128_stream (ob->main_stream, 0);
766 lto_destroy_simple_output_block (ob);
769 /* Find out all cgraph and varpool nodes we want to encode in current unit
770 and insert them to encoders. */
772 compute_ltrans_boundary (struct lto_out_decl_state *state,
773 cgraph_node_set set, varpool_node_set vset)
775 struct cgraph_node *node;
776 cgraph_node_set_iterator csi;
777 varpool_node_set_iterator vsi;
778 struct cgraph_edge *edge;
780 lto_cgraph_encoder_t encoder;
781 lto_varpool_encoder_t varpool_encoder;
783 encoder = state->cgraph_node_encoder = lto_cgraph_encoder_new ();
784 varpool_encoder = state->varpool_node_encoder = lto_varpool_encoder_new ();
786 /* Go over all the nodes in SET and assign references. */
787 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
789 node = csi_node (csi);
790 add_node_to (encoder, node, true);
791 add_references (encoder, varpool_encoder, &node->ref_list);
793 for (vsi = vsi_start (vset); !vsi_end_p (vsi); vsi_next (&vsi))
795 struct varpool_node *vnode = vsi_node (vsi);
796 gcc_assert (!vnode->alias);
797 lto_varpool_encoder_encode (varpool_encoder, vnode);
798 lto_set_varpool_encoder_encode_initializer (varpool_encoder, vnode);
799 add_references (encoder, varpool_encoder, &vnode->ref_list);
801 /* Pickle in also the initializer of all referenced readonly variables
802 to help folding. Constant pool variables are not shared, so we must
804 for (i = 0; i < lto_varpool_encoder_size (varpool_encoder); i++)
806 struct varpool_node *vnode = lto_varpool_encoder_deref (varpool_encoder, i);
807 if (DECL_INITIAL (vnode->decl)
808 && !lto_varpool_encoder_encode_initializer_p (varpool_encoder,
810 && const_value_known_p (vnode->decl))
812 lto_set_varpool_encoder_encode_initializer (varpool_encoder, vnode);
813 add_references (encoder, varpool_encoder, &vnode->ref_list);
817 /* Go over all the nodes again to include callees that are not in
819 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
821 node = csi_node (csi);
822 for (edge = node->callees; edge; edge = edge->next_callee)
824 struct cgraph_node *callee = edge->callee;
825 if (!cgraph_node_in_set_p (callee, set))
827 /* We should have moved all the inlines. */
828 gcc_assert (!callee->global.inlined_to);
829 add_node_to (encoder, callee, false);
835 /* Output the part of the cgraph in SET. */
838 output_cgraph (cgraph_node_set set, varpool_node_set vset)
840 struct cgraph_node *node;
841 struct lto_simple_output_block *ob;
842 cgraph_node_set_iterator csi;
844 lto_cgraph_encoder_t encoder;
845 lto_varpool_encoder_t varpool_encoder;
846 struct cgraph_asm_node *can;
847 static bool asm_nodes_output = false;
850 output_cgraph_opt_summary (set);
852 ob = lto_create_simple_output_block (LTO_section_cgraph);
854 output_profile_summary (ob);
856 /* An encoder for cgraph nodes should have been created by
857 ipa_write_summaries_1. */
858 gcc_assert (ob->decl_state->cgraph_node_encoder);
859 gcc_assert (ob->decl_state->varpool_node_encoder);
860 encoder = ob->decl_state->cgraph_node_encoder;
861 varpool_encoder = ob->decl_state->varpool_node_encoder;
863 /* Write out the nodes. We must first output a node and then its clones,
864 otherwise at a time reading back the node there would be nothing to clone
866 n_nodes = lto_cgraph_encoder_size (encoder);
867 for (i = 0; i < n_nodes; i++)
869 node = lto_cgraph_encoder_deref (encoder, i);
870 lto_output_node (ob, node, encoder, set, vset);
873 /* Go over the nodes in SET again to write edges. */
874 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
876 node = csi_node (csi);
877 output_outgoing_cgraph_edges (node->callees, ob, encoder);
878 output_outgoing_cgraph_edges (node->indirect_calls, ob, encoder);
881 lto_output_uleb128_stream (ob->main_stream, 0);
883 /* Emit toplevel asms.
884 When doing WPA we must output every asm just once. Since we do not partition asm
885 nodes at all, output them to first output. This is kind of hack, but should work
887 if (!asm_nodes_output)
889 asm_nodes_output = true;
890 for (can = cgraph_asm_nodes; can; can = can->next)
892 int len = TREE_STRING_LENGTH (can->asm_str);
893 lto_output_uleb128_stream (ob->main_stream, len);
894 for (i = 0; i < len; ++i)
895 lto_output_1_stream (ob->main_stream,
896 TREE_STRING_POINTER (can->asm_str)[i]);
900 lto_output_uleb128_stream (ob->main_stream, 0);
902 lto_destroy_simple_output_block (ob);
903 output_varpool (set, vset);
904 output_refs (set, vset, encoder, varpool_encoder);
907 /* Overwrite the information in NODE based on FILE_DATA, TAG, FLAGS,
908 STACK_SIZE, SELF_TIME and SELF_SIZE. This is called either to initialize
909 NODE or to replace the values in it, for instance because the first
910 time we saw it, the function body was not available but now it
911 is. BP is a bitpack with all the bitflags for NODE read from the
915 input_overwrite_node (struct lto_file_decl_data *file_data,
916 struct cgraph_node *node,
917 enum LTO_cgraph_tags tag,
918 struct bitpack_d *bp,
919 enum ld_plugin_symbol_resolution resolution)
921 node->aux = (void *) tag;
922 node->local.lto_file_data = file_data;
924 node->local.local = bp_unpack_value (bp, 1);
925 node->local.externally_visible = bp_unpack_value (bp, 1);
926 node->local.finalized = bp_unpack_value (bp, 1);
927 node->local.can_change_signature = bp_unpack_value (bp, 1);
928 node->local.redefined_extern_inline = bp_unpack_value (bp, 1);
929 node->needed = bp_unpack_value (bp, 1);
930 node->address_taken = bp_unpack_value (bp, 1);
931 node->abstract_and_needed = bp_unpack_value (bp, 1);
932 node->reachable_from_other_partition = bp_unpack_value (bp, 1);
933 node->lowered = bp_unpack_value (bp, 1);
934 node->analyzed = tag == LTO_cgraph_analyzed_node;
935 node->in_other_partition = bp_unpack_value (bp, 1);
936 if (node->in_other_partition
937 /* Avoid updating decl when we are seeing just inline clone.
938 When inlining function that has functions already inlined into it,
939 we produce clones of inline clones.
941 WPA partitioning might put each clone into different unit and
942 we might end up streaming inline clone from other partition
943 to support clone we are interested in. */
945 || node->clone_of->decl != node->decl))
947 DECL_EXTERNAL (node->decl) = 1;
948 TREE_STATIC (node->decl) = 0;
950 node->alias = bp_unpack_value (bp, 1);
951 node->finalized_by_frontend = bp_unpack_value (bp, 1);
952 node->frequency = (enum node_frequency)bp_unpack_value (bp, 2);
953 node->only_called_at_startup = bp_unpack_value (bp, 1);
954 node->only_called_at_exit = bp_unpack_value (bp, 1);
955 node->resolution = resolution;
958 /* Output the part of the cgraph in SET. */
961 output_varpool (cgraph_node_set set, varpool_node_set vset)
963 struct lto_simple_output_block *ob = lto_create_simple_output_block (LTO_section_varpool);
964 lto_varpool_encoder_t varpool_encoder = ob->decl_state->varpool_node_encoder;
965 int len = lto_varpool_encoder_size (varpool_encoder), i;
967 lto_output_uleb128_stream (ob->main_stream, len);
969 /* Write out the nodes. We must first output a node and then its clones,
970 otherwise at a time reading back the node there would be nothing to clone
972 for (i = 0; i < len; i++)
974 lto_output_varpool_node (ob, lto_varpool_encoder_deref (varpool_encoder, i),
979 lto_destroy_simple_output_block (ob);
982 /* Read a node from input_block IB. TAG is the node's tag just read.
983 Return the node read or overwriten. */
985 static struct cgraph_node *
986 input_node (struct lto_file_decl_data *file_data,
987 struct lto_input_block *ib,
988 enum LTO_cgraph_tags tag,
989 VEC(cgraph_node_ptr, heap) *nodes)
992 struct cgraph_node *node;
995 int ref = LCC_NOT_FOUND, ref2 = LCC_NOT_FOUND;
996 unsigned long same_body_count = 0;
998 enum ld_plugin_symbol_resolution resolution;
1000 clone_ref = lto_input_sleb128 (ib);
1002 decl_index = lto_input_uleb128 (ib);
1003 fn_decl = lto_file_decl_data_get_fn_decl (file_data, decl_index);
1005 if (clone_ref != LCC_NOT_FOUND)
1007 node = cgraph_clone_node (VEC_index (cgraph_node_ptr, nodes, clone_ref), fn_decl,
1008 0, CGRAPH_FREQ_BASE, 0, false, NULL);
1011 node = cgraph_get_create_node (fn_decl);
1013 node->count = lto_input_sleb128 (ib);
1014 node->count_materialization_scale = lto_input_sleb128 (ib);
1016 if (tag == LTO_cgraph_analyzed_node)
1017 ref = lto_input_sleb128 (ib);
1019 ref2 = lto_input_sleb128 (ib);
1021 /* Make sure that we have not read this node before. Nodes that
1022 have already been read will have their tag stored in the 'aux'
1023 field. Since built-in functions can be referenced in multiple
1024 functions, they are expected to be read more than once. */
1025 if (node->aux && !DECL_IS_BUILTIN (node->decl))
1026 internal_error ("bytecode stream: found multiple instances of cgraph "
1027 "node %d", node->uid);
1029 bp = lto_input_bitpack (ib);
1030 resolution = (enum ld_plugin_symbol_resolution)lto_input_uleb128 (ib);
1031 input_overwrite_node (file_data, node, tag, &bp, resolution);
1033 /* Store a reference for now, and fix up later to be a pointer. */
1034 node->global.inlined_to = (cgraph_node_ptr) (intptr_t) ref;
1036 /* Store a reference for now, and fix up later to be a pointer. */
1037 node->same_comdat_group = (cgraph_node_ptr) (intptr_t) ref2;
1039 same_body_count = lto_input_uleb128 (ib);
1040 while (same_body_count-- > 0)
1044 struct cgraph_node *alias;
1045 decl_index = lto_input_uleb128 (ib);
1046 alias_decl = lto_file_decl_data_get_fn_decl (file_data, decl_index);
1047 type = lto_input_uleb128 (ib);
1051 decl_index = lto_input_uleb128 (ib);
1052 real_alias = lto_file_decl_data_get_fn_decl (file_data, decl_index);
1053 alias = cgraph_same_body_alias (node, alias_decl, real_alias);
1057 HOST_WIDE_INT fixed_offset = lto_input_uleb128 (ib);
1058 HOST_WIDE_INT virtual_value = lto_input_uleb128 (ib);
1060 decl_index = lto_input_uleb128 (ib);
1061 real_alias = lto_file_decl_data_get_fn_decl (file_data, decl_index);
1062 alias = cgraph_add_thunk (node, alias_decl, fn_decl, type & 2, fixed_offset,
1064 (type & 4) ? size_int (virtual_value) : NULL_TREE,
1068 alias->resolution = (enum ld_plugin_symbol_resolution)lto_input_uleb128 (ib);
1073 /* Read a node from input_block IB. TAG is the node's tag just read.
1074 Return the node read or overwriten. */
1076 static struct varpool_node *
1077 input_varpool_node (struct lto_file_decl_data *file_data,
1078 struct lto_input_block *ib)
1082 struct varpool_node *node;
1083 struct bitpack_d bp;
1086 int ref = LCC_NOT_FOUND;
1088 decl_index = lto_input_uleb128 (ib);
1089 var_decl = lto_file_decl_data_get_var_decl (file_data, decl_index);
1090 node = varpool_node (var_decl);
1091 node->lto_file_data = file_data;
1093 bp = lto_input_bitpack (ib);
1094 node->externally_visible = bp_unpack_value (&bp, 1);
1095 node->force_output = bp_unpack_value (&bp, 1);
1096 node->finalized = bp_unpack_value (&bp, 1);
1097 node->alias = bp_unpack_value (&bp, 1);
1098 node->analyzed = node->finalized;
1099 node->used_from_other_partition = bp_unpack_value (&bp, 1);
1100 node->in_other_partition = bp_unpack_value (&bp, 1);
1101 if (node->in_other_partition)
1103 DECL_EXTERNAL (node->decl) = 1;
1104 TREE_STATIC (node->decl) = 0;
1106 aliases_p = bp_unpack_value (&bp, 1);
1107 if (node->finalized)
1108 varpool_mark_needed_node (node);
1109 ref = lto_input_sleb128 (ib);
1110 /* Store a reference for now, and fix up later to be a pointer. */
1111 node->same_comdat_group = (struct varpool_node *) (intptr_t) ref;
1112 node->resolution = (enum ld_plugin_symbol_resolution)lto_input_uleb128 (ib);
1115 count = lto_input_uleb128 (ib);
1116 for (; count > 0; count --)
1118 tree decl = lto_file_decl_data_get_var_decl (file_data,
1119 lto_input_uleb128 (ib));
1120 struct varpool_node *alias;
1121 alias = varpool_extra_name_alias (decl, var_decl);
1122 alias->resolution = (enum ld_plugin_symbol_resolution)lto_input_uleb128 (ib);
1128 /* Read a node from input_block IB. TAG is the node's tag just read.
1129 Return the node read or overwriten. */
1132 input_ref (struct lto_input_block *ib,
1133 struct cgraph_node *refering_node,
1134 struct varpool_node *refering_varpool_node,
1135 VEC(cgraph_node_ptr, heap) *nodes,
1136 VEC(varpool_node_ptr, heap) *varpool_nodes)
1138 struct cgraph_node *node = NULL;
1139 struct varpool_node *varpool_node = NULL;
1140 struct bitpack_d bp;
1141 enum ipa_ref_type type;
1142 enum ipa_ref_use use;
1144 bp = lto_input_bitpack (ib);
1145 type = (enum ipa_ref_type) bp_unpack_value (&bp, 1);
1146 use = (enum ipa_ref_use) bp_unpack_value (&bp, 2);
1147 if (type == IPA_REF_CGRAPH)
1148 node = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
1150 varpool_node = VEC_index (varpool_node_ptr, varpool_nodes, lto_input_sleb128 (ib));
1151 ipa_record_reference (refering_node, refering_varpool_node,
1152 node, varpool_node, use, NULL);
1155 /* Read an edge from IB. NODES points to a vector of previously read nodes for
1156 decoding caller and callee of the edge to be read. If INDIRECT is true, the
1157 edge being read is indirect (in the sense that it has
1158 indirect_unknown_callee set). */
1161 input_edge (struct lto_input_block *ib, VEC(cgraph_node_ptr, heap) *nodes,
1164 struct cgraph_node *caller, *callee;
1165 struct cgraph_edge *edge;
1166 unsigned int stmt_id;
1170 cgraph_inline_failed_t inline_failed;
1171 struct bitpack_d bp;
1173 int call_stmt_time, call_stmt_size;
1175 caller = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
1176 if (caller == NULL || caller->decl == NULL_TREE)
1177 internal_error ("bytecode stream: no caller found while reading edge");
1181 callee = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
1182 if (callee == NULL || callee->decl == NULL_TREE)
1183 internal_error ("bytecode stream: no callee found while reading edge");
1188 count = (gcov_type) lto_input_sleb128 (ib);
1190 bp = lto_input_bitpack (ib);
1191 stmt_id = (unsigned int) bp_unpack_value (&bp, HOST_BITS_PER_INT);
1192 inline_failed = (cgraph_inline_failed_t) bp_unpack_value (&bp,
1194 freq = (int) bp_unpack_value (&bp, HOST_BITS_PER_INT);
1195 call_stmt_size = (int) bp_unpack_value (&bp, HOST_BITS_PER_INT);
1196 call_stmt_time = (int) bp_unpack_value (&bp, HOST_BITS_PER_INT);
1197 nest = (unsigned) bp_unpack_value (&bp, 30);
1200 edge = cgraph_create_indirect_edge (caller, NULL, 0, count, freq, nest);
1202 edge = cgraph_create_edge (caller, callee, NULL, count, freq, nest);
1204 edge->indirect_inlining_edge = bp_unpack_value (&bp, 1);
1205 edge->lto_stmt_uid = stmt_id;
1206 edge->inline_failed = inline_failed;
1207 edge->call_stmt_cannot_inline_p = bp_unpack_value (&bp, 1);
1208 edge->can_throw_external = bp_unpack_value (&bp, 1);
1209 edge->call_stmt_size = call_stmt_size;
1210 edge->call_stmt_time = call_stmt_time;
1213 if (bp_unpack_value (&bp, 1))
1214 ecf_flags |= ECF_CONST;
1215 if (bp_unpack_value (&bp, 1))
1216 ecf_flags |= ECF_PURE;
1217 if (bp_unpack_value (&bp, 1))
1218 ecf_flags |= ECF_NORETURN;
1219 if (bp_unpack_value (&bp, 1))
1220 ecf_flags |= ECF_MALLOC;
1221 if (bp_unpack_value (&bp, 1))
1222 ecf_flags |= ECF_NOTHROW;
1223 if (bp_unpack_value (&bp, 1))
1224 ecf_flags |= ECF_RETURNS_TWICE;
1225 edge->indirect_info->ecf_flags = ecf_flags;
1230 /* Read a cgraph from IB using the info in FILE_DATA. */
1232 static VEC(cgraph_node_ptr, heap) *
1233 input_cgraph_1 (struct lto_file_decl_data *file_data,
1234 struct lto_input_block *ib)
1236 enum LTO_cgraph_tags tag;
1237 VEC(cgraph_node_ptr, heap) *nodes = NULL;
1238 struct cgraph_node *node;
1240 unsigned HOST_WIDE_INT len;
1242 tag = (enum LTO_cgraph_tags) lto_input_uleb128 (ib);
1245 if (tag == LTO_cgraph_edge)
1246 input_edge (ib, nodes, false);
1247 else if (tag == LTO_cgraph_indirect_edge)
1248 input_edge (ib, nodes, true);
1251 node = input_node (file_data, ib, tag,nodes);
1252 if (node == NULL || node->decl == NULL_TREE)
1253 internal_error ("bytecode stream: found empty cgraph node");
1254 VEC_safe_push (cgraph_node_ptr, heap, nodes, node);
1255 lto_cgraph_encoder_encode (file_data->cgraph_node_encoder, node);
1258 tag = (enum LTO_cgraph_tags) lto_input_uleb128 (ib);
1261 /* Input toplevel asms. */
1262 len = lto_input_uleb128 (ib);
1265 char *str = (char *)xmalloc (len + 1);
1266 for (i = 0; i < len; ++i)
1267 str[i] = lto_input_1_unsigned (ib);
1268 cgraph_add_asm_node (build_string (len, str));
1271 len = lto_input_uleb128 (ib);
1273 /* AUX pointers should be all non-zero for nodes read from the stream. */
1274 #ifdef ENABLE_CHECKING
1275 FOR_EACH_VEC_ELT (cgraph_node_ptr, nodes, i, node)
1276 gcc_assert (node->aux);
1278 FOR_EACH_VEC_ELT (cgraph_node_ptr, nodes, i, node)
1280 int ref = (int) (intptr_t) node->global.inlined_to;
1282 /* We share declaration of builtins, so we may read same node twice. */
1287 /* Fixup inlined_to from reference to pointer. */
1288 if (ref != LCC_NOT_FOUND)
1289 node->global.inlined_to = VEC_index (cgraph_node_ptr, nodes, ref);
1291 node->global.inlined_to = NULL;
1293 ref = (int) (intptr_t) node->same_comdat_group;
1295 /* Fixup same_comdat_group from reference to pointer. */
1296 if (ref != LCC_NOT_FOUND)
1297 node->same_comdat_group = VEC_index (cgraph_node_ptr, nodes, ref);
1299 node->same_comdat_group = NULL;
1301 FOR_EACH_VEC_ELT (cgraph_node_ptr, nodes, i, node)
1302 node->aux = (void *)1;
1306 /* Read a varpool from IB using the info in FILE_DATA. */
1308 static VEC(varpool_node_ptr, heap) *
1309 input_varpool_1 (struct lto_file_decl_data *file_data,
1310 struct lto_input_block *ib)
1312 unsigned HOST_WIDE_INT len;
1313 VEC(varpool_node_ptr, heap) *varpool = NULL;
1315 struct varpool_node *node;
1317 len = lto_input_uleb128 (ib);
1320 VEC_safe_push (varpool_node_ptr, heap, varpool,
1321 input_varpool_node (file_data, ib));
1324 #ifdef ENABLE_CHECKING
1325 FOR_EACH_VEC_ELT (varpool_node_ptr, varpool, i, node)
1326 gcc_assert (!node->aux);
1328 FOR_EACH_VEC_ELT (varpool_node_ptr, varpool, i, node)
1330 int ref = (int) (intptr_t) node->same_comdat_group;
1331 /* We share declaration of builtins, so we may read same node twice. */
1334 node->aux = (void *)1;
1336 /* Fixup same_comdat_group from reference to pointer. */
1337 if (ref != LCC_NOT_FOUND)
1338 node->same_comdat_group = VEC_index (varpool_node_ptr, varpool, ref);
1340 node->same_comdat_group = NULL;
1342 FOR_EACH_VEC_ELT (varpool_node_ptr, varpool, i, node)
1347 /* Input ipa_refs. */
1350 input_refs (struct lto_input_block *ib,
1351 VEC(cgraph_node_ptr, heap) *nodes,
1352 VEC(varpool_node_ptr, heap) *varpool)
1358 struct cgraph_node *node;
1359 count = lto_input_uleb128 (ib);
1362 idx = lto_input_uleb128 (ib);
1363 node = VEC_index (cgraph_node_ptr, nodes, idx);
1366 input_ref (ib, node, NULL, nodes, varpool);
1372 struct varpool_node *node;
1373 count = lto_input_uleb128 (ib);
1376 node = VEC_index (varpool_node_ptr, varpool, lto_input_uleb128 (ib));
1379 input_ref (ib, NULL, node, nodes, varpool);
1386 static struct gcov_ctr_summary lto_gcov_summary;
1388 /* Input profile_info from IB. */
1390 input_profile_summary (struct lto_input_block *ib,
1391 struct lto_file_decl_data *file_data)
1393 unsigned int runs = lto_input_uleb128 (ib);
1396 file_data->profile_info.runs = runs;
1397 file_data->profile_info.sum_max = lto_input_uleb128 (ib);
1402 /* Rescale profile summaries to the same number of runs in the whole unit. */
1405 merge_profile_summaries (struct lto_file_decl_data **file_data_vec)
1407 struct lto_file_decl_data *file_data;
1409 gcov_unsigned_t max_runs = 0;
1410 struct cgraph_node *node;
1411 struct cgraph_edge *edge;
1413 /* Find unit with maximal number of runs. If we ever get serious about
1414 roundoff errors, we might also consider computing smallest common
1416 for (j = 0; (file_data = file_data_vec[j]) != NULL; j++)
1417 if (max_runs < file_data->profile_info.runs)
1418 max_runs = file_data->profile_info.runs;
1423 /* Simple overflow check. We probably don't need to support that many train
1424 runs. Such a large value probably imply data corruption anyway. */
1425 if (max_runs > INT_MAX / REG_BR_PROB_BASE)
1427 sorry ("At most %i profile runs is supported. Perhaps corrupted profile?",
1428 INT_MAX / REG_BR_PROB_BASE);
1432 profile_info = <o_gcov_summary;
1433 lto_gcov_summary.runs = max_runs;
1434 lto_gcov_summary.sum_max = 0;
1436 /* Rescale all units to the maximal number of runs.
1437 sum_max can not be easily merged, as we have no idea what files come from
1438 the same run. We do not use the info anyway, so leave it 0. */
1439 for (j = 0; (file_data = file_data_vec[j]) != NULL; j++)
1440 if (file_data->profile_info.runs)
1442 int scale = ((REG_BR_PROB_BASE * max_runs
1443 + file_data->profile_info.runs / 2)
1444 / file_data->profile_info.runs);
1445 lto_gcov_summary.sum_max = MAX (lto_gcov_summary.sum_max,
1446 (file_data->profile_info.sum_max
1448 + REG_BR_PROB_BASE / 2)
1449 / REG_BR_PROB_BASE);
1452 /* Watch roundoff errors. */
1453 if (lto_gcov_summary.sum_max < max_runs)
1454 lto_gcov_summary.sum_max = max_runs;
1456 /* If merging already happent at WPA time, we are done. */
1460 /* Now compute count_materialization_scale of each node.
1461 During LTRANS we already have values of count_materialization_scale
1462 computed, so just update them. */
1463 for (node = cgraph_nodes; node; node = node->next)
1464 if (node->local.lto_file_data
1465 && node->local.lto_file_data->profile_info.runs)
1470 ((node->count_materialization_scale * max_runs
1471 + node->local.lto_file_data->profile_info.runs / 2)
1472 / node->local.lto_file_data->profile_info.runs);
1473 node->count_materialization_scale = scale;
1475 fatal_error ("Profile information in %s corrupted",
1476 file_data->file_name);
1478 if (scale == REG_BR_PROB_BASE)
1480 for (edge = node->callees; edge; edge = edge->next_callee)
1481 edge->count = ((edge->count * scale + REG_BR_PROB_BASE / 2)
1482 / REG_BR_PROB_BASE);
1483 node->count = ((node->count * scale + REG_BR_PROB_BASE / 2)
1484 / REG_BR_PROB_BASE);
1488 /* Input and merge the cgraph from each of the .o files passed to
1494 struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
1495 struct lto_file_decl_data *file_data;
1497 struct cgraph_node *node;
1499 while ((file_data = file_data_vec[j++]))
1503 struct lto_input_block *ib;
1504 VEC(cgraph_node_ptr, heap) *nodes;
1505 VEC(varpool_node_ptr, heap) *varpool;
1507 ib = lto_create_simple_input_block (file_data, LTO_section_cgraph,
1510 fatal_error ("cannot find LTO cgraph in %s", file_data->file_name);
1511 input_profile_summary (ib, file_data);
1512 file_data->cgraph_node_encoder = lto_cgraph_encoder_new ();
1513 nodes = input_cgraph_1 (file_data, ib);
1514 lto_destroy_simple_input_block (file_data, LTO_section_cgraph,
1517 ib = lto_create_simple_input_block (file_data, LTO_section_varpool,
1520 fatal_error ("cannot find LTO varpool in %s", file_data->file_name);
1521 varpool = input_varpool_1 (file_data, ib);
1522 lto_destroy_simple_input_block (file_data, LTO_section_varpool,
1525 ib = lto_create_simple_input_block (file_data, LTO_section_refs,
1528 fatal_error("cannot find LTO section refs in %s", file_data->file_name);
1529 input_refs (ib, nodes, varpool);
1530 lto_destroy_simple_input_block (file_data, LTO_section_refs,
1533 input_cgraph_opt_summary (nodes);
1534 VEC_free (cgraph_node_ptr, heap, nodes);
1535 VEC_free (varpool_node_ptr, heap, varpool);
1538 merge_profile_summaries (file_data_vec);
1540 /* Clear out the aux field that was used to store enough state to
1541 tell which nodes should be overwritten. */
1542 for (node = cgraph_nodes; node; node = node->next)
1544 /* Some nodes may have been created by cgraph_node. This
1545 happens when the callgraph contains nested functions. If the
1546 node for the parent function was never emitted to the gimple
1547 file, cgraph_node will create a node for it when setting the
1548 context of the nested function. */
1549 if (node->local.lto_file_data)
1554 /* True when we need optimization summary for NODE. */
1557 output_cgraph_opt_summary_p (struct cgraph_node *node, cgraph_node_set set)
1559 struct cgraph_edge *e;
1561 if (cgraph_node_in_set_p (node, set))
1563 for (e = node->callees; e; e = e->next_callee)
1564 if (e->indirect_info
1565 && e->indirect_info->thunk_delta != 0)
1568 for (e = node->indirect_calls; e; e = e->next_callee)
1569 if (e->indirect_info->thunk_delta != 0)
1573 return (node->clone_of
1574 && (node->clone.tree_map
1575 || node->clone.args_to_skip
1576 || node->clone.combined_args_to_skip));
1579 /* Output optimization summary for EDGE to OB. */
1581 output_edge_opt_summary (struct output_block *ob,
1582 struct cgraph_edge *edge)
1584 if (edge->indirect_info)
1585 lto_output_sleb128_stream (ob->main_stream,
1586 edge->indirect_info->thunk_delta);
1588 lto_output_sleb128_stream (ob->main_stream, 0);
1591 /* Output optimization summary for NODE to OB. */
1594 output_node_opt_summary (struct output_block *ob,
1595 struct cgraph_node *node,
1596 cgraph_node_set set)
1600 struct ipa_replace_map *map;
1601 struct bitpack_d bp;
1603 struct cgraph_edge *e;
1605 lto_output_uleb128_stream (ob->main_stream,
1606 bitmap_count_bits (node->clone.args_to_skip));
1607 EXECUTE_IF_SET_IN_BITMAP (node->clone.args_to_skip, 0, index, bi)
1608 lto_output_uleb128_stream (ob->main_stream, index);
1609 lto_output_uleb128_stream (ob->main_stream,
1610 bitmap_count_bits (node->clone.combined_args_to_skip));
1611 EXECUTE_IF_SET_IN_BITMAP (node->clone.combined_args_to_skip, 0, index, bi)
1612 lto_output_uleb128_stream (ob->main_stream, index);
1613 lto_output_uleb128_stream (ob->main_stream,
1614 VEC_length (ipa_replace_map_p, node->clone.tree_map));
1615 FOR_EACH_VEC_ELT (ipa_replace_map_p, node->clone.tree_map, i, map)
1620 for (parm_num = 0, parm = DECL_ARGUMENTS (node->decl); parm;
1621 parm = DECL_CHAIN (parm), parm_num++)
1622 if (map->old_tree == parm)
1624 /* At the moment we assume all old trees to be PARM_DECLs, because we have no
1625 mechanism to store function local declarations into summaries. */
1627 lto_output_uleb128_stream (ob->main_stream, parm_num);
1628 lto_output_tree (ob, map->new_tree, true);
1629 bp = bitpack_create (ob->main_stream);
1630 bp_pack_value (&bp, map->replace_p, 1);
1631 bp_pack_value (&bp, map->ref_p, 1);
1632 lto_output_bitpack (&bp);
1635 if (cgraph_node_in_set_p (node, set))
1637 for (e = node->callees; e; e = e->next_callee)
1638 output_edge_opt_summary (ob, e);
1639 for (e = node->indirect_calls; e; e = e->next_callee)
1640 output_edge_opt_summary (ob, e);
1644 /* Output optimization summaries stored in callgraph.
1645 At the moment it is the clone info structure. */
1648 output_cgraph_opt_summary (cgraph_node_set set)
1650 struct cgraph_node *node;
1652 lto_cgraph_encoder_t encoder;
1653 struct output_block *ob = create_output_block (LTO_section_cgraph_opt_sum);
1656 ob->cgraph_node = NULL;
1657 encoder = ob->decl_state->cgraph_node_encoder;
1658 n_nodes = lto_cgraph_encoder_size (encoder);
1659 for (i = 0; i < n_nodes; i++)
1660 if (output_cgraph_opt_summary_p (lto_cgraph_encoder_deref (encoder, i),
1663 lto_output_uleb128_stream (ob->main_stream, count);
1664 for (i = 0; i < n_nodes; i++)
1666 node = lto_cgraph_encoder_deref (encoder, i);
1667 if (output_cgraph_opt_summary_p (node, set))
1669 lto_output_uleb128_stream (ob->main_stream, i);
1670 output_node_opt_summary (ob, node, set);
1673 produce_asm (ob, NULL);
1674 destroy_output_block (ob);
1677 /* Input optimisation summary of EDGE. */
1680 input_edge_opt_summary (struct cgraph_edge *edge,
1681 struct lto_input_block *ib_main)
1683 HOST_WIDE_INT thunk_delta;
1684 thunk_delta = lto_input_sleb128 (ib_main);
1685 if (thunk_delta != 0)
1687 gcc_assert (!edge->indirect_info);
1688 edge->indirect_info = cgraph_allocate_init_indirect_info ();
1689 edge->indirect_info->thunk_delta = thunk_delta;
1693 /* Input optimisation summary of NODE. */
1696 input_node_opt_summary (struct cgraph_node *node,
1697 struct lto_input_block *ib_main,
1698 struct data_in *data_in)
1703 struct bitpack_d bp;
1704 struct cgraph_edge *e;
1706 count = lto_input_uleb128 (ib_main);
1708 node->clone.args_to_skip = BITMAP_GGC_ALLOC ();
1709 for (i = 0; i < count; i++)
1711 bit = lto_input_uleb128 (ib_main);
1712 bitmap_set_bit (node->clone.args_to_skip, bit);
1714 count = lto_input_uleb128 (ib_main);
1716 node->clone.combined_args_to_skip = BITMAP_GGC_ALLOC ();
1717 for (i = 0; i < count; i++)
1719 bit = lto_input_uleb128 (ib_main);
1720 bitmap_set_bit (node->clone.combined_args_to_skip, bit);
1722 count = lto_input_uleb128 (ib_main);
1723 for (i = 0; i < count; i++)
1727 struct ipa_replace_map *map = ggc_alloc_ipa_replace_map ();
1729 VEC_safe_push (ipa_replace_map_p, gc, node->clone.tree_map, map);
1730 for (parm_num = 0, parm = DECL_ARGUMENTS (node->decl); parm_num;
1731 parm = DECL_CHAIN (parm))
1733 map->parm_num = lto_input_uleb128 (ib_main);
1734 map->old_tree = NULL;
1735 map->new_tree = lto_input_tree (ib_main, data_in);
1736 bp = lto_input_bitpack (ib_main);
1737 map->replace_p = bp_unpack_value (&bp, 1);
1738 map->ref_p = bp_unpack_value (&bp, 1);
1740 for (e = node->callees; e; e = e->next_callee)
1741 input_edge_opt_summary (e, ib_main);
1742 for (e = node->indirect_calls; e; e = e->next_callee)
1743 input_edge_opt_summary (e, ib_main);
1746 /* Read section in file FILE_DATA of length LEN with data DATA. */
1749 input_cgraph_opt_section (struct lto_file_decl_data *file_data,
1750 const char *data, size_t len, VEC (cgraph_node_ptr,
1753 const struct lto_function_header *header =
1754 (const struct lto_function_header *) data;
1755 const int32_t cfg_offset = sizeof (struct lto_function_header);
1756 const int32_t main_offset = cfg_offset + header->cfg_size;
1757 const int32_t string_offset = main_offset + header->main_size;
1758 struct data_in *data_in;
1759 struct lto_input_block ib_main;
1763 LTO_INIT_INPUT_BLOCK (ib_main, (const char *) data + main_offset, 0,
1767 lto_data_in_create (file_data, (const char *) data + string_offset,
1768 header->string_size, NULL);
1769 count = lto_input_uleb128 (&ib_main);
1771 for (i = 0; i < count; i++)
1773 int ref = lto_input_uleb128 (&ib_main);
1774 input_node_opt_summary (VEC_index (cgraph_node_ptr, nodes, ref),
1777 lto_free_section_data (file_data, LTO_section_cgraph_opt_sum, NULL, data,
1779 lto_data_in_delete (data_in);
1782 /* Input optimization summary of cgraph. */
1785 input_cgraph_opt_summary (VEC (cgraph_node_ptr, heap) * nodes)
1787 struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
1788 struct lto_file_decl_data *file_data;
1791 while ((file_data = file_data_vec[j++]))
1795 lto_get_section_data (file_data, LTO_section_cgraph_opt_sum, NULL,
1799 input_cgraph_opt_section (file_data, data, len, nodes);