Merge from mainline (gomp-merge-2005-02-26).
[official-gcc.git] / gcc / cgraph.h
blobae902b2ff6cd260abe5f9a52a87501e7217e38e6
1 /* Callgraph handling code.
2 Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
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 2, or (at your option) any later
10 version.
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
15 for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
22 #ifndef GCC_CGRAPH_H
23 #define GCC_CGRAPH_H
24 #include "tree.h"
26 /* Information about the function collected locally.
27 Available after function is analyzed. */
29 struct cgraph_local_info GTY(())
31 /* Size of the function before inlining. */
32 int self_insns;
34 /* Set when function function is visible in current compilation unit only
35 and its address is never taken. */
36 bool local;
38 /* Set once it has been finalized so we consider it to be output. */
39 bool finalized;
41 /* False when there something makes inlining impossible (such as va_arg). */
42 bool inlinable;
44 /* True when function should be inlined independently on its size. */
45 bool disregard_inline_limits;
47 /* True when the function has been originally extern inline, but it is
48 redefined now. */
49 bool redefined_extern_inline;
51 /* True if statics_read_for_function and
52 statics_written_for_function contain valid data. */
53 bool for_functions_valid;
56 /* Information about the function that needs to be computed globally
57 once compilation is finished. Available only with -funit-at-time. */
59 struct cgraph_global_info GTY(())
61 /* For inline clones this points to the function they will be inlined into. */
62 struct cgraph_node *inlined_to;
64 /* Estimated size of the function after inlining. */
65 int insns;
67 /* Set iff the function has been inlined at least once. */
68 bool inlined;
71 /* Information about the function that is propagated by the RTL backend.
72 Available only for functions that has been already assembled. */
74 struct cgraph_rtl_info GTY(())
76 int preferred_incoming_stack_boundary;
77 bool const_function;
78 bool pure_function;
81 /* The cgraph data structure.
82 Each function decl has assigned cgraph_node listing callees and callers. */
84 struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous")))
86 tree decl;
87 struct cgraph_edge *callees;
88 struct cgraph_edge *callers;
89 struct cgraph_node *next;
90 struct cgraph_node *previous;
91 /* For nested functions points to function the node is nested in. */
92 struct cgraph_node *origin;
93 /* Points to first nested function, if any. */
94 struct cgraph_node *nested;
95 /* Pointer to the next function with same origin, if any. */
96 struct cgraph_node *next_nested;
97 /* Pointer to the next function in cgraph_nodes_queue. */
98 struct cgraph_node *next_needed;
99 /* Pointer to the next clone. */
100 struct cgraph_node *next_clone;
101 PTR GTY ((skip)) aux;
103 struct cgraph_local_info local;
104 struct cgraph_global_info global;
105 struct cgraph_rtl_info rtl;
107 /* Unique id of the node. */
108 int uid;
109 /* Set when function must be output - it is externally visible
110 or its address is taken. */
111 bool needed;
112 /* Set when function is reachable by call from other function
113 that is either reachable or needed. */
114 bool reachable;
115 /* Set once the function has been instantiated and its callee
116 lists created. */
117 bool analyzed;
118 /* Set when function is scheduled to be assembled. */
119 bool output;
122 struct cgraph_edge GTY((chain_next ("%h.next_caller")))
124 struct cgraph_node *caller;
125 struct cgraph_node *callee;
126 struct cgraph_edge *next_caller;
127 struct cgraph_edge *next_callee;
128 tree call_expr;
129 PTR GTY ((skip (""))) aux;
130 /* When NULL, inline this call. When non-NULL, points to the explanation
131 why function was not inlined. */
132 const char *inline_failed;
135 /* The cgraph_varpool data structure.
136 Each static variable decl has assigned cgraph_varpool_node. */
138 struct cgraph_varpool_node GTY(())
140 tree decl;
141 /* Pointer to the next function in cgraph_varpool_nodes. */
142 struct cgraph_varpool_node *next;
143 /* Pointer to the next function in cgraph_varpool_nodes_queue. */
144 struct cgraph_varpool_node *next_needed;
146 /* Set when function must be output - it is externally visible
147 or its address is taken. */
148 bool needed;
149 /* Set once it has been finalized so we consider it to be output. */
150 bool finalized;
151 /* Set when function is scheduled to be assembled. */
152 bool output;
155 extern GTY(()) struct cgraph_node *cgraph_nodes;
156 extern GTY(()) int cgraph_n_nodes;
157 extern GTY(()) int cgraph_max_uid;
158 extern bool cgraph_global_info_ready;
159 extern GTY(()) struct cgraph_node *cgraph_nodes_queue;
161 extern GTY(()) struct cgraph_varpool_node *cgraph_varpool_nodes_queue;
163 /* In cgraph.c */
164 void dump_cgraph (FILE *);
165 void dump_cgraph_node (FILE *, struct cgraph_node *);
166 void cgraph_remove_edge (struct cgraph_edge *);
167 void cgraph_remove_node (struct cgraph_node *);
168 struct cgraph_edge *cgraph_create_edge (struct cgraph_node *,
169 struct cgraph_node *,
170 tree);
171 struct cgraph_node *cgraph_node (tree decl);
172 struct cgraph_node *cgraph_node_for_asm (tree asmname);
173 struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree call_expr);
174 struct cgraph_local_info *cgraph_local_info (tree);
175 struct cgraph_global_info *cgraph_global_info (tree);
176 struct cgraph_rtl_info *cgraph_rtl_info (tree);
177 const char * cgraph_node_name (struct cgraph_node *);
178 struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *, struct cgraph_node *, tree);
179 struct cgraph_node * cgraph_clone_node (struct cgraph_node *);
181 struct cgraph_varpool_node *cgraph_varpool_node (tree decl);
182 struct cgraph_varpool_node *cgraph_varpool_node_for_asm (tree asmname);
183 void cgraph_varpool_mark_needed_node (struct cgraph_varpool_node *);
184 void cgraph_varpool_finalize_decl (tree);
185 bool cgraph_varpool_assemble_pending_decls (void);
186 void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *);
188 bool cgraph_function_possibly_inlined_p (tree);
189 void cgraph_unnest_node (struct cgraph_node *node);
191 /* In cgraphunit.c */
192 bool cgraph_assemble_pending_functions (void);
193 void cgraph_finalize_function (tree, bool);
194 void cgraph_finalize_compilation_unit (void);
195 void cgraph_create_edges (struct cgraph_node *, tree);
196 void cgraph_optimize (void);
197 void cgraph_mark_needed_node (struct cgraph_node *);
198 void cgraph_mark_reachable_node (struct cgraph_node *);
199 bool cgraph_inline_p (struct cgraph_edge *, const char **reason);
200 bool cgraph_preserve_function_body_p (tree);
201 void verify_cgraph (void);
202 void verify_cgraph_node (struct cgraph_node *);
203 void cgraph_mark_inline_edge (struct cgraph_edge *e);
204 void cgraph_clone_inlined_nodes (struct cgraph_edge *e, bool duplicate);
205 void cgraph_build_static_cdtor (char which, tree body, int priority);
206 void cgraph_reset_static_var_maps (void);
207 void init_cgraph (void);
209 #endif /* GCC_CGRAPH_H */