Searched refs:hasEdge (Results 1 - 7 of 7) sorted by relevance
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
H A D | sanitizer_bvgraph_test.cc | 36 fprintf(stderr, "%d", g.hasEdge(i, j)); 88 EXPECT_TRUE(g.hasEdge(from, to)); 323 EXPECT_TRUE(g.hasEdge(1, 4)); 324 EXPECT_FALSE(g.hasEdge(1, 5)); 329 EXPECT_TRUE(g.hasEdge(2, 4)); 330 EXPECT_FALSE(g.hasEdge(2, 5)); 331 EXPECT_TRUE(g.hasEdge(3, 4)); 332 EXPECT_FALSE(g.hasEdge(3, 5));
|
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
H A D | sanitizer_bvgraph.h | 69 bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); } function 104 bool hasEdge(uptr from, uptr to) const { function
|
H A D | sanitizer_deadlock_detector.h | 232 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) 354 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2)); 358 return g_.hasEdge(idx1, idx2); 364 if (g_.hasEdge(from, to))
|
/netbsd-current/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
H A D | sanitizer_bvgraph.h | 67 bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); } function 102 bool hasEdge(uptr from, uptr to) const { function
|
H A D | sanitizer_deadlock_detector.h | 230 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) 352 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2)); 356 return g_.hasEdge(idx1, idx2); 362 if (g_.hasEdge(from, to))
|
/netbsd-current/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
H A D | sanitizer_bvgraph.h | 68 bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); } function 103 bool hasEdge(uptr from, uptr to) const { function
|
H A D | sanitizer_deadlock_detector.h | 228 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) 348 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2)); 352 return g_.hasEdge(idx1, idx2); 358 if (g_.hasEdge(from, to))
|
Completed in 234 milliseconds