Home
last modified time | relevance | path

Searched defs:graph (Results 1 – 12 of 12) sorted by relevance

/llvm-project/polly/lib/External/isl/
H A Disl_scheduler.c179 static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph) in graph_init_table()
207 struct isl_sched_graph *graph, __isl_keep isl_space *space) in isl_sched_graph_find_node()
228 int isl_sched_graph_is_node(struct isl_sched_graph *graph, in isl_sched_graph_is_node()
245 struct isl_sched_graph *graph, enum isl_edge_type type, in graph_edge_table_add()
267 struct isl_sched_graph *graph, struct isl_sched_edge *edge) in graph_edge_tables_add()
284 static int graph_init_edge_tables(isl_ctx *ctx, struct isl_sched_graph *graph) in graph_init_edge_tables()
303 struct isl_sched_graph *graph, in graph_find_edge_entry()
324 static struct isl_sched_edge *graph_find_edge(struct isl_sched_graph *graph, in graph_find_edge()
343 static isl_bool graph_has_edge(struct isl_sched_graph *graph, in graph_has_edge()
369 struct isl_sched_graph *graph, struct isl_sched_edge *model) in graph_find_matching_edge()
[all …]
H A Disl_scheduler_clustering.c30 struct isl_sched_graph *graph) in clustering_init()
84 static int bad_cluster(struct isl_sched_graph *graph) in bad_cluster()
114 static int find_proximity(struct isl_sched_graph *graph, in find_proximity()
161 struct isl_sched_graph *graph; member
179 struct isl_sched_graph *graph = data->graph; in cluster_follows() local
215 static isl_stat mark_merge_sccs(isl_ctx *ctx, struct isl_sched_graph *graph, in mark_merge_sccs()
296 struct isl_sched_graph *graph, struct isl_clustering *c) in collect_domain()
323 struct isl_sched_graph *graph, struct isl_clustering *c) in collect_cluster_map()
475 struct isl_sched_graph *graph, int *scc_in_merge, in collect_constraints()
505 static isl_stat init_merge_graph(isl_ctx *ctx, struct isl_sched_graph *graph, in init_merge_graph()
[all …]
H A Disl_scheduler_scc.c65 struct isl_sched_graph *graph; member
523 struct isl_sched_graph *graph, struct isl_clustering *c) in isl_scc_graph_alloc()
576 struct isl_sched_graph *graph, struct isl_clustering *c) in isl_scc_graph_from_sched_graph()
/llvm-project/clang/test/PCH/Inputs/
H A Dtypo.hpp4 namespace graph { namespace
/llvm-project/mlir/lib/Conversion/PDLToPDLInterp/
H A DRootOrdering.cpp48 static void contract(RootOrderingGraph &graph, ArrayRef<Value> cycle, in contract()
120 OptimalBranching::OptimalBranching(RootOrderingGraph graph, Value root) in OptimalBranching()
H A DPredicateTree.cpp422 static void buildCostGraph(ArrayRef<Value> roots, RootOrderingGraph &graph, in buildCostGraph() argument
621 RootOrderingGraph graph; in buildPredicateList() local
[all...]
/llvm-project/mlir/unittests/Conversion/PDLToPDLInterp/
H A DRootOrderingTest.cpp68 RootOrderingGraph graph; member in __anon5068ed4f0111::RootOrderingTest
/llvm-project/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py562 visit_begin_graph(self, graph) global() argument
1027 explore(self, graph, visitor) global() argument
1047 trim(self, graph) global() argument
1074 parse_target_node(node, graph) global() argument
1086 parse_target_nodes(target_nodes, graph) global() argument
1092 trim(self, graph) global() argument
[all...]
/llvm-project/clang-tools-extra/test/clang-tidy/checkers/hicpp/
H A Dsigned-bitwise-standard-types.h34 graph = alnum | punct enumerator
/llvm-project/third-party/unittest/googlemock/src/
H A Dgmock-matchers.cc126 explicit MaxBipartiteMatchState(const MatchMatrix& graph) in MaxBipartiteMatchState()
/llvm-project/clang/test/Analysis/
H A Dtaint-generic.c1085 int graph = isgraph(c); testIsFunctions() local
/llvm-project/libcxx/src/
H A Dlocale.cpp700 const ctype_base::mask ctype_base::graph; member in ctype_base