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 /* strtoll is not portable. */
254 lto_parse_hex (const char *p
) {
256 for (; *p
!= '\0'; ++p
)
261 if (c
>= '0' && c
<= '9')
263 else if (c
>= 'a' && c
<= 'f')
265 else if (c
>= 'A' && c
<= 'F')
268 internal_error ("could not parse hex number");
274 /* Read resolution for file named FILE_NAME. The resolution is read from
275 RESOLUTION. An array with the symbol resolution is returned. The array
276 size is written to SIZE. */
278 static VEC(ld_plugin_symbol_resolution_t
,heap
) *
279 lto_resolution_read (FILE *resolution
, lto_file
*file
)
281 /* We require that objects in the resolution file are in the same
282 order as the lto1 command line. */
283 unsigned int name_len
;
285 unsigned int num_symbols
;
287 VEC(ld_plugin_symbol_resolution_t
,heap
) *ret
= NULL
;
288 unsigned max_index
= 0;
293 name_len
= strlen (file
->filename
);
294 obj_name
= XNEWVEC (char, name_len
+ 1);
295 fscanf (resolution
, " "); /* Read white space. */
297 fread (obj_name
, sizeof (char), name_len
, resolution
);
298 obj_name
[name_len
] = '\0';
299 if (strcmp (obj_name
, file
->filename
) != 0)
300 internal_error ("unexpected file name %s in linker resolution file. "
301 "Expected %s", obj_name
, file
->filename
);
302 if (file
->offset
!= 0)
307 t
= fscanf (resolution
, "@0x%16s", offset_p
);
309 internal_error ("could not parse file offset");
310 offset
= lto_parse_hex (offset_p
);
311 if (offset
!= file
->offset
)
312 internal_error ("unexpected offset");
317 fscanf (resolution
, "%u", &num_symbols
);
319 for (i
= 0; i
< num_symbols
; i
++)
324 enum ld_plugin_symbol_resolution r
;
326 unsigned int lto_resolution_str_len
=
327 sizeof (lto_resolution_str
) / sizeof (char *);
329 t
= fscanf (resolution
, "%u %26s %*[^\n]\n", &index
, r_str
);
331 internal_error ("Invalid line in the resolution file.");
332 if (index
> max_index
)
335 for (j
= 0; j
< lto_resolution_str_len
; j
++)
337 if (strcmp (lto_resolution_str
[j
], r_str
) == 0)
339 r
= (enum ld_plugin_symbol_resolution
) j
;
343 if (j
== lto_resolution_str_len
)
344 internal_error ("Invalid resolution in the resolution file.");
346 VEC_safe_grow_cleared (ld_plugin_symbol_resolution_t
, heap
, ret
,
348 VEC_replace (ld_plugin_symbol_resolution_t
, ret
, index
, r
);
354 /* Generate a TREE representation for all types and external decls
357 Read all of the globals out of the file. Then read the cgraph
358 and process the .o index into the cgraph nodes so that it can open
359 the .o file to load the functions and ipa information. */
361 static struct lto_file_decl_data
*
362 lto_file_read (lto_file
*file
, FILE *resolution_file
)
364 struct lto_file_decl_data
*file_data
;
367 VEC(ld_plugin_symbol_resolution_t
,heap
) *resolutions
;
369 resolutions
= lto_resolution_read (resolution_file
, file
);
371 file_data
= XCNEW (struct lto_file_decl_data
);
372 file_data
->file_name
= file
->filename
;
373 file_data
->section_hash_table
= lto_elf_build_section_table (file
);
374 file_data
->renaming_hash_table
= lto_create_renaming_table ();
376 data
= lto_get_section_data (file_data
, LTO_section_decls
, NULL
, &len
);
377 lto_read_decls (file_data
, data
, resolutions
);
378 lto_free_section_data (file_data
, LTO_section_decls
, NULL
, data
, len
);
383 #if HAVE_MMAP_FILE && HAVE_SYSCONF && defined _SC_PAGE_SIZE
384 #define LTO_MMAP_IO 1
388 /* Page size of machine is used for mmap and munmap calls. */
389 static size_t page_mask
;
392 /* Get the section data of length LEN from FILENAME starting at
393 OFFSET. The data segment must be freed by the caller when the
394 caller is finished. Returns NULL if all was not well. */
397 lto_read_section_data (struct lto_file_decl_data
*file_data
,
398 intptr_t offset
, size_t len
)
402 static char *fd_name
;
404 intptr_t computed_len
;
405 intptr_t computed_offset
;
409 /* Keep a single-entry file-descriptor cache. The last file we
410 touched will get closed at exit.
411 ??? Eventually we want to add a more sophisticated larger cache
412 or rather fix function body streaming to not stream them in
413 practically random order. */
415 && strcmp (fd_name
, file_data
->file_name
) != 0)
423 fd_name
= xstrdup (file_data
->file_name
);
424 fd
= open (file_data
->file_name
, O_RDONLY
);
432 size_t page_size
= sysconf (_SC_PAGE_SIZE
);
433 page_mask
= ~(page_size
- 1);
436 computed_offset
= offset
& page_mask
;
437 diff
= offset
- computed_offset
;
438 computed_len
= len
+ diff
;
440 result
= (char *) mmap (NULL
, computed_len
, PROT_READ
, MAP_PRIVATE
,
441 fd
, computed_offset
);
442 if (result
== MAP_FAILED
)
445 return result
+ diff
;
447 result
= (char *) xmalloc (len
);
448 if (lseek (fd
, offset
, SEEK_SET
) != offset
449 || read (fd
, result
, len
) != (ssize_t
) len
)
460 /* Get the section data from FILE_DATA of SECTION_TYPE with NAME.
461 NAME will be NULL unless the section type is for a function
465 get_section_data (struct lto_file_decl_data
*file_data
,
466 enum lto_section_type section_type
,
470 htab_t section_hash_table
= file_data
->section_hash_table
;
471 struct lto_section_slot
*f_slot
;
472 struct lto_section_slot s_slot
;
473 const char *section_name
= lto_get_section_name (section_type
, name
);
477 s_slot
.name
= section_name
;
478 f_slot
= (struct lto_section_slot
*) htab_find (section_hash_table
, &s_slot
);
481 data
= lto_read_section_data (file_data
, f_slot
->start
, f_slot
->len
);
485 free (CONST_CAST (char *, section_name
));
490 /* Free the section data from FILE_DATA of SECTION_TYPE with NAME that
491 starts at OFFSET and has LEN bytes. */
494 free_section_data (struct lto_file_decl_data
*file_data ATTRIBUTE_UNUSED
,
495 enum lto_section_type section_type ATTRIBUTE_UNUSED
,
496 const char *name ATTRIBUTE_UNUSED
,
497 const char *offset
, size_t len ATTRIBUTE_UNUSED
)
500 intptr_t computed_len
;
501 intptr_t computed_offset
;
506 computed_offset
= ((intptr_t) offset
) & page_mask
;
507 diff
= (intptr_t) offset
- computed_offset
;
508 computed_len
= len
+ diff
;
510 munmap ((caddr_t
) computed_offset
, computed_len
);
512 free (CONST_CAST(char *, offset
));
516 /* Vector of all cgraph node sets. */
517 static GTY (()) VEC(cgraph_node_set
, gc
) *lto_cgraph_node_sets
;
520 /* Group cgrah nodes by input files. This is used mainly for testing
524 lto_1_to_1_map (void)
526 struct cgraph_node
*node
;
527 struct lto_file_decl_data
*file_data
;
528 struct pointer_map_t
*pmap
;
532 timevar_push (TV_WHOPR_WPA
);
534 lto_cgraph_node_sets
= VEC_alloc (cgraph_node_set
, gc
, 1);
536 /* If the cgraph is empty, create one cgraph node set so that there is still
537 an output file for any variables that need to be exported in a DSO. */
540 set
= cgraph_node_set_new ();
541 VEC_safe_push (cgraph_node_set
, gc
, lto_cgraph_node_sets
, set
);
545 pmap
= pointer_map_create ();
547 for (node
= cgraph_nodes
; node
; node
= node
->next
)
549 /* We only need to partition the nodes that we read from the
550 gimple bytecode files. */
551 file_data
= node
->local
.lto_file_data
;
552 if (file_data
== NULL
)
555 slot
= pointer_map_contains (pmap
, file_data
);
557 set
= (cgraph_node_set
) *slot
;
560 set
= cgraph_node_set_new ();
561 slot
= pointer_map_insert (pmap
, file_data
);
563 VEC_safe_push (cgraph_node_set
, gc
, lto_cgraph_node_sets
, set
);
566 cgraph_node_set_add (set
, node
);
569 pointer_map_destroy (pmap
);
572 timevar_pop (TV_WHOPR_WPA
);
574 lto_stats
.num_cgraph_partitions
+= VEC_length (cgraph_node_set
,
575 lto_cgraph_node_sets
);
579 /* Add inlined clone NODE and its master clone to SET, if NODE itself has
580 inlined callees, recursively add the callees. */
583 lto_add_inline_clones (cgraph_node_set set
, struct cgraph_node
*node
,
584 bitmap original_decls
, bitmap inlined_decls
)
586 struct cgraph_node
*callee
;
587 struct cgraph_edge
*edge
;
589 cgraph_node_set_add (set
, node
);
591 if (!bitmap_bit_p (original_decls
, DECL_UID (node
->decl
)))
592 bitmap_set_bit (inlined_decls
, DECL_UID (node
->decl
));
594 /* Check to see if NODE has any inlined callee. */
595 for (edge
= node
->callees
; edge
!= NULL
; edge
= edge
->next_callee
)
597 callee
= edge
->callee
;
598 if (callee
->global
.inlined_to
!= NULL
)
599 lto_add_inline_clones (set
, callee
, original_decls
, inlined_decls
);
603 /* Compute the transitive closure of inlining of SET based on the
604 information in the callgraph. Returns a bitmap of decls that have
605 been inlined into SET indexed by UID. */
608 lto_add_all_inlinees (cgraph_node_set set
)
610 cgraph_node_set_iterator csi
;
611 struct cgraph_node
*node
;
612 bitmap original_nodes
= lto_bitmap_alloc ();
613 bitmap original_decls
= lto_bitmap_alloc ();
614 bitmap inlined_decls
= lto_bitmap_alloc ();
617 /* We are going to iterate SET while adding to it, mark all original
618 nodes so that we only add node inlined to original nodes. */
619 for (csi
= csi_start (set
); !csi_end_p (csi
); csi_next (&csi
))
621 bitmap_set_bit (original_nodes
, csi_node (csi
)->uid
);
622 bitmap_set_bit (original_decls
, DECL_UID (csi_node (csi
)->decl
));
625 /* Some of the original nodes might not be needed anymore.
630 for (csi
= csi_start (set
); !csi_end_p (csi
); csi_next (&csi
))
632 struct cgraph_node
*inlined_to
;
633 node
= csi_node (csi
);
635 /* NODE was not inlined. We still need it. */
636 if (!node
->global
.inlined_to
)
639 inlined_to
= node
->global
.inlined_to
;
641 /* NODE should have only one caller. */
642 gcc_assert (!node
->callers
->next_caller
);
644 if (!bitmap_bit_p (original_nodes
, inlined_to
->uid
))
646 bitmap_clear_bit (original_nodes
, node
->uid
);
647 cgraph_node_set_remove (set
, node
);
654 /* Transitively add to SET all the inline clones for every node that
656 for (csi
= csi_start (set
); !csi_end_p (csi
); csi_next (&csi
))
658 node
= csi_node (csi
);
659 if (bitmap_bit_p (original_nodes
, node
->uid
))
660 lto_add_inline_clones (set
, node
, original_decls
, inlined_decls
);
663 lto_bitmap_free (original_nodes
);
664 lto_bitmap_free (original_decls
);
666 return inlined_decls
;
669 /* Owing to inlining, we may need to promote a file-scope variable
670 to a global variable. Consider this case:
683 extern void foo (void);
691 If WPA inlines FOO inside BAR, then the static variable VAR needs to
692 be promoted to global because BAR and VAR may be in different LTRANS
695 /* This struct keeps track of states used in globalization. */
699 /* Current cgraph node set. */
702 /* Function DECLs of cgraph nodes seen. */
703 bitmap seen_node_decls
;
705 /* Use in walk_tree to avoid multiple visits of a node. */
706 struct pointer_set_t
*visited
;
708 /* static vars in this set. */
709 bitmap static_vars_in_set
;
711 /* static vars in all previous set. */
712 bitmap all_static_vars
;
714 /* all vars in all previous set. */
716 } globalize_context_t
;
718 /* Callback for walk_tree. Examine the tree pointer to by TP and see if
719 if its a file-scope static variable of function that need to be turned
723 globalize_cross_file_statics (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
726 globalize_context_t
*context
= (globalize_context_t
*) data
;
732 /* The logic for globalization of VAR_DECLs and FUNCTION_DECLs are
733 different. For functions, we can simply look at the cgraph node sets
734 to tell if there are references to static functions outside the set.
735 The cgraph node sets do not keep track of vars, we need to traverse
736 the trees to determine what vars need to be globalized. */
737 if (TREE_CODE (t
) == VAR_DECL
)
739 if (!TREE_PUBLIC (t
))
741 /* This file-scope static variable is reachable from more
742 that one set. Make it global but with hidden visibility
743 so that we do not export it in dynamic linking. */
744 if (bitmap_bit_p (context
->all_static_vars
, DECL_UID (t
)))
747 DECL_VISIBILITY (t
) = VISIBILITY_HIDDEN
;
749 bitmap_set_bit (context
->static_vars_in_set
, DECL_UID (t
));
751 bitmap_set_bit (context
->all_vars
, DECL_UID (t
));
752 walk_tree (&DECL_INITIAL (t
), globalize_cross_file_statics
, context
,
755 else if (TREE_CODE (t
) == FUNCTION_DECL
&& !TREE_PUBLIC (t
))
757 if (!cgraph_node_in_set_p (cgraph_node (t
), context
->set
))
759 /* This file-scope static function is reachable from a set
760 which does not contain the function DECL. Make it global
761 but with hidden visibility. */
763 DECL_VISIBILITY (t
) = VISIBILITY_HIDDEN
;
770 /* Helper of lto_scan_statics_in_cgraph_node below. Scan TABLE for
771 static decls that may be used in more than one LTRANS file.
772 CONTEXT is a globalize_context_t for storing scanning states. */
775 lto_scan_statics_in_ref_table (struct lto_tree_ref_table
*table
,
776 globalize_context_t
*context
)
780 for (i
= 0; i
< table
->size
; i
++)
781 walk_tree (&table
->trees
[i
], globalize_cross_file_statics
, context
,
785 /* Promote file-scope decl reachable from NODE if necessary to global.
786 CONTEXT is a globalize_context_t storing scanning states. */
789 lto_scan_statics_in_cgraph_node (struct cgraph_node
*node
,
790 globalize_context_t
*context
)
792 struct lto_in_decl_state
*state
;
794 /* Do nothing if NODE has no function body. */
798 /* Return if the DECL of nodes has been visited before. */
799 if (bitmap_bit_p (context
->seen_node_decls
, DECL_UID (node
->decl
)))
802 bitmap_set_bit (context
->seen_node_decls
, DECL_UID (node
->decl
));
804 state
= lto_get_function_in_decl_state (node
->local
.lto_file_data
,
808 lto_scan_statics_in_ref_table (&state
->streams
[LTO_DECL_STREAM_VAR_DECL
],
810 lto_scan_statics_in_ref_table (&state
->streams
[LTO_DECL_STREAM_FN_DECL
],
814 /* Scan all global variables that we have not yet seen so far. CONTEXT
815 is a globalize_context_t storing scanning states. */
818 lto_scan_statics_in_remaining_global_vars (globalize_context_t
*context
)
820 tree var
, var_context
;
821 struct varpool_node
*vnode
;
823 FOR_EACH_STATIC_VARIABLE (vnode
)
826 var_context
= DECL_CONTEXT (var
);
827 if (TREE_STATIC (var
)
829 && (!var_context
|| TREE_CODE (var_context
) != FUNCTION_DECL
)
830 && !bitmap_bit_p (context
->all_vars
, DECL_UID (var
)))
831 walk_tree (&var
, globalize_cross_file_statics
, context
,
836 /* Find out all static decls that need to be promoted to global because
837 of cross file sharing. This function must be run in the WPA mode after
838 all inlinees are added. */
841 lto_promote_cross_file_statics (void)
845 cgraph_node_set_iterator csi
;
846 globalize_context_t context
;
848 memset (&context
, 0, sizeof (context
));
849 context
.all_vars
= lto_bitmap_alloc ();
850 context
.all_static_vars
= lto_bitmap_alloc ();
852 n_sets
= VEC_length (cgraph_node_set
, lto_cgraph_node_sets
);
853 for (i
= 0; i
< n_sets
; i
++)
855 set
= VEC_index (cgraph_node_set
, lto_cgraph_node_sets
, i
);
857 context
.visited
= pointer_set_create ();
858 context
.static_vars_in_set
= lto_bitmap_alloc ();
859 context
.seen_node_decls
= lto_bitmap_alloc ();
861 for (csi
= csi_start (set
); !csi_end_p (csi
); csi_next (&csi
))
862 lto_scan_statics_in_cgraph_node (csi_node (csi
), &context
);
865 lto_scan_statics_in_remaining_global_vars (&context
);
867 bitmap_ior_into (context
.all_static_vars
, context
.static_vars_in_set
);
869 pointer_set_destroy (context
.visited
);
870 lto_bitmap_free (context
.static_vars_in_set
);
871 lto_bitmap_free (context
.seen_node_decls
);
874 lto_bitmap_free (context
.all_vars
);
875 lto_bitmap_free (context
.all_static_vars
);
879 /* Given a file name FNAME, return a string with FNAME prefixed with '*'. */
882 prefix_name_with_star (const char *fname
)
887 len
= strlen (fname
) + 1 + 1;
888 star_fname
= XNEWVEC (char, len
);
889 snprintf (star_fname
, len
, "*%s", fname
);
895 /* Return a copy of FNAME without the .o extension. */
898 strip_extension (const char *fname
)
900 char *s
= XNEWVEC (char, strlen (fname
) - 2 + 1);
901 gcc_assert (strstr (fname
, ".o"));
902 snprintf (s
, strlen (fname
) - 2 + 1, "%s", fname
);
908 /* Return a file name associated with cgraph node set SET. This may
909 be a new temporary file name if SET needs to be processed by
910 LTRANS, or the original file name if all the nodes in SET belong to
911 the same input file. */
914 get_filename_for_set (cgraph_node_set set
)
917 static const size_t max_fname_len
= 100;
919 if (cgraph_node_set_needs_ltrans_p (set
))
921 /* Create a new temporary file to store SET. To facilitate
922 debugging, use file names from SET as part of the new
923 temporary file name. */
924 cgraph_node_set_iterator si
;
925 struct pointer_set_t
*pset
= pointer_set_create ();
926 for (si
= csi_start (set
); !csi_end_p (si
); csi_next (&si
))
928 struct cgraph_node
*n
= csi_node (si
);
929 const char *node_fname
;
932 /* Don't use the same file name more than once. */
933 if (pointer_set_insert (pset
, n
->local
.lto_file_data
))
936 /* The first file name found in SET determines the output
937 directory. For the remaining files, we use their
939 node_fname
= n
->local
.lto_file_data
->file_name
;
942 fname
= strip_extension (node_fname
);
946 f
= strip_extension (lbasename (node_fname
));
948 /* If the new name causes an excessively long file name,
949 make the last component "___" to indicate overflow. */
950 if (strlen (fname
) + strlen (f
) > max_fname_len
- 3)
952 fname
= reconcat (fname
, fname
, "___", NULL
);
957 fname
= reconcat (fname
, fname
, "_", f
, NULL
);
962 pointer_set_destroy (pset
);
964 /* Add the extension .wpa.o to indicate that this file has been
966 fname
= reconcat (fname
, fname
, ".wpa.o", NULL
);
971 /* Since SET does not need to be processed by LTRANS, use
972 the original file name and mark it with a '*' prefix so that
973 lto_execute_ltrans knows not to process it. */
974 cgraph_node_set_iterator si
= csi_start (set
);
975 struct cgraph_node
*first
= csi_node (si
);
976 fname
= prefix_name_with_star (first
->local
.lto_file_data
->file_name
);
982 static lto_file
*current_lto_file
;
985 /* Write all output files in WPA mode. Returns a NULL-terminated array of
986 output file names. */
989 lto_wpa_write_files (void)
992 unsigned i
, n_sets
, last_out_file_ix
, num_out_files
;
996 VEC(bitmap
,heap
) *inlined_decls
= NULL
;
998 timevar_push (TV_WHOPR_WPA
);
1000 /* Include all inlined functions and determine what sets need to be
1001 compiled by LTRANS. After this loop, only those sets that
1002 contain callgraph nodes from more than one file will need to be
1003 compiled by LTRANS. */
1004 for (i
= 0; VEC_iterate (cgraph_node_set
, lto_cgraph_node_sets
, i
, set
); i
++)
1006 decls
= lto_add_all_inlinees (set
);
1007 VEC_safe_push (bitmap
, heap
, inlined_decls
, decls
);
1008 lto_stats
.num_output_cgraph_nodes
+= VEC_length (cgraph_node_ptr
,
1012 /* After adding all inlinees, find out statics that need to be promoted
1013 to globals because of cross-file inlining. */
1014 lto_promote_cross_file_statics ();
1016 timevar_pop (TV_WHOPR_WPA
);
1018 timevar_push (TV_WHOPR_WPA_IO
);
1020 /* The number of output files depends on the number of input files
1021 and how many callgraph node sets we create. Reserve enough space
1022 for the maximum of these two. */
1023 num_out_files
= MAX (VEC_length (cgraph_node_set
, lto_cgraph_node_sets
),
1025 output_files
= XNEWVEC (char *, num_out_files
+ 1);
1027 n_sets
= VEC_length (cgraph_node_set
, lto_cgraph_node_sets
);
1028 for (i
= 0; i
< n_sets
; i
++)
1030 char *temp_filename
;
1032 set
= VEC_index (cgraph_node_set
, lto_cgraph_node_sets
, i
);
1033 temp_filename
= get_filename_for_set (set
);
1034 output_files
[i
] = temp_filename
;
1036 if (cgraph_node_set_needs_ltrans_p (set
))
1038 /* Write all the nodes in SET to TEMP_FILENAME. */
1039 file
= lto_elf_file_open (temp_filename
, true);
1041 fatal_error ("lto_elf_file_open() failed");
1043 lto_set_current_out_file (file
);
1044 lto_new_extern_inline_states ();
1046 decls
= VEC_index (bitmap
, inlined_decls
, i
);
1047 lto_force_functions_extern_inline (decls
);
1049 ipa_write_summaries_of_cgraph_node_set (set
);
1050 lto_delete_extern_inline_states ();
1052 lto_set_current_out_file (NULL
);
1053 lto_elf_file_close (file
);
1057 last_out_file_ix
= n_sets
;
1059 lto_stats
.num_output_files
+= n_sets
;
1061 output_files
[last_out_file_ix
] = NULL
;
1063 for (i
= 0; VEC_iterate (bitmap
, inlined_decls
, i
, decls
); i
++)
1064 lto_bitmap_free (decls
);
1065 VEC_free (bitmap
, heap
, inlined_decls
);
1067 timevar_pop (TV_WHOPR_WPA_IO
);
1069 return output_files
;
1073 /* Perform local transformations (LTRANS) on the files in the NULL-terminated
1074 FILES array. These should have been written previously by
1075 lto_wpa_write_files (). Transformations are performed via executing
1076 COLLECT_GCC for reach file. */
1079 lto_execute_ltrans (char *const *files
)
1081 struct pex_obj
*pex
;
1082 const char *collect_gcc_options
, *collect_gcc
;
1083 struct obstack env_obstack
;
1085 const char **argv_ptr
;
1090 FILE *ltrans_output_list_stream
= NULL
;
1092 timevar_push (TV_WHOPR_WPA_LTRANS_EXEC
);
1094 /* Get the driver and options. */
1095 collect_gcc
= getenv ("COLLECT_GCC");
1097 fatal_error ("environment variable COLLECT_GCC must be set");
1099 /* Set the CFLAGS environment variable. */
1100 collect_gcc_options
= getenv ("COLLECT_GCC_OPTIONS");
1101 if (!collect_gcc_options
)
1102 fatal_error ("environment variable COLLECT_GCC_OPTIONS must be set");
1104 /* Count arguments. */
1106 for (j
= 0; collect_gcc_options
[j
] != '\0'; ++j
)
1107 if (collect_gcc_options
[j
] == '\'')
1111 fatal_error ("malformed COLLECT_GCC_OPTIONS");
1113 /* Initalize the arguments for the LTRANS driver. */
1114 argv
= XNEWVEC (const char *, 8 + i
/ 2);
1116 *argv_ptr
++ = collect_gcc
;
1117 *argv_ptr
++ = "-xlto";
1118 for (j
= 0; collect_gcc_options
[j
] != '\0'; ++j
)
1119 if (collect_gcc_options
[j
] == '\'')
1125 while (collect_gcc_options
[j
] != '\'')
1127 obstack_init (&env_obstack
);
1128 obstack_grow (&env_obstack
, &collect_gcc_options
[i
], j
- i
);
1129 obstack_1grow (&env_obstack
, 0);
1130 option
= XOBFINISH (&env_obstack
, char *);
1132 /* LTRANS does not need -fwpa nor -fltrans-*. */
1133 if (strncmp (option
, "-fwpa", 5) != 0
1134 && strncmp (option
, "-fltrans-", 9) != 0)
1135 *argv_ptr
++ = option
;
1137 *argv_ptr
++ = "-fltrans";
1139 /* Open the LTRANS output list. */
1140 if (ltrans_output_list
)
1142 ltrans_output_list_stream
= fopen (ltrans_output_list
, "w");
1143 if (ltrans_output_list_stream
== NULL
)
1144 error ("opening LTRANS output list %s: %m", ltrans_output_list
);
1147 for (i
= 0; files
[i
]; ++i
)
1151 /* If the file is prefixed with a '*', it means that we do not
1152 need to re-compile it with LTRANS because it has not been
1153 modified by WPA. Skip it from the command line to
1154 lto_execute_ltrans, but add it to ltrans_output_list_stream
1155 so it is linked after we are done. */
1156 if (files
[i
][0] == '*')
1158 size_t len
= strlen (files
[i
]) - 1;
1159 if (ltrans_output_list_stream
)
1160 if (fwrite (&files
[i
][1], 1, len
, ltrans_output_list_stream
) < len
1161 || fwrite ("\n", 1, 1, ltrans_output_list_stream
) < 1)
1162 error ("writing to LTRANS output list %s: %m",
1163 ltrans_output_list
);
1169 /* Otherwise, add FILES[I] to lto_execute_ltrans command line
1170 and add the resulting file to LTRANS output list. */
1172 /* Replace the .o suffix with a .ltrans.o suffix and write
1173 the resulting name to the LTRANS output list. */
1174 obstack_init (&env_obstack
);
1175 obstack_grow (&env_obstack
, files
[i
], strlen (files
[i
]) - 2);
1176 obstack_grow (&env_obstack
, ".ltrans.o", sizeof (".ltrans.o"));
1177 output_name
= XOBFINISH (&env_obstack
, char *);
1178 if (ltrans_output_list_stream
)
1180 len
= strlen (output_name
);
1182 if (fwrite (output_name
, 1, len
, ltrans_output_list_stream
) < len
1183 || fwrite ("\n", 1, 1, ltrans_output_list_stream
) < 1)
1184 error ("writing to LTRANS output list %s: %m",
1185 ltrans_output_list
);
1189 argv_ptr
[1] = output_name
;
1190 argv_ptr
[2] = files
[i
];
1193 /* Execute the driver. */
1194 pex
= pex_init (0, "lto1", NULL
);
1196 fatal_error ("pex_init failed: %s", xstrerror (errno
));
1198 errmsg
= pex_run (pex
, PEX_LAST
| PEX_SEARCH
, argv
[0],
1199 CONST_CAST (char **, argv
), NULL
, NULL
, &err
);
1201 fatal_error ("%s: %s", errmsg
, xstrerror (err
));
1203 if (!pex_get_status (pex
, 1, &status
))
1204 fatal_error ("can't get program status: %s", xstrerror (errno
));
1208 if (WIFSIGNALED (status
))
1210 int sig
= WTERMSIG (status
);
1211 fatal_error ("%s terminated with signal %d [%s]%s",
1212 argv
[0], sig
, strsignal (sig
),
1213 WCOREDUMP (status
) ? ", core dumped" : "");
1216 fatal_error ("%s terminated with status %d", argv
[0], status
);
1223 /* Close the LTRANS output list. */
1224 if (ltrans_output_list_stream
&& fclose (ltrans_output_list_stream
))
1225 error ("closing LTRANS output list %s: %m", ltrans_output_list
);
1227 obstack_free (&env_obstack
, NULL
);
1230 timevar_pop (TV_WHOPR_WPA_LTRANS_EXEC
);
1235 struct pointer_set_t
*seen
;
1238 #define LTO_FIXUP_SUBTREE(t) \
1240 walk_tree (&(t), lto_fixup_tree, data, NULL); \
1243 #define LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE(t) \
1247 (t) = gimple_register_type (t); \
1248 walk_tree (&(t), lto_fixup_tree, data, NULL); \
1252 static tree
lto_fixup_tree (tree
*, int *, void *);
1254 /* Return true if T does not need to be fixed up recursively. */
1260 || CONSTANT_CLASS_P (t
)
1261 || TREE_CODE (t
) == IDENTIFIER_NODE
);
1264 /* Fix up fields of a tree_common T. DATA points to fix-up states. */
1267 lto_fixup_common (tree t
, void *data
)
1269 /* The following re-creates the TYPE_REFERENCE_TO and TYPE_POINTER_TO
1270 lists. We do not stream TYPE_REFERENCE_TO, TYPE_POINTER_TO or
1271 TYPE_NEXT_PTR_TO and TYPE_NEXT_REF_TO.
1272 First remove us from any pointer list we are on. */
1273 if (TREE_CODE (t
) == POINTER_TYPE
)
1275 if (TYPE_POINTER_TO (TREE_TYPE (t
)) == t
)
1276 TYPE_POINTER_TO (TREE_TYPE (t
)) = TYPE_NEXT_PTR_TO (t
);
1279 tree tem
= TYPE_POINTER_TO (TREE_TYPE (t
));
1280 while (tem
&& TYPE_NEXT_PTR_TO (tem
) != t
)
1281 tem
= TYPE_NEXT_PTR_TO (tem
);
1283 TYPE_NEXT_PTR_TO (tem
) = TYPE_NEXT_PTR_TO (t
);
1285 TYPE_NEXT_PTR_TO (t
) = NULL_TREE
;
1287 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
1289 if (TYPE_REFERENCE_TO (TREE_TYPE (t
)) == t
)
1290 TYPE_REFERENCE_TO (TREE_TYPE (t
)) = TYPE_NEXT_REF_TO (t
);
1293 tree tem
= TYPE_REFERENCE_TO (TREE_TYPE (t
));
1294 while (tem
&& TYPE_NEXT_REF_TO (tem
) != t
)
1295 tem
= TYPE_NEXT_REF_TO (tem
);
1297 TYPE_NEXT_REF_TO (tem
) = TYPE_NEXT_REF_TO (t
);
1299 TYPE_NEXT_REF_TO (t
) = NULL_TREE
;
1302 /* Fixup our type. */
1303 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t
));
1305 /* Second put us on the list of pointers of the new pointed-to type
1306 if we are a main variant. This is done in lto_fixup_type after
1307 fixing up our main variant. */
1309 /* This is not very efficient because we cannot do tail-recursion with
1310 a long chain of trees. */
1311 LTO_FIXUP_SUBTREE (TREE_CHAIN (t
));
1314 /* Fix up fields of a decl_minimal T. DATA points to fix-up states. */
1317 lto_fixup_decl_minimal (tree t
, void *data
)
1319 lto_fixup_common (t
, data
);
1320 LTO_FIXUP_SUBTREE (DECL_NAME (t
));
1321 LTO_FIXUP_SUBTREE (DECL_CONTEXT (t
));
1324 /* Fix up fields of a decl_common T. DATA points to fix-up states. */
1327 lto_fixup_decl_common (tree t
, void *data
)
1329 lto_fixup_decl_minimal (t
, data
);
1330 LTO_FIXUP_SUBTREE (DECL_SIZE (t
));
1331 LTO_FIXUP_SUBTREE (DECL_SIZE_UNIT (t
));
1332 LTO_FIXUP_SUBTREE (DECL_INITIAL (t
));
1333 LTO_FIXUP_SUBTREE (DECL_ATTRIBUTES (t
));
1334 LTO_FIXUP_SUBTREE (DECL_ABSTRACT_ORIGIN (t
));
1337 /* Fix up fields of a decl_with_vis T. DATA points to fix-up states. */
1340 lto_fixup_decl_with_vis (tree t
, void *data
)
1342 lto_fixup_decl_common (t
, data
);
1344 /* Accessor macro has side-effects, use field-name here. */
1345 LTO_FIXUP_SUBTREE (t
->decl_with_vis
.assembler_name
);
1347 gcc_assert (no_fixup_p (DECL_SECTION_NAME (t
)));
1350 /* Fix up fields of a decl_non_common T. DATA points to fix-up states. */
1353 lto_fixup_decl_non_common (tree t
, void *data
)
1355 lto_fixup_decl_with_vis (t
, data
);
1356 LTO_FIXUP_SUBTREE (DECL_ARGUMENT_FLD (t
));
1357 LTO_FIXUP_SUBTREE (DECL_RESULT_FLD (t
));
1358 LTO_FIXUP_SUBTREE (DECL_VINDEX (t
));
1360 /* SAVED_TREE should not cleared by now. Also no accessor for base type. */
1361 gcc_assert (no_fixup_p (t
->decl_non_common
.saved_tree
));
1364 /* Fix up fields of a decl_non_common T. DATA points to fix-up states. */
1367 lto_fixup_function (tree t
, void *data
)
1369 lto_fixup_decl_non_common (t
, data
);
1370 LTO_FIXUP_SUBTREE (DECL_FUNCTION_PERSONALITY (t
));
1373 /* Fix up fields of a field_decl T. DATA points to fix-up states. */
1376 lto_fixup_field_decl (tree t
, void *data
)
1378 lto_fixup_decl_common (t
, data
);
1379 LTO_FIXUP_SUBTREE (DECL_FIELD_OFFSET (t
));
1380 LTO_FIXUP_SUBTREE (DECL_BIT_FIELD_TYPE (t
));
1381 LTO_FIXUP_SUBTREE (DECL_QUALIFIER (t
));
1382 gcc_assert (no_fixup_p (DECL_FIELD_BIT_OFFSET (t
)));
1383 LTO_FIXUP_SUBTREE (DECL_FCONTEXT (t
));
1386 /* Fix up fields of a type T. DATA points to fix-up states. */
1389 lto_fixup_type (tree t
, void *data
)
1393 lto_fixup_common (t
, data
);
1394 LTO_FIXUP_SUBTREE (TYPE_CACHED_VALUES (t
));
1395 LTO_FIXUP_SUBTREE (TYPE_SIZE (t
));
1396 LTO_FIXUP_SUBTREE (TYPE_SIZE_UNIT (t
));
1397 LTO_FIXUP_SUBTREE (TYPE_ATTRIBUTES (t
));
1398 LTO_FIXUP_SUBTREE (TYPE_NAME (t
));
1400 /* Accessors are for derived node types only. */
1401 if (!POINTER_TYPE_P (t
))
1402 LTO_FIXUP_SUBTREE (t
->type
.minval
);
1403 LTO_FIXUP_SUBTREE (t
->type
.maxval
);
1405 /* Accessor is for derived node types only. */
1406 LTO_FIXUP_SUBTREE (t
->type
.binfo
);
1408 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TYPE_CONTEXT (t
));
1409 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TYPE_CANONICAL (t
));
1411 /* The following re-creates proper variant lists while fixing up
1412 the variant leaders. We do not stream TYPE_NEXT_VARIANT so the
1413 variant list state before fixup is broken. */
1415 /* Remove us from our main variant list if we are not the variant leader. */
1416 if (TYPE_MAIN_VARIANT (t
) != t
)
1418 tem
= TYPE_MAIN_VARIANT (t
);
1419 while (tem
&& TYPE_NEXT_VARIANT (tem
) != t
)
1420 tem
= TYPE_NEXT_VARIANT (tem
);
1422 TYPE_NEXT_VARIANT (tem
) = TYPE_NEXT_VARIANT (t
);
1423 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
1426 /* Query our new main variant. */
1427 mv
= gimple_register_type (TYPE_MAIN_VARIANT (t
));
1429 /* If we were the variant leader and we get replaced ourselves drop
1430 all variants from our list. */
1431 if (TYPE_MAIN_VARIANT (t
) == t
1437 tree tem2
= TYPE_NEXT_VARIANT (tem
);
1438 TYPE_NEXT_VARIANT (tem
) = NULL_TREE
;
1443 /* If we are not our own variant leader link us into our new leaders
1447 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
1448 TYPE_NEXT_VARIANT (mv
) = t
;
1451 /* Finally adjust our main variant and fix it up. */
1452 TYPE_MAIN_VARIANT (t
) = mv
;
1453 LTO_FIXUP_SUBTREE (TYPE_MAIN_VARIANT (t
));
1455 /* As the second step of reconstructing the pointer chains put us
1456 on the list of pointers of the new pointed-to type
1457 if we are a main variant. See lto_fixup_common for the first step. */
1458 if (TREE_CODE (t
) == POINTER_TYPE
1459 && TYPE_MAIN_VARIANT (t
) == t
)
1461 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (TREE_TYPE (t
));
1462 TYPE_POINTER_TO (TREE_TYPE (t
)) = t
;
1464 else if (TREE_CODE (t
) == REFERENCE_TYPE
1465 && TYPE_MAIN_VARIANT (t
) == t
)
1467 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (TREE_TYPE (t
));
1468 TYPE_REFERENCE_TO (TREE_TYPE (t
)) = t
;
1472 /* Fix up fields of a BINFO T. DATA points to fix-up states. */
1475 lto_fixup_binfo (tree t
, void *data
)
1477 unsigned HOST_WIDE_INT i
, n
;
1478 tree base
, saved_base
;
1480 lto_fixup_common (t
, data
);
1481 gcc_assert (no_fixup_p (BINFO_OFFSET (t
)));
1482 LTO_FIXUP_SUBTREE (BINFO_VTABLE (t
));
1483 LTO_FIXUP_SUBTREE (BINFO_VIRTUALS (t
));
1484 LTO_FIXUP_SUBTREE (BINFO_VPTR_FIELD (t
));
1485 n
= VEC_length (tree
, BINFO_BASE_ACCESSES (t
));
1486 for (i
= 0; i
< n
; i
++)
1488 saved_base
= base
= BINFO_BASE_ACCESS (t
, i
);
1489 LTO_FIXUP_SUBTREE (base
);
1490 if (base
!= saved_base
)
1491 VEC_replace (tree
, BINFO_BASE_ACCESSES (t
), i
, base
);
1493 LTO_FIXUP_SUBTREE (BINFO_INHERITANCE_CHAIN (t
));
1494 LTO_FIXUP_SUBTREE (BINFO_SUBVTT_INDEX (t
));
1495 LTO_FIXUP_SUBTREE (BINFO_VPTR_INDEX (t
));
1496 n
= BINFO_N_BASE_BINFOS (t
);
1497 for (i
= 0; i
< n
; i
++)
1499 saved_base
= base
= BINFO_BASE_BINFO (t
, i
);
1500 LTO_FIXUP_SUBTREE (base
);
1501 if (base
!= saved_base
)
1502 VEC_replace (tree
, BINFO_BASE_BINFOS (t
), i
, base
);
1506 /* Fix up fields of a CONSTRUCTOR T. DATA points to fix-up states. */
1509 lto_fixup_constructor (tree t
, void *data
)
1511 unsigned HOST_WIDE_INT idx
;
1512 constructor_elt
*ce
;
1514 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t
));
1517 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (t
), idx
, ce
);
1520 LTO_FIXUP_SUBTREE (ce
->index
);
1521 LTO_FIXUP_SUBTREE (ce
->value
);
1525 /* A walk_tree callback used by lto_fixup_state. TP is the pointer to the
1526 current tree. WALK_SUBTREES indicates if the subtrees will be walked.
1527 DATA is a pointer set to record visited nodes. */
1530 lto_fixup_tree (tree
*tp
, int *walk_subtrees
, void *data
)
1533 lto_fixup_data_t
*fixup_data
= (lto_fixup_data_t
*) data
;
1538 if (pointer_set_contains (fixup_data
->seen
, t
))
1541 if (TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == FUNCTION_DECL
)
1543 prevailing
= lto_symtab_prevailing_decl (t
);
1545 if (t
!= prevailing
)
1547 if (TREE_CODE (t
) == FUNCTION_DECL
1548 && TREE_NOTHROW (prevailing
) != TREE_NOTHROW (t
))
1550 /* If the prevailing definition does not throw but the
1551 declaration (T) was considered throwing, then we
1552 simply add PREVAILING to the list of throwing
1553 functions. However, if the opposite is true, then
1554 the call to PREVAILING was generated assuming that
1555 the function didn't throw, which means that CFG
1556 cleanup may have removed surrounding try/catch
1559 Note that we currently accept these cases even when
1560 they occur within a single file. It's certainly a
1561 user error, but we silently allow the compiler to
1562 remove surrounding try/catch regions. Perhaps we
1563 could emit a warning here, instead of silently
1564 accepting the conflicting declaration. */
1565 if (TREE_NOTHROW (prevailing
))
1566 lto_mark_nothrow_fndecl (prevailing
);
1569 /* Also replace t with prevailing defintion. We don't want to
1570 insert the other defintion in the seen set as we want to
1571 replace all instances of it. */
1576 else if (TYPE_P (t
))
1578 /* Replace t with the prevailing type. We don't want to insert the
1579 other type in the seen set as we want to replace all instances of it. */
1580 t
= gimple_register_type (t
);
1584 if (pointer_set_insert (fixup_data
->seen
, t
))
1587 /* walk_tree does not visit all reachable nodes that need to be fixed up.
1588 Hence we do special processing here for those kind of nodes. */
1589 switch (TREE_CODE (t
))
1592 lto_fixup_field_decl (t
, data
);
1600 lto_fixup_decl_common (t
, data
);
1604 lto_fixup_decl_with_vis (t
, data
);
1608 lto_fixup_decl_non_common (t
, data
);
1612 lto_fixup_function (t
, data
);
1616 lto_fixup_binfo (t
, data
);
1621 lto_fixup_type (t
, data
);
1622 else if (TREE_CODE (t
) == CONSTRUCTOR
)
1623 lto_fixup_constructor (t
, data
);
1624 else if (CONSTANT_CLASS_P (t
))
1625 LTO_REGISTER_TYPE_AND_FIXUP_SUBTREE (TREE_TYPE (t
));
1626 else if (EXPR_P (t
))
1628 /* walk_tree only handles TREE_OPERANDs. Do the rest here. */
1629 lto_fixup_common (t
, data
);
1630 LTO_FIXUP_SUBTREE (t
->exp
.block
);
1635 /* Let walk_tree handle sub-trees. */
1643 /* Helper function of lto_fixup_decls. Walks the var and fn streams in STATE,
1644 replaces var and function decls with the corresponding prevailing def and
1645 records the old decl in the free-list in DATA. We also record visted nodes
1646 in the seen-set in DATA to avoid multiple visit for nodes that need not
1650 lto_fixup_state (struct lto_in_decl_state
*state
, lto_fixup_data_t
*data
)
1653 struct lto_tree_ref_table
*table
;
1655 /* Although we only want to replace FUNCTION_DECLs and VAR_DECLs,
1656 we still need to walk from all DECLs to find the reachable
1657 FUNCTION_DECLs and VAR_DECLs. */
1658 for (si
= 0; si
< LTO_N_DECL_STREAMS
; si
++)
1660 table
= &state
->streams
[si
];
1661 for (i
= 0; i
< table
->size
; i
++)
1662 walk_tree (table
->trees
+ i
, lto_fixup_tree
, data
, NULL
);
1666 /* A callback of htab_traverse. Just extract a state from SLOT and the
1667 lto_fixup_data_t object from AUX and calls lto_fixup_state. */
1670 lto_fixup_state_aux (void **slot
, void *aux
)
1672 struct lto_in_decl_state
*state
= (struct lto_in_decl_state
*) *slot
;
1673 lto_fixup_state (state
, (lto_fixup_data_t
*) aux
);
1677 /* Fix the decls from all FILES. Replaces each decl with the corresponding
1681 lto_fixup_decls (struct lto_file_decl_data
**files
)
1685 struct pointer_set_t
*seen
= pointer_set_create ();
1686 lto_fixup_data_t data
;
1689 for (i
= 0; files
[i
]; i
++)
1691 struct lto_file_decl_data
*file
= files
[i
];
1692 struct lto_in_decl_state
*state
= file
->global_decl_state
;
1693 lto_fixup_state (state
, &data
);
1695 htab_traverse (file
->function_decl_states
, lto_fixup_state_aux
, &data
);
1698 for (i
= 0; VEC_iterate (tree
, lto_global_var_decls
, i
, decl
); i
++)
1700 tree saved_decl
= decl
;
1701 walk_tree (&decl
, lto_fixup_tree
, &data
, NULL
);
1702 if (decl
!= saved_decl
)
1703 VEC_replace (tree
, lto_global_var_decls
, i
, decl
);
1706 pointer_set_destroy (seen
);
1709 /* Unlink a temporary LTRANS file unless requested otherwise. */
1712 lto_maybe_unlink (const char *file
)
1714 if (!getenv ("WPA_SAVE_LTRANS"))
1716 if (unlink_if_ordinary (file
))
1717 error ("deleting LTRANS input file %s: %m", file
);
1720 fprintf (stderr
, "[Leaving LTRANS input file %s]\n", file
);
1723 /* Read the options saved from each file in the command line. Called
1724 from lang_hooks.post_options which is called by process_options
1725 right before all the options are used to initialize the compiler.
1726 This assumes that decode_options has already run, so the
1727 num_in_fnames and in_fnames are properly set.
1729 Note that this assumes that all the files had been compiled with
1730 the same options, which is not a good assumption. In general,
1731 options ought to be read from all the files in the set and merged.
1732 However, it is still unclear what the merge rules should be. */
1735 lto_read_all_file_options (void)
1739 /* Clear any file options currently saved. */
1740 lto_clear_file_options ();
1742 /* Set the hooks to read ELF sections. */
1743 lto_set_in_hooks (NULL
, get_section_data
, free_section_data
);
1745 for (i
= 0; i
< num_in_fnames
; i
++)
1747 struct lto_file_decl_data
*file_data
;
1748 lto_file
*file
= lto_elf_file_open (in_fnames
[i
], false);
1752 file_data
= XCNEW (struct lto_file_decl_data
);
1753 file_data
->file_name
= file
->filename
;
1754 file_data
->section_hash_table
= lto_elf_build_section_table (file
);
1756 lto_read_file_options (file_data
);
1758 lto_elf_file_close (file
);
1759 htab_delete (file_data
->section_hash_table
);
1763 /* Apply globally the options read from all the files. */
1764 lto_reissue_options ();
1768 /* Read all the symbols from the input files FNAMES. NFILES is the
1769 number of files requested in the command line. Instantiate a
1770 global call graph by aggregating all the sub-graphs found in each
1774 read_cgraph_and_symbols (unsigned nfiles
, const char **fnames
)
1776 unsigned int i
, last_file_ix
;
1777 struct lto_file_decl_data
**all_file_decl_data
;
1779 struct cgraph_node
*node
;
1781 lto_stats
.num_input_files
= nfiles
;
1783 timevar_push (TV_IPA_LTO_DECL_IO
);
1785 /* Set the hooks so that all of the ipa passes can read in their data. */
1786 all_file_decl_data
= XNEWVEC (struct lto_file_decl_data
*, nfiles
+ 1);
1787 lto_set_in_hooks (all_file_decl_data
, get_section_data
, free_section_data
);
1789 /* Read the resolution file. */
1791 if (resolution_file_name
)
1794 unsigned num_objects
;
1796 resolution
= fopen (resolution_file_name
, "r");
1797 if (resolution
== NULL
)
1798 fatal_error ("could not open symbol resolution file: %s",
1801 t
= fscanf (resolution
, "%u", &num_objects
);
1802 gcc_assert (t
== 1);
1804 /* True, since the plugin splits the archives. */
1805 gcc_assert (num_objects
== nfiles
);
1808 /* Read all of the object files specified on the command line. */
1809 for (i
= 0, last_file_ix
= 0; i
< nfiles
; ++i
)
1811 struct lto_file_decl_data
*file_data
= NULL
;
1813 current_lto_file
= lto_elf_file_open (fnames
[i
], false);
1814 if (!current_lto_file
)
1817 file_data
= lto_file_read (current_lto_file
, resolution
);
1821 all_file_decl_data
[last_file_ix
++] = file_data
;
1823 lto_elf_file_close (current_lto_file
);
1824 current_lto_file
= NULL
;
1827 if (resolution_file_name
)
1828 fclose (resolution
);
1830 all_file_decl_data
[last_file_ix
] = NULL
;
1832 /* Set the hooks so that all of the ipa passes can read in their data. */
1833 lto_set_in_hooks (all_file_decl_data
, get_section_data
, free_section_data
);
1835 /* Each pass will set the appropriate timer. */
1836 timevar_pop (TV_IPA_LTO_DECL_IO
);
1838 /* Read the callgraph. */
1841 /* Merge global decls. */
1842 lto_symtab_merge_decls ();
1844 /* Fixup all decls and types and free the type hash tables. */
1845 lto_fixup_decls (all_file_decl_data
);
1846 free_gimple_type_tables ();
1848 /* Read the IPA summary data. */
1849 ipa_read_summaries ();
1851 /* Finally merge the cgraph according to the decl merging decisions. */
1852 lto_symtab_merge_cgraph_nodes ();
1854 /* Mark cgraph nodes needed in the merged cgraph
1855 This normally happens in whole-program pass, but for
1856 ltrans the pass was already run at WPA phase.
1858 FIXME: This is not valid way to do so; nodes can be needed
1859 for non-obvious reasons. We should stream the flags from WPA
1862 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1864 if (!node
->global
.inlined_to
1865 && cgraph_decide_is_function_needed (node
, node
->decl
))
1866 cgraph_mark_needed_node (node
);
1867 /* FIXME: ipa_transforms_to_apply holds list of passes that have optimization
1868 summaries computed and needs to apply changes. At the moment WHOPR only
1869 supports inlining, so we can push it here by hand. In future we need to stream
1870 this field into ltrans compilation. */
1872 VEC_safe_push (ipa_opt_pass
, heap
,
1873 node
->ipa_transforms_to_apply
,
1874 (ipa_opt_pass
)&pass_ipa_inline
);
1877 timevar_push (TV_IPA_LTO_DECL_IO
);
1879 /* FIXME lto. This loop needs to be changed to use the pass manager to
1880 call the ipa passes directly. */
1882 for (i
= 0; i
< last_file_ix
; i
++)
1884 struct lto_file_decl_data
*file_data
= all_file_decl_data
[i
];
1885 lto_materialize_constructors_and_inits (file_data
);
1888 /* Indicate that the cgraph is built and ready. */
1889 cgraph_function_flags_ready
= true;
1891 timevar_pop (TV_IPA_LTO_DECL_IO
);
1895 /* Materialize all the bodies for all the nodes in the callgraph. */
1898 materialize_cgraph (void)
1901 struct cgraph_node
*node
;
1903 timevar_id_t lto_timer
;
1905 /* Now that we have input the cgraph, we need to clear all of the aux
1906 nodes and read the functions if we are not running in WPA mode. */
1907 timevar_push (TV_IPA_LTO_GIMPLE_IO
);
1909 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1911 /* Some cgraph nodes get created on the fly, and they don't need
1912 to be materialized. For instance, nodes for nested functions
1913 where the parent function was not streamed out or builtin
1914 functions. Additionally, builtin functions should not be
1915 materialized and may, in fact, cause confusion because there
1916 may be a regular function in the file whose assembler name
1917 matches that of the function.
1918 See gcc.c-torture/execute/20030125-1.c and
1919 gcc.c-torture/execute/921215-1.c. */
1920 if (node
->local
.lto_file_data
1921 && !DECL_IS_BUILTIN (node
->decl
))
1923 lto_materialize_function (node
);
1924 lto_stats
.num_input_cgraph_nodes
++;
1928 timevar_pop (TV_IPA_LTO_GIMPLE_IO
);
1930 /* Start the appropriate timer depending on the mode that we are
1932 lto_timer
= (flag_wpa
) ? TV_WHOPR_WPA
1933 : (flag_ltrans
) ? TV_WHOPR_LTRANS
1935 timevar_push (lto_timer
);
1937 current_function_decl
= NULL
;
1940 /* Inform the middle end about the global variables we have seen. */
1941 for (i
= 0; VEC_iterate (tree
, lto_global_var_decls
, i
, decl
); i
++)
1942 rest_of_decl_compilation (decl
, 1, 0);
1944 /* Fix up any calls to DECLs that have become not exception throwing. */
1945 lto_fixup_nothrow_decls ();
1947 timevar_pop (lto_timer
);
1951 /* Perform whole program analysis (WPA) on the callgraph and write out the
1952 optimization plan. */
1955 do_whole_program_analysis (void)
1957 char **output_files
;
1959 struct cgraph_node
*node
;
1963 /* Note that since we are in WPA mode, materialize_cgraph will not
1964 actually read in all the function bodies. It only materializes
1965 the decls and cgraph nodes so that analysis can be performed. */
1966 materialize_cgraph ();
1968 /* Reading in the cgraph uses different timers, start timing WPA now. */
1969 timevar_push (TV_WHOPR_WPA
);
1971 /* FIXME lto. Hack. We should use the IPA passes. There are a
1972 number of issues with this now. 1. There is no convenient way to
1973 do this. 2. Some passes may depend on properties that requires
1974 the function bodies to compute. */
1975 cgraph_function_flags_ready
= true;
1976 bitmap_obstack_initialize (NULL
);
1977 ipa_register_cgraph_hooks ();
1979 /* Reset inlining information before running IPA inliner. */
1980 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1981 reset_inline_failed (node
);
1983 /* FIXME lto. We should not call this function directly. */
1984 pass_ipa_inline
.pass
.execute ();
1987 bitmap_obstack_release (NULL
);
1989 /* We are about to launch the final LTRANS phase, stop the WPA timer. */
1990 timevar_pop (TV_WHOPR_WPA
);
1992 output_files
= lto_wpa_write_files ();
1994 /* Show the LTO report before launching LTRANS. */
1995 if (flag_lto_report
)
1996 print_lto_report ();
1998 lto_execute_ltrans (output_files
);
2000 for (i
= 0; output_files
[i
]; ++i
)
2002 if (output_files
[i
][0] != '*')
2003 lto_maybe_unlink (output_files
[i
]);
2005 free (output_files
[i
]);
2008 XDELETEVEC (output_files
);
2012 /* Main entry point for the GIMPLE front end. This front end has
2013 three main personalities:
2015 - LTO (-flto). All the object files on the command line are
2016 loaded in memory and processed as a single translation unit.
2017 This is the traditional link-time optimization behavior.
2019 - WPA (-fwpa). Only the callgraph and summary information for
2020 files in the command file are loaded. A single callgraph
2021 (without function bodies) is instantiated for the whole set of
2022 files. IPA passes are only allowed to analyze the call graph
2023 and make transformation decisions. The callgraph is
2024 partitioned, each partition is written to a new object file
2025 together with the transformation decisions.
2027 - LTRANS (-fltrans). Similar to -flto but it prevents the IPA
2028 summary files from running again. Since WPA computed summary
2029 information and decided what transformations to apply, LTRANS
2030 simply applies them. */
2033 lto_main (int debug_p ATTRIBUTE_UNUSED
)
2037 /* Read all the symbols and call graph from all the files in the
2039 read_cgraph_and_symbols (num_in_fnames
, in_fnames
);
2043 /* If WPA is enabled analyze the whole call graph and create an
2044 optimization plan. Otherwise, read in all the function
2045 bodies and continue with optimization. */
2047 do_whole_program_analysis ();
2050 materialize_cgraph ();
2052 /* Let the middle end know that we have read and merged all of
2056 /* FIXME lto, if the processes spawned by WPA fail, we miss
2057 the chance to print WPA's report, so WPA will call
2058 print_lto_report before launching LTRANS. If LTRANS was
2059 launched directly by the driver we would not need to do
2061 if (flag_lto_report
)
2062 print_lto_report ();
2067 #include "gt-lto-lto.h"