/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAGInstrs.h | 279 bool IsReachable(SUnit *SU, SUnit *TargetSU) { in IsReachable() function 280 return Topo.IsReachable(SU, TargetSU); in IsReachable()
|
H A D | ScheduleDAG.h | 774 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUIGroupLP.cpp | 960 return DAG->IsReachable(TargetSU, const_cast<SUnit *>(SU)); in apply() 1002 return DAG->IsReachable((*Cache)[0], const_cast<SUnit *>(SU)); in apply() 1048 return DAG->IsReachable((*Cache)[0], const_cast<SUnit *>(SU)); in apply() 1239 if (DAG->IsReachable(const_cast<SUnit *>(SU), OtherEle)) in apply() 1418 if (DAG->IsReachable(SuccSU, PredSU)) { in analyzeDAG() 1449 if (DAG->IsReachable(SuccSU, PredSU)) { in analyzeDAG() 1463 if (DAG->IsReachable(SuccSU, *TempExp)) { in analyzeDAG() 1472 if (DAG->IsReachable(SuccSU, *TempCvt)) { in analyzeDAG() 1506 return DAG->IsReachable(VPack, *TempExp); in analyzeDAG() 1543 return DAG->IsReachable(PackPred->getSUnit(), ExpBase); in analyzeDAG() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 709 if (IsReachable(SU, TargetSU)) in WillCreateCycle() 713 IsReachable(SU, PredDep.getSUnit())) in WillCreateCycle() 726 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable() function in ScheduleDAGTopologicalSort
|
H A D | ScheduleDAGInstrs.cpp | 1219 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge() 1226 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU)) in addEdge()
|
H A D | MachinePipeliner.cpp | 1044 if (Topo.IsReachable(&I, LastSU)) in changeDependences() 1850 if (!SDAG->Topo.IsReachable(I, Src) && Src != I) { in apply()
|
H A D | MachineScheduler.cpp | 1869 (!DAG->IsReachable(MemOpRecords[NextIdx].SU, MemOpa.SU) && in clusterNeighboringMemOps() 1870 !DAG->IsReachable(MemOpa.SU, MemOpRecords[NextIdx].SU)))) in clusterNeighboringMemOps()
|
/freebsd/contrib/llvm-project/clang/lib/Sema/ |
H A D | JumpDiagnostics.cpp | 821 bool IsReachable = false; in VerifyIndirectJumps() local 828 IsReachable = true; in VerifyIndirectJumps() 843 if (IsReachable) continue; in VerifyIndirectJumps()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 211 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable() function in __anona90f206e0111::ScheduleDAGRRList 212 return Topo.IsReachable(SU, TargetSU); in IsReachable() 2874 scheduleDAG->IsReachable(DepSU, SuccPred.getSUnit())) in canClobberReachingPhysRegUse() 2882 scheduleDAG->IsReachable(DepSU, SuccPred.getSUnit())) in canClobberReachingPhysRegUse() 3033 if (scheduleDAG->IsReachable(&SU, PredSuccSU)) in PrescheduleNodesWithMultipleUses() 3130 !scheduleDAG->IsReachable(SuccSU, &SU)) { in AddPseudoTwoAddrDeps()
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/ |
H A D | CFG.cpp | 900 void addSuccessor(CFGBlock *B, CFGBlock *S, bool IsReachable = true) { in addSuccessor() argument 901 B->addSuccessor(CFGBlock::AdjacentBlock(S, IsReachable), in addSuccessor() 5365 CFGBlock::AdjacentBlock::AdjacentBlock(CFGBlock *B, bool IsReachable) in AdjacentBlock() argument 5366 : ReachableBlock(IsReachable ? B : nullptr), in AdjacentBlock() 5367 UnreachableBlock(!IsReachable ? B : nullptr, in AdjacentBlock() 5368 B && IsReachable ? AB_Normal : AB_Unreachable) {} in AdjacentBlock()
|
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/ |
H A D | CFG.h | 831 AdjacentBlock(CFGBlock *B, bool IsReachable);
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 5998 auto IsReachable = in createNodeFromSelectLikePHI() local 6000 if (PN->getNumIncomingValues() == 2 && all_of(PN->blocks(), IsReachable)) { in createNodeFromSelectLikePHI()
|