1 /* Write and read the cgraph to the memory mapped representation of a
4 Copyright 2009 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"
34 #include "langhooks.h"
35 #include "basic-block.h"
36 #include "tree-flow.h"
40 #include "diagnostic.h"
45 #include "pointer-set.h"
46 #include "lto-streamer.h"
49 static void output_varpool (cgraph_node_set, varpool_node_set);
50 static void output_cgraph_opt_summary (void);
51 static void input_cgraph_opt_summary (VEC (cgraph_node_ptr, heap) * nodes);
54 /* Cgraph streaming is organized as set of record whose type
55 is indicated by a tag. */
58 /* Must leave 0 for the stopper. */
60 /* Cgraph node without body available. */
61 LTO_cgraph_unavail_node = 1,
62 /* Cgraph node with function body. */
63 LTO_cgraph_analyzed_node,
66 LTO_cgraph_indirect_edge
69 /* Create a new cgraph encoder. */
72 lto_cgraph_encoder_new (void)
74 lto_cgraph_encoder_t encoder = XCNEW (struct lto_cgraph_encoder_d);
75 encoder->map = pointer_map_create ();
76 encoder->nodes = NULL;
77 encoder->body = pointer_set_create ();
82 /* Delete ENCODER and its components. */
85 lto_cgraph_encoder_delete (lto_cgraph_encoder_t encoder)
87 VEC_free (cgraph_node_ptr, heap, encoder->nodes);
88 pointer_map_destroy (encoder->map);
89 pointer_set_destroy (encoder->body);
94 /* Return the existing reference number of NODE in the cgraph encoder in
95 output block OB. Assign a new reference if this is the first time
99 lto_cgraph_encoder_encode (lto_cgraph_encoder_t encoder,
100 struct cgraph_node *node)
105 slot = pointer_map_contains (encoder->map, node);
108 ref = VEC_length (cgraph_node_ptr, encoder->nodes);
109 slot = pointer_map_insert (encoder->map, node);
110 *slot = (void *) (intptr_t) ref;
111 VEC_safe_push (cgraph_node_ptr, heap, encoder->nodes, node);
114 ref = (int) (intptr_t) *slot;
119 #define LCC_NOT_FOUND (-1)
121 /* Look up NODE in encoder. Return NODE's reference if it has been encoded
122 or LCC_NOT_FOUND if it is not there. */
125 lto_cgraph_encoder_lookup (lto_cgraph_encoder_t encoder,
126 struct cgraph_node *node)
128 void **slot = pointer_map_contains (encoder->map, node);
129 return (slot ? (int) (intptr_t) *slot : LCC_NOT_FOUND);
133 /* Return the cgraph node corresponding to REF using ENCODER. */
136 lto_cgraph_encoder_deref (lto_cgraph_encoder_t encoder, int ref)
138 if (ref == LCC_NOT_FOUND)
141 return VEC_index (cgraph_node_ptr, encoder->nodes, ref);
145 /* Return TRUE if we should encode initializer of NODE (if any). */
148 lto_cgraph_encoder_encode_body_p (lto_cgraph_encoder_t encoder,
149 struct cgraph_node *node)
151 return pointer_set_contains (encoder->body, node);
154 /* Return TRUE if we should encode body of NODE (if any). */
157 lto_set_cgraph_encoder_encode_body (lto_cgraph_encoder_t encoder,
158 struct cgraph_node *node)
160 pointer_set_insert (encoder->body, node);
163 /* Create a new varpool encoder. */
165 lto_varpool_encoder_t
166 lto_varpool_encoder_new (void)
168 lto_varpool_encoder_t encoder = XCNEW (struct lto_varpool_encoder_d);
169 encoder->map = pointer_map_create ();
170 encoder->initializer = pointer_set_create ();
171 encoder->nodes = NULL;
176 /* Delete ENCODER and its components. */
179 lto_varpool_encoder_delete (lto_varpool_encoder_t encoder)
181 VEC_free (varpool_node_ptr, heap, encoder->nodes);
182 pointer_map_destroy (encoder->map);
183 pointer_set_destroy (encoder->initializer);
188 /* Return the existing reference number of NODE in the varpool encoder in
189 output block OB. Assign a new reference if this is the first time
193 lto_varpool_encoder_encode (lto_varpool_encoder_t encoder,
194 struct varpool_node *node)
199 slot = pointer_map_contains (encoder->map, node);
202 ref = VEC_length (varpool_node_ptr, encoder->nodes);
203 slot = pointer_map_insert (encoder->map, node);
204 *slot = (void *) (intptr_t) ref;
205 VEC_safe_push (varpool_node_ptr, heap, encoder->nodes, node);
208 ref = (int) (intptr_t) *slot;
213 /* Look up NODE in encoder. Return NODE's reference if it has been encoded
214 or LCC_NOT_FOUND if it is not there. */
217 lto_varpool_encoder_lookup (lto_varpool_encoder_t encoder,
218 struct varpool_node *node)
220 void **slot = pointer_map_contains (encoder->map, node);
221 return (slot ? (int) (intptr_t) *slot : LCC_NOT_FOUND);
225 /* Return the varpool node corresponding to REF using ENCODER. */
227 struct varpool_node *
228 lto_varpool_encoder_deref (lto_varpool_encoder_t encoder, int ref)
230 if (ref == LCC_NOT_FOUND)
233 return VEC_index (varpool_node_ptr, encoder->nodes, ref);
237 /* Return number of encoded nodes in ENCODER. */
240 lto_varpool_encoder_size (lto_varpool_encoder_t encoder)
242 return VEC_length (varpool_node_ptr, encoder->nodes);
245 /* Return TRUE if we should encode initializer of NODE (if any). */
248 lto_varpool_encoder_encode_initializer_p (lto_varpool_encoder_t encoder,
249 struct varpool_node *node)
251 return pointer_set_contains (encoder->initializer, node);
254 /* Return TRUE if we should encode initializer of NODE (if any). */
257 lto_set_varpool_encoder_encode_initializer (lto_varpool_encoder_t encoder,
258 struct varpool_node *node)
260 pointer_set_insert (encoder->initializer, node);
263 /* Output the cgraph EDGE to OB using ENCODER. */
266 lto_output_edge (struct lto_simple_output_block *ob, struct cgraph_edge *edge,
267 lto_cgraph_encoder_t encoder)
271 struct bitpack_d *bp;
273 if (edge->indirect_unknown_callee)
274 lto_output_uleb128_stream (ob->main_stream, LTO_cgraph_indirect_edge);
276 lto_output_uleb128_stream (ob->main_stream, LTO_cgraph_edge);
278 ref = lto_cgraph_encoder_lookup (encoder, edge->caller);
279 gcc_assert (ref != LCC_NOT_FOUND);
280 lto_output_sleb128_stream (ob->main_stream, ref);
282 if (!edge->indirect_unknown_callee)
284 ref = lto_cgraph_encoder_lookup (encoder, edge->callee);
285 gcc_assert (ref != LCC_NOT_FOUND);
286 lto_output_sleb128_stream (ob->main_stream, ref);
289 lto_output_sleb128_stream (ob->main_stream, edge->count);
291 bp = bitpack_create ();
292 uid = flag_wpa ? edge->lto_stmt_uid : gimple_uid (edge->call_stmt);
293 bp_pack_value (bp, uid, HOST_BITS_PER_INT);
294 bp_pack_value (bp, edge->inline_failed, HOST_BITS_PER_INT);
295 bp_pack_value (bp, edge->frequency, HOST_BITS_PER_INT);
296 bp_pack_value (bp, edge->loop_nest, 30);
297 bp_pack_value (bp, edge->indirect_inlining_edge, 1);
298 bp_pack_value (bp, edge->call_stmt_cannot_inline_p, 1);
299 bp_pack_value (bp, edge->can_throw_external, 1);
300 if (edge->indirect_unknown_callee)
302 int flags = edge->indirect_info->ecf_flags;
303 bp_pack_value (bp, (flags & ECF_CONST) != 0, 1);
304 bp_pack_value (bp, (flags & ECF_PURE) != 0, 1);
305 bp_pack_value (bp, (flags & ECF_NORETURN) != 0, 1);
306 bp_pack_value (bp, (flags & ECF_MALLOC) != 0, 1);
307 bp_pack_value (bp, (flags & ECF_NOTHROW) != 0, 1);
308 bp_pack_value (bp, (flags & ECF_RETURNS_TWICE) != 0, 1);
309 /* Flags that should not appear on indirect calls. */
310 gcc_assert (!(flags & (ECF_LOOPING_CONST_OR_PURE
315 lto_output_bitpack (ob->main_stream, bp);
319 /* Return if LIST contain references from other partitions. */
322 referenced_from_other_partition_p (struct ipa_ref_list *list, cgraph_node_set set,
323 varpool_node_set vset)
327 for (i = 0; ipa_ref_list_refering_iterate (list, i, ref); i++)
329 if (ref->refering_type == IPA_REF_CGRAPH)
331 if (!cgraph_node_in_set_p (ipa_ref_refering_node (ref), set))
336 if (!varpool_node_in_set_p (ipa_ref_refering_varpool_node (ref),
344 /* Return true when node is reachable from other partition. */
347 reachable_from_other_partition_p (struct cgraph_node *node, cgraph_node_set set)
349 struct cgraph_edge *e;
352 if (node->global.inlined_to)
354 for (e = node->callers; e; e = e->next_caller)
355 if (!cgraph_node_in_set_p (e->caller, set))
360 /* Return if LIST contain references from other partitions. */
363 referenced_from_this_partition_p (struct ipa_ref_list *list, cgraph_node_set set,
364 varpool_node_set vset)
368 for (i = 0; ipa_ref_list_refering_iterate (list, i, ref); i++)
370 if (ref->refering_type == IPA_REF_CGRAPH)
372 if (cgraph_node_in_set_p (ipa_ref_refering_node (ref), set))
377 if (varpool_node_in_set_p (ipa_ref_refering_varpool_node (ref),
385 /* Return true when node is reachable from other partition. */
388 reachable_from_this_partition_p (struct cgraph_node *node, cgraph_node_set set)
390 struct cgraph_edge *e;
393 if (node->global.inlined_to)
395 for (e = node->callers; e; e = e->next_caller)
396 if (cgraph_node_in_set_p (e->caller, set))
401 /* Output the cgraph NODE to OB. ENCODER is used to find the
402 reference number of NODE->inlined_to. SET is the set of nodes we
403 are writing to the current file. If NODE is not in SET, then NODE
404 is a boundary of a cgraph_node_set and we pretend NODE just has a
405 decl and no callees. WRITTEN_DECLS is the set of FUNCTION_DECLs
406 that have had their callgraph node written so far. This is used to
407 determine if NODE is a clone of a previously written node. */
410 lto_output_node (struct lto_simple_output_block *ob, struct cgraph_node *node,
411 lto_cgraph_encoder_t encoder, cgraph_node_set set,
412 varpool_node_set vset)
415 struct bitpack_d *bp;
418 bool in_other_partition = false;
419 struct cgraph_node *clone_of;
421 boundary_p = !cgraph_node_in_set_p (node, set);
423 if (node->analyzed && !boundary_p)
424 tag = LTO_cgraph_analyzed_node;
426 tag = LTO_cgraph_unavail_node;
428 lto_output_uleb128_stream (ob->main_stream, tag);
430 /* In WPA mode, we only output part of the call-graph. Also, we
431 fake cgraph node attributes. There are two cases that we care.
433 Boundary nodes: There are nodes that are not part of SET but are
434 called from within SET. We artificially make them look like
435 externally visible nodes with no function body.
437 Cherry-picked nodes: These are nodes we pulled from other
438 translation units into SET during IPA-inlining. We make them as
439 local static nodes to prevent clashes with other local statics. */
440 if (boundary_p && node->analyzed)
442 /* Inline clones can not be part of boundary.
443 gcc_assert (!node->global.inlined_to);
445 FIXME: At the moment they can be, when partition contains an inline
446 clone that is clone of inline clone from outside partition. We can
447 reshape the clone tree and make other tree to be the root, but it
448 needs a bit extra work and will be promplty done by cgraph_remove_node
449 after reading back. */
450 in_other_partition = 1;
453 clone_of = node->clone_of;
455 && (ref = lto_cgraph_encoder_lookup (encoder, node->clone_of)) == LCC_NOT_FOUND)
456 if (clone_of->prev_sibling_clone)
457 clone_of = clone_of->prev_sibling_clone;
459 clone_of = clone_of->clone_of;
461 lto_output_sleb128_stream (ob->main_stream, LCC_NOT_FOUND);
463 lto_output_sleb128_stream (ob->main_stream, ref);
466 lto_output_fn_decl_index (ob->decl_state, ob->main_stream, node->decl);
467 lto_output_sleb128_stream (ob->main_stream, node->count);
469 bp = bitpack_create ();
470 bp_pack_value (bp, node->local.local, 1);
471 bp_pack_value (bp, node->local.externally_visible, 1);
472 bp_pack_value (bp, node->local.finalized, 1);
473 bp_pack_value (bp, node->local.inlinable, 1);
474 bp_pack_value (bp, node->local.versionable, 1);
475 bp_pack_value (bp, node->local.disregard_inline_limits, 1);
476 bp_pack_value (bp, node->local.redefined_extern_inline, 1);
477 bp_pack_value (bp, node->local.vtable_method, 1);
478 bp_pack_value (bp, node->needed, 1);
479 bp_pack_value (bp, node->address_taken, 1);
480 bp_pack_value (bp, node->abstract_and_needed, 1);
481 bp_pack_value (bp, tag == LTO_cgraph_analyzed_node
482 && !DECL_EXTERNAL (node->decl)
483 && (reachable_from_other_partition_p (node, set)
484 || referenced_from_other_partition_p (&node->ref_list, set, vset)), 1);
485 bp_pack_value (bp, node->lowered, 1);
486 bp_pack_value (bp, in_other_partition, 1);
487 bp_pack_value (bp, node->alias, 1);
488 bp_pack_value (bp, node->finalized_by_frontend, 1);
489 bp_pack_value (bp, node->frequency, 2);
490 lto_output_bitpack (ob->main_stream, bp);
493 if (tag == LTO_cgraph_analyzed_node)
495 lto_output_sleb128_stream (ob->main_stream,
496 node->local.inline_summary.estimated_self_stack_size);
497 lto_output_sleb128_stream (ob->main_stream,
498 node->local.inline_summary.self_size);
499 lto_output_sleb128_stream (ob->main_stream,
500 node->local.inline_summary.size_inlining_benefit);
501 lto_output_sleb128_stream (ob->main_stream,
502 node->local.inline_summary.self_time);
503 lto_output_sleb128_stream (ob->main_stream,
504 node->local.inline_summary.time_inlining_benefit);
505 if (node->global.inlined_to)
507 ref = lto_cgraph_encoder_lookup (encoder, node->global.inlined_to);
508 gcc_assert (ref != LCC_NOT_FOUND);
513 lto_output_sleb128_stream (ob->main_stream, ref);
516 if (node->same_comdat_group && !boundary_p)
518 ref = lto_cgraph_encoder_lookup (encoder, node->same_comdat_group);
519 gcc_assert (ref != LCC_NOT_FOUND);
523 lto_output_sleb128_stream (ob->main_stream, ref);
527 struct cgraph_node *alias;
528 unsigned long alias_count = 1;
529 for (alias = node->same_body; alias->next; alias = alias->next)
531 lto_output_uleb128_stream (ob->main_stream, alias_count);
534 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
536 if (alias->thunk.thunk_p)
538 lto_output_uleb128_stream
540 1 + (alias->thunk.this_adjusting != 0) * 2
541 + (alias->thunk.virtual_offset_p != 0) * 4);
542 lto_output_uleb128_stream (ob->main_stream,
543 alias->thunk.fixed_offset);
544 lto_output_uleb128_stream (ob->main_stream,
545 alias->thunk.virtual_value);
546 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
551 lto_output_uleb128_stream (ob->main_stream, 0);
552 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
555 alias = alias->previous;
560 lto_output_uleb128_stream (ob->main_stream, 0);
563 /* Output the varpool NODE to OB.
564 If NODE is not in SET, then NODE is a boundary. */
567 lto_output_varpool_node (struct lto_simple_output_block *ob, struct varpool_node *node,
568 cgraph_node_set set, varpool_node_set vset)
570 bool boundary_p = !varpool_node_in_set_p (node, vset) && node->analyzed;
571 struct bitpack_d *bp;
572 struct varpool_node *alias;
575 lto_output_var_decl_index (ob->decl_state, ob->main_stream, node->decl);
576 bp = bitpack_create ();
577 bp_pack_value (bp, node->externally_visible, 1);
578 bp_pack_value (bp, node->force_output, 1);
579 bp_pack_value (bp, node->finalized, 1);
580 bp_pack_value (bp, node->alias, 1);
581 gcc_assert (!node->alias || !node->extra_name);
582 gcc_assert (node->finalized || !node->analyzed);
583 gcc_assert (node->needed);
584 /* Constant pool initializers can be de-unified into individual ltrans units.
585 FIXME: Alternatively at -Os we may want to avoid generating for them the local
586 labels and share them across LTRANS partitions. */
587 if (DECL_IN_CONSTANT_POOL (node->decl))
589 bp_pack_value (bp, 0, 1); /* used_from_other_parition. */
590 bp_pack_value (bp, 0, 1); /* in_other_partition. */
594 bp_pack_value (bp, node->analyzed
595 && referenced_from_other_partition_p (&node->ref_list,
597 bp_pack_value (bp, boundary_p, 1); /* in_other_partition. */
599 /* Also emit any extra name aliases. */
600 for (alias = node->extra_name; alias; alias = alias->next)
602 bp_pack_value (bp, count != 0, 1);
603 lto_output_bitpack (ob->main_stream, bp);
608 lto_output_uleb128_stream (ob->main_stream, count);
609 for (alias = node->extra_name; alias; alias = alias->next)
610 lto_output_var_decl_index (ob->decl_state, ob->main_stream, alias->decl);
614 /* Output the varpool NODE to OB.
615 If NODE is not in SET, then NODE is a boundary. */
618 lto_output_ref (struct lto_simple_output_block *ob, struct ipa_ref *ref,
619 lto_cgraph_encoder_t encoder,
620 lto_varpool_encoder_t varpool_encoder)
622 struct bitpack_d *bp = bitpack_create ();
623 bp_pack_value (bp, ref->refered_type, 1);
624 bp_pack_value (bp, ref->use, 2);
625 lto_output_bitpack (ob->main_stream, bp);
627 if (ref->refered_type == IPA_REF_CGRAPH)
629 int nref = lto_cgraph_encoder_lookup (encoder, ipa_ref_node (ref));
630 gcc_assert (nref != LCC_NOT_FOUND);
631 lto_output_sleb128_stream (ob->main_stream, nref);
635 int nref = lto_varpool_encoder_lookup (varpool_encoder,
636 ipa_ref_varpool_node (ref));
637 gcc_assert (nref != LCC_NOT_FOUND);
638 lto_output_sleb128_stream (ob->main_stream, nref);
642 /* Stream out profile_summary to OB. */
645 output_profile_summary (struct lto_simple_output_block *ob)
649 /* We do not output num, it is not terribly useful. */
650 gcc_assert (profile_info->runs);
651 lto_output_uleb128_stream (ob->main_stream, profile_info->runs);
652 lto_output_sleb128_stream (ob->main_stream, profile_info->sum_all);
653 lto_output_sleb128_stream (ob->main_stream, profile_info->run_max);
654 lto_output_sleb128_stream (ob->main_stream, profile_info->sum_max);
657 lto_output_uleb128_stream (ob->main_stream, 0);
660 /* Add NODE into encoder as well as nodes it is cloned from.
661 Do it in a way so clones appear first. */
664 add_node_to (lto_cgraph_encoder_t encoder, struct cgraph_node *node,
668 add_node_to (encoder, node->clone_of, include_body);
669 else if (include_body)
670 lto_set_cgraph_encoder_encode_body (encoder, node);
671 lto_cgraph_encoder_encode (encoder, node);
674 /* Add all references in LIST to encoders. */
677 add_references (lto_cgraph_encoder_t encoder,
678 lto_varpool_encoder_t varpool_encoder,
679 struct ipa_ref_list *list)
683 for (i = 0; ipa_ref_list_reference_iterate (list, i, ref); i++)
684 if (ref->refered_type == IPA_REF_CGRAPH)
685 add_node_to (encoder, ipa_ref_node (ref), false);
688 struct varpool_node *vnode = ipa_ref_varpool_node (ref);
689 lto_varpool_encoder_encode (varpool_encoder, vnode);
693 /* Output all callees or indirect outgoing edges. EDGE must be the first such
697 output_outgoing_cgraph_edges (struct cgraph_edge *edge,
698 struct lto_simple_output_block *ob,
699 lto_cgraph_encoder_t encoder)
704 /* Output edges in backward direction, so the reconstructed callgraph match
705 and it is easy to associate call sites in the IPA pass summaries. */
706 while (edge->next_callee)
707 edge = edge->next_callee;
708 for (; edge; edge = edge->prev_callee)
709 lto_output_edge (ob, edge, encoder);
712 /* Output the part of the cgraph in SET. */
715 output_refs (cgraph_node_set set, varpool_node_set vset,
716 lto_cgraph_encoder_t encoder,
717 lto_varpool_encoder_t varpool_encoder)
719 cgraph_node_set_iterator csi;
720 varpool_node_set_iterator vsi;
721 struct lto_simple_output_block *ob;
726 ob = lto_create_simple_output_block (LTO_section_refs);
728 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
730 struct cgraph_node *node = csi_node (csi);
732 count = ipa_ref_list_nreferences (&node->ref_list);
735 lto_output_uleb128_stream (ob->main_stream, count);
736 lto_output_uleb128_stream (ob->main_stream,
737 lto_cgraph_encoder_lookup (encoder, node));
738 for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref); i++)
739 lto_output_ref (ob, ref, encoder, varpool_encoder);
743 lto_output_uleb128_stream (ob->main_stream, 0);
745 for (vsi = vsi_start (vset); !vsi_end_p (vsi); vsi_next (&vsi))
747 struct varpool_node *node = vsi_node (vsi);
749 count = ipa_ref_list_nreferences (&node->ref_list);
752 lto_output_uleb128_stream (ob->main_stream, count);
753 lto_output_uleb128_stream (ob->main_stream,
754 lto_varpool_encoder_lookup (varpool_encoder,
756 for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref); i++)
757 lto_output_ref (ob, ref, encoder, varpool_encoder);
761 lto_output_uleb128_stream (ob->main_stream, 0);
763 lto_destroy_simple_output_block (ob);
766 /* Find out all cgraph and varpool nodes we want to encode in current unit
767 and insert them to encoders. */
769 compute_ltrans_boundary (struct lto_out_decl_state *state,
770 cgraph_node_set set, varpool_node_set vset)
772 struct cgraph_node *node;
773 cgraph_node_set_iterator csi;
774 varpool_node_set_iterator vsi;
775 struct cgraph_edge *edge;
777 lto_cgraph_encoder_t encoder;
778 lto_varpool_encoder_t varpool_encoder;
780 encoder = state->cgraph_node_encoder = lto_cgraph_encoder_new ();
781 varpool_encoder = state->varpool_node_encoder = lto_varpool_encoder_new ();
783 /* Go over all the nodes in SET and assign references. */
784 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
786 node = csi_node (csi);
787 add_node_to (encoder, node, true);
788 add_references (encoder, varpool_encoder, &node->ref_list);
790 for (vsi = vsi_start (vset); !vsi_end_p (vsi); vsi_next (&vsi))
792 struct varpool_node *vnode = vsi_node (vsi);
793 gcc_assert (!vnode->alias);
794 lto_varpool_encoder_encode (varpool_encoder, vnode);
795 lto_set_varpool_encoder_encode_initializer (varpool_encoder, vnode);
796 add_references (encoder, varpool_encoder, &vnode->ref_list);
798 /* Pickle in also the initializer of all referenced readonly variables
799 to help folding. Constant pool variables are not shared, so we must
801 for (i = 0; i < lto_varpool_encoder_size (varpool_encoder); i++)
803 struct varpool_node *vnode = lto_varpool_encoder_deref (varpool_encoder, i);
804 if (DECL_INITIAL (vnode->decl)
805 && !lto_varpool_encoder_encode_initializer_p (varpool_encoder,
807 && (DECL_IN_CONSTANT_POOL (vnode->decl)
808 || TREE_READONLY (vnode->decl)))
810 lto_set_varpool_encoder_encode_initializer (varpool_encoder, vnode);
811 add_references (encoder, varpool_encoder, &vnode->ref_list);
815 /* Go over all the nodes again to include callees that are not in
817 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
819 node = csi_node (csi);
820 for (edge = node->callees; edge; edge = edge->next_callee)
822 struct cgraph_node *callee = edge->callee;
823 if (!cgraph_node_in_set_p (callee, set))
825 /* We should have moved all the inlines. */
826 gcc_assert (!callee->global.inlined_to);
827 add_node_to (encoder, callee, false);
833 /* Output the part of the cgraph in SET. */
836 output_cgraph (cgraph_node_set set, varpool_node_set vset)
838 struct cgraph_node *node;
839 struct lto_simple_output_block *ob;
840 cgraph_node_set_iterator csi;
842 lto_cgraph_encoder_t encoder;
843 lto_varpool_encoder_t varpool_encoder;
844 struct cgraph_asm_node *can;
847 output_cgraph_opt_summary ();
849 ob = lto_create_simple_output_block (LTO_section_cgraph);
851 output_profile_summary (ob);
853 /* An encoder for cgraph nodes should have been created by
854 ipa_write_summaries_1. */
855 gcc_assert (ob->decl_state->cgraph_node_encoder);
856 gcc_assert (ob->decl_state->varpool_node_encoder);
857 encoder = ob->decl_state->cgraph_node_encoder;
858 varpool_encoder = ob->decl_state->varpool_node_encoder;
860 /* Write out the nodes. We must first output a node and then its clones,
861 otherwise at a time reading back the node there would be nothing to clone
863 n_nodes = lto_cgraph_encoder_size (encoder);
864 for (i = 0; i < n_nodes; i++)
866 node = lto_cgraph_encoder_deref (encoder, i);
867 lto_output_node (ob, node, encoder, set, vset);
870 /* Go over the nodes in SET again to write edges. */
871 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
873 node = csi_node (csi);
874 output_outgoing_cgraph_edges (node->callees, ob, encoder);
875 output_outgoing_cgraph_edges (node->indirect_calls, ob, encoder);
878 lto_output_uleb128_stream (ob->main_stream, 0);
880 /* Emit toplevel asms. */
881 for (can = cgraph_asm_nodes; can; can = can->next)
883 int len = TREE_STRING_LENGTH (can->asm_str);
884 lto_output_uleb128_stream (ob->main_stream, len);
885 for (i = 0; i < len; ++i)
886 lto_output_1_stream (ob->main_stream,
887 TREE_STRING_POINTER (can->asm_str)[i]);
890 lto_output_uleb128_stream (ob->main_stream, 0);
892 lto_destroy_simple_output_block (ob);
893 output_varpool (set, vset);
894 output_refs (set, vset, encoder, varpool_encoder);
897 /* Overwrite the information in NODE based on FILE_DATA, TAG, FLAGS,
898 STACK_SIZE, SELF_TIME and SELF_SIZE. This is called either to initialize
899 NODE or to replace the values in it, for instance because the first
900 time we saw it, the function body was not available but now it
901 is. BP is a bitpack with all the bitflags for NODE read from the
905 input_overwrite_node (struct lto_file_decl_data *file_data,
906 struct cgraph_node *node,
907 enum LTO_cgraph_tags tag,
908 struct bitpack_d *bp,
909 unsigned int stack_size,
910 unsigned int self_time,
911 unsigned int time_inlining_benefit,
912 unsigned int self_size,
913 unsigned int size_inlining_benefit)
915 node->aux = (void *) tag;
916 node->local.inline_summary.estimated_self_stack_size = stack_size;
917 node->local.inline_summary.self_time = self_time;
918 node->local.inline_summary.time_inlining_benefit = time_inlining_benefit;
919 node->local.inline_summary.self_size = self_size;
920 node->local.inline_summary.size_inlining_benefit = size_inlining_benefit;
921 node->global.time = self_time;
922 node->global.size = self_size;
923 node->global.estimated_stack_size = stack_size;
924 node->global.estimated_growth = INT_MIN;
925 node->local.lto_file_data = file_data;
927 node->local.local = bp_unpack_value (bp, 1);
928 node->local.externally_visible = bp_unpack_value (bp, 1);
929 node->local.finalized = bp_unpack_value (bp, 1);
930 node->local.inlinable = bp_unpack_value (bp, 1);
931 node->local.versionable = bp_unpack_value (bp, 1);
932 node->local.disregard_inline_limits = bp_unpack_value (bp, 1);
933 node->local.redefined_extern_inline = bp_unpack_value (bp, 1);
934 node->local.vtable_method = bp_unpack_value (bp, 1);
935 node->needed = bp_unpack_value (bp, 1);
936 node->address_taken = bp_unpack_value (bp, 1);
937 node->abstract_and_needed = bp_unpack_value (bp, 1);
938 node->reachable_from_other_partition = bp_unpack_value (bp, 1);
939 node->lowered = bp_unpack_value (bp, 1);
940 node->analyzed = tag == LTO_cgraph_analyzed_node;
941 node->in_other_partition = bp_unpack_value (bp, 1);
942 node->alias = bp_unpack_value (bp, 1);
943 node->finalized_by_frontend = bp_unpack_value (bp, 1);
944 node->frequency = (enum node_frequency)bp_unpack_value (bp, 2);
947 /* Output the part of the cgraph in SET. */
950 output_varpool (cgraph_node_set set, varpool_node_set vset)
952 struct lto_simple_output_block *ob = lto_create_simple_output_block (LTO_section_varpool);
953 lto_varpool_encoder_t varpool_encoder = ob->decl_state->varpool_node_encoder;
954 int len = lto_varpool_encoder_size (varpool_encoder), i;
956 lto_output_uleb128_stream (ob->main_stream, len);
958 /* Write out the nodes. We must first output a node and then its clones,
959 otherwise at a time reading back the node there would be nothing to clone
961 for (i = 0; i < len; i++)
963 lto_output_varpool_node (ob, lto_varpool_encoder_deref (varpool_encoder, i),
967 lto_destroy_simple_output_block (ob);
970 /* Read a node from input_block IB. TAG is the node's tag just read.
971 Return the node read or overwriten. */
973 static struct cgraph_node *
974 input_node (struct lto_file_decl_data *file_data,
975 struct lto_input_block *ib,
976 enum LTO_cgraph_tags tag,
977 VEC(cgraph_node_ptr, heap) *nodes)
980 struct cgraph_node *node;
981 struct bitpack_d *bp;
984 int ref = LCC_NOT_FOUND, ref2 = LCC_NOT_FOUND;
987 int time_inlining_benefit = 0;
988 int size_inlining_benefit = 0;
989 unsigned long same_body_count = 0;
992 clone_ref = lto_input_sleb128 (ib);
994 decl_index = lto_input_uleb128 (ib);
995 fn_decl = lto_file_decl_data_get_fn_decl (file_data, decl_index);
997 if (clone_ref != LCC_NOT_FOUND)
999 node = cgraph_clone_node (VEC_index (cgraph_node_ptr, nodes, clone_ref), fn_decl,
1000 0, CGRAPH_FREQ_BASE, 0, false, NULL);
1003 node = cgraph_node (fn_decl);
1005 node->count = lto_input_sleb128 (ib);
1006 bp = lto_input_bitpack (ib);
1008 if (tag == LTO_cgraph_analyzed_node)
1010 stack_size = lto_input_sleb128 (ib);
1011 self_size = lto_input_sleb128 (ib);
1012 size_inlining_benefit = lto_input_sleb128 (ib);
1013 self_time = lto_input_sleb128 (ib);
1014 time_inlining_benefit = lto_input_sleb128 (ib);
1016 ref = lto_input_sleb128 (ib);
1019 ref2 = lto_input_sleb128 (ib);
1020 same_body_count = lto_input_uleb128 (ib);
1022 /* Make sure that we have not read this node before. Nodes that
1023 have already been read will have their tag stored in the 'aux'
1024 field. Since built-in functions can be referenced in multiple
1025 functions, they are expected to be read more than once. */
1026 if (node->aux && !DECL_IS_BUILTIN (node->decl))
1027 internal_error ("bytecode stream: found multiple instances of cgraph "
1028 "node %d", node->uid);
1030 input_overwrite_node (file_data, node, tag, bp, stack_size, self_time,
1031 time_inlining_benefit, self_size,
1032 size_inlining_benefit);
1033 bitpack_delete (bp);
1035 /* Store a reference for now, and fix up later to be a pointer. */
1036 node->global.inlined_to = (cgraph_node_ptr) (intptr_t) ref;
1038 /* Store a reference for now, and fix up later to be a pointer. */
1039 node->same_comdat_group = (cgraph_node_ptr) (intptr_t) ref2;
1041 while (same_body_count-- > 0)
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 cgraph_same_body_alias (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 cgraph_add_thunk (alias_decl, fn_decl, type & 2, fixed_offset,
1064 (type & 4) ? size_int (virtual_value) : NULL_TREE,
1071 /* Read a node from input_block IB. TAG is the node's tag just read.
1072 Return the node read or overwriten. */
1074 static struct varpool_node *
1075 input_varpool_node (struct lto_file_decl_data *file_data,
1076 struct lto_input_block *ib)
1080 struct varpool_node *node;
1081 struct bitpack_d *bp;
1085 decl_index = lto_input_uleb128 (ib);
1086 var_decl = lto_file_decl_data_get_var_decl (file_data, decl_index);
1087 node = varpool_node (var_decl);
1089 bp = lto_input_bitpack (ib);
1090 node->externally_visible = bp_unpack_value (bp, 1);
1091 node->force_output = bp_unpack_value (bp, 1);
1092 node->finalized = bp_unpack_value (bp, 1);
1093 node->alias = bp_unpack_value (bp, 1);
1094 node->analyzed = node->finalized;
1095 node->used_from_other_partition = bp_unpack_value (bp, 1);
1096 node->in_other_partition = bp_unpack_value (bp, 1);
1097 aliases_p = bp_unpack_value (bp, 1);
1098 if (node->finalized)
1099 varpool_mark_needed_node (node);
1100 bitpack_delete (bp);
1103 count = lto_input_uleb128 (ib);
1104 for (; count > 0; count --)
1106 tree decl = lto_file_decl_data_get_var_decl (file_data,
1107 lto_input_uleb128 (ib));
1108 varpool_extra_name_alias (decl, var_decl);
1114 /* Read a node from input_block IB. TAG is the node's tag just read.
1115 Return the node read or overwriten. */
1118 input_ref (struct lto_input_block *ib,
1119 struct cgraph_node *refering_node,
1120 struct varpool_node *refering_varpool_node,
1121 VEC(cgraph_node_ptr, heap) *nodes,
1122 VEC(varpool_node_ptr, heap) *varpool_nodes)
1124 struct cgraph_node *node = NULL;
1125 struct varpool_node *varpool_node = NULL;
1126 struct bitpack_d *bp;
1127 enum ipa_ref_type type;
1128 enum ipa_ref_use use;
1130 bp = lto_input_bitpack (ib);
1131 type = (enum ipa_ref_type) bp_unpack_value (bp, 1);
1132 use = (enum ipa_ref_use) bp_unpack_value (bp, 2);
1133 bitpack_delete (bp);
1134 if (type == IPA_REF_CGRAPH)
1135 node = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
1137 varpool_node = VEC_index (varpool_node_ptr, varpool_nodes, lto_input_sleb128 (ib));
1138 ipa_record_reference (refering_node, refering_varpool_node,
1139 node, varpool_node, use, NULL);
1142 /* Read an edge from IB. NODES points to a vector of previously read nodes for
1143 decoding caller and callee of the edge to be read. If INDIRECT is true, the
1144 edge being read is indirect (in the sense that it has
1145 indirect_unknown_callee set). */
1148 input_edge (struct lto_input_block *ib, VEC(cgraph_node_ptr, heap) *nodes,
1151 struct cgraph_node *caller, *callee;
1152 struct cgraph_edge *edge;
1153 unsigned int stmt_id;
1157 cgraph_inline_failed_t inline_failed;
1158 struct bitpack_d *bp;
1159 enum ld_plugin_symbol_resolution caller_resolution;
1162 caller = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
1163 if (caller == NULL || caller->decl == NULL_TREE)
1164 internal_error ("bytecode stream: no caller found while reading edge");
1168 callee = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
1169 if (callee == NULL || callee->decl == NULL_TREE)
1170 internal_error ("bytecode stream: no callee found while reading edge");
1175 count = (gcov_type) lto_input_sleb128 (ib);
1177 bp = lto_input_bitpack (ib);
1178 stmt_id = (unsigned int) bp_unpack_value (bp, HOST_BITS_PER_INT);
1179 inline_failed = (cgraph_inline_failed_t) bp_unpack_value (bp,
1181 freq = (int) bp_unpack_value (bp, HOST_BITS_PER_INT);
1182 nest = (unsigned) bp_unpack_value (bp, 30);
1184 /* If the caller was preempted, don't create the edge.
1185 ??? Should we ever have edges from a preempted caller? */
1186 caller_resolution = lto_symtab_get_resolution (caller->decl);
1187 if (caller_resolution == LDPR_PREEMPTED_REG
1188 || caller_resolution == LDPR_PREEMPTED_IR)
1192 edge = cgraph_create_indirect_edge (caller, NULL, 0, count, freq, nest);
1194 edge = cgraph_create_edge (caller, callee, NULL, count, freq, nest);
1196 edge->indirect_inlining_edge = bp_unpack_value (bp, 1);
1197 edge->lto_stmt_uid = stmt_id;
1198 edge->inline_failed = inline_failed;
1199 edge->call_stmt_cannot_inline_p = bp_unpack_value (bp, 1);
1200 edge->can_throw_external = bp_unpack_value (bp, 1);
1203 if (bp_unpack_value (bp, 1))
1204 ecf_flags |= ECF_CONST;
1205 if (bp_unpack_value (bp, 1))
1206 ecf_flags |= ECF_PURE;
1207 if (bp_unpack_value (bp, 1))
1208 ecf_flags |= ECF_NORETURN;
1209 if (bp_unpack_value (bp, 1))
1210 ecf_flags |= ECF_MALLOC;
1211 if (bp_unpack_value (bp, 1))
1212 ecf_flags |= ECF_NOTHROW;
1213 if (bp_unpack_value (bp, 1))
1214 ecf_flags |= ECF_RETURNS_TWICE;
1215 edge->indirect_info->ecf_flags = ecf_flags;
1217 bitpack_delete (bp);
1221 /* Read a cgraph from IB using the info in FILE_DATA. */
1223 static VEC(cgraph_node_ptr, heap) *
1224 input_cgraph_1 (struct lto_file_decl_data *file_data,
1225 struct lto_input_block *ib)
1227 enum LTO_cgraph_tags tag;
1228 VEC(cgraph_node_ptr, heap) *nodes = NULL;
1229 struct cgraph_node *node;
1231 unsigned HOST_WIDE_INT len;
1233 tag = (enum LTO_cgraph_tags) lto_input_uleb128 (ib);
1236 if (tag == LTO_cgraph_edge)
1237 input_edge (ib, nodes, false);
1238 else if (tag == LTO_cgraph_indirect_edge)
1239 input_edge (ib, nodes, true);
1242 node = input_node (file_data, ib, tag,nodes);
1243 if (node == NULL || node->decl == NULL_TREE)
1244 internal_error ("bytecode stream: found empty cgraph node");
1245 VEC_safe_push (cgraph_node_ptr, heap, nodes, node);
1246 lto_cgraph_encoder_encode (file_data->cgraph_node_encoder, node);
1249 tag = (enum LTO_cgraph_tags) lto_input_uleb128 (ib);
1252 /* Input toplevel asms. */
1253 len = lto_input_uleb128 (ib);
1256 char *str = (char *)xmalloc (len + 1);
1257 for (i = 0; i < len; ++i)
1258 str[i] = lto_input_1_unsigned (ib);
1259 cgraph_add_asm_node (build_string (len, str));
1262 len = lto_input_uleb128 (ib);
1265 for (i = 0; VEC_iterate (cgraph_node_ptr, nodes, i, node); i++)
1267 int ref = (int) (intptr_t) node->global.inlined_to;
1269 /* Fixup inlined_to from reference to pointer. */
1270 if (ref != LCC_NOT_FOUND)
1271 node->global.inlined_to = VEC_index (cgraph_node_ptr, nodes, ref);
1273 node->global.inlined_to = NULL;
1275 ref = (int) (intptr_t) node->same_comdat_group;
1277 /* Fixup same_comdat_group from reference to pointer. */
1278 if (ref != LCC_NOT_FOUND)
1279 node->same_comdat_group = VEC_index (cgraph_node_ptr, nodes, ref);
1281 node->same_comdat_group = NULL;
1286 /* Read a varpool from IB using the info in FILE_DATA. */
1288 static VEC(varpool_node_ptr, heap) *
1289 input_varpool_1 (struct lto_file_decl_data *file_data,
1290 struct lto_input_block *ib)
1292 unsigned HOST_WIDE_INT len;
1293 VEC(varpool_node_ptr, heap) *varpool = NULL;
1295 len = lto_input_uleb128 (ib);
1298 VEC_safe_push (varpool_node_ptr, heap, varpool,
1299 input_varpool_node (file_data, ib));
1305 /* Input ipa_refs. */
1308 input_refs (struct lto_input_block *ib,
1309 VEC(cgraph_node_ptr, heap) *nodes,
1310 VEC(varpool_node_ptr, heap) *varpool)
1316 struct cgraph_node *node;
1317 count = lto_input_uleb128 (ib);
1320 idx = lto_input_uleb128 (ib);
1321 node = VEC_index (cgraph_node_ptr, nodes, idx);
1324 input_ref (ib, node, NULL, nodes, varpool);
1330 struct varpool_node *node;
1331 count = lto_input_uleb128 (ib);
1334 node = VEC_index (varpool_node_ptr, varpool, lto_input_uleb128 (ib));
1337 input_ref (ib, NULL, node, nodes, varpool);
1344 static struct gcov_ctr_summary lto_gcov_summary;
1346 /* Input profile_info from IB. */
1348 input_profile_summary (struct lto_input_block *ib)
1350 unsigned int runs = lto_input_uleb128 (ib);
1355 profile_info = <o_gcov_summary;
1356 lto_gcov_summary.runs = runs;
1357 lto_gcov_summary.sum_all = lto_input_sleb128 (ib);
1358 lto_gcov_summary.run_max = lto_input_sleb128 (ib);
1359 lto_gcov_summary.sum_max = lto_input_sleb128 (ib);
1361 /* We can support this by scaling all counts to nearest common multiple
1362 of all different runs, but it is perhaps not worth the effort. */
1363 else if (profile_info->runs != runs
1364 || profile_info->sum_all != lto_input_sleb128 (ib)
1365 || profile_info->run_max != lto_input_sleb128 (ib)
1366 || profile_info->sum_max != lto_input_sleb128 (ib))
1367 sorry ("Combining units with different profiles is not supported.");
1368 /* We allow some units to have profile and other to not have one. This will
1369 just make unprofiled units to be size optimized that is sane. */
1374 /* Input and merge the cgraph from each of the .o files passed to
1380 struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
1381 struct lto_file_decl_data *file_data;
1383 struct cgraph_node *node;
1385 while ((file_data = file_data_vec[j++]))
1389 struct lto_input_block *ib;
1390 VEC(cgraph_node_ptr, heap) *nodes;
1391 VEC(varpool_node_ptr, heap) *varpool;
1393 ib = lto_create_simple_input_block (file_data, LTO_section_cgraph,
1395 input_profile_summary (ib);
1396 file_data->cgraph_node_encoder = lto_cgraph_encoder_new ();
1397 nodes = input_cgraph_1 (file_data, ib);
1398 lto_destroy_simple_input_block (file_data, LTO_section_cgraph,
1401 ib = lto_create_simple_input_block (file_data, LTO_section_varpool,
1403 varpool = input_varpool_1 (file_data, ib);
1404 lto_destroy_simple_input_block (file_data, LTO_section_varpool,
1407 ib = lto_create_simple_input_block (file_data, LTO_section_refs,
1409 input_refs (ib, nodes, varpool);
1410 lto_destroy_simple_input_block (file_data, LTO_section_refs,
1413 input_cgraph_opt_summary (nodes);
1414 VEC_free (cgraph_node_ptr, heap, nodes);
1415 VEC_free (varpool_node_ptr, heap, varpool);
1418 /* Clear out the aux field that was used to store enough state to
1419 tell which nodes should be overwritten. */
1420 for (node = cgraph_nodes; node; node = node->next)
1422 /* Some nodes may have been created by cgraph_node. This
1423 happens when the callgraph contains nested functions. If the
1424 node for the parent function was never emitted to the gimple
1425 file, cgraph_node will create a node for it when setting the
1426 context of the nested function. */
1427 if (node->local.lto_file_data)
1432 /* True when we need optimization summary for NODE. */
1435 output_cgraph_opt_summary_p (struct cgraph_node *node)
1437 if (!node->clone_of)
1439 return (node->clone.tree_map
1440 || node->clone.args_to_skip
1441 || node->clone.combined_args_to_skip);
1444 /* Output optimization summary for NODE to OB. */
1447 output_node_opt_summary (struct output_block *ob,
1448 struct cgraph_node *node)
1452 struct ipa_replace_map *map;
1453 struct bitpack_d *bp;
1456 lto_output_uleb128_stream (ob->main_stream,
1457 bitmap_count_bits (node->clone.args_to_skip));
1458 EXECUTE_IF_SET_IN_BITMAP (node->clone.args_to_skip, 0, index, bi)
1459 lto_output_uleb128_stream (ob->main_stream, index);
1460 lto_output_uleb128_stream (ob->main_stream,
1461 bitmap_count_bits (node->clone.combined_args_to_skip));
1462 EXECUTE_IF_SET_IN_BITMAP (node->clone.combined_args_to_skip, 0, index, bi)
1463 lto_output_uleb128_stream (ob->main_stream, index);
1464 lto_output_uleb128_stream (ob->main_stream,
1465 VEC_length (ipa_replace_map_p, node->clone.tree_map));
1466 for (i = 0; VEC_iterate (ipa_replace_map_p, node->clone.tree_map, i, map); i++)
1471 for (parm_num = 0, parm = DECL_ARGUMENTS (node->decl); parm;
1472 parm = TREE_CHAIN (parm), parm_num++)
1473 if (map->old_tree == parm)
1475 /* At the moment we assume all old trees to be PARM_DECLs, because we have no
1476 mechanism to store function local declarations into summaries. */
1478 lto_output_uleb128_stream (ob->main_stream, parm_num);
1479 lto_output_tree (ob, map->new_tree, true);
1480 bp = bitpack_create ();
1481 bp_pack_value (bp, map->replace_p, 1);
1482 bp_pack_value (bp, map->ref_p, 1);
1483 lto_output_bitpack (ob->main_stream, bp);
1484 bitpack_delete (bp);
1488 /* Output optimization summaries stored in callgraph.
1489 At the moment it is the clone info structure. */
1492 output_cgraph_opt_summary (void)
1494 struct cgraph_node *node;
1496 lto_cgraph_encoder_t encoder;
1497 struct output_block *ob = create_output_block (LTO_section_cgraph_opt_sum);
1500 ob->cgraph_node = NULL;
1501 encoder = ob->decl_state->cgraph_node_encoder;
1502 n_nodes = lto_cgraph_encoder_size (encoder);
1503 for (i = 0; i < n_nodes; i++)
1504 if (output_cgraph_opt_summary_p (lto_cgraph_encoder_deref (encoder, i)))
1506 lto_output_uleb128_stream (ob->main_stream, count);
1507 for (i = 0; i < n_nodes; i++)
1509 node = lto_cgraph_encoder_deref (encoder, i);
1510 if (output_cgraph_opt_summary_p (node))
1512 lto_output_uleb128_stream (ob->main_stream, i);
1513 output_node_opt_summary (ob, node);
1516 produce_asm (ob, NULL);
1517 destroy_output_block (ob);
1520 /* Input optimiation summary of NODE. */
1523 input_node_opt_summary (struct cgraph_node *node,
1524 struct lto_input_block *ib_main,
1525 struct data_in *data_in)
1530 struct bitpack_d *bp;
1532 count = lto_input_uleb128 (ib_main);
1534 node->clone.args_to_skip = BITMAP_GGC_ALLOC ();
1535 for (i = 0; i < count; i++)
1537 bit = lto_input_uleb128 (ib_main);
1538 bitmap_set_bit (node->clone.args_to_skip, bit);
1540 count = lto_input_uleb128 (ib_main);
1542 node->clone.combined_args_to_skip = BITMAP_GGC_ALLOC ();
1543 for (i = 0; i < count; i++)
1545 bit = lto_input_uleb128 (ib_main);
1546 bitmap_set_bit (node->clone.combined_args_to_skip, bit);
1548 count = lto_input_uleb128 (ib_main);
1549 for (i = 0; i < count; i++)
1553 struct ipa_replace_map *map = GGC_NEW (struct ipa_replace_map);
1555 VEC_safe_push (ipa_replace_map_p, gc, node->clone.tree_map, map);
1556 for (parm_num = 0, parm = DECL_ARGUMENTS (node->decl); parm_num;
1557 parm = TREE_CHAIN (parm))
1559 map->parm_num = lto_input_uleb128 (ib_main);
1560 map->old_tree = NULL;
1561 map->new_tree = lto_input_tree (ib_main, data_in);
1562 bp = lto_input_bitpack (ib_main);
1563 map->replace_p = bp_unpack_value (bp, 1);
1564 map->ref_p = bp_unpack_value (bp, 1);
1565 bitpack_delete (bp);
1569 /* Read section in file FILE_DATA of length LEN with data DATA. */
1572 input_cgraph_opt_section (struct lto_file_decl_data *file_data,
1573 const char *data, size_t len, VEC (cgraph_node_ptr,
1576 const struct lto_function_header *header =
1577 (const struct lto_function_header *) data;
1578 const int32_t cfg_offset = sizeof (struct lto_function_header);
1579 const int32_t main_offset = cfg_offset + header->cfg_size;
1580 const int32_t string_offset = main_offset + header->main_size;
1581 struct data_in *data_in;
1582 struct lto_input_block ib_main;
1586 LTO_INIT_INPUT_BLOCK (ib_main, (const char *) data + main_offset, 0,
1590 lto_data_in_create (file_data, (const char *) data + string_offset,
1591 header->string_size, NULL);
1592 count = lto_input_uleb128 (&ib_main);
1594 for (i = 0; i < count; i++)
1596 int ref = lto_input_uleb128 (&ib_main);
1597 input_node_opt_summary (VEC_index (cgraph_node_ptr, nodes, ref),
1600 lto_free_section_data (file_data, LTO_section_jump_functions, NULL, data,
1602 lto_data_in_delete (data_in);
1605 /* Input optimization summary of cgraph. */
1608 input_cgraph_opt_summary (VEC (cgraph_node_ptr, heap) * nodes)
1610 struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
1611 struct lto_file_decl_data *file_data;
1614 while ((file_data = file_data_vec[j++]))
1618 lto_get_section_data (file_data, LTO_section_cgraph_opt_sum, NULL,
1622 input_cgraph_opt_section (file_data, data, len, nodes);