Home
last modified time | relevance | path

Searched defs:edge (Results 1 – 25 of 110) sorted by relevance

12345

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dipa-inline.h73 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size()
86 estimate_min_edge_growth (struct cgraph_edge *edge) in estimate_min_edge_growth()
96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth()
124 estimate_edge_hints (struct cgraph_edge *edge) in estimate_edge_hints()
H A Dipa-inline-analysis.cc157 simple_edge_hints (struct cgraph_edge *edge) in simple_edge_hints()
183 do_estimate_edge_time (struct cgraph_edge *edge, sreal *ret_nonspec_time) in do_estimate_edge_time()
297 ipa_remove_from_growth_caches (struct cgraph_edge *edge) in ipa_remove_from_growth_caches()
309 do_estimate_edge_size (struct cgraph_edge *edge) in do_estimate_edge_size()
343 do_estimate_edge_hints (struct cgraph_edge *edge) in do_estimate_edge_hints()
377 struct cgraph_edge *edge) in estimate_size_after_inlining()
H A Dipa-inline.cc765 compute_uninlined_call_time (struct cgraph_edge *edge, in compute_uninlined_call_time()
786 compute_inlined_call_time (struct cgraph_edge *edge, in compute_inlined_call_time()
815 inlining_speedup (struct cgraph_edge *edge, in inlining_speedup()
991 want_inline_self_recursive_call_p (struct cgraph_edge *edge, in want_inline_self_recursive_call_p()
1172 edge_badness (struct cgraph_edge *edge, bool dump) in edge_badness()
1389 update_edge_key (edge_heap_t *heap, struct cgraph_edge *edge) in update_edge_key()
1439 struct cgraph_edge *edge; in reset_edge_caches() local
1493 struct cgraph_edge *edge; in update_caller_keys() local
1645 recursive_inlining (struct cgraph_edge *edge, in recursive_inlining()
1804 struct cgraph_edge *edge = new_edges.pop (); in add_new_edges_to_heap() local
[all …]
H A Dipa-comdats.cc123 for (struct cgraph_edge * edge = cnode->callers; in propagate_comdat_group() local
183 struct cgraph_edge *edge; in enqueue_references() local
H A Dipa-utils.cc83 struct cgraph_edge *edge; in searchc() local
267 struct cgraph_edge *edge; member
281 struct cgraph_edge *edge; in ipa_reverse_postorder() local
H A Dvalue-query.cc39 value_query::value_on_edge (edge, tree expr) in value_on_edge() argument
60 range_query::range_on_edge (irange &r, edge, tree expr) in range_on_edge() argument
H A Dcgraphclones.cc780 cgraph_edge *edge = node->get_edge (old_stmt); in set_call_stmt_including_clones() local
835 cgraph_edge *edge = create_edge (callee, stmt, count); in create_edge_including_clones() local
845 cgraph_edge *edge = node->get_edge (old_stmt); in create_edge_including_clones() local
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dipa-inline.h73 estimate_edge_size (struct cgraph_edge *edge) in estimate_edge_size()
86 estimate_min_edge_growth (struct cgraph_edge *edge) in estimate_min_edge_growth()
96 estimate_edge_growth (struct cgraph_edge *edge) in estimate_edge_growth()
124 estimate_edge_hints (struct cgraph_edge *edge) in estimate_edge_hints()
H A Dipa-inline-analysis.c154 simple_edge_hints (struct cgraph_edge *edge) in simple_edge_hints()
180 do_estimate_edge_time (struct cgraph_edge *edge, sreal *ret_nonspec_time) in do_estimate_edge_time()
293 ipa_remove_from_growth_caches (struct cgraph_edge *edge) in ipa_remove_from_growth_caches()
305 do_estimate_edge_size (struct cgraph_edge *edge) in do_estimate_edge_size()
344 do_estimate_edge_hints (struct cgraph_edge *edge) in do_estimate_edge_hints()
384 struct cgraph_edge *edge) in estimate_size_after_inlining()
H A Dipa-inline.c728 compute_uninlined_call_time (struct cgraph_edge *edge, in compute_uninlined_call_time()
749 compute_inlined_call_time (struct cgraph_edge *edge, in compute_inlined_call_time()
778 inlining_speedup (struct cgraph_edge *edge, in inlining_speedup()
946 want_inline_self_recursive_call_p (struct cgraph_edge *edge, in want_inline_self_recursive_call_p()
1117 edge_badness (struct cgraph_edge *edge, bool dump) in edge_badness()
1329 update_edge_key (edge_heap_t *heap, struct cgraph_edge *edge) in update_edge_key()
1379 struct cgraph_edge *edge; in reset_edge_caches() local
1433 struct cgraph_edge *edge; in update_caller_keys() local
1585 recursive_inlining (struct cgraph_edge *edge, in recursive_inlining()
1744 struct cgraph_edge *edge = new_edges.pop (); in add_new_edges_to_heap() local
[all …]
H A Dipa-comdats.c123 for (struct cgraph_edge * edge = cnode->callers; in propagate_comdat_group() local
183 struct cgraph_edge *edge; in enqueue_references() local
H A Dipa-utils.c83 struct cgraph_edge *edge; in searchc() local
267 struct cgraph_edge *edge; member
281 struct cgraph_edge *edge; in ipa_reverse_postorder() local
H A Dcgraphclones.c768 cgraph_edge *edge = node->get_edge (old_stmt); in set_call_stmt_including_clones() local
823 cgraph_edge *edge = create_edge (callee, stmt, count); in create_edge_including_clones() local
833 cgraph_edge *edge = node->get_edge (old_stmt); in create_edge_including_clones() local
/netbsd-src/external/mit/isl/dist/
H A Disl_scheduler.c81 int isl_sched_edge_has_type(struct isl_sched_edge *edge, in isl_sched_edge_has_type()
89 static void set_type(struct isl_sched_edge *edge, enum isl_edge_type type) in set_type()
96 static void clear_type(struct isl_sched_edge *edge, enum isl_edge_type type) in clear_type()
103 static int is_validity(struct isl_sched_edge *edge) in is_validity()
110 static void set_validity(struct isl_sched_edge *edge) in set_validity()
117 int isl_sched_edge_is_proximity(struct isl_sched_edge *edge) in isl_sched_edge_is_proximity()
124 static int is_local(struct isl_sched_edge *edge) in is_local()
131 static void set_local(struct isl_sched_edge *edge) in set_local()
138 static void clear_local(struct isl_sched_edge *edge) in clear_local()
145 static int is_coincidence(struct isl_sched_edge *edge) in is_coincidence()
[all …]
H A Disl_scheduler_clustering.c92 static isl_bool is_non_empty_proximity(struct isl_sched_edge *edge) in is_non_empty_proximity()
120 struct isl_sched_edge *edge = &graph->edge[i]; in find_proximity() local
216 int edge, struct isl_clustering *c) in mark_merge_sccs()
363 struct isl_sched_edge *edge, __isl_keep isl_union_map *umap, in add_non_conditional_constraints()
390 struct isl_sched_edge *edge, __isl_keep isl_union_map *umap, in add_conditional_constraints()
429 struct isl_sched_edge *edge, __isl_keep isl_union_map *cluster_map, in collect_edge_constraints()
482 struct isl_sched_edge *edge = &graph->edge[i]; in collect_constraints() local
839 static isl_bool has_bounded_distances(isl_ctx *ctx, struct isl_sched_edge *edge, in has_bounded_distances()
914 struct isl_sched_edge *edge = &graph->edge[i]; in ok_to_merge_proximity() local
1175 struct isl_sched_edge *edge = &graph->edge[i]; in any_no_merge() local
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dsupergraph.cc63 get_ultimate_function_for_cgraph_edge (cgraph_edge *edge) in get_ultimate_function_for_cgraph_edge()
79 cgraph_edge *edge = cgraph_node::get (fun->decl)->get_edge (stmt); in supergraph_call_edge() local
137 if (cgraph_edge *edge = supergraph_call_edge (fun, stmt)) in supergraph() local
191 cgraph_edge *edge = (*iter).first; in supergraph() local
214 cgraph_edge *edge = (*iter).first; in supergraph() local
237 cgraph_edge *edge = (*iter).first; in supergraph() local
H A Danalysis-plan.cc114 for (cgraph_edge *edge = callee->callers; edge; edge = edge->next_caller) in use_summary_p() local
H A Dsupergraph.h111 supernode *get_caller_next_node (cgraph_edge *edge) const in get_caller_next_node()
117 call_superedge *get_edge_for_call (cgraph_edge *edge) const in get_edge_for_call()
123 return_superedge *get_edge_for_return (cgraph_edge *edge) const in get_edge_for_return()
129 superedge *get_intraprocedural_edge_for_call (cgraph_edge *edge) const in get_intraprocedural_edge_for_call()
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dsupergraph.cc66 get_ultimate_function_for_cgraph_edge (cgraph_edge *edge) in get_ultimate_function_for_cgraph_edge()
82 cgraph_edge *edge = cgraph_node::get (fun->decl)->get_edge (stmt); in supergraph_call_edge() local
187 if (cgraph_edge *edge = supergraph_call_edge (fun, stmt)) in supergraph() local
199 cgraph_edge *edge in supergraph() local
263 cgraph_edge *edge = (*iter).first; in supergraph() local
286 cgraph_edge *edge = (*iter).first; in supergraph() local
309 cgraph_edge *edge = (*iter).first; in supergraph() local
H A Danalysis-plan.cc119 for (cgraph_edge *edge = callee->callers; edge; edge = edge->next_caller) in use_summary_p() local
H A Dsupergraph.h124 supernode *get_caller_next_node (cgraph_edge *edge) const in get_caller_next_node()
130 call_superedge *get_edge_for_call (cgraph_edge *edge) const in get_edge_for_call()
136 return_superedge *get_edge_for_return (cgraph_edge *edge) const in get_edge_for_return()
142 superedge *get_intraprocedural_edge_for_call (cgraph_edge *edge) const in get_intraprocedural_edge_for_call()
/netbsd-src/external/bsd/unbound/dist/testcode/
H A Dunitecs.c97 struct addredge* edge; in addrtree_inconsistent_subtree() local
121 struct addredge* edge; in addrtree_inconsistent() local
/netbsd-src/external/bsd/unbound/dist/edns-subnet/
H A Daddrtree.c59 struct addredge *edge = (struct addredge *)malloc( sizeof (*edge) ); in edge_create() local
366 struct addredge *edge; in addrtree_insert() local
482 struct addredge *edge = NULL; in addrtree_find() local
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint() local
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint() local
/netbsd-src/games/dab/
H A Dbox.cc130 int& BOX::edge(int e) in edge() function in BOX

12345