1 /* Top-level LTO routines.
2 Copyright 2009, 2010, 2011 Free Software Foundation, Inc.
3 Contributed by CodeSourcery, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
27 #include "tree-flow.h"
28 #include "diagnostic-core.h"
32 #include "tree-ssa-operands.h"
33 #include "tree-pass.h"
34 #include "langhooks.h"
37 #include "pointer-set.h"
45 #include "lto-streamer.h"
46 #include "tree-streamer.h"
47 #include "splay-tree.h"
49 #include "ipa-inline.h"
50 #include "ipa-utils.h"
52 static GTY(()) tree first_personality_decl;
54 /* Returns a hash code for P. */
57 hash_name (const void *p)
59 const struct lto_section_slot *ds = (const struct lto_section_slot *) p;
60 return (hashval_t) htab_hash_string (ds->name);
64 /* Returns nonzero if P1 and P2 are equal. */
67 eq_name (const void *p1, const void *p2)
69 const struct lto_section_slot *s1 =
70 (const struct lto_section_slot *) p1;
71 const struct lto_section_slot *s2 =
72 (const struct lto_section_slot *) p2;
74 return strcmp (s1->name, s2->name) == 0;
77 /* Free lto_section_slot */
80 free_with_string (void *arg)
82 struct lto_section_slot *s = (struct lto_section_slot *)arg;
84 free (CONST_CAST (char *, s->name));
88 /* Create section hash table */
91 lto_obj_create_section_hash_table (void)
93 return htab_create (37, hash_name, eq_name, free_with_string);
96 /* Delete an allocated integer KEY in the splay tree. */
99 lto_splay_tree_delete_id (splay_tree_key key)
104 /* Compare splay tree node ids A and B. */
107 lto_splay_tree_compare_ids (splay_tree_key a, splay_tree_key b)
109 unsigned HOST_WIDE_INT ai;
110 unsigned HOST_WIDE_INT bi;
112 ai = *(unsigned HOST_WIDE_INT *) a;
113 bi = *(unsigned HOST_WIDE_INT *) b;
122 /* Look up splay tree node by ID in splay tree T. */
124 static splay_tree_node
125 lto_splay_tree_lookup (splay_tree t, unsigned HOST_WIDE_INT id)
127 return splay_tree_lookup (t, (splay_tree_key) &id);
130 /* Check if KEY has ID. */
133 lto_splay_tree_id_equal_p (splay_tree_key key, unsigned HOST_WIDE_INT id)
135 return *(unsigned HOST_WIDE_INT *) key == id;
138 /* Insert a splay tree node into tree T with ID as key and FILE_DATA as value.
139 The ID is allocated separately because we need HOST_WIDE_INTs which may
140 be wider than a splay_tree_key. */
143 lto_splay_tree_insert (splay_tree t, unsigned HOST_WIDE_INT id,
144 struct lto_file_decl_data *file_data)
146 unsigned HOST_WIDE_INT *idp = XCNEW (unsigned HOST_WIDE_INT);
148 splay_tree_insert (t, (splay_tree_key) idp, (splay_tree_value) file_data);
151 /* Create a splay tree. */
154 lto_splay_tree_new (void)
156 return splay_tree_new (lto_splay_tree_compare_ids,
157 lto_splay_tree_delete_id,
161 /* Read the constructors and inits. */
164 lto_materialize_constructors_and_inits (struct lto_file_decl_data * file_data)
167 const char *data = lto_get_section_data (file_data,
168 LTO_section_static_initializer,
170 lto_input_constructors_and_inits (file_data, data);
171 lto_free_section_data (file_data, LTO_section_static_initializer, NULL,
175 /* Return true when NODE has a clone that is analyzed (i.e. we need
176 to load its body even if the node itself is not needed). */
179 has_analyzed_clone_p (struct cgraph_node *node)
181 struct cgraph_node *orig = node;
190 else if (node->next_sibling_clone)
191 node = node->next_sibling_clone;
194 while (node != orig && !node->next_sibling_clone)
195 node = node->clone_of;
197 node = node->next_sibling_clone;
203 /* Read the function body for the function associated with NODE. */
206 lto_materialize_function (struct cgraph_node *node)
209 struct lto_file_decl_data *file_data;
210 const char *data, *name;
214 /* Read in functions with body (analyzed nodes)
215 and also functions that are needed to produce virtual clones. */
216 if (cgraph_function_with_gimple_body_p (node) || has_analyzed_clone_p (node))
218 /* Clones and thunks don't need to be read. */
222 /* Load the function body only if not operating in WPA mode. In
223 WPA mode, the body of the function is not needed. */
226 file_data = node->local.lto_file_data;
227 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
229 /* We may have renamed the declaration, e.g., a static function. */
230 name = lto_get_decl_name_mapping (file_data, name);
232 data = lto_get_section_data (file_data, LTO_section_function_body,
235 fatal_error ("%s: section %s is missing",
236 file_data->file_name,
239 gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL);
241 allocate_struct_function (decl, false);
242 announce_function (decl);
243 lto_input_function_body (file_data, decl, data);
244 if (DECL_FUNCTION_PERSONALITY (decl) && !first_personality_decl)
245 first_personality_decl = DECL_FUNCTION_PERSONALITY (decl);
246 lto_stats.num_function_bodies++;
247 lto_free_section_data (file_data, LTO_section_function_body, name,
253 /* Let the middle end know about the function. */
254 rest_of_decl_compilation (decl, 1, 0);
258 /* Decode the content of memory pointed to by DATA in the in decl
259 state object STATE. DATA_IN points to a data_in structure for
260 decoding. Return the address after the decoded object in the
263 static const uint32_t *
264 lto_read_in_decl_state (struct data_in *data_in, const uint32_t *data,
265 struct lto_in_decl_state *state)
272 decl = streamer_tree_cache_get (data_in->reader_cache, ix);
273 if (TREE_CODE (decl) != FUNCTION_DECL)
275 gcc_assert (decl == void_type_node);
278 state->fn_decl = decl;
280 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
282 uint32_t size = *data++;
283 tree *decls = ggc_alloc_vec_tree (size);
285 for (j = 0; j < size; j++)
286 decls[j] = streamer_tree_cache_get (data_in->reader_cache, data[j]);
288 state->streams[i].size = size;
289 state->streams[i].trees = decls;
296 /* A hashtable of trees that potentially refer to variables or functions
297 that must be replaced with their prevailing variant. */
298 static GTY((if_marked ("ggc_marked_p"), param_is (union tree_node))) htab_t
301 /* Remember that T is a tree that (potentially) refers to a variable
302 or function decl that may be replaced with its prevailing variant. */
304 remember_with_vars (tree t)
306 *(tree *) htab_find_slot (tree_with_vars, t, INSERT) = t;
309 #define GIMPLE_REGISTER_TYPE(tt) \
310 (TREE_VISITED (tt) ? gimple_register_type (tt) : tt)
312 #define LTO_FIXUP_TREE(tt) \
318 (tt) = GIMPLE_REGISTER_TYPE (tt); \
319 if (VAR_OR_FUNCTION_DECL_P (tt) && TREE_PUBLIC (tt)) \
320 remember_with_vars (t); \
324 static void lto_fixup_types (tree);
326 /* Fix up fields of a tree_typed T. */
329 lto_ft_typed (tree t)
331 LTO_FIXUP_TREE (TREE_TYPE (t));
334 /* Fix up fields of a tree_common T. */
337 lto_ft_common (tree t)
340 LTO_FIXUP_TREE (TREE_CHAIN (t));
343 /* Fix up fields of a decl_minimal T. */
346 lto_ft_decl_minimal (tree t)
349 LTO_FIXUP_TREE (DECL_NAME (t));
350 LTO_FIXUP_TREE (DECL_CONTEXT (t));
353 /* Fix up fields of a decl_common T. */
356 lto_ft_decl_common (tree t)
358 lto_ft_decl_minimal (t);
359 LTO_FIXUP_TREE (DECL_SIZE (t));
360 LTO_FIXUP_TREE (DECL_SIZE_UNIT (t));
361 LTO_FIXUP_TREE (DECL_INITIAL (t));
362 LTO_FIXUP_TREE (DECL_ATTRIBUTES (t));
363 LTO_FIXUP_TREE (DECL_ABSTRACT_ORIGIN (t));
366 /* Fix up fields of a decl_with_vis T. */
369 lto_ft_decl_with_vis (tree t)
371 lto_ft_decl_common (t);
373 /* Accessor macro has side-effects, use field-name here. */
374 LTO_FIXUP_TREE (t->decl_with_vis.assembler_name);
375 LTO_FIXUP_TREE (DECL_SECTION_NAME (t));
378 /* Fix up fields of a decl_non_common T. */
381 lto_ft_decl_non_common (tree t)
383 lto_ft_decl_with_vis (t);
384 LTO_FIXUP_TREE (DECL_ARGUMENT_FLD (t));
385 LTO_FIXUP_TREE (DECL_RESULT_FLD (t));
386 LTO_FIXUP_TREE (DECL_VINDEX (t));
387 /* The C frontends may create exact duplicates for DECL_ORIGINAL_TYPE
388 like for 'typedef enum foo foo'. We have no way of avoiding to
389 merge them and dwarf2out.c cannot deal with this,
390 so fix this up by clearing DECL_ORIGINAL_TYPE in this case. */
391 if (TREE_CODE (t) == TYPE_DECL
392 && DECL_ORIGINAL_TYPE (t) == TREE_TYPE (t))
393 DECL_ORIGINAL_TYPE (t) = NULL_TREE;
396 /* Fix up fields of a decl_non_common T. */
399 lto_ft_function (tree t)
401 lto_ft_decl_non_common (t);
402 LTO_FIXUP_TREE (DECL_FUNCTION_PERSONALITY (t));
405 /* Fix up fields of a field_decl T. */
408 lto_ft_field_decl (tree t)
410 lto_ft_decl_common (t);
411 LTO_FIXUP_TREE (DECL_FIELD_OFFSET (t));
412 LTO_FIXUP_TREE (DECL_BIT_FIELD_TYPE (t));
413 LTO_FIXUP_TREE (DECL_QUALIFIER (t));
414 LTO_FIXUP_TREE (DECL_FIELD_BIT_OFFSET (t));
415 LTO_FIXUP_TREE (DECL_FCONTEXT (t));
418 /* Fix up fields of a type T. */
424 LTO_FIXUP_TREE (TYPE_CACHED_VALUES (t));
425 LTO_FIXUP_TREE (TYPE_SIZE (t));
426 LTO_FIXUP_TREE (TYPE_SIZE_UNIT (t));
427 LTO_FIXUP_TREE (TYPE_ATTRIBUTES (t));
428 LTO_FIXUP_TREE (TYPE_NAME (t));
430 /* Accessors are for derived node types only. */
431 if (!POINTER_TYPE_P (t))
432 LTO_FIXUP_TREE (TYPE_MINVAL (t));
433 LTO_FIXUP_TREE (TYPE_MAXVAL (t));
435 /* Accessor is for derived node types only. */
436 LTO_FIXUP_TREE (t->type_non_common.binfo);
438 LTO_FIXUP_TREE (TYPE_CONTEXT (t));
441 /* Fix up fields of a BINFO T. */
444 lto_ft_binfo (tree t)
446 unsigned HOST_WIDE_INT i, n;
447 tree base, saved_base;
450 LTO_FIXUP_TREE (BINFO_VTABLE (t));
451 LTO_FIXUP_TREE (BINFO_OFFSET (t));
452 LTO_FIXUP_TREE (BINFO_VIRTUALS (t));
453 LTO_FIXUP_TREE (BINFO_VPTR_FIELD (t));
454 n = VEC_length (tree, BINFO_BASE_ACCESSES (t));
455 for (i = 0; i < n; i++)
457 saved_base = base = BINFO_BASE_ACCESS (t, i);
458 LTO_FIXUP_TREE (base);
459 if (base != saved_base)
460 VEC_replace (tree, BINFO_BASE_ACCESSES (t), i, base);
462 LTO_FIXUP_TREE (BINFO_INHERITANCE_CHAIN (t));
463 LTO_FIXUP_TREE (BINFO_SUBVTT_INDEX (t));
464 LTO_FIXUP_TREE (BINFO_VPTR_INDEX (t));
465 n = BINFO_N_BASE_BINFOS (t);
466 for (i = 0; i < n; i++)
468 saved_base = base = BINFO_BASE_BINFO (t, i);
469 LTO_FIXUP_TREE (base);
470 if (base != saved_base)
471 VEC_replace (tree, BINFO_BASE_BINFOS (t), i, base);
475 /* Fix up fields of a CONSTRUCTOR T. */
478 lto_ft_constructor (tree t)
480 unsigned HOST_WIDE_INT idx;
486 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (t), idx, ce);
489 LTO_FIXUP_TREE (ce->index);
490 LTO_FIXUP_TREE (ce->value);
494 /* Fix up fields of an expression tree T. */
501 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
502 LTO_FIXUP_TREE (TREE_OPERAND (t, i));
505 /* Given a tree T fixup fields of T by replacing types with their merged
506 variant and other entities by an equal entity from an earlier compilation
507 unit, or an entity being canonical in a different way. This includes
508 for instance integer or string constants. */
511 lto_fixup_types (tree t)
513 switch (TREE_CODE (t))
515 case IDENTIFIER_NODE:
519 LTO_FIXUP_TREE (TREE_VALUE (t));
520 LTO_FIXUP_TREE (TREE_PURPOSE (t));
521 LTO_FIXUP_TREE (TREE_CHAIN (t));
525 lto_ft_field_decl (t);
533 lto_ft_decl_common (t);
537 lto_ft_decl_with_vis (t);
541 lto_ft_decl_non_common (t);
552 case PLACEHOLDER_EXPR:
557 case TRANSLATION_UNIT_DECL:
558 case OPTIMIZATION_NODE:
559 case TARGET_OPTION_NODE:
565 else if (TREE_CODE (t) == CONSTRUCTOR)
566 lto_ft_constructor (t);
567 else if (CONSTANT_CLASS_P (t))
568 LTO_FIXUP_TREE (TREE_TYPE (t));
575 remember_with_vars (t);
581 /* Return the resolution for the decl with index INDEX from DATA_IN. */
583 static enum ld_plugin_symbol_resolution
584 get_resolution (struct data_in *data_in, unsigned index)
586 if (data_in->globals_resolution)
588 ld_plugin_symbol_resolution_t ret;
589 /* We can have references to not emitted functions in
590 DECL_FUNCTION_PERSONALITY at least. So we can and have
591 to indeed return LDPR_UNKNOWN in some cases. */
592 if (VEC_length (ld_plugin_symbol_resolution_t,
593 data_in->globals_resolution) <= index)
595 ret = VEC_index (ld_plugin_symbol_resolution_t,
596 data_in->globals_resolution,
601 /* Delay resolution finding until decl merging. */
606 /* Register DECL with the global symbol table and change its
607 name if necessary to avoid name clashes for static globals across
611 lto_register_var_decl_in_symtab (struct data_in *data_in, tree decl)
615 /* Variable has file scope, not local. Need to ensure static variables
616 between different files don't clash unexpectedly. */
617 if (!TREE_PUBLIC (decl)
618 && !((context = decl_function_context (decl))
619 && auto_var_in_fn_p (decl, context)))
621 /* ??? We normally pre-mangle names before we serialize them
622 out. Here, in lto1, we do not know the language, and
623 thus cannot do the mangling again. Instead, we just
624 append a suffix to the mangled name. The resulting name,
625 however, is not a properly-formed mangled name, and will
626 confuse any attempt to unmangle it. */
627 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
630 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
631 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
632 rest_of_decl_compilation (decl, 1, 0);
633 VEC_safe_push (tree, gc, lto_global_var_decls, decl);
636 /* If this variable has already been declared, queue the
637 declaration for merging. */
638 if (TREE_PUBLIC (decl))
641 if (!streamer_tree_cache_lookup (data_in->reader_cache, decl, &ix))
643 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
649 /* Register DECL with the global symbol table and change its
650 name if necessary to avoid name clashes for static globals across
651 different files. DATA_IN contains descriptors and tables for the
655 lto_register_function_decl_in_symtab (struct data_in *data_in, tree decl)
657 /* Need to ensure static entities between different files
658 don't clash unexpectedly. */
659 if (!TREE_PUBLIC (decl))
661 /* We must not use the DECL_ASSEMBLER_NAME macro here, as it
662 may set the assembler name where it was previously empty. */
663 tree old_assembler_name = decl->decl_with_vis.assembler_name;
665 /* FIXME lto: We normally pre-mangle names before we serialize
666 them out. Here, in lto1, we do not know the language, and
667 thus cannot do the mangling again. Instead, we just append a
668 suffix to the mangled name. The resulting name, however, is
669 not a properly-formed mangled name, and will confuse any
670 attempt to unmangle it. */
671 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
674 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl));
675 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label));
677 /* We may arrive here with the old assembler name not set
678 if the function body is not needed, e.g., it has been
679 inlined away and does not appear in the cgraph. */
680 if (old_assembler_name)
682 tree new_assembler_name = DECL_ASSEMBLER_NAME (decl);
684 /* Make the original assembler name available for later use.
685 We may have used it to indicate the section within its
686 object file where the function body may be found.
687 FIXME lto: Find a better way to maintain the function decl
688 to body section mapping so we don't need this hack. */
689 lto_record_renamed_decl (data_in->file_data,
690 IDENTIFIER_POINTER (old_assembler_name),
691 IDENTIFIER_POINTER (new_assembler_name));
695 /* If this variable has already been declared, queue the
696 declaration for merging. */
697 if (TREE_PUBLIC (decl) && !DECL_ABSTRACT (decl))
700 if (!streamer_tree_cache_lookup (data_in->reader_cache, decl, &ix))
702 lto_symtab_register_decl (decl, get_resolution (data_in, ix),
708 /* Given a streamer cache structure DATA_IN (holding a sequence of trees
709 for one compilation unit) go over all trees starting at index FROM until the
710 end of the sequence and replace fields of those trees, and the trees
711 themself with their canonical variants as per gimple_register_type. */
714 uniquify_nodes (struct data_in *data_in, unsigned from)
716 struct streamer_tree_cache_d *cache = data_in->reader_cache;
717 unsigned len = VEC_length (tree, cache->nodes);
720 /* Go backwards because children streamed for the first time come
721 as part of their parents, and hence are created after them. */
723 /* First register all the types in the cache. This makes sure to
724 have the original structure in the type cycles when registering
725 them and computing hashes. */
726 for (i = len; i-- > from;)
728 tree t = VEC_index (tree, cache->nodes, i);
731 tree newt = gimple_register_type (t);
732 /* Mark non-prevailing types so we fix them up. No need
733 to reset that flag afterwards - nothing that refers
734 to those types is left and they are collected. */
736 TREE_VISITED (t) = 1;
740 /* Second fixup all trees in the new cache entries. */
741 for (i = len; i-- > from;)
743 tree t = VEC_index (tree, cache->nodes, i);
748 /* First fixup the fields of T. */
754 /* Now try to find a canonical variant of T itself. */
755 t = GIMPLE_REGISTER_TYPE (t);
759 /* The following re-creates proper variant lists while fixing up
760 the variant leaders. We do not stream TYPE_NEXT_VARIANT so the
761 variant list state before fixup is broken. */
764 /* Remove us from our main variant list if we are not the
766 if (TYPE_MAIN_VARIANT (t) != t)
768 tem = TYPE_MAIN_VARIANT (t);
769 while (tem && TYPE_NEXT_VARIANT (tem) != t)
770 tem = TYPE_NEXT_VARIANT (tem);
772 TYPE_NEXT_VARIANT (tem) = TYPE_NEXT_VARIANT (t);
773 TYPE_NEXT_VARIANT (t) = NULL_TREE;
776 /* Query our new main variant. */
777 mv = GIMPLE_REGISTER_TYPE (TYPE_MAIN_VARIANT (t));
779 /* If we were the variant leader and we get replaced ourselves drop
780 all variants from our list. */
781 if (TYPE_MAIN_VARIANT (t) == t
787 tree tem2 = TYPE_NEXT_VARIANT (tem);
788 TYPE_NEXT_VARIANT (tem) = NULL_TREE;
793 /* If we are not our own variant leader link us into our new leaders
797 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (mv);
798 TYPE_NEXT_VARIANT (mv) = t;
799 if (RECORD_OR_UNION_TYPE_P (t))
800 TYPE_BINFO (t) = TYPE_BINFO (mv);
803 /* Finally adjust our main variant and fix it up. */
804 TYPE_MAIN_VARIANT (t) = mv;
806 /* The following reconstructs the pointer chains
807 of the new pointed-to type if we are a main variant. We do
808 not stream those so they are broken before fixup. */
809 if (TREE_CODE (t) == POINTER_TYPE
810 && TYPE_MAIN_VARIANT (t) == t)
812 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (TREE_TYPE (t));
813 TYPE_POINTER_TO (TREE_TYPE (t)) = t;
815 else if (TREE_CODE (t) == REFERENCE_TYPE
816 && TYPE_MAIN_VARIANT (t) == t)
818 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (TREE_TYPE (t));
819 TYPE_REFERENCE_TO (TREE_TYPE (t)) = t;
825 if (RECORD_OR_UNION_TYPE_P (t))
828 if (TYPE_FIELDS (t) != TYPE_FIELDS (oldt))
829 for (f1 = TYPE_FIELDS (t), f2 = TYPE_FIELDS (oldt);
830 f1 && f2; f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2))
833 gcc_assert (f1 != f2 && DECL_NAME (f1) == DECL_NAME (f2));
834 if (!streamer_tree_cache_lookup (cache, f2, &ix))
836 /* If we're going to replace an element which we'd
837 still visit in the next iterations, we wouldn't
838 handle it, so do it here. We do have to handle it
839 even though the field_decl itself will be removed,
840 as it could refer to e.g. integer_cst which we
841 wouldn't reach via any other way, hence they
842 (and their type) would stay uncollected. */
843 /* ??? We should rather make sure to replace all
844 references to f2 with f1. That means handling
845 COMPONENT_REFs and CONSTRUCTOR elements in
846 lto_fixup_types and special-case the field-decl
849 lto_fixup_types (f2);
850 streamer_tree_cache_insert_at (cache, f1, ix);
854 /* If we found a tree that is equal to oldt replace it in the
855 cache, so that further users (in the various LTO sections)
857 streamer_tree_cache_insert_at (cache, t, i);
861 /* Finally compute the canonical type of all TREE_TYPEs and register
862 VAR_DECL and FUNCTION_DECL nodes in the symbol table.
863 From this point there are no longer any types with
864 TYPE_STRUCTURAL_EQUALITY_P and its type-based alias problems.
865 This step requires the TYPE_POINTER_TO lists being present, so
866 make sure it is done last. */
867 for (i = len; i-- > from;)
869 tree t = VEC_index (tree, cache->nodes, i);
873 if (TREE_CODE (t) == VAR_DECL)
874 lto_register_var_decl_in_symtab (data_in, t);
875 else if (TREE_CODE (t) == FUNCTION_DECL && !DECL_BUILT_IN (t))
876 lto_register_function_decl_in_symtab (data_in, t);
878 && TREE_CODE (t) == TYPE_DECL)
879 debug_hooks->type_decl (t, !DECL_FILE_SCOPE_P (t));
880 else if (TYPE_P (t) && !TYPE_CANONICAL (t))
881 TYPE_CANONICAL (t) = gimple_register_canonical_type (t);
886 /* Read all the symbols from buffer DATA, using descriptors in DECL_DATA.
887 RESOLUTIONS is the set of symbols picked by the linker (read from the
888 resolution file when the linker plugin is being used). */
891 lto_read_decls (struct lto_file_decl_data *decl_data, const void *data,
892 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions)
894 const struct lto_decl_header *header = (const struct lto_decl_header *) data;
895 const int decl_offset = sizeof (struct lto_decl_header);
896 const int main_offset = decl_offset + header->decl_state_size;
897 const int string_offset = main_offset + header->main_size;
898 struct lto_input_block ib_main;
899 struct data_in *data_in;
901 const uint32_t *data_ptr, *data_end;
902 uint32_t num_decl_states;
904 LTO_INIT_INPUT_BLOCK (ib_main, (const char *) data + main_offset, 0,
907 data_in = lto_data_in_create (decl_data, (const char *) data + string_offset,
908 header->string_size, resolutions);
910 /* We do not uniquify the pre-loaded cache entries, those are middle-end
911 internal types that should not be merged. */
913 /* Read the global declarations and types. */
914 while (ib_main.p < ib_main.len)
917 unsigned from = VEC_length (tree, data_in->reader_cache->nodes);
918 t = stream_read_tree (&ib_main, data_in);
919 gcc_assert (t && ib_main.p <= ib_main.len);
920 uniquify_nodes (data_in, from);
923 /* Read in lto_in_decl_state objects. */
924 data_ptr = (const uint32_t *) ((const char*) data + decl_offset);
926 (const uint32_t *) ((const char*) data_ptr + header->decl_state_size);
927 num_decl_states = *data_ptr++;
929 gcc_assert (num_decl_states > 0);
930 decl_data->global_decl_state = lto_new_in_decl_state ();
931 data_ptr = lto_read_in_decl_state (data_in, data_ptr,
932 decl_data->global_decl_state);
934 /* Read in per-function decl states and enter them in hash table. */
935 decl_data->function_decl_states =
936 htab_create_ggc (37, lto_hash_in_decl_state, lto_eq_in_decl_state, NULL);
938 for (i = 1; i < num_decl_states; i++)
940 struct lto_in_decl_state *state = lto_new_in_decl_state ();
943 data_ptr = lto_read_in_decl_state (data_in, data_ptr, state);
944 slot = htab_find_slot (decl_data->function_decl_states, state, INSERT);
945 gcc_assert (*slot == NULL);
949 if (data_ptr != data_end)
950 internal_error ("bytecode stream: garbage at the end of symbols section");
952 /* Set the current decl state to be the global state. */
953 decl_data->current_decl_state = decl_data->global_decl_state;
955 lto_data_in_delete (data_in);
958 /* Custom version of strtoll, which is not portable. */
960 static HOST_WIDEST_INT
961 lto_parse_hex (const char *p)
963 HOST_WIDEST_INT ret = 0;
965 for (; *p != '\0'; ++p)
970 if (c >= '0' && c <= '9')
972 else if (c >= 'a' && c <= 'f')
974 else if (c >= 'A' && c <= 'F')
977 internal_error ("could not parse hex number");
984 /* Read resolution for file named FILE_NAME. The resolution is read from
988 lto_resolution_read (splay_tree file_ids, FILE *resolution, lto_file *file)
990 /* We require that objects in the resolution file are in the same
991 order as the lto1 command line. */
992 unsigned int name_len;
994 unsigned int num_symbols;
996 struct lto_file_decl_data *file_data;
997 splay_tree_node nd = NULL;
1002 name_len = strlen (file->filename);
1003 obj_name = XNEWVEC (char, name_len + 1);
1004 fscanf (resolution, " "); /* Read white space. */
1006 fread (obj_name, sizeof (char), name_len, resolution);
1007 obj_name[name_len] = '\0';
1008 if (filename_cmp (obj_name, file->filename) != 0)
1009 internal_error ("unexpected file name %s in linker resolution file. "
1010 "Expected %s", obj_name, file->filename);
1011 if (file->offset != 0)
1015 HOST_WIDEST_INT offset;
1016 t = fscanf (resolution, "@0x%16s", offset_p);
1018 internal_error ("could not parse file offset");
1019 offset = lto_parse_hex (offset_p);
1020 if (offset != file->offset)
1021 internal_error ("unexpected offset");
1026 fscanf (resolution, "%u", &num_symbols);
1028 for (i = 0; i < num_symbols; i++)
1032 unsigned HOST_WIDE_INT id;
1034 enum ld_plugin_symbol_resolution r = (enum ld_plugin_symbol_resolution) 0;
1036 unsigned int lto_resolution_str_len =
1037 sizeof (lto_resolution_str) / sizeof (char *);
1040 t = fscanf (resolution, "%u " HOST_WIDE_INT_PRINT_HEX_PURE " %26s %*[^\n]\n",
1041 &index, &id, r_str);
1043 internal_error ("invalid line in the resolution file");
1045 for (j = 0; j < lto_resolution_str_len; j++)
1047 if (strcmp (lto_resolution_str[j], r_str) == 0)
1049 r = (enum ld_plugin_symbol_resolution) j;
1053 if (j == lto_resolution_str_len)
1054 internal_error ("invalid resolution in the resolution file");
1056 if (!(nd && lto_splay_tree_id_equal_p (nd->key, id)))
1058 nd = lto_splay_tree_lookup (file_ids, id);
1060 internal_error ("resolution sub id " HOST_WIDE_INT_PRINT_HEX_PURE
1061 " not in object file", id);
1064 file_data = (struct lto_file_decl_data *)nd->value;
1065 /* The indexes are very sparse. To save memory save them in a compact
1066 format that is only unpacked later when the subfile is processed. */
1069 VEC_safe_push (res_pair, heap, file_data->respairs, &rp);
1070 if (file_data->max_index < index)
1071 file_data->max_index = index;
1075 /* List of file_decl_datas */
1076 struct file_data_list
1078 struct lto_file_decl_data *first, *last;
1081 /* Is the name for a id'ed LTO section? */
1084 lto_section_with_id (const char *name, unsigned HOST_WIDE_INT *id)
1088 if (strncmp (name, LTO_SECTION_NAME_PREFIX, strlen (LTO_SECTION_NAME_PREFIX)))
1090 s = strrchr (name, '.');
1091 return s && sscanf (s, "." HOST_WIDE_INT_PRINT_HEX_PURE, id) == 1;
1094 /* Create file_data of each sub file id */
1097 create_subid_section_table (struct lto_section_slot *ls, splay_tree file_ids,
1098 struct file_data_list *list)
1100 struct lto_section_slot s_slot, *new_slot;
1101 unsigned HOST_WIDE_INT id;
1105 struct lto_file_decl_data *file_data;
1107 if (!lto_section_with_id (ls->name, &id))
1110 /* Find hash table of sub module id */
1111 nd = lto_splay_tree_lookup (file_ids, id);
1114 file_data = (struct lto_file_decl_data *)nd->value;
1118 file_data = ggc_alloc_lto_file_decl_data ();
1119 memset(file_data, 0, sizeof (struct lto_file_decl_data));
1121 file_data->section_hash_table = lto_obj_create_section_hash_table ();;
1122 lto_splay_tree_insert (file_ids, id, file_data);
1124 /* Maintain list in linker order */
1126 list->first = file_data;
1128 list->last->next = file_data;
1129 list->last = file_data;
1132 /* Copy section into sub module hash table */
1133 new_name = XDUPVEC (char, ls->name, strlen (ls->name) + 1);
1134 s_slot.name = new_name;
1135 hash_slot = htab_find_slot (file_data->section_hash_table, &s_slot, INSERT);
1136 gcc_assert (*hash_slot == NULL);
1138 new_slot = XDUP (struct lto_section_slot, ls);
1139 new_slot->name = new_name;
1140 *hash_slot = new_slot;
1144 /* Read declarations and other initializations for a FILE_DATA. */
1147 lto_file_finalize (struct lto_file_decl_data *file_data, lto_file *file)
1151 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions = NULL;
1155 /* Create vector for fast access of resolution. We do this lazily
1157 VEC_safe_grow_cleared (ld_plugin_symbol_resolution_t, heap,
1159 file_data->max_index + 1);
1160 for (i = 0; VEC_iterate (res_pair, file_data->respairs, i, rp); i++)
1161 VEC_replace (ld_plugin_symbol_resolution_t, resolutions, rp->index, rp->res);
1162 VEC_free (res_pair, heap, file_data->respairs);
1164 file_data->renaming_hash_table = lto_create_renaming_table ();
1165 file_data->file_name = file->filename;
1166 data = lto_get_section_data (file_data, LTO_section_decls, NULL, &len);
1169 internal_error ("cannot read LTO decls from %s", file_data->file_name);
1172 /* Frees resolutions */
1173 lto_read_decls (file_data, data, resolutions);
1174 lto_free_section_data (file_data, LTO_section_decls, NULL, data, len);
1177 /* Finalize FILE_DATA in FILE and increase COUNT. */
1180 lto_create_files_from_ids (lto_file *file, struct lto_file_decl_data *file_data,
1183 lto_file_finalize (file_data, file);
1184 if (cgraph_dump_file)
1185 fprintf (cgraph_dump_file, "Creating file %s with sub id " HOST_WIDE_INT_PRINT_HEX "\n",
1186 file_data->file_name, file_data->id);
1191 /* Generate a TREE representation for all types and external decls
1194 Read all of the globals out of the file. Then read the cgraph
1195 and process the .o index into the cgraph nodes so that it can open
1196 the .o file to load the functions and ipa information. */
1198 static struct lto_file_decl_data *
1199 lto_file_read (lto_file *file, FILE *resolution_file, int *count)
1201 struct lto_file_decl_data *file_data = NULL;
1202 splay_tree file_ids;
1203 htab_t section_hash_table;
1204 struct lto_section_slot *section;
1205 struct file_data_list file_list;
1206 struct lto_section_list section_list;
1208 memset (§ion_list, 0, sizeof (struct lto_section_list));
1209 section_hash_table = lto_obj_build_section_table (file, §ion_list);
1211 /* Find all sub modules in the object and put their sections into new hash
1212 tables in a splay tree. */
1213 file_ids = lto_splay_tree_new ();
1214 memset (&file_list, 0, sizeof (struct file_data_list));
1215 for (section = section_list.first; section != NULL; section = section->next)
1216 create_subid_section_table (section, file_ids, &file_list);
1218 /* Add resolutions to file ids */
1219 lto_resolution_read (file_ids, resolution_file, file);
1221 /* Finalize each lto file for each submodule in the merged object */
1222 for (file_data = file_list.first; file_data != NULL; file_data = file_data->next)
1223 lto_create_files_from_ids (file, file_data, count);
1225 splay_tree_delete (file_ids);
1226 htab_delete (section_hash_table);
1228 return file_list.first;
1231 #if HAVE_MMAP_FILE && HAVE_SYSCONF && defined _SC_PAGE_SIZE
1232 #define LTO_MMAP_IO 1
1236 /* Page size of machine is used for mmap and munmap calls. */
1237 static size_t page_mask;
1240 /* Get the section data of length LEN from FILENAME starting at
1241 OFFSET. The data segment must be freed by the caller when the
1242 caller is finished. Returns NULL if all was not well. */
1245 lto_read_section_data (struct lto_file_decl_data *file_data,
1246 intptr_t offset, size_t len)
1250 static char *fd_name;
1252 intptr_t computed_len;
1253 intptr_t computed_offset;
1257 /* Keep a single-entry file-descriptor cache. The last file we
1258 touched will get closed at exit.
1259 ??? Eventually we want to add a more sophisticated larger cache
1260 or rather fix function body streaming to not stream them in
1261 practically random order. */
1263 && filename_cmp (fd_name, file_data->file_name) != 0)
1271 fd = open (file_data->file_name, O_RDONLY|O_BINARY);
1274 fatal_error ("Cannot open %s", file_data->file_name);
1277 fd_name = xstrdup (file_data->file_name);
1283 size_t page_size = sysconf (_SC_PAGE_SIZE);
1284 page_mask = ~(page_size - 1);
1287 computed_offset = offset & page_mask;
1288 diff = offset - computed_offset;
1289 computed_len = len + diff;
1291 result = (char *) mmap (NULL, computed_len, PROT_READ, MAP_PRIVATE,
1292 fd, computed_offset);
1293 if (result == MAP_FAILED)
1295 fatal_error ("Cannot map %s", file_data->file_name);
1299 return result + diff;
1301 result = (char *) xmalloc (len);
1302 if (lseek (fd, offset, SEEK_SET) != offset
1303 || read (fd, result, len) != (ssize_t) len)
1306 fatal_error ("Cannot read %s", file_data->file_name);
1310 /* Native windows doesn't supports delayed unlink on opened file. So
1311 we close file here again. This produces higher I/O load, but at least
1312 it prevents to have dangling file handles preventing unlink. */
1323 /* Get the section data from FILE_DATA of SECTION_TYPE with NAME.
1324 NAME will be NULL unless the section type is for a function
1328 get_section_data (struct lto_file_decl_data *file_data,
1329 enum lto_section_type section_type,
1333 htab_t section_hash_table = file_data->section_hash_table;
1334 struct lto_section_slot *f_slot;
1335 struct lto_section_slot s_slot;
1336 const char *section_name = lto_get_section_name (section_type, name, file_data);
1340 s_slot.name = section_name;
1341 f_slot = (struct lto_section_slot *) htab_find (section_hash_table, &s_slot);
1344 data = lto_read_section_data (file_data, f_slot->start, f_slot->len);
1348 free (CONST_CAST (char *, section_name));
1353 /* Free the section data from FILE_DATA of SECTION_TYPE with NAME that
1354 starts at OFFSET and has LEN bytes. */
1357 free_section_data (struct lto_file_decl_data *file_data ATTRIBUTE_UNUSED,
1358 enum lto_section_type section_type ATTRIBUTE_UNUSED,
1359 const char *name ATTRIBUTE_UNUSED,
1360 const char *offset, size_t len ATTRIBUTE_UNUSED)
1363 intptr_t computed_len;
1364 intptr_t computed_offset;
1369 computed_offset = ((intptr_t) offset) & page_mask;
1370 diff = (intptr_t) offset - computed_offset;
1371 computed_len = len + diff;
1373 munmap ((caddr_t) computed_offset, computed_len);
1375 free (CONST_CAST(char *, offset));
1379 /* Structure describing ltrans partitions. */
1381 struct ltrans_partition_def
1383 cgraph_node_set cgraph_set;
1384 varpool_node_set varpool_set;
1389 typedef struct ltrans_partition_def *ltrans_partition;
1390 DEF_VEC_P(ltrans_partition);
1391 DEF_VEC_ALLOC_P(ltrans_partition,heap);
1393 static VEC(ltrans_partition, heap) *ltrans_partitions;
1395 static void add_cgraph_node_to_partition (ltrans_partition part, struct cgraph_node *node);
1396 static void add_varpool_node_to_partition (ltrans_partition part, struct varpool_node *vnode);
1398 /* Create new partition with name NAME. */
1399 static ltrans_partition
1400 new_partition (const char *name)
1402 ltrans_partition part = XCNEW (struct ltrans_partition_def);
1403 part->cgraph_set = cgraph_node_set_new ();
1404 part->varpool_set = varpool_node_set_new ();
1407 VEC_safe_push (ltrans_partition, heap, ltrans_partitions, part);
1411 /* Free memory used by ltrans datastructures. */
1413 free_ltrans_partitions (void)
1416 ltrans_partition part;
1417 for (idx = 0; VEC_iterate (ltrans_partition, ltrans_partitions, idx, part); idx++)
1419 free_cgraph_node_set (part->cgraph_set);
1422 VEC_free (ltrans_partition, heap, ltrans_partitions);
1425 /* See all references that go to comdat objects and bring them into partition too. */
1427 add_references_to_partition (ltrans_partition part, struct ipa_ref_list *refs)
1430 struct ipa_ref *ref;
1431 for (i = 0; ipa_ref_list_reference_iterate (refs, i, ref); i++)
1433 if (ref->refered_type == IPA_REF_CGRAPH
1434 && DECL_COMDAT (cgraph_function_node (ipa_ref_node (ref), NULL)->decl)
1435 && !cgraph_node_in_set_p (ipa_ref_node (ref), part->cgraph_set))
1436 add_cgraph_node_to_partition (part, ipa_ref_node (ref));
1438 if (ref->refered_type == IPA_REF_VARPOOL
1439 && DECL_COMDAT (ipa_ref_varpool_node (ref)->decl)
1440 && !varpool_node_in_set_p (ipa_ref_varpool_node (ref), part->varpool_set))
1441 add_varpool_node_to_partition (part, ipa_ref_varpool_node (ref));
1445 /* Worker for add_cgraph_node_to_partition. */
1448 add_cgraph_node_to_partition_1 (struct cgraph_node *node, void *data)
1450 ltrans_partition part = (ltrans_partition) data;
1452 /* non-COMDAT aliases of COMDAT functions needs to be output just once. */
1453 if (!DECL_COMDAT (node->decl)
1454 && !node->global.inlined_to
1457 gcc_assert (node->thunk.thunk_p || node->alias);
1463 node->in_other_partition = 1;
1464 if (cgraph_dump_file)
1465 fprintf (cgraph_dump_file, "Node %s/%i now used in multiple partitions\n",
1466 cgraph_node_name (node), node->uid);
1468 node->aux = (void *)((size_t)node->aux + 1);
1469 cgraph_node_set_add (part->cgraph_set, node);
1473 /* Add NODE to partition as well as the inline callees and referred comdats into partition PART. */
1476 add_cgraph_node_to_partition (ltrans_partition part, struct cgraph_node *node)
1478 struct cgraph_edge *e;
1479 cgraph_node_set_iterator csi;
1480 struct cgraph_node *n;
1482 /* We always decide on functions, not associated thunks and aliases. */
1483 node = cgraph_function_node (node, NULL);
1485 /* If NODE is already there, we have nothing to do. */
1486 csi = cgraph_node_set_find (part->cgraph_set, node);
1487 if (!csi_end_p (csi))
1490 cgraph_for_node_thunks_and_aliases (node, add_cgraph_node_to_partition_1, part, true);
1492 part->insns += inline_summary (node)->self_size;
1495 cgraph_node_set_add (part->cgraph_set, node);
1497 for (e = node->callees; e; e = e->next_callee)
1498 if ((!e->inline_failed
1499 || DECL_COMDAT (cgraph_function_node (e->callee, NULL)->decl))
1500 && !cgraph_node_in_set_p (e->callee, part->cgraph_set))
1501 add_cgraph_node_to_partition (part, e->callee);
1503 add_references_to_partition (part, &node->ref_list);
1505 if (node->same_comdat_group)
1506 for (n = node->same_comdat_group; n != node; n = n->same_comdat_group)
1507 add_cgraph_node_to_partition (part, n);
1510 /* Add VNODE to partition as well as comdat references partition PART. */
1513 add_varpool_node_to_partition (ltrans_partition part, struct varpool_node *vnode)
1515 varpool_node_set_iterator vsi;
1517 vnode = varpool_variable_node (vnode, NULL);
1519 /* If NODE is already there, we have nothing to do. */
1520 vsi = varpool_node_set_find (part->varpool_set, vnode);
1521 if (!vsi_end_p (vsi))
1524 varpool_node_set_add (part->varpool_set, vnode);
1528 vnode->in_other_partition = 1;
1529 if (cgraph_dump_file)
1530 fprintf (cgraph_dump_file, "Varpool node %s now used in multiple partitions\n",
1531 varpool_node_name (vnode));
1533 vnode->aux = (void *)((size_t)vnode->aux + 1);
1535 add_references_to_partition (part, &vnode->ref_list);
1537 if (vnode->same_comdat_group
1538 && !varpool_node_in_set_p (vnode->same_comdat_group, part->varpool_set))
1539 add_varpool_node_to_partition (part, vnode->same_comdat_group);
1542 /* Undo all additions until number of cgraph nodes in PARITION is N_CGRAPH_NODES
1543 and number of varpool nodes is N_VARPOOL_NODES. */
1546 undo_partition (ltrans_partition partition, unsigned int n_cgraph_nodes,
1547 unsigned int n_varpool_nodes)
1549 while (VEC_length (cgraph_node_ptr, partition->cgraph_set->nodes) >
1552 struct cgraph_node *node = VEC_index (cgraph_node_ptr,
1553 partition->cgraph_set->nodes,
1555 partition->insns -= inline_summary (node)->self_size;
1556 cgraph_node_set_remove (partition->cgraph_set, node);
1557 node->aux = (void *)((size_t)node->aux - 1);
1559 while (VEC_length (varpool_node_ptr, partition->varpool_set->nodes) >
1562 struct varpool_node *node = VEC_index (varpool_node_ptr,
1563 partition->varpool_set->nodes,
1565 varpool_node_set_remove (partition->varpool_set, node);
1566 node->aux = (void *)((size_t)node->aux - 1);
1570 /* Return true if NODE should be partitioned.
1571 This means that partitioning algorithm should put NODE into one of partitions.
1572 This apply to most functions with bodies. Functions that are not partitions
1573 are put into every unit needing them. This is the case of i.e. COMDATs. */
1576 partition_cgraph_node_p (struct cgraph_node *node)
1578 /* We will get proper partition based on function they are inlined to. */
1579 if (node->global.inlined_to)
1581 /* Nodes without a body do not need partitioning. */
1582 if (!node->analyzed)
1584 /* Extern inlines and comdat are always only in partitions they are needed. */
1585 if (DECL_EXTERNAL (node->decl)
1586 || (DECL_COMDAT (node->decl)
1587 && !cgraph_used_from_object_file_p (node)))
1589 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (node->decl)))
1594 /* Return true if VNODE should be partitioned.
1595 This means that partitioning algorithm should put VNODE into one of partitions. */
1598 partition_varpool_node_p (struct varpool_node *vnode)
1600 if (vnode->alias || !vnode->needed)
1602 /* Constant pool and comdat are always only in partitions they are needed. */
1603 if (DECL_IN_CONSTANT_POOL (vnode->decl)
1604 || (DECL_COMDAT (vnode->decl)
1605 && !vnode->force_output
1606 && !varpool_used_from_object_file_p (vnode)))
1608 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (vnode->decl)))
1613 /* Group cgrah nodes by input files. This is used mainly for testing
1617 lto_1_to_1_map (void)
1619 struct cgraph_node *node;
1620 struct varpool_node *vnode;
1621 struct lto_file_decl_data *file_data;
1622 struct pointer_map_t *pmap;
1623 ltrans_partition partition;
1625 int npartitions = 0;
1627 timevar_push (TV_WHOPR_WPA);
1629 pmap = pointer_map_create ();
1631 for (node = cgraph_nodes; node; node = node->next)
1633 if (!partition_cgraph_node_p (node)
1637 file_data = node->local.lto_file_data;
1641 slot = pointer_map_contains (pmap, file_data);
1643 partition = (ltrans_partition) *slot;
1646 partition = new_partition (file_data->file_name);
1647 slot = pointer_map_insert (pmap, file_data);
1653 && VEC_length (ltrans_partition, ltrans_partitions))
1654 partition = VEC_index (ltrans_partition, ltrans_partitions, 0);
1657 partition = new_partition ("");
1658 slot = pointer_map_insert (pmap, NULL);
1663 add_cgraph_node_to_partition (partition, node);
1666 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
1668 if (!partition_varpool_node_p (vnode)
1671 file_data = vnode->lto_file_data;
1672 slot = pointer_map_contains (pmap, file_data);
1674 partition = (ltrans_partition) *slot;
1677 partition = new_partition (file_data->file_name);
1678 slot = pointer_map_insert (pmap, file_data);
1683 add_varpool_node_to_partition (partition, vnode);
1685 for (node = cgraph_nodes; node; node = node->next)
1687 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
1690 /* If the cgraph is empty, create one cgraph node set so that there is still
1691 an output file for any variables that need to be exported in a DSO. */
1693 new_partition ("empty");
1695 pointer_map_destroy (pmap);
1697 timevar_pop (TV_WHOPR_WPA);
1699 lto_stats.num_cgraph_partitions += VEC_length (ltrans_partition,
1703 /* Helper function for qsort; sort nodes by order. */
1705 node_cmp (const void *pa, const void *pb)
1707 const struct cgraph_node *a = *(const struct cgraph_node * const *) pa;
1708 const struct cgraph_node *b = *(const struct cgraph_node * const *) pb;
1709 return b->order - a->order;
1712 /* Helper function for qsort; sort nodes by order. */
1714 varpool_node_cmp (const void *pa, const void *pb)
1716 const struct varpool_node *a = *(const struct varpool_node * const *) pa;
1717 const struct varpool_node *b = *(const struct varpool_node * const *) pb;
1718 return b->order - a->order;
1721 /* Group cgraph nodes into equally-sized partitions.
1723 The partitioning algorithm is simple: nodes are taken in predefined order.
1724 The order corresponds to the order we want functions to have in the final
1725 output. In the future this will be given by function reordering pass, but
1726 at the moment we use the topological order, which is a good approximation.
1728 The goal is to partition this linear order into intervals (partitions) so
1729 that all the partitions have approximately the same size and the number of
1730 callgraph or IPA reference edges crossing boundaries is minimal.
1732 This is a lot faster (O(n) in size of callgraph) than algorithms doing
1733 priority-based graph clustering that are generally O(n^2) and, since
1734 WHOPR is designed to make things go well across partitions, it leads
1737 We compute the expected size of a partition as:
1739 max (total_size / lto_partitions, min_partition_size)
1741 We use dynamic expected size of partition so small programs are partitioned
1742 into enough partitions to allow use of multiple CPUs, while large programs
1743 are not partitioned too much. Creating too many partitions significantly
1744 increases the streaming overhead.
1746 In the future, we would like to bound the maximal size of partitions so as
1747 to prevent the LTRANS stage from consuming too much memory. At the moment,
1748 however, the WPA stage is the most memory intensive for large benchmarks,
1749 since too many types and declarations are read into memory.
1751 The function implements a simple greedy algorithm. Nodes are being added
1752 to the current partition until after 3/4 of the expected partition size is
1753 reached. Past this threshold, we keep track of boundary size (number of
1754 edges going to other partitions) and continue adding functions until after
1755 the current partition has grown to twice the expected partition size. Then
1756 the process is undone to the point where the minimal ratio of boundary size
1757 and in-partition calls was reached. */
1760 lto_balanced_map (void)
1763 int n_varpool_nodes = 0, varpool_pos = 0;
1764 struct cgraph_node **postorder =
1765 XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1766 struct cgraph_node **order = XNEWVEC (struct cgraph_node *, cgraph_max_uid);
1767 struct varpool_node **varpool_order = NULL;
1768 int i, postorder_len;
1769 struct cgraph_node *node;
1770 int total_size = 0, best_total_size = 0;
1772 ltrans_partition partition;
1773 unsigned int last_visited_cgraph_node = 0, last_visited_varpool_node = 0;
1774 struct varpool_node *vnode;
1775 int cost = 0, internal = 0;
1776 int best_n_nodes = 0, best_n_varpool_nodes = 0, best_i = 0, best_cost =
1777 INT_MAX, best_internal = 0;
1779 int current_order = -1;
1781 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
1782 gcc_assert (!vnode->aux);
1783 /* Until we have better ordering facility, use toplogical order.
1784 Include only nodes we will partition and compute estimate of program
1785 size. Note that since nodes that are not partitioned might be put into
1786 multiple partitions, this is just an estimate of real size. This is why
1787 we keep partition_size updated after every partition is finalized. */
1788 postorder_len = ipa_reverse_postorder (postorder);
1790 for (i = 0; i < postorder_len; i++)
1792 node = postorder[i];
1793 if (partition_cgraph_node_p (node))
1795 order[n_nodes++] = node;
1796 total_size += inline_summary (node)->size;
1801 if (!flag_toplevel_reorder)
1803 qsort (order, n_nodes, sizeof (struct cgraph_node *), node_cmp);
1805 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
1806 if (partition_varpool_node_p (vnode))
1808 varpool_order = XNEWVEC (struct varpool_node *, n_varpool_nodes);
1810 n_varpool_nodes = 0;
1811 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
1812 if (partition_varpool_node_p (vnode))
1813 varpool_order[n_varpool_nodes++] = vnode;
1814 qsort (varpool_order, n_varpool_nodes, sizeof (struct varpool_node *),
1818 /* Compute partition size and create the first partition. */
1819 partition_size = total_size / PARAM_VALUE (PARAM_LTO_PARTITIONS);
1820 if (partition_size < PARAM_VALUE (MIN_PARTITION_SIZE))
1821 partition_size = PARAM_VALUE (MIN_PARTITION_SIZE);
1823 partition = new_partition ("");
1824 if (cgraph_dump_file)
1825 fprintf (cgraph_dump_file, "Total unit size: %i, partition size: %i\n",
1826 total_size, partition_size);
1828 for (i = 0; i < n_nodes; i++)
1833 current_order = order[i]->order;
1835 if (!flag_toplevel_reorder)
1836 while (varpool_pos < n_varpool_nodes && varpool_order[varpool_pos]->order < current_order)
1838 if (!varpool_order[varpool_pos]->aux)
1839 add_varpool_node_to_partition (partition, varpool_order[varpool_pos]);
1843 add_cgraph_node_to_partition (partition, order[i]);
1844 total_size -= inline_summary (order[i])->size;
1847 /* Once we added a new node to the partition, we also want to add
1848 all referenced variables unless they was already added into some
1850 add_cgraph_node_to_partition adds possibly multiple nodes and
1851 variables that are needed to satisfy needs of ORDER[i].
1852 We remember last visited cgraph and varpool node from last iteration
1853 of outer loop that allows us to process every new addition.
1855 At the same time we compute size of the boundary into COST. Every
1856 callgraph or IPA reference edge leaving the partition contributes into
1857 COST. Every edge inside partition was earlier computed as one leaving
1858 it and thus we need to subtract it from COST. */
1859 while (last_visited_cgraph_node <
1860 VEC_length (cgraph_node_ptr, partition->cgraph_set->nodes)
1861 || last_visited_varpool_node < VEC_length (varpool_node_ptr,
1862 partition->varpool_set->
1865 struct ipa_ref_list *refs;
1867 struct ipa_ref *ref;
1868 bool cgraph_p = false;
1870 if (last_visited_cgraph_node <
1871 VEC_length (cgraph_node_ptr, partition->cgraph_set->nodes))
1873 struct cgraph_edge *edge;
1876 node = VEC_index (cgraph_node_ptr, partition->cgraph_set->nodes,
1877 last_visited_cgraph_node);
1878 refs = &node->ref_list;
1880 last_visited_cgraph_node++;
1882 gcc_assert (node->analyzed);
1884 /* Compute boundary cost of callgraph edges. */
1885 for (edge = node->callees; edge; edge = edge->next_callee)
1886 if (edge->callee->analyzed)
1888 int edge_cost = edge->frequency;
1889 cgraph_node_set_iterator csi;
1893 gcc_assert (edge_cost > 0);
1894 csi = cgraph_node_set_find (partition->cgraph_set, edge->callee);
1895 if (!csi_end_p (csi)
1896 && csi.index < last_visited_cgraph_node - 1)
1897 cost -= edge_cost, internal+= edge_cost;
1901 for (edge = node->callers; edge; edge = edge->next_caller)
1903 int edge_cost = edge->frequency;
1904 cgraph_node_set_iterator csi;
1906 gcc_assert (edge->caller->analyzed);
1909 gcc_assert (edge_cost > 0);
1910 csi = cgraph_node_set_find (partition->cgraph_set, edge->caller);
1911 if (!csi_end_p (csi)
1912 && csi.index < last_visited_cgraph_node)
1921 &VEC_index (varpool_node_ptr, partition->varpool_set->nodes,
1922 last_visited_varpool_node)->ref_list;
1923 last_visited_varpool_node++;
1926 /* Compute boundary cost of IPA REF edges and at the same time look into
1927 variables referenced from current partition and try to add them. */
1928 for (j = 0; ipa_ref_list_reference_iterate (refs, j, ref); j++)
1929 if (ref->refered_type == IPA_REF_VARPOOL)
1931 varpool_node_set_iterator vsi;
1933 vnode = ipa_ref_varpool_node (ref);
1934 if (!vnode->finalized)
1936 if (!vnode->aux && flag_toplevel_reorder
1937 && partition_varpool_node_p (vnode))
1938 add_varpool_node_to_partition (partition, vnode);
1939 vsi = varpool_node_set_find (partition->varpool_set, vnode);
1940 if (!vsi_end_p (vsi)
1941 && vsi.index < last_visited_varpool_node - !cgraph_p)
1948 cgraph_node_set_iterator csi;
1950 node = ipa_ref_node (ref);
1951 if (!node->analyzed)
1953 csi = cgraph_node_set_find (partition->cgraph_set, node);
1954 if (!csi_end_p (csi)
1955 && csi.index < last_visited_cgraph_node - cgraph_p)
1960 for (j = 0; ipa_ref_list_refering_iterate (refs, j, ref); j++)
1961 if (ref->refering_type == IPA_REF_VARPOOL)
1963 varpool_node_set_iterator vsi;
1965 vnode = ipa_ref_refering_varpool_node (ref);
1966 gcc_assert (vnode->finalized);
1967 if (!vnode->aux && flag_toplevel_reorder
1968 && partition_varpool_node_p (vnode))
1969 add_varpool_node_to_partition (partition, vnode);
1970 vsi = varpool_node_set_find (partition->varpool_set, vnode);
1971 if (!vsi_end_p (vsi)
1972 && vsi.index < last_visited_varpool_node)
1979 cgraph_node_set_iterator csi;
1981 node = ipa_ref_refering_node (ref);
1982 gcc_assert (node->analyzed);
1983 csi = cgraph_node_set_find (partition->cgraph_set, node);
1984 if (!csi_end_p (csi)
1985 && csi.index < last_visited_cgraph_node)
1992 /* If the partition is large enough, start looking for smallest boundary cost. */
1993 if (partition->insns < partition_size * 3 / 4
1994 || best_cost == INT_MAX
1996 || (best_internal * (HOST_WIDE_INT) cost
1997 > (internal * (HOST_WIDE_INT)best_cost)))
1998 && partition->insns < partition_size * 5 / 4))
2001 best_internal = internal;
2003 best_n_nodes = VEC_length (cgraph_node_ptr,
2004 partition->cgraph_set->nodes);
2005 best_n_varpool_nodes = VEC_length (varpool_node_ptr,
2006 partition->varpool_set->nodes);
2007 best_total_size = total_size;
2009 if (cgraph_dump_file)
2010 fprintf (cgraph_dump_file, "Step %i: added %s/%i, size %i, cost %i/%i best %i/%i, step %i\n", i,
2011 cgraph_node_name (order[i]), order[i]->uid, partition->insns, cost, internal,
2012 best_cost, best_internal, best_i);
2013 /* Partition is too large, unwind into step when best cost was reached and
2014 start new partition. */
2015 if (partition->insns > 2 * partition_size)
2019 if (cgraph_dump_file)
2020 fprintf (cgraph_dump_file, "Unwinding %i insertions to step %i\n",
2021 i - best_i, best_i);
2022 undo_partition (partition, best_n_nodes, best_n_varpool_nodes);
2025 /* When we are finished, avoid creating empty partition. */
2026 while (i < n_nodes - 1 && order[i + 1]->aux)
2028 if (i == n_nodes - 1)
2030 partition = new_partition ("");
2031 last_visited_cgraph_node = 0;
2032 last_visited_varpool_node = 0;
2033 total_size = best_total_size;
2036 if (cgraph_dump_file)
2037 fprintf (cgraph_dump_file, "New partition\n");
2039 best_n_varpool_nodes = 0;
2040 best_cost = INT_MAX;
2042 /* Since the size of partitions is just approximate, update the size after
2043 we finished current one. */
2044 if (npartitions < PARAM_VALUE (PARAM_LTO_PARTITIONS))
2045 partition_size = total_size
2046 / (PARAM_VALUE (PARAM_LTO_PARTITIONS) - npartitions);
2048 partition_size = INT_MAX;
2050 if (partition_size < PARAM_VALUE (MIN_PARTITION_SIZE))
2051 partition_size = PARAM_VALUE (MIN_PARTITION_SIZE);
2056 /* Varables that are not reachable from the code go into last partition. */
2057 if (flag_toplevel_reorder)
2059 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
2060 if (partition_varpool_node_p (vnode) && !vnode->aux)
2061 add_varpool_node_to_partition (partition, vnode);
2065 while (varpool_pos < n_varpool_nodes)
2067 if (!varpool_order[varpool_pos]->aux)
2068 add_varpool_node_to_partition (partition, varpool_order[varpool_pos]);
2071 free (varpool_order);
2076 /* Promote variable VNODE to be static. */
2079 promote_var (struct varpool_node *vnode)
2081 if (TREE_PUBLIC (vnode->decl) || DECL_EXTERNAL (vnode->decl))
2083 gcc_assert (flag_wpa);
2084 TREE_PUBLIC (vnode->decl) = 1;
2085 DECL_VISIBILITY (vnode->decl) = VISIBILITY_HIDDEN;
2086 DECL_VISIBILITY_SPECIFIED (vnode->decl) = true;
2087 if (cgraph_dump_file)
2088 fprintf (cgraph_dump_file,
2089 "Promoting var as hidden: %s\n", varpool_node_name (vnode));
2093 /* Promote function NODE to be static. */
2096 promote_fn (struct cgraph_node *node)
2098 gcc_assert (flag_wpa);
2099 if (TREE_PUBLIC (node->decl) || DECL_EXTERNAL (node->decl))
2101 TREE_PUBLIC (node->decl) = 1;
2102 DECL_VISIBILITY (node->decl) = VISIBILITY_HIDDEN;
2103 DECL_VISIBILITY_SPECIFIED (node->decl) = true;
2104 if (cgraph_dump_file)
2105 fprintf (cgraph_dump_file,
2106 "Promoting function as hidden: %s/%i\n",
2107 cgraph_node_name (node), node->uid);
2111 /* Find out all static decls that need to be promoted to global because
2112 of cross file sharing. This function must be run in the WPA mode after
2113 all inlinees are added. */
2116 lto_promote_cross_file_statics (void)
2118 struct varpool_node *vnode;
2120 cgraph_node_set set;
2121 varpool_node_set vset;
2122 cgraph_node_set_iterator csi;
2123 varpool_node_set_iterator vsi;
2124 VEC(varpool_node_ptr, heap) *promoted_initializers = NULL;
2125 struct pointer_set_t *inserted = pointer_set_create ();
2127 gcc_assert (flag_wpa);
2129 n_sets = VEC_length (ltrans_partition, ltrans_partitions);
2130 for (i = 0; i < n_sets; i++)
2132 ltrans_partition part
2133 = VEC_index (ltrans_partition, ltrans_partitions, i);
2134 set = part->cgraph_set;
2135 vset = part->varpool_set;
2137 /* If node called or referred to from other partition, it needs to be
2139 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
2141 struct cgraph_node *node = csi_node (csi);
2142 if (node->local.externally_visible)
2144 if (node->global.inlined_to)
2146 if ((!DECL_EXTERNAL (node->decl) && !DECL_COMDAT (node->decl))
2147 && (referenced_from_other_partition_p (&node->ref_list, set, vset)
2148 || reachable_from_other_partition_p (node, set)))
2151 for (vsi = vsi_start (vset); !vsi_end_p (vsi); vsi_next (&vsi))
2153 vnode = vsi_node (vsi);
2154 /* Constant pool references use internal labels and thus can not
2155 be made global. It is sensible to keep those ltrans local to
2156 allow better optimization. */
2157 if (!DECL_IN_CONSTANT_POOL (vnode->decl) && !DECL_COMDAT (vnode->decl)
2158 && !vnode->externally_visible && vnode->analyzed
2159 && referenced_from_other_partition_p (&vnode->ref_list,
2161 promote_var (vnode);
2164 /* We export the initializer of a read-only var into each partition
2165 referencing the var. Folding might take declarations from the
2166 initializer and use them, so everything referenced from the
2167 initializer can be accessed from this partition after folding.
2169 This means that we need to promote all variables and functions
2170 referenced from all initializers of read-only vars referenced
2171 from this partition that are not in this partition. This needs
2172 to be done recursively. */
2173 for (vnode = varpool_nodes; vnode; vnode = vnode->next)
2174 if (const_value_known_p (vnode->decl)
2175 && DECL_INITIAL (vnode->decl)
2176 && !varpool_node_in_set_p (vnode, vset)
2177 && referenced_from_this_partition_p (&vnode->ref_list, set, vset)
2178 && !pointer_set_insert (inserted, vnode))
2179 VEC_safe_push (varpool_node_ptr, heap, promoted_initializers, vnode);
2181 while (!VEC_empty (varpool_node_ptr, promoted_initializers))
2184 struct ipa_ref *ref;
2186 vnode = VEC_pop (varpool_node_ptr, promoted_initializers);
2188 ipa_ref_list_reference_iterate (&vnode->ref_list, i, ref);
2191 if (ref->refered_type == IPA_REF_CGRAPH)
2193 struct cgraph_node *n = ipa_ref_node (ref);
2194 gcc_assert (!n->global.inlined_to);
2195 if (!n->local.externally_visible
2196 && !cgraph_node_in_set_p (n, set))
2201 struct varpool_node *v = ipa_ref_varpool_node (ref);
2202 if (varpool_node_in_set_p (v, vset))
2205 /* Constant pool references use internal labels and thus
2206 cannot be made global. It is sensible to keep those
2207 ltrans local to allow better optimization. */
2208 if (DECL_IN_CONSTANT_POOL (v->decl))
2210 if (!pointer_set_insert (inserted, vnode))
2211 VEC_safe_push (varpool_node_ptr, heap,
2212 promoted_initializers, v);
2214 else if (!v->externally_visible && v->analyzed)
2217 && DECL_INITIAL (v->decl)
2218 && const_value_known_p (v->decl)
2219 && !pointer_set_insert (inserted, vnode))
2220 VEC_safe_push (varpool_node_ptr, heap,
2221 promoted_initializers, v);
2227 pointer_set_destroy (inserted);
2230 static lto_file *current_lto_file;
2232 /* Helper for qsort; compare partitions and return one with smaller size.
2233 We sort from greatest to smallest so parallel build doesn't stale on the
2234 longest compilation being executed too late. */
2237 cmp_partitions_size (const void *a, const void *b)
2239 const struct ltrans_partition_def *pa
2240 = *(struct ltrans_partition_def *const *)a;
2241 const struct ltrans_partition_def *pb
2242 = *(struct ltrans_partition_def *const *)b;
2243 return pb->insns - pa->insns;
2246 /* Helper for qsort; compare partitions and return one with smaller order. */
2249 cmp_partitions_order (const void *a, const void *b)
2251 const struct ltrans_partition_def *pa
2252 = *(struct ltrans_partition_def *const *)a;
2253 const struct ltrans_partition_def *pb
2254 = *(struct ltrans_partition_def *const *)b;
2255 int ordera = -1, orderb = -1;
2257 if (VEC_length (cgraph_node_ptr, pa->cgraph_set->nodes))
2258 ordera = VEC_index (cgraph_node_ptr, pa->cgraph_set->nodes, 0)->order;
2259 else if (VEC_length (varpool_node_ptr, pa->varpool_set->nodes))
2260 ordera = VEC_index (varpool_node_ptr, pa->varpool_set->nodes, 0)->order;
2261 if (VEC_length (cgraph_node_ptr, pb->cgraph_set->nodes))
2262 orderb = VEC_index (cgraph_node_ptr, pb->cgraph_set->nodes, 0)->order;
2263 else if (VEC_length (varpool_node_ptr, pb->varpool_set->nodes))
2264 orderb = VEC_index (varpool_node_ptr, pb->varpool_set->nodes, 0)->order;
2265 return orderb - ordera;
2268 /* Write all output files in WPA mode and the file with the list of
2272 lto_wpa_write_files (void)
2276 cgraph_node_set set;
2277 varpool_node_set vset;
2278 ltrans_partition part;
2279 FILE *ltrans_output_list_stream;
2280 char *temp_filename;
2283 /* Open the LTRANS output list. */
2284 if (!ltrans_output_list)
2285 fatal_error ("no LTRANS output list filename provided");
2286 ltrans_output_list_stream = fopen (ltrans_output_list, "w");
2287 if (ltrans_output_list_stream == NULL)
2288 fatal_error ("opening LTRANS output list %s: %m", ltrans_output_list);
2290 timevar_push (TV_WHOPR_WPA);
2292 FOR_EACH_VEC_ELT (ltrans_partition, ltrans_partitions, i, part)
2293 lto_stats.num_output_cgraph_nodes += VEC_length (cgraph_node_ptr,
2294 part->cgraph_set->nodes);
2296 /* Find out statics that need to be promoted
2297 to globals with hidden visibility because they are accessed from multiple
2299 lto_promote_cross_file_statics ();
2301 timevar_pop (TV_WHOPR_WPA);
2303 timevar_push (TV_WHOPR_WPA_IO);
2305 /* Generate a prefix for the LTRANS unit files. */
2306 blen = strlen (ltrans_output_list);
2307 temp_filename = (char *) xmalloc (blen + sizeof ("2147483648.o"));
2308 strcpy (temp_filename, ltrans_output_list);
2309 if (blen > sizeof (".out")
2310 && strcmp (temp_filename + blen - sizeof (".out") + 1,
2312 temp_filename[blen - sizeof (".out") + 1] = '\0';
2313 blen = strlen (temp_filename);
2315 n_sets = VEC_length (ltrans_partition, ltrans_partitions);
2317 /* Sort partitions by size so small ones are compiled last.
2318 FIXME: Even when not reordering we may want to output one list for parallel make
2319 and other for final link command. */
2320 VEC_qsort (ltrans_partition, ltrans_partitions,
2321 flag_toplevel_reorder ? cmp_partitions_size : cmp_partitions_order);
2322 for (i = 0; i < n_sets; i++)
2325 ltrans_partition part = VEC_index (ltrans_partition, ltrans_partitions, i);
2327 set = part->cgraph_set;
2328 vset = part->varpool_set;
2330 /* Write all the nodes in SET. */
2331 sprintf (temp_filename + blen, "%u.o", i);
2332 file = lto_obj_file_open (temp_filename, true);
2334 fatal_error ("lto_obj_file_open() failed");
2337 fprintf (stderr, " %s (%s %i insns)", temp_filename, part->name, part->insns);
2338 if (cgraph_dump_file)
2340 fprintf (cgraph_dump_file, "Writing partition %s to file %s, %i insns\n",
2341 part->name, temp_filename, part->insns);
2342 fprintf (cgraph_dump_file, "cgraph nodes:");
2343 dump_cgraph_node_set (cgraph_dump_file, set);
2344 fprintf (cgraph_dump_file, "varpool nodes:");
2345 dump_varpool_node_set (cgraph_dump_file, vset);
2347 gcc_checking_assert (cgraph_node_set_nonempty_p (set)
2348 || varpool_node_set_nonempty_p (vset) || !i);
2350 lto_set_current_out_file (file);
2352 ipa_write_optimization_summaries (set, vset);
2354 lto_set_current_out_file (NULL);
2355 lto_obj_file_close (file);
2357 len = strlen (temp_filename);
2358 if (fwrite (temp_filename, 1, len, ltrans_output_list_stream) < len
2359 || fwrite ("\n", 1, 1, ltrans_output_list_stream) < 1)
2360 fatal_error ("writing to LTRANS output list %s: %m",
2361 ltrans_output_list);
2364 lto_stats.num_output_files += n_sets;
2366 /* Close the LTRANS output list. */
2367 if (fclose (ltrans_output_list_stream))
2368 fatal_error ("closing LTRANS output list %s: %m", ltrans_output_list);
2370 free_ltrans_partitions();
2372 timevar_pop (TV_WHOPR_WPA_IO);
2376 /* If TT is a variable or function decl replace it with its
2377 prevailing variant. */
2378 #define LTO_SET_PREVAIL(tt) \
2380 if ((tt) && VAR_OR_FUNCTION_DECL_P (tt)) \
2381 tt = lto_symtab_prevailing_decl (tt); \
2384 /* Ensure that TT isn't a replacable var of function decl. */
2385 #define LTO_NO_PREVAIL(tt) \
2386 gcc_assert (!(tt) || !VAR_OR_FUNCTION_DECL_P (tt))
2388 /* Given a tree T replace all fields referring to variables or functions
2389 with their prevailing variant. */
2391 lto_fixup_prevailing_decls (tree t)
2393 enum tree_code code = TREE_CODE (t);
2394 LTO_NO_PREVAIL (TREE_TYPE (t));
2395 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
2396 LTO_NO_PREVAIL (TREE_CHAIN (t));
2399 LTO_NO_PREVAIL (DECL_NAME (t));
2400 LTO_SET_PREVAIL (DECL_CONTEXT (t));
2401 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
2403 LTO_SET_PREVAIL (DECL_SIZE (t));
2404 LTO_SET_PREVAIL (DECL_SIZE_UNIT (t));
2405 LTO_SET_PREVAIL (DECL_INITIAL (t));
2406 LTO_NO_PREVAIL (DECL_ATTRIBUTES (t));
2407 LTO_SET_PREVAIL (DECL_ABSTRACT_ORIGIN (t));
2409 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
2411 LTO_NO_PREVAIL (t->decl_with_vis.assembler_name);
2412 LTO_NO_PREVAIL (DECL_SECTION_NAME (t));
2414 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
2416 LTO_NO_PREVAIL (DECL_ARGUMENT_FLD (t));
2417 LTO_NO_PREVAIL (DECL_RESULT_FLD (t));
2418 LTO_NO_PREVAIL (DECL_VINDEX (t));
2420 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
2421 LTO_SET_PREVAIL (DECL_FUNCTION_PERSONALITY (t));
2422 if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
2424 LTO_NO_PREVAIL (DECL_FIELD_OFFSET (t));
2425 LTO_NO_PREVAIL (DECL_BIT_FIELD_TYPE (t));
2426 LTO_NO_PREVAIL (DECL_QUALIFIER (t));
2427 LTO_NO_PREVAIL (DECL_FIELD_BIT_OFFSET (t));
2428 LTO_NO_PREVAIL (DECL_FCONTEXT (t));
2431 else if (TYPE_P (t))
2433 LTO_NO_PREVAIL (TYPE_CACHED_VALUES (t));
2434 LTO_SET_PREVAIL (TYPE_SIZE (t));
2435 LTO_SET_PREVAIL (TYPE_SIZE_UNIT (t));
2436 LTO_NO_PREVAIL (TYPE_ATTRIBUTES (t));
2437 LTO_NO_PREVAIL (TYPE_NAME (t));
2439 LTO_SET_PREVAIL (TYPE_MINVAL (t));
2440 LTO_SET_PREVAIL (TYPE_MAXVAL (t));
2441 LTO_SET_PREVAIL (t->type_non_common.binfo);
2443 LTO_SET_PREVAIL (TYPE_CONTEXT (t));
2445 LTO_NO_PREVAIL (TYPE_CANONICAL (t));
2446 LTO_NO_PREVAIL (TYPE_MAIN_VARIANT (t));
2447 LTO_NO_PREVAIL (TYPE_NEXT_VARIANT (t));
2449 else if (EXPR_P (t))
2452 LTO_NO_PREVAIL (t->exp.block);
2453 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
2454 LTO_SET_PREVAIL (TREE_OPERAND (t, i));
2461 LTO_SET_PREVAIL (TREE_VALUE (t));
2462 LTO_SET_PREVAIL (TREE_PURPOSE (t));
2469 #undef LTO_SET_PREVAIL
2470 #undef LTO_NO_PREVAIL
2472 /* Helper function of lto_fixup_decls. Walks the var and fn streams in STATE,
2473 replaces var and function decls with the corresponding prevailing def. */
2476 lto_fixup_state (struct lto_in_decl_state *state)
2479 struct lto_tree_ref_table *table;
2481 /* Although we only want to replace FUNCTION_DECLs and VAR_DECLs,
2482 we still need to walk from all DECLs to find the reachable
2483 FUNCTION_DECLs and VAR_DECLs. */
2484 for (si = 0; si < LTO_N_DECL_STREAMS; si++)
2486 table = &state->streams[si];
2487 for (i = 0; i < table->size; i++)
2489 tree *tp = table->trees + i;
2490 if (VAR_OR_FUNCTION_DECL_P (*tp))
2491 *tp = lto_symtab_prevailing_decl (*tp);
2496 /* A callback of htab_traverse. Just extracts a state from SLOT
2497 and calls lto_fixup_state. */
2500 lto_fixup_state_aux (void **slot, void *aux ATTRIBUTE_UNUSED)
2502 struct lto_in_decl_state *state = (struct lto_in_decl_state *) *slot;
2503 lto_fixup_state (state);
2507 /* Fix the decls from all FILES. Replaces each decl with the corresponding
2511 lto_fixup_decls (struct lto_file_decl_data **files)
2517 FOR_EACH_HTAB_ELEMENT (tree_with_vars, t, tree, hi)
2518 lto_fixup_prevailing_decls (t);
2520 for (i = 0; files[i]; i++)
2522 struct lto_file_decl_data *file = files[i];
2523 struct lto_in_decl_state *state = file->global_decl_state;
2524 lto_fixup_state (state);
2526 htab_traverse (file->function_decl_states, lto_fixup_state_aux, NULL);
2530 static GTY((length ("lto_stats.num_input_files + 1"))) struct lto_file_decl_data **all_file_decl_data;
2532 /* Turn file datas for sub files into a single array, so that they look
2533 like separate files for further passes. */
2536 lto_flatten_files (struct lto_file_decl_data **orig, int count, int last_file_ix)
2538 struct lto_file_decl_data *n, *next;
2541 lto_stats.num_input_files = count;
2543 = ggc_alloc_cleared_vec_lto_file_decl_data_ptr (count + 1);
2544 /* Set the hooks so that all of the ipa passes can read in their data. */
2545 lto_set_in_hooks (all_file_decl_data, get_section_data, free_section_data);
2546 for (i = 0, k = 0; i < last_file_ix; i++)
2548 for (n = orig[i]; n != NULL; n = next)
2550 all_file_decl_data[k++] = n;
2555 all_file_decl_data[k] = NULL;
2556 gcc_assert (k == count);
2559 /* Input file data before flattening (i.e. splitting them to subfiles to support
2560 incremental linking. */
2561 static int real_file_count;
2562 static GTY((length ("real_file_count + 1"))) struct lto_file_decl_data **real_file_decl_data;
2564 /* Read all the symbols from the input files FNAMES. NFILES is the
2565 number of files requested in the command line. Instantiate a
2566 global call graph by aggregating all the sub-graphs found in each
2570 read_cgraph_and_symbols (unsigned nfiles, const char **fnames)
2572 unsigned int i, last_file_ix;
2574 struct cgraph_node *node;
2576 struct lto_file_decl_data **decl_data;
2580 timevar_push (TV_IPA_LTO_DECL_IN);
2583 = decl_data = ggc_alloc_cleared_vec_lto_file_decl_data_ptr (nfiles + 1);
2584 real_file_count = nfiles;
2586 /* Read the resolution file. */
2588 if (resolution_file_name)
2591 unsigned num_objects;
2593 resolution = fopen (resolution_file_name, "r");
2594 if (resolution == NULL)
2595 fatal_error ("could not open symbol resolution file: %m");
2597 t = fscanf (resolution, "%u", &num_objects);
2598 gcc_assert (t == 1);
2600 /* True, since the plugin splits the archives. */
2601 gcc_assert (num_objects == nfiles);
2604 tree_with_vars = htab_create_ggc (101, htab_hash_pointer, htab_eq_pointer,
2608 fprintf (stderr, "Reading object files:");
2610 /* Read all of the object files specified on the command line. */
2611 for (i = 0, last_file_ix = 0; i < nfiles; ++i)
2613 struct lto_file_decl_data *file_data = NULL;
2616 fprintf (stderr, " %s", fnames[i]);
2620 current_lto_file = lto_obj_file_open (fnames[i], false);
2621 if (!current_lto_file)
2624 file_data = lto_file_read (current_lto_file, resolution, &count);
2627 lto_obj_file_close (current_lto_file);
2628 current_lto_file = NULL;
2632 decl_data[last_file_ix++] = file_data;
2634 lto_obj_file_close (current_lto_file);
2635 current_lto_file = NULL;
2639 lto_flatten_files (decl_data, count, last_file_ix);
2640 lto_stats.num_input_files = count;
2641 ggc_free(decl_data);
2642 real_file_decl_data = NULL;
2644 if (resolution_file_name)
2645 fclose (resolution);
2647 /* Set the hooks so that all of the ipa passes can read in their data. */
2648 lto_set_in_hooks (all_file_decl_data, get_section_data, free_section_data);
2650 timevar_pop (TV_IPA_LTO_DECL_IN);
2653 fprintf (stderr, "\nReading the callgraph\n");
2655 timevar_push (TV_IPA_LTO_CGRAPH_IO);
2656 /* Read the callgraph. */
2658 timevar_pop (TV_IPA_LTO_CGRAPH_IO);
2661 fprintf (stderr, "Merging declarations\n");
2663 timevar_push (TV_IPA_LTO_DECL_MERGE);
2664 /* Merge global decls. */
2665 lto_symtab_merge_decls ();
2667 /* If there were errors during symbol merging bail out, we have no
2668 good way to recover here. */
2670 fatal_error ("errors during merging of translation units");
2672 /* Fixup all decls and types and free the type hash tables. */
2673 lto_fixup_decls (all_file_decl_data);
2674 htab_delete (tree_with_vars);
2675 tree_with_vars = NULL;
2676 free_gimple_type_tables ();
2679 timevar_pop (TV_IPA_LTO_DECL_MERGE);
2680 /* Each pass will set the appropriate timer. */
2683 fprintf (stderr, "Reading summaries\n");
2685 /* Read the IPA summary data. */
2687 ipa_read_optimization_summaries ();
2689 ipa_read_summaries ();
2691 /* Finally merge the cgraph according to the decl merging decisions. */
2692 timevar_push (TV_IPA_LTO_CGRAPH_MERGE);
2693 if (cgraph_dump_file)
2695 fprintf (cgraph_dump_file, "Before merging:\n");
2696 dump_cgraph (cgraph_dump_file);
2697 dump_varpool (cgraph_dump_file);
2699 lto_symtab_merge_cgraph_nodes ();
2703 for (node = cgraph_nodes; node; node = node->next)
2705 /* FIXME: ipa_transforms_to_apply holds list of passes that have optimization
2706 summaries computed and needs to apply changes. At the moment WHOPR only
2707 supports inlining, so we can push it here by hand. In future we need to stream
2708 this field into ltrans compilation. */
2710 VEC_safe_push (ipa_opt_pass, heap,
2711 node->ipa_transforms_to_apply,
2712 (ipa_opt_pass)&pass_ipa_inline);
2716 timevar_pop (TV_IPA_LTO_CGRAPH_MERGE);
2718 timevar_push (TV_IPA_LTO_DECL_INIT_IO);
2720 /* FIXME lto. This loop needs to be changed to use the pass manager to
2721 call the ipa passes directly. */
2723 for (i = 0; i < last_file_ix; i++)
2725 struct lto_file_decl_data *file_data = all_file_decl_data [i];
2726 lto_materialize_constructors_and_inits (file_data);
2729 /* Indicate that the cgraph is built and ready. */
2730 cgraph_function_flags_ready = true;
2732 timevar_pop (TV_IPA_LTO_DECL_INIT_IO);
2733 ggc_free (all_file_decl_data);
2734 all_file_decl_data = NULL;
2738 /* Materialize all the bodies for all the nodes in the callgraph. */
2741 materialize_cgraph (void)
2744 struct cgraph_node *node;
2746 timevar_id_t lto_timer;
2750 flag_wpa ? "Materializing decls:" : "Reading function bodies:");
2753 /* Now that we have input the cgraph, we need to clear all of the aux
2754 nodes and read the functions if we are not running in WPA mode. */
2755 timevar_push (TV_IPA_LTO_GIMPLE_IN);
2757 for (node = cgraph_nodes; node; node = node->next)
2759 if (node->local.lto_file_data)
2761 lto_materialize_function (node);
2762 lto_stats.num_input_cgraph_nodes++;
2766 timevar_pop (TV_IPA_LTO_GIMPLE_IN);
2768 /* Start the appropriate timer depending on the mode that we are
2770 lto_timer = (flag_wpa) ? TV_WHOPR_WPA
2771 : (flag_ltrans) ? TV_WHOPR_LTRANS
2773 timevar_push (lto_timer);
2775 current_function_decl = NULL;
2778 /* Inform the middle end about the global variables we have seen. */
2779 FOR_EACH_VEC_ELT (tree, lto_global_var_decls, i, decl)
2780 rest_of_decl_compilation (decl, 1, 0);
2783 fprintf (stderr, "\n");
2785 timevar_pop (lto_timer);
2789 /* Perform whole program analysis (WPA) on the callgraph and write out the
2790 optimization plan. */
2793 do_whole_program_analysis (void)
2795 /* Note that since we are in WPA mode, materialize_cgraph will not
2796 actually read in all the function bodies. It only materializes
2797 the decls and cgraph nodes so that analysis can be performed. */
2798 materialize_cgraph ();
2800 /* Reading in the cgraph uses different timers, start timing WPA now. */
2801 timevar_push (TV_WHOPR_WPA);
2803 if (pre_ipa_mem_report)
2805 fprintf (stderr, "Memory consumption before IPA\n");
2806 dump_memory_report (false);
2809 cgraph_function_flags_ready = true;
2811 if (cgraph_dump_file)
2813 dump_cgraph (cgraph_dump_file);
2814 dump_varpool (cgraph_dump_file);
2816 bitmap_obstack_initialize (NULL);
2817 cgraph_state = CGRAPH_STATE_IPA_SSA;
2819 execute_ipa_pass_list (all_regular_ipa_passes);
2821 if (cgraph_dump_file)
2823 fprintf (cgraph_dump_file, "Optimized ");
2824 dump_cgraph (cgraph_dump_file);
2825 dump_varpool (cgraph_dump_file);
2828 bitmap_obstack_release (NULL);
2830 /* We are about to launch the final LTRANS phase, stop the WPA timer. */
2831 timevar_pop (TV_WHOPR_WPA);
2833 if (flag_lto_partition_1to1)
2836 lto_balanced_map ();
2840 fprintf (stderr, "\nStreaming out");
2843 lto_wpa_write_files ();
2846 fprintf (stderr, "\n");
2848 if (post_ipa_mem_report)
2850 fprintf (stderr, "Memory consumption after IPA\n");
2851 dump_memory_report (false);
2854 /* Show the LTO report before launching LTRANS. */
2855 if (flag_lto_report)
2856 print_lto_report ();
2860 static GTY(()) tree lto_eh_personality_decl;
2862 /* Return the LTO personality function decl. */
2865 lto_eh_personality (void)
2867 if (!lto_eh_personality_decl)
2869 /* Use the first personality DECL for our personality if we don't
2870 support multiple ones. This ensures that we don't artificially
2871 create the need for them in a single-language program. */
2872 if (first_personality_decl && !dwarf2out_do_cfi_asm ())
2873 lto_eh_personality_decl = first_personality_decl;
2875 lto_eh_personality_decl = lhd_gcc_personality ();
2878 return lto_eh_personality_decl;
2881 /* Set the process name based on the LTO mode. */
2884 lto_process_name (void)
2887 setproctitle ("lto1-lto");
2889 setproctitle ("lto1-wpa");
2891 setproctitle ("lto1-ltrans");
2895 /* Initialize the LTO front end. */
2900 lto_process_name ();
2901 lto_streamer_hooks_init ();
2903 lto_set_in_hooks (NULL, get_section_data, free_section_data);
2904 memset (<o_stats, 0, sizeof (lto_stats));
2905 bitmap_obstack_initialize (NULL);
2906 gimple_register_cfg_hooks ();
2910 /* Main entry point for the GIMPLE front end. This front end has
2911 three main personalities:
2913 - LTO (-flto). All the object files on the command line are
2914 loaded in memory and processed as a single translation unit.
2915 This is the traditional link-time optimization behavior.
2917 - WPA (-fwpa). Only the callgraph and summary information for
2918 files in the command file are loaded. A single callgraph
2919 (without function bodies) is instantiated for the whole set of
2920 files. IPA passes are only allowed to analyze the call graph
2921 and make transformation decisions. The callgraph is
2922 partitioned, each partition is written to a new object file
2923 together with the transformation decisions.
2925 - LTRANS (-fltrans). Similar to -flto but it prevents the IPA
2926 summary files from running again. Since WPA computed summary
2927 information and decided what transformations to apply, LTRANS
2928 simply applies them. */
2933 /* Initialize the LTO front end. */
2936 /* Read all the symbols and call graph from all the files in the
2938 read_cgraph_and_symbols (num_in_fnames, in_fnames);
2942 /* If WPA is enabled analyze the whole call graph and create an
2943 optimization plan. Otherwise, read in all the function
2944 bodies and continue with optimization. */
2946 do_whole_program_analysis ();
2949 materialize_cgraph ();
2951 /* Let the middle end know that we have read and merged all of
2955 /* FIXME lto, if the processes spawned by WPA fail, we miss
2956 the chance to print WPA's report, so WPA will call
2957 print_lto_report before launching LTRANS. If LTRANS was
2958 launched directly by the driver we would not need to do
2960 if (flag_lto_report)
2961 print_lto_report ();
2966 #include "gt-lto-lto.h"