1 /* Top-level LTO routines.
2 Copyright 2009 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 "diagnostic.h"
29 #include "libiberty.h"
32 #include "tree-ssa-operands.h"
33 #include "tree-pass.h"
34 #include "langhooks.h"
37 #include "pointer-set.h"
44 #include "lto-streamer.h"
46 /* This needs to be included after config.h. Otherwise, _GNU_SOURCE will not
47 be defined in time to set __USE_GNU in the system headers, and strsignal
48 will not be declared. */
54 DEF_VEC_ALLOC_P(bitmap,heap);
56 /* Read the constructors and inits. */
59 lto_materialize_constructors_and_inits (struct lto_file_decl_data * file_data)
62 const char *data = lto_get_section_data (file_data,
63 LTO_section_static_initializer,
65 lto_input_constructors_and_inits (file_data, data);
66 lto_free_section_data (file_data, LTO_section_static_initializer, NULL,
70 /* Read the function body for the function associated with NODE if possible. */
73 lto_materialize_function (struct cgraph_node *node)
76 struct lto_file_decl_data *file_data;
77 const char *data, *name;
81 /* Ignore clone nodes. Read the body only from the original one.
82 We may find clone nodes during LTRANS after WPA has made inlining
88 file_data = node->local.lto_file_data;
89 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
91 /* We may have renamed the declaration, e.g., a static function. */
92 name = lto_get_decl_name_mapping (file_data, name);
94 data = lto_get_section_data (file_data, LTO_section_function_body,
100 gcc_assert (!DECL_IS_BUILTIN (decl));
102 /* This function has a definition. */
103 TREE_STATIC (decl) = 1;
105 gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL);
106 allocate_struct_function (decl, false);
108 /* Load the function body only if not operating in WPA mode. In
109 WPA mode, the body of the function is not needed. */
112 lto_input_function_body (file_data, decl, data);
113 lto_stats.num_function_bodies++;
116 fn = DECL_STRUCT_FUNCTION (decl);
117 lto_free_section_data (file_data, LTO_section_function_body, name,
120 /* Look for initializers of constant variables and private
122 for (step = fn->local_decls; step; step = TREE_CHAIN (step))
124 tree decl = TREE_VALUE (step);
125 if (TREE_CODE (decl) == VAR_DECL
126 && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
127 && flag_unit_at_a_time)
128 varpool_finalize_decl (decl);
132 DECL_EXTERNAL (decl) = 1;
134 /* Let the middle end know about the function. */
135 rest_of_decl_compilation (decl, 1, 0);
136 if (cgraph_node (decl)->needed)
137 cgraph_mark_reachable_node (cgraph_node (decl));
141 /* Decode the content of memory pointed to by DATA in the the
142 in decl state object STATE. DATA_IN points to a data_in structure for
143 decoding. Return the address after the decoded object in the input. */
145 static const uint32_t *
146 lto_read_in_decl_state (struct data_in *data_in, const uint32_t *data,
147 struct lto_in_decl_state *state)
154 decl = lto_streamer_cache_get (data_in->reader_cache, (int) ix);
155 if (TREE_CODE (decl) != FUNCTION_DECL)
157 gcc_assert (decl == void_type_node);
160 state->fn_decl = decl;
162 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
164 uint32_t size = *data++;
165 tree *decls = (tree *) xcalloc (size, sizeof (tree));
167 for (j = 0; j < size; j++)
169 decls[j] = lto_streamer_cache_get (data_in->reader_cache, data[j]);
171 /* Register every type in the global type table. If the
172 type existed already, use the existing type. */
173 if (TYPE_P (decls[j]))
174 decls[j] = gimple_register_type (decls[j]);
177 state->streams[i].size = size;
178 state->streams[i].trees = decls;
186 /* Read all the symbols from buffer DATA, using descriptors in DECL_DATA.
187 RESOLUTIONS is the set of symbols picked by the linker (read from the
188 resolution file when the linker plugin is being used). */
191 lto_read_decls (struct lto_file_decl_data *decl_data, const void *data,
192 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions)
194 const struct lto_decl_header *header = (const struct lto_decl_header *) data;
195 const int32_t decl_offset = sizeof (struct lto_decl_header);
196 const int32_t main_offset = decl_offset + header->decl_state_size;
197 const int32_t string_offset = main_offset + header->main_size;
198 struct lto_input_block ib_main;
199 struct data_in *data_in;
201 const uint32_t *data_ptr, *data_end;
202 uint32_t num_decl_states;
204 LTO_INIT_INPUT_BLOCK (ib_main, (const char *) data + main_offset, 0,
207 data_in = lto_data_in_create (decl_data, (const char *) data + string_offset,
208 header->string_size, resolutions);
210 /* Read the global declarations and types. */
211 while (ib_main.p < ib_main.len)
213 tree t = lto_input_tree (&ib_main, data_in);
214 gcc_assert (t && ib_main.p <= ib_main.len);
217 /* Read in lto_in_decl_state objects. */
218 data_ptr = (const uint32_t *) ((const char*) data + decl_offset);
220 (const uint32_t *) ((const char*) data_ptr + header->decl_state_size);
221 num_decl_states = *data_ptr++;
223 gcc_assert (num_decl_states > 0);
224 decl_data->global_decl_state = lto_new_in_decl_state ();
225 data_ptr = lto_read_in_decl_state (data_in, data_ptr,
226 decl_data->global_decl_state);
228 /* Read in per-function decl states and enter them in hash table. */
229 decl_data->function_decl_states =
230 htab_create (37, lto_hash_in_decl_state, lto_eq_in_decl_state, free);
232 for (i = 1; i < num_decl_states; i++)
234 struct lto_in_decl_state *state = lto_new_in_decl_state ();
237 data_ptr = lto_read_in_decl_state (data_in, data_ptr, state);
238 slot = htab_find_slot (decl_data->function_decl_states, state, INSERT);
239 gcc_assert (*slot == NULL);
243 if (data_ptr != data_end)
244 internal_error ("bytecode stream: garbage at the end of symbols section");
246 /* Set the current decl state to be the global state. */
247 decl_data->current_decl_state = decl_data->global_decl_state;
249 lto_data_in_delete (data_in);
252 /* Read resolution for file named FILE_NAME. The resolution is read from
253 RESOLUTION. An array with the symbol resolution is returned. The array
254 size is written to SIZE. */
256 static VEC(ld_plugin_symbol_resolution_t,heap) *
257 lto_resolution_read (FILE *resolution, const char *file_name)
259 /* We require that objects in the resolution file are in the same
260 order as the lto1 command line. */
261 unsigned int name_len;
263 unsigned int num_symbols;
265 VEC(ld_plugin_symbol_resolution_t,heap) *ret = NULL;
266 unsigned max_index = 0;
271 name_len = strlen (file_name);
272 obj_name = XNEWVEC (char, name_len + 1);
273 fscanf (resolution, " "); /* Read white space. */
275 fread (obj_name, sizeof (char), name_len, resolution);
276 obj_name[name_len] = '\0';
277 if (strcmp (obj_name, file_name) != 0)
278 internal_error ("unexpected file name %s in linker resolution file. "
279 "Expected %s", obj_name, file_name);
283 fscanf (resolution, "%u", &num_symbols);
285 for (i = 0; i < num_symbols; i++)
290 enum ld_plugin_symbol_resolution r;
292 unsigned int lto_resolution_str_len =
293 sizeof (lto_resolution_str) / sizeof (char *);
295 t = fscanf (resolution, "%u %26s %*[^\n]\n", &index, r_str);
297 internal_error ("Invalid line in the resolution file.");
298 if (index > max_index)
301 for (j = 0; j < lto_resolution_str_len; j++)
303 if (strcmp (lto_resolution_str[j], r_str) == 0)
305 r = (enum ld_plugin_symbol_resolution) j;
309 if (j == lto_resolution_str_len)
310 internal_error ("Invalid resolution in the resolution file.");
312 VEC_safe_grow_cleared (ld_plugin_symbol_resolution_t, heap, ret,
314 VEC_replace (ld_plugin_symbol_resolution_t, ret, index, r);
320 /* Generate a TREE representation for all types and external decls
323 Read all of the globals out of the file. Then read the cgraph
324 and process the .o index into the cgraph nodes so that it can open
325 the .o file to load the functions and ipa information. */
327 static struct lto_file_decl_data *
328 lto_file_read (lto_file *file, FILE *resolution_file)
330 struct lto_file_decl_data *file_data;
333 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions;
335 resolutions = lto_resolution_read (resolution_file, file->filename);
337 file_data = XCNEW (struct lto_file_decl_data);
338 file_data->file_name = file->filename;
339 file_data->section_hash_table = lto_elf_build_section_table (file);
340 file_data->renaming_hash_table = lto_create_renaming_table ();
342 data = lto_get_section_data (file_data, LTO_section_decls, NULL, &len);
343 lto_read_decls (file_data, data, resolutions);
344 lto_free_section_data (file_data, LTO_section_decls, NULL, data, len);
349 #if HAVE_MMAP_FILE && HAVE_SYSCONF && defined _SC_PAGE_SIZE
350 #define LTO_MMAP_IO 1
354 /* Page size of machine is used for mmap and munmap calls. */
355 static size_t page_mask;
358 /* Get the section data of length LEN from FILENAME starting at
359 OFFSET. The data segment must be freed by the caller when the
360 caller is finished. Returns NULL if all was not well. */
363 lto_read_section_data (struct lto_file_decl_data *file_data,
364 intptr_t offset, size_t len)
368 static char *fd_name;
370 intptr_t computed_len;
371 intptr_t computed_offset;
375 /* Keep a single-entry file-descriptor cache. The last file we
376 touched will get closed at exit.
377 ??? Eventually we want to add a more sophisticated larger cache
378 or rather fix function body streaming to not stream them in
379 practically random order. */
381 && strcmp (fd_name, file_data->file_name) != 0)
389 fd_name = xstrdup (file_data->file_name);
390 fd = open (file_data->file_name, O_RDONLY);
398 size_t page_size = sysconf (_SC_PAGE_SIZE);
399 page_mask = ~(page_size - 1);
402 computed_offset = offset & page_mask;
403 diff = offset - computed_offset;
404 computed_len = len + diff;
406 result = (char *) mmap (NULL, computed_len, PROT_READ, MAP_PRIVATE,
407 fd, computed_offset);
408 if (result == MAP_FAILED)
411 return result + diff;
413 result = (char *) xmalloc (len);
414 if (lseek (fd, offset, SEEK_SET) != offset
415 || read (fd, result, len) != (ssize_t) len)
426 /* Get the section data from FILE_DATA of SECTION_TYPE with NAME.
427 NAME will be NULL unless the section type is for a function
431 get_section_data (struct lto_file_decl_data *file_data,
432 enum lto_section_type section_type,
436 htab_t section_hash_table = file_data->section_hash_table;
437 struct lto_section_slot *f_slot;
438 struct lto_section_slot s_slot;
439 const char *section_name = lto_get_section_name (section_type, name);
443 s_slot.name = section_name;
444 f_slot = (struct lto_section_slot *) htab_find (section_hash_table, &s_slot);
447 data = lto_read_section_data (file_data, f_slot->start, f_slot->len);
451 free (CONST_CAST (char *, section_name));
456 /* Free the section data from FILE_DATA of SECTION_TYPE with NAME that
457 starts at OFFSET and has LEN bytes. */
460 free_section_data (struct lto_file_decl_data *file_data ATTRIBUTE_UNUSED,
461 enum lto_section_type section_type ATTRIBUTE_UNUSED,
462 const char *name ATTRIBUTE_UNUSED,
463 const char *offset, size_t len ATTRIBUTE_UNUSED)
466 intptr_t computed_len;
467 intptr_t computed_offset;
472 computed_offset = ((intptr_t) offset) & page_mask;
473 diff = (intptr_t) offset - computed_offset;
474 computed_len = len + diff;
476 munmap ((caddr_t) computed_offset, computed_len);
478 free (CONST_CAST(char *, offset));
482 /* Vector of all cgraph node sets. */
483 static GTY (()) VEC(cgraph_node_set, gc) *lto_cgraph_node_sets;
486 /* Group cgrah nodes by input files. This is used mainly for testing
490 lto_1_to_1_map (void)
492 struct cgraph_node *node;
493 struct lto_file_decl_data *file_data;
494 struct pointer_map_t *pmap;
498 timevar_push (TV_WHOPR_WPA);
500 lto_cgraph_node_sets = VEC_alloc (cgraph_node_set, gc, 1);
502 /* If the cgraph is empty, create one cgraph node set so that there is still
503 an output file for any variables that need to be exported in a DSO. */
506 set = cgraph_node_set_new ();
507 VEC_safe_push (cgraph_node_set, gc, lto_cgraph_node_sets, set);
511 pmap = pointer_map_create ();
513 for (node = cgraph_nodes; node; node = node->next)
515 /* We only need to partition the nodes that we read from the
516 gimple bytecode files. */
517 file_data = node->local.lto_file_data;
518 if (file_data == NULL)
521 slot = pointer_map_contains (pmap, file_data);
523 set = (cgraph_node_set) *slot;
526 set = cgraph_node_set_new ();
527 slot = pointer_map_insert (pmap, file_data);
529 VEC_safe_push (cgraph_node_set, gc, lto_cgraph_node_sets, set);
532 cgraph_node_set_add (set, node);
535 pointer_map_destroy (pmap);
538 timevar_pop (TV_WHOPR_WPA);
540 lto_stats.num_cgraph_partitions += VEC_length (cgraph_node_set,
541 lto_cgraph_node_sets);
545 /* Add inlined clone NODE and its master clone to SET, if NODE itself has
546 inlined callees, recursively add the callees. */
549 lto_add_inline_clones (cgraph_node_set set, struct cgraph_node *node,
550 bitmap original_decls, bitmap inlined_decls)
552 struct cgraph_node *callee;
553 struct cgraph_edge *edge;
555 cgraph_node_set_add (set, node);
557 if (!bitmap_bit_p (original_decls, DECL_UID (node->decl)))
558 bitmap_set_bit (inlined_decls, DECL_UID (node->decl));
560 /* Check to see if NODE has any inlined callee. */
561 for (edge = node->callees; edge != NULL; edge = edge->next_callee)
563 callee = edge->callee;
564 if (callee->global.inlined_to != NULL)
565 lto_add_inline_clones (set, callee, original_decls, inlined_decls);
569 /* Compute the transitive closure of inlining of SET based on the
570 information in the callgraph. Returns a bitmap of decls that have
571 been inlined into SET indexed by UID. */
574 lto_add_all_inlinees (cgraph_node_set set)
576 cgraph_node_set_iterator csi;
577 struct cgraph_node *node;
578 bitmap original_nodes = lto_bitmap_alloc ();
579 bitmap original_decls = lto_bitmap_alloc ();
580 bitmap inlined_decls = lto_bitmap_alloc ();
583 /* We are going to iterate SET while adding to it, mark all original
584 nodes so that we only add node inlined to original nodes. */
585 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
587 bitmap_set_bit (original_nodes, csi_node (csi)->uid);
588 bitmap_set_bit (original_decls, DECL_UID (csi_node (csi)->decl));
591 /* Some of the original nodes might not be needed anymore.
596 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
598 struct cgraph_node *inlined_to;
599 node = csi_node (csi);
601 /* NODE was not inlined. We still need it. */
602 if (!node->global.inlined_to)
605 inlined_to = node->global.inlined_to;
607 /* NODE should have only one caller. */
608 gcc_assert (!node->callers->next_caller);
610 if (!bitmap_bit_p (original_nodes, inlined_to->uid))
612 bitmap_clear_bit (original_nodes, node->uid);
613 cgraph_node_set_remove (set, node);
620 /* Transitively add to SET all the inline clones for every node that
622 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
624 node = csi_node (csi);
625 if (bitmap_bit_p (original_nodes, node->uid))
626 lto_add_inline_clones (set, node, original_decls, inlined_decls);
629 lto_bitmap_free (original_nodes);
630 lto_bitmap_free (original_decls);
632 return inlined_decls;
635 /* Owing to inlining, we may need to promote a file-scope variable
636 to a global variable. Consider this case:
649 extern void foo (void);
657 If WPA inlines FOO inside BAR, then the static variable VAR needs to
658 be promoted to global because BAR and VAR may be in different LTRANS
661 /* This struct keeps track of states used in globalization. */
665 /* Current cgraph node set. */
668 /* Function DECLs of cgraph nodes seen. */
669 bitmap seen_node_decls;
671 /* Use in walk_tree to avoid multiple visits of a node. */
672 struct pointer_set_t *visited;
674 /* static vars in this set. */
675 bitmap static_vars_in_set;
677 /* static vars in all previous set. */
678 bitmap all_static_vars;
680 /* all vars in all previous set. */
682 } globalize_context_t;
684 /* Callback for walk_tree. Examine the tree pointer to by TP and see if
685 if its a file-scope static variable of function that need to be turned
689 globalize_cross_file_statics (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
692 globalize_context_t *context = (globalize_context_t *) data;
698 /* The logic for globalization of VAR_DECLs and FUNCTION_DECLs are
699 different. For functions, we can simply look at the cgraph node sets
700 to tell if there are references to static functions outside the set.
701 The cgraph node sets do not keep track of vars, we need to traverse
702 the trees to determine what vars need to be globalized. */
703 if (TREE_CODE (t) == VAR_DECL)
705 if (!TREE_PUBLIC (t))
707 /* This file-scope static variable is reachable from more
708 that one set. Make it global but with hidden visibility
709 so that we do not export it in dynamic linking. */
710 if (bitmap_bit_p (context->all_static_vars, DECL_UID (t)))
713 DECL_VISIBILITY (t) = VISIBILITY_HIDDEN;
715 bitmap_set_bit (context->static_vars_in_set, DECL_UID (t));
717 bitmap_set_bit (context->all_vars, DECL_UID (t));
718 walk_tree (&DECL_INITIAL (t), globalize_cross_file_statics, context,
721 else if (TREE_CODE (t) == FUNCTION_DECL && !TREE_PUBLIC (t))
723 if (!cgraph_node_in_set_p (cgraph_node (t), context->set))
725 /* This file-scope static function is reachable from a set
726 which does not contain the function DECL. Make it global
727 but with hidden visibility. */
729 DECL_VISIBILITY (t) = VISIBILITY_HIDDEN;
736 /* Helper of lto_scan_statics_in_cgraph_node below. Scan TABLE for
737 static decls that may be used in more than one LTRANS file.
738 CONTEXT is a globalize_context_t for storing scanning states. */
741 lto_scan_statics_in_ref_table (struct lto_tree_ref_table *table,
742 globalize_context_t *context)
746 for (i = 0; i < table->size; i++)
747 walk_tree (&table->trees[i], globalize_cross_file_statics, context,
751 /* Promote file-scope decl reachable from NODE if necessary to global.
752 CONTEXT is a globalize_context_t storing scanning states. */
755 lto_scan_statics_in_cgraph_node (struct cgraph_node *node,
756 globalize_context_t *context)
758 struct lto_in_decl_state *state;
760 /* Do nothing if NODE has no function body. */
764 /* Return if the DECL of nodes has been visited before. */
765 if (bitmap_bit_p (context->seen_node_decls, DECL_UID (node->decl)))
768 bitmap_set_bit (context->seen_node_decls, DECL_UID (node->decl));
770 state = lto_get_function_in_decl_state (node->local.lto_file_data,
774 lto_scan_statics_in_ref_table (&state->streams[LTO_DECL_STREAM_VAR_DECL],
776 lto_scan_statics_in_ref_table (&state->streams[LTO_DECL_STREAM_FN_DECL],
780 /* Scan all global variables that we have not yet seen so far. CONTEXT
781 is a globalize_context_t storing scanning states. */
784 lto_scan_statics_in_remaining_global_vars (globalize_context_t *context)
786 tree var, var_context;
787 struct varpool_node *vnode;
789 FOR_EACH_STATIC_VARIABLE (vnode)
792 var_context = DECL_CONTEXT (var);
793 if (TREE_STATIC (var)
795 && (!var_context || TREE_CODE (var_context) != FUNCTION_DECL)
796 && !bitmap_bit_p (context->all_vars, DECL_UID (var)))
797 walk_tree (&var, globalize_cross_file_statics, context,
802 /* Find out all static decls that need to be promoted to global because
803 of cross file sharing. This function must be run in the WPA mode after
804 all inlinees are added. */
807 lto_promote_cross_file_statics (void)
811 cgraph_node_set_iterator csi;
812 globalize_context_t context;
814 memset (&context, 0, sizeof (context));
815 context.all_vars = lto_bitmap_alloc ();
816 context.all_static_vars = lto_bitmap_alloc ();
818 n_sets = VEC_length (cgraph_node_set, lto_cgraph_node_sets);
819 for (i = 0; i < n_sets; i++)
821 set = VEC_index (cgraph_node_set, lto_cgraph_node_sets, i);
823 context.visited = pointer_set_create ();
824 context.static_vars_in_set = lto_bitmap_alloc ();
825 context.seen_node_decls = lto_bitmap_alloc ();
827 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
828 lto_scan_statics_in_cgraph_node (csi_node (csi), &context);
831 lto_scan_statics_in_remaining_global_vars (&context);
833 bitmap_ior_into (context.all_static_vars, context.static_vars_in_set);
835 pointer_set_destroy (context.visited);
836 lto_bitmap_free (context.static_vars_in_set);
837 lto_bitmap_free (context.seen_node_decls);
840 lto_bitmap_free (context.all_vars);
841 lto_bitmap_free (context.all_static_vars);
845 /* Given a file name FNAME, return a string with FNAME prefixed with '*'. */
848 prefix_name_with_star (const char *fname)
853 len = strlen (fname) + 1 + 1;
854 star_fname = XNEWVEC (char, len);
855 snprintf (star_fname, len, "*%s", fname);
861 /* Return a copy of FNAME without the .o extension. */
864 strip_extension (const char *fname)
866 char *s = XNEWVEC (char, strlen (fname) - 2 + 1);
867 gcc_assert (strstr (fname, ".o"));
868 snprintf (s, strlen (fname) - 2 + 1, "%s", fname);
874 /* Return a file name associated with cgraph node set SET. This may
875 be a new temporary file name if SET needs to be processed by
876 LTRANS, or the original file name if all the nodes in SET belong to
877 the same input file. */
880 get_filename_for_set (cgraph_node_set set)
883 static const size_t max_fname_len = 100;
885 if (cgraph_node_set_needs_ltrans_p (set))
887 /* Create a new temporary file to store SET. To facilitate
888 debugging, use file names from SET as part of the new
889 temporary file name. */
890 cgraph_node_set_iterator si;
891 struct pointer_set_t *pset = pointer_set_create ();
892 for (si = csi_start (set); !csi_end_p (si); csi_next (&si))
894 struct cgraph_node *n = csi_node (si);
895 const char *node_fname;
898 /* Don't use the same file name more than once. */
899 if (pointer_set_insert (pset, n->local.lto_file_data))
902 /* The first file name found in SET determines the output
903 directory. For the remaining files, we use their
905 node_fname = n->local.lto_file_data->file_name;
908 fname = strip_extension (node_fname);
912 f = strip_extension (lbasename (node_fname));
914 /* If the new name causes an excessively long file name,
915 make the last component "___" to indicate overflow. */
916 if (strlen (fname) + strlen (f) > max_fname_len - 3)
918 fname = reconcat (fname, fname, "___", NULL);
923 fname = reconcat (fname, fname, "_", f, NULL);
928 pointer_set_destroy (pset);
930 /* Add the extension .wpa.o to indicate that this file has been
932 fname = reconcat (fname, fname, ".wpa.o", NULL);
937 /* Since SET does not need to be processed by LTRANS, use
938 the original file name and mark it with a '*' prefix so that
939 lto_execute_ltrans knows not to process it. */
940 cgraph_node_set_iterator si = csi_start (set);
941 struct cgraph_node *first = csi_node (si);
942 fname = prefix_name_with_star (first->local.lto_file_data->file_name);
948 static lto_file *current_lto_file;
951 /* Write all output files in WPA mode. Returns a NULL-terminated array of
952 output file names. */
955 lto_wpa_write_files (void)
958 unsigned i, n_sets, last_out_file_ix, num_out_files;
962 VEC(bitmap,heap) *inlined_decls = NULL;
964 timevar_push (TV_WHOPR_WPA);
966 /* Include all inlined functions and determine what sets need to be
967 compiled by LTRANS. After this loop, only those sets that
968 contain callgraph nodes from more than one file will need to be
969 compiled by LTRANS. */
970 for (i = 0; VEC_iterate (cgraph_node_set, lto_cgraph_node_sets, i, set); i++)
972 decls = lto_add_all_inlinees (set);
973 VEC_safe_push (bitmap, heap, inlined_decls, decls);
974 lto_stats.num_output_cgraph_nodes += VEC_length (cgraph_node_ptr,
978 /* After adding all inlinees, find out statics that need to be promoted
979 to globals because of cross-file inlining. */
980 lto_promote_cross_file_statics ();
982 timevar_pop (TV_WHOPR_WPA);
984 timevar_push (TV_WHOPR_WPA_IO);
986 /* The number of output files depends on the number of input files
987 and how many callgraph node sets we create. Reserve enough space
988 for the maximum of these two. */
989 num_out_files = MAX (VEC_length (cgraph_node_set, lto_cgraph_node_sets),
991 output_files = XNEWVEC (char *, num_out_files + 1);
993 n_sets = VEC_length (cgraph_node_set, lto_cgraph_node_sets);
994 for (i = 0; i < n_sets; i++)
998 set = VEC_index (cgraph_node_set, lto_cgraph_node_sets, i);
999 temp_filename = get_filename_for_set (set);
1000 output_files[i] = temp_filename;
1002 if (cgraph_node_set_needs_ltrans_p (set))
1004 /* Write all the nodes in SET to TEMP_FILENAME. */
1005 file = lto_elf_file_open (temp_filename, true);
1007 fatal_error ("lto_elf_file_open() failed");
1009 lto_set_current_out_file (file);
1010 lto_new_extern_inline_states ();
1012 decls = VEC_index (bitmap, inlined_decls, i);
1013 lto_force_functions_extern_inline (decls);
1015 ipa_write_summaries_of_cgraph_node_set (set);
1016 lto_delete_extern_inline_states ();
1018 lto_set_current_out_file (NULL);
1019 lto_elf_file_close (file);
1023 last_out_file_ix = n_sets;
1025 lto_stats.num_output_files += n_sets;
1027 output_files[last_out_file_ix] = NULL;
1029 for (i = 0; VEC_iterate (bitmap, inlined_decls, i, decls); i++)
1030 lto_bitmap_free (decls);
1031 VEC_free (bitmap, heap, inlined_decls);
1033 timevar_pop (TV_WHOPR_WPA_IO);
1035 return output_files;
1039 /* Perform local transformations (LTRANS) on the files in the NULL-terminated
1040 FILES array. These should have been written previously by
1041 lto_wpa_write_files (). Transformations are performed via executing
1042 COLLECT_GCC for reach file. */
1045 lto_execute_ltrans (char *const *files)
1047 struct pex_obj *pex;
1048 const char *collect_gcc_options, *collect_gcc;
1049 struct obstack env_obstack;
1051 const char **argv_ptr;
1056 FILE *ltrans_output_list_stream = NULL;
1058 timevar_push (TV_WHOPR_WPA_LTRANS_EXEC);
1060 /* Get the driver and options. */
1061 collect_gcc = getenv ("COLLECT_GCC");
1063 fatal_error ("environment variable COLLECT_GCC must be set");
1065 /* Set the CFLAGS environment variable. */
1066 collect_gcc_options = getenv ("COLLECT_GCC_OPTIONS");
1067 if (!collect_gcc_options)
1068 fatal_error ("environment variable COLLECT_GCC_OPTIONS must be set");
1070 /* Count arguments. */
1072 for (j = 0; collect_gcc_options[j] != '\0'; ++j)
1073 if (collect_gcc_options[j] == '\'')
1077 fatal_error ("malformed COLLECT_GCC_OPTIONS");
1079 /* Initalize the arguments for the LTRANS driver. */
1080 argv = XNEWVEC (const char *, 8 + i / 2);
1082 *argv_ptr++ = collect_gcc;
1083 *argv_ptr++ = "-xlto";
1084 for (j = 0; collect_gcc_options[j] != '\0'; ++j)
1085 if (collect_gcc_options[j] == '\'')
1091 while (collect_gcc_options[j] != '\'')
1093 obstack_init (&env_obstack);
1094 obstack_grow (&env_obstack, &collect_gcc_options[i], j - i);
1095 obstack_1grow (&env_obstack, 0);
1096 option = XOBFINISH (&env_obstack, char *);
1098 /* LTRANS does not need -fwpa nor -fltrans-*. */
1099 if (strncmp (option, "-fwpa", 5) != 0
1100 && strncmp (option, "-fltrans-", 9) != 0)
1101 *argv_ptr++ = option;
1103 *argv_ptr++ = "-fltrans";
1105 /* Open the LTRANS output list. */
1106 if (ltrans_output_list)
1108 ltrans_output_list_stream = fopen (ltrans_output_list, "w");
1109 if (ltrans_output_list_stream == NULL)
1110 error ("opening LTRANS output list %s: %m", ltrans_output_list);
1113 for (i = 0; files[i]; ++i)
1117 /* If the file is prefixed with a '*', it means that we do not
1118 need to re-compile it with LTRANS because it has not been
1119 modified by WPA. Skip it from the command line to
1120 lto_execute_ltrans, but add it to ltrans_output_list_stream
1121 so it is linked after we are done. */
1122 if (files[i][0] == '*')
1124 size_t len = strlen (files[i]) - 1;
1125 if (ltrans_output_list_stream)
1126 if (fwrite (&files[i][1], 1, len, ltrans_output_list_stream) < len
1127 || fwrite ("\n", 1, 1, ltrans_output_list_stream) < 1)
1128 error ("writing to LTRANS output list %s: %m",
1129 ltrans_output_list);
1135 /* Otherwise, add FILES[I] to lto_execute_ltrans command line
1136 and add the resulting file to LTRANS output list. */
1138 /* Replace the .o suffix with a .ltrans.o suffix and write
1139 the resulting name to the LTRANS output list. */
1140 obstack_init (&env_obstack);
1141 obstack_grow (&env_obstack, files[i], strlen (files[i]) - 2);
1142 obstack_grow (&env_obstack, ".ltrans.o", sizeof (".ltrans.o"));
1143 output_name = XOBFINISH (&env_obstack, char *);
1144 if (ltrans_output_list_stream)
1146 len = strlen (output_name);
1148 if (fwrite (output_name, 1, len, ltrans_output_list_stream) < len
1149 || fwrite ("\n", 1, 1, ltrans_output_list_stream) < 1)
1150 error ("writing to LTRANS output list %s: %m",
1151 ltrans_output_list);
1155 argv_ptr[1] = output_name;
1156 argv_ptr[2] = files[i];
1159 /* Execute the driver. */
1160 pex = pex_init (0, "lto1", NULL);
1162 fatal_error ("pex_init failed: %s", xstrerror (errno));
1164 errmsg = pex_run (pex, PEX_LAST | PEX_SEARCH, argv[0],
1165 CONST_CAST (char **, argv), NULL, NULL, &err);
1167 fatal_error ("%s: %s", errmsg, xstrerror (err));
1169 if (!pex_get_status (pex, 1, &status))
1170 fatal_error ("can't get program status: %s", xstrerror (errno));
1174 if (WIFSIGNALED (status))
1176 int sig = WTERMSIG (status);
1177 fatal_error ("%s terminated with signal %d [%s]%s",
1178 argv[0], sig, strsignal (sig),
1179 WCOREDUMP (status) ? ", core dumped" : "");
1182 fatal_error ("%s terminated with status %d", argv[0], status);
1189 /* Close the LTRANS output list. */
1190 if (ltrans_output_list_stream && fclose (ltrans_output_list_stream))
1191 error ("closing LTRANS output list %s: %m", ltrans_output_list);
1193 obstack_free (&env_obstack, NULL);
1196 timevar_pop (TV_WHOPR_WPA_LTRANS_EXEC);
1201 struct pointer_set_t *seen;
1204 #define LTO_FIXUP_SUBTREE(t) \
1206 walk_tree (&(t), lto_fixup_tree, data, NULL); \
1209 #define LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE(t) \
1213 (t) = gimple_register_type (t); \
1214 walk_tree (&(t), lto_fixup_tree, data, NULL); \
1218 static tree lto_fixup_tree (tree *, int *, void *);
1220 /* Return true if T does not need to be fixed up recursively. */
1226 || CONSTANT_CLASS_P (t)
1227 || TREE_CODE (t) == IDENTIFIER_NODE);
1230 /* Fix up fields of a tree_common T. DATA points to fix-up states. */
1233 lto_fixup_common (tree t, void *data)
1235 /* The following re-creates the TYPE_REFERENCE_TO and TYPE_POINTER_TO
1236 lists. We do not stream TYPE_REFERENCE_TO, TYPE_POINTER_TO or
1237 TYPE_NEXT_PTR_TO and TYPE_NEXT_REF_TO.
1238 First remove us from any pointer list we are on. */
1239 if (TREE_CODE (t) == POINTER_TYPE)
1241 if (TYPE_POINTER_TO (TREE_TYPE (t)) == t)
1242 TYPE_POINTER_TO (TREE_TYPE (t)) = TYPE_NEXT_PTR_TO (t);
1245 tree tem = TYPE_POINTER_TO (TREE_TYPE (t));
1246 while (tem && TYPE_NEXT_PTR_TO (tem) != t)
1247 tem = TYPE_NEXT_PTR_TO (tem);
1249 TYPE_NEXT_PTR_TO (tem) = TYPE_NEXT_PTR_TO (t);
1251 TYPE_NEXT_PTR_TO (t) = NULL_TREE;
1253 else if (TREE_CODE (t) == REFERENCE_TYPE)
1255 if (TYPE_REFERENCE_TO (TREE_TYPE (t)) == t)
1256 TYPE_REFERENCE_TO (TREE_TYPE (t)) = TYPE_NEXT_REF_TO (t);
1259 tree tem = TYPE_REFERENCE_TO (TREE_TYPE (t));
1260 while (tem && TYPE_NEXT_REF_TO (tem) != t)
1261 tem = TYPE_NEXT_REF_TO (tem);
1263 TYPE_NEXT_REF_TO (tem) = TYPE_NEXT_REF_TO (t);
1265 TYPE_NEXT_REF_TO (t) = NULL_TREE;
1268 /* Fixup our type. */
1269 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t));
1271 /* Second put us on the list of pointers of the new pointed-to type
1272 if we are a main variant. This is done in lto_fixup_type after
1273 fixing up our main variant. */
1275 /* This is not very efficient because we cannot do tail-recursion with
1276 a long chain of trees. */
1277 LTO_FIXUP_SUBTREE (TREE_CHAIN (t));
1280 /* Fix up fields of a decl_minimal T. DATA points to fix-up states. */
1283 lto_fixup_decl_minimal (tree t, void *data)
1285 lto_fixup_common (t, data);
1286 LTO_FIXUP_SUBTREE (DECL_NAME (t));
1287 LTO_FIXUP_SUBTREE (DECL_CONTEXT (t));
1290 /* Fix up fields of a decl_common T. DATA points to fix-up states. */
1293 lto_fixup_decl_common (tree t, void *data)
1295 lto_fixup_decl_minimal (t, data);
1296 LTO_FIXUP_SUBTREE (DECL_SIZE (t));
1297 LTO_FIXUP_SUBTREE (DECL_SIZE_UNIT (t));
1298 LTO_FIXUP_SUBTREE (DECL_INITIAL (t));
1299 LTO_FIXUP_SUBTREE (DECL_ATTRIBUTES (t));
1300 LTO_FIXUP_SUBTREE (DECL_ABSTRACT_ORIGIN (t));
1303 /* Fix up fields of a decl_with_vis T. DATA points to fix-up states. */
1306 lto_fixup_decl_with_vis (tree t, void *data)
1308 lto_fixup_decl_common (t, data);
1310 /* Accessor macro has side-effects, use field-name here. */
1311 LTO_FIXUP_SUBTREE (t->decl_with_vis.assembler_name);
1313 gcc_assert (no_fixup_p (DECL_SECTION_NAME (t)));
1316 /* Fix up fields of a decl_non_common T. DATA points to fix-up states. */
1319 lto_fixup_decl_non_common (tree t, void *data)
1321 lto_fixup_decl_with_vis (t, data);
1322 LTO_FIXUP_SUBTREE (DECL_ARGUMENT_FLD (t));
1323 LTO_FIXUP_SUBTREE (DECL_RESULT_FLD (t));
1324 LTO_FIXUP_SUBTREE (DECL_VINDEX (t));
1326 /* SAVED_TREE should not cleared by now. Also no accessor for base type. */
1327 gcc_assert (no_fixup_p (t->decl_non_common.saved_tree));
1330 /* Fix up fields of a decl_non_common T. DATA points to fix-up states. */
1333 lto_fixup_function (tree t, void *data)
1335 lto_fixup_decl_non_common (t, data);
1336 LTO_FIXUP_SUBTREE (DECL_FUNCTION_PERSONALITY (t));
1339 /* Fix up fields of a field_decl T. DATA points to fix-up states. */
1342 lto_fixup_field_decl (tree t, void *data)
1344 lto_fixup_decl_common (t, data);
1345 gcc_assert (no_fixup_p (DECL_FIELD_OFFSET (t)));
1346 LTO_FIXUP_SUBTREE (DECL_BIT_FIELD_TYPE (t));
1347 LTO_FIXUP_SUBTREE (DECL_QUALIFIER (t));
1348 gcc_assert (no_fixup_p (DECL_FIELD_BIT_OFFSET (t)));
1349 LTO_FIXUP_SUBTREE (DECL_FCONTEXT (t));
1352 /* Fix up fields of a type T. DATA points to fix-up states. */
1355 lto_fixup_type (tree t, void *data)
1359 lto_fixup_common (t, data);
1360 LTO_FIXUP_SUBTREE (TYPE_CACHED_VALUES (t));
1361 LTO_FIXUP_SUBTREE (TYPE_SIZE (t));
1362 LTO_FIXUP_SUBTREE (TYPE_SIZE_UNIT (t));
1363 LTO_FIXUP_SUBTREE (TYPE_ATTRIBUTES (t));
1364 LTO_FIXUP_SUBTREE (TYPE_NAME (t));
1366 /* Accessors are for derived node types only. */
1367 if (!POINTER_TYPE_P (t))
1368 LTO_FIXUP_SUBTREE (t->type.minval);
1369 LTO_FIXUP_SUBTREE (t->type.maxval);
1371 /* Accessor is for derived node types only. */
1372 LTO_FIXUP_SUBTREE (t->type.binfo);
1374 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TYPE_CONTEXT (t));
1375 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TYPE_CANONICAL (t));
1377 /* The following re-creates proper variant lists while fixing up
1378 the variant leaders. We do not stream TYPE_NEXT_VARIANT so the
1379 variant list state before fixup is broken. */
1381 /* Remove us from our main variant list if we are not the variant leader. */
1382 if (TYPE_MAIN_VARIANT (t) != t)
1384 tem = TYPE_MAIN_VARIANT (t);
1385 while (tem && TYPE_NEXT_VARIANT (tem) != t)
1386 tem = TYPE_NEXT_VARIANT (tem);
1388 TYPE_NEXT_VARIANT (tem) = TYPE_NEXT_VARIANT (t);
1389 TYPE_NEXT_VARIANT (t) = NULL_TREE;
1392 /* Query our new main variant. */
1393 mv = gimple_register_type (TYPE_MAIN_VARIANT (t));
1395 /* If we were the variant leader and we get replaced ourselves drop
1396 all variants from our list. */
1397 if (TYPE_MAIN_VARIANT (t) == t
1403 tree tem2 = TYPE_NEXT_VARIANT (tem);
1404 TYPE_NEXT_VARIANT (tem) = NULL_TREE;
1409 /* If we are not our own variant leader link us into our new leaders
1413 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (mv);
1414 TYPE_NEXT_VARIANT (mv) = t;
1417 /* Finally adjust our main variant and fix it up. */
1418 TYPE_MAIN_VARIANT (t) = mv;
1419 LTO_FIXUP_SUBTREE (TYPE_MAIN_VARIANT (t));
1421 /* As the second step of reconstructing the pointer chains put us
1422 on the list of pointers of the new pointed-to type
1423 if we are a main variant. See lto_fixup_common for the first step. */
1424 if (TREE_CODE (t) == POINTER_TYPE
1425 && TYPE_MAIN_VARIANT (t) == t)
1427 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (TREE_TYPE (t));
1428 TYPE_POINTER_TO (TREE_TYPE (t)) = t;
1430 else if (TREE_CODE (t) == REFERENCE_TYPE
1431 && TYPE_MAIN_VARIANT (t) == t)
1433 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (TREE_TYPE (t));
1434 TYPE_REFERENCE_TO (TREE_TYPE (t)) = t;
1438 /* Fix up fields of a BINFO T. DATA points to fix-up states. */
1441 lto_fixup_binfo (tree t, void *data)
1443 unsigned HOST_WIDE_INT i, n;
1444 tree base, saved_base;
1446 lto_fixup_common (t, data);
1447 gcc_assert (no_fixup_p (BINFO_OFFSET (t)));
1448 LTO_FIXUP_SUBTREE (BINFO_VTABLE (t));
1449 LTO_FIXUP_SUBTREE (BINFO_VIRTUALS (t));
1450 LTO_FIXUP_SUBTREE (BINFO_VPTR_FIELD (t));
1451 n = VEC_length (tree, BINFO_BASE_ACCESSES (t));
1452 for (i = 0; i < n; i++)
1454 saved_base = base = BINFO_BASE_ACCESS (t, i);
1455 LTO_FIXUP_SUBTREE (base);
1456 if (base != saved_base)
1457 VEC_replace (tree, BINFO_BASE_ACCESSES (t), i, base);
1459 LTO_FIXUP_SUBTREE (BINFO_INHERITANCE_CHAIN (t));
1460 LTO_FIXUP_SUBTREE (BINFO_SUBVTT_INDEX (t));
1461 LTO_FIXUP_SUBTREE (BINFO_VPTR_INDEX (t));
1462 n = BINFO_N_BASE_BINFOS (t);
1463 for (i = 0; i < n; i++)
1465 saved_base = base = BINFO_BASE_BINFO (t, i);
1466 LTO_FIXUP_SUBTREE (base);
1467 if (base != saved_base)
1468 VEC_replace (tree, BINFO_BASE_BINFOS (t), i, base);
1472 /* Fix up fields of a CONSTRUCTOR T. DATA points to fix-up states. */
1475 lto_fixup_constructor (tree t, void *data)
1477 unsigned HOST_WIDE_INT idx;
1478 constructor_elt *ce;
1480 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t));
1483 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (t), idx, ce);
1486 LTO_FIXUP_SUBTREE (ce->index);
1487 LTO_FIXUP_SUBTREE (ce->value);
1491 /* A walk_tree callback used by lto_fixup_state. TP is the pointer to the
1492 current tree. WALK_SUBTREES indicates if the subtrees will be walked.
1493 DATA is a pointer set to record visited nodes. */
1496 lto_fixup_tree (tree *tp, int *walk_subtrees, void *data)
1499 lto_fixup_data_t *fixup_data = (lto_fixup_data_t *) data;
1504 if (pointer_set_contains (fixup_data->seen, t))
1507 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == FUNCTION_DECL)
1509 prevailing = lto_symtab_prevailing_decl (t);
1511 if (t != prevailing)
1513 if (TREE_CODE (t) == FUNCTION_DECL
1514 && TREE_NOTHROW (prevailing) != TREE_NOTHROW (t))
1516 /* If the prevailing definition does not throw but the
1517 declaration (T) was considered throwing, then we
1518 simply add PREVAILING to the list of throwing
1519 functions. However, if the opposite is true, then
1520 the call to PREVAILING was generated assuming that
1521 the function didn't throw, which means that CFG
1522 cleanup may have removed surrounding try/catch
1525 Note that we currently accept these cases even when
1526 they occur within a single file. It's certainly a
1527 user error, but we silently allow the compiler to
1528 remove surrounding try/catch regions. Perhaps we
1529 could emit a warning here, instead of silently
1530 accepting the conflicting declaration. */
1531 if (TREE_NOTHROW (prevailing))
1532 lto_mark_nothrow_fndecl (prevailing);
1535 /* Also replace t with prevailing defintion. We don't want to
1536 insert the other defintion in the seen set as we want to
1537 replace all instances of it. */
1542 else if (TYPE_P (t))
1544 /* Replace t with the prevailing type. We don't want to insert the
1545 other type in the seen set as we want to replace all instances of it. */
1546 t = gimple_register_type (t);
1550 if (pointer_set_insert (fixup_data->seen, t))
1553 /* walk_tree does not visit all reachable nodes that need to be fixed up.
1554 Hence we do special processing here for those kind of nodes. */
1555 switch (TREE_CODE (t))
1558 lto_fixup_field_decl (t, data);
1566 lto_fixup_decl_common (t, data);
1570 lto_fixup_decl_with_vis (t, data);
1574 lto_fixup_decl_non_common (t, data);
1578 lto_fixup_function (t, data);
1582 lto_fixup_binfo (t, data);
1587 lto_fixup_type (t, data);
1588 else if (TREE_CODE (t) == CONSTRUCTOR)
1589 lto_fixup_constructor (t, data);
1590 else if (CONSTANT_CLASS_P (t))
1591 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t));
1592 else if (EXPR_P (t))
1594 /* walk_tree only handles TREE_OPERANDs. Do the rest here. */
1595 lto_fixup_common (t, data);
1596 LTO_FIXUP_SUBTREE (t->exp.block);
1601 /* Let walk_tree handle sub-trees. */
1609 /* Helper function of lto_fixup_decls. Walks the var and fn streams in STATE,
1610 replaces var and function decls with the corresponding prevailing def and
1611 records the old decl in the free-list in DATA. We also record visted nodes
1612 in the seen-set in DATA to avoid multiple visit for nodes that need not
1616 lto_fixup_state (struct lto_in_decl_state *state, lto_fixup_data_t *data)
1619 struct lto_tree_ref_table *table;
1621 /* Although we only want to replace FUNCTION_DECLs and VAR_DECLs,
1622 we still need to walk from all DECLs to find the reachable
1623 FUNCTION_DECLs and VAR_DECLs. */
1624 for (si = 0; si < LTO_N_DECL_STREAMS; si++)
1626 table = &state->streams[si];
1627 for (i = 0; i < table->size; i++)
1628 walk_tree (table->trees + i, lto_fixup_tree, data, NULL);
1632 /* A callback of htab_traverse. Just extract a state from SLOT and the
1633 lto_fixup_data_t object from AUX and calls lto_fixup_state. */
1636 lto_fixup_state_aux (void **slot, void *aux)
1638 struct lto_in_decl_state *state = (struct lto_in_decl_state *) *slot;
1639 lto_fixup_state (state, (lto_fixup_data_t *) aux);
1643 /* Fix the decls from all FILES. Replaces each decl with the corresponding
1647 lto_fixup_decls (struct lto_file_decl_data **files)
1651 struct pointer_set_t *seen = pointer_set_create ();
1652 lto_fixup_data_t data;
1655 for (i = 0; files[i]; i++)
1657 struct lto_file_decl_data *file = files[i];
1658 struct lto_in_decl_state *state = file->global_decl_state;
1659 lto_fixup_state (state, &data);
1661 htab_traverse (file->function_decl_states, lto_fixup_state_aux, &data);
1664 for (i = 0; VEC_iterate (tree, lto_global_var_decls, i, decl); i++)
1666 tree saved_decl = decl;
1667 walk_tree (&decl, lto_fixup_tree, &data, NULL);
1668 if (decl != saved_decl)
1669 VEC_replace (tree, lto_global_var_decls, i, decl);
1672 pointer_set_destroy (seen);
1675 /* Unlink a temporary LTRANS file unless requested otherwise. */
1678 lto_maybe_unlink (const char *file)
1680 if (!getenv ("WPA_SAVE_LTRANS"))
1682 if (unlink_if_ordinary (file))
1683 error ("deleting LTRANS input file %s: %m", file);
1686 fprintf (stderr, "[Leaving LTRANS input file %s]\n", file);
1689 /* Read the options saved from each file in the command line. Called
1690 from lang_hooks.post_options which is called by process_options
1691 right before all the options are used to initialize the compiler.
1692 This assumes that decode_options has already run, so the
1693 num_in_fnames and in_fnames are properly set.
1695 Note that this assumes that all the files had been compiled with
1696 the same options, which is not a good assumption. In general,
1697 options ought to be read from all the files in the set and merged.
1698 However, it is still unclear what the merge rules should be. */
1701 lto_read_all_file_options (void)
1705 /* Clear any file options currently saved. */
1706 lto_clear_file_options ();
1708 /* Set the hooks to read ELF sections. */
1709 lto_set_in_hooks (NULL, get_section_data, free_section_data);
1711 for (i = 0; i < num_in_fnames; i++)
1713 struct lto_file_decl_data *file_data;
1714 lto_file *file = lto_elf_file_open (in_fnames[i], false);
1718 file_data = XCNEW (struct lto_file_decl_data);
1719 file_data->file_name = file->filename;
1720 file_data->section_hash_table = lto_elf_build_section_table (file);
1722 lto_read_file_options (file_data);
1724 lto_elf_file_close (file);
1725 htab_delete (file_data->section_hash_table);
1729 /* Apply globally the options read from all the files. */
1730 lto_reissue_options ();
1734 /* Read all the symbols from the input files FNAMES. NFILES is the
1735 number of files requested in the command line. Instantiate a
1736 global call graph by aggregating all the sub-graphs found in each
1740 read_cgraph_and_symbols (unsigned nfiles, const char **fnames)
1742 unsigned int i, last_file_ix;
1743 struct lto_file_decl_data **all_file_decl_data;
1745 struct cgraph_node *node;
1747 lto_stats.num_input_files = nfiles;
1749 timevar_push (TV_IPA_LTO_DECL_IO);
1751 /* Set the hooks so that all of the ipa passes can read in their data. */
1752 all_file_decl_data = XNEWVEC (struct lto_file_decl_data *, nfiles + 1);
1753 lto_set_in_hooks (all_file_decl_data, get_section_data, free_section_data);
1755 /* Read the resolution file. */
1757 if (resolution_file_name)
1760 unsigned num_objects;
1762 resolution = fopen (resolution_file_name, "r");
1763 if (resolution == NULL)
1764 fatal_error ("could not open symbol resolution file: %s",
1767 t = fscanf (resolution, "%u", &num_objects);
1768 gcc_assert (t == 1);
1770 /* True, since the plugin splits the archives. */
1771 gcc_assert (num_objects == nfiles);
1774 /* Read all of the object files specified on the command line. */
1775 for (i = 0, last_file_ix = 0; i < nfiles; ++i)
1777 struct lto_file_decl_data *file_data = NULL;
1779 current_lto_file = lto_elf_file_open (fnames[i], false);
1780 if (!current_lto_file)
1783 file_data = lto_file_read (current_lto_file, resolution);
1787 all_file_decl_data[last_file_ix++] = file_data;
1789 lto_elf_file_close (current_lto_file);
1790 current_lto_file = NULL;
1793 if (resolution_file_name)
1794 fclose (resolution);
1796 all_file_decl_data[last_file_ix] = NULL;
1798 /* Set the hooks so that all of the ipa passes can read in their data. */
1799 lto_set_in_hooks (all_file_decl_data, get_section_data, free_section_data);
1801 /* Each pass will set the appropriate timer. */
1802 timevar_pop (TV_IPA_LTO_DECL_IO);
1804 /* Read the callgraph. */
1807 /* Merge global decls. */
1808 lto_symtab_merge_decls ();
1810 /* Fixup all decls and types and free the type hash tables. */
1811 lto_fixup_decls (all_file_decl_data);
1812 free_gimple_type_tables ();
1814 /* Read the IPA summary data. */
1815 ipa_read_summaries ();
1817 /* Finally merge the cgraph according to the decl merging decisions. */
1818 lto_symtab_merge_cgraph_nodes ();
1820 /* Mark cgraph nodes needed in the merged cgraph
1821 This normally happens in whole-program pass, but for
1822 ltrans the pass was already run at WPA phase.
1824 FIXME: This is not valid way to do so; nodes can be needed
1825 for non-obvious reasons. We should stream the flags from WPA
1828 for (node = cgraph_nodes; node; node = node->next)
1830 if (!node->global.inlined_to
1831 && cgraph_decide_is_function_needed (node, node->decl))
1832 cgraph_mark_needed_node (node);
1833 /* FIXME: ipa_transforms_to_apply holds list of passes that have optimization
1834 summaries computed and needs to apply changes. At the moment WHOPR only
1835 supports inlining, so we can push it here by hand. In future we need to stream
1836 this field into ltrans compilation. */
1838 VEC_safe_push (ipa_opt_pass, heap,
1839 node->ipa_transforms_to_apply,
1840 (ipa_opt_pass)&pass_ipa_inline);
1843 timevar_push (TV_IPA_LTO_DECL_IO);
1845 /* FIXME lto. This loop needs to be changed to use the pass manager to
1846 call the ipa passes directly. */
1848 for (i = 0; i < last_file_ix; i++)
1850 struct lto_file_decl_data *file_data = all_file_decl_data [i];
1851 lto_materialize_constructors_and_inits (file_data);
1854 /* Indicate that the cgraph is built and ready. */
1855 cgraph_function_flags_ready = true;
1857 timevar_pop (TV_IPA_LTO_DECL_IO);
1861 /* Materialize all the bodies for all the nodes in the callgraph. */
1864 materialize_cgraph (void)
1867 struct cgraph_node *node;
1869 timevar_id_t lto_timer;
1871 /* Now that we have input the cgraph, we need to clear all of the aux
1872 nodes and read the functions if we are not running in WPA mode. */
1873 timevar_push (TV_IPA_LTO_GIMPLE_IO);
1875 for (node = cgraph_nodes; node; node = node->next)
1877 /* Some cgraph nodes get created on the fly, and they don't need
1878 to be materialized. For instance, nodes for nested functions
1879 where the parent function was not streamed out or builtin
1880 functions. Additionally, builtin functions should not be
1881 materialized and may, in fact, cause confusion because there
1882 may be a regular function in the file whose assembler name
1883 matches that of the function.
1884 See gcc.c-torture/execute/20030125-1.c and
1885 gcc.c-torture/execute/921215-1.c. */
1886 if (node->local.lto_file_data
1887 && !DECL_IS_BUILTIN (node->decl))
1889 lto_materialize_function (node);
1890 lto_stats.num_input_cgraph_nodes++;
1894 timevar_pop (TV_IPA_LTO_GIMPLE_IO);
1896 /* Start the appropriate timer depending on the mode that we are
1898 lto_timer = (flag_wpa) ? TV_WHOPR_WPA
1899 : (flag_ltrans) ? TV_WHOPR_LTRANS
1901 timevar_push (lto_timer);
1903 current_function_decl = NULL;
1906 /* Inform the middle end about the global variables we have seen. */
1907 for (i = 0; VEC_iterate (tree, lto_global_var_decls, i, decl); i++)
1908 rest_of_decl_compilation (decl, 1, 0);
1910 /* Fix up any calls to DECLs that have become not exception throwing. */
1911 lto_fixup_nothrow_decls ();
1913 timevar_pop (lto_timer);
1917 /* Perform whole program analysis (WPA) on the callgraph and write out the
1918 optimization plan. */
1921 do_whole_program_analysis (void)
1923 char **output_files;
1925 struct cgraph_node *node;
1929 /* Note that since we are in WPA mode, materialize_cgraph will not
1930 actually read in all the function bodies. It only materializes
1931 the decls and cgraph nodes so that analysis can be performed. */
1932 materialize_cgraph ();
1934 /* Reading in the cgraph uses different timers, start timing WPA now. */
1935 timevar_push (TV_WHOPR_WPA);
1937 /* FIXME lto. Hack. We should use the IPA passes. There are a
1938 number of issues with this now. 1. There is no convenient way to
1939 do this. 2. Some passes may depend on properties that requires
1940 the function bodies to compute. */
1941 cgraph_function_flags_ready = true;
1942 bitmap_obstack_initialize (NULL);
1943 ipa_register_cgraph_hooks ();
1945 /* Reset inlining information before running IPA inliner. */
1946 for (node = cgraph_nodes; node; node = node->next)
1947 reset_inline_failed (node);
1949 /* FIXME lto. We should not call this function directly. */
1950 pass_ipa_inline.pass.execute ();
1953 bitmap_obstack_release (NULL);
1955 /* We are about to launch the final LTRANS phase, stop the WPA timer. */
1956 timevar_pop (TV_WHOPR_WPA);
1958 output_files = lto_wpa_write_files ();
1960 /* Show the LTO report before launching LTRANS. */
1961 if (flag_lto_report)
1962 print_lto_report ();
1964 lto_execute_ltrans (output_files);
1966 for (i = 0; output_files[i]; ++i)
1968 if (output_files[i][0] != '*')
1969 lto_maybe_unlink (output_files[i]);
1971 free (output_files[i]);
1974 XDELETEVEC (output_files);
1978 /* Main entry point for the GIMPLE front end. This front end has
1979 three main personalities:
1981 - LTO (-flto). All the object files on the command line are
1982 loaded in memory and processed as a single translation unit.
1983 This is the traditional link-time optimization behavior.
1985 - WPA (-fwpa). Only the callgraph and summary information for
1986 files in the command file are loaded. A single callgraph
1987 (without function bodies) is instantiated for the whole set of
1988 files. IPA passes are only allowed to analyze the call graph
1989 and make transformation decisions. The callgraph is
1990 partitioned, each partition is written to a new object file
1991 together with the transformation decisions.
1993 - LTRANS (-fltrans). Similar to -flto but it prevents the IPA
1994 summary files from running again. Since WPA computed summary
1995 information and decided what transformations to apply, LTRANS
1996 simply applies them. */
1999 lto_main (int debug_p ATTRIBUTE_UNUSED)
2003 /* Read all the symbols and call graph from all the files in the
2005 read_cgraph_and_symbols (num_in_fnames, in_fnames);
2009 /* If WPA is enabled analyze the whole call graph and create an
2010 optimization plan. Otherwise, read in all the function
2011 bodies and continue with optimization. */
2013 do_whole_program_analysis ();
2016 materialize_cgraph ();
2018 /* Let the middle end know that we have read and merged all of
2022 /* FIXME lto, if the processes spawned by WPA fail, we miss
2023 the chance to print WPA's report, so WPA will call
2024 print_lto_report before launching LTRANS. If LTRANS was
2025 launched directly by the driver we would not need to do
2027 if (flag_lto_report)
2028 print_lto_report ();
2033 #include "gt-lto-lto.h"