1 /* Top-level LTO routines.
2 Copyright 2009, 2010 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. */
53 /* Handle opening elf files on hosts, such as Windows, that may use
54 text file handling that will break binary access. */
62 DEF_VEC_ALLOC_P(bitmap,heap);
64 /* Read the constructors and inits. */
67 lto_materialize_constructors_and_inits (struct lto_file_decl_data * file_data)
70 const char *data = lto_get_section_data (file_data,
71 LTO_section_static_initializer,
73 lto_input_constructors_and_inits (file_data, data);
74 lto_free_section_data (file_data, LTO_section_static_initializer, NULL,
78 /* Read the function body for the function associated with NODE if possible. */
81 lto_materialize_function (struct cgraph_node *node)
84 struct lto_file_decl_data *file_data;
85 const char *data, *name;
89 /* Ignore clone nodes. Read the body only from the original one.
90 We may find clone nodes during LTRANS after WPA has made inlining
96 file_data = node->local.lto_file_data;
97 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
99 /* We may have renamed the declaration, e.g., a static function. */
100 name = lto_get_decl_name_mapping (file_data, name);
102 data = lto_get_section_data (file_data, LTO_section_function_body,
108 gcc_assert (!DECL_IS_BUILTIN (decl));
110 /* This function has a definition. */
111 TREE_STATIC (decl) = 1;
113 gcc_assert (DECL_STRUCT_FUNCTION (decl) == NULL);
114 allocate_struct_function (decl, false);
116 /* Load the function body only if not operating in WPA mode. In
117 WPA mode, the body of the function is not needed. */
120 lto_input_function_body (file_data, decl, data);
121 lto_stats.num_function_bodies++;
124 fn = DECL_STRUCT_FUNCTION (decl);
125 lto_free_section_data (file_data, LTO_section_function_body, name,
128 /* Look for initializers of constant variables and private
130 for (step = fn->local_decls; step; step = TREE_CHAIN (step))
132 tree decl = TREE_VALUE (step);
133 if (TREE_CODE (decl) == VAR_DECL
134 && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
135 && flag_unit_at_a_time)
136 varpool_finalize_decl (decl);
140 DECL_EXTERNAL (decl) = 1;
142 /* Let the middle end know about the function. */
143 rest_of_decl_compilation (decl, 1, 0);
144 if (cgraph_node (decl)->needed)
145 cgraph_mark_reachable_node (cgraph_node (decl));
149 /* Decode the content of memory pointed to by DATA in the the
150 in decl state object STATE. DATA_IN points to a data_in structure for
151 decoding. Return the address after the decoded object in the input. */
153 static const uint32_t *
154 lto_read_in_decl_state (struct data_in *data_in, const uint32_t *data,
155 struct lto_in_decl_state *state)
162 decl = lto_streamer_cache_get (data_in->reader_cache, (int) ix);
163 if (TREE_CODE (decl) != FUNCTION_DECL)
165 gcc_assert (decl == void_type_node);
168 state->fn_decl = decl;
170 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
172 uint32_t size = *data++;
173 tree *decls = (tree *) xcalloc (size, sizeof (tree));
175 for (j = 0; j < size; j++)
177 decls[j] = lto_streamer_cache_get (data_in->reader_cache, data[j]);
179 /* Register every type in the global type table. If the
180 type existed already, use the existing type. */
181 if (TYPE_P (decls[j]))
182 decls[j] = gimple_register_type (decls[j]);
185 state->streams[i].size = size;
186 state->streams[i].trees = decls;
194 /* Read all the symbols from buffer DATA, using descriptors in DECL_DATA.
195 RESOLUTIONS is the set of symbols picked by the linker (read from the
196 resolution file when the linker plugin is being used). */
199 lto_read_decls (struct lto_file_decl_data *decl_data, const void *data,
200 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions)
202 const struct lto_decl_header *header = (const struct lto_decl_header *) data;
203 const int32_t decl_offset = sizeof (struct lto_decl_header);
204 const int32_t main_offset = decl_offset + header->decl_state_size;
205 const int32_t string_offset = main_offset + header->main_size;
206 struct lto_input_block ib_main;
207 struct data_in *data_in;
209 const uint32_t *data_ptr, *data_end;
210 uint32_t num_decl_states;
212 LTO_INIT_INPUT_BLOCK (ib_main, (const char *) data + main_offset, 0,
215 data_in = lto_data_in_create (decl_data, (const char *) data + string_offset,
216 header->string_size, resolutions);
218 /* Read the global declarations and types. */
219 while (ib_main.p < ib_main.len)
221 tree t = lto_input_tree (&ib_main, data_in);
222 gcc_assert (t && ib_main.p <= ib_main.len);
225 /* Read in lto_in_decl_state objects. */
226 data_ptr = (const uint32_t *) ((const char*) data + decl_offset);
228 (const uint32_t *) ((const char*) data_ptr + header->decl_state_size);
229 num_decl_states = *data_ptr++;
231 gcc_assert (num_decl_states > 0);
232 decl_data->global_decl_state = lto_new_in_decl_state ();
233 data_ptr = lto_read_in_decl_state (data_in, data_ptr,
234 decl_data->global_decl_state);
236 /* Read in per-function decl states and enter them in hash table. */
237 decl_data->function_decl_states =
238 htab_create (37, lto_hash_in_decl_state, lto_eq_in_decl_state, free);
240 for (i = 1; i < num_decl_states; i++)
242 struct lto_in_decl_state *state = lto_new_in_decl_state ();
245 data_ptr = lto_read_in_decl_state (data_in, data_ptr, state);
246 slot = htab_find_slot (decl_data->function_decl_states, state, INSERT);
247 gcc_assert (*slot == NULL);
251 if (data_ptr != data_end)
252 internal_error ("bytecode stream: garbage at the end of symbols section");
254 /* Set the current decl state to be the global state. */
255 decl_data->current_decl_state = decl_data->global_decl_state;
257 lto_data_in_delete (data_in);
260 /* strtoll is not portable. */
262 lto_parse_hex (const char *p) {
264 for (; *p != '\0'; ++p)
269 if (c >= '0' && c <= '9')
271 else if (c >= 'a' && c <= 'f')
273 else if (c >= 'A' && c <= 'F')
276 internal_error ("could not parse hex number");
282 /* Read resolution for file named FILE_NAME. The resolution is read from
283 RESOLUTION. An array with the symbol resolution is returned. The array
284 size is written to SIZE. */
286 static VEC(ld_plugin_symbol_resolution_t,heap) *
287 lto_resolution_read (FILE *resolution, lto_file *file)
289 /* We require that objects in the resolution file are in the same
290 order as the lto1 command line. */
291 unsigned int name_len;
293 unsigned int num_symbols;
295 VEC(ld_plugin_symbol_resolution_t,heap) *ret = NULL;
296 unsigned max_index = 0;
301 name_len = strlen (file->filename);
302 obj_name = XNEWVEC (char, name_len + 1);
303 fscanf (resolution, " "); /* Read white space. */
305 fread (obj_name, sizeof (char), name_len, resolution);
306 obj_name[name_len] = '\0';
307 if (strcmp (obj_name, file->filename) != 0)
308 internal_error ("unexpected file name %s in linker resolution file. "
309 "Expected %s", obj_name, file->filename);
310 if (file->offset != 0)
315 t = fscanf (resolution, "@0x%16s", offset_p);
317 internal_error ("could not parse file offset");
318 offset = lto_parse_hex (offset_p);
319 if (offset != file->offset)
320 internal_error ("unexpected offset");
325 fscanf (resolution, "%u", &num_symbols);
327 for (i = 0; i < num_symbols; i++)
332 enum ld_plugin_symbol_resolution r;
334 unsigned int lto_resolution_str_len =
335 sizeof (lto_resolution_str) / sizeof (char *);
337 t = fscanf (resolution, "%u %26s %*[^\n]\n", &index, r_str);
339 internal_error ("Invalid line in the resolution file.");
340 if (index > max_index)
343 for (j = 0; j < lto_resolution_str_len; j++)
345 if (strcmp (lto_resolution_str[j], r_str) == 0)
347 r = (enum ld_plugin_symbol_resolution) j;
351 if (j == lto_resolution_str_len)
352 internal_error ("Invalid resolution in the resolution file.");
354 VEC_safe_grow_cleared (ld_plugin_symbol_resolution_t, heap, ret,
356 VEC_replace (ld_plugin_symbol_resolution_t, ret, index, r);
362 /* Generate a TREE representation for all types and external decls
365 Read all of the globals out of the file. Then read the cgraph
366 and process the .o index into the cgraph nodes so that it can open
367 the .o file to load the functions and ipa information. */
369 static struct lto_file_decl_data *
370 lto_file_read (lto_file *file, FILE *resolution_file)
372 struct lto_file_decl_data *file_data;
375 VEC(ld_plugin_symbol_resolution_t,heap) *resolutions;
377 resolutions = lto_resolution_read (resolution_file, file);
379 file_data = XCNEW (struct lto_file_decl_data);
380 file_data->file_name = file->filename;
381 file_data->section_hash_table = lto_elf_build_section_table (file);
382 file_data->renaming_hash_table = lto_create_renaming_table ();
384 data = lto_get_section_data (file_data, LTO_section_decls, NULL, &len);
385 lto_read_decls (file_data, data, resolutions);
386 lto_free_section_data (file_data, LTO_section_decls, NULL, data, len);
391 #if HAVE_MMAP_FILE && HAVE_SYSCONF && defined _SC_PAGE_SIZE
392 #define LTO_MMAP_IO 1
396 /* Page size of machine is used for mmap and munmap calls. */
397 static size_t page_mask;
400 /* Get the section data of length LEN from FILENAME starting at
401 OFFSET. The data segment must be freed by the caller when the
402 caller is finished. Returns NULL if all was not well. */
405 lto_read_section_data (struct lto_file_decl_data *file_data,
406 intptr_t offset, size_t len)
410 static char *fd_name;
412 intptr_t computed_len;
413 intptr_t computed_offset;
417 /* Keep a single-entry file-descriptor cache. The last file we
418 touched will get closed at exit.
419 ??? Eventually we want to add a more sophisticated larger cache
420 or rather fix function body streaming to not stream them in
421 practically random order. */
423 && strcmp (fd_name, file_data->file_name) != 0)
431 fd_name = xstrdup (file_data->file_name);
432 fd = open (file_data->file_name, O_RDONLY|O_BINARY);
440 size_t page_size = sysconf (_SC_PAGE_SIZE);
441 page_mask = ~(page_size - 1);
444 computed_offset = offset & page_mask;
445 diff = offset - computed_offset;
446 computed_len = len + diff;
448 result = (char *) mmap (NULL, computed_len, PROT_READ, MAP_PRIVATE,
449 fd, computed_offset);
450 if (result == MAP_FAILED)
453 return result + diff;
455 result = (char *) xmalloc (len);
456 if (lseek (fd, offset, SEEK_SET) != offset
457 || read (fd, result, len) != (ssize_t) len)
468 /* Get the section data from FILE_DATA of SECTION_TYPE with NAME.
469 NAME will be NULL unless the section type is for a function
473 get_section_data (struct lto_file_decl_data *file_data,
474 enum lto_section_type section_type,
478 htab_t section_hash_table = file_data->section_hash_table;
479 struct lto_section_slot *f_slot;
480 struct lto_section_slot s_slot;
481 const char *section_name = lto_get_section_name (section_type, name);
485 s_slot.name = section_name;
486 f_slot = (struct lto_section_slot *) htab_find (section_hash_table, &s_slot);
489 data = lto_read_section_data (file_data, f_slot->start, f_slot->len);
493 free (CONST_CAST (char *, section_name));
498 /* Free the section data from FILE_DATA of SECTION_TYPE with NAME that
499 starts at OFFSET and has LEN bytes. */
502 free_section_data (struct lto_file_decl_data *file_data ATTRIBUTE_UNUSED,
503 enum lto_section_type section_type ATTRIBUTE_UNUSED,
504 const char *name ATTRIBUTE_UNUSED,
505 const char *offset, size_t len ATTRIBUTE_UNUSED)
508 intptr_t computed_len;
509 intptr_t computed_offset;
514 computed_offset = ((intptr_t) offset) & page_mask;
515 diff = (intptr_t) offset - computed_offset;
516 computed_len = len + diff;
518 munmap ((caddr_t) computed_offset, computed_len);
520 free (CONST_CAST(char *, offset));
524 /* Vector of all cgraph node sets. */
525 static GTY (()) VEC(cgraph_node_set, gc) *lto_cgraph_node_sets;
528 /* Group cgrah nodes by input files. This is used mainly for testing
532 lto_1_to_1_map (void)
534 struct cgraph_node *node;
535 struct lto_file_decl_data *file_data;
536 struct pointer_map_t *pmap;
540 timevar_push (TV_WHOPR_WPA);
542 lto_cgraph_node_sets = VEC_alloc (cgraph_node_set, gc, 1);
544 /* If the cgraph is empty, create one cgraph node set so that there is still
545 an output file for any variables that need to be exported in a DSO. */
548 set = cgraph_node_set_new ();
549 VEC_safe_push (cgraph_node_set, gc, lto_cgraph_node_sets, set);
553 pmap = pointer_map_create ();
555 for (node = cgraph_nodes; node; node = node->next)
557 /* We will get proper partition based on function they are inlined to or
559 if (node->global.inlined_to || node->clone_of)
561 /* We only need to partition the nodes that we read from the
562 gimple bytecode files. */
563 file_data = node->local.lto_file_data;
564 if (file_data == NULL)
567 slot = pointer_map_contains (pmap, file_data);
569 set = (cgraph_node_set) *slot;
572 set = cgraph_node_set_new ();
573 slot = pointer_map_insert (pmap, file_data);
575 VEC_safe_push (cgraph_node_set, gc, lto_cgraph_node_sets, set);
578 cgraph_node_set_add (set, node);
581 pointer_map_destroy (pmap);
584 timevar_pop (TV_WHOPR_WPA);
586 lto_stats.num_cgraph_partitions += VEC_length (cgraph_node_set,
587 lto_cgraph_node_sets);
591 /* Add inlined clone NODE and its master clone to SET, if NODE itself has
592 inlined callees, recursively add the callees. */
595 lto_add_inline_clones (cgraph_node_set set, struct cgraph_node *node,
596 bitmap original_decls)
598 struct cgraph_node *callee;
599 struct cgraph_edge *edge;
601 cgraph_node_set_add (set, node);
603 /* Check to see if NODE has any inlined callee. */
604 for (edge = node->callees; edge != NULL; edge = edge->next_callee)
606 callee = edge->callee;
607 if (callee->global.inlined_to != NULL)
608 lto_add_inline_clones (set, callee, original_decls);
612 /* Compute the transitive closure of inlining of SET based on the
613 information in the callgraph. Returns a bitmap of decls that have
614 been inlined into SET indexed by UID. */
617 lto_add_all_inlinees (cgraph_node_set set)
619 cgraph_node_set_iterator csi;
620 struct cgraph_node *node;
621 bitmap original_nodes = lto_bitmap_alloc ();
622 bitmap original_decls = lto_bitmap_alloc ();
625 /* We are going to iterate SET while adding to it, mark all original
626 nodes so that we only add node inlined to original nodes. */
627 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
629 bitmap_set_bit (original_nodes, csi_node (csi)->uid);
630 bitmap_set_bit (original_decls, DECL_UID (csi_node (csi)->decl));
633 /* Some of the original nodes might not be needed anymore.
638 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
640 struct cgraph_node *inlined_to;
641 node = csi_node (csi);
643 /* NODE was not inlined. We still need it. */
644 if (!node->global.inlined_to)
647 inlined_to = node->global.inlined_to;
649 /* NODE should have only one caller. */
650 gcc_assert (!node->callers->next_caller);
652 if (!bitmap_bit_p (original_nodes, inlined_to->uid))
654 bitmap_clear_bit (original_nodes, node->uid);
655 cgraph_node_set_remove (set, node);
662 /* Transitively add to SET all the inline clones for every node that
664 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
666 node = csi_node (csi);
667 if (bitmap_bit_p (original_nodes, node->uid))
668 lto_add_inline_clones (set, node, original_decls);
671 lto_bitmap_free (original_nodes);
672 lto_bitmap_free (original_decls);
675 /* Owing to inlining, we may need to promote a file-scope variable
676 to a global variable. Consider this case:
689 extern void foo (void);
697 If WPA inlines FOO inside BAR, then the static variable VAR needs to
698 be promoted to global because BAR and VAR may be in different LTRANS
701 /* This struct keeps track of states used in globalization. */
705 /* Current cgraph node set. */
708 /* Function DECLs of cgraph nodes seen. */
709 bitmap seen_node_decls;
711 /* Use in walk_tree to avoid multiple visits of a node. */
712 struct pointer_set_t *visited;
714 /* static vars in this set. */
715 bitmap static_vars_in_set;
717 /* static vars in all previous set. */
718 bitmap all_static_vars;
720 /* all vars in all previous set. */
722 } globalize_context_t;
724 /* Callback for walk_tree. Examine the tree pointer to by TP and see if
725 if its a file-scope static variable of function that need to be turned
729 globalize_cross_file_statics (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
732 globalize_context_t *context = (globalize_context_t *) data;
738 /* The logic for globalization of VAR_DECLs and FUNCTION_DECLs are
739 different. For functions, we can simply look at the cgraph node sets
740 to tell if there are references to static functions outside the set.
741 The cgraph node sets do not keep track of vars, we need to traverse
742 the trees to determine what vars need to be globalized. */
743 if (TREE_CODE (t) == VAR_DECL)
745 if (!TREE_PUBLIC (t))
747 /* This file-scope static variable is reachable from more
748 that one set. Make it global but with hidden visibility
749 so that we do not export it in dynamic linking. */
750 if (bitmap_bit_p (context->all_static_vars, DECL_UID (t)))
753 DECL_VISIBILITY (t) = VISIBILITY_HIDDEN;
755 bitmap_set_bit (context->static_vars_in_set, DECL_UID (t));
757 bitmap_set_bit (context->all_vars, DECL_UID (t));
758 walk_tree (&DECL_INITIAL (t), globalize_cross_file_statics, context,
761 else if (TREE_CODE (t) == FUNCTION_DECL && !TREE_PUBLIC (t))
763 if (!cgraph_node_in_set_p (cgraph_node (t), context->set))
765 /* This file-scope static function is reachable from a set
766 which does not contain the function DECL. Make it global
767 but with hidden visibility. */
769 DECL_VISIBILITY (t) = VISIBILITY_HIDDEN;
776 /* Helper of lto_scan_statics_in_cgraph_node below. Scan TABLE for
777 static decls that may be used in more than one LTRANS file.
778 CONTEXT is a globalize_context_t for storing scanning states. */
781 lto_scan_statics_in_ref_table (struct lto_tree_ref_table *table,
782 globalize_context_t *context)
786 for (i = 0; i < table->size; i++)
787 walk_tree (&table->trees[i], globalize_cross_file_statics, context,
791 /* Promote file-scope decl reachable from NODE if necessary to global.
792 CONTEXT is a globalize_context_t storing scanning states. */
795 lto_scan_statics_in_cgraph_node (struct cgraph_node *node,
796 globalize_context_t *context)
798 struct lto_in_decl_state *state;
800 /* Do nothing if NODE has no function body. */
804 /* Return if the DECL of nodes has been visited before. */
805 if (bitmap_bit_p (context->seen_node_decls, DECL_UID (node->decl)))
808 bitmap_set_bit (context->seen_node_decls, DECL_UID (node->decl));
810 state = lto_get_function_in_decl_state (node->local.lto_file_data,
814 lto_scan_statics_in_ref_table (&state->streams[LTO_DECL_STREAM_VAR_DECL],
816 lto_scan_statics_in_ref_table (&state->streams[LTO_DECL_STREAM_FN_DECL],
820 /* Scan all global variables that we have not yet seen so far. CONTEXT
821 is a globalize_context_t storing scanning states. */
824 lto_scan_statics_in_remaining_global_vars (globalize_context_t *context)
826 tree var, var_context;
827 struct varpool_node *vnode;
829 FOR_EACH_STATIC_VARIABLE (vnode)
832 var_context = DECL_CONTEXT (var);
833 if (TREE_STATIC (var)
835 && (!var_context || TREE_CODE (var_context) != FUNCTION_DECL)
836 && !bitmap_bit_p (context->all_vars, DECL_UID (var)))
837 walk_tree (&var, globalize_cross_file_statics, context,
842 /* Find out all static decls that need to be promoted to global because
843 of cross file sharing. This function must be run in the WPA mode after
844 all inlinees are added. */
847 lto_promote_cross_file_statics (void)
851 cgraph_node_set_iterator csi;
852 globalize_context_t context;
854 memset (&context, 0, sizeof (context));
855 context.all_vars = lto_bitmap_alloc ();
856 context.all_static_vars = lto_bitmap_alloc ();
858 n_sets = VEC_length (cgraph_node_set, lto_cgraph_node_sets);
859 for (i = 0; i < n_sets; i++)
861 set = VEC_index (cgraph_node_set, lto_cgraph_node_sets, i);
863 context.visited = pointer_set_create ();
864 context.static_vars_in_set = lto_bitmap_alloc ();
865 context.seen_node_decls = lto_bitmap_alloc ();
867 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
868 lto_scan_statics_in_cgraph_node (csi_node (csi), &context);
871 lto_scan_statics_in_remaining_global_vars (&context);
873 bitmap_ior_into (context.all_static_vars, context.static_vars_in_set);
875 pointer_set_destroy (context.visited);
876 lto_bitmap_free (context.static_vars_in_set);
877 lto_bitmap_free (context.seen_node_decls);
880 lto_bitmap_free (context.all_vars);
881 lto_bitmap_free (context.all_static_vars);
885 /* Given a file name FNAME, return a string with FNAME prefixed with '*'. */
888 prefix_name_with_star (const char *fname)
893 len = strlen (fname) + 1 + 1;
894 star_fname = XNEWVEC (char, len);
895 snprintf (star_fname, len, "*%s", fname);
901 /* Return a copy of FNAME without the .o extension. */
904 strip_extension (const char *fname)
906 char *s = XNEWVEC (char, strlen (fname) - 2 + 1);
907 gcc_assert (strstr (fname, ".o"));
908 snprintf (s, strlen (fname) - 2 + 1, "%s", fname);
914 /* Return a file name associated with cgraph node set SET. This may
915 be a new temporary file name if SET needs to be processed by
916 LTRANS, or the original file name if all the nodes in SET belong to
917 the same input file. */
920 get_filename_for_set (cgraph_node_set set)
923 static const size_t max_fname_len = 100;
925 if (cgraph_node_set_needs_ltrans_p (set))
927 /* Create a new temporary file to store SET. To facilitate
928 debugging, use file names from SET as part of the new
929 temporary file name. */
930 cgraph_node_set_iterator si;
931 struct pointer_set_t *pset = pointer_set_create ();
932 for (si = csi_start (set); !csi_end_p (si); csi_next (&si))
934 struct cgraph_node *n = csi_node (si);
935 const char *node_fname;
938 /* Don't use the same file name more than once. */
939 if (pointer_set_insert (pset, n->local.lto_file_data))
942 /* The first file name found in SET determines the output
943 directory. For the remaining files, we use their
945 node_fname = n->local.lto_file_data->file_name;
948 fname = strip_extension (node_fname);
952 f = strip_extension (lbasename (node_fname));
954 /* If the new name causes an excessively long file name,
955 make the last component "___" to indicate overflow. */
956 if (strlen (fname) + strlen (f) > max_fname_len - 3)
958 fname = reconcat (fname, fname, "___", NULL);
963 fname = reconcat (fname, fname, "_", f, NULL);
968 pointer_set_destroy (pset);
970 /* Add the extension .wpa.o to indicate that this file has been
972 fname = reconcat (fname, fname, ".wpa.o", NULL);
977 /* Since SET does not need to be processed by LTRANS, use
978 the original file name and mark it with a '*' prefix so that
979 lto_execute_ltrans knows not to process it. */
980 cgraph_node_set_iterator si = csi_start (set);
981 struct cgraph_node *first = csi_node (si);
982 fname = prefix_name_with_star (first->local.lto_file_data->file_name);
988 static lto_file *current_lto_file;
991 /* Write all output files in WPA mode. Returns a NULL-terminated array of
992 output file names. */
995 lto_wpa_write_files (void)
998 unsigned i, n_sets, last_out_file_ix, num_out_files;
1000 cgraph_node_set set;
1002 timevar_push (TV_WHOPR_WPA);
1004 /* Include all inlined functions and determine what sets need to be
1005 compiled by LTRANS. After this loop, only those sets that
1006 contain callgraph nodes from more than one file will need to be
1007 compiled by LTRANS. */
1008 for (i = 0; VEC_iterate (cgraph_node_set, lto_cgraph_node_sets, i, set); i++)
1010 lto_add_all_inlinees (set);
1011 lto_stats.num_output_cgraph_nodes += VEC_length (cgraph_node_ptr,
1015 /* After adding all inlinees, find out statics that need to be promoted
1016 to globals because of cross-file inlining. */
1017 lto_promote_cross_file_statics ();
1019 timevar_pop (TV_WHOPR_WPA);
1021 timevar_push (TV_WHOPR_WPA_IO);
1023 /* The number of output files depends on the number of input files
1024 and how many callgraph node sets we create. Reserve enough space
1025 for the maximum of these two. */
1026 num_out_files = MAX (VEC_length (cgraph_node_set, lto_cgraph_node_sets),
1028 output_files = XNEWVEC (char *, num_out_files + 1);
1030 n_sets = VEC_length (cgraph_node_set, lto_cgraph_node_sets);
1031 for (i = 0; i < n_sets; i++)
1033 char *temp_filename;
1035 set = VEC_index (cgraph_node_set, lto_cgraph_node_sets, i);
1036 temp_filename = get_filename_for_set (set);
1037 output_files[i] = temp_filename;
1039 if (cgraph_node_set_needs_ltrans_p (set))
1041 /* Write all the nodes in SET to TEMP_FILENAME. */
1042 file = lto_elf_file_open (temp_filename, true);
1044 fatal_error ("lto_elf_file_open() failed");
1046 lto_set_current_out_file (file);
1048 ipa_write_summaries_of_cgraph_node_set (set);
1050 lto_set_current_out_file (NULL);
1051 lto_elf_file_close (file);
1055 last_out_file_ix = n_sets;
1057 lto_stats.num_output_files += n_sets;
1059 output_files[last_out_file_ix] = NULL;
1061 timevar_pop (TV_WHOPR_WPA_IO);
1063 return output_files;
1066 /* Template of LTRANS dumpbase suffix. */
1067 #define DUMPBASE_SUFFIX ".ltrans18446744073709551615"
1069 /* Perform local transformations (LTRANS) on the files in the NULL-terminated
1070 FILES array. These should have been written previously by
1071 lto_wpa_write_files (). Transformations are performed via executing
1072 COLLECT_GCC for reach file. */
1075 lto_execute_ltrans (char *const *files)
1077 struct pex_obj *pex;
1078 const char *collect_gcc_options, *collect_gcc;
1079 struct obstack env_obstack;
1081 const char **argv_ptr;
1086 FILE *ltrans_output_list_stream = NULL;
1087 bool seen_dumpbase = false;
1088 char *dumpbase_suffix = NULL;
1090 timevar_push (TV_WHOPR_WPA_LTRANS_EXEC);
1092 /* Get the driver and options. */
1093 collect_gcc = getenv ("COLLECT_GCC");
1095 fatal_error ("environment variable COLLECT_GCC must be set");
1097 /* Set the CFLAGS environment variable. */
1098 collect_gcc_options = getenv ("COLLECT_GCC_OPTIONS");
1099 if (!collect_gcc_options)
1100 fatal_error ("environment variable COLLECT_GCC_OPTIONS must be set");
1102 /* Count arguments. */
1104 for (j = 0; collect_gcc_options[j] != '\0'; ++j)
1105 if (collect_gcc_options[j] == '\'')
1109 fatal_error ("malformed COLLECT_GCC_OPTIONS");
1111 /* Initalize the arguments for the LTRANS driver. */
1112 argv = XNEWVEC (const char *, 8 + i / 2);
1114 *argv_ptr++ = collect_gcc;
1115 *argv_ptr++ = "-xlto";
1116 for (j = 0; collect_gcc_options[j] != '\0'; ++j)
1117 if (collect_gcc_options[j] == '\'')
1123 while (collect_gcc_options[j] != '\'')
1125 obstack_init (&env_obstack);
1126 obstack_grow (&env_obstack, &collect_gcc_options[i], j - i);
1128 obstack_grow (&env_obstack, DUMPBASE_SUFFIX,
1129 sizeof (DUMPBASE_SUFFIX));
1131 obstack_1grow (&env_obstack, 0);
1132 option = XOBFINISH (&env_obstack, char *);
1135 dumpbase_suffix = option + 7 + j - i;
1136 seen_dumpbase = false;
1139 /* LTRANS does not need -fwpa nor -fltrans-*. */
1140 if (strncmp (option, "-fwpa", 5) != 0
1141 && strncmp (option, "-fltrans-", 9) != 0)
1143 if (strncmp (option, "-dumpbase", 9) == 0)
1144 seen_dumpbase = true;
1145 *argv_ptr++ = option;
1148 *argv_ptr++ = "-fltrans";
1150 /* Open the LTRANS output list. */
1151 if (ltrans_output_list)
1153 ltrans_output_list_stream = fopen (ltrans_output_list, "w");
1154 if (ltrans_output_list_stream == NULL)
1155 error ("opening LTRANS output list %s: %m", ltrans_output_list);
1158 for (i = 0; files[i]; ++i)
1162 /* If the file is prefixed with a '*', it means that we do not
1163 need to re-compile it with LTRANS because it has not been
1164 modified by WPA. Skip it from the command line to
1165 lto_execute_ltrans, but add it to ltrans_output_list_stream
1166 so it is linked after we are done. */
1167 if (files[i][0] == '*')
1169 size_t len = strlen (files[i]) - 1;
1170 if (ltrans_output_list_stream)
1171 if (fwrite (&files[i][1], 1, len, ltrans_output_list_stream) < len
1172 || fwrite ("\n", 1, 1, ltrans_output_list_stream) < 1)
1173 error ("writing to LTRANS output list %s: %m",
1174 ltrans_output_list);
1180 /* Otherwise, add FILES[I] to lto_execute_ltrans command line
1181 and add the resulting file to LTRANS output list. */
1183 /* Replace the .o suffix with a .ltrans.o suffix and write
1184 the resulting name to the LTRANS output list. */
1185 obstack_init (&env_obstack);
1186 obstack_grow (&env_obstack, files[i], strlen (files[i]) - 2);
1187 obstack_grow (&env_obstack, ".ltrans.o", sizeof (".ltrans.o"));
1188 output_name = XOBFINISH (&env_obstack, char *);
1189 if (ltrans_output_list_stream)
1191 len = strlen (output_name);
1193 if (fwrite (output_name, 1, len, ltrans_output_list_stream) < len
1194 || fwrite ("\n", 1, 1, ltrans_output_list_stream) < 1)
1195 error ("writing to LTRANS output list %s: %m",
1196 ltrans_output_list);
1200 argv_ptr[1] = output_name;
1201 argv_ptr[2] = files[i];
1204 /* Append a sequence number to -dumpbase for LTRANS. */
1205 if (dumpbase_suffix)
1206 snprintf (dumpbase_suffix, sizeof (DUMPBASE_SUFFIX) - 7,
1207 "%lu", (unsigned long) i);
1209 /* Execute the driver. */
1210 pex = pex_init (0, "lto1", NULL);
1212 fatal_error ("pex_init failed: %s", xstrerror (errno));
1214 errmsg = pex_run (pex, PEX_LAST | PEX_SEARCH, argv[0],
1215 CONST_CAST (char **, argv), NULL, NULL, &err);
1217 fatal_error ("%s: %s", errmsg, xstrerror (err));
1219 if (!pex_get_status (pex, 1, &status))
1220 fatal_error ("can't get program status: %s", xstrerror (errno));
1224 if (WIFSIGNALED (status))
1226 int sig = WTERMSIG (status);
1227 fatal_error ("%s terminated with signal %d [%s]%s",
1228 argv[0], sig, strsignal (sig),
1229 WCOREDUMP (status) ? ", core dumped" : "");
1232 fatal_error ("%s terminated with status %d", argv[0], status);
1239 /* Close the LTRANS output list. */
1240 if (ltrans_output_list_stream && fclose (ltrans_output_list_stream))
1241 error ("closing LTRANS output list %s: %m", ltrans_output_list);
1243 obstack_free (&env_obstack, NULL);
1246 timevar_pop (TV_WHOPR_WPA_LTRANS_EXEC);
1251 struct pointer_set_t *seen;
1254 #define LTO_FIXUP_SUBTREE(t) \
1256 walk_tree (&(t), lto_fixup_tree, data, NULL); \
1259 #define LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE(t) \
1263 (t) = gimple_register_type (t); \
1264 walk_tree (&(t), lto_fixup_tree, data, NULL); \
1268 static tree lto_fixup_tree (tree *, int *, void *);
1270 /* Return true if T does not need to be fixed up recursively. */
1276 || CONSTANT_CLASS_P (t)
1277 || TREE_CODE (t) == IDENTIFIER_NODE);
1280 /* Fix up fields of a tree_common T. DATA points to fix-up states. */
1283 lto_fixup_common (tree t, void *data)
1285 /* The following re-creates the TYPE_REFERENCE_TO and TYPE_POINTER_TO
1286 lists. We do not stream TYPE_REFERENCE_TO, TYPE_POINTER_TO or
1287 TYPE_NEXT_PTR_TO and TYPE_NEXT_REF_TO.
1288 First remove us from any pointer list we are on. */
1289 if (TREE_CODE (t) == POINTER_TYPE)
1291 if (TYPE_POINTER_TO (TREE_TYPE (t)) == t)
1292 TYPE_POINTER_TO (TREE_TYPE (t)) = TYPE_NEXT_PTR_TO (t);
1295 tree tem = TYPE_POINTER_TO (TREE_TYPE (t));
1296 while (tem && TYPE_NEXT_PTR_TO (tem) != t)
1297 tem = TYPE_NEXT_PTR_TO (tem);
1299 TYPE_NEXT_PTR_TO (tem) = TYPE_NEXT_PTR_TO (t);
1301 TYPE_NEXT_PTR_TO (t) = NULL_TREE;
1303 else if (TREE_CODE (t) == REFERENCE_TYPE)
1305 if (TYPE_REFERENCE_TO (TREE_TYPE (t)) == t)
1306 TYPE_REFERENCE_TO (TREE_TYPE (t)) = TYPE_NEXT_REF_TO (t);
1309 tree tem = TYPE_REFERENCE_TO (TREE_TYPE (t));
1310 while (tem && TYPE_NEXT_REF_TO (tem) != t)
1311 tem = TYPE_NEXT_REF_TO (tem);
1313 TYPE_NEXT_REF_TO (tem) = TYPE_NEXT_REF_TO (t);
1315 TYPE_NEXT_REF_TO (t) = NULL_TREE;
1318 /* Fixup our type. */
1319 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t));
1321 /* Second put us on the list of pointers of the new pointed-to type
1322 if we are a main variant. This is done in lto_fixup_type after
1323 fixing up our main variant. */
1325 /* This is not very efficient because we cannot do tail-recursion with
1326 a long chain of trees. */
1327 LTO_FIXUP_SUBTREE (TREE_CHAIN (t));
1330 /* Fix up fields of a decl_minimal T. DATA points to fix-up states. */
1333 lto_fixup_decl_minimal (tree t, void *data)
1335 lto_fixup_common (t, data);
1336 LTO_FIXUP_SUBTREE (DECL_NAME (t));
1337 LTO_FIXUP_SUBTREE (DECL_CONTEXT (t));
1340 /* Fix up fields of a decl_common T. DATA points to fix-up states. */
1343 lto_fixup_decl_common (tree t, void *data)
1345 lto_fixup_decl_minimal (t, data);
1346 LTO_FIXUP_SUBTREE (DECL_SIZE (t));
1347 LTO_FIXUP_SUBTREE (DECL_SIZE_UNIT (t));
1348 LTO_FIXUP_SUBTREE (DECL_INITIAL (t));
1349 LTO_FIXUP_SUBTREE (DECL_ATTRIBUTES (t));
1350 LTO_FIXUP_SUBTREE (DECL_ABSTRACT_ORIGIN (t));
1353 /* Fix up fields of a decl_with_vis T. DATA points to fix-up states. */
1356 lto_fixup_decl_with_vis (tree t, void *data)
1358 lto_fixup_decl_common (t, data);
1360 /* Accessor macro has side-effects, use field-name here. */
1361 LTO_FIXUP_SUBTREE (t->decl_with_vis.assembler_name);
1363 gcc_assert (no_fixup_p (DECL_SECTION_NAME (t)));
1366 /* Fix up fields of a decl_non_common T. DATA points to fix-up states. */
1369 lto_fixup_decl_non_common (tree t, void *data)
1371 lto_fixup_decl_with_vis (t, data);
1372 LTO_FIXUP_SUBTREE (DECL_ARGUMENT_FLD (t));
1373 LTO_FIXUP_SUBTREE (DECL_RESULT_FLD (t));
1374 LTO_FIXUP_SUBTREE (DECL_VINDEX (t));
1376 /* SAVED_TREE should not cleared by now. Also no accessor for base type. */
1377 gcc_assert (no_fixup_p (t->decl_non_common.saved_tree));
1380 /* Fix up fields of a decl_non_common T. DATA points to fix-up states. */
1383 lto_fixup_function (tree t, void *data)
1385 lto_fixup_decl_non_common (t, data);
1386 LTO_FIXUP_SUBTREE (DECL_FUNCTION_PERSONALITY (t));
1389 /* Fix up fields of a field_decl T. DATA points to fix-up states. */
1392 lto_fixup_field_decl (tree t, void *data)
1394 lto_fixup_decl_common (t, data);
1395 LTO_FIXUP_SUBTREE (DECL_FIELD_OFFSET (t));
1396 LTO_FIXUP_SUBTREE (DECL_BIT_FIELD_TYPE (t));
1397 LTO_FIXUP_SUBTREE (DECL_QUALIFIER (t));
1398 gcc_assert (no_fixup_p (DECL_FIELD_BIT_OFFSET (t)));
1399 LTO_FIXUP_SUBTREE (DECL_FCONTEXT (t));
1402 /* Fix up fields of a type T. DATA points to fix-up states. */
1405 lto_fixup_type (tree t, void *data)
1409 lto_fixup_common (t, data);
1410 LTO_FIXUP_SUBTREE (TYPE_CACHED_VALUES (t));
1411 LTO_FIXUP_SUBTREE (TYPE_SIZE (t));
1412 LTO_FIXUP_SUBTREE (TYPE_SIZE_UNIT (t));
1413 LTO_FIXUP_SUBTREE (TYPE_ATTRIBUTES (t));
1414 LTO_FIXUP_SUBTREE (TYPE_NAME (t));
1416 /* Accessors are for derived node types only. */
1417 if (!POINTER_TYPE_P (t))
1418 LTO_FIXUP_SUBTREE (t->type.minval);
1419 LTO_FIXUP_SUBTREE (t->type.maxval);
1421 /* Accessor is for derived node types only. */
1422 LTO_FIXUP_SUBTREE (t->type.binfo);
1424 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TYPE_CONTEXT (t));
1425 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TYPE_CANONICAL (t));
1427 /* The following re-creates proper variant lists while fixing up
1428 the variant leaders. We do not stream TYPE_NEXT_VARIANT so the
1429 variant list state before fixup is broken. */
1431 /* Remove us from our main variant list if we are not the variant leader. */
1432 if (TYPE_MAIN_VARIANT (t) != t)
1434 tem = TYPE_MAIN_VARIANT (t);
1435 while (tem && TYPE_NEXT_VARIANT (tem) != t)
1436 tem = TYPE_NEXT_VARIANT (tem);
1438 TYPE_NEXT_VARIANT (tem) = TYPE_NEXT_VARIANT (t);
1439 TYPE_NEXT_VARIANT (t) = NULL_TREE;
1442 /* Query our new main variant. */
1443 mv = gimple_register_type (TYPE_MAIN_VARIANT (t));
1445 /* If we were the variant leader and we get replaced ourselves drop
1446 all variants from our list. */
1447 if (TYPE_MAIN_VARIANT (t) == t
1453 tree tem2 = TYPE_NEXT_VARIANT (tem);
1454 TYPE_NEXT_VARIANT (tem) = NULL_TREE;
1459 /* If we are not our own variant leader link us into our new leaders
1463 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (mv);
1464 TYPE_NEXT_VARIANT (mv) = t;
1467 /* Finally adjust our main variant and fix it up. */
1468 TYPE_MAIN_VARIANT (t) = mv;
1469 LTO_FIXUP_SUBTREE (TYPE_MAIN_VARIANT (t));
1471 /* As the second step of reconstructing the pointer chains put us
1472 on the list of pointers of the new pointed-to type
1473 if we are a main variant. See lto_fixup_common for the first step. */
1474 if (TREE_CODE (t) == POINTER_TYPE
1475 && TYPE_MAIN_VARIANT (t) == t)
1477 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (TREE_TYPE (t));
1478 TYPE_POINTER_TO (TREE_TYPE (t)) = t;
1480 else if (TREE_CODE (t) == REFERENCE_TYPE
1481 && TYPE_MAIN_VARIANT (t) == t)
1483 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (TREE_TYPE (t));
1484 TYPE_REFERENCE_TO (TREE_TYPE (t)) = t;
1488 /* Fix up fields of a BINFO T. DATA points to fix-up states. */
1491 lto_fixup_binfo (tree t, void *data)
1493 unsigned HOST_WIDE_INT i, n;
1494 tree base, saved_base;
1496 lto_fixup_common (t, data);
1497 gcc_assert (no_fixup_p (BINFO_OFFSET (t)));
1498 LTO_FIXUP_SUBTREE (BINFO_VTABLE (t));
1499 LTO_FIXUP_SUBTREE (BINFO_VIRTUALS (t));
1500 LTO_FIXUP_SUBTREE (BINFO_VPTR_FIELD (t));
1501 n = VEC_length (tree, BINFO_BASE_ACCESSES (t));
1502 for (i = 0; i < n; i++)
1504 saved_base = base = BINFO_BASE_ACCESS (t, i);
1505 LTO_FIXUP_SUBTREE (base);
1506 if (base != saved_base)
1507 VEC_replace (tree, BINFO_BASE_ACCESSES (t), i, base);
1509 LTO_FIXUP_SUBTREE (BINFO_INHERITANCE_CHAIN (t));
1510 LTO_FIXUP_SUBTREE (BINFO_SUBVTT_INDEX (t));
1511 LTO_FIXUP_SUBTREE (BINFO_VPTR_INDEX (t));
1512 n = BINFO_N_BASE_BINFOS (t);
1513 for (i = 0; i < n; i++)
1515 saved_base = base = BINFO_BASE_BINFO (t, i);
1516 LTO_FIXUP_SUBTREE (base);
1517 if (base != saved_base)
1518 VEC_replace (tree, BINFO_BASE_BINFOS (t), i, base);
1522 /* Fix up fields of a CONSTRUCTOR T. DATA points to fix-up states. */
1525 lto_fixup_constructor (tree t, void *data)
1527 unsigned HOST_WIDE_INT idx;
1528 constructor_elt *ce;
1530 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t));
1533 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (t), idx, ce);
1536 LTO_FIXUP_SUBTREE (ce->index);
1537 LTO_FIXUP_SUBTREE (ce->value);
1541 /* A walk_tree callback used by lto_fixup_state. TP is the pointer to the
1542 current tree. WALK_SUBTREES indicates if the subtrees will be walked.
1543 DATA is a pointer set to record visited nodes. */
1546 lto_fixup_tree (tree *tp, int *walk_subtrees, void *data)
1549 lto_fixup_data_t *fixup_data = (lto_fixup_data_t *) data;
1554 if (pointer_set_contains (fixup_data->seen, t))
1557 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == FUNCTION_DECL)
1559 prevailing = lto_symtab_prevailing_decl (t);
1561 if (t != prevailing)
1563 if (TREE_CODE (t) == FUNCTION_DECL
1564 && TREE_NOTHROW (prevailing) != TREE_NOTHROW (t))
1566 /* If the prevailing definition does not throw but the
1567 declaration (T) was considered throwing, then we
1568 simply add PREVAILING to the list of throwing
1569 functions. However, if the opposite is true, then
1570 the call to PREVAILING was generated assuming that
1571 the function didn't throw, which means that CFG
1572 cleanup may have removed surrounding try/catch
1575 Note that we currently accept these cases even when
1576 they occur within a single file. It's certainly a
1577 user error, but we silently allow the compiler to
1578 remove surrounding try/catch regions. Perhaps we
1579 could emit a warning here, instead of silently
1580 accepting the conflicting declaration. */
1581 if (TREE_NOTHROW (prevailing))
1582 lto_mark_nothrow_fndecl (prevailing);
1585 /* Also replace t with prevailing defintion. We don't want to
1586 insert the other defintion in the seen set as we want to
1587 replace all instances of it. */
1592 else if (TYPE_P (t))
1594 /* Replace t with the prevailing type. We don't want to insert the
1595 other type in the seen set as we want to replace all instances of it. */
1596 t = gimple_register_type (t);
1600 if (pointer_set_insert (fixup_data->seen, t))
1603 /* walk_tree does not visit all reachable nodes that need to be fixed up.
1604 Hence we do special processing here for those kind of nodes. */
1605 switch (TREE_CODE (t))
1608 lto_fixup_field_decl (t, data);
1616 lto_fixup_decl_common (t, data);
1620 lto_fixup_decl_with_vis (t, data);
1624 lto_fixup_decl_non_common (t, data);
1628 lto_fixup_function (t, data);
1632 lto_fixup_binfo (t, data);
1637 lto_fixup_type (t, data);
1638 else if (TREE_CODE (t) == CONSTRUCTOR)
1639 lto_fixup_constructor (t, data);
1640 else if (CONSTANT_CLASS_P (t))
1641 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t));
1642 else if (EXPR_P (t))
1644 /* walk_tree only handles TREE_OPERANDs. Do the rest here. */
1645 lto_fixup_common (t, data);
1646 LTO_FIXUP_SUBTREE (t->exp.block);
1651 /* Let walk_tree handle sub-trees. */
1659 /* Helper function of lto_fixup_decls. Walks the var and fn streams in STATE,
1660 replaces var and function decls with the corresponding prevailing def and
1661 records the old decl in the free-list in DATA. We also record visted nodes
1662 in the seen-set in DATA to avoid multiple visit for nodes that need not
1666 lto_fixup_state (struct lto_in_decl_state *state, lto_fixup_data_t *data)
1669 struct lto_tree_ref_table *table;
1671 /* Although we only want to replace FUNCTION_DECLs and VAR_DECLs,
1672 we still need to walk from all DECLs to find the reachable
1673 FUNCTION_DECLs and VAR_DECLs. */
1674 for (si = 0; si < LTO_N_DECL_STREAMS; si++)
1676 table = &state->streams[si];
1677 for (i = 0; i < table->size; i++)
1678 walk_tree (table->trees + i, lto_fixup_tree, data, NULL);
1682 /* A callback of htab_traverse. Just extract a state from SLOT and the
1683 lto_fixup_data_t object from AUX and calls lto_fixup_state. */
1686 lto_fixup_state_aux (void **slot, void *aux)
1688 struct lto_in_decl_state *state = (struct lto_in_decl_state *) *slot;
1689 lto_fixup_state (state, (lto_fixup_data_t *) aux);
1693 /* Fix the decls from all FILES. Replaces each decl with the corresponding
1697 lto_fixup_decls (struct lto_file_decl_data **files)
1701 struct pointer_set_t *seen = pointer_set_create ();
1702 lto_fixup_data_t data;
1705 for (i = 0; files[i]; i++)
1707 struct lto_file_decl_data *file = files[i];
1708 struct lto_in_decl_state *state = file->global_decl_state;
1709 lto_fixup_state (state, &data);
1711 htab_traverse (file->function_decl_states, lto_fixup_state_aux, &data);
1714 for (i = 0; VEC_iterate (tree, lto_global_var_decls, i, decl); i++)
1716 tree saved_decl = decl;
1717 walk_tree (&decl, lto_fixup_tree, &data, NULL);
1718 if (decl != saved_decl)
1719 VEC_replace (tree, lto_global_var_decls, i, decl);
1722 pointer_set_destroy (seen);
1725 /* Unlink a temporary LTRANS file unless requested otherwise. */
1728 lto_maybe_unlink (const char *file)
1730 if (!getenv ("WPA_SAVE_LTRANS"))
1732 if (unlink_if_ordinary (file))
1733 error ("deleting LTRANS input file %s: %m", file);
1736 fprintf (stderr, "[Leaving LTRANS input file %s]\n", file);
1739 /* Read the options saved from each file in the command line. Called
1740 from lang_hooks.post_options which is called by process_options
1741 right before all the options are used to initialize the compiler.
1742 This assumes that decode_options has already run, so the
1743 num_in_fnames and in_fnames are properly set.
1745 Note that this assumes that all the files had been compiled with
1746 the same options, which is not a good assumption. In general,
1747 options ought to be read from all the files in the set and merged.
1748 However, it is still unclear what the merge rules should be. */
1751 lto_read_all_file_options (void)
1755 /* Clear any file options currently saved. */
1756 lto_clear_file_options ();
1758 /* Set the hooks to read ELF sections. */
1759 lto_set_in_hooks (NULL, get_section_data, free_section_data);
1761 for (i = 0; i < num_in_fnames; i++)
1763 struct lto_file_decl_data *file_data;
1764 lto_file *file = lto_elf_file_open (in_fnames[i], false);
1768 file_data = XCNEW (struct lto_file_decl_data);
1769 file_data->file_name = file->filename;
1770 file_data->section_hash_table = lto_elf_build_section_table (file);
1772 lto_read_file_options (file_data);
1774 lto_elf_file_close (file);
1775 htab_delete (file_data->section_hash_table);
1779 /* Apply globally the options read from all the files. */
1780 lto_reissue_options ();
1784 /* Read all the symbols from the input files FNAMES. NFILES is the
1785 number of files requested in the command line. Instantiate a
1786 global call graph by aggregating all the sub-graphs found in each
1790 read_cgraph_and_symbols (unsigned nfiles, const char **fnames)
1792 unsigned int i, last_file_ix;
1793 struct lto_file_decl_data **all_file_decl_data;
1795 struct cgraph_node *node;
1797 lto_stats.num_input_files = nfiles;
1799 timevar_push (TV_IPA_LTO_DECL_IO);
1801 /* Set the hooks so that all of the ipa passes can read in their data. */
1802 all_file_decl_data = XNEWVEC (struct lto_file_decl_data *, nfiles + 1);
1803 lto_set_in_hooks (all_file_decl_data, get_section_data, free_section_data);
1805 /* Read the resolution file. */
1807 if (resolution_file_name)
1810 unsigned num_objects;
1812 resolution = fopen (resolution_file_name, "r");
1813 if (resolution == NULL)
1814 fatal_error ("could not open symbol resolution file: %s",
1817 t = fscanf (resolution, "%u", &num_objects);
1818 gcc_assert (t == 1);
1820 /* True, since the plugin splits the archives. */
1821 gcc_assert (num_objects == nfiles);
1824 /* Read all of the object files specified on the command line. */
1825 for (i = 0, last_file_ix = 0; i < nfiles; ++i)
1827 struct lto_file_decl_data *file_data = NULL;
1829 current_lto_file = lto_elf_file_open (fnames[i], false);
1830 if (!current_lto_file)
1833 file_data = lto_file_read (current_lto_file, resolution);
1837 all_file_decl_data[last_file_ix++] = file_data;
1839 lto_elf_file_close (current_lto_file);
1840 current_lto_file = NULL;
1843 if (resolution_file_name)
1844 fclose (resolution);
1846 all_file_decl_data[last_file_ix] = NULL;
1848 /* Set the hooks so that all of the ipa passes can read in their data. */
1849 lto_set_in_hooks (all_file_decl_data, get_section_data, free_section_data);
1851 /* Each pass will set the appropriate timer. */
1852 timevar_pop (TV_IPA_LTO_DECL_IO);
1854 /* Read the callgraph. */
1857 /* Merge global decls. */
1858 lto_symtab_merge_decls ();
1860 /* Fixup all decls and types and free the type hash tables. */
1861 lto_fixup_decls (all_file_decl_data);
1862 free_gimple_type_tables ();
1864 /* Read the IPA summary data. */
1865 ipa_read_summaries ();
1867 /* Finally merge the cgraph according to the decl merging decisions. */
1868 lto_symtab_merge_cgraph_nodes ();
1871 for (node = cgraph_nodes; node; node = node->next)
1873 /* FIXME: ipa_transforms_to_apply holds list of passes that have optimization
1874 summaries computed and needs to apply changes. At the moment WHOPR only
1875 supports inlining, so we can push it here by hand. In future we need to stream
1876 this field into ltrans compilation. */
1878 VEC_safe_push (ipa_opt_pass, heap,
1879 node->ipa_transforms_to_apply,
1880 (ipa_opt_pass)&pass_ipa_inline);
1883 timevar_push (TV_IPA_LTO_DECL_IO);
1885 /* FIXME lto. This loop needs to be changed to use the pass manager to
1886 call the ipa passes directly. */
1888 for (i = 0; i < last_file_ix; i++)
1890 struct lto_file_decl_data *file_data = all_file_decl_data [i];
1891 lto_materialize_constructors_and_inits (file_data);
1894 /* Indicate that the cgraph is built and ready. */
1895 cgraph_function_flags_ready = true;
1897 timevar_pop (TV_IPA_LTO_DECL_IO);
1901 /* Materialize all the bodies for all the nodes in the callgraph. */
1904 materialize_cgraph (void)
1907 struct cgraph_node *node;
1909 timevar_id_t lto_timer;
1911 /* Now that we have input the cgraph, we need to clear all of the aux
1912 nodes and read the functions if we are not running in WPA mode. */
1913 timevar_push (TV_IPA_LTO_GIMPLE_IO);
1915 for (node = cgraph_nodes; node; node = node->next)
1917 /* Some cgraph nodes get created on the fly, and they don't need
1918 to be materialized. For instance, nodes for nested functions
1919 where the parent function was not streamed out or builtin
1920 functions. Additionally, builtin functions should not be
1921 materialized and may, in fact, cause confusion because there
1922 may be a regular function in the file whose assembler name
1923 matches that of the function.
1924 See gcc.c-torture/execute/20030125-1.c and
1925 gcc.c-torture/execute/921215-1.c. */
1926 if (node->local.lto_file_data
1927 && !DECL_IS_BUILTIN (node->decl))
1929 lto_materialize_function (node);
1930 lto_stats.num_input_cgraph_nodes++;
1934 timevar_pop (TV_IPA_LTO_GIMPLE_IO);
1936 /* Start the appropriate timer depending on the mode that we are
1938 lto_timer = (flag_wpa) ? TV_WHOPR_WPA
1939 : (flag_ltrans) ? TV_WHOPR_LTRANS
1941 timevar_push (lto_timer);
1943 current_function_decl = NULL;
1946 /* Inform the middle end about the global variables we have seen. */
1947 for (i = 0; VEC_iterate (tree, lto_global_var_decls, i, decl); i++)
1948 rest_of_decl_compilation (decl, 1, 0);
1950 /* Fix up any calls to DECLs that have become not exception throwing. */
1951 lto_fixup_nothrow_decls ();
1953 timevar_pop (lto_timer);
1957 /* Perform whole program analysis (WPA) on the callgraph and write out the
1958 optimization plan. */
1961 do_whole_program_analysis (void)
1963 char **output_files;
1966 /* Note that since we are in WPA mode, materialize_cgraph will not
1967 actually read in all the function bodies. It only materializes
1968 the decls and cgraph nodes so that analysis can be performed. */
1969 materialize_cgraph ();
1971 /* Reading in the cgraph uses different timers, start timing WPA now. */
1972 timevar_push (TV_WHOPR_WPA);
1974 cgraph_function_flags_ready = true;
1975 bitmap_obstack_initialize (NULL);
1976 ipa_register_cgraph_hooks ();
1977 cgraph_state = CGRAPH_STATE_IPA_SSA;
1979 execute_ipa_pass_list (all_regular_ipa_passes);
1982 bitmap_obstack_release (NULL);
1984 /* We are about to launch the final LTRANS phase, stop the WPA timer. */
1985 timevar_pop (TV_WHOPR_WPA);
1989 output_files = lto_wpa_write_files ();
1991 /* Show the LTO report before launching LTRANS. */
1992 if (flag_lto_report)
1993 print_lto_report ();
1995 lto_execute_ltrans (output_files);
1997 for (i = 0; output_files[i]; ++i)
1999 if (output_files[i][0] != '*')
2000 lto_maybe_unlink (output_files[i]);
2002 free (output_files[i]);
2005 XDELETEVEC (output_files);
2009 /* Main entry point for the GIMPLE front end. This front end has
2010 three main personalities:
2012 - LTO (-flto). All the object files on the command line are
2013 loaded in memory and processed as a single translation unit.
2014 This is the traditional link-time optimization behavior.
2016 - WPA (-fwpa). Only the callgraph and summary information for
2017 files in the command file are loaded. A single callgraph
2018 (without function bodies) is instantiated for the whole set of
2019 files. IPA passes are only allowed to analyze the call graph
2020 and make transformation decisions. The callgraph is
2021 partitioned, each partition is written to a new object file
2022 together with the transformation decisions.
2024 - LTRANS (-fltrans). Similar to -flto but it prevents the IPA
2025 summary files from running again. Since WPA computed summary
2026 information and decided what transformations to apply, LTRANS
2027 simply applies them. */
2030 lto_main (int debug_p ATTRIBUTE_UNUSED)
2034 /* Read all the symbols and call graph from all the files in the
2036 read_cgraph_and_symbols (num_in_fnames, in_fnames);
2040 /* If WPA is enabled analyze the whole call graph and create an
2041 optimization plan. Otherwise, read in all the function
2042 bodies and continue with optimization. */
2044 do_whole_program_analysis ();
2047 materialize_cgraph ();
2049 /* Let the middle end know that we have read and merged all of
2053 /* FIXME lto, if the processes spawned by WPA fail, we miss
2054 the chance to print WPA's report, so WPA will call
2055 print_lto_report before launching LTRANS. If LTRANS was
2056 launched directly by the driver we would not need to do
2058 if (flag_lto_report)
2059 print_lto_report ();
2064 #include "gt-lto-lto.h"