| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | SSAContext.cpp | 72 bool SSAContext::comesBefore(const Instruction *lhs, const Instruction *rhs) { comesBefore() function in SSAContext
|
| H A D | Dominators.cpp | 169 return Def->comesBefore(User); in dominates()
318 return Def->comesBefore(UserInst); in dominates()
349 return I1->comesBefore(I2) ? I1 : I2; in findNearestCommonDominator()
|
| H A D | BasicBlock.cpp | 1150 assert((!Prev || Prev->comesBefore(&I)) && in validateInstrOrdering()
|
| H A D | Instruction.cpp | 318 bool Instruction::comesBefore(const Instruction *Other) const { in comesBefore() function in Instruction
|
| /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 | CodeMoverUtils.cpp | 100 return InstA->comesBefore(InstB); in domTreeLevelBefore()
|
| H A D | PredicateInfo.cpp | 108 return cast<Instruction>(A)->comesBefore(cast<Instruction>(B)); in valueComesBefore()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoadStoreVectorizer.cpp | 164 sort(C, [](auto &A, auto &B) { return A.Inst->comesBefore(B.Inst); }); in sortChainInBBOrder()
171 return A.Inst->comesBefore(B.Inst); // stable tiebreaker in sortChainInOffsetOrder()
219 if (!IM->comesBefore(I)) { in reorder()
896 return A.Inst->comesBefore(B.Inst); in vectorizeChain()
948 return A.Inst->comesBefore(B.Inst); in vectorizeChain()
1389 assert(Instrs[I - 1]->comesBefore(Instrs[I])); in gatherChains()
1439 (ChainIter->first->comesBefore(I) ? I : ChainIter->first)); in gatherChains()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | SSAContext.h | |
| H A D | Instruction.h | 260 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()
708 return A->comesBefore(B); in InsertParallelMACs()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InstructionPrecedenceTracking.cpp | 66 return MaybeFirstSpecial && MaybeFirstSpecial->comesBefore(Insn); in isPreceededBySpecialInstruction()
|
| H A D | CFG.cpp | 302 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/SandboxIR/ |
| H A D | Tracker.cpp | 59 return D0.LLVMI->comesBefore(D1.LLVMI); in EraseFromParent()
|
| H A D | SandboxIR.cpp | 389 [](auto *I1, auto *I2) { return I1->comesBefore(I2); }) && in moveBefore()
400 [](auto *I1, auto *I2) { return I1->comesBefore(I2); }) && in insertBefore()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVRegularizer.cpp | 99 User->comesBefore(ReplInst)) in runLowerConstExpr()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | DFAJumpThreading.cpp | 1178 return LHS.second->comesBefore(RHS.second); in updateDefMap()
1179 return LHS.first->comesBefore(RHS.first); in updateDefMap()
|
| H A D | MemCpyOptimizer.cpp | 931 C->comesBefore(LifetimeArg)) in performCallSlotOptzn()
1629 if (UI->comesBefore(Store)) in performStackMoveOptzn()
|
| H A D | MergeICmps.cpp | 251 return (Inst->getParent() != LI->getParent() || !Inst->comesBefore(LI)) && in canSinkBCECmpInst()
|
| H A D | ConstraintElimination.cpp | 1415 UserI->comesBefore(ContextInst)) in checkAndReplaceCondition()
1726 return InstA->comesBefore(InstB); in eliminateConstraints()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorCombine.cpp | 228 return A->comesBefore(B); in operator ()()
850 assert(Base->comesBefore(In) && "Base should come before In"); in getUpwardDeps()
861 if (I->getParent() == Parent && Base->comesBefore(I)) in getUpwardDeps()
1154 return A->comesBefore(B); in realignLoadGroup()
2883 bool MoveUp = (To != Block.end() && To->comesBefore(&In)); in isSafeToMoveBeforeInBB()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | StackColoring.cpp | 934 if (From->comesBefore(To)) in remapInstructions()
|
| H A D | ComplexDeinterleavingPass.cpp | 1436 auto *ReplacementAnchor = R->comesBefore(I) ? I : R; in identifyNodes()
1960 Instruction *InsertPoint = (I->comesBefore(R) ? R : I)->getNextNode(); in replaceNode()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | AggressiveInstCombine.cpp | 700 if (!Start->comesBefore(End)) { in foldLoadsRecursive()
|