Home
last modified time | relevance | path

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

12

/freebsd-12.1/contrib/gcc/
H A Dcgraph.h120 struct cgraph_node *next;
123 struct cgraph_node *origin;
125 struct cgraph_node *nested;
177 struct cgraph_node *caller;
268 struct cgraph_node *,
270 struct cgraph_node *cgraph_node (tree);
279 struct cgraph_node *,
281 struct cgraph_node * cgraph_clone_node (struct cgraph_node *, gcov_type,
301 struct cgraph_node *cgraph_master_clone (struct cgraph_node *);
321 struct cgraph_node *cgraph_function_versioning (struct cgraph_node *,
[all …]
H A Dcgraph.c164 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()
198 struct cgraph_node *
199 cgraph_node (tree decl) in cgraph_node() function
284 struct cgraph_node *
377 cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee, in cgraph_create_edge()
591 struct cgraph_node *n = (struct cgraph_node *) *slot; in cgraph_remove_node()
1063 struct cgraph_node *
1116 struct cgraph_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 *);
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 *);
183 void ipa_method_compute_modify (struct cgraph_node *);
[all …]
H A Dipa-prop.c97 struct cgraph_node *node; in ipa_methodlist_init()
122 struct cgraph_node *
354 struct cgraph_node *
437 struct cgraph_node *mt; in ipa_callsite_compute_param()
525 struct cgraph_node *node; in ipa_nodes_create()
535 struct cgraph_node *node; in ipa_edges_create()
547 struct cgraph_node *node; in ipa_nodes_free()
560 struct cgraph_node *node; in ipa_edges_free()
575 struct cgraph_node *node; in ipa_free()
604 struct cgraph_node *node; in ipa_method_tree_print()
[all …]
H A Dcgraphunit.c442 struct cgraph_node *n; in cgraph_reset_node()
482 struct cgraph_node *node = cgraph_node (decl); in cgraph_finalize_function()
662 struct cgraph_node *node = cgraph_node (current_function_decl); in rebuild_cgraph_edges()
858 struct cgraph_node *node; in verify_cgraph()
1015 struct cgraph_node *node; in process_function_and_variable_attributes()
1200 struct cgraph_node *node; in cgraph_mark_functions_to_output()
1303 struct cgraph_node **order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); in cgraph_expand_all_functions()
1350 struct cgraph_node *f;
1369 struct cgraph_node *pf; in cgraph_output_in_order()
1851 struct cgraph_node *
[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 *
173 struct cgraph_node *new_node) in ipcp_cloned_create()
379 struct cgraph_node *node; in ipcp_method_cval_print()
516 struct cgraph_node *node; in ipcp_init_stage()
553 struct cgraph_node *node; in ipcp_after_propagate()
639 struct cgraph_node *node; in ipcp_callsite_param_print()
685 struct cgraph_node *node; in ipcp_method_scale_print()
699 struct cgraph_node *node; in ipcp_profile_mt_count_print()
713 struct cgraph_node *node; in ipcp_profile_cs_count_print()
732 struct cgraph_node *node; in ipcp_profile_edge_print()
[all …]
H A Dipa-inline.c97 struct cgraph_node *what) in cgraph_estimate_size_after_inlining()
133 struct cgraph_node *n; in cgraph_clone_inlined_nodes()
253 cgraph_check_inline_limits (struct cgraph_node *to, struct cgraph_node *what, in cgraph_check_inline_limits()
345 struct cgraph_node *what, in cgraph_recursive_inlining_p()
489 lookup_recursive_calls (struct cgraph_node *node, struct cgraph_node *where, in lookup_recursive_calls()
620 struct cgraph_node *cnode; in cgraph_decide_recursive_inlining()
719 struct cgraph_node *node; in cgraph_decide_inlining_of_small_functions()
844 struct cgraph_node *callee; in cgraph_decide_inlining_of_small_functions()
899 struct cgraph_node *node; in cgraph_decide_inlining()
901 struct cgraph_node **order = in cgraph_decide_inlining()
[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-reference.c454 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()
686 struct cgraph_node *x) 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()
845 clean_function (struct cgraph_node *fn) in clean_function()
895 struct cgraph_node *node; in static_execute()
897 struct cgraph_node *w; in static_execute()
[all …]
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()
682 struct cgraph_node *y = e->callee; in static_execute()
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()
1925 struct cgraph_node *node = cgraph_node (root->context); in unnest_nesting_tree_1()
1931 cgraph_unnest_node (cgraph_node (root->context)); in unnest_nesting_tree_1()
1976 struct cgraph_node *cgn; in lower_nested_functions()
1979 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.c2003 struct cgraph_node *node = cgraph_node (decl); in mark_decl_referenced()
4802 struct cgraph_node *fnode = NULL; in find_decl_and_mark_needed()
5022 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.c7250 struct cgraph_node *cgn; in c_gimple_diagnostics_recursively()
7260 cgn = cgraph_node (fndecl); in c_gimple_diagnostics_recursively()
7407 (void) cgraph_node (fndecl); in finish_function()
H A Dtree-ssa-structalias.c5048 struct cgraph_node *node; in ipa_pta_execute()
H A Domp-low.c841 ctx->cb.src_node = cgraph_node (current_function_decl); in new_omp_context()
/freebsd-12.1/contrib/gcc/cp/
H A Ddecl2.c2420 cgraph_mark_needed_node (cgraph_node (fn)); in finish_objects()
2996 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t))); in cxx_callgraph_analyze_expr()
3000 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t))); in cxx_callgraph_analyze_expr()
3033 struct cgraph_node *node; in build_java_method_aliases()
3323 && !cgraph_node (decl)->local.finalized) in emit_instantiate_pending_templates()

12