| /dflybsd-src/contrib/gcc-4.7/gcc/ |
| H A D | cgraph.h | 112 struct cgraph_node *inlined_to;
152 struct GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) cgraph_node { struct
156 struct cgraph_node *next; argument
157 struct cgraph_node *previous; argument
162 struct cgraph_node *origin; argument
164 struct cgraph_node *nested; argument
166 struct cgraph_node *next_nested; argument
168 struct cgraph_node *next_needed; argument
170 struct cgraph_node *next_sibling_clone; argument
171 struct cgraph_node *prev_sibling_clone; argument
[all …]
|
| H A D | cgraph.c | 117 static void cgraph_node_remove_callers (struct cgraph_node *node);
122 static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash;
124 static GTY((param_is (struct cgraph_node))) htab_t assembler_name_hash;
127 struct cgraph_node *cgraph_nodes;
130 struct cgraph_node *cgraph_nodes_queue;
135 struct cgraph_node *cgraph_new_nodes;
207 static GTY(()) struct cgraph_node *free_nodes;
292 cgraph_call_node_removal_hooks (struct cgraph_node *node) in cgraph_call_node_removal_hooks()
333 cgraph_call_function_insertion_hooks (struct cgraph_node *node) in cgraph_call_function_insertion_hooks()
416 cgraph_call_node_duplication_hooks (struct cgraph_node *node1, in cgraph_call_node_duplication_hooks()
[all …]
|
| H A D | ipa-inline.h | 160 void debug_inline_summary (struct cgraph_node *);
162 void dump_inline_summary (FILE * f, struct cgraph_node *node);
168 int estimate_time_after_inlining (struct cgraph_node *, struct cgraph_edge *);
169 int estimate_size_after_inlining (struct cgraph_node *, struct cgraph_edge *);
170 void estimate_ipcp_clone_size_and_time (struct cgraph_node *,
174 int do_estimate_growth (struct cgraph_node *);
180 void compute_inline_parameters (struct cgraph_node *, bool);
184 unsigned int inline_transform (struct cgraph_node *);
191 inline_summary (struct cgraph_node *node) in inline_summary()
209 estimate_growth (struct cgraph_node *node) in estimate_growth()
[all …]
|
| H A D | ipa-utils.c | 50 struct cgraph_node** order, in ipa_print_order()
64 struct cgraph_node **stack;
66 struct cgraph_node **result;
85 searchc (struct searchc_env* env, struct cgraph_node *v, in searchc()
105 struct cgraph_node *w = cgraph_function_or_thunk_node (edge->callee, &avail); in searchc()
134 struct cgraph_node *last = NULL; in searchc()
135 struct cgraph_node *x; in searchc()
165 ipa_reduced_postorder (struct cgraph_node **order, in ipa_reduced_postorder()
169 struct cgraph_node *node; in ipa_reduced_postorder()
172 env.stack = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); in ipa_reduced_postorder()
[all …]
|
| H A D | ipa-ref.h | 22 struct cgraph_node;
45 struct cgraph_node * GTY((tag ("IPA_REF_CGRAPH"))) cgraph_node;
79 struct ipa_ref * ipa_record_reference (struct cgraph_node *,
81 struct cgraph_node *,
90 void ipa_clone_references (struct cgraph_node *, struct varpool_node *, struct ipa_ref_list *);
91 void ipa_clone_refering (struct cgraph_node *, struct varpool_node *, struct ipa_ref_list *);
|
| H A D | ipa-inline-transform.c | 56 update_noncloned_frequencies (struct cgraph_node *node, in update_noncloned_frequencies()
86 can_remove_node_now_p_1 (struct cgraph_node *node) in can_remove_node_now_p_1()
109 can_remove_node_now_p (struct cgraph_node *node, struct cgraph_edge *e) in can_remove_node_now_p()
111 struct cgraph_node *next; in can_remove_node_now_p()
170 struct cgraph_node *n; in clone_inlined_nodes()
202 struct cgraph_node *to = NULL; in inline_call()
204 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL); in inline_call()
222 struct cgraph_node *alias = e->callee, *next_alias; in inline_call()
265 static struct cgraph_node *
266 save_inline_function_body (struct cgraph_node *node) in save_inline_function_body()
[all …]
|
| H A D | ipa-inline.c | 139 struct cgraph_node *to = e->caller; in caller_growth_limits()
140 struct cgraph_node *what = cgraph_function_or_thunk_node (e->callee, NULL); in caller_growth_limits()
241 struct cgraph_node *callee in can_inline_edge_p()
357 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, in can_early_inline_edge_p()
388 leaf_node_p (struct cgraph_node *n) in leaf_node_p()
404 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL); in want_early_inline_function_p()
463 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL); in want_inline_small_function_p()
558 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p()
664 check_caller_edge (struct cgraph_node *node, void *edge) in check_caller_edge()
675 want_inline_function_called_once_p (struct cgraph_node *node) in want_inline_function_called_once_p()
[all …]
|
| H A D | cgraphunit.c | 147 static void cgraph_expand_function (struct cgraph_node *);
160 cgraph_decide_is_function_needed (struct cgraph_node *node, tree decl) in cgraph_decide_is_function_needed()
220 struct cgraph_node *node; in cgraph_process_new_functions()
297 cgraph_reset_node (struct cgraph_node *node) in cgraph_reset_node()
317 cgraph_lower_function (struct cgraph_node *node) in cgraph_lower_function()
338 struct cgraph_node *node = cgraph_get_create_node (decl); in cgraph_finalize_function()
387 struct cgraph_node *node = cgraph_get_node (decl); in cgraph_mark_if_needed()
394 clone_of_p (struct cgraph_node *node, struct cgraph_node *node2) in clone_of_p()
462 struct cgraph_node *node; in verify_edge_corresponds_to_fndecl()
492 verify_cgraph_node (struct cgraph_node *node) in verify_cgraph_node()
[all …]
|
| H A D | ipa.c | 40 update_inlined_to_pointer (struct cgraph_node *node, struct cgraph_node *inlined_to) in update_inlined_to_pointer()
60 enqueue_cgraph_node (struct cgraph_node *node, struct cgraph_node **first) in enqueue_cgraph_node()
86 struct cgraph_node **first, in process_references()
96 struct cgraph_node *node = ipa_ref_node (ref); in process_references()
120 cgraph_non_local_node_p_1 (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) in cgraph_non_local_node_p_1()
135 cgraph_local_node_p (struct cgraph_node *node) in cgraph_local_node_p()
137 struct cgraph_node *n = cgraph_function_or_thunk_node (node, NULL); in cgraph_local_node_p()
151 has_addr_references_p (struct cgraph_node *node, in has_addr_references_p()
171 struct cgraph_node *first = (struct cgraph_node *) (void *) 1; in cgraph_remove_unreachable_nodes()
173 struct cgraph_node *node, *next; in cgraph_remove_unreachable_nodes()
[all …]
|
| H A D | cgraphbuild.c | 77 struct cgraph_node *node = cgraph_get_create_node (decl); in record_reference()
117 record_type_list (struct cgraph_node *node, tree list) in record_type_list()
145 record_eh_tables (struct cgraph_node *node, struct function *fun) in record_eh_tables()
151 struct cgraph_node *per_node; in record_eh_tables()
206 reset_inline_failed (struct cgraph_node *node) in reset_inline_failed()
247 struct cgraph_node *node = cgraph_get_create_node (addr); in mark_address()
249 ipa_record_reference ((struct cgraph_node *)data, NULL, in mark_address()
262 ipa_record_reference ((struct cgraph_node *)data, NULL, in mark_address()
280 struct cgraph_node *node = cgraph_get_create_node (t); in mark_load()
282 ipa_record_reference ((struct cgraph_node *)data, NULL, in mark_load()
[all …]
|
| /dflybsd-src/contrib/gcc-8.0/gcc/ |
| H A D | cgraph.h | 712 cgraph_node *inlined_to;
833 cgraph_node *prev_clone, *next_clone;
836 cgraph_node *origin;
845 cgraph_node *this_node;
894 struct GTY((tag ("SYMTAB_FUNCTION"))) cgraph_node : public symtab_node { struct
900 bool remove_symbol_and_inline_clones (cgraph_node *forbidden_node = NULL);
919 cgraph_node *function_symbol (enum availability *avail = NULL,
928 cgraph_node *function_or_virtual_thunk_symbol
948 cgraph_node *create_clone (tree decl, profile_count count,
952 cgraph_node *new_inlined_to,
[all …]
|
| H A D | cgraph.c | 72 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
149 if (is_a <cgraph_node *> (this) in address_can_be_compared_p()
165 cgraph_node::function_version (void) in function_version()
179 cgraph_node::insert_new_function_version (void) in insert_new_function_version()
213 cgraph_node::delete_function_version_by_decl (tree decl) in delete_function_version_by_decl()
215 cgraph_node *decl_node = cgraph_node::get (decl); in delete_function_version_by_decl()
228 cgraph_node::record_function_versions (tree decl1, tree decl2) in record_function_versions()
230 cgraph_node *decl1_node = cgraph_node::get_create (decl1); in record_function_versions()
231 cgraph_node *decl2_node = cgraph_node::get_create (decl2); in record_function_versions()
280 cgraph_node *
[all …]
|
| H A D | ipa-utils.h | 32 struct cgraph_node* next_cycle;
38 void ipa_print_order (FILE*, const char *, struct cgraph_node**, int);
39 int ipa_reduced_postorder (struct cgraph_node **, bool,
42 vec<cgraph_node *> ipa_get_nodes_in_cycle (struct cgraph_node *);
44 int ipa_reverse_postorder (struct cgraph_node **);
46 void ipa_merge_profiles (struct cgraph_node *dst,
47 struct cgraph_node *src, bool preserve_body = false);
51 bool ipa_propagate_frequency (struct cgraph_node *node);
60 vec <cgraph_node *>
68 bool possible_polymorphic_call_target_p (tree ref, gimple *stmt, struct cgraph_node *n);
[all …]
|
| H A D | ipa-comdats.c | 99 if (cgraph_node * cn = dyn_cast <cgraph_node *> (symbol2)) in propagate_comdat_group()
120 cgraph_node *cnode = dyn_cast <cgraph_node *> (symbol); in propagate_comdat_group()
128 if (cgraph_node * cn = dyn_cast <cgraph_node *> (symbol2)) in propagate_comdat_group()
172 if (is_a <cgraph_node *>(node)) in enqueue_references()
173 node = dyn_cast <cgraph_node *> (node)->function_symbol (); in enqueue_references()
181 if (cgraph_node *cnode = dyn_cast <cgraph_node *> (symbol)) in enqueue_references()
193 if (is_a <cgraph_node *>(node)) in enqueue_references()
194 node = dyn_cast <cgraph_node *> (node)->function_symbol (); in enqueue_references()
226 set_comdat_group_1 (cgraph_node *symbol, in set_comdat_group_1()
275 if (is_a <cgraph_node *>(target)) in ipa_comdats()
[all …]
|
| H A D | cgraphbuild.c | 74 cgraph_node *node = cgraph_node::get_create (decl); in record_reference()
105 record_type_list (cgraph_node *node, tree list) in record_type_list()
130 record_eh_tables (cgraph_node *node, function *fun) in record_eh_tables()
137 cgraph_node *per_node = cgraph_node::get_create (per_decl); in record_eh_tables()
205 cgraph_node *node = cgraph_node::get_create (addr); in mark_address()
230 cgraph_node *node = cgraph_node::get_create (t); in mark_load()
261 cgraph_node::record_stmt_references (gimple *stmt) in record_stmt_references()
301 cgraph_node *node = cgraph_node::get (current_function_decl); in execute()
322 node->create_edge (cgraph_node::get_create (decl), call_stmt, bb->count); in execute()
334 node->create_reference (cgraph_node::get_create (fn), in execute()
[all …]
|
| H A D | cgraphclones.c | 88 cgraph_edge::clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid, in clone()
105 cgraph_node *callee = cgraph_node::get (decl); in clone()
242 set_new_clone_decl_and_node_flags (cgraph_node *new_node) in set_new_clone_decl_and_node_flags()
262 static cgraph_node *
263 duplicate_thunk_for_node (cgraph_node *thunk, cgraph_node *node) in duplicate_thunk_for_node()
265 cgraph_node *new_thunk, *thunk_of; in duplicate_thunk_for_node()
322 new_thunk = cgraph_node::create (new_decl); in duplicate_thunk_for_node()
344 cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node *n) in redirect_callee_duplicating_thunks()
346 cgraph_node *orig_to = callee->ultimate_alias_target (); in redirect_callee_duplicating_thunks()
357 cgraph_node::expand_all_artificial_thunks () in expand_all_artificial_thunks()
[all …]
|
| H A D | ipa-fnsummary.h | 157 void reset (struct cgraph_node *node);
178 virtual void insert (cgraph_node *, ipa_fn_summary *); in class()
179 virtual void remove (cgraph_node *node, ipa_fn_summary *); in class()
180 virtual void duplicate (cgraph_node *src, cgraph_node *dst, in class()
229 void ipa_debug_fn_summary (struct cgraph_node *);
231 void ipa_dump_fn_summary (FILE *f, struct cgraph_node *node);
234 void inline_analyze_function (struct cgraph_node *node);
235 void estimate_ipcp_clone_size_and_time (struct cgraph_node *,
242 void ipa_update_overall_fn_summary (struct cgraph_node *node);
243 void compute_fn_summary (struct cgraph_node *, bool);
[all …]
|
| H A D | ipa-utils.c | 46 struct cgraph_node** order, in ipa_print_order()
60 struct cgraph_node **stack;
61 struct cgraph_node **result;
80 searchc (struct searchc_env* env, struct cgraph_node *v, in searchc()
100 struct cgraph_node *w = edge->callee->ultimate_alias_target (&avail); in searchc()
129 struct cgraph_node *last = NULL; in searchc()
130 struct cgraph_node *x; in searchc()
163 ipa_reduced_postorder (struct cgraph_node **order, in ipa_reduced_postorder()
167 struct cgraph_node *node; in ipa_reduced_postorder()
170 env.stack = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count); in ipa_reduced_postorder()
[all …]
|
| H A D | ipa-reference.c | 53 static void remove_node_data (struct cgraph_node *node,
55 static void duplicate_node_data (struct cgraph_node *src,
56 struct cgraph_node *dst,
130 get_reference_vars_info (struct cgraph_node *node) in get_reference_vars_info()
140 get_reference_optimization_summary (struct cgraph_node *node) in get_reference_optimization_summary()
150 set_reference_vars_info (struct cgraph_node *node, in set_reference_vars_info()
161 set_reference_optimization_summary (struct cgraph_node *node, in set_reference_optimization_summary()
175 ipa_reference_get_not_read_global (struct cgraph_node *fn) in ipa_reference_get_not_read_global()
181 struct cgraph_node *fn2 = fn->function_symbol (&avail); in ipa_reference_get_not_read_global()
204 ipa_reference_get_not_written_global (struct cgraph_node *fn) in ipa_reference_get_not_written_global()
[all …]
|
| H A D | ipa-inline-transform.c | 57 update_noncloned_counts (struct cgraph_node *node, in update_noncloned_counts()
81 can_remove_node_now_p_1 (struct cgraph_node *node, struct cgraph_edge *e) in can_remove_node_now_p_1()
87 cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); in can_remove_node_now_p_1()
116 can_remove_node_now_p (struct cgraph_node *node, struct cgraph_edge *e) in can_remove_node_now_p()
118 struct cgraph_node *next; in can_remove_node_now_p()
126 for (next = dyn_cast<cgraph_node *> (node->same_comdat_group); in can_remove_node_now_p()
127 next != node; next = dyn_cast<cgraph_node *> (next->same_comdat_group)) in can_remove_node_now_p()
141 master_clone_with_noninline_clones_p (struct cgraph_node *node) in master_clone_with_noninline_clones_p()
146 for (struct cgraph_node *n = node->clones; n; n = n->next_sibling_clone) in master_clone_with_noninline_clones_p()
166 struct cgraph_node *inlining_into; in clone_inlined_nodes()
[all …]
|
| H A D | cgraphunit.c | 213 vec<cgraph_node *> cgraph_new_nodes;
311 cgraph_node *node = cgraph_new_nodes[i]; in process_new_functions()
319 cgraph_node::finalize_function (fndecl, false); in process_new_functions()
382 cgraph_node::reset (void) in reset()
418 cgraph_node *cn = dyn_cast <cgraph_node *> (this); in referred_to_p()
436 cgraph_node::finalize_function (tree decl, bool no_collect) in finalize_function()
438 cgraph_node *node = cgraph_node::get_create (decl); in finalize_function()
513 cgraph_node::add_new_function (tree fndecl, bool lowered) in add_new_function()
516 cgraph_node *node; in add_new_function()
537 cgraph_node::finalize_function (fndecl, false); in add_new_function()
[all …]
|
| H A D | ipa-inline.c | 148 struct cgraph_node *to = e->caller; in caller_growth_limits()
149 struct cgraph_node *what = e->callee->ultimate_alias_target (); in caller_growth_limits()
320 cgraph_node *caller = e->caller->global.inlined_to
322 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller);
412 cgraph_node *caller = e->caller->global.inlined_to
414 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller);
558 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in can_early_inline_edge_p()
590 num_calls (struct cgraph_node *n) in num_calls()
608 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in want_early_inline_function_p()
678 cgraph_node *caller = (edge->caller->global.inlined_to in compute_uninlined_call_time()
[all …]
|
| H A D | ipa-inline-analysis.c | 64 struct cgraph_node *callee = e->callee; in initialize_inline_failed()
125 struct cgraph_node *to = (edge->caller->global.inlined_to in simple_edge_hints()
127 struct cgraph_node *callee = edge->callee->ultimate_alias_target (); in simple_edge_hints()
155 struct cgraph_node *callee; in do_estimate_edge_time()
214 struct cgraph_node *callee; in do_estimate_edge_size()
255 struct cgraph_node *callee; in do_estimate_edge_hints()
293 estimate_size_after_inlining (struct cgraph_node *node, in estimate_size_after_inlining()
309 struct cgraph_node *node;
319 do_estimate_growth_1 (struct cgraph_node *node, void *data) in do_estimate_growth_1()
349 estimate_growth (struct cgraph_node *node) in estimate_growth()
[all …]
|
| H A D | ipa-pure-const.c | 262 cgraph_node *node = cgraph_node::get (decl); in warn_function_noreturn()
279 cgraph_node *node = cgraph_node::get (decl); in warn_function_cold()
292 has_function_state (struct cgraph_node *node) in has_function_state()
303 get_function_state (struct cgraph_node *node) in get_function_state()
316 set_function_state (struct cgraph_node *node, funct_state s) in set_function_state()
917 cgraph_node *node = cgraph_node::get_create (fun->decl); in malloc_candidate_p()
1016 analyze_function (struct cgraph_node *fn, bool ipa) in analyze_function()
1149 add_new_function (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) in add_new_function()
1162 duplicate_node_data (struct cgraph_node *src, struct cgraph_node *dst, in duplicate_node_data()
1177 remove_node_data (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) in remove_node_data()
[all …]
|
| H A D | ipa.c | 46 has_addr_references_p (struct cgraph_node *node, in has_addr_references_p()
61 is_indirect_call_target_p (struct cgraph_node *node, void *) in is_indirect_call_target_p()
70 update_inlined_to_pointer (struct cgraph_node *node, struct cgraph_node *inlined_to) in update_inlined_to_pointer()
167 vec <cgraph_node *>targets in walk_polymorphic_call_targets()
175 struct cgraph_node *n = targets[i]; in walk_polymorphic_call_targets()
218 cgraph_node *target, *node = edge->caller; in walk_polymorphic_call_targets()
222 target = cgraph_node::get_create in walk_polymorphic_call_targets()
309 struct cgraph_node *node, *next; in remove_unreachable_nodes()
380 struct cgraph_node *origin_node in remove_unreachable_nodes()
381 = cgraph_node::get (DECL_ABSTRACT_ORIGIN (node->decl)); in remove_unreachable_nodes()
[all …]
|