Searched refs:SE (Results 1 - 25 of 141) sorted by relevance

123456

/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/
H A DSimplifyIndVar.cpp46 ScalarEvolution *SE; member in class:__anon2703::SimplifyIndvar
54 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, LPPassManager *LPM, argument
58 SE(SE),
112 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand");
124 FoldedExpr = SE->getUDivExpr(SE->getSCEV(IVSrc), SE->getSCEV(D));
127 if (!SE->isSCEVable(UseInst->getType()))
131 if (SE
292 isSimpleIVUser(Instruction *I, const Loop *L, ScalarEvolution *SE) argument
373 simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM, SmallVectorImpl<WeakVH> &Dead, IVVisitor *V) argument
384 simplifyLoopIVs(Loop *L, ScalarEvolution *SE, LPPassManager *LPM, SmallVectorImpl<WeakVH> &Dead) argument
[all...]
H A DLoopUnroll.cpp99 if (ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>()) {
101 SE->forgetLoop(L);
210 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>(); local
211 if (SE)
212 SE->forgetLoop(L);
300 for (succ_iterator SI = succ_begin(*BB), SE = succ_end(*BB);
301 SI != SE; ++SI) {
386 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
387 SI != SE; ++SI) {
419 ScalarEvolution *SE local
[all...]
H A DLoopUnrollRuntime.cpp242 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>();
243 if (SE == 0)
248 const SCEV *BECount = SE->getBackedgeTakenCount(L);
254 SE->getAddExpr(BECount, SE->getConstant(BECount->getType(), 1));
266 SE->forgetLoop(ParentLoop);
279 SCEVExpander Expander(*SE, "loop-unroll");
H A DLoopSimplify.cpp79 ScalarEvolution *SE; member in struct:__anon2691::LoopSimplify
134 SE = getAnalysisIfAvailable<ScalarEvolution>();
172 for (succ_iterator SI = succ_begin(*I), SE = succ_end(*I); SI != SE; ++SI)
201 if (SE)
202 SE->forgetLoop(L);
278 if (SE) SE->forgetValue(PN);
341 if (SE)
342 SE
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A DSetOperations.h26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
27 SI != SE; ++SI)
53 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end();
54 SI != SE; ++SI)
64 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
65 SI != SE; ++SI)
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DScalarEvolutionAliasAnalysis.cpp33 ScalarEvolution *SE; member in class:__anon2115::ScalarEvolutionAliasAnalysis
37 ScalarEvolutionAliasAnalysis() : FunctionPass(ID), SE(0) {
83 SE = &getAnalysis<ScalarEvolution>();
118 const SCEV *AS = SE->getSCEV(const_cast<Value *>(LocA.Ptr));
119 const SCEV *BS = SE->getSCEV(const_cast<Value *>(LocB.Ptr));
126 if (SE->getEffectiveSCEVType(AS->getType()) ==
127 SE->getEffectiveSCEVType(BS->getType())) {
128 unsigned BitWidth = SE->getTypeSizeInBits(AS->getType());
133 const SCEV *BA = SE->getMinusSCEV(BS, AS);
138 if (ASizeInt.ule(SE
[all...]
H A DScalarEvolutionExpander.cpp79 assert(SE.DT->dominates(Ret, BIP));
94 assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) &&
108 SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) {
112 SE.getTypeSizeInBits(CI->getType()) ==
113 SE.getTypeSizeInBits(CI->getOperand(0)->getType()))
118 SE.getTypeSizeInBits(CE->getType()) ==
119 SE.getTypeSizeInBits(CE->getOperand(0)->getType()))
183 while (const Loop *L = SE
211 FactorOutConstant(const SCEV *&S, const SCEV *&Remainder, const SCEV *Factor, ScalarEvolution &SE, const DataLayout *TD) argument
309 SimplifyAddOperands(SmallVectorImpl<const SCEV *> &Ops, Type *Ty, ScalarEvolution &SE) argument
338 SplitAddRecs(SmallVectorImpl<const SCEV *> &Ops, Type *Ty, ScalarEvolution &SE) argument
841 ExposePointerBase(const SCEV *&Base, const SCEV *&Rest, ScalarEvolution &SE) argument
[all...]
H A DScalarEvolutionNormalization.cpp70 ScalarEvolution &SE; member in class:__anon2118::PostIncTransform
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
99 case scZeroExtend: return SE.getZeroExtendExpr(N, S->getType());
100 case scSignExtend: return SE.getSignExtendExpr(N, S->getType());
101 case scTruncate: return SE.getTruncateExpr(N, S->getType());
119 const SCEV *Result = SE.getAddRecExpr(Operands, L, SCEV::FlagAnyWrap);
124 TransformSubExpr(AR->getStepRecurrence(SE),
126 Result = SE.getMinusSCEV(Result, TransformedStep);
141 TransformSubExpr(AR->getStepRecurrence(SE),
143 Result = SE
214 TransformForPostIncUse(TransformKind Kind, const SCEV *S, Instruction *User, Value *OperandValToReplace, PostIncLoopSet &Loops, ScalarEvolution &SE, DominatorTree &DT) argument
[all...]
H A DDependenceAnalysis.cpp129 SE = &getAnalysis<ScalarEvolution>();
333 return SE->getNegativeSCEV(C);
370 A = SE->getConstant(D->getType(), 1);
371 B = SE->getNegativeSCEV(A);
372 C = SE->getNegativeSCEV(D);
383 SE = NewSE;
463 const SCEV *Prod1 = SE->getMulExpr(X->getA(), Y->getB());
464 const SCEV *Prod2 = SE->getMulExpr(X->getB(), Y->getA());
468 Prod1 = SE->getMulExpr(X->getC(), Y->getB());
469 Prod2 = SE
[all...]
H A DIVUsers.cpp50 ScalarEvolution *SE, LoopInfo *LI) {
58 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR);
62 return isInteresting(AR->getStart(), I, L, SE, LI) &&
63 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI);
71 if (isInteresting(*OI, I, L, SE, LI)) {
121 if (!SE->isSCEVable(I->getType()))
133 uint64_t Width = SE->getTypeSizeInBits(I->getType());
138 const SCEV *ISE = SE->getSCEV(I);
142 if (!isInteresting(ISE, I, L, SE, L
49 isInteresting(const SCEV *S, const Instruction *I, const Loop *L, ScalarEvolution *SE, LoopInfo *LI) argument
[all...]
H A DScalarEvolution.cpp365 SE->forgetMemoizedResults(this);
368 SE->UniqueSCEVs.RemoveNode(this);
376 SE->forgetMemoizedResults(this);
379 SE->UniqueSCEVs.RemoveNode(this);
681 ScalarEvolution &SE,
685 return SE.getTruncateOrZeroExtend(It, ResultTy);
739 return SE.getCouldNotCompute();
741 unsigned W = SE.getTypeSizeInBits(ResultTy);
772 IntegerType *CalculationTy = IntegerType::get(SE.getContext(),
774 const SCEV *Dividend = SE
680 BinomialCoefficient(const SCEV *It, unsigned K, ScalarEvolution &SE, Type *ResultTy) argument
1060 getOverflowLimitForStep(const SCEV *Step, ICmpInst::Predicate *Pred, ScalarEvolution *SE) argument
1083 getPreStartForSignExtend(const SCEVAddRecExpr *AR, Type *Ty, ScalarEvolution *SE) argument
1145 getSignExtendAddRecStart(const SCEVAddRecExpr *AR, Type *Ty, ScalarEvolution *SE) argument
1382 CollectAddOperandsWithScales(DenseMap<const SCEV *, APInt> &M, SmallVector<const SCEV *, 8> &NewOps, APInt &AccumulatedConstant, const SCEV *const *Ops, size_t NumOperands, const APInt &Scale, ScalarEvolution &SE) argument
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Transforms/Utils/
H A DSimplifyIndVar.h42 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM,
47 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, LPPassManager *LPM,
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp69 ScalarEvolution *SE; member in class:__anon2634::IndVarSimplify
79 IndVarSimplify() : LoopPass(ID), LI(0), SE(0), DT(0), TD(0),
173 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr));
174 const SCEV *ToBase = SE->getPointerBase(SE->getSCEV(ToPtr));
459 SE->forgetLoop(L);
512 SE->forgetValue(PN);
534 const SCEV *ExitValue = SE->getSCEVAtScope(Inst, L->getParentLoop());
535 if (!SE
638 ScalarEvolution *SE; member in class:__anon2635::WideIVVisitor
710 ScalarEvolution *SE; member in class:__anon2636::WidenIV
1142 isHighCostExpansion(const SCEV *S, BranchInst *BI, SmallPtrSet<const SCEV*, 8> &Processed, ScalarEvolution *SE) argument
1201 canExpandBackedgeTakenCount(Loop *L, ScalarEvolution *SE) argument
1387 FindLoopCounter(Loop *L, const SCEV *BECount, ScalarEvolution *SE, DominatorTree *DT, const DataLayout *TD) argument
1469 genLoopLimit(PHINode *IndVar, const SCEV *IVCount, Loop *L, SCEVExpander &Rewriter, ScalarEvolution *SE) argument
[all...]
H A DLoopStrengthReduce.cpp256 void InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
277 ScalarEvolution &SE) {
279 if (SE.properlyDominates(S, L->getHeader())) {
288 DoInitialMatch(*I, L, Good, Bad, SE);
295 DoInitialMatch(AR->getStart(), L, Good, Bad, SE);
296 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0),
297 AR->getStepRecurrence(SE),
300 L, Good, Bad, SE);
308 const SCEV *NewMul = SE
274 DoInitialMatch(const SCEV *S, Loop *L, SmallVectorImpl<const SCEV *> &Good, SmallVectorImpl<const SCEV *> &Bad, ScalarEvolution &SE) argument
332 InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) argument
438 isAddRecSExtable(const SCEVAddRecExpr *AR, ScalarEvolution &SE) argument
446 isAddSExtable(const SCEVAddExpr *A, ScalarEvolution &SE) argument
454 isMulSExtable(const SCEVMulExpr *M, ScalarEvolution &SE) argument
467 getExactSDiv(const SCEV *LHS, const SCEV *RHS, ScalarEvolution &SE, bool IgnoreSignificantBits = false) argument
559 ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) argument
586 ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) argument
664 isExistingPhi(const SCEVAddRecExpr *AR, ScalarEvolution &SE) argument
685 isHighCostExpansion(const SCEV *S, SmallPtrSet<const SCEV*, 8> &Processed, ScalarEvolution &SE) argument
839 RateRegister(const SCEV *Reg, SmallPtrSet<const SCEV *, 16> &Regs, const Loop *L, ScalarEvolution &SE, DominatorTree &DT) argument
887 RatePrimaryRegister(const SCEV *Reg, SmallPtrSet<const SCEV *, 16> &Regs, const Loop *L, ScalarEvolution &SE, DominatorTree &DT, SmallPtrSet<const SCEV *, 16> *LoserRegs) argument
903 RateFormula(const Formula &F, SmallPtrSet<const SCEV *, 16> &Regs, const DenseSet<const SCEV *> &VisitedRegs, const Loop *L, const SmallVectorImpl<int64_t> &Offsets, ScalarEvolution &SE, DominatorTree &DT, SmallPtrSet<const SCEV *, 16> *LoserRegs) argument
1383 isAlwaysFoldable(const TargetTransformInfo &TTI, ScalarEvolution &SE, int64_t MinOffset, int64_t MaxOffset, LSRUse::KindType Kind, Type *AccessTy, const SCEV *S, bool HasBaseReg) argument
1503 ScalarEvolution &SE; member in class:__anon2650::LSRInstance
2283 findIVOperand(User::op_iterator OI, User::op_iterator OE, Loop *L, ScalarEvolution &SE) argument
2364 isProfitableIncrement(const SCEV *OperExpr, const SCEV *IncExpr, ScalarEvolution &SE) argument
2394 isProfitableChain(IVChain &Chain, SmallPtrSet<Instruction*, 4> &Users, ScalarEvolution &SE, const TargetTransformInfo &TTI) argument
3034 CollectSubexprs(const SCEV *S, const SCEVConstant *C, SmallVectorImpl<const SCEV *> &Ops, const Loop *L, ScalarEvolution &SE, unsigned Depth = 0) argument
[all...]
H A DLoopIdiomRecognize.cpp136 ScalarEvolution *SE; member in class:__anon2641::LoopIdiomRecognize
143 TD = 0; DT = 0; SE = 0; TLI = 0; TTI = 0;
192 return SE ? SE : (SE = &getAnalysis<ScalarEvolution>());
231 static void deleteDeadInstruction(Instruction *I, ScalarEvolution &SE, argument
237 // Before we touch this instruction, remove it from SE!
243 SE.forgetValue(DeadInst);
264 static void deleteIfDeadInstruction(Value *V, ScalarEvolution &SE, argument
268 deleteDeadInstruction(I, SE, TL
498 ScalarEvolution *SE = LIR.getScalarEvolution(); local
[all...]
H A DLoopUnrollPass.cpp140 ScalarEvolution *SE = &getAnalysis<ScalarEvolution>(); local
167 TripCount = SE->getSmallConstantTripCount(L, LatchBlock);
168 TripMultiple = SE->getSmallConstantTripMultiple(L, LatchBlock);
/freebsd-10.0-release/crypto/heimdal/appl/telnet/telnetd/
H A Dtermstat.c60 IAC, SE);
68 IAC, SE);
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DScalarEvolutionNormalization.h73 ScalarEvolution &SE,
H A DScalarEvolutionExpressions.h300 const SCEV *getStepRecurrence(ScalarEvolution &SE) const {
302 return SE.getAddRecExpr(SmallVector<const SCEV *, 3>(op_begin()+1,
333 const SCEV *evaluateAtIteration(const SCEV *It, ScalarEvolution &SE) const;
342 ScalarEvolution &SE) const;
346 const SCEVAddRecExpr *getPostIncExpr(ScalarEvolution &SE) const {
347 return cast<SCEVAddRecExpr>(SE.getAddExpr(this, getStepRecurrence(SE)));
410 /// SE - The parent ScalarEvolution value. This is used to update
413 ScalarEvolution *SE; member in class:llvm::SCEVUnknown
421 SCEV(ID, scUnknown), CallbackVH(V), SE(s
629 ScalarEvolution &SE; member in struct:llvm::SCEVRewriter
638 rewrite(const SCEV *Scev, ScalarEvolution &SE, ValueToValueMap &Map) argument
663 rewrite(const SCEV *Scev, LoopToScevMapT &Map, ScalarEvolution &SE) argument
691 apply(const SCEV *Scev, LoopToScevMapT &Map, ScalarEvolution &SE) argument
[all...]
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DEdgeBundles.cpp50 SE = MBB.succ_end(); SI != SE; ++SI)
91 SE = I->succ_end(); SI != SE; ++SI)
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSymbolManager.h84 symbol_iterator(const SymExpr *SE);
120 static inline bool classof(const SymExpr *SE) { argument
121 Kind k = SE->getKind();
150 static inline bool classof(const SymExpr *SE) { argument
151 return SE->getKind() == RegionValueKind;
196 static inline bool classof(const SymExpr *SE) { argument
197 return SE->getKind() == ConjuredKind;
230 static inline bool classof(const SymExpr *SE) { argument
231 return SE->getKind() == DerivedKind;
261 static inline bool classof(const SymExpr *SE) { argument
306 classof(const SymExpr *SE) argument
342 classof(const SymExpr *SE) argument
364 classof(const SymExpr *SE) argument
400 classof(const SymExpr *SE) argument
435 classof(const SymExpr *SE) argument
469 classof(const SymExpr *SE) argument
673 operator <<(raw_ostream &os, const clang::ento::SymExpr *SE) argument
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DVLASizeChecker.cpp92 const Expr *SE = VLA->getSizeExpr(); local
94 SVal sizeV = state->getSVal(SE, C.getLocationContext());
97 reportBug(VLA_Garbage, SE, state, C);
108 reportBug(VLA_Tainted, SE, 0, C);
119 reportBug(VLA_Zero, SE, stateZero, C);
134 svalBuilder.evalCast(sizeD, SizeTy, SE->getType()).castAs<NonLoc>();
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DSimpleConstraintManager.cpp29 const SymExpr *SE = SymVal->getSymbol(); local
31 if (const SymIntExpr *SIE = dyn_cast<SymIntExpr>(SE)) {
52 if (const SymSymExpr *SSE = dyn_cast<SymSymExpr>(SE)) {
171 } else if (const SymIntExpr *SE = dyn_cast<SymIntExpr>(sym)) {
174 BinaryOperator::Opcode op = SE->getOpcode();
179 return assumeSymRel(state, SE->getLHS(), op, SE->getRHS());
226 if (const SymIntExpr *SE = dyn_cast<SymIntExpr>(Sym)) {
227 BinaryOperator::Opcode Op = SE->getOpcode();
229 Sym = SE
[all...]
/freebsd-10.0-release/crypto/heimdal/appl/telnet/telnet/
H A Dauthenc.c44 if (str[0] == IAC && str[1] == SE)
/freebsd-10.0-release/contrib/telnet/telnetd/
H A Dtermstat.c294 IAC, SE);
322 IAC, SE);
369 IAC, SE);
377 IAC, SE);
450 useeditmode, IAC, SE);
509 IAC, SE);

Completed in 136 milliseconds

123456