| /src/external/gpl3/gcc.old/dist/gcc/ |
| auto-profile.h | 29 extern bool afdo_callsite_hot_enough_for_early_inline (struct cgraph_edge *);
|
| ipa-inline.h | 45 int estimate_size_after_inlining (struct cgraph_node *, struct cgraph_edge *);
47 bool growth_positive_p (struct cgraph_node *, struct cgraph_edge *, int);
48 int do_estimate_edge_size (struct cgraph_edge *edge);
49 sreal do_estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL);
50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
61 bool inline_call (struct cgraph_edge *, bool, vec<cgraph_edge *> *, int *, bool,
64 void clone_inlined_nodes (struct cgraph_edge *e, bool, bool, int *);
73 estimate_edge_size (struct cgraph_edge *edge)
86 estimate_min_edge_growth (struct cgraph_edge *edge
[all...] |
| ipa-inline-transform.cc | 65 struct cgraph_edge *e;
86 can_remove_node_now_p_1 (struct cgraph_node *node, struct cgraph_edge *e)
121 can_remove_node_now_p (struct cgraph_node *node, struct cgraph_edge *e)
168 clone_inlined_nodes (struct cgraph_edge *e, bool duplicate,
172 struct cgraph_edge *next;
255 check_speculations_1 (cgraph_node *n, vec<cgraph_edge *> *new_edges,
256 hash_set <cgraph_edge *> *edge_set)
259 cgraph_edge *next;
261 for (cgraph_edge *e = n->callees; e; e = next)
270 cgraph_edge::resolve_speculation (e, NULL)
[all...] |
| cgraph.h | 859 struct cgraph_edge;
861 struct cgraph_edge_hasher : ggc_ptr_hash<cgraph_edge>
865 static hashval_t hash (cgraph_edge *);
867 static bool equal (cgraph_edge *, gimple *);
957 vec<cgraph_edge *> redirect_callers,
966 cgraph_node *create_virtual_clone (const vec<cgraph_edge *> &redirect_callers,
993 vec<cgraph_edge *> redirect_callers,
1024 (vec<cgraph_edge *> redirect_callers,
1134 cgraph_edge *create_edge (cgraph_node *callee,
1141 cgraph_edge *create_indirect_edge (gcall *call_stmt, int ecf_flags
[all...] |
| ipa-inline-analysis.cc | 101 initialize_inline_failed (struct cgraph_edge *e)
157 simple_edge_hints (struct cgraph_edge *edge)
183 do_estimate_edge_time (struct cgraph_edge *edge, sreal *ret_nonspec_time)
297 ipa_remove_from_growth_caches (struct cgraph_edge *edge)
309 do_estimate_edge_size (struct cgraph_edge *edge)
343 do_estimate_edge_hints (struct cgraph_edge *edge)
377 struct cgraph_edge *edge)
406 struct cgraph_edge *e;
486 int min_size, struct cgraph_edge *known_edge)
493 for (cgraph_edge *e = node->callers; e; e = e->next_caller
[all...] |
| cgraphclones.cc | 94 cgraph_edge *
95 cgraph_edge::clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid,
99 cgraph_edge *new_edge;
196 cgraph_edge *cs;
260 cgraph_edge *e = new_thunk->create_edge (node, NULL, new_thunk->count);
272 cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node *n)
287 cgraph_edge *e;
335 for (cgraph_edge *e = n->callees; e; e=e->next_callee)
341 for (cgraph_edge *e = n->indirect_calls; e; e=e->next_callee)
368 vec<cgraph_edge *> redirect_callers
[all...] |
| cgraph.cc | 81 /* List of hooks triggered on cgraph_edge events. */
325 symbol_table::call_edge_removal_hooks (cgraph_edge *e)
449 symbol_table::call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2)
674 /* Returns a hash value for X (which really is a cgraph_edge). */
677 cgraph_edge_hasher::hash (cgraph_edge *e)
684 /* Returns a hash value for X (which really is a cgraph_edge). */
694 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
697 cgraph_edge_hasher::equal (cgraph_edge *x, gimple *y)
705 cgraph_update_edge_in_call_site_hash (cgraph_edge *e
[all...] |
| ipa-prop.h | 710 vec<cgraph_edge *> cg_edges;
1053 void remove (cgraph_edge *edge)
1059 virtual void remove (cgraph_edge *cs, ipa_edge_args *args);
1061 virtual void duplicate (cgraph_edge *src,
1062 cgraph_edge *dst,
1128 ipa_edge_args_info_available_for_edge_p (struct cgraph_edge *edge)
1153 bool ipa_propagate_indirect_call_infos (struct cgraph_edge *cs,
1154 vec<cgraph_edge *> *new_edges);
1157 tree ipa_get_indirect_edge_target (struct cgraph_edge *ie,
1160 tree ipa_get_indirect_edge_target (struct cgraph_edge *ie
[all...] |
| ipa-utils.cc | 81 bool (*ignore_edge) (struct cgraph_edge *))
83 struct cgraph_edge *edge;
164 bool (*ignore_edge) (struct cgraph_edge *))
252 ipa_edge_within_scc (struct cgraph_edge *cs)
267 struct cgraph_edge *edge;
281 struct cgraph_edge *edge;
381 struct cgraph_edge *e;
527 struct cgraph_edge *e, *e2;
610 struct cgraph_edge *e, *e2;
691 cgraph_edge::resolve_speculation (e, NULL)
[all...] |
| ipa-fnsummary.h | 314 virtual void duplicate (cgraph_edge *src, cgraph_edge *dst,
417 void ipa_merge_fn_summary_after_inlining (struct cgraph_edge *edge);
424 void evaluate_properties_for_edge (struct cgraph_edge *e,
433 void ipa_remove_from_growth_caches (struct cgraph_edge *edge);
438 cross_module_call_p (struct cgraph_edge *edge)
|
| symbol-summary.h | 582 virtual void remove (cgraph_edge *, T *) {}
585 virtual void duplicate (cgraph_edge *, cgraph_edge *, T *, T *)
698 T* get_create (cgraph_edge *edge)
709 T* get (cgraph_edge *edge) ATTRIBUTE_PURE
717 void remove (cgraph_edge *edge)
729 bool exists (cgraph_edge *edge)
735 static void symtab_removal (cgraph_edge *edge, void *data);
738 static void symtab_duplication (cgraph_edge *edge1, cgraph_edge *edge2
[all...] |
| ipa-utils.h | 40 bool (*ignore_edge) (struct cgraph_edge *));
43 bool ipa_edge_within_scc (struct cgraph_edge *);
120 possible_polymorphic_call_targets (struct cgraph_edge *e,
154 dump_possible_polymorphic_call_targets (FILE *f, struct cgraph_edge *e,
168 possible_polymorphic_call_target_p (struct cgraph_edge *e,
|
| ipa-inline.cc | 123 typedef fibonacci_heap <sreal, cgraph_edge> edge_heap_t;
124 typedef fibonacci_node <sreal, cgraph_edge> edge_heap_node_t;
145 caller_growth_limits (struct cgraph_edge *e)
228 report_inline_failed_reason (struct cgraph_edge *e)
321 can_inline_edge_p (struct cgraph_edge *e, bool report,
456 can_inline_edge_by_limits_p (struct cgraph_edge *e, bool report,
622 can_early_inline_edge_p (struct cgraph_edge *e)
668 struct cgraph_edge *e;
681 want_early_inline_function_p (struct cgraph_edge *e)
765 compute_uninlined_call_time (struct cgraph_edge *edge
[all...] |
| ipa-cp.cc | 142 cgraph_edge *cs;
215 void add_source (cgraph_edge *cs, ipcp_value *src_val, int src_idx,
260 bool add_value (valtype newval, cgraph_edge *cs,
673 for (cgraph_edge *edge = node->callees; !reason && edge;
744 struct cgraph_edge *cs;
882 ignore_edge_p (cgraph_edge *e)
1242 for (cgraph_edge *cs = node->callers; cs; cs = cs->next_caller)
1256 cgraph_edge *cs = node->callers;
1275 struct cgraph_edge *ie;
1565 ipa_context_from_jfunc (ipa_node_params *info, cgraph_edge *cs, int csidx
[all...] |
| ipa-modref.h | 77 void ipa_merge_modref_summary_after_inlining (cgraph_edge *e);
|
| multiple_target.cc | 105 auto_vec<cgraph_edge *> edges_to_redirect;
118 for (cgraph_edge *e = node->callers; e ; e = e->next_caller)
125 cgraph_edge *e;
129 cgraph_edge::redirect_call_stmt_to_callee (e);
453 for (cgraph_edge *e = node->callees; e ; e = e->next_callee)
479 cgraph_edge::redirect_call_stmt_to_callee (e);
|
| ipa-profile.cc | 201 virtual void duplicate (cgraph_edge *, cgraph_edge *,
234 ipa_profile_call_summaries::duplicate (cgraph_edge *, cgraph_edge *,
291 struct cgraph_edge *e = node->get_edge (stmt);
411 for (cgraph_edge *e = node->indirect_calls; e; e = e->next_callee)
433 for (cgraph_edge *e = node->indirect_calls; e; e = e->next_callee)
447 ipa_profile_read_edge_summary (class lto_input_block *ib, cgraph_edge *edge)
488 for (cgraph_edge *e = node->indirect_calls; e; e = e->next_callee)
557 struct cgraph_edge *edge
[all...] |
| ipa-param-manipulation.h | 227 gcall *modify_call (cgraph_edge *cs, bool update_references,
432 void ipa_verify_edge_has_no_modifications (cgraph_edge *cs);
|
| ipa-prop.cc | 165 struct cgraph_edge *cs;
308 ipa_print_node_jump_functions_for_edge (FILE *f, struct cgraph_edge *cs)
458 struct cgraph_edge *cs;
545 struct cgraph_edge *cs)
2131 ipa_get_callee_param_type (struct cgraph_edge *e, int i)
2248 struct cgraph_edge *cs)
2425 struct cgraph_edge *cs;
2513 static struct cgraph_edge *
2517 struct cgraph_edge *cs;
2615 struct cgraph_edge *cs = ipa_note_param_call (fbi->node, index
[all...] |
| tree-inline.h | 25 struct cgraph_edge;
|
| ipa-comdats.cc | 123 for (struct cgraph_edge * edge = cnode->callers;
183 struct cgraph_edge *edge;
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| analysis-plan.h | 42 bool use_summary_p (const cgraph_edge *edge) const;
|
| supergraph.h | 124 supernode *get_caller_next_node (cgraph_edge *edge) const
130 call_superedge *get_edge_for_call (cgraph_edge *edge) const
136 return_superedge *get_edge_for_return (cgraph_edge *edge) const
142 superedge *get_intraprocedural_edge_for_call (cgraph_edge *edge) const
186 cgraph_edge *cedge);
188 cgraph_edge *cedge);
196 typedef ordered_hash_map<cgraph_edge *, supernode *> cgraph_edge_to_node_t;
204 typedef ordered_hash_map<cgraph_edge *, call_superedge *>
208 typedef ordered_hash_map<cgraph_edge *, return_superedge *>
212 typedef ordered_hash_map<cgraph_edge *, superedge *
[all...] |
| analysis-plan.cc | 106 analysis_plan::use_summary_p (const cgraph_edge *edge) const
119 for (cgraph_edge *edge = callee->callers; edge; edge = edge->next_caller)
|
| supergraph.cc | 66 get_ultimate_function_for_cgraph_edge (cgraph_edge *edge)
74 /* Get the cgraph_edge, but only if there's an underlying function body. */
76 cgraph_edge *
82 cgraph_edge *edge = cgraph_node::get (fun->decl)->get_edge (stmt);
187 if (cgraph_edge *edge = supergraph_call_edge (fun, stmt))
199 cgraph_edge *edge
263 cgraph_edge *edge = (*iter).first;
286 cgraph_edge *edge = (*iter).first;
309 cgraph_edge *edge = (*iter).first;
531 cgraph_edge *cedge
[all...] |
