Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 255) sorted by relevance

1234567891011

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_scheduler.c442 return graph->node + graph->n; in graph_find_node()
700 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || in graph_alloc()
726 if (graph->root == graph) in clear_node()
1213 node = &graph->node[graph->n]; in add_node()
1590 graph->root = graph; in graph_init()
1614 data.graph = graph; in graph_init()
1637 f = graph_has_any_edge(graph, &graph->node[j], &graph->node[i]); in node_follows_weak()
4235 if (graph != graph->root) in graph_find_compressed_node()
5503 if (graph->scc < graph->n) { in sort_statements()
6171 data.graph = graph; in mark_merge_sccs()
[all …]
/llvm-project-15.0.7/mlir/unittests/Conversion/PDLToPDLInterp/
H A DRootOrderingTest.cpp68 RootOrderingGraph graph; member in __anon21f69a4c0111::RootOrderingTest
76 graph[v[1]][v[0]].cost = {1, 10}; in TEST_F()
77 graph[v[2]][v[0]].cost = {1, 11}; in TEST_F()
78 graph[v[1]][v[2]].cost = {2, 12}; in TEST_F()
79 graph[v[2]][v[1]].cost = {2, 13}; in TEST_F()
84 graph[v[1]][v[0]].cost = {1, 10}; in TEST_F()
85 graph[v[2]][v[0]].cost = {2, 11}; in TEST_F()
105 graph[v[2]][v[0]].cost = {5, 0}; in TEST_F()
106 graph[v[2]][v[1]].cost = {1, 0}; in TEST_F()
107 graph[v[3]][v[2]].cost = {2, 0}; in TEST_F()
[all …]
/llvm-project-15.0.7/libcxx/utils/
H A Dgraph_header_deps.py91 def explore(graph, h1): argument
95 explore(graph, h2)
96 explore(graph, h1)
106 graph = {}
111 if fname not in graph:
115 for fname, entry in graph.items():
117 return graph
127 def get_graphviz(graph, options): argument
202 for fname in list(graph.keys()):
204 graph[fname].includes = [h for h in graph[fname].includes if should_keep(h)]
[all …]
/llvm-project-15.0.7/mlir/lib/Conversion/PDLToPDLInterp/
H A DRootOrdering.cpp48 static void contract(RootOrderingGraph &graph, ArrayRef<Value> cycle, in contract() argument
57 for (auto outer = graph.begin(), e = graph.end(); outer != e; ++outer) { in contract()
87 graph.erase(outer); in contract()
117 graph[rep] = std::move(repEntries); in contract()
120 OptimalBranching::OptimalBranching(RootOrderingGraph graph, Value root) in OptimalBranching() argument
121 : graph(std::move(graph)), root(root) {} in OptimalBranching()
132 parentDepths.reserve(graph.size()); in solve()
137 for (const auto &outer : graph) { in solve()
147 auto it = graph.find(node); in solve()
148 assert(it != graph.end() && "the graph is not strongly connected"); in solve()
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-xray/X86/
H A Dgraph-simple-case.yaml1 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml \
3 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -e count \
6 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -e min \
8 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -e med \
10 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -e 90p \
12 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -e 99p \
14 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -e max \
16 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -e sum \
H A Dgraph-deduce-tail-call.yaml1 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d \
3 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d -e count \
6 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d -e min \
8 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d -e med \
10 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d -e 90p \
12 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d -e 99p \
14 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d -e max \
16 #RUN: llvm-xray graph %s -o - -m %S/Inputs/simple-instrmap.yaml -d -e sum \
H A Dgraph-diff-simple.txt1 #RUN: llvm-xray graph-diff -o - -c min -b min -m %S/Inputs/simple-instrmap.yaml \
2 #RUN: %S/Inputs/graph-diff-A.yaml %S/Inputs/graph-diff-B.yaml \
4 #RUN: llvm-xray graph-diff -o - -c min -m %S/Inputs/simple-instrmap.yaml \
5 #RUN: %S/Inputs/graph-diff-A.yaml %S/Inputs/graph-diff-B.yaml \
7 #RUN: llvm-xray graph-diff -o - -b min -m %S/Inputs/simple-instrmap.yaml \
8 #RUN: %S/Inputs/graph-diff-A.yaml %S/Inputs/graph-diff-B.yaml \
11 #RUN: %S/Inputs/graph-diff-A.yaml %S/Inputs/graph-diff-B.yaml \
14 #RUN: %S/Inputs/graph-diff-A.yaml %S/Inputs/graph-diff-B.yaml \
17 #RUN: %S/Inputs/graph-diff-A.yaml %S/Inputs/graph-diff-B.yaml \
20 #RUN: %S/Inputs/graph-diff-A.yaml %S/Inputs/graph-diff-B.yaml \
[all …]
/llvm-project-15.0.7/libcxx/test/std/localization/locale.categories/category.ctype/locale.ctype.byname/
H A Dis_many.pass.cpp52 assert( (m[0] & F::graph)); in main()
66 assert(!(m[1] & F::graph)); in main()
80 assert( (m[2] & F::graph)); in main()
94 assert(!(m[3] & F::graph)); in main()
108 assert( (m[4] & F::graph)); in main()
122 assert( (m[5] & F::graph)); in main()
136 assert( (m[6] & F::graph)); in main()
164 assert( (m[0] & F::graph)); in main()
170 assert(!(m[0] & F::graph)); in main()
185 assert(!(m[1] & F::graph)); in main()
[all …]
/llvm-project-15.0.7/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py484 self._graph = graph
907 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
920 def trim(self, graph): argument
922 node_id = graph.root_id
936 graph.nodes = {node_id: graph.nodes[node_id]
964 def trim(self, graph): argument
975 graph.nodes = {node_id: graph.nodes[node_id]
977 for node_id in graph.nodes:
1029 graph = ExplodedGraph()
1048 trimmer.trim(graph)
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-readobj/ELF/
H A Dcall-graph-profile.test31 - Name: .llvm.call-graph-profile
37 - Name: .rel.llvm.call-graph-profile
39 Info: .llvm.call-graph-profile
95 - Name: .llvm.call-graph-profile
103 Info: .llvm.call-graph-profile
151 - Name: .llvm.call-graph-profile
182 - Name: .llvm.call-graph-profile
189 Info: .llvm.call-graph-profile
231 - Name: .llvm.call-graph-profile
238 Info: .llvm.call-graph-profile
[all …]
/llvm-project-15.0.7/libc/benchmarks/
H A Dlibc-benchmark-analysis.py366 graph = sns.lineplot(data=df, palette="muted", ci=95)
67 graph.set_title(id)
68 graph.yaxis.set_major_formatter(EngFormatter(unit=FormatterUnit))
69 graph.yaxis.set_label_text(Label)
70 graph.xaxis.set_major_formatter(EngFormatter(unit="B"))
71 graph.xaxis.set_label_text("Copy Size")
94 …graph = sns.violinplot(data=df, x="distribution", y=mode, palette="muted", hue="label", order=sort…
95 graph.set_title(id)
96 graph.yaxis.set_major_formatter(EngFormatter(unit=FormatterUnit))
97 graph.yaxis.set_label_text(Label)
/llvm-project-15.0.7/llvm/test/Transforms/OpenMP/
H A Dparallel_deletion_cg_update.ll3 ; CHECK: Call graph node <<null function>><<{{.*}}>> #uses=0
11 ; CHECK: Call graph node for function: '.omp_outlined..0'<<{{.*}}>> #uses=1
13 ; CHECK: Call graph node for function: '.omp_outlined..1'<<{{.*}}>> #uses=3
16 ; CHECK: Call graph node for function: '__kmpc_fork_call'<<{{.*}}>> #uses=3
19 ; CHECK: Call graph node for function: 'd'<<{{.*}}>> #uses=2
22 ; CHECK: Call graph node for function: 'dead_fork_call'<<{{.*}}>> #uses=1
24 ; CHECK: Call graph node for function: 'dead_fork_call2'<<{{.*}}>> #uses=0
28 ; CHECK: Call graph node for function: 'live_fork_call'<<{{.*}}>> #uses=1
/llvm-project-15.0.7/llvm/test/Analysis/CallGraph/
H A Dignore-assumelike-calls.ll2 ; CHECK: Call graph node <<null function>><<{{.*}}>> #uses=0
6 ; CHECK-NEXT: Call graph node for function: 'cast_only'<<{{.*}}>> #uses=1
8 ; CHECK-NEXT: Call graph node for function: 'llvm.lifetime.start.p0i8'<<{{.*}}>> #uses=1
10 ; CHECK-NEXT: Call graph node for function: 'used_by_lifetime'<<{{.*}}>> #uses=0
H A Dllvm-used.ll8 ; CHECK: Call graph node <<null function>><<{{.*}}>> #uses=0
13 ; CHECK-NEXT: Call graph node for function: 'unused'<<{{.*}}>> #uses=1
15 ; CHECK-NEXT: Call graph node for function: 'used1'<<{{.*}}>> #uses=1
17 ; CHECK-NEXT: Call graph node for function: 'used2'<<{{.*}}>> #uses=1
/llvm-project-15.0.7/libcxx/test/std/localization/locale.categories/category.ctype/locale.ctype/locale.ctype.members/
H A Dis_many.pass.cpp49 assert(!(m[0] & F::graph)); in main()
63 assert( (m[1] & F::graph)); in main()
77 assert(!(m[2] & F::graph)); in main()
91 assert( (m[3] & F::graph)); in main()
105 assert( (m[4] & F::graph)); in main()
119 assert( (m[5] & F::graph)); in main()
/llvm-project-15.0.7/libcxx/test/std/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/
H A Dis_many.pass.cpp47 assert(!(m[0] & F::graph)); in main()
61 assert( (m[1] & F::graph)); in main()
75 assert(!(m[2] & F::graph)); in main()
89 assert( (m[3] & F::graph)); in main()
103 assert( (m[4] & F::graph)); in main()
117 assert( (m[5] & F::graph)); in main()
/llvm-project-15.0.7/llvm/docs/DependenceGraphs/
H A Dindex.rst23 dependencies between individual instructions. Each node in such a graph
29 As described in [1]_ the DDG uses graph abstraction to group nodes
30 that are part of a strongly connected component of the graph
33 connected component of the graph is a maximal subgraph of all the nodes
81 The graph build algorithm considers dependencies between elements of
90 design pattern to isolate the construction of the dependence graph
94 pattern as it applies to the dependence graph implementation.
100 and ``PDGBuilder`` control some aspects of how the graph is constructed
112 - Builder allows graph construction code to be reused for DDG and PDG.
130 graph described in [1]_ in the following ways:
[all …]
/llvm-project-15.0.7/lld/test/ELF/
H A Dcgprofile-rela.test2 ## Test that LLD can handle call graph profile data relocated with RELA relocations.
8 # RUN: ld.lld --no-call-graph-profile-sort %t.o -o %t
50 - Name: .llvm.call-graph-profile
62 - Name: .rela.llvm.call-graph-profile
64 Info: .llvm.call-graph-profile
/llvm-project-15.0.7/llvm/test/ExecutionEngine/JITLink/X86/
H A DCOFF_comdat_associative.test7 # CHECK: Creating graph symbols...
8 # CHECK: 2: Creating defined graph symbol for COFF symbol ".text" in .text (index: 2)
10 # CHECK-NEXT: 4: Exporting COMDAT graph symbol for COFF symbol "func" in section 2
12 # CHECK-NEXT: 5: Creating defined graph symbol for COFF symbol ".xdata" in .xdata (index: 3)
H A DCOFF_comdat_weak.s7 # CHECK: Creating graph symbols...
8 # CHECK: 6: Creating defined graph symbol for COFF symbol ".text" in .text (index: 4)
10 # CHECK-NEXT: 8: Exporting COMDAT graph symbol for COFF symbol "func" in section 4
H A DCOFF_weak_external.s7 # CHECK: Creating graph symbols...
8 # CHECK: 8: Creating defined graph symbol for COFF symbol ".weak.func.default.main" in .text (…
10 # CHECK-NEXT: 9: Creating defined graph symbol for COFF symbol "main" in .text (index: 1)
H A DCOFF_duplicate_externals.test10 # CHECK: Creating graph symbols...
11 # CHECK: 3: Creating external graph symbol for COFF symbol "func" in (external) (index: 0)
12 # CHECK-NEXT: 4: Creating external graph symbol for COFF symbol "func" in (external) (index: 0)
H A DCOFF_comdat_any.test7 # CHECK: Creating graph symbols...
8 # CHECK: 2: Creating defined graph symbol for COFF symbol ".text" in .text (index: 2)
10 # CHECK-NEXT: 4: Exporting COMDAT graph symbol for COFF symbol "func" in section 2
H A DCOFF_comdat_largest.test7 # CHECK: Creating graph symbols...
8 # CHECK: 2: Creating defined graph symbol for COFF symbol ".text" in .text (index: 2)
10 # CHECK-NEXT: 4: Exporting COMDAT graph symbol for COFF symbol "func" in section 2
/llvm-project-15.0.7/libcxx/test/std/re/re.traits/
H A Dlookup_classname.pass.cpp120 test("graph", std::ctype_base::graph); in main()
121 test("GRAPH", std::ctype_base::graph); in main()
122 test("graph", std::ctype_base::graph, true); in main()
123 test("Graph", std::ctype_base::graph, true); in main()
209 test(L"graph", std::ctype_base::graph); in main()
210 test(L"GRAPH", std::ctype_base::graph); in main()
211 test(L"graph", std::ctype_base::graph, true); in main()
212 test(L"Graph", std::ctype_base::graph, true); in main()

1234567891011