Searched refs:inEdges (Results 1 – 4 of 4) sorted by relevance
| /llvm-project-15.0.7/llvm/unittests/XRay/ |
| H A D | GraphTest.cpp | 113 const auto &IE = G.inEdges(EV.first.second); in graphEdgeTester()
121 G.inEdges(EV.first.second).begin(), G.inEdges(EV.first.second).end(), in graphEdgeTester()
127 G.inEdges(EV.first.first).begin(), G.inEdges(EV.first.first).end(), in graphEdgeTester()
222 EXPECT_EQ(0u, G.inEdges(0u).size()); in TEST()
223 EXPECT_TRUE(G.inEdges(0u).empty()); in TEST()
224 EXPECT_EQ(G.inEdges(0u).begin(), G.inEdges(0u).end()); in TEST()
253 EXPECT_EQ(1u, G.inEdges(0u).size()); in TEST()
254 EXPECT_FALSE(G.inEdges(0u).empty()); in TEST()
255 EXPECT_NE(G.inEdges(0u).begin(), G.inEdges(0u).end()); in TEST()
257 EXPECT_EQ(2u, G.inEdges(0u).begin()->second.EA); in TEST()
[all …]
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Transforms/ |
| H A D | LoopFusion.cpp | 233 if (inEdges.count(id) > 0) { in removeNode()
247 inEdges.erase(id); in removeNode()
298 assert(inEdges.count(dstId) > 0); in removeEdge()
305 for (auto *it = inEdges[dstId].begin(); it != inEdges[dstId].end(); ++it) { in removeEdge()
307 inEdges[dstId].erase(it); in removeEdge()
354 if (inEdges.count(id) > 0) in getIncomingMemRefAccesses()
468 if (inEdges.count(srcId) > 0) { in updateEdges()
507 if (inEdges.count(sibId) > 0) { in updateEdges()
545 if (inEdges.count(id) > 0) in forEachMemRefInputEdge()
580 if (it != inEdges.end()) { in print()
[all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/XRay/ |
| H A D | Graph.h | 371 InOutEdgeView<false, false> inEdges(const VertexIdentifier I) { in inEdges() function
375 InOutEdgeView<true, false> inEdges(const VertexIdentifier I) const { in inEdges() function
|
| /llvm-project-15.0.7/llvm/tools/llvm-xray/ |
| H A D | xray-graph.cpp | 314 for (auto &E : G.inEdges(V.first)) { in calculateVertexStatistics()
|