| /freebsd-9.3-release/contrib/gcc/ |
| H A D | cgraph.h | 92 struct cgraph_node *inlined_to;
113 Each function decl has assigned cgraph_node listing callees and callers. */
115 struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) function
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_clon
[all...] |
| H A D | ipa-prop.h | 105 /* Return the field in cgraph_node/cgraph_edge struct that points
112 method's corresponding cgraph_node.
131 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 *, in
[all...] |
| H A D | ipa-utils.h | 35 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 D | ipa-utils.c | 52 struct cgraph_node** order,
67 struct cgraph_node **stack;
69 struct cgraph_node **result;
87 searchc (struct searchc_env* env, struct cgraph_node *v)
105 struct cgraph_node *w = edge->callee;
131 struct cgraph_node *last = NULL;
132 struct cgraph_node *x;
159 ipa_utils_reduced_inorder (struct cgraph_node **order,
162 struct cgraph_node *node;
165 env.stack = XCNEWVEC (struct cgraph_node *, cgraph_n_node
[all...] |
| H A D | ipa-prop.c | 65 static inline struct cgraph_node *
73 ipa_methodlist_method_set (ipa_methodlist_p wl, struct cgraph_node *mt)
97 struct cgraph_node *node;
110 ipa_add_method (ipa_methodlist_p * wl, struct cgraph_node *mt)
122 struct cgraph_node *
126 struct cgraph_node *return_method;
139 ipa_method_formal_count (struct cgraph_node *mt)
146 ipa_method_formal_count_set (struct cgraph_node *mt, int i)
153 ipa_method_is_modified (struct cgraph_node *mt, int i)
160 ipa_method_get_tree (struct cgraph_node *m
[all...] |
| H A D | cgraph.c | 38 The call-graph nodes are created lazily using cgraph_node function when
103 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;
173 const struct cgraph_node *n1 = (const struct cgraph_node *) p
199 cgraph_node (tree decl) function
[all...] |
| H A D | ipa.c | 31 cgraph_postorder (struct cgraph_node **order)
33 struct cgraph_node *node, *node2;
38 struct cgraph_node **stack =
39 XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
99 struct cgraph_node *first = (void *) 1;
100 struct cgraph_node *node, *next;
181 struct cgraph_node *clone;
|
| H A D | cgraphunit.c | 172 static void cgraph_expand_function (struct cgraph_node *);
194 decide_is_function_needed (struct cgraph_node *node, tree decl)
366 struct cgraph_node *n = cgraph_nodes_queue;
384 struct cgraph_node *n = cgraph_expand_queue;
406 cgraph_reset_node (struct cgraph_node *node)
426 struct cgraph_node *n, *next;
442 struct cgraph_node *n;
453 cgraph_lower_function (struct cgraph_node *node)
469 struct cgraph_node *node = cgraph_node (dec
[all...] |
| H A D | ipa-cp.c | 75 structure (defined in ipa_prop.h and pointed to by cgraph_node->aux)
148 static inline struct cgraph_node *
149 ipcp_method_orig_node (struct cgraph_node *mt)
156 ipcp_method_is_cloned (struct cgraph_node *node)
163 ipcp_method_set_orig_node (struct cgraph_node *node,
164 struct cgraph_node *orig_node)
172 ipcp_cloned_create (struct cgraph_node *orig_node,
173 struct cgraph_node *new_node)
190 ipcp_method_get_scale (struct cgraph_node *mt)
197 ipcp_method_set_scale (struct cgraph_node *nod
[all...] |
| H A D | ipa-inline.c | 96 cgraph_estimate_size_after_inlining (int times, struct cgraph_node *to,
97 struct cgraph_node *what)
133 struct cgraph_node *n;
159 struct cgraph_node *to = NULL, *what;
162 cgraph_redirect_edge_callee (e, cgraph_node (e->callee->inline_decl));
198 struct cgraph_node *to = edge->caller;
199 struct cgraph_node *what = edge->callee;
223 cgraph_estimate_growth (struct cgraph_node *node)
253 cgraph_check_inline_limits (struct cgraph_node *to, struct cgraph_node *wha
[all...] |
| H A D | tree-inline.h | 40 struct cgraph_node *src_node;
42 struct cgraph_node *dst_node;
|
| H A D | ipa-pure-const.c | 81 get_function_state (struct cgraph_node *node)
322 struct cgraph_node* callee;
345 callee = cgraph_node(callee_t);
393 DATA is cgraph_node of the function being walked. */
403 struct cgraph_node *fn = data;
501 analyze_function (struct cgraph_node *fn)
599 struct cgraph_node *node;
600 struct cgraph_node *w;
601 struct cgraph_node **order =
602 XCNEWVEC (struct cgraph_node *, cgraph_n_node
[all...] |
| H A D | tree-optimize.c | 381 update_inlined_to_pointers (struct cgraph_node *node,
382 struct cgraph_node *inlined_to)
404 struct cgraph_node *node;
410 node = cgraph_node (fndecl);
502 && !cgraph_node (fndecl)->origin)
|
| H A D | c-gimplify.c | 82 struct cgraph_node *cgn;
114 cgn = cgraph_node (fndecl);
|
| H A D | ipa-reference.c | 112 get_reference_vars_info_from_cgraph (struct cgraph_node * node)
455 struct cgraph_node* callee = cgraph_node(callee_t);
474 DATA is cgraph_node of the function being walked. */
484 struct cgraph_node *fn = data;
614 propagate_bits (struct cgraph_node *x)
622 struct cgraph_node *y = e->callee;
686 merge_callee_local_info (struct cgraph_node *target,
687 struct cgraph_node *x)
703 struct cgraph_node *
[all...] |
| H A D | tree-nested.c | 749 struct cgraph_node *cgn = cgraph_node (fndecl);
769 create_nesting_tree (struct cgraph_node *cgn)
1927 struct cgraph_node *node = cgraph_node (root->context);
1933 cgraph_unnest_node (cgraph_node (root->context));
1977 struct cgraph_node *cgn;
1980 cgn = cgraph_node (fndecl);
|
| H A D | ipa-type-escape.c | 1023 struct cgraph_node* callee;
1038 callee = cgraph_node(callee_t);
1168 DATA is cgraph_node of the function being walked. */
1176 struct cgraph_node *fn = data;
1361 analyze_function (struct cgraph_node *fn)
1678 struct cgraph_node *node;
|
| H A D | tree-inline.c | 723 struct cgraph_node *node;
1959 fn = cgraph_node (fn)->decl;
1984 struct cgraph_node *dest = cgraph_node (fn);
2229 id.src_node = id.dst_node = cgraph_node (fn);
2762 struct cgraph_node *old_version_node;
2763 struct cgraph_node *new_version_node;
2775 old_version_node = cgraph_node (old_decl);
2776 new_version_node = cgraph_node (new_decl);
|
| H A D | passes.c | 949 struct cgraph_node *node;
|
| H A D | varasm.c | 2012 struct cgraph_node *node = cgraph_node (decl);
4826 struct cgraph_node *fnode = NULL;
5046 cgraph_node (decl)->alias = true;
|
| H A D | gimplify.c | 890 struct cgraph_node *cgn = cgraph_node (fndecl);
903 struct cgraph_node *cgn = cgraph_node (fndecl);
|
| H A D | c-decl.c | 6846 struct cgraph_node *cgn;
6856 cgn = cgraph_node (fndecl);
7003 (void) cgraph_node (fndecl);
|
| H A D | omp-low.c | 841 ctx->cb.src_node = cgraph_node (current_function_decl);
|
| H A D | tree-ssa-structalias.c | 5048 struct cgraph_node *node;
|
| /freebsd-9.3-release/contrib/gcc/cp/ |
| H A D | decl2.c | 2400 cgraph_mark_needed_node (cgraph_node (fn));
2976 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2980 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
3013 struct cgraph_node *node;
3277 && !cgraph_node (decl)->local.finalized)
|