Searched refs:findPath (Results 1 – 2 of 2) sorted by relevance
| /llvm-project/compiler-rt/lib/sanitizer_common/tests/ |
| H A D | sanitizer_bvgraph_test.cpp | 95 if (g.findPath(from, target, path, len) == len) in BasicTest()
198 EXPECT_EQ(g.findPath(f0, target, path, ARRAY_SIZE(path)), 3U); in Test_isReachable()
202 EXPECT_EQ(g.findPath(f1, target, path, ARRAY_SIZE(path)), 2U); in Test_isReachable()
253 EXPECT_EQ(g.findPath(start, target, path, g.size()), i - start + 1); in LongCycle()
283 EXPECT_EQ(0U, g.findPath(1, t7, path, 1)); in ShortestPath()
285 EXPECT_EQ(2U, g.findPath(1, t7, path, 2)); in ShortestPath()
286 EXPECT_EQ(2U, g.findPath(1, t7, path, 3)); in ShortestPath()
287 EXPECT_EQ(2U, g.findPath(1, t7, path, 4)); in ShortestPath()
288 EXPECT_EQ(2U, g.findPath(1, t7, path, 5)); in ShortestPath()
289 EXPECT_EQ(2U, g.findPath(1, t7, path, 6)); in ShortestPath()
[all …]
|
| /llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_bvgraph.h | 127 uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) { in findPath() function
137 if (uptr res = findPath(idx, targets, path + 1, path_size - 1)) in findPath()
147 if (findPath(from, targets, path, p) == p) in findShortestPath()
|