1 //===- LazyValueInfo.cpp - Value constraint analysis ----------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the interface for lazy computation of value constraint
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "lazy-value-info"
16 #include "llvm/Analysis/LazyValueInfo.h"
17 #include "llvm/Constants.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Analysis/ConstantFolding.h"
20 #include "llvm/Target/TargetData.h"
21 #include "llvm/Support/CFG.h"
22 #include "llvm/Support/ConstantRange.h"
23 #include "llvm/Support/Debug.h"
24 #include "llvm/Support/raw_ostream.h"
25 #include "llvm/Support/ValueHandle.h"
26 #include "llvm/ADT/DenseMap.h"
27 #include "llvm/ADT/DenseSet.h"
28 #include "llvm/ADT/STLExtras.h"
31 char LazyValueInfo::ID = 0;
32 INITIALIZE_PASS(LazyValueInfo, "lazy-value-info",
33 "Lazy Value Information Analysis", false, true);
36 FunctionPass *createLazyValueInfoPass() { return new LazyValueInfo(); }
40 //===----------------------------------------------------------------------===//
42 //===----------------------------------------------------------------------===//
44 /// LVILatticeVal - This is the information tracked by LazyValueInfo for each
47 /// FIXME: This is basically just for bringup, this can be made a lot more rich
53 /// undefined - This LLVM Value has no known value yet.
56 /// constant - This LLVM Value has a specific constant value.
58 /// notconstant - This LLVM value is known to not have the specified value.
64 /// overdefined - This instruction is not known to be constant, and we know
69 /// Val: This stores the current lattice value along with the Constant* for
70 /// the constant if this is a 'constant' or 'notconstant' value.
76 LVILatticeVal() : Tag(undefined), Val(0), Range(1, true) {}
78 static LVILatticeVal get(Constant *C) {
80 if (ConstantInt *CI = dyn_cast<ConstantInt>(C))
81 Res.markConstantRange(ConstantRange(CI->getValue(), CI->getValue()+1));
82 else if (!isa<UndefValue>(C))
86 static LVILatticeVal getNot(Constant *C) {
88 if (ConstantInt *CI = dyn_cast<ConstantInt>(C))
89 Res.markConstantRange(ConstantRange(CI->getValue()+1, CI->getValue()));
91 Res.markNotConstant(C);
94 static LVILatticeVal getRange(ConstantRange CR) {
96 Res.markConstantRange(CR);
100 bool isUndefined() const { return Tag == undefined; }
101 bool isConstant() const { return Tag == constant; }
102 bool isNotConstant() const { return Tag == notconstant; }
103 bool isConstantRange() const { return Tag == constantrange; }
104 bool isOverdefined() const { return Tag == overdefined; }
106 Constant *getConstant() const {
107 assert(isConstant() && "Cannot get the constant of a non-constant!");
111 Constant *getNotConstant() const {
112 assert(isNotConstant() && "Cannot get the constant of a non-notconstant!");
116 ConstantRange getConstantRange() const {
117 assert(isConstantRange() &&
118 "Cannot get the constant-range of a non-constant-range!");
122 /// markOverdefined - Return true if this is a change in status.
123 bool markOverdefined() {
130 /// markConstant - Return true if this is a change in status.
131 bool markConstant(Constant *V) {
133 assert(getConstant() == V && "Marking constant with different value");
137 assert(isUndefined());
139 assert(V && "Marking constant with NULL");
144 /// markNotConstant - Return true if this is a change in status.
145 bool markNotConstant(Constant *V) {
146 if (isNotConstant()) {
147 assert(getNotConstant() == V && "Marking !constant with different value");
152 assert(getConstant() != V && "Marking not constant with different value");
154 assert(isUndefined());
157 assert(V && "Marking constant with NULL");
162 /// markConstantRange - Return true if this is a change in status.
163 bool markConstantRange(const ConstantRange NewR) {
164 if (isConstantRange()) {
165 if (NewR.isEmptySet())
166 return markOverdefined();
168 bool changed = Range == NewR;
173 assert(isUndefined());
174 if (NewR.isEmptySet())
175 return markOverdefined();
176 else if (NewR.isFullSet()) {
186 /// mergeIn - Merge the specified lattice value into this one, updating this
187 /// one and returning true if anything changed.
188 bool mergeIn(const LVILatticeVal &RHS) {
189 if (RHS.isUndefined() || isOverdefined()) return false;
190 if (RHS.isOverdefined()) return markOverdefined();
192 if (RHS.isNotConstant()) {
193 if (isNotConstant()) {
194 if (getNotConstant() != RHS.getNotConstant() ||
195 isa<ConstantExpr>(getNotConstant()) ||
196 isa<ConstantExpr>(RHS.getNotConstant()))
197 return markOverdefined();
201 if (getConstant() == RHS.getNotConstant() ||
202 isa<ConstantExpr>(RHS.getNotConstant()) ||
203 isa<ConstantExpr>(getConstant()))
204 return markOverdefined();
205 return markNotConstant(RHS.getNotConstant());
208 assert(isUndefined() && "Unexpected lattice");
209 return markNotConstant(RHS.getNotConstant());
212 if (RHS.isConstantRange()) {
213 if (isConstantRange()) {
214 ConstantRange NewR = Range.unionWith(RHS.getConstantRange());
215 if (NewR.isFullSet())
216 return markOverdefined();
218 return markConstantRange(NewR);
221 assert(isUndefined() && "Unexpected lattice");
222 return markConstantRange(RHS.getConstantRange());
225 // RHS must be a constant, we must be undef, constant, or notconstant.
226 assert(!isConstantRange() &&
227 "Constant and ConstantRange cannot be merged.");
230 return markConstant(RHS.getConstant());
233 if (getConstant() != RHS.getConstant())
234 return markOverdefined();
238 // If we are known "!=4" and RHS is "==5", stay at "!=4".
239 if (getNotConstant() == RHS.getConstant() ||
240 isa<ConstantExpr>(getNotConstant()) ||
241 isa<ConstantExpr>(RHS.getConstant()))
242 return markOverdefined();
248 } // end anonymous namespace.
251 raw_ostream &operator<<(raw_ostream &OS, const LVILatticeVal &Val) {
252 if (Val.isUndefined())
253 return OS << "undefined";
254 if (Val.isOverdefined())
255 return OS << "overdefined";
257 if (Val.isNotConstant())
258 return OS << "notconstant<" << *Val.getNotConstant() << '>';
259 else if (Val.isConstantRange())
260 return OS << "constantrange<" << Val.getConstantRange().getLower() << ", "
261 << Val.getConstantRange().getUpper() << '>';
262 return OS << "constant<" << *Val.getConstant() << '>';
266 //===----------------------------------------------------------------------===//
267 // LazyValueInfoCache Decl
268 //===----------------------------------------------------------------------===//
271 /// LazyValueInfoCache - This is the cache kept by LazyValueInfo which
272 /// maintains information about queries across the clients' queries.
273 class LazyValueInfoCache {
275 /// BlockCacheEntryTy - This is a computed lattice value at the end of the
276 /// specified basic block for a Value* that depends on context.
277 typedef std::pair<BasicBlock*, LVILatticeVal> BlockCacheEntryTy;
279 /// ValueCacheEntryTy - This is all of the cached block information for
280 /// exactly one Value*. The entries are sorted by the BasicBlock* of the
281 /// entries, allowing us to do a lookup with a binary search.
282 typedef std::map<BasicBlock*, LVILatticeVal> ValueCacheEntryTy;
285 /// LVIValueHandle - A callback value handle update the cache when
286 /// values are erased.
287 struct LVIValueHandle : public CallbackVH {
288 LazyValueInfoCache *Parent;
290 LVIValueHandle(Value *V, LazyValueInfoCache *P)
291 : CallbackVH(V), Parent(P) { }
294 void allUsesReplacedWith(Value* V) {
298 LVIValueHandle &operator=(Value *V) {
299 return *this = LVIValueHandle(V, Parent);
303 /// ValueCache - This is all of the cached information for all values,
304 /// mapped from Value* to key information.
305 std::map<LVIValueHandle, ValueCacheEntryTy> ValueCache;
307 /// OverDefinedCache - This tracks, on a per-block basis, the set of
308 /// values that are over-defined at the end of that block. This is required
309 /// for cache updating.
310 std::set<std::pair<BasicBlock*, Value*> > OverDefinedCache;
314 /// getValueInBlock - This is the query interface to determine the lattice
315 /// value for the specified Value* at the end of the specified block.
316 LVILatticeVal getValueInBlock(Value *V, BasicBlock *BB);
318 /// getValueOnEdge - This is the query interface to determine the lattice
319 /// value for the specified Value* that is true on the specified edge.
320 LVILatticeVal getValueOnEdge(Value *V, BasicBlock *FromBB,BasicBlock *ToBB);
322 /// threadEdge - This is the update interface to inform the cache that an
323 /// edge from PredBB to OldSucc has been threaded to be from PredBB to
325 void threadEdge(BasicBlock *PredBB,BasicBlock *OldSucc,BasicBlock *NewSucc);
327 } // end anonymous namespace
329 //===----------------------------------------------------------------------===//
331 //===----------------------------------------------------------------------===//
334 /// LVIQuery - This is a transient object that exists while a query is
337 /// TODO: Reuse LVIQuery instead of recreating it for every query, this avoids
338 /// reallocation of the densemap on every query.
340 typedef LazyValueInfoCache::BlockCacheEntryTy BlockCacheEntryTy;
341 typedef LazyValueInfoCache::ValueCacheEntryTy ValueCacheEntryTy;
343 /// This is the current value being queried for.
346 /// This is a pointer to the owning cache, for recursive queries.
347 LazyValueInfoCache &Parent;
349 /// This is all of the cached information about this value.
350 ValueCacheEntryTy &Cache;
352 /// This tracks, for each block, what values are overdefined.
353 std::set<std::pair<BasicBlock*, Value*> > &OverDefinedCache;
355 /// NewBlocks - This is a mapping of the new BasicBlocks which have been
356 /// added to cache but that are not in sorted order.
357 DenseSet<BasicBlock*> NewBlockInfo;
360 LVIQuery(Value *V, LazyValueInfoCache &P,
361 ValueCacheEntryTy &VC,
362 std::set<std::pair<BasicBlock*, Value*> > &ODC)
363 : Val(V), Parent(P), Cache(VC), OverDefinedCache(ODC) {
367 // When the query is done, insert the newly discovered facts into the
368 // cache in sorted order.
369 if (NewBlockInfo.empty()) return;
371 for (DenseSet<BasicBlock*>::iterator I = NewBlockInfo.begin(),
372 E = NewBlockInfo.end(); I != E; ++I) {
373 if (Cache[*I].isOverdefined())
374 OverDefinedCache.insert(std::make_pair(*I, Val));
378 LVILatticeVal getBlockValue(BasicBlock *BB);
379 LVILatticeVal getEdgeValue(BasicBlock *FromBB, BasicBlock *ToBB);
382 LVILatticeVal getCachedEntryForBlock(BasicBlock *BB);
384 } // end anonymous namespace
386 void LazyValueInfoCache::LVIValueHandle::deleted() {
387 for (std::set<std::pair<BasicBlock*, Value*> >::iterator
388 I = Parent->OverDefinedCache.begin(),
389 E = Parent->OverDefinedCache.end();
391 std::set<std::pair<BasicBlock*, Value*> >::iterator tmp = I;
393 if (tmp->second == getValPtr())
394 Parent->OverDefinedCache.erase(tmp);
397 // This erasure deallocates *this, so it MUST happen after we're done
398 // using any and all members of *this.
399 Parent->ValueCache.erase(*this);
403 /// getCachedEntryForBlock - See if we already have a value for this block. If
404 /// so, return it, otherwise create a new entry in the Cache map to use.
405 LVILatticeVal LVIQuery::getCachedEntryForBlock(BasicBlock *BB) {
406 NewBlockInfo.insert(BB);
410 LVILatticeVal LVIQuery::getBlockValue(BasicBlock *BB) {
411 // See if we already have a value for this block.
412 LVILatticeVal BBLV = getCachedEntryForBlock(BB);
414 // If we've already computed this block's value, return it.
415 if (!BBLV.isUndefined()) {
416 DEBUG(dbgs() << " reuse BB '" << BB->getName() << "' val=" << BBLV <<'\n');
420 // Otherwise, this is the first time we're seeing this block. Reset the
421 // lattice value to overdefined, so that cycles will terminate and be
422 // conservatively correct.
423 BBLV.markOverdefined();
426 // If V is live into BB, see if our predecessors know anything about it.
427 Instruction *BBI = dyn_cast<Instruction>(Val);
428 if (BBI == 0 || BBI->getParent() != BB) {
429 LVILatticeVal Result; // Start Undefined.
430 unsigned NumPreds = 0;
432 // Loop over all of our predecessors, merging what we know from them into
434 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
435 Result.mergeIn(getEdgeValue(*PI, BB));
437 // If we hit overdefined, exit early. The BlockVals entry is already set
439 if (Result.isOverdefined()) {
440 DEBUG(dbgs() << " compute BB '" << BB->getName()
441 << "' - overdefined because of pred.\n");
447 // If this is the entry block, we must be asking about an argument. The
448 // value is overdefined.
449 if (NumPreds == 0 && BB == &BB->getParent()->front()) {
450 assert(isa<Argument>(Val) && "Unknown live-in to the entry block");
451 Result.markOverdefined();
455 // Return the merged value, which is more precise than 'overdefined'.
456 assert(!Result.isOverdefined());
457 return Cache[BB] = Result;
460 // If this value is defined by an instruction in this block, we have to
461 // process it here somehow or return overdefined.
462 if (PHINode *PN = dyn_cast<PHINode>(BBI)) {
463 LVILatticeVal Result; // Start Undefined.
465 // Loop over all of our predecessors, merging what we know from them into
467 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
468 Value* PhiVal = PN->getIncomingValueForBlock(*PI);
469 Result.mergeIn(Parent.getValueOnEdge(PhiVal, *PI, BB));
471 // If we hit overdefined, exit early. The BlockVals entry is already set
473 if (Result.isOverdefined()) {
474 DEBUG(dbgs() << " compute BB '" << BB->getName()
475 << "' - overdefined because of pred.\n");
480 // Return the merged value, which is more precise than 'overdefined'.
481 assert(!Result.isOverdefined());
488 DEBUG(dbgs() << " compute BB '" << BB->getName()
489 << "' - overdefined because inst def found.\n");
491 LVILatticeVal Result;
492 Result.markOverdefined();
497 /// getEdgeValue - This method attempts to infer more complex
498 LVILatticeVal LVIQuery::getEdgeValue(BasicBlock *BBFrom, BasicBlock *BBTo) {
499 // TODO: Handle more complex conditionals. If (v == 0 || v2 < 1) is false, we
501 if (BranchInst *BI = dyn_cast<BranchInst>(BBFrom->getTerminator())) {
502 // If this is a conditional branch and only one successor goes to BBTo, then
503 // we maybe able to infer something from the condition.
504 if (BI->isConditional() &&
505 BI->getSuccessor(0) != BI->getSuccessor(1)) {
506 bool isTrueDest = BI->getSuccessor(0) == BBTo;
507 assert(BI->getSuccessor(!isTrueDest) == BBTo &&
508 "BBTo isn't a successor of BBFrom");
510 // If V is the condition of the branch itself, then we know exactly what
512 if (BI->getCondition() == Val)
513 return LVILatticeVal::get(ConstantInt::get(
514 Type::getInt1Ty(Val->getContext()), isTrueDest));
516 // If the condition of the branch is an equality comparison, we may be
517 // able to infer the value.
518 ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition());
519 if (ICI && ICI->getOperand(0) == Val &&
520 isa<Constant>(ICI->getOperand(1))) {
521 if (ICI->isEquality()) {
522 // We know that V has the RHS constant if this is a true SETEQ or
524 if (isTrueDest == (ICI->getPredicate() == ICmpInst::ICMP_EQ))
525 return LVILatticeVal::get(cast<Constant>(ICI->getOperand(1)));
526 return LVILatticeVal::getNot(cast<Constant>(ICI->getOperand(1)));
529 if (ConstantInt *CI = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
530 // Calculate the range of values that would satisfy the comparison.
531 ConstantRange CmpRange(CI->getValue(), CI->getValue()+1);
532 ConstantRange TrueValues =
533 ConstantRange::makeICmpRegion(ICI->getPredicate(), CmpRange);
535 // If we're interested in the false dest, invert the condition.
536 if (!isTrueDest) TrueValues = TrueValues.inverse();
538 // Figure out the possible values of the query BEFORE this branch.
539 LVILatticeVal InBlock = getBlockValue(BBFrom);
540 if (!InBlock.isConstantRange()) return InBlock;
542 // Find all potential values that satisfy both the input and output
544 ConstantRange PossibleValues =
545 TrueValues.intersectWith(InBlock.getConstantRange());
547 return LVILatticeVal::getRange(PossibleValues);
553 // If the edge was formed by a switch on the value, then we may know exactly
555 if (SwitchInst *SI = dyn_cast<SwitchInst>(BBFrom->getTerminator())) {
556 // If BBTo is the default destination of the switch, we don't know anything.
557 // Given a more powerful range analysis we could know stuff.
558 if (SI->getCondition() == Val && SI->getDefaultDest() != BBTo) {
559 // We only know something if there is exactly one value that goes from
561 unsigned NumEdges = 0;
562 ConstantInt *EdgeVal = 0;
563 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i) {
564 if (SI->getSuccessor(i) != BBTo) continue;
565 if (NumEdges++) break;
566 EdgeVal = SI->getCaseValue(i);
568 assert(EdgeVal && "Missing successor?");
570 return LVILatticeVal::get(EdgeVal);
574 // Otherwise see if the value is known in the block.
575 return getBlockValue(BBFrom);
579 //===----------------------------------------------------------------------===//
580 // LazyValueInfoCache Impl
581 //===----------------------------------------------------------------------===//
583 LVILatticeVal LazyValueInfoCache::getValueInBlock(Value *V, BasicBlock *BB) {
584 // If already a constant, there is nothing to compute.
585 if (Constant *VC = dyn_cast<Constant>(V))
586 return LVILatticeVal::get(VC);
588 DEBUG(dbgs() << "LVI Getting block end value " << *V << " at '"
589 << BB->getName() << "'\n");
591 LVILatticeVal Result = LVIQuery(V, *this,
592 ValueCache[LVIValueHandle(V, this)],
593 OverDefinedCache).getBlockValue(BB);
595 DEBUG(dbgs() << " Result = " << Result << "\n");
599 LVILatticeVal LazyValueInfoCache::
600 getValueOnEdge(Value *V, BasicBlock *FromBB, BasicBlock *ToBB) {
601 // If already a constant, there is nothing to compute.
602 if (Constant *VC = dyn_cast<Constant>(V))
603 return LVILatticeVal::get(VC);
605 DEBUG(dbgs() << "LVI Getting edge value " << *V << " from '"
606 << FromBB->getName() << "' to '" << ToBB->getName() << "'\n");
608 LVILatticeVal Result =
609 LVIQuery(V, *this, ValueCache[LVIValueHandle(V, this)],
610 OverDefinedCache).getEdgeValue(FromBB, ToBB);
612 DEBUG(dbgs() << " Result = " << Result << "\n");
617 void LazyValueInfoCache::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc,
618 BasicBlock *NewSucc) {
619 // When an edge in the graph has been threaded, values that we could not
620 // determine a value for before (i.e. were marked overdefined) may be possible
621 // to solve now. We do NOT try to proactively update these values. Instead,
622 // we clear their entries from the cache, and allow lazy updating to recompute
625 // The updating process is fairly simple: we need to dropped cached info
626 // for all values that were marked overdefined in OldSucc, and for those same
627 // values in any successor of OldSucc (except NewSucc) in which they were
628 // also marked overdefined.
629 std::vector<BasicBlock*> worklist;
630 worklist.push_back(OldSucc);
632 DenseSet<Value*> ClearSet;
633 for (std::set<std::pair<BasicBlock*, Value*> >::iterator
634 I = OverDefinedCache.begin(), E = OverDefinedCache.end(); I != E; ++I) {
635 if (I->first == OldSucc)
636 ClearSet.insert(I->second);
639 // Use a worklist to perform a depth-first search of OldSucc's successors.
640 // NOTE: We do not need a visited list since any blocks we have already
641 // visited will have had their overdefined markers cleared already, and we
642 // thus won't loop to their successors.
643 while (!worklist.empty()) {
644 BasicBlock *ToUpdate = worklist.back();
647 // Skip blocks only accessible through NewSucc.
648 if (ToUpdate == NewSucc) continue;
650 bool changed = false;
651 for (DenseSet<Value*>::iterator I = ClearSet.begin(),E = ClearSet.end();
653 // If a value was marked overdefined in OldSucc, and is here too...
654 std::set<std::pair<BasicBlock*, Value*> >::iterator OI =
655 OverDefinedCache.find(std::make_pair(ToUpdate, *I));
656 if (OI == OverDefinedCache.end()) continue;
658 // Remove it from the caches.
659 ValueCacheEntryTy &Entry = ValueCache[LVIValueHandle(*I, this)];
660 ValueCacheEntryTy::iterator CI = Entry.find(ToUpdate);
662 assert(CI != Entry.end() && "Couldn't find entry to update?");
664 OverDefinedCache.erase(OI);
666 // If we removed anything, then we potentially need to update
667 // blocks successors too.
671 if (!changed) continue;
673 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate));
677 //===----------------------------------------------------------------------===//
678 // LazyValueInfo Impl
679 //===----------------------------------------------------------------------===//
681 bool LazyValueInfo::runOnFunction(Function &F) {
682 TD = getAnalysisIfAvailable<TargetData>();
687 /// getCache - This lazily constructs the LazyValueInfoCache.
688 static LazyValueInfoCache &getCache(void *&PImpl) {
690 PImpl = new LazyValueInfoCache();
691 return *static_cast<LazyValueInfoCache*>(PImpl);
694 void LazyValueInfo::releaseMemory() {
695 // If the cache was allocated, free it.
697 delete &getCache(PImpl);
702 Constant *LazyValueInfo::getConstant(Value *V, BasicBlock *BB) {
703 LVILatticeVal Result = getCache(PImpl).getValueInBlock(V, BB);
705 if (Result.isConstant())
706 return Result.getConstant();
710 /// getConstantOnEdge - Determine whether the specified value is known to be a
711 /// constant on the specified edge. Return null if not.
712 Constant *LazyValueInfo::getConstantOnEdge(Value *V, BasicBlock *FromBB,
714 LVILatticeVal Result = getCache(PImpl).getValueOnEdge(V, FromBB, ToBB);
716 if (Result.isConstant())
717 return Result.getConstant();
718 else if (Result.isConstantRange()) {
719 ConstantRange CR = Result.getConstantRange();
720 if (const APInt *SingleVal = CR.getSingleElement())
721 return ConstantInt::get(V->getContext(), *SingleVal);
726 /// getPredicateOnEdge - Determine whether the specified value comparison
727 /// with a constant is known to be true or false on the specified CFG edge.
728 /// Pred is a CmpInst predicate.
729 LazyValueInfo::Tristate
730 LazyValueInfo::getPredicateOnEdge(unsigned Pred, Value *V, Constant *C,
731 BasicBlock *FromBB, BasicBlock *ToBB) {
732 LVILatticeVal Result = getCache(PImpl).getValueOnEdge(V, FromBB, ToBB);
734 // If we know the value is a constant, evaluate the conditional.
736 if (Result.isConstant()) {
737 Res = ConstantFoldCompareInstOperands(Pred, Result.getConstant(), C, TD);
738 if (ConstantInt *ResCI = dyn_cast_or_null<ConstantInt>(Res))
739 return ResCI->isZero() ? False : True;
743 if (Result.isConstantRange()) {
744 ConstantInt *CI = cast<ConstantInt>(C);
745 ConstantRange CR = Result.getConstantRange();
746 if (Pred == ICmpInst::ICMP_EQ) {
747 if (!CR.contains(CI->getValue()))
750 if (CR.isSingleElement() && CR.contains(CI->getValue()))
752 } else if (Pred == ICmpInst::ICMP_NE) {
753 if (!CR.contains(CI->getValue()))
756 if (CR.isSingleElement() && CR.contains(CI->getValue()))
760 // Handle more complex predicates.
761 ConstantRange RHS(CI->getValue(), CI->getValue()+1);
762 ConstantRange TrueValues = ConstantRange::makeICmpRegion(Pred, RHS);
763 if (CR.intersectWith(TrueValues).isEmptySet())
765 else if (TrueValues.contains(CR))
771 if (Result.isNotConstant()) {
772 // If this is an equality comparison, we can try to fold it knowing that
774 if (Pred == ICmpInst::ICMP_EQ) {
775 // !C1 == C -> false iff C1 == C.
776 Res = ConstantFoldCompareInstOperands(ICmpInst::ICMP_NE,
777 Result.getNotConstant(), C, TD);
778 if (Res->isNullValue())
780 } else if (Pred == ICmpInst::ICMP_NE) {
781 // !C1 != C -> true iff C1 == C.
782 Res = ConstantFoldCompareInstOperands(ICmpInst::ICMP_NE,
783 Result.getNotConstant(), C, TD);
784 if (Res->isNullValue())
793 void LazyValueInfo::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc,
794 BasicBlock* NewSucc) {
795 getCache(PImpl).threadEdge(PredBB, OldSucc, NewSucc);