| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAGInstrs.h | 293 bool IsReachable(SUnit *SU, SUnit *TargetSU) { in IsReachable() function
294 return Topo.IsReachable(SU, TargetSU); in IsReachable()
|
| H A D | ScheduleDAG.h | 779 LLVM_ABI bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUIGroupLP.cpp | 937 return DAG->IsReachable(TargetSU, const_cast<SUnit *>(SU)); in apply()
977 return DAG->IsReachable((*Cache)[0], const_cast<SUnit *>(SU)); in apply()
1023 return DAG->IsReachable((*Cache)[0], const_cast<SUnit *>(SU)); in apply()
1212 if (DAG->IsReachable(const_cast<SUnit *>(SU), OtherEle)) in apply()
1390 if (DAG->IsReachable(SuccSU, PredSU)) { in analyzeDAG()
1418 if (DAG->IsReachable(SuccSU, PredSU)) { in analyzeDAG()
1432 if (DAG->IsReachable(SuccSU, *TempExp)) { in analyzeDAG()
1441 if (DAG->IsReachable(SuccSU, *TempCvt)) { in analyzeDAG()
1474 return DAG->IsReachable(VPack, *TempExp); in analyzeDAG()
1506 return DAG->IsReachable(PackPred->getSUnit(), ExpBase); in analyzeDAG()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 711 if (IsReachable(SU, TargetSU)) in WillCreateCycle()
715 IsReachable(SU, PredDep.getSUnit())) in WillCreateCycle()
728 bool ScheduleDAGTopologicalSort::IsReachable(const SUnit *SU, in IsReachable() function in ScheduleDAGTopologicalSort
|
| H A D | ScheduleDAGInstrs.cpp | 1236 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU); in canAddEdge()
1243 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU)) in addEdge()
|
| H A D | MachineScheduler.cpp | 2121 (!DAG->IsReachable(MemOpRecords[NextIdx].SU, MemOpa.SU) && in clusterNeighboringMemOps()
2122 !DAG->IsReachable(MemOpa.SU, MemOpRecords[NextIdx].SU)))) in clusterNeighboringMemOps()
|
| H A D | MachinePipeliner.cpp | 1298 if (Topo.IsReachable(&I, LastSU)) in changeDependences()
2046 if (!SDAG->Topo.IsReachable(I, Src) && Src != I) { in apply()
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | JumpDiagnostics.cpp | 837 bool IsReachable = false; in VerifyIndirectJumps() local
844 IsReachable = true; in VerifyIndirectJumps()
859 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 | 928 void addSuccessor(CFGBlock *B, CFGBlock *S, bool IsReachable = true) { in addSuccessor() argument
929 B->addSuccessor(CFGBlock::AdjacentBlock(S, IsReachable), in addSuccessor()
5474 CFGBlock::AdjacentBlock::AdjacentBlock(CFGBlock *B, bool IsReachable) in AdjacentBlock() argument
5475 : ReachableBlock(IsReachable ? B : nullptr), in AdjacentBlock()
5476 UnreachableBlock(!IsReachable ? B : nullptr, in AdjacentBlock()
5477 B && IsReachable ? AB_Normal : AB_Unreachable) {} in AdjacentBlock()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | CFG.h | 837 AdjacentBlock(CFGBlock *B, bool IsReachable);
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 5967 auto IsReachable = in createNodeFromSelectLikePHI() local
5969 if (PN->getNumIncomingValues() == 2 && all_of(PN->blocks(), IsReachable)) { in createNodeFromSelectLikePHI()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Testing/Demangle/ |
| H A D | DemangleTestCases.inc | 17656 …Sort11IsReachableEPKNS_5SUnitES3_", "llvm::ScheduleDAGTopologicalSort::IsReachable(llvm::SUnit con…
|