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 (varpool_node_set);
51 /* Cgraph streaming is organized as set of record whose type
52 is indicated by a tag. */
55 /* Must leave 0 for the stopper. */
57 /* Cgraph node without body available. */
58 LTO_cgraph_unavail_node = 1,
59 /* Cgraph node with function body. */
60 LTO_cgraph_analyzed_node,
63 LTO_cgraph_indirect_edge
66 /* Create a new cgraph encoder. */
69 lto_cgraph_encoder_new (void)
71 lto_cgraph_encoder_t encoder = XCNEW (struct lto_cgraph_encoder_d);
72 encoder->map = pointer_map_create ();
73 encoder->nodes = NULL;
78 /* Delete ENCODER and its components. */
81 lto_cgraph_encoder_delete (lto_cgraph_encoder_t encoder)
83 VEC_free (cgraph_node_ptr, heap, encoder->nodes);
84 pointer_map_destroy (encoder->map);
89 /* Return the existing reference number of NODE in the cgraph encoder in
90 output block OB. Assign a new reference if this is the first time
94 lto_cgraph_encoder_encode (lto_cgraph_encoder_t encoder,
95 struct cgraph_node *node)
100 slot = pointer_map_contains (encoder->map, node);
103 ref = VEC_length (cgraph_node_ptr, encoder->nodes);
104 slot = pointer_map_insert (encoder->map, node);
105 *slot = (void *) (intptr_t) ref;
106 VEC_safe_push (cgraph_node_ptr, heap, encoder->nodes, node);
109 ref = (int) (intptr_t) *slot;
114 #define LCC_NOT_FOUND (-1)
116 /* Look up NODE in encoder. Return NODE's reference if it has been encoded
117 or LCC_NOT_FOUND if it is not there. */
120 lto_cgraph_encoder_lookup (lto_cgraph_encoder_t encoder,
121 struct cgraph_node *node)
123 void **slot = pointer_map_contains (encoder->map, node);
124 return (slot ? (int) (intptr_t) *slot : LCC_NOT_FOUND);
128 /* Return the cgraph node corresponding to REF using ENCODER. */
131 lto_cgraph_encoder_deref (lto_cgraph_encoder_t encoder, int ref)
133 if (ref == LCC_NOT_FOUND)
136 return VEC_index (cgraph_node_ptr, encoder->nodes, ref);
140 /* Return number of encoded nodes in ENCODER. */
143 lto_cgraph_encoder_size (lto_cgraph_encoder_t encoder)
145 return VEC_length (cgraph_node_ptr, encoder->nodes);
148 /* Create a new varpool encoder. */
150 lto_varpool_encoder_t
151 lto_varpool_encoder_new (void)
153 lto_varpool_encoder_t encoder = XCNEW (struct lto_varpool_encoder_d);
154 encoder->map = pointer_map_create ();
155 encoder->initializer = pointer_set_create ();
156 encoder->nodes = NULL;
161 /* Delete ENCODER and its components. */
164 lto_varpool_encoder_delete (lto_varpool_encoder_t encoder)
166 VEC_free (varpool_node_ptr, heap, encoder->nodes);
167 pointer_map_destroy (encoder->map);
168 pointer_set_destroy (encoder->initializer);
173 /* Return the existing reference number of NODE in the varpool encoder in
174 output block OB. Assign a new reference if this is the first time
178 lto_varpool_encoder_encode (lto_varpool_encoder_t encoder,
179 struct varpool_node *node)
184 slot = pointer_map_contains (encoder->map, node);
187 ref = VEC_length (varpool_node_ptr, encoder->nodes);
188 slot = pointer_map_insert (encoder->map, node);
189 *slot = (void *) (intptr_t) ref;
190 VEC_safe_push (varpool_node_ptr, heap, encoder->nodes, node);
193 ref = (int) (intptr_t) *slot;
198 /* Look up NODE in encoder. Return NODE's reference if it has been encoded
199 or LCC_NOT_FOUND if it is not there. */
202 lto_varpool_encoder_lookup (lto_varpool_encoder_t encoder,
203 struct varpool_node *node)
205 void **slot = pointer_map_contains (encoder->map, node);
206 return (slot ? (int) (intptr_t) *slot : LCC_NOT_FOUND);
210 /* Return the varpool node corresponding to REF using ENCODER. */
212 struct varpool_node *
213 lto_varpool_encoder_deref (lto_varpool_encoder_t encoder, int ref)
215 if (ref == LCC_NOT_FOUND)
218 return VEC_index (varpool_node_ptr, encoder->nodes, ref);
222 /* Return number of encoded nodes in ENCODER. */
225 lto_varpool_encoder_size (lto_varpool_encoder_t encoder)
227 return VEC_length (varpool_node_ptr, encoder->nodes);
230 /* Return TRUE if we should encode initializer of NODE (if any). */
233 lto_varpool_encoder_encode_initializer_p (lto_varpool_encoder_t encoder,
234 struct varpool_node *node)
236 return pointer_set_contains (encoder->initializer, node);
239 /* Return TRUE if we should encode initializer of NODE (if any). */
242 lto_set_varpool_encoder_encode_initializer (lto_varpool_encoder_t encoder,
243 struct varpool_node *node)
245 pointer_set_insert (encoder->initializer, node);
248 /* Output the cgraph EDGE to OB using ENCODER. */
251 lto_output_edge (struct lto_simple_output_block *ob, struct cgraph_edge *edge,
252 lto_cgraph_encoder_t encoder)
256 struct bitpack_d *bp;
258 if (edge->indirect_unknown_callee)
259 lto_output_uleb128_stream (ob->main_stream, LTO_cgraph_indirect_edge);
261 lto_output_uleb128_stream (ob->main_stream, LTO_cgraph_edge);
263 ref = lto_cgraph_encoder_lookup (encoder, edge->caller);
264 gcc_assert (ref != LCC_NOT_FOUND);
265 lto_output_sleb128_stream (ob->main_stream, ref);
267 if (!edge->indirect_unknown_callee)
269 ref = lto_cgraph_encoder_lookup (encoder, edge->callee);
270 gcc_assert (ref != LCC_NOT_FOUND);
271 lto_output_sleb128_stream (ob->main_stream, ref);
274 lto_output_sleb128_stream (ob->main_stream, edge->count);
276 bp = bitpack_create ();
277 uid = flag_wpa ? edge->lto_stmt_uid : gimple_uid (edge->call_stmt);
278 bp_pack_value (bp, uid, HOST_BITS_PER_INT);
279 bp_pack_value (bp, edge->inline_failed, HOST_BITS_PER_INT);
280 bp_pack_value (bp, edge->frequency, HOST_BITS_PER_INT);
281 bp_pack_value (bp, edge->loop_nest, 30);
282 bp_pack_value (bp, edge->indirect_inlining_edge, 1);
283 bp_pack_value (bp, edge->call_stmt_cannot_inline_p, 1);
284 bp_pack_value (bp, edge->can_throw_external, 1);
285 lto_output_bitpack (ob->main_stream, bp);
289 /* Return true when node is reachable from other partition. */
292 reachable_from_other_partition_p (struct cgraph_node *node, cgraph_node_set set)
294 struct cgraph_edge *e;
299 if (node->global.inlined_to)
301 for (e = node->callers; e; e = e->next_caller)
302 if (!cgraph_node_in_set_p (e->caller, set))
307 /* Output the cgraph NODE to OB. ENCODER is used to find the
308 reference number of NODE->inlined_to. SET is the set of nodes we
309 are writing to the current file. If NODE is not in SET, then NODE
310 is a boundary of a cgraph_node_set and we pretend NODE just has a
311 decl and no callees. WRITTEN_DECLS is the set of FUNCTION_DECLs
312 that have had their callgraph node written so far. This is used to
313 determine if NODE is a clone of a previously written node. */
316 lto_output_node (struct lto_simple_output_block *ob, struct cgraph_node *node,
317 lto_cgraph_encoder_t encoder, cgraph_node_set set,
318 bitmap written_decls)
321 struct bitpack_d *bp;
322 bool boundary_p, wrote_decl_p;
324 bool in_other_partition = false;
326 boundary_p = !cgraph_node_in_set_p (node, set);
327 wrote_decl_p = bitmap_bit_p (written_decls, DECL_UID (node->decl));
329 if (node->analyzed && !boundary_p)
330 tag = LTO_cgraph_analyzed_node;
332 tag = LTO_cgraph_unavail_node;
334 lto_output_uleb128_stream (ob->main_stream, tag);
336 /* In WPA mode, we only output part of the call-graph. Also, we
337 fake cgraph node attributes. There are two cases that we care.
339 Boundary nodes: There are nodes that are not part of SET but are
340 called from within SET. We artificially make them look like
341 externally visible nodes with no function body.
343 Cherry-picked nodes: These are nodes we pulled from other
344 translation units into SET during IPA-inlining. We make them as
345 local static nodes to prevent clashes with other local statics. */
346 if (boundary_p && node->analyzed)
348 /* Inline clones can not be part of boundary.
349 gcc_assert (!node->global.inlined_to);
351 FIXME: At the moment they can be, when partition contains an inline
352 clone that is clone of inline clone from outside partition. We can
353 reshape the clone tree and make other tree to be the root, but it
354 needs a bit extra work and will be promplty done by cgraph_remove_node
355 after reading back. */
356 in_other_partition = 1;
359 lto_output_uleb128_stream (ob->main_stream, wrote_decl_p);
362 bitmap_set_bit (written_decls, DECL_UID (node->decl));
364 lto_output_fn_decl_index (ob->decl_state, ob->main_stream, node->decl);
365 lto_output_sleb128_stream (ob->main_stream, node->count);
367 bp = bitpack_create ();
368 bp_pack_value (bp, node->local.local, 1);
369 bp_pack_value (bp, node->local.externally_visible, 1);
370 bp_pack_value (bp, node->local.finalized, 1);
371 bp_pack_value (bp, node->local.inlinable, 1);
372 bp_pack_value (bp, node->local.disregard_inline_limits, 1);
373 bp_pack_value (bp, node->local.redefined_extern_inline, 1);
374 bp_pack_value (bp, node->local.vtable_method, 1);
375 bp_pack_value (bp, node->needed, 1);
376 bp_pack_value (bp, node->address_taken, 1);
377 bp_pack_value (bp, node->abstract_and_needed, 1);
378 bp_pack_value (bp, tag == LTO_cgraph_analyzed_node
379 && reachable_from_other_partition_p (node, set), 1);
380 bp_pack_value (bp, node->lowered, 1);
381 bp_pack_value (bp, in_other_partition, 1);
382 bp_pack_value (bp, node->alias, 1);
383 bp_pack_value (bp, node->finalized_by_frontend, 1);
384 bp_pack_value (bp, node->frequency, 2);
385 lto_output_bitpack (ob->main_stream, bp);
388 if (tag == LTO_cgraph_analyzed_node)
390 lto_output_sleb128_stream (ob->main_stream,
391 node->local.inline_summary.estimated_self_stack_size);
392 lto_output_sleb128_stream (ob->main_stream,
393 node->local.inline_summary.self_size);
394 lto_output_sleb128_stream (ob->main_stream,
395 node->local.inline_summary.size_inlining_benefit);
396 lto_output_sleb128_stream (ob->main_stream,
397 node->local.inline_summary.self_time);
398 lto_output_sleb128_stream (ob->main_stream,
399 node->local.inline_summary.time_inlining_benefit);
400 if (node->global.inlined_to)
402 ref = lto_cgraph_encoder_lookup (encoder, node->global.inlined_to);
403 gcc_assert (ref != LCC_NOT_FOUND);
408 lto_output_sleb128_stream (ob->main_stream, ref);
411 if (node->same_comdat_group && !boundary_p)
413 ref = lto_cgraph_encoder_lookup (encoder, node->same_comdat_group);
414 gcc_assert (ref != LCC_NOT_FOUND);
418 lto_output_sleb128_stream (ob->main_stream, ref);
422 struct cgraph_node *alias;
423 unsigned long alias_count = 1;
424 for (alias = node->same_body; alias->next; alias = alias->next)
426 lto_output_uleb128_stream (ob->main_stream, alias_count);
429 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
431 if (alias->thunk.thunk_p)
433 lto_output_uleb128_stream
435 1 + (alias->thunk.this_adjusting != 0) * 2
436 + (alias->thunk.virtual_offset_p != 0) * 4);
437 lto_output_uleb128_stream (ob->main_stream,
438 alias->thunk.fixed_offset);
439 lto_output_uleb128_stream (ob->main_stream,
440 alias->thunk.virtual_value);
441 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
446 lto_output_uleb128_stream (ob->main_stream, 0);
447 lto_output_fn_decl_index (ob->decl_state, ob->main_stream,
450 alias = alias->previous;
455 lto_output_uleb128_stream (ob->main_stream, 0);
458 /* Output the varpool NODE to OB.
459 If NODE is not in SET, then NODE is a boundary. */
462 lto_output_varpool_node (struct lto_simple_output_block *ob, struct varpool_node *node,
463 varpool_node_set set)
465 bool boundary_p = !varpool_node_in_set_p (node, set) && node->analyzed;
466 struct bitpack_d *bp;
467 struct varpool_node *alias;
470 lto_output_var_decl_index (ob->decl_state, ob->main_stream, node->decl);
471 bp = bitpack_create ();
472 bp_pack_value (bp, node->externally_visible, 1);
473 bp_pack_value (bp, node->force_output, 1);
474 bp_pack_value (bp, node->finalized, 1);
475 bp_pack_value (bp, node->alias, 1);
476 gcc_assert (!node->alias || !node->extra_name);
477 gcc_assert (node->finalized || !node->analyzed);
478 gcc_assert (node->needed);
479 /* Constant pool initializers can be de-unified into individual ltrans units.
480 FIXME: Alternatively at -Os we may want to avoid generating for them the local
481 labels and share them across LTRANS partitions. */
482 if (DECL_IN_CONSTANT_POOL (node->decl))
484 bp_pack_value (bp, 0, 1); /* used_from_other_parition. */
485 bp_pack_value (bp, 0, 1); /* in_other_partition. */
489 /* FIXME: We have no idea how we move references around. For moment assume that
490 everything is used externally. */
491 bp_pack_value (bp, flag_wpa, 1); /* used_from_other_parition. */
492 bp_pack_value (bp, boundary_p, 1); /* in_other_partition. */
494 /* Also emit any extra name aliases. */
495 for (alias = node->extra_name; alias; alias = alias->next)
497 bp_pack_value (bp, count != 0, 1);
498 lto_output_bitpack (ob->main_stream, bp);
503 lto_output_uleb128_stream (ob->main_stream, count);
504 for (alias = node->extra_name; alias; alias = alias->next)
505 lto_output_var_decl_index (ob->decl_state, ob->main_stream, alias->decl);
509 /* Stream out profile_summary to OB. */
512 output_profile_summary (struct lto_simple_output_block *ob)
516 /* We do not output num, it is not terribly useful. */
517 gcc_assert (profile_info->runs);
518 lto_output_uleb128_stream (ob->main_stream, profile_info->runs);
519 lto_output_sleb128_stream (ob->main_stream, profile_info->sum_all);
520 lto_output_sleb128_stream (ob->main_stream, profile_info->run_max);
521 lto_output_sleb128_stream (ob->main_stream, profile_info->sum_max);
524 lto_output_uleb128_stream (ob->main_stream, 0);
527 /* Add NODE into encoder as well as nodes it is cloned from.
528 Do it in a way so clones appear first. */
530 add_node_to (lto_cgraph_encoder_t encoder, struct cgraph_node *node)
533 add_node_to (encoder, node->clone_of);
534 lto_cgraph_encoder_encode (encoder, node);
537 /* Output all callees or indirect outgoing edges. EDGE must be the first such
541 output_outgoing_cgraph_edges (struct cgraph_edge *edge,
542 struct lto_simple_output_block *ob,
543 lto_cgraph_encoder_t encoder)
548 /* Output edges in backward direction, so the reconstructed callgraph match
549 and it is easy to associate call sites in the IPA pass summaries. */
550 while (edge->next_callee)
551 edge = edge->next_callee;
552 for (; edge; edge = edge->prev_callee)
553 lto_output_edge (ob, edge, encoder);
556 /* Output the part of the cgraph in SET. */
559 output_cgraph (cgraph_node_set set, varpool_node_set vset)
561 struct cgraph_node *node;
562 struct lto_simple_output_block *ob;
563 cgraph_node_set_iterator csi;
564 varpool_node_set_iterator vsi;
565 struct cgraph_edge *edge;
567 bitmap written_decls;
568 lto_cgraph_encoder_t encoder;
569 lto_varpool_encoder_t varpool_encoder;
570 struct cgraph_asm_node *can;
571 struct varpool_node *vnode;
573 ob = lto_create_simple_output_block (LTO_section_cgraph);
575 output_profile_summary (ob);
577 /* An encoder for cgraph nodes should have been created by
578 ipa_write_summaries_1. */
579 gcc_assert (ob->decl_state->cgraph_node_encoder);
580 gcc_assert (ob->decl_state->varpool_node_encoder);
581 encoder = ob->decl_state->cgraph_node_encoder;
582 varpool_encoder = ob->decl_state->varpool_node_encoder;
584 /* The FUNCTION_DECLs for which we have written a node. The first
585 node found is written as the "original" node, the remaining nodes
586 are considered its clones. */
587 written_decls = lto_bitmap_alloc ();
589 /* Go over all the nodes in SET and assign references. */
590 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
592 node = csi_node (csi);
593 add_node_to (encoder, node);
595 for (vsi = vsi_start (vset); !vsi_end_p (vsi); vsi_next (&vsi))
597 struct varpool_node *vnode = vsi_node (vsi);
598 gcc_assert (!vnode->alias);
599 lto_varpool_encoder_encode (varpool_encoder, vnode);
600 lto_set_varpool_encoder_encode_initializer (varpool_encoder, vnode);
602 /* FIXME: We do not track references, so for now we need to include all possibly
603 used variables in the encoder set. */
604 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
606 lto_varpool_encoder_encode (varpool_encoder, vnode);
607 /* Pickle in also the initializer of all referenced readonly variables
608 to help folding. Constant pool variables are not shared, so we must
610 for (i = 0; i < lto_varpool_encoder_size (varpool_encoder); i++)
612 struct varpool_node *vnode = lto_varpool_encoder_deref (varpool_encoder, i);
613 if (DECL_INITIAL (vnode->decl)
614 && !lto_varpool_encoder_encode_initializer_p (varpool_encoder,
616 && (DECL_IN_CONSTANT_POOL (vnode->decl)
617 || TREE_READONLY (vnode->decl)))
619 lto_set_varpool_encoder_encode_initializer (varpool_encoder, vnode);
623 /* Go over all the nodes again to include callees that are not in
625 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
627 node = csi_node (csi);
628 for (edge = node->callees; edge; edge = edge->next_callee)
630 struct cgraph_node *callee = edge->callee;
631 if (!cgraph_node_in_set_p (callee, set))
633 /* We should have moved all the inlines. */
634 gcc_assert (!callee->global.inlined_to);
635 add_node_to (encoder, callee);
640 /* Write out the nodes. We must first output a node and then its clones,
641 otherwise at a time reading back the node there would be nothing to clone
643 n_nodes = lto_cgraph_encoder_size (encoder);
644 for (i = 0; i < n_nodes; i++)
646 node = lto_cgraph_encoder_deref (encoder, i);
647 lto_output_node (ob, node, encoder, set, written_decls);
650 lto_bitmap_free (written_decls);
652 /* Go over the nodes in SET again to write edges. */
653 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
655 node = csi_node (csi);
656 output_outgoing_cgraph_edges (node->callees, ob, encoder);
657 output_outgoing_cgraph_edges (node->indirect_calls, ob, encoder);
660 lto_output_uleb128_stream (ob->main_stream, 0);
662 /* Emit toplevel asms. */
663 for (can = cgraph_asm_nodes; can; can = can->next)
665 int len = TREE_STRING_LENGTH (can->asm_str);
666 lto_output_uleb128_stream (ob->main_stream, len);
667 for (i = 0; i < len; ++i)
668 lto_output_1_stream (ob->main_stream,
669 TREE_STRING_POINTER (can->asm_str)[i]);
672 lto_output_uleb128_stream (ob->main_stream, 0);
674 lto_destroy_simple_output_block (ob);
675 output_varpool (vset);
678 /* Overwrite the information in NODE based on FILE_DATA, TAG, FLAGS,
679 STACK_SIZE, SELF_TIME and SELF_SIZE. This is called either to initialize
680 NODE or to replace the values in it, for instance because the first
681 time we saw it, the function body was not available but now it
682 is. BP is a bitpack with all the bitflags for NODE read from the
686 input_overwrite_node (struct lto_file_decl_data *file_data,
687 struct cgraph_node *node,
688 enum LTO_cgraph_tags tag,
689 struct bitpack_d *bp,
690 unsigned int stack_size,
691 unsigned int self_time,
692 unsigned int time_inlining_benefit,
693 unsigned int self_size,
694 unsigned int size_inlining_benefit)
696 node->aux = (void *) tag;
697 node->local.inline_summary.estimated_self_stack_size = stack_size;
698 node->local.inline_summary.self_time = self_time;
699 node->local.inline_summary.time_inlining_benefit = time_inlining_benefit;
700 node->local.inline_summary.self_size = self_size;
701 node->local.inline_summary.size_inlining_benefit = size_inlining_benefit;
702 node->global.time = self_time;
703 node->global.size = self_size;
704 node->global.estimated_stack_size = stack_size;
705 node->global.estimated_growth = INT_MIN;
706 node->local.lto_file_data = file_data;
708 node->local.local = bp_unpack_value (bp, 1);
709 node->local.externally_visible = bp_unpack_value (bp, 1);
710 node->local.finalized = bp_unpack_value (bp, 1);
711 node->local.inlinable = bp_unpack_value (bp, 1);
712 node->local.disregard_inline_limits = bp_unpack_value (bp, 1);
713 node->local.redefined_extern_inline = bp_unpack_value (bp, 1);
714 node->local.vtable_method = bp_unpack_value (bp, 1);
715 node->needed = bp_unpack_value (bp, 1);
716 node->address_taken = bp_unpack_value (bp, 1);
717 node->abstract_and_needed = bp_unpack_value (bp, 1);
718 node->reachable_from_other_partition = bp_unpack_value (bp, 1);
719 node->lowered = bp_unpack_value (bp, 1);
720 node->analyzed = tag == LTO_cgraph_analyzed_node;
721 node->in_other_partition = bp_unpack_value (bp, 1);
722 node->alias = bp_unpack_value (bp, 1);
723 node->finalized_by_frontend = bp_unpack_value (bp, 1);
724 node->frequency = (enum node_frequency)bp_unpack_value (bp, 2);
727 /* Output the part of the cgraph in SET. */
730 output_varpool (varpool_node_set vset)
732 struct lto_simple_output_block *ob = lto_create_simple_output_block (LTO_section_varpool);
733 lto_varpool_encoder_t varpool_encoder = ob->decl_state->varpool_node_encoder;
734 int len = lto_varpool_encoder_size (varpool_encoder), i;
736 lto_output_uleb128_stream (ob->main_stream, len);
738 /* Write out the nodes. We must first output a node and then its clones,
739 otherwise at a time reading back the node there would be nothing to clone
741 for (i = 0; i < len; i++)
743 lto_output_varpool_node (ob, lto_varpool_encoder_deref (varpool_encoder, i),
747 lto_destroy_simple_output_block (ob);
750 /* Read a node from input_block IB. TAG is the node's tag just read.
751 Return the node read or overwriten. */
753 static struct cgraph_node *
754 input_node (struct lto_file_decl_data *file_data,
755 struct lto_input_block *ib,
756 enum LTO_cgraph_tags tag)
759 struct cgraph_node *node;
760 struct bitpack_d *bp;
764 int ref = LCC_NOT_FOUND, ref2 = LCC_NOT_FOUND;
767 int time_inlining_benefit = 0;
768 int size_inlining_benefit = 0;
769 unsigned long same_body_count = 0;
771 clone_p = (lto_input_uleb128 (ib) != 0);
773 decl_index = lto_input_uleb128 (ib);
774 fn_decl = lto_file_decl_data_get_fn_decl (file_data, decl_index);
777 node = cgraph_clone_node (cgraph_node (fn_decl), 0,
778 CGRAPH_FREQ_BASE, 0, false, NULL);
781 node = cgraph_node (fn_decl);
783 node->count = lto_input_sleb128 (ib);
784 bp = lto_input_bitpack (ib);
786 if (tag == LTO_cgraph_analyzed_node)
788 stack_size = lto_input_sleb128 (ib);
789 self_size = lto_input_sleb128 (ib);
790 size_inlining_benefit = lto_input_sleb128 (ib);
791 self_time = lto_input_sleb128 (ib);
792 time_inlining_benefit = lto_input_sleb128 (ib);
794 ref = lto_input_sleb128 (ib);
797 ref2 = lto_input_sleb128 (ib);
798 same_body_count = lto_input_uleb128 (ib);
800 /* Make sure that we have not read this node before. Nodes that
801 have already been read will have their tag stored in the 'aux'
802 field. Since built-in functions can be referenced in multiple
803 functions, they are expected to be read more than once. */
804 if (node->aux && !DECL_IS_BUILTIN (node->decl))
805 internal_error ("bytecode stream: found multiple instances of cgraph "
806 "node %d", node->uid);
808 input_overwrite_node (file_data, node, tag, bp, stack_size, self_time,
809 time_inlining_benefit, self_size,
810 size_inlining_benefit);
813 /* Store a reference for now, and fix up later to be a pointer. */
814 node->global.inlined_to = (cgraph_node_ptr) (intptr_t) ref;
816 /* Store a reference for now, and fix up later to be a pointer. */
817 node->same_comdat_group = (cgraph_node_ptr) (intptr_t) ref2;
819 while (same_body_count-- > 0)
823 decl_index = lto_input_uleb128 (ib);
824 alias_decl = lto_file_decl_data_get_fn_decl (file_data, decl_index);
825 type = lto_input_uleb128 (ib);
829 decl_index = lto_input_uleb128 (ib);
830 real_alias = lto_file_decl_data_get_fn_decl (file_data, decl_index);
831 cgraph_same_body_alias (alias_decl, real_alias);
835 HOST_WIDE_INT fixed_offset = lto_input_uleb128 (ib);
836 HOST_WIDE_INT virtual_value = lto_input_uleb128 (ib);
838 decl_index = lto_input_uleb128 (ib);
839 real_alias = lto_file_decl_data_get_fn_decl (file_data, decl_index);
840 cgraph_add_thunk (alias_decl, fn_decl, type & 2, fixed_offset,
842 (type & 4) ? size_int (virtual_value) : NULL_TREE,
849 /* Read a node from input_block IB. TAG is the node's tag just read.
850 Return the node read or overwriten. */
852 static struct varpool_node *
853 input_varpool_node (struct lto_file_decl_data *file_data,
854 struct lto_input_block *ib)
858 struct varpool_node *node;
859 struct bitpack_d *bp;
863 decl_index = lto_input_uleb128 (ib);
864 var_decl = lto_file_decl_data_get_var_decl (file_data, decl_index);
865 node = varpool_node (var_decl);
867 bp = lto_input_bitpack (ib);
868 node->externally_visible = bp_unpack_value (bp, 1);
869 node->force_output = bp_unpack_value (bp, 1);
870 node->finalized = bp_unpack_value (bp, 1);
871 node->alias = bp_unpack_value (bp, 1);
872 node->analyzed = node->finalized;
873 node->used_from_other_partition = bp_unpack_value (bp, 1);
874 node->in_other_partition = bp_unpack_value (bp, 1);
875 aliases_p = bp_unpack_value (bp, 1);
877 varpool_mark_needed_node (node);
881 count = lto_input_uleb128 (ib);
882 for (; count > 0; count --)
884 tree decl = lto_file_decl_data_get_var_decl (file_data,
885 lto_input_uleb128 (ib));
886 varpool_extra_name_alias (decl, var_decl);
893 /* Read an edge from IB. NODES points to a vector of previously read nodes for
894 decoding caller and callee of the edge to be read. If INDIRECT is true, the
895 edge being read is indirect (in the sense that it has
896 indirect_unknown_callee set). */
899 input_edge (struct lto_input_block *ib, VEC(cgraph_node_ptr, heap) *nodes,
902 struct cgraph_node *caller, *callee;
903 struct cgraph_edge *edge;
904 unsigned int stmt_id;
908 cgraph_inline_failed_t inline_failed;
909 struct bitpack_d *bp;
910 enum ld_plugin_symbol_resolution caller_resolution;
912 caller = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
913 if (caller == NULL || caller->decl == NULL_TREE)
914 internal_error ("bytecode stream: no caller found while reading edge");
918 callee = VEC_index (cgraph_node_ptr, nodes, lto_input_sleb128 (ib));
919 if (callee == NULL || callee->decl == NULL_TREE)
920 internal_error ("bytecode stream: no callee found while reading edge");
925 count = (gcov_type) lto_input_sleb128 (ib);
927 bp = lto_input_bitpack (ib);
928 stmt_id = (unsigned int) bp_unpack_value (bp, HOST_BITS_PER_INT);
929 inline_failed = (cgraph_inline_failed_t) bp_unpack_value (bp,
931 freq = (int) bp_unpack_value (bp, HOST_BITS_PER_INT);
932 nest = (unsigned) bp_unpack_value (bp, 30);
934 /* If the caller was preempted, don't create the edge.
935 ??? Should we ever have edges from a preempted caller? */
936 caller_resolution = lto_symtab_get_resolution (caller->decl);
937 if (caller_resolution == LDPR_PREEMPTED_REG
938 || caller_resolution == LDPR_PREEMPTED_IR)
942 edge = cgraph_create_indirect_edge (caller, NULL, count, freq, nest);
944 edge = cgraph_create_edge (caller, callee, NULL, count, freq, nest);
946 edge->indirect_inlining_edge = bp_unpack_value (bp, 1);
947 edge->lto_stmt_uid = stmt_id;
948 edge->inline_failed = inline_failed;
949 edge->call_stmt_cannot_inline_p = bp_unpack_value (bp, 1);
950 edge->can_throw_external = bp_unpack_value (bp, 1);
955 /* Read a cgraph from IB using the info in FILE_DATA. */
957 static VEC(cgraph_node_ptr, heap) *
958 input_cgraph_1 (struct lto_file_decl_data *file_data,
959 struct lto_input_block *ib)
961 enum LTO_cgraph_tags tag;
962 VEC(cgraph_node_ptr, heap) *nodes = NULL;
963 struct cgraph_node *node;
965 unsigned HOST_WIDE_INT len;
967 tag = (enum LTO_cgraph_tags) lto_input_uleb128 (ib);
970 if (tag == LTO_cgraph_edge)
971 input_edge (ib, nodes, false);
972 else if (tag == LTO_cgraph_indirect_edge)
973 input_edge (ib, nodes, true);
976 node = input_node (file_data, ib, tag);
977 if (node == NULL || node->decl == NULL_TREE)
978 internal_error ("bytecode stream: found empty cgraph node");
979 VEC_safe_push (cgraph_node_ptr, heap, nodes, node);
980 lto_cgraph_encoder_encode (file_data->cgraph_node_encoder, node);
983 tag = (enum LTO_cgraph_tags) lto_input_uleb128 (ib);
986 /* Input toplevel asms. */
987 len = lto_input_uleb128 (ib);
990 char *str = (char *)xmalloc (len + 1);
991 for (i = 0; i < len; ++i)
992 str[i] = lto_input_1_unsigned (ib);
993 cgraph_add_asm_node (build_string (len, str));
996 len = lto_input_uleb128 (ib);
999 for (i = 0; VEC_iterate (cgraph_node_ptr, nodes, i, node); i++)
1001 int ref = (int) (intptr_t) node->global.inlined_to;
1003 /* Fixup inlined_to from reference to pointer. */
1004 if (ref != LCC_NOT_FOUND)
1005 node->global.inlined_to = VEC_index (cgraph_node_ptr, nodes, ref);
1007 node->global.inlined_to = NULL;
1009 ref = (int) (intptr_t) node->same_comdat_group;
1011 /* Fixup same_comdat_group from reference to pointer. */
1012 if (ref != LCC_NOT_FOUND)
1013 node->same_comdat_group = VEC_index (cgraph_node_ptr, nodes, ref);
1015 node->same_comdat_group = NULL;
1020 /* Read a varpool from IB using the info in FILE_DATA. */
1022 static VEC(varpool_node_ptr, heap) *
1023 input_varpool_1 (struct lto_file_decl_data *file_data,
1024 struct lto_input_block *ib)
1026 unsigned HOST_WIDE_INT len;
1027 VEC(varpool_node_ptr, heap) *varpool = NULL;
1029 len = lto_input_uleb128 (ib);
1032 VEC_safe_push (varpool_node_ptr, heap, varpool,
1033 input_varpool_node (file_data, ib));
1040 static struct gcov_ctr_summary lto_gcov_summary;
1042 /* Input profile_info from IB. */
1044 input_profile_summary (struct lto_input_block *ib)
1046 unsigned int runs = lto_input_uleb128 (ib);
1051 profile_info = <o_gcov_summary;
1052 lto_gcov_summary.runs = runs;
1053 lto_gcov_summary.sum_all = lto_input_sleb128 (ib);
1054 lto_gcov_summary.run_max = lto_input_sleb128 (ib);
1055 lto_gcov_summary.sum_max = lto_input_sleb128 (ib);
1057 /* We can support this by scaling all counts to nearest common multiple
1058 of all different runs, but it is perhaps not worth the effort. */
1059 else if (profile_info->runs != runs
1060 || profile_info->sum_all != lto_input_sleb128 (ib)
1061 || profile_info->run_max != lto_input_sleb128 (ib)
1062 || profile_info->sum_max != lto_input_sleb128 (ib))
1063 sorry ("Combining units with different profiles is not supported.");
1064 /* We allow some units to have profile and other to not have one. This will
1065 just make unprofiled units to be size optimized that is sane. */
1070 /* Input and merge the cgraph from each of the .o files passed to
1076 struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
1077 struct lto_file_decl_data *file_data;
1079 struct cgraph_node *node;
1081 while ((file_data = file_data_vec[j++]))
1085 struct lto_input_block *ib;
1086 VEC(cgraph_node_ptr, heap) *nodes;
1087 VEC(varpool_node_ptr, heap) *varpool;
1089 ib = lto_create_simple_input_block (file_data, LTO_section_cgraph,
1091 input_profile_summary (ib);
1092 file_data->cgraph_node_encoder = lto_cgraph_encoder_new ();
1093 nodes = input_cgraph_1 (file_data, ib);
1094 lto_destroy_simple_input_block (file_data, LTO_section_cgraph,
1097 ib = lto_create_simple_input_block (file_data, LTO_section_varpool,
1099 varpool = input_varpool_1 (file_data, ib);
1100 lto_destroy_simple_input_block (file_data, LTO_section_varpool,
1103 VEC_free (cgraph_node_ptr, heap, nodes);
1104 VEC_free (varpool_node_ptr, heap, varpool);
1107 /* Clear out the aux field that was used to store enough state to
1108 tell which nodes should be overwritten. */
1109 for (node = cgraph_nodes; node; node = node->next)
1111 /* Some nodes may have been created by cgraph_node. This
1112 happens when the callgraph contains nested functions. If the
1113 node for the parent function was never emitted to the gimple
1114 file, cgraph_node will create a node for it when setting the
1115 context of the nested function. */
1116 if (node->local.lto_file_data)