| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Interval.h | 86 assert((Top == Bottom || Top->comesBefore(Bottom)) && in Interval()
94 if (I->comesBefore(Top)) in Interval()
96 else if (Bottom->comesBefore(I)) in Interval()
109 return (Top == I || Top->comesBefore(I)) && in contains()
110 (I == Bottom || I->comesBefore(Bottom)); in contains()
139 bool comesBefore(const Interval &Other) const { in comesBefore() function
141 return bottom()->comesBefore(Other.top()); in comesBefore()
158 if (Bottom->comesBefore(Other.Top) || Other.Bottom->comesBefore(Top)) in intersection()
163 auto NewTopI = Top->comesBefore(Other.Top) ? Other.Top : Top; in intersection()
164 auto NewBottomI = Bottom->comesBefore(Other.Bottom) ? Bottom : Other.Bottom; in intersection()
[all …]
|
| H A D | VecUtils.h | 127 if (LowestI->comesBefore(I))
155 if (LowestI->comesBefore(I))
|
| H A D | DependencyGraph.h | 142 bool comesBefore(const DGNode *Other) { return I->comesBefore(Other->I); } in comesBefore() function
|
| H A D | Scheduler.h | 50 return I2->comesBefore(I1); in operator()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Interval.cpp | 22 return Other.Bottom->comesBefore(Top) || Bottom->comesBefore(Other.Top); in disjoint()
|
| H A D | DependencyGraph.cpp | 268 bool NewIsAbove = DAGInterval.empty() || NewInterval.comesBefore(DAGInterval); in setDefUseUnscheduledSuccs()
314 bool NewIsAbove = NewInterval.comesBefore(DAGInterval); in createNewNodes()
322 LinkTopN->comesBefore(LinkBotN)) && in createNewNodes()
403 if (DAGInterval.top()->comesBefore(I)) { in notifyCreateInstr()
409 if (I->comesBefore(DAGInterval.bottom())) { in notifyCreateInstr()
592 else if (DAGInterval.bottom()->comesBefore(NewInterval.top())) { in extend()
602 else if (NewInterval.bottom()->comesBefore(DAGInterval.top())) { in extend()
653 return N1->getInstruction()->comesBefore(N2->getInstruction()); in print()
|
| H A D | Scheduler.cpp | 18 if (N->getInstruction()->comesBefore(TopN->getInstruction())) in getTop()
27 if (BotN->getInstruction()->comesBefore(N->getInstruction())) in getBot()
100 (*ScheduleTopItOpt.value()).comesBefore(I); in notifyCreateInstr()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Dominators.cpp | 182 return Def->comesBefore(User); in dominates()
331 return Def->comesBefore(UserInst); in dominates()
362 return I1->comesBefore(I2) ? I1 : I2; in findNearestCommonDominator()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/Passes/ |
| H A D | PackReuse.cpp | 37 return PackInstrs1.front()->comesBefore(PackInstrs2.front()); in runOnRegion()
|
| H A D | BottomUpVec.cpp | 184 [](Instruction *I1, Instruction *I2) { return I1->comesBefore(I2); }); in tryEraseDeadInstrs()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoadStoreVectorizer.cpp | 166 sort(C, [](auto &A, auto &B) { return A.Inst->comesBefore(B.Inst); }); in sortChainInBBOrder()
173 return A.Inst->comesBefore(B.Inst); // stable tiebreaker in sortChainInOffsetOrder()
223 if (!IM->comesBefore(I)) { in reorder()
910 return A.Inst->comesBefore(B.Inst); in vectorizeChain()
962 return A.Inst->comesBefore(B.Inst); in vectorizeChain()
1416 return A && B && A->comesBefore(B); in mergeEquivalenceClasses()
1518 assert(Instrs[I - 1]->comesBefore(Instrs[I])); in gatherChains()
1568 (ChainIter->first->comesBefore(I) ? I : ChainIter->first))) { in gatherChains()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | AssumeBundleBuilder.cpp | 367 return LHS->comesBefore(RHS); in buildMapping()
489 (InsertPt->comesBefore(I) || &*InsertPt == I)) in mergeRange()
496 if (InsertPt->comesBefore(*Begin)) in mergeRange()
529 for (; (*LastSplit)->comesBefore(&*It); ++LastSplit) in mergeAssumes()
|
| H A D | SSAUpdater.cpp | 452 [](Instruction *A, Instruction *B) { return A->comesBefore(B); }); in run()
|
| H A D | IRNormalizer.cpp | 470 if (Definition->comesBefore(&*FirstNonPHIOrDbgOrAlloca)) in reorderDefinition()
|
| H A D | CodeMoverUtils.cpp | 100 return InstA->comesBefore(InstB); in domTreeLevelBefore()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | SSAContext.h | |
| H A D | Instruction.h | 298 LLVM_ABI bool comesBefore(const Instruction *Other) const;
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMParallelDSP.cpp | 374 if (Write->comesBefore(Read)) in RecordMemoryOps()
382 bool BaseFirst = Base->comesBefore(Offset); in RecordMemoryOps()
392 if (Dominator->comesBefore(Before)) in RecordMemoryOps()
709 return A->comesBefore(B); in InsertParallelMACs()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InstructionPrecedenceTracking.cpp | 72 return MaybeFirstSpecial && MaybeFirstSpecial->comesBefore(Insn); in isPreceededBySpecialInstruction()
|
| H A D | CFG.cpp | 303 if (A == B || A->comesBefore(B)) in isPotentiallyReachable()
|
| H A D | StackLifetime.cpp | 55 return L->comesBefore(R); in isAliveAfter()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVRegularizer.cpp | 92 User->comesBefore(ReplInst)) in runLowerConstExpr()
|
| /freebsd/contrib/llvm-project/llvm/lib/SandboxIR/ |
| H A D | Tracker.cpp | 157 return D0.LLVMI->comesBefore(D1.LLVMI); in EraseFromParent()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | TypeSanitizer.cpp | 782 if (IP->comesBefore(ShadowBase)) in instrumentMemInst()
784 if (IP->comesBefore(AppMemMask)) in instrumentMemInst()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | DFAJumpThreading.cpp | 1218 return LHS.second->comesBefore(RHS.second); in updateDefMap()
1219 return LHS.first->comesBefore(RHS.first); in updateDefMap()
|