Home
last modified time | relevance | path

Searched refs:comesBefore (Results 1 – 23 of 23) sorted by relevance

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
DAssumeBundleBuilder.cpp365 return LHS->comesBefore(RHS); in buildMapping()
487 (InsertPt->comesBefore(I) || InsertPt == I)) in mergeRange()
494 if (InsertPt->comesBefore(*Begin)) in mergeRange()
527 for (; (*LastSplit)->comesBefore(&*It); ++LastSplit) in mergeAssumes()
DCodeMoverUtils.cpp101 return InstA->comesBefore(InstB); in domTreeLevelBefore()
DPredicateInfo.cpp123 return cast<Instruction>(A)->comesBefore(cast<Instruction>(B)); in valueComesBefore()
DSimplifyCFG.cpp1102 assert(UI->getParent() == BB && BonusInst.comesBefore(UI) && in CloneInstructionsIntoPredecessorBlockAndUpdateSSAUses()
3222 return UI->getParent() == BB && I.comesBefore(UI); in FoldBranchToCommonDest()
DScalarEvolutionExpander.cpp77 (&*IP == CI || CI->comesBefore(&*IP))) { in ReuseOrCreateCast()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/ARM/
DARMParallelDSP.cpp378 if (Write->comesBefore(Read)) in RecordMemoryOps()
386 bool BaseFirst = Base->comesBefore(Offset); in RecordMemoryOps()
396 if (Dominator->comesBefore(Before)) in RecordMemoryOps()
707 return A->comesBefore(B); in InsertParallelMACs()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
DInstructionPrecedenceTracking.cpp62 return MaybeFirstSpecial && MaybeFirstSpecial->comesBefore(Insn); in isPreceededBySpecialInstruction()
DCFG.cpp257 if (A == B || A->comesBefore(B)) in isPotentiallyReachable()
DStackLifetime.cpp60 return L->comesBefore(R); in isAliveAfter()
DIVDescriptors.cpp755 return A->comesBefore(B); in isFirstOrderRecurrence()
DValueTracking.cpp535 if (Inv->comesBefore(CxtI)) in isValidAssumeForContext()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
DLoadStoreVectorizer.cpp601 if (!IM->comesBefore(I)) { in reorder()
733 if (BarrierMemoryInstr && BarrierMemoryInstr->comesBefore(ChainInstr)) in getVectorizablePrefix()
740 if (BarrierMemoryInstr && BarrierMemoryInstr->comesBefore(MemInstr)) in getVectorizablePrefix()
759 (IsInvariantLoad(ChainLoad) || ChainLoad->comesBefore(MemInstr))) in getVectorizablePrefix()
764 (IsInvariantLoad(MemLoad) || MemLoad->comesBefore(ChainInstr))) in getVectorizablePrefix()
790 assert(BarrierMemoryInstr->comesBefore(ChainInstr)); in getVectorizablePrefix()
DVectorCombine.cpp896 if (LastCheckedInst->comesBefore(UI)) { in scalarizeLoadExtract()
909 else if (LastCheckedInst->comesBefore(UI)) in scalarizeLoadExtract()
DSLPVectorizer.cpp4392 return B->comesBefore(A); in getSpillCost()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
DDominators.cpp162 return Def->comesBefore(User); in dominates()
325 return Def->comesBefore(UserInst); in dominates()
DBasicBlock.cpp518 assert((!Prev || Prev->comesBefore(&I)) && in validateInstrOrdering()
DInstruction.cpp111 bool Instruction::comesBefore(const Instruction *Other) const { in comesBefore() function in Instruction
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
DHexagonVectorCombine.cpp166 return A->comesBefore(B); in operator ()()
554 assert(Base->comesBefore(In) && "Base should come before In"); in createLoadGroups()
564 if (I->getParent() == Parent && Base->comesBefore(I)) in createLoadGroups()
1408 bool MoveUp = (To != Block.end() && To->comesBefore(&In)); in isSafeToMoveBeforeInBB()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/IR/
DInstruction.h153 bool comesBefore(const Instruction *Other) const;
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DStackColoring.cpp962 if (From->comesBefore(To)) in remapInstructions()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
DGVN.cpp1765 if (!Current->getMemoryInst()->comesBefore(NewS)) { in processAssumeIntrinsic()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
DInstructionCombining.cpp3736 [](auto *A, auto *B) { return B->comesBefore(A); }); in TryToSinkInstruction()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
DMemorySanitizer.cpp1113 (&I == FnPrologueEnd || I.comesBefore(FnPrologueEnd)); in isInPrologue()