| /freebsd-14.2/contrib/llvm-project/llvm/lib/IR/ |
| 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 | 1175 assert((!Prev || Prev->comesBefore(&I)) && in validateInstrOrdering()
|
| H A D | Instruction.cpp | 282 bool Instruction::comesBefore(const Instruction *Other) const { in comesBefore() function in Instruction
|
| /freebsd-14.2/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()
|
| H A D | SimplifyCFG.cpp | 1146 assert(UI->getParent() == BB && BonusInst.comesBefore(UI) && in CloneInstructionsIntoPredecessorBlockAndUpdateSSAUses()
3915 return UI->getParent() == BB && I.comesBefore(UI); in FoldBranchToCommonDest()
7385 if (Use->getParent() != I->getParent() || Use == I || Use->comesBefore(I)) in passingValueIsAlwaysUndefined()
|
| H A D | ScalarEvolutionExpander.cpp | 76 (&*IP == CI || CI->comesBefore(&*IP))) { in ReuseOrCreateCast()
|
| /freebsd-14.2/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()
949 return A.Inst->comesBefore(B.Inst); in vectorizeChain()
1390 assert(Instrs[I - 1]->comesBefore(Instrs[I])); in gatherChains()
1440 (ChainIter->first->comesBefore(I) ? I : ChainIter->first)); in gatherChains()
|
| H A D | VectorCombine.cpp | 1298 if (LastCheckedInst->comesBefore(UI)) { in scalarizeLoadExtract()
|
| H A D | SLPVectorizer.cpp | 3392 ScheduleStart->comesBefore(ScheduleEnd) && in verify()
8686 return B->comesBefore(A); in getSpillCost()
9392 TEInsertPt->comesBefore(InsertPt)) in isGatherShuffledSingleRegisterEntry()
9839 if (LastInst->comesBefore(I)) in getLastInstructionInBundle()
9875 if (I->comesBefore(FirstInst)) in getLastInstructionInBundle()
11875 if (UI->comesBefore(InsertPt)) in vectorizeTree()
11941 Builder.GetInsertPoint()->comesBefore(I)) in vectorizeTree()
12223 if (II->getParent() == NewI->getParent() && II->comesBefore(NewI)) in vectorizeTree()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMParallelDSP.cpp | 372 if (Write->comesBefore(Read)) in RecordMemoryOps()
380 bool BaseFirst = Base->comesBefore(Offset); in RecordMemoryOps()
390 if (Dominator->comesBefore(Before)) in RecordMemoryOps()
706 return A->comesBefore(B); in InsertParallelMACs()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InstructionPrecedenceTracking.cpp | 66 return MaybeFirstSpecial && MaybeFirstSpecial->comesBefore(Insn); in isPreceededBySpecialInstruction()
|
| H A D | CFG.cpp | 252 if (A == B || A->comesBefore(B)) in isPotentiallyReachable()
|
| H A D | StackLifetime.cpp | 55 return L->comesBefore(R); in isAliveAfter()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVRegularizer.cpp | 99 User->comesBefore(ReplInst)) in runLowerConstExpr()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | DFAJumpThreading.cpp | 1133 return LHS.second->comesBefore(RHS.second); in updateDefMap()
1134 return LHS.first->comesBefore(RHS.first); in updateDefMap()
|
| H A D | MemCpyOptimizer.cpp | 927 C->comesBefore(LifetimeArg)) in performCallSlotOptzn()
1560 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 | 1377 UserI->comesBefore(ContextInst)) in checkAndReplaceCondition()
1646 return InstA->comesBefore(InstB); in eliminateConstraints()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 225 bool comesBefore(const Instruction *Other) const;
|
| /freebsd-14.2/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-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | StackColoring.cpp | 930 if (From->comesBefore(To)) in remapInstructions()
|
| H A D | ComplexDeinterleavingPass.cpp | 1436 auto *ReplacementAnchor = R->comesBefore(I) ? I : R; in identifyNodes()
1961 Instruction *InsertPoint = (I->comesBefore(R) ? R : I)->getNextNode(); in replaceNode()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | AggressiveInstCombine.cpp | 697 if (!Start->comesBefore(End)) { in foldLoadsRecursive()
|