| /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.cc | 68 bool HloReachabilityMap::IsReachable(const HloInstruction* a, in IsReachable() function in xla::HloReachabilityMap
75 return IsReachable(a, b) || IsReachable(b, a); in IsConnected()
|
| D | multi_output_fusion.cc | 272 if (reachability_->IsReachable(instr2, instr) && in UpdateReachability()
273 reachability_->IsReachable(instr1, instr)) { in UpdateReachability()
277 if (reachability_->IsReachable(instr2, instr)) { in UpdateReachability()
280 if (reachability_->IsReachable(instr1, instr)) { in UpdateReachability()
|
| D | hlo_ordering.cc | 312 return a != b && predecessors_.at(a->parent())->IsReachable(a, b); in ExecutesBeforeInSameComputation()
326 ->IsReachable(predecessor, instruction)) { in ToStringHelper()
|
| D | hlo_reachability.h | 93 bool IsReachable(const HloInstruction* a, const HloInstruction* b) const;
|
| D | instruction_fusion.cc | 215 if (!reachability_->IsReachable(producer, consumer_operand)) { in CanFuseOnAllPaths()
585 reachability_->IsReachable(producer, operand)) { in MultiOutputFusionCreatesCycle()
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| D | graphcycles_test.cc | 43 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()
|
| D | graphcycles.h | 93 bool IsReachable(int32 source_node, int32 dest_node) const;
|
| /external/v8/src/compiler/ |
| D | all-nodes.h | 30 return IsReachable(node); in IsLive()
33 bool IsReachable(const Node* node) 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
|
| D | loop_descriptor.cpp | 272 if (dom_analysis->IsReachable(bb) && in IsBasicBlockInLoopSlow()
517 if (dom_analysis->IsReachable(pid) && in PopulateList()
|
| /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
|
| D | loop_descriptor.cpp | 272 if (dom_analysis->IsReachable(bb) && in IsBasicBlockInLoopSlow()
517 if (dom_analysis->IsReachable(pid) && in PopulateList()
|
| /external/tensorflow/tensorflow/compiler/xla/service/gpu/ |
| D | multi_output_fusion.cc | 182 reachability()->IsReachable(producer, operand); in DoProducerConsumerMultiOutputFusion()
202 reachability()->IsReachable(producer, operand); in DoProducerConsumerMultiOutputFusion()
|
| /external/toolchain-utils/crosperf/ |
| D | machine_manager.py | 69 if not self.IsReachable():
79 def IsReachable(self): member in CrosMachine
631 def IsReachable(self): member in MockCrosMachine
664 if cm.IsReachable():
|
| D | benchmark_run.py | 141 if not self.machine.IsReachable():
|
| D | machine_manager_unittest.py | 732 result = cm.IsReachable()
739 result = cm.IsReachable()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| D | structured_loop_to_selection_reduction_opportunity.cpp | 34 ->IsReachable(loop_construct_header_); in PreconditionHolds()
85 ->IsReachable(pred)) { in RedirectToClosestMergeBlock()
|
| /external/deqp-deps/SPIRV-Tools/source/reduce/ |
| D | structured_loop_to_selection_reduction_opportunity.cpp | 32 ->IsReachable(loop_construct_header_); in PreconditionHolds()
83 ->IsReachable(pred)) { in RedirectToClosestMergeBlock()
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 571 if (IsReachable(TargetSU, SU)) in WillCreateCycle()
576 IsReachable(TargetSU, I->getSUnit())) in WillCreateCycle()
582 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable() function in ScheduleDAGTopologicalSort
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 603 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/ |
| D | ScheduleDAG.cpp | 681 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/clang/lib/Sema/ |
| D | JumpDiagnostics.cpp | 731 bool IsReachable = false; in VerifyIndirectJumps() local
738 IsReachable = true; in VerifyIndirectJumps()
753 if (IsReachable) continue; in VerifyIndirectJumps()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 213 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable() function in __anonacd034f10111::ScheduleDAGRRList
214 return Topo.IsReachable(SU, TargetSU); in IsReachable()
2838 scheduleDAG->IsReachable(DepSU, SuccPred.getSUnit())) in canClobberReachingPhysRegUse()
2847 scheduleDAG->IsReachable(DepSU, SuccPred.getSUnit())) in canClobberReachingPhysRegUse()
2979 if (scheduleDAG->IsReachable(&SU, PredSuccSU)) in PrescheduleNodesWithMultipleUses()
3076 !scheduleDAG->IsReachable(SuccSU, &SU)) { in AddPseudoTwoAddrDeps()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 186 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable() function in __anone1ddf7990111::ScheduleDAGRRList
187 return Topo.IsReachable(SU, TargetSU); in IsReachable()
2711 scheduleDAG->IsReachable(DepSU, SuccPred.getSUnit())) in canClobberReachingPhysRegUse()
2720 scheduleDAG->IsReachable(DepSU, SuccPred.getSUnit())) in canClobberReachingPhysRegUse()
2853 if (scheduleDAG->IsReachable(&SU, PredSuccSU)) in PrescheduleNodesWithMultipleUses()
2949 !scheduleDAG->IsReachable(SuccSU, &SU)) { in AddPseudoTwoAddrDeps()
|