| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_reachability_test.cc | 61 EXPECT_TRUE(reachability.IsReachable(a, a)); in TEST_F()
62 EXPECT_TRUE(reachability.IsReachable(a, b)); in TEST_F()
63 EXPECT_TRUE(reachability.IsReachable(a, c)); in TEST_F()
64 EXPECT_TRUE(reachability.IsReachable(a, d)); in TEST_F()
65 EXPECT_TRUE(reachability.IsReachable(a, e)); in TEST_F()
67 EXPECT_FALSE(reachability.IsReachable(b, a)); in TEST_F()
68 EXPECT_TRUE(reachability.IsReachable(b, b)); in TEST_F()
69 EXPECT_FALSE(reachability.IsReachable(b, c)); in TEST_F()
70 EXPECT_TRUE(reachability.IsReachable(b, d)); in TEST_F()
71 EXPECT_FALSE(reachability.IsReachable(b, e)); in TEST_F()
[all …]
|
| D | hlo_reachability.h | 126 bool IsReachable(const HloInstruction* a, const HloInstruction* b) const { in IsReachable() function
127 return IsReachable(GetIndex(a), GetIndex(b)); in IsReachable()
129 bool IsReachable(Index a, Index b) const { return GetBitVector(b).Get(a.v); } in IsReachable() function
139 return IsReachable(a, b) || IsReachable(b, a); in IsConnected()
|
| /external/tensorflow/tensorflow/compiler/mlir/hlo/lib/utils/ |
| D | cycle_detector_test.cc | 59 TEST_F(GraphCyclesTest, IsReachable) { in TEST_F() argument
65 EXPECT_TRUE(g_.IsReachable(1, 5)); in TEST_F()
66 EXPECT_FALSE(g_.IsReachable(5, 1)); in TEST_F()
|
| /external/openscreen/third_party/abseil/src/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
107 if (gc->IsReachable(Get(id, a), Get(id, b))) { in PrintGCTransitiveClosure()
121 bool gc_reachable = gc->IsReachable(Get(id, a), Get(id, b)); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
260 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
290 graph_cycles.IsReachable(Get(id, nodes[from]), Get(id, nodes[to])); in TEST()
|
| /external/libtextclassifier/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
107 if (gc->IsReachable(Get(id, a), Get(id, b))) { in PrintGCTransitiveClosure()
121 bool gc_reachable = gc->IsReachable(Get(id, a), Get(id, b)); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
260 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
290 graph_cycles.IsReachable(Get(id, nodes[from]), Get(id, nodes[to])); in TEST()
|
| /external/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
107 if (gc->IsReachable(Get(id, a), Get(id, b))) { in PrintGCTransitiveClosure()
121 bool gc_reachable = gc->IsReachable(Get(id, a), Get(id, b)); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
260 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
290 graph_cycles.IsReachable(Get(id, nodes[from]), Get(id, nodes[to])); in TEST()
|
| /external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
107 if (gc->IsReachable(Get(id, a), Get(id, b))) { in PrintGCTransitiveClosure()
121 bool gc_reachable = gc->IsReachable(Get(id, a), Get(id, b)); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
260 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
290 graph_cycles.IsReachable(Get(id, nodes[from]), Get(id, nodes[to])); in TEST()
|
| D | graphcycles.h | 96 bool IsReachable(GraphId source_node, GraphId dest_node) const;
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
107 if (gc->IsReachable(Get(id, a), Get(id, b))) { in PrintGCTransitiveClosure()
121 bool gc_reachable = gc->IsReachable(Get(id, a), Get(id, b)); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
260 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
290 graph_cycles.IsReachable(Get(id, nodes[from]), Get(id, nodes[to])); in TEST()
|
| /external/angle/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
107 if (gc->IsReachable(Get(id, a), Get(id, b))) { in PrintGCTransitiveClosure()
121 bool gc_reachable = gc->IsReachable(Get(id, a), Get(id, b)); in CheckTransitiveClosure()
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
260 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
290 graph_cycles.IsReachable(Get(id, nodes[from]), Get(id, nodes[to])); in TEST()
|
| /external/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| D | graphcycles_test.cc | 44 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
54 IsReachable(edges, edge->to, to, seen)) { in IsReachable()
101 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
116 if (gc->IsReachable(a, b)) { in PrintGCTransitiveClosure()
132 bool gc_reachable = gc->IsReachable(a, b); in CheckTransitiveClosure()
134 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
278 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
307 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
308 bool gc_reachable = graph_cycles.IsReachable(nodes[from], nodes[to]); in TEST()
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/reduce/ |
| D | structured_construct_to_block_reduction_opportunity_finder.cpp | 80 if (!context->IsReachable(block)) { in GetAvailableOpportunities()
86 if (!context->IsReachable(*merge_block)) { in GetAvailableOpportunities()
172 if (!context->IsReachable(*context->cfg()->block(pred))) { in HasUnreachablePredecessor()
|
| D | structured_loop_to_selection_reduction_opportunity.cpp | 30 return loop_construct_header_->GetLabel()->context()->IsReachable( in PreconditionHolds()
79 if (!context_->IsReachable(*context_->cfg()->block(pred))) { in RedirectToClosestMergeBlock()
|
| /external/deqp-deps/SPIRV-Tools/test/fuzz/ |
| D | fuzzer_pass_test.cpp | 87 ASSERT_TRUE(dominator_analysis->IsReachable(5)); in TEST()
88 ASSERT_FALSE(dominator_analysis->IsReachable(8)); in TEST()
|
| /external/swiftshader/third_party/SPIRV-Tools/test/fuzz/ |
| D | fuzzer_pass_test.cpp | 87 ASSERT_TRUE(dominator_analysis->IsReachable(5)); in TEST()
88 ASSERT_FALSE(dominator_analysis->IsReachable(8)); in TEST()
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/test/fuzz/ |
| D | fuzzer_pass_test.cpp | 87 ASSERT_TRUE(dominator_analysis->IsReachable(5)); in TEST()
88 ASSERT_FALSE(dominator_analysis->IsReachable(8)); in TEST()
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/ |
| D | dominator_analysis.h | 78 inline bool IsReachable(const BasicBlock* node) const { in IsReachable() function
84 inline bool IsReachable(uint32_t node_id) const { in IsReachable() function
|
| D | block_merge_pass.cpp | 32 if (context()->IsReachable(*bi) && in MergeBlocks()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | dominator_analysis.h | 78 inline bool IsReachable(const BasicBlock* node) const { in IsReachable() function
84 inline bool IsReachable(uint32_t node_id) const { in IsReachable() function
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | dominator_analysis.h | 78 inline bool IsReachable(const BasicBlock* node) const { in IsReachable() function
84 inline bool IsReachable(uint32_t node_id) const { in IsReachable() function
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/fuzz/ |
| D | fuzzer_pass_propagate_instructions_down.cpp | 34 if (GetIRContext()->IsReachable(block)) { in Apply()
|
| /external/deqp-deps/SPIRV-Tools/source/fuzz/ |
| D | fuzzer_pass_propagate_instructions_down.cpp | 37 if (GetIRContext()->GetDominatorAnalysis(&function)->IsReachable( in Apply()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | fuzzer_pass_propagate_instructions_down.cpp | 37 if (GetIRContext()->GetDominatorAnalysis(&function)->IsReachable( in Apply()
|
| /external/deqp-deps/SPIRV-Tools/source/reduce/ |
| D | structured_loop_to_selection_reduction_opportunity.cpp | 33 ->IsReachable(loop_construct_header_); in PreconditionHolds()
82 ->IsReachable(pred)) { in RedirectToClosestMergeBlock()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| D | structured_loop_to_selection_reduction_opportunity.cpp | 33 ->IsReachable(loop_construct_header_); in PreconditionHolds()
82 ->IsReachable(pred)) { in RedirectToClosestMergeBlock()
|