Home
last modified time | relevance | path

Searched refs:cgraph_node (Results 1 – 25 of 321) sorted by relevance

12345678910>>...13

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dcgraph.h859 cgraph_node *prev_clone, *next_clone;
862 cgraph_node *origin;
871 cgraph_node *this_node;
920 struct GTY((tag ("SYMTAB_FUNCTION"))) cgraph_node : public symtab_node struct
925 explicit cgraph_node (int uid) in cgraph_node() argument
950 bool remove_symbol_and_inline_clones (cgraph_node *forbidden_node = NULL);
969 cgraph_node *function_symbol (enum availability *avail = NULL,
978 cgraph_node *function_or_virtual_thunk_symbol
998 cgraph_node *create_clone (tree decl, profile_count count,
1002 cgraph_node *new_inlined_to,
[all …]
H A Dcgraph.c73 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
150 if (is_a <cgraph_node *> (this) in address_can_be_compared_p()
166 cgraph_node::function_version (void) in function_version()
180 cgraph_node::insert_new_function_version (void) in insert_new_function_version()
217 cgraph_node::delete_function_version_by_decl (tree decl) in delete_function_version_by_decl()
219 cgraph_node *decl_node = cgraph_node::get (decl); in delete_function_version_by_decl()
232 cgraph_node::record_function_versions (tree decl1, tree decl2) in record_function_versions()
234 cgraph_node *decl1_node = cgraph_node::get_create (decl1); in record_function_versions()
235 cgraph_node *decl2_node = cgraph_node::get_create (decl2); in record_function_versions()
284 cgraph_node *
[all …]
H A Dipa-comdats.c99 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 Dcgraphclones.c93 cgraph_edge::clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid, in clone()
110 cgraph_node *callee = cgraph_node::get (decl); in clone()
157 set_new_clone_decl_and_node_flags (cgraph_node *new_node) in set_new_clone_decl_and_node_flags()
180 static cgraph_node *
181 duplicate_thunk_for_node (cgraph_node *thunk, cgraph_node *node) in duplicate_thunk_for_node()
183 cgraph_node *new_thunk, *thunk_of; in duplicate_thunk_for_node()
242 new_thunk = cgraph_node::create (new_decl); in duplicate_thunk_for_node()
266 cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node *n) in redirect_callee_duplicating_thunks()
268 cgraph_node *orig_to = callee->ultimate_alias_target (); in redirect_callee_duplicating_thunks()
279 cgraph_node::expand_all_artificial_thunks () in expand_all_artificial_thunks()
[all …]
H A Dipa-utils.h32 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);
61 vec <cgraph_node *>
69 bool possible_polymorphic_call_target_p (tree ref, gimple *stmt, struct cgraph_node *n);
[all …]
H A Dcgraphbuild.c74 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 Dipa-fnsummary.h208 void remove_callees (cgraph_node *node); in class()
210 virtual void insert (cgraph_node *, ipa_fn_summary *); in class()
211 virtual void remove (cgraph_node *node, ipa_fn_summary *) in class()
216 virtual void duplicate (cgraph_node *src, cgraph_node *dst, in class()
233 virtual void duplicate (cgraph_node *, cgraph_node *, in duplicate() argument
297 ipa_call_context (cgraph_node *node,
321 cgraph_node *m_node;
344 void ipa_debug_fn_summary (struct cgraph_node *);
346 void ipa_dump_fn_summary (FILE *f, struct cgraph_node *node);
350 void inline_analyze_function (struct cgraph_node *node);
[all …]
H A Dipa-utils.c46 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()
128 struct cgraph_node *last = NULL; in searchc()
129 struct cgraph_node *x; in searchc()
162 ipa_reduced_postorder (struct cgraph_node **order, in ipa_reduced_postorder()
166 struct cgraph_node *node; in ipa_reduced_postorder()
169 env.stack = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count); in ipa_reduced_postorder()
[all …]
H A Dipa-inline.c147 struct cgraph_node *to = e->caller; in caller_growth_limits()
148 struct cgraph_node *what = e->callee->ultimate_alias_target (); in caller_growth_limits()
324 cgraph_node *caller = (e->caller->inlined_to
326 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller);
397 inline_insns_single (cgraph_node *n, bool hint) in inline_insns_single()
409 inline_insns_auto (cgraph_node *n, bool hint) in inline_insns_auto()
442 cgraph_node *caller = (e->caller->inlined_to
444 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller);
596 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in can_early_inline_edge_p()
629 num_calls (struct cgraph_node *n) in num_calls()
[all …]
H A Dipa-reference.c136 virtual void remove (cgraph_node *src_node,
138 virtual void duplicate (cgraph_node *src_node, cgraph_node *dst_node,
172 get_reference_vars_info (struct cgraph_node *node) in get_reference_vars_info()
183 get_reference_optimization_summary (struct cgraph_node *node) in get_reference_optimization_summary()
199 ipa_reference_get_read_global (struct cgraph_node *fn) in ipa_reference_get_read_global()
205 struct cgraph_node *fn2 = fn->function_symbol (&avail); in ipa_reference_get_read_global()
228 ipa_reference_get_written_global (struct cgraph_node *fn) in ipa_reference_get_written_global()
234 struct cgraph_node *fn2 = fn->function_symbol (&avail); in ipa_reference_get_written_global()
386 propagate_bits (ipa_reference_global_vars_info_t x_global, struct cgraph_node *x) in propagate_bits()
396 struct cgraph_node *y = e->callee->function_symbol (&avail); in propagate_bits()
[all …]
H A Dipa-inline-transform.c58 update_noncloned_counts (struct cgraph_node *node, in update_noncloned_counts()
82 can_remove_node_now_p_1 (struct cgraph_node *node, struct cgraph_edge *e) in can_remove_node_now_p_1()
88 cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); in can_remove_node_now_p_1()
117 can_remove_node_now_p (struct cgraph_node *node, struct cgraph_edge *e) in can_remove_node_now_p()
119 struct cgraph_node *next; in can_remove_node_now_p()
127 for (next = dyn_cast<cgraph_node *> (node->same_comdat_group); in can_remove_node_now_p()
128 next != node; next = dyn_cast<cgraph_node *> (next->same_comdat_group)) in can_remove_node_now_p()
142 master_clone_with_noninline_clones_p (struct cgraph_node *node) in master_clone_with_noninline_clones_p()
147 for (struct cgraph_node *n = node->clones; n; n = n->next_sibling_clone) in master_clone_with_noninline_clones_p()
167 struct cgraph_node *inlining_into; in clone_inlined_nodes()
[all …]
H A Dcgraphunit.c213 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()
385 cgraph_node::reset (void) in reset()
420 cgraph_node *cn = dyn_cast <cgraph_node *> (this); in referred_to_p()
438 cgraph_node::finalize_function (tree decl, bool no_collect) in finalize_function()
440 cgraph_node *node = cgraph_node::get_create (decl); in finalize_function()
515 cgraph_node::add_new_function (tree fndecl, bool lowered) in add_new_function()
518 cgraph_node *node; in add_new_function()
539 cgraph_node::finalize_function (fndecl, false); in add_new_function()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dcgraph.h812 cgraph_node *prev_clone, *next_clone;
815 cgraph_node *origin;
824 cgraph_node *this_node;
873 struct GTY((tag ("SYMTAB_FUNCTION"))) cgraph_node : public symtab_node struct
878 explicit cgraph_node (int uid) in cgraph_node() function
907 bool remove_symbol_and_inline_clones (cgraph_node *forbidden_node = NULL);
926 cgraph_node *function_symbol (enum availability *avail = NULL,
935 cgraph_node *function_or_virtual_thunk_symbol
955 cgraph_node *create_clone (tree decl, profile_count count,
959 cgraph_node *new_inlined_to,
[all …]
H A Dtree-nested.h47 static nested_function_info *get (cgraph_node *node);
50 static nested_function_info *get_create (cgraph_node *node);
56 cgraph_node *origin;
58 cgraph_node *nested;
60 cgraph_node *next_nested;
63 extern void maybe_record_nested_function (cgraph_node *node);
64 extern void unnest_function (cgraph_node *node);
67 inline cgraph_node *
68 first_nested_function (cgraph_node *node) in first_nested_function()
75 inline cgraph_node *
[all …]
H A Dcgraph.cc76 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
153 if (is_a <cgraph_node *> (this) in address_can_be_compared_p()
169 cgraph_node::function_version (void) in function_version()
183 cgraph_node::insert_new_function_version (void) in insert_new_function_version()
220 cgraph_node::delete_function_version_by_decl (tree decl) in delete_function_version_by_decl()
222 cgraph_node *decl_node = cgraph_node::get (decl); in delete_function_version_by_decl()
235 cgraph_node::record_function_versions (tree decl1, tree decl2) in record_function_versions()
237 cgraph_node *decl1_node = cgraph_node::get_create (decl1); in record_function_versions()
238 cgraph_node *decl2_node = cgraph_node::get_create (decl2); in record_function_versions()
287 cgraph_node *
[all …]
H A Dipa-utils.h32 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);
53 bool ipa_make_function_const (cgraph_node *, bool, bool);
54 bool ipa_make_function_pure (cgraph_node *, bool, bool);
57 bool ipa_propagate_frequency (struct cgraph_node *node);
[all …]
H A Dipa-comdats.cc99 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 Dcgraphclones.cc95 cgraph_edge::clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid, in clone()
112 cgraph_node *callee = cgraph_node::get (decl); in clone()
159 set_new_clone_decl_and_node_flags (cgraph_node *new_node) in set_new_clone_decl_and_node_flags()
183 static cgraph_node *
184 duplicate_thunk_for_node (cgraph_node *thunk, cgraph_node *node) in duplicate_thunk_for_node()
186 cgraph_node *new_thunk, *thunk_of; in duplicate_thunk_for_node()
246 new_thunk = cgraph_node::create (new_decl); in duplicate_thunk_for_node()
272 cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node *n) in redirect_callee_duplicating_thunks()
274 cgraph_node *orig_to = callee->ultimate_alias_target (); in redirect_callee_duplicating_thunks()
285 cgraph_node::expand_all_artificial_thunks () in expand_all_artificial_thunks()
[all …]
H A Dcgraphbuild.cc74 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 Dipa-fnsummary.h237 void remove_callees (cgraph_node *node); in class()
239 virtual void insert (cgraph_node *, ipa_fn_summary *); in class()
240 virtual void remove (cgraph_node *node, ipa_fn_summary *) in class()
245 virtual void duplicate (cgraph_node *src, cgraph_node *dst, in class()
262 virtual void duplicate (cgraph_node *, cgraph_node *, in duplicate() argument
359 ipa_call_context (cgraph_node *node,
377 cgraph_node *m_node;
407 void ipa_debug_fn_summary (struct cgraph_node *);
409 void ipa_dump_fn_summary (FILE *f, struct cgraph_node *node);
413 void inline_analyze_function (struct cgraph_node *node);
[all …]
H A Dipa-inline-transform.cc62 update_noncloned_counts (struct cgraph_node *node, in update_noncloned_counts()
86 can_remove_node_now_p_1 (struct cgraph_node *node, struct cgraph_edge *e) in can_remove_node_now_p_1()
92 cgraph_node *alias = dyn_cast <cgraph_node *> (ref->referring); in can_remove_node_now_p_1()
121 can_remove_node_now_p (struct cgraph_node *node, struct cgraph_edge *e) in can_remove_node_now_p()
123 struct cgraph_node *next; in can_remove_node_now_p()
131 for (next = dyn_cast<cgraph_node *> (node->same_comdat_group); in can_remove_node_now_p()
132 next != node; next = dyn_cast<cgraph_node *> (next->same_comdat_group)) in can_remove_node_now_p()
146 master_clone_with_noninline_clones_p (struct cgraph_node *node) in master_clone_with_noninline_clones_p()
151 for (struct cgraph_node *n = node->clones; n; n = n->next_sibling_clone) in master_clone_with_noninline_clones_p()
171 struct cgraph_node *inlining_into; in clone_inlined_nodes()
[all …]
H A Dcgraphunit.cc215 vec<cgraph_node *> cgraph_new_nodes;
310 cgraph_node *node = cgraph_new_nodes[i]; in process_new_functions()
318 cgraph_node::finalize_function (fndecl, false); in process_new_functions()
384 cgraph_node::reset (void) in reset()
419 cgraph_node *cn = dyn_cast <cgraph_node *> (this); in referred_to_p()
437 cgraph_node::finalize_function (tree decl, bool no_collect) in finalize_function()
439 cgraph_node *node = cgraph_node::get_create (decl); in finalize_function()
515 cgraph_node::add_new_function (tree fndecl, bool lowered) in add_new_function()
518 cgraph_node *node; in add_new_function()
539 cgraph_node::finalize_function (fndecl, false); in add_new_function()
[all …]
H A Dipa-utils.cc46 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()
128 struct cgraph_node *last = NULL; in searchc()
129 struct cgraph_node *x; in searchc()
162 ipa_reduced_postorder (struct cgraph_node **order, in ipa_reduced_postorder()
166 struct cgraph_node *node; in ipa_reduced_postorder()
169 env.stack = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count); in ipa_reduced_postorder()
[all …]
H A Dipa-inline.cc147 struct cgraph_node *to = e->caller; in caller_growth_limits()
148 struct cgraph_node *what = e->callee->ultimate_alias_target (); in caller_growth_limits()
335 cgraph_node *caller = (e->caller->inlined_to in can_inline_edge_p()
337 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller); in can_inline_edge_p()
409 inline_insns_single (cgraph_node *n, bool hint, bool hint2) in inline_insns_single()
429 inline_insns_auto (cgraph_node *n, bool hint, bool hint2) in inline_insns_auto()
470 cgraph_node *caller = (e->caller->inlined_to in can_inline_edge_by_limits_p()
472 cgraph_node *callee = e->callee->ultimate_alias_target (&avail, caller); in can_inline_edge_by_limits_p()
624 cgraph_node *caller = (e->caller->inlined_to in can_early_inline_edge_p()
626 struct cgraph_node *callee = e->callee->ultimate_alias_target (); in can_early_inline_edge_p()
[all …]
H A Dipa-reference.cc136 virtual void remove (cgraph_node *src_node,
138 virtual void duplicate (cgraph_node *src_node, cgraph_node *dst_node,
172 get_reference_vars_info (struct cgraph_node *node) in get_reference_vars_info()
183 get_reference_optimization_summary (struct cgraph_node *node) in get_reference_optimization_summary()
199 ipa_reference_get_read_global (struct cgraph_node *fn) in ipa_reference_get_read_global()
205 struct cgraph_node *fn2 = fn->function_symbol (&avail); in ipa_reference_get_read_global()
228 ipa_reference_get_written_global (struct cgraph_node *fn) in ipa_reference_get_written_global()
234 struct cgraph_node *fn2 = fn->function_symbol (&avail); in ipa_reference_get_written_global()
386 propagate_bits (ipa_reference_global_vars_info_t x_global, struct cgraph_node *x) in propagate_bits()
396 struct cgraph_node *y = e->callee->function_symbol (&avail); in propagate_bits()
[all …]

12345678910>>...13