Home
last modified time | relevance | path

Searched refs:vertices (Results 1 – 13 of 13) sorted by relevance

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_vertices.c31 if (!vertices) in isl_vertices_copy()
42 if (!vertices) in isl_vertices_free()
55 free(vertices->c[i].vertices); in isl_vertices_free()
213 if (!vertices->v[0].vertex || !vertices->v[0].dom) in vertices_0D()
222 if (!vertices->c[0].vertices) in vertices_0D()
340 vertices = isl_morph_vertices(morph, vertices); in lower_dim_vertices()
537 vertices = compute_chambers(copy, vertices); in isl_basic_set_compute_vertices()
1101 vertex->vertices = vertices; in isl_vertex_alloc()
1148 cell->ids[i] = vertices->c[id].vertices[i]; in isl_cell_alloc()
1149 cell->vertices = vertices; in isl_cell_alloc()
[all …]
H A Disl_vertices_private.h30 int *vertices; member
50 isl_vertices *vertices; member
55 isl_vertices *vertices; member
59 isl_stat isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices,
65 __isl_take isl_vertices *vertices);
H A Disl_bernstein.c121 return vertex_is_integral(cell->vertices->v[v].vertex); in is_tight()
313 v = vertex_coordinate(cell->vertices->v[k].vertex, j, in bernstein_coefficients_cell()
376 isl_vertices *vertices; in bernstein_coefficients_base() local
399 vertices = isl_basic_set_compute_vertices(bset); in bernstein_coefficients_base()
400 if (isl_vertices_foreach_disjoint_cell(vertices, in bernstein_coefficients_base()
403 isl_vertices_free(vertices); in bernstein_coefficients_base()
H A Disl_test.c7967 isl_vertices *vertices; in test_vertices() local
7972 vertices = isl_basic_set_compute_vertices(bset); in test_vertices()
7973 n = isl_vertices_get_n_vertices(vertices); in test_vertices()
7976 if (isl_vertices_foreach_vertex(vertices, &find_vertex, in test_vertices()
7979 isl_vertices_free(vertices); in test_vertices()
10762 isl_vertices *vertices; in test_chambers() local
10767 vertices = isl_basic_set_compute_vertices(bset); in test_chambers()
10769 if (isl_vertices_foreach_disjoint_cell(vertices, &add_cell, in test_chambers()
10774 isl_vertices_free(vertices); in test_chambers()
/llvm-project-15.0.7/llvm/unittests/XRay/
H A DGraphTest.cpp69 EXPECT_FALSE(G.vertices().empty()); in graphVertexTester()
75 EXPECT_NE(G.vertices().end(), in graphVertexTester()
76 std::find_if(G.vertices().begin(), G.vertices().end(), in graphVertexTester()
81 for (auto &VVT : G.vertices()) { in graphVertexTester()
192 EXPECT_TRUE(G.vertices().empty()); in TEST()
194 EXPECT_EQ(G.vertices().begin(), G.vertices().end()); in TEST()
211 EXPECT_EQ(1u, G.vertices().size()); in TEST()
213 EXPECT_FALSE(G.vertices().empty()); in TEST()
215 EXPECT_NE(G.vertices().begin(), G.vertices().end()); in TEST()
241 EXPECT_EQ(1u, G.vertices().size()); in TEST()
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/include/isl/
H A Dvertices.h28 isl_ctx *isl_vertices_get_ctx(__isl_keep isl_vertices *vertices);
29 isl_size isl_vertices_get_n_vertices(__isl_keep isl_vertices *vertices);
30 isl_stat isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices,
32 __isl_null isl_vertices *isl_vertices_free(__isl_take isl_vertices *vertices);
40 isl_stat isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices,
/llvm-project-15.0.7/llvm/test/Transforms/SLPVectorizer/X86/
H A Dcrash_bullet3.ll10 …3.595.683.727.749.815.837.991.1585.1607.1629.1651.1849.2047.2069.2091.2113* %vertices) #0 align 2 {
112 ….683.727.749.815.837.991.1585.1607.1629.1651.1849.2047.2069.2091.2113* %vertices, i64 0, i32 0, i6…
114 ….683.727.749.815.837.991.1585.1607.1629.1651.1849.2047.2069.2091.2113* %vertices, i64 0, i32 0, i6…
/llvm-project-15.0.7/llvm/tools/llvm-xray/
H A Dxray-graph-diff.cpp219 for (const auto &V : G.vertices()) { in getGraphDiffRenderer()
367 for (const auto &V : G.vertices()) { in exportGraphAsDOT()
390 for (const auto &V : G.vertices()) { in exportGraphAsDOT()
H A Dxray-graph.cpp312 for (auto &V : G.vertices()) { in calculateVertexStatistics()
340 for (auto &V : G.vertices()) { in normalizeStatistics()
420 for (const auto &V : G.vertices()) { in exportGraphAsDOT()
/llvm-project-15.0.7/llvm/include/llvm/XRay/
H A DGraph.h349 VertexView<false> vertices() { return VertexView<false>(*this); } in vertices() function
351 VertexView<true> vertices() const { return VertexView<true>(*this); } in vertices() function
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Dimplementation.tex1114 has integer vertices, then the approximation is exact, i.e.,
1115 $Q_i = P_i'$. In this case, the vertices of $\Delta'_i(\vec s)$
1447 strongly connected components in the graph with as vertices
1469 two vertices, we evaluate \eqref{eq:transitive:edge}.
1700 Otherwise, we apply Floyd-Warshall on the graph with as vertices
1702 the appropriate pairs of vertices.
1716 pass through earlier vertices since $R_{rr}$ itself has been updated
H A Duser.pod602 #include <isl/vertices.h>
604 __isl_keep isl_vertices *vertices);
9391 strongly connected components of the graph with as vertices the elements
9663 #include <isl/vertices.h>
9668 actual computation of the parametric vertices and the chamber
9671 the vertices or iterating over all the chambers or cells
9672 and then iterating over all vertices that are active on the chamber.
9675 __isl_keep isl_vertices *vertices,
9680 __isl_keep isl_vertices *vertices,
9691 __isl_keep isl_vertices *vertices);
[all …]
/llvm-project-15.0.7/llvm/docs/
H A DXRay.rst308 associated with edges and vertices.