Home
last modified time | relevance | path

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

12

/openbsd-src/gnu/gcc/gcc/
H A Dcgraph.h92 struct cgraph_node *inlined_to;
115 struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous")))
120 struct cgraph_node *next;
121 struct cgraph_node *previous;
123 struct cgraph_node *origin;
125 struct cgraph_node *nested;
127 struct cgraph_node *next_nested;
129 struct cgraph_node *next_needed;
131 struct cgraph_node *next_clone;
132 struct cgraph_node *prev_clone;
[all …]
H A Dcgraph.c103 static void cgraph_node_remove_callers (struct cgraph_node *node);
108 static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash;
111 struct cgraph_node *cgraph_nodes;
114 struct cgraph_node *cgraph_nodes_queue;
119 struct cgraph_node *cgraph_expand_queue;
164 const struct cgraph_node *n = (const struct cgraph_node *) p; in hash_node()
173 const struct cgraph_node *n1 = (const struct cgraph_node *) p1; in eq_node()
174 const struct cgraph_node *n2 = (const struct cgraph_node *) p2; in eq_node()
179 static struct cgraph_node *
182 struct cgraph_node *node; in cgraph_create_node()
[all …]
H A Dipa-prop.h131 struct cgraph_node *ipcp_orig_node;
156 struct cgraph_node *method_p;
166 void ipa_add_method (ipa_methodlist_p *, struct cgraph_node *);
167 struct cgraph_node *ipa_remove_method (ipa_methodlist_p *);
173 struct cgraph_node *ipa_callsite_callee (struct cgraph_edge *);
178 int ipa_method_formal_count (struct cgraph_node *);
179 void ipa_method_formal_count_set (struct cgraph_node *, int);
180 tree ipa_method_get_tree (struct cgraph_node *, int);
181 void ipa_method_compute_tree_map (struct cgraph_node *);
182 void ipa_method_formal_compute_count (struct cgraph_node *);
[all …]
H A Dipa-prop.c65 static inline struct cgraph_node *
73 ipa_methodlist_method_set (ipa_methodlist_p wl, struct cgraph_node *mt) in ipa_methodlist_method_set()
97 struct cgraph_node *node; in ipa_methodlist_init()
110 ipa_add_method (ipa_methodlist_p * wl, struct cgraph_node *mt) in ipa_add_method()
122 struct cgraph_node *
126 struct cgraph_node *return_method; in ipa_remove_method()
139 ipa_method_formal_count (struct cgraph_node *mt) in ipa_method_formal_count()
146 ipa_method_formal_count_set (struct cgraph_node *mt, int i) in ipa_method_formal_count_set()
153 ipa_method_is_modified (struct cgraph_node *mt, int i) in ipa_method_is_modified()
160 ipa_method_get_tree (struct cgraph_node *mt, int i) in ipa_method_get_tree()
[all …]
H A Dcgraphunit.c172 static void cgraph_expand_function (struct cgraph_node *);
194 decide_is_function_needed (struct cgraph_node *node, tree decl) in decide_is_function_needed()
366 struct cgraph_node *n = cgraph_nodes_queue; in cgraph_assemble_pending_functions()
384 struct cgraph_node *n = cgraph_expand_queue; in cgraph_assemble_pending_functions()
406 cgraph_reset_node (struct cgraph_node *node) in cgraph_reset_node()
426 struct cgraph_node *n, *next; in cgraph_reset_node()
442 struct cgraph_node *n; in cgraph_reset_node()
453 cgraph_lower_function (struct cgraph_node *node) in cgraph_lower_function()
469 struct cgraph_node *node = cgraph_node (decl); in cgraph_finalize_function()
545 cgraph_mark_needed_node (cgraph_node (decl)); in record_reference()
[all …]
H A Dipa-utils.c52 struct cgraph_node** order, in ipa_utils_print_order()
66 struct cgraph_node **stack;
68 struct cgraph_node **result;
86 searchc (struct searchc_env* env, struct cgraph_node *v) in searchc()
104 struct cgraph_node *w = edge->callee; in searchc()
130 struct cgraph_node *last = NULL; in searchc()
131 struct cgraph_node *x; in searchc()
158 ipa_utils_reduced_inorder (struct cgraph_node **order, in ipa_utils_reduced_inorder()
161 struct cgraph_node *node; in ipa_utils_reduced_inorder()
164 env.stack = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); in ipa_utils_reduced_inorder()
[all …]
H A Dipa-cp.c148 static inline struct cgraph_node *
149 ipcp_method_orig_node (struct cgraph_node *mt) in ipcp_method_orig_node()
156 ipcp_method_is_cloned (struct cgraph_node *node) in ipcp_method_is_cloned()
163 ipcp_method_set_orig_node (struct cgraph_node *node, in ipcp_method_set_orig_node()
164 struct cgraph_node *orig_node) in ipcp_method_set_orig_node()
172 ipcp_cloned_create (struct cgraph_node *orig_node, in ipcp_cloned_create()
173 struct cgraph_node *new_node) in ipcp_cloned_create()
190 ipcp_method_get_scale (struct cgraph_node *mt) in ipcp_method_get_scale()
197 ipcp_method_set_scale (struct cgraph_node *node, gcov_type count) in ipcp_method_set_scale()
295 ipcp_method_cval (struct cgraph_node *mt, int info_type) in ipcp_method_cval()
[all …]
H A Dipa-inline.c96 cgraph_estimate_size_after_inlining (int times, struct cgraph_node *to, in cgraph_estimate_size_after_inlining()
97 struct cgraph_node *what) in cgraph_estimate_size_after_inlining()
133 struct cgraph_node *n; in cgraph_clone_inlined_nodes()
159 struct cgraph_node *to = NULL, *what; in cgraph_mark_inline_edge()
162 cgraph_redirect_edge_callee (e, cgraph_node (e->callee->inline_decl)); in cgraph_mark_inline_edge()
198 struct cgraph_node *to = edge->caller; in cgraph_mark_inline()
199 struct cgraph_node *what = edge->callee; in cgraph_mark_inline()
223 cgraph_estimate_growth (struct cgraph_node *node) in cgraph_estimate_growth()
253 cgraph_check_inline_limits (struct cgraph_node *to, struct cgraph_node *what, in cgraph_check_inline_limits()
297 cgraph_default_inline_p (struct cgraph_node *n, const char **reason) in cgraph_default_inline_p()
[all …]
H A Dipa.c31 cgraph_postorder (struct cgraph_node **order) in cgraph_postorder()
33 struct cgraph_node *node, *node2; in cgraph_postorder()
38 struct cgraph_node **stack = in cgraph_postorder()
39 XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); in cgraph_postorder()
99 struct cgraph_node *first = (void *) 1; in cgraph_remove_unreachable_nodes()
100 struct cgraph_node *node, *next; in cgraph_remove_unreachable_nodes()
181 struct cgraph_node *clone; in cgraph_remove_unreachable_nodes()
H A Dipa-utils.h35 struct cgraph_node* next_cycle;
42 void ipa_utils_print_order (FILE*, const char *, struct cgraph_node**, int);
43 int ipa_utils_reduced_inorder (struct cgraph_node **, bool, bool);
H A Dipa-pure-const.c81 get_function_state (struct cgraph_node *node) in get_function_state()
322 struct cgraph_node* callee; in check_call()
345 callee = cgraph_node(callee_t); in check_call()
403 struct cgraph_node *fn = data; in scan_function()
501 analyze_function (struct cgraph_node *fn) in analyze_function()
598 struct cgraph_node *node; in static_execute()
599 struct cgraph_node *w; in static_execute()
600 struct cgraph_node **order = in static_execute()
601 XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); in static_execute()
660 struct cgraph_node *y = e->callee; in static_execute()
H A Dipa-reference.c112 get_reference_vars_info_from_cgraph (struct cgraph_node * node) in get_reference_vars_info_from_cgraph()
454 struct cgraph_node* callee = cgraph_node(callee_t); in check_call()
483 struct cgraph_node *fn = data; in scan_for_static_refs()
613 propagate_bits (struct cgraph_node *x) in propagate_bits()
621 struct cgraph_node *y = e->callee; in propagate_bits()
685 merge_callee_local_info (struct cgraph_node *target, in merge_callee_local_info()
686 struct cgraph_node *x) in merge_callee_local_info()
702 struct cgraph_node *y = e->callee; in merge_callee_local_info()
707 struct cgraph_node* orig_y = y; in merge_callee_local_info()
745 struct cgraph_node *node; in ipa_init()
[all …]
H A Dtree-optimize.c381 update_inlined_to_pointers (struct cgraph_node *node, in update_inlined_to_pointers()
382 struct cgraph_node *inlined_to) in update_inlined_to_pointers()
403 struct cgraph_node *node; in tree_rest_of_compilation()
409 node = cgraph_node (fndecl); in tree_rest_of_compilation()
501 && !cgraph_node (fndecl)->origin) in tree_rest_of_compilation()
H A Dtree-inline.h40 struct cgraph_node *src_node;
42 struct cgraph_node *dst_node;
H A Dc-gimplify.c82 struct cgraph_node *cgn; in c_genericize()
114 cgn = cgraph_node (fndecl); in c_genericize()
H A Dtree-nested.c747 struct cgraph_node *cgn = cgraph_node (fndecl); in check_for_nested_with_variably_modified()
767 create_nesting_tree (struct cgraph_node *cgn) in create_nesting_tree()
1930 struct cgraph_node *node = cgraph_node (root->context); in unnest_nesting_tree_1()
1936 cgraph_unnest_node (cgraph_node (root->context)); in unnest_nesting_tree_1()
1980 struct cgraph_node *cgn; in lower_nested_functions()
1983 cgn = cgraph_node (fndecl); in lower_nested_functions()
H A Dtree-inline.c723 struct cgraph_node *node; in copy_bb()
1959 fn = cgraph_node (fn)->decl; in expand_call_inline()
1984 struct cgraph_node *dest = cgraph_node (fn); in expand_call_inline()
2229 id.src_node = id.dst_node = cgraph_node (fn); in optimize_inline_calls()
2762 struct cgraph_node *old_version_node; in tree_function_versioning()
2763 struct cgraph_node *new_version_node; in tree_function_versioning()
2775 old_version_node = cgraph_node (old_decl); in tree_function_versioning()
2776 new_version_node = cgraph_node (new_decl); in tree_function_versioning()
H A Dipa-type-escape.c1023 struct cgraph_node* callee; in check_call()
1038 callee = cgraph_node(callee_t); in check_call()
1176 struct cgraph_node *fn = data; in scan_for_refs()
1361 analyze_function (struct cgraph_node *fn) in analyze_function()
1676 struct cgraph_node *node; in type_escape_execute()
H A Dpasses.c948 struct cgraph_node *node; in execute_ipa_pass_list()
H A Dvarasm.c2004 struct cgraph_node *node = cgraph_node (decl); in mark_decl_referenced()
4801 struct cgraph_node *fnode = NULL; in find_decl_and_mark_needed()
5021 cgraph_node (decl)->alias = true; in assemble_alias()
H A Dgimplify.c890 struct cgraph_node *cgn = cgraph_node (fndecl); in unshare_body()
903 struct cgraph_node *cgn = cgraph_node (fndecl); in unvisit_body()
H A Dc-decl.c6679 struct cgraph_node *cgn; in c_gimple_diagnostics_recursively()
6689 cgn = cgraph_node (fndecl); in c_gimple_diagnostics_recursively()
6836 (void) cgraph_node (fndecl); in finish_function()
/openbsd-src/gnu/gcc/gcc/cp/
H A Ddecl2.c2376 cgraph_mark_needed_node (cgraph_node (fn)); in finish_objects()
2952 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t))); in cxx_callgraph_analyze_expr()
2956 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t))); in cxx_callgraph_analyze_expr()
2989 struct cgraph_node *node; in build_java_method_aliases()
3253 && !cgraph_node (decl)->local.finalized) in cp_finish_file()
/openbsd-src/gnu/gcc/gcc/treelang/
H A Dtreetree.c492 (void)cgraph_node (fn_decl); in tree_code_create_function_wrapup()
/openbsd-src/gnu/gcc/gcc/objc/
H A Dobjc-act.c5360 cgraph_mark_needed_node (cgraph_node (METHOD_DEFINITION (chain))); in mark_referenced_methods()
5367 cgraph_mark_needed_node (cgraph_node (METHOD_DEFINITION (chain))); in mark_referenced_methods()

12