Home
last modified time | relevance | path

Searched refs:isGuard (Results 1 – 11 of 11) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DGuardUtils.cpp18 bool llvm::isGuard(const User *U) { in isGuard() function in llvm
140 assert((isGuard(U) || isWidenableBranch(U)) && "Should be"); in parseWidenableGuard()
141 Value *Condition = isGuard(U) ? cast<IntrinsicInst>(U)->getArgOperand(0) in parseWidenableGuard()
H A DAliasSetTracker.cpp137 bool MayWriteMemory = I->mayWriteToMemory() && !isGuard(I) && in addUnknownInst()
H A DValueTracking.cpp2241 } else if (NonNullIfTrue && isGuard(Curr) && in isKnownNonNullFromDominatingCondition()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DGuardUtils.h25 bool isGuard(const User *U);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DMakeGuardsExplicit.cpp65 if (isGuard(&I)) in explicifyGuards()
H A DGuardWidening.cpp125 if (isGuard(WCOrGuard)) in findInsertionPointForWideCondition()
332 if (isGuard(Insn)) in isSupportedGuardInstruction()
H A DSimpleLoopUnswitch.cpp2809 (isGuard(&TI) || in CalculateUnswitchCostMultiplier()
2833 if (isGuard(CI)) { in CalculateUnswitchCostMultiplier()
2919 } else if (CollectGuards && isGuard(&I)) { in collectUnswitchCandidates()
3403 int SuccessorsCount = isGuard(&TI) ? 2 : Visited.size(); in findBestNonTrivialUnswitchCandidate()
3529 if (isGuard(Best.TI)) in unswitchBestCondition()
H A DLoopPredication.cpp1229 if (isGuard(&I)) in runOnLoop()
H A DEarlyCSE.cpp1460 if (isGuard(&Inst)) { in processNode()
H A DLICM.cpp952 if ((IsInvariantStart(I) || isGuard(&I)) && in hoistRegion()
H A DJumpThreading.cpp3048 if (isGuard(&I) && threadGuard(BB, cast<IntrinsicInst>(&I), BI)) in processGuards()