Home
last modified time | relevance | path

Searched refs:IsReachable (Results 1 – 25 of 43) sorted by relevance

12

/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_reachability_test.cc61 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 …]
Dhlo_reachability.cc77 bool HloReachabilityMap::IsReachable(const HloInstruction* a, in IsReachable() function in xla::HloReachabilityMap
84 return IsReachable(a, b) || IsReachable(b, a); in IsConnected()
Dmulti_output_fusion.cc353 if (reachability_->IsReachable(instr2, instr) && in UpdateReachability()
354 reachability_->IsReachable(instr1, instr)) { in UpdateReachability()
358 if (reachability_->IsReachable(instr2, instr)) { in UpdateReachability()
361 if (reachability_->IsReachable(instr1, instr)) { in UpdateReachability()
Dhlo_ordering.cc338 return a != b && predecessors_.at(a->parent())->IsReachable(a, b); in ExecutesBeforeInSameComputation()
352 ->IsReachable(predecessor, instruction)) { in ToStringHelper()
Dhlo_reachability.h93 bool IsReachable(const HloInstruction* a, const HloInstruction* b) const;
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
Dgraphcycles_test.cc43 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() function
53 IsReachable(edges, edge->to, to, seen)) { in IsReachable()
100 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
115 if (gc->IsReachable(a, b)) { in PrintGCTransitiveClosure()
131 bool gc_reachable = gc->IsReachable(a, b); in CheckTransitiveClosure()
133 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
277 ASSERT_TRUE(IsReachable(&edges, nodes[to], nodes[from], &seen)) in TEST()
306 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST()
307 bool gc_reachable = graph_cycles.IsReachable(nodes[from], nodes[to]); in TEST()
Dgraphcycles.h94 bool IsReachable(int32 source_node, int32 dest_node) const;
/external/v8/src/compiler/
Dall-nodes.h30 return IsReachable(node); in IsLive()
33 bool IsReachable(const Node* node) const { in IsReachable() function
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Ddominator_analysis.h78 inline bool IsReachable(const BasicBlock* node) const { in IsReachable() function
84 inline bool IsReachable(uint32_t node_id) const { in IsReachable() function
Dblock_merge_util.cpp108 if (!dominators->IsReachable(block)) return false; in CanMergeWithSuccessor()
/external/deqp-deps/SPIRV-Tools/source/opt/
Ddominator_analysis.h78 inline bool IsReachable(const BasicBlock* node) const { in IsReachable() function
84 inline bool IsReachable(uint32_t node_id) const { in IsReachable() function
Dblock_merge_util.cpp108 if (!dominators->IsReachable(block)) return false; in CanMergeWithSuccessor()
/external/angle/third_party/spirv-tools/src/source/opt/
Ddominator_analysis.h78 inline bool IsReachable(const BasicBlock* node) const { in IsReachable() function
84 inline bool IsReachable(uint32_t node_id) const { in IsReachable() function
Dblock_merge_util.cpp108 if (!dominators->IsReachable(block)) return false; in CanMergeWithSuccessor()
/external/toolchain-utils/crosperf/
Dmachine_manager.py73 if not self.IsReachable():
83 def IsReachable(self): member in CrosMachine
642 def IsReachable(self): member in MockCrosMachine
675 if cm.IsReachable():
/external/angle/third_party/spirv-tools/src/source/reduce/
Dstructured_loop_to_selection_reduction_opportunity.cpp38 ->IsReachable(loop_construct_header_); in PreconditionHolds()
85 ->IsReachable(pred)) { in RedirectToClosestMergeBlock()
/external/deqp-deps/SPIRV-Tools/source/reduce/
Dstructured_loop_to_selection_reduction_opportunity.cpp38 ->IsReachable(loop_construct_header_); in PreconditionHolds()
85 ->IsReachable(pred)) { in RedirectToClosestMergeBlock()
/external/swiftshader/third_party/SPIRV-Tools/source/reduce/
Dstructured_loop_to_selection_reduction_opportunity.cpp38 ->IsReachable(loop_construct_header_); in PreconditionHolds()
85 ->IsReachable(pred)) { in RedirectToClosestMergeBlock()
/external/angle/third_party/spirv-tools/src/source/fuzz/
Dtransformation_move_block_down.cpp46 if (!ir_context->GetDominatorAnalysis(&function)->IsReachable( in IsApplicable()
/external/deqp-deps/SPIRV-Tools/source/fuzz/
Dtransformation_move_block_down.cpp46 if (!ir_context->GetDominatorAnalysis(&function)->IsReachable( in IsApplicable()
/external/swiftshader/third_party/SPIRV-Tools/source/fuzz/
Dtransformation_move_block_down.cpp46 if (!context->GetDominatorAnalysis(&function)->IsReachable( in IsApplicable()
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp603 if (IsReachable(SU, TargetSU)) in WillCreateCycle()
608 IsReachable(SU, I->getSUnit())) in WillCreateCycle()
614 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable() function in ScheduleDAGTopologicalSort
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DScheduleDAG.cpp681 if (IsReachable(SU, TargetSU)) in WillCreateCycle()
685 IsReachable(SU, PredDep.getSUnit())) in WillCreateCycle()
690 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable() function in ScheduleDAGTopologicalSort
/external/tensorflow/tensorflow/compiler/xla/service/gpu/
Dmulti_output_fusion.cc149 return producer != operand && reachability.IsReachable(producer, operand); in GetProducerConsumerMultiOutputFusionCandidates()
/external/clang/lib/Sema/
DJumpDiagnostics.cpp731 bool IsReachable = false; in VerifyIndirectJumps() local
738 IsReachable = true; in VerifyIndirectJumps()
753 if (IsReachable) continue; in VerifyIndirectJumps()

12