| /external/tensorflow/tensorflow/core/graph/ |
| D | graph_constructor_test.cc | 122 bool HasEdge(const string& src, int src_out, const string& dst, int dst_in) { in HasEdge() function in tensorflow::__anon33ca91010111::GraphConstructorTest
133 return HasEdge(src, Graph::kControlSlot, dst, Graph::kControlSlot); in HasControlEdge()
866 EXPECT_TRUE(HasEdge("W1", 0, "t1", 0)); in TEST_F()
867 EXPECT_TRUE(HasEdge("input", 1, "t1", 1)); in TEST_F()
880 EXPECT_TRUE(HasEdge("W1", 0, "t1", 0)); in TEST_F()
881 EXPECT_TRUE(HasEdge("input", 1, "t1", 1)); in TEST_F()
882 EXPECT_TRUE(HasEdge("W1", 0, "t2", 0)); in TEST_F()
883 EXPECT_TRUE(HasEdge("input", 1, "t2", 1)); in TEST_F()
943 EXPECT_TRUE(HasEdge("A", 0, "B", 0)); in TEST_F()
944 EXPECT_TRUE(HasEdge("B", 1, "C", 0)); in TEST_F()
[all …]
|
| D | subgraph_test.cc | 95 bool HasEdge(const string& src, int src_out, const string& dst, int dst_in) { in HasEdge() function in tensorflow::__anon58a5c0460111::SubgraphTest
104 return HasEdge(src, Graph::kControlSlot, dst, Graph::kControlSlot); in HasControlEdge()
308 EXPECT_TRUE(HasEdge("a", 0, "b", 0)); in TEST_F()
309 EXPECT_TRUE(HasEdge("b", 0, "_send_b_0", 0)); in TEST_F()
310 EXPECT_TRUE(HasEdge("_recv_c_0", 0, "d", 0)); in TEST_F()
311 EXPECT_TRUE(HasEdge("d", 0, "e", 0)); in TEST_F()
312 EXPECT_TRUE(HasEdge("e", 0, "_send_e_0", 0)); in TEST_F()
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| D | graphcycles_test.cc | 84 if (gc->HasEdge(a, b)) { in PrintGCEdges()
152 if (!gc->HasEdge(a, b)) { in CheckEdges()
162 if (gc->HasEdge(a, b)) { in CheckEdges()
321 ASSERT_TRUE(graph_cycles.HasEdge(path[i - 1], path[i])); in TEST()
484 EXPECT_TRUE(g_.HasEdge(1, 3)); in TEST_F()
488 EXPECT_TRUE(g_.HasEdge(1, 3)); in TEST_F()
489 EXPECT_TRUE(g_.HasEdge(1, 4)); in TEST_F()
490 EXPECT_TRUE(g_.HasEdge(3, 4)); in TEST_F()
494 EXPECT_TRUE(g_.HasEdge(1, 4)); in TEST_F()
|
| D | graphcycles.h | 80 bool HasEdge(int32 source_node, int32 dest_node) const;
|
| D | graphcycles.cc | 146 bool GraphCycles::HasEdge(int32 x, int32 y) const { in HasEdge() function in tensorflow::GraphCycles
358 CHECK(HasEdge(a, b)) << "No edge exists from " << a << " to " << b; in CanContractEdge()
368 CHECK(HasEdge(a, b)); in ContractEdge()
|
| /external/googletest/googlemock/src/ |
| D | gmock-matchers.cc | 185 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
276 ss << HasEdge(i, j); in DebugString()
379 char matched = matrix.HasEdge(ilhs, irhs); in VerifyMatchMatrix()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googlemock/src/ |
| D | gmock-matchers.cc | 263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
388 ss << HasEdge(i, j); in DebugString()
454 char matched = matrix.HasEdge(ilhs, irhs); in VerifyAllElementsAndMatchersAreMatched()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/ |
| D | DomTreeUpdater.cpp | 34 const bool HasEdge = llvm::any_of( in isUpdateValid() local
41 if (Kind == DominatorTree::Insert && !HasEdge) in isUpdateValid()
45 if (Kind == DominatorTree::Delete && HasEdge) in isUpdateValid()
|
| D | Dominators.cpp | 526 bool HasEdge = std::any_of(succ_begin(From), succ_end(From), in applyUpdate() local
528 if (Kind == DominatorTree::Insert && !HasEdge) in applyUpdate()
530 if (Kind == DominatorTree::Delete && HasEdge) in applyUpdate()
|
| /external/googletest/googlemock/test/ |
| D | gmock-matchers_test.cc | 6042 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
6100 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googlemock/include/gmock/ |
| D | gmock-matchers.h | 3273 bool HasEdge(size_t ilhs, size_t irhs) const {
|
| /external/googletest/googlemock/include/gmock/ |
| D | gmock-matchers.h | 2849 bool HasEdge(size_t ilhs, size_t irhs) const {
|