Searched refs:IsReachable (Results 1 - 5 of 5) sorted by relevance
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 604 if (IsReachable(SU, TargetSU)) 609 IsReachable(SU, I->getSUnit())) 614 /// IsReachable - Checks if SU is reachable from TargetSU. 615 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU,
|
H A D | MachineScheduler.cpp | 372 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); 379 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU))
|
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/Sema/ |
H A D | JumpDiagnostics.cpp | 642 bool IsReachable = false; local 649 IsReachable = true; 664 if (IsReachable) continue;
|
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 675 /// This allows a very fast implementation of IsReachable, for example. 708 /// IsReachable - Checks if SU is reachable from TargetSU. 709 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
|
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 152 /// Topo - A topological ordering for SUnits which permits fast IsReachable 184 /// IsReachable - Checks if SU is reachable from TargetSU. 185 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { function in class:__anon2307::ScheduleDAGRRList 186 return Topo.IsReachable(SU, TargetSU); 2728 scheduleDAG->IsReachable(DepSU, PI->getSUnit())) 2734 // definition of the register reaches from DepSU. IsReachable queries 2737 scheduleDAG->IsReachable(DepSU, PI->getSUnit())) 2873 if (scheduleDAG->IsReachable(SU, PredSuccSU)) 2969 !scheduleDAG->IsReachable(SuccSU, SU)) {
|
Completed in 88 milliseconds