1 //===-- PredicateSimplifier.cpp - Path Sensitive Simplifier ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Nick Lewycky and is distributed under the
6 // University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // Path-sensitive optimizer. In a branch where x == y, replace uses of
11 // x with y. Permits further optimization, such as the elimination of
12 // the unreachable call:
14 // void test(int *p, int *q)
20 // foo(); // unreachable
23 //===----------------------------------------------------------------------===//
25 // The InequalityGraph focusses on four properties; equals, not equals,
26 // less-than and less-than-or-equals-to. The greater-than forms are also held
27 // just to allow walking from a lesser node to a greater one. These properties
28 // are stored in a lattice; LE can become LT or EQ, NE can become LT or GT.
30 // These relationships define a graph between values of the same type. Each
31 // Value is stored in a map table that retrieves the associated Node. This
32 // is how EQ relationships are stored; the map contains pointers from equal
33 // Value to the same node. The node contains a most canonical Value* form
34 // and the list of known relationships with other nodes.
36 // If two nodes are known to be inequal, then they will contain pointers to
37 // each other with an "NE" relationship. If node getNode(%x) is less than
38 // getNode(%y), then the %x node will contain <%y, GT> and %y will contain
39 // <%x, LT>. This allows us to tie nodes together into a graph like this:
43 // with four nodes representing the properties. The InequalityGraph provides
44 // querying with "isRelatedBy" and mutators "addEquality" and "addInequality".
45 // To find a relationship, we start with one of the nodes any binary search
46 // through its list to find where the relationships with the second node start.
47 // Then we iterate through those to find the first relationship that dominates
50 // To create these properties, we wait until a branch or switch instruction
51 // implies that a particular value is true (or false). The VRPSolver is
52 // responsible for analyzing the variable and seeing what new inferences
53 // can be made from each property. For example:
55 // %P = icmp ne i32* %ptr, null
57 // br i1 %a label %cond_true, label %cond_false
59 // For the true branch, the VRPSolver will start with %a EQ true and look at
60 // the definition of %a and find that it can infer that %P and %Q are both
61 // true. From %P being true, it can infer that %ptr NE null. For the false
62 // branch it can't infer anything from the "and" instruction.
64 // Besides branches, we can also infer properties from instruction that may
65 // have undefined behaviour in certain cases. For example, the dividend of
66 // a division may never be zero. After the division instruction, we may assume
67 // that the dividend is not equal to zero.
69 //===----------------------------------------------------------------------===//
71 // The ValueRanges class stores the known integer bounds of a Value. When we
72 // encounter i8 %a u< %b, the ValueRanges stores that %a = [1, 255] and
73 // %b = [0, 254]. Because we store these by Value*, you should always
74 // canonicalize through the InequalityGraph first.
76 // It never stores an empty range, because that means that the code is
77 // unreachable. It never stores a single-element range since that's an equality
78 // relationship and better stored in the InequalityGraph.
80 //===----------------------------------------------------------------------===//
82 #define DEBUG_TYPE "predsimplify"
83 #include "llvm/Transforms/Scalar.h"
84 #include "llvm/Constants.h"
85 #include "llvm/DerivedTypes.h"
86 #include "llvm/Instructions.h"
87 #include "llvm/Pass.h"
88 #include "llvm/ADT/DepthFirstIterator.h"
89 #include "llvm/ADT/SetOperations.h"
90 #include "llvm/ADT/SetVector.h"
91 #include "llvm/ADT/Statistic.h"
92 #include "llvm/ADT/STLExtras.h"
93 #include "llvm/Analysis/Dominators.h"
94 #include "llvm/Analysis/ET-Forest.h"
95 #include "llvm/Support/CFG.h"
96 #include "llvm/Support/Compiler.h"
97 #include "llvm/Support/ConstantRange.h"
98 #include "llvm/Support/Debug.h"
99 #include "llvm/Support/InstVisitor.h"
100 #include "llvm/Transforms/Utils/Local.h"
104 using namespace llvm;
106 STATISTIC(NumVarsReplaced, "Number of argument substitutions");
107 STATISTIC(NumInstruction , "Number of instructions removed");
108 STATISTIC(NumSimple , "Number of simple replacements");
109 STATISTIC(NumBlocks , "Number of blocks marked unreachable");
110 STATISTIC(NumSnuggle , "Number of comparisons snuggled");
113 // SLT SGT ULT UGT EQ
114 // 0 1 0 1 0 -- GT 10
115 // 0 1 0 1 1 -- GE 11
116 // 0 1 1 0 0 -- SGTULT 12
117 // 0 1 1 0 1 -- SGEULE 13
118 // 0 1 1 1 0 -- SGT 14
119 // 0 1 1 1 1 -- SGE 15
120 // 1 0 0 1 0 -- SLTUGT 18
121 // 1 0 0 1 1 -- SLEUGE 19
122 // 1 0 1 0 0 -- LT 20
123 // 1 0 1 0 1 -- LE 21
124 // 1 0 1 1 0 -- SLT 22
125 // 1 0 1 1 1 -- SLE 23
126 // 1 1 0 1 0 -- UGT 26
127 // 1 1 0 1 1 -- UGE 27
128 // 1 1 1 0 0 -- ULT 28
129 // 1 1 1 0 1 -- ULE 29
130 // 1 1 1 1 0 -- NE 30
132 EQ_BIT = 1, UGT_BIT = 2, ULT_BIT = 4, SGT_BIT = 8, SLT_BIT = 16
135 GT = SGT_BIT | UGT_BIT,
137 LT = SLT_BIT | ULT_BIT,
139 NE = SLT_BIT | SGT_BIT | ULT_BIT | UGT_BIT,
140 SGTULT = SGT_BIT | ULT_BIT,
141 SGEULE = SGTULT | EQ_BIT,
142 SLTUGT = SLT_BIT | UGT_BIT,
143 SLEUGE = SLTUGT | EQ_BIT,
144 ULT = SLT_BIT | SGT_BIT | ULT_BIT,
145 UGT = SLT_BIT | SGT_BIT | UGT_BIT,
146 SLT = SLT_BIT | ULT_BIT | UGT_BIT,
147 SGT = SGT_BIT | ULT_BIT | UGT_BIT,
154 static bool validPredicate(LatticeVal LV) {
156 case GT: case GE: case LT: case LE: case NE:
157 case SGTULT: case SGT: case SGEULE:
158 case SLTUGT: case SLT: case SLEUGE:
160 case SLE: case SGE: case ULE: case UGE:
167 /// reversePredicate - reverse the direction of the inequality
168 static LatticeVal reversePredicate(LatticeVal LV) {
169 unsigned reverse = LV ^ (SLT_BIT|SGT_BIT|ULT_BIT|UGT_BIT); //preserve EQ_BIT
171 if ((reverse & (SLT_BIT|SGT_BIT)) == 0)
172 reverse |= (SLT_BIT|SGT_BIT);
174 if ((reverse & (ULT_BIT|UGT_BIT)) == 0)
175 reverse |= (ULT_BIT|UGT_BIT);
177 LatticeVal Rev = static_cast<LatticeVal>(reverse);
178 assert(validPredicate(Rev) && "Failed reversing predicate.");
182 /// This is a StrictWeakOrdering predicate that sorts ETNodes by how many
183 /// descendants they have. With this, you can iterate through a list sorted
184 /// by this operation and the first matching entry is the most specific
185 /// match for your basic block. The order provided is stable; ETNodes with
186 /// the same number of children are sorted by pointer address.
187 struct VISIBILITY_HIDDEN OrderByDominance {
188 bool operator()(const ETNode *LHS, const ETNode *RHS) const {
189 unsigned LHS_spread = LHS->getDFSNumOut() - LHS->getDFSNumIn();
190 unsigned RHS_spread = RHS->getDFSNumOut() - RHS->getDFSNumIn();
191 if (LHS_spread != RHS_spread) return LHS_spread < RHS_spread;
192 else return LHS < RHS;
196 /// The InequalityGraph stores the relationships between values.
197 /// Each Value in the graph is assigned to a Node. Nodes are pointer
198 /// comparable for equality. The caller is expected to maintain the logical
199 /// consistency of the system.
201 /// The InequalityGraph class may invalidate Node*s after any mutator call.
202 /// @brief The InequalityGraph stores the relationships between values.
203 class VISIBILITY_HIDDEN InequalityGraph {
206 InequalityGraph(); // DO NOT IMPLEMENT
207 InequalityGraph(InequalityGraph &); // DO NOT IMPLEMENT
209 explicit InequalityGraph(ETNode *TreeRoot) : TreeRoot(TreeRoot) {}
213 /// An Edge is contained inside a Node making one end of the edge implicit
214 /// and contains a pointer to the other end. The edge contains a lattice
215 /// value specifying the relationship and an ETNode specifying the root
216 /// in the dominator tree to which this edge applies.
217 class VISIBILITY_HIDDEN Edge {
219 Edge(unsigned T, LatticeVal V, ETNode *ST)
220 : To(T), LV(V), Subtree(ST) {}
226 bool operator<(const Edge &edge) const {
227 if (To != edge.To) return To < edge.To;
228 else return OrderByDominance()(Subtree, edge.Subtree);
230 bool operator<(unsigned to) const {
235 /// A single node in the InequalityGraph. This stores the canonical Value
236 /// for the node, as well as the relationships with the neighbours.
238 /// @brief A single node in the InequalityGraph.
239 class VISIBILITY_HIDDEN Node {
240 friend class InequalityGraph;
242 typedef SmallVector<Edge, 4> RelationsType;
243 RelationsType Relations;
247 // TODO: can this idea improve performance?
248 //friend class std::vector<Node>;
249 //Node(Node &N) { RelationsType.swap(N.RelationsType); }
252 typedef RelationsType::iterator iterator;
253 typedef RelationsType::const_iterator const_iterator;
255 Node(Value *V) : Canonical(V) {}
261 virtual void dump() const {
262 dump(*cerr.stream());
265 void dump(std::ostream &os) const {
266 os << *getValue() << ":\n";
267 for (Node::const_iterator NI = begin(), NE = end(); NI != NE; ++NI) {
268 static const std::string names[32] =
269 { "000000", "000001", "000002", "000003", "000004", "000005",
270 "000006", "000007", "000008", "000009", " >", " >=",
271 " s>u<", "s>=u<=", " s>", " s>=", "000016", "000017",
272 " s<u>", "s<=u>=", " <", " <=", " s<", " s<=",
273 "000024", "000025", " u>", " u>=", " u<", " u<=",
275 os << " " << names[NI->LV] << " " << NI->To
276 << " (" << NI->Subtree->getDFSNumIn() << ")\n";
282 iterator begin() { return Relations.begin(); }
283 iterator end() { return Relations.end(); }
284 const_iterator begin() const { return Relations.begin(); }
285 const_iterator end() const { return Relations.end(); }
287 iterator find(unsigned n, ETNode *Subtree) {
289 for (iterator I = std::lower_bound(begin(), E, n);
290 I != E && I->To == n; ++I) {
291 if (Subtree->DominatedBy(I->Subtree))
297 const_iterator find(unsigned n, ETNode *Subtree) const {
298 const_iterator E = end();
299 for (const_iterator I = std::lower_bound(begin(), E, n);
300 I != E && I->To == n; ++I) {
301 if (Subtree->DominatedBy(I->Subtree))
307 Value *getValue() const
312 /// Updates the lattice value for a given node. Create a new entry if
313 /// one doesn't exist, otherwise it merges the values. The new lattice
314 /// value must not be inconsistent with any previously existing value.
315 void update(unsigned n, LatticeVal R, ETNode *Subtree) {
316 assert(validPredicate(R) && "Invalid predicate.");
317 iterator I = find(n, Subtree);
319 Edge edge(n, R, Subtree);
320 iterator Insert = std::lower_bound(begin(), end(), edge);
321 Relations.insert(Insert, edge);
323 LatticeVal LV = static_cast<LatticeVal>(I->LV & R);
324 assert(validPredicate(LV) && "Invalid union of lattice values.");
326 if (Subtree != I->Subtree) {
327 assert(Subtree->DominatedBy(I->Subtree) &&
328 "Find returned subtree that doesn't apply.");
330 Edge edge(n, R, Subtree);
331 iterator Insert = std::lower_bound(begin(), end(), edge);
332 Relations.insert(Insert, edge); // invalidates I
333 I = find(n, Subtree);
336 // Also, we have to tighten any edge that Subtree dominates.
337 for (iterator B = begin(); I->To == n; --I) {
338 if (I->Subtree->DominatedBy(Subtree)) {
339 LatticeVal LV = static_cast<LatticeVal>(I->LV & R);
340 assert(validPredicate(LV) && "Invalid union of lattice values.");
351 struct VISIBILITY_HIDDEN NodeMapEdge {
356 NodeMapEdge(Value *V, unsigned index, ETNode *Subtree)
357 : V(V), index(index), Subtree(Subtree) {}
359 bool operator==(const NodeMapEdge &RHS) const {
361 Subtree == RHS.Subtree;
364 bool operator<(const NodeMapEdge &RHS) const {
365 if (V != RHS.V) return V < RHS.V;
366 return OrderByDominance()(Subtree, RHS.Subtree);
369 bool operator<(Value *RHS) const {
374 typedef std::vector<NodeMapEdge> NodeMapType;
377 std::vector<Node> Nodes;
380 /// node - returns the node object at a given index retrieved from getNode.
381 /// Index zero is reserved and may not be passed in here. The pointer
382 /// returned is valid until the next call to newNode or getOrInsertNode.
383 Node *node(unsigned index) {
384 assert(index != 0 && "Zero index is reserved for not found.");
385 assert(index <= Nodes.size() && "Index out of range.");
386 return &Nodes[index-1];
389 /// Returns the node currently representing Value V, or zero if no such
391 unsigned getNode(Value *V, ETNode *Subtree) {
392 NodeMapType::iterator E = NodeMap.end();
393 NodeMapEdge Edge(V, 0, Subtree);
394 NodeMapType::iterator I = std::lower_bound(NodeMap.begin(), E, Edge);
395 while (I != E && I->V == V) {
396 if (Subtree->DominatedBy(I->Subtree))
403 /// getOrInsertNode - always returns a valid node index, creating a node
404 /// to match the Value if needed.
405 unsigned getOrInsertNode(Value *V, ETNode *Subtree) {
406 if (unsigned n = getNode(V, Subtree))
412 /// newNode - creates a new node for a given Value and returns the index.
413 unsigned newNode(Value *V) {
414 Nodes.push_back(Node(V));
416 NodeMapEdge MapEntry = NodeMapEdge(V, Nodes.size(), TreeRoot);
417 assert(!std::binary_search(NodeMap.begin(), NodeMap.end(), MapEntry) &&
418 "Attempt to create a duplicate Node.");
419 NodeMap.insert(std::lower_bound(NodeMap.begin(), NodeMap.end(),
420 MapEntry), MapEntry);
421 return MapEntry.index;
424 /// If the Value is in the graph, return the canonical form. Otherwise,
425 /// return the original Value.
426 Value *canonicalize(Value *V, ETNode *Subtree) {
427 if (isa<Constant>(V)) return V;
429 if (unsigned n = getNode(V, Subtree))
430 return node(n)->getValue();
435 /// isRelatedBy - true iff n1 op n2
436 bool isRelatedBy(unsigned n1, unsigned n2, ETNode *Subtree, LatticeVal LV) {
437 if (n1 == n2) return LV & EQ_BIT;
440 Node::iterator I = N1->find(n2, Subtree), E = N1->end();
441 if (I != E) return (I->LV & LV) == I->LV;
446 // The add* methods assume that your input is logically valid and may
447 // assertion-fail or infinitely loop if you attempt a contradiction.
449 void addEquality(unsigned n, Value *V, ETNode *Subtree) {
450 assert(canonicalize(node(n)->getValue(), Subtree) == node(n)->getValue()
451 && "Node's 'canonical' choice isn't best within this subtree.");
453 // Suppose that we are given "%x -> node #1 (%y)". The problem is that
454 // we may already have "%z -> node #2 (%x)" somewhere above us in the
455 // graph. We need to find those edges and add "%z -> node #1 (%y)"
456 // to keep the lookups canonical.
458 std::vector<Value *> ToRepoint;
459 ToRepoint.push_back(V);
461 if (unsigned Conflict = getNode(V, Subtree)) {
462 // XXX: NodeMap.size() exceeds 68,000 entries compiling kimwitu++!
463 for (NodeMapType::iterator I = NodeMap.begin(), E = NodeMap.end();
465 if (I->index == Conflict && Subtree->DominatedBy(I->Subtree))
466 ToRepoint.push_back(I->V);
470 for (std::vector<Value *>::iterator VI = ToRepoint.begin(),
471 VE = ToRepoint.end(); VI != VE; ++VI) {
474 // XXX: review this code. This may be doing too many insertions.
475 NodeMapEdge Edge(V, n, Subtree);
476 NodeMapType::iterator E = NodeMap.end();
477 NodeMapType::iterator I = std::lower_bound(NodeMap.begin(), E, Edge);
478 if (I == E || I->V != V || I->Subtree != Subtree) {
480 NodeMap.insert(I, Edge);
481 } else if (I != E && I->V == V && I->Subtree == Subtree) {
482 // Update best choice
488 if (isa<Constant>(V)) {
489 if (isa<Constant>(N->getValue())) {
490 assert(V == N->getValue() && "Constant equals different constant?");
497 /// addInequality - Sets n1 op n2.
498 /// It is also an error to call this on an inequality that is already true.
499 void addInequality(unsigned n1, unsigned n2, ETNode *Subtree,
501 assert(n1 != n2 && "A node can't be inequal to itself.");
504 assert(!isRelatedBy(n1, n2, Subtree, reversePredicate(LV1)) &&
505 "Contradictory inequality.");
510 // Suppose we're adding %n1 < %n2. Find all the %a < %n1 and
511 // add %a < %n2 too. This keeps the graph fully connected.
513 // Someone with a head for this sort of logic, please review this.
514 // Given that %x SLTUGT %y and %a SLE %x, what is the relationship
515 // between %a and %y? I believe the below code is correct, but I don't
516 // think it's the most efficient solution.
518 unsigned LV1_s = LV1 & (SLT_BIT|SGT_BIT);
519 unsigned LV1_u = LV1 & (ULT_BIT|UGT_BIT);
520 for (Node::iterator I = N1->begin(), E = N1->end(); I != E; ++I) {
521 if (I->LV != NE && I->To != n2) {
522 ETNode *Local_Subtree = NULL;
523 if (Subtree->DominatedBy(I->Subtree))
524 Local_Subtree = Subtree;
525 else if (I->Subtree->DominatedBy(Subtree))
526 Local_Subtree = I->Subtree;
529 unsigned new_relationship = 0;
530 LatticeVal ILV = reversePredicate(I->LV);
531 unsigned ILV_s = ILV & (SLT_BIT|SGT_BIT);
532 unsigned ILV_u = ILV & (ULT_BIT|UGT_BIT);
534 if (LV1_s != (SLT_BIT|SGT_BIT) && ILV_s == LV1_s)
535 new_relationship |= ILV_s;
537 if (LV1_u != (ULT_BIT|UGT_BIT) && ILV_u == LV1_u)
538 new_relationship |= ILV_u;
540 if (new_relationship) {
541 if ((new_relationship & (SLT_BIT|SGT_BIT)) == 0)
542 new_relationship |= (SLT_BIT|SGT_BIT);
543 if ((new_relationship & (ULT_BIT|UGT_BIT)) == 0)
544 new_relationship |= (ULT_BIT|UGT_BIT);
545 if ((LV1 & EQ_BIT) && (ILV & EQ_BIT))
546 new_relationship |= EQ_BIT;
548 LatticeVal NewLV = static_cast<LatticeVal>(new_relationship);
550 node(I->To)->update(n2, NewLV, Local_Subtree);
551 N2->update(I->To, reversePredicate(NewLV), Local_Subtree);
557 for (Node::iterator I = N2->begin(), E = N2->end(); I != E; ++I) {
558 if (I->LV != NE && I->To != n1) {
559 ETNode *Local_Subtree = NULL;
560 if (Subtree->DominatedBy(I->Subtree))
561 Local_Subtree = Subtree;
562 else if (I->Subtree->DominatedBy(Subtree))
563 Local_Subtree = I->Subtree;
566 unsigned new_relationship = 0;
567 unsigned ILV_s = I->LV & (SLT_BIT|SGT_BIT);
568 unsigned ILV_u = I->LV & (ULT_BIT|UGT_BIT);
570 if (LV1_s != (SLT_BIT|SGT_BIT) && ILV_s == LV1_s)
571 new_relationship |= ILV_s;
573 if (LV1_u != (ULT_BIT|UGT_BIT) && ILV_u == LV1_u)
574 new_relationship |= ILV_u;
576 if (new_relationship) {
577 if ((new_relationship & (SLT_BIT|SGT_BIT)) == 0)
578 new_relationship |= (SLT_BIT|SGT_BIT);
579 if ((new_relationship & (ULT_BIT|UGT_BIT)) == 0)
580 new_relationship |= (ULT_BIT|UGT_BIT);
581 if ((LV1 & EQ_BIT) && (I->LV & EQ_BIT))
582 new_relationship |= EQ_BIT;
584 LatticeVal NewLV = static_cast<LatticeVal>(new_relationship);
586 N1->update(I->To, NewLV, Local_Subtree);
587 node(I->To)->update(n1, reversePredicate(NewLV), Local_Subtree);
594 N1->update(n2, LV1, Subtree);
595 N2->update(n1, reversePredicate(LV1), Subtree);
598 /// remove - Removes a Value from the graph. If the value is the canonical
599 /// choice for a Node, destroys the Node from the graph deleting all edges
600 /// to and from it. This method does not renumber the nodes.
601 void remove(Value *V) {
602 for (unsigned i = 0; i < NodeMap.size();) {
603 NodeMapType::iterator I = NodeMap.begin()+i;
605 Node *N = node(I->index);
606 if (node(I->index)->getValue() == V) {
607 for (Node::iterator NI = N->begin(), NE = N->end(); NI != NE; ++NI){
608 Node::iterator Iter = node(NI->To)->find(I->index, TreeRoot);
610 node(NI->To)->Relations.erase(Iter);
611 Iter = node(NI->To)->find(I->index, TreeRoot);
612 } while (Iter != node(NI->To)->end());
616 N->Relations.clear();
623 virtual ~InequalityGraph() {}
624 virtual void dump() {
625 dump(*cerr.stream());
628 void dump(std::ostream &os) {
629 std::set<Node *> VisitedNodes;
630 for (NodeMapType::const_iterator I = NodeMap.begin(), E = NodeMap.end();
632 Node *N = node(I->index);
633 os << *I->V << " == " << I->index
634 << "(" << I->Subtree->getDFSNumIn() << ")\n";
635 if (VisitedNodes.insert(N).second) {
636 os << I->index << ". ";
637 if (!N->getValue()) os << "(deleted node)\n";
647 /// ValueRanges tracks the known integer ranges and anti-ranges of the nodes
648 /// in the InequalityGraph.
649 class VISIBILITY_HIDDEN ValueRanges {
651 /// A ScopedRange ties an InequalityGraph node with a ConstantRange under
652 /// the scope of a rooted subtree in the dominator tree.
653 class VISIBILITY_HIDDEN ScopedRange {
655 ScopedRange(Value *V, ConstantRange CR, ETNode *ST)
656 : V(V), CR(CR), Subtree(ST) {}
662 bool operator<(const ScopedRange &range) const {
663 if (V != range.V) return V < range.V;
664 else return OrderByDominance()(Subtree, range.Subtree);
667 bool operator<(const Value *value) const {
672 std::vector<ScopedRange> Ranges;
673 typedef std::vector<ScopedRange>::iterator iterator;
675 // XXX: this is a copy of the code in InequalityGraph::Node. Perhaps a
676 // intrusive domtree-scoped container is in order?
678 iterator begin() { return Ranges.begin(); }
679 iterator end() { return Ranges.end(); }
681 iterator find(Value *V, ETNode *Subtree) {
683 for (iterator I = std::lower_bound(begin(), E, V);
684 I != E && I->V == V; ++I) {
685 if (Subtree->DominatedBy(I->Subtree))
691 void update(Value *V, ConstantRange CR, ETNode *Subtree) {
692 assert(!CR.isEmptySet() && "Empty ConstantRange!");
693 if (CR.isFullSet()) return;
695 iterator I = find(V, Subtree);
697 ScopedRange range(V, CR, Subtree);
698 iterator Insert = std::lower_bound(begin(), end(), range);
699 Ranges.insert(Insert, range);
701 CR = CR.intersectWith(I->CR);
702 assert(!CR.isEmptySet() && "Empty intersection of ConstantRanges!");
705 if (Subtree != I->Subtree) {
706 assert(Subtree->DominatedBy(I->Subtree) &&
707 "Find returned subtree that doesn't apply.");
709 ScopedRange range(V, CR, Subtree);
710 iterator Insert = std::lower_bound(begin(), end(), range);
711 Ranges.insert(Insert, range); // invalidates I
712 I = find(V, Subtree);
715 // Also, we have to tighten any edge that Subtree dominates.
716 for (iterator B = begin(); I->V == V; --I) {
717 if (I->Subtree->DominatedBy(Subtree)) {
718 CR = CR.intersectWith(I->CR);
719 assert(!CR.isEmptySet() &&
720 "Empty intersection of ConstantRanges!");
729 /// range - Creates a ConstantRange representing the set of all values
730 /// that match the ICmpInst::Predicate with any of the values in CR.
731 ConstantRange range(ICmpInst::Predicate ICmpOpcode,
732 const ConstantRange &CR) {
733 uint32_t W = CR.getBitWidth();
734 switch (ICmpOpcode) {
735 default: assert(!"Invalid ICmp opcode to range()");
736 case ICmpInst::ICMP_EQ:
737 return ConstantRange(CR.getLower(), CR.getUpper());
738 case ICmpInst::ICMP_NE:
739 if (CR.isSingleElement())
740 return ConstantRange(CR.getUpper(), CR.getLower());
741 return ConstantRange(W);
742 case ICmpInst::ICMP_ULT:
743 return ConstantRange(APInt::getMinValue(W), CR.getUnsignedMax());
744 case ICmpInst::ICMP_SLT:
745 return ConstantRange(APInt::getSignedMinValue(W), CR.getSignedMax());
746 case ICmpInst::ICMP_ULE: {
747 APInt UMax = CR.getUnsignedMax();
748 if (UMax == APInt::getMaxValue(W))
749 return ConstantRange(W);
750 return ConstantRange(APInt::getMinValue(W), UMax + 1);
752 case ICmpInst::ICMP_SLE: {
753 APInt SMax = CR.getSignedMax();
754 if (SMax == APInt::getSignedMaxValue(W) ||
755 SMax + 1 == APInt::getSignedMaxValue(W))
756 return ConstantRange(W);
757 return ConstantRange(APInt::getSignedMinValue(W), SMax + 1);
759 case ICmpInst::ICMP_UGT:
760 return ConstantRange(CR.getUnsignedMin() + 1,
761 APInt::getMaxValue(W) + 1);
762 case ICmpInst::ICMP_SGT:
763 return ConstantRange(CR.getSignedMin() + 1,
764 APInt::getSignedMaxValue(W) + 1);
765 case ICmpInst::ICMP_UGE: {
766 APInt UMin = CR.getUnsignedMin();
767 if (UMin == APInt::getMinValue(W))
768 return ConstantRange(W);
769 return ConstantRange(UMin, APInt::getMaxValue(W) + 1);
771 case ICmpInst::ICMP_SGE: {
772 APInt SMin = CR.getSignedMin();
773 if (SMin == APInt::getSignedMinValue(W))
774 return ConstantRange(W);
775 return ConstantRange(SMin, APInt::getSignedMaxValue(W) + 1);
780 /// create - Creates a ConstantRange that matches the given LatticeVal
781 /// relation with a given integer.
782 ConstantRange create(LatticeVal LV, const ConstantRange &CR) {
783 assert(!CR.isEmptySet() && "Can't deal with empty set.");
786 return range(ICmpInst::ICMP_NE, CR);
788 unsigned LV_s = LV & (SGT_BIT|SLT_BIT);
789 unsigned LV_u = LV & (UGT_BIT|ULT_BIT);
790 bool hasEQ = LV & EQ_BIT;
792 ConstantRange Range(CR.getBitWidth());
794 if (LV_s == SGT_BIT) {
795 Range = Range.intersectWith(range(
796 hasEQ ? ICmpInst::ICMP_SGE : ICmpInst::ICMP_SGT, CR));
797 } else if (LV_s == SLT_BIT) {
798 Range = Range.intersectWith(range(
799 hasEQ ? ICmpInst::ICMP_SLE : ICmpInst::ICMP_SLT, CR));
802 if (LV_u == UGT_BIT) {
803 Range = Range.intersectWith(range(
804 hasEQ ? ICmpInst::ICMP_UGE : ICmpInst::ICMP_UGT, CR));
805 } else if (LV_u == ULT_BIT) {
806 Range = Range.intersectWith(range(
807 hasEQ ? ICmpInst::ICMP_ULE : ICmpInst::ICMP_ULT, CR));
813 ConstantRange rangeFromValue(Value *V, ETNode *Subtree, uint32_t W) {
814 ConstantInt *C = dyn_cast<ConstantInt>(V);
816 return ConstantRange(C->getValue());
818 iterator I = find(V, Subtree);
822 return ConstantRange(W);
825 static uint32_t widthOfValue(Value *V) {
826 const Type *Ty = V->getType();
827 if (const IntegerType *ITy = dyn_cast<IntegerType>(Ty))
828 return ITy->getBitWidth();
830 // XXX: I'd like to transform T* into the appropriate integer by
831 // bit length, however that data may not be available.
838 bool isRelatedBy(Value *V1, Value *V2, ETNode *Subtree, LatticeVal LV) {
839 uint32_t W = widthOfValue(V1);
840 if (!W) return false;
842 ConstantRange CR1 = rangeFromValue(V1, Subtree, W);
843 ConstantRange CR2 = rangeFromValue(V2, Subtree, W);
845 // True iff all values in CR1 are LV to all values in CR2.
847 default: assert(!"Impossible lattice value!");
849 return CR1.intersectWith(CR2).isEmptySet();
851 return CR1.getUnsignedMax().ult(CR2.getUnsignedMin());
853 return CR1.getUnsignedMax().ule(CR2.getUnsignedMin());
855 return CR1.getUnsignedMin().ugt(CR2.getUnsignedMax());
857 return CR1.getUnsignedMin().uge(CR2.getUnsignedMax());
859 return CR1.getSignedMax().slt(CR2.getSignedMin());
861 return CR1.getSignedMax().sle(CR2.getSignedMin());
863 return CR1.getSignedMin().sgt(CR2.getSignedMax());
865 return CR1.getSignedMin().sge(CR2.getSignedMax());
867 return CR1.getUnsignedMax().ult(CR2.getUnsignedMin()) &&
868 CR1.getSignedMax().slt(CR2.getUnsignedMin());
870 return CR1.getUnsignedMax().ule(CR2.getUnsignedMin()) &&
871 CR1.getSignedMax().sle(CR2.getUnsignedMin());
873 return CR1.getUnsignedMin().ugt(CR2.getUnsignedMax()) &&
874 CR1.getSignedMin().sgt(CR2.getSignedMax());
876 return CR1.getUnsignedMin().uge(CR2.getUnsignedMax()) &&
877 CR1.getSignedMin().sge(CR2.getSignedMax());
879 return CR1.getSignedMax().slt(CR2.getSignedMin()) &&
880 CR1.getUnsignedMin().ugt(CR2.getUnsignedMax());
882 return CR1.getSignedMax().sle(CR2.getSignedMin()) &&
883 CR1.getUnsignedMin().uge(CR2.getUnsignedMax());
885 return CR1.getSignedMin().sgt(CR2.getSignedMax()) &&
886 CR1.getUnsignedMax().ult(CR2.getUnsignedMin());
888 return CR1.getSignedMin().sge(CR2.getSignedMax()) &&
889 CR1.getUnsignedMax().ule(CR2.getUnsignedMin());
893 void addToWorklist(Value *V, const APInt *I, ICmpInst::Predicate Pred,
896 void addInequality(Value *V1, Value *V2, ETNode *Subtree, LatticeVal LV,
898 assert(!isRelatedBy(V1, V2, Subtree, LV) && "Asked to do useless work.");
900 if (LV == NE) return; // we can't represent those.
901 // XXX: except in the case where isSingleElement and equal to either
902 // Lower or Upper. That's probably not profitable. (Type::Int1Ty?)
904 uint32_t W = widthOfValue(V1);
907 ConstantRange CR1 = rangeFromValue(V1, Subtree, W);
908 ConstantRange CR2 = rangeFromValue(V2, Subtree, W);
910 if (!CR1.isSingleElement()) {
911 ConstantRange NewCR1 = CR1.intersectWith(create(LV, CR2));
913 if (NewCR1.isSingleElement())
914 addToWorklist(V1, NewCR1.getSingleElement(),
915 ICmpInst::ICMP_EQ, VRP);
917 update(V1, NewCR1, Subtree);
921 if (!CR2.isSingleElement()) {
922 ConstantRange NewCR2 = CR2.intersectWith(create(reversePredicate(LV),
925 if (NewCR2.isSingleElement())
926 addToWorklist(V2, NewCR2.getSingleElement(),
927 ICmpInst::ICMP_EQ, VRP);
929 update(V2, NewCR2, Subtree);
935 /// UnreachableBlocks keeps tracks of blocks that are for one reason or
936 /// another discovered to be unreachable. This is used to cull the graph when
937 /// analyzing instructions, and to mark blocks with the "unreachable"
938 /// terminator instruction after the function has executed.
939 class VISIBILITY_HIDDEN UnreachableBlocks {
941 std::vector<BasicBlock *> DeadBlocks;
944 /// mark - mark a block as dead
945 void mark(BasicBlock *BB) {
946 std::vector<BasicBlock *>::iterator E = DeadBlocks.end();
947 std::vector<BasicBlock *>::iterator I =
948 std::lower_bound(DeadBlocks.begin(), E, BB);
950 if (I == E || *I != BB) DeadBlocks.insert(I, BB);
953 /// isDead - returns whether a block is known to be dead already
954 bool isDead(BasicBlock *BB) {
955 std::vector<BasicBlock *>::iterator E = DeadBlocks.end();
956 std::vector<BasicBlock *>::iterator I =
957 std::lower_bound(DeadBlocks.begin(), E, BB);
959 return I != E && *I == BB;
962 /// kill - replace the dead blocks' terminator with an UnreachableInst.
964 bool modified = false;
965 for (std::vector<BasicBlock *>::iterator I = DeadBlocks.begin(),
966 E = DeadBlocks.end(); I != E; ++I) {
969 DOUT << "unreachable block: " << BB->getName() << "\n";
971 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
973 BasicBlock *Succ = *SI;
974 Succ->removePredecessor(BB);
977 TerminatorInst *TI = BB->getTerminator();
978 TI->replaceAllUsesWith(UndefValue::get(TI->getType()));
979 TI->eraseFromParent();
980 new UnreachableInst(BB);
989 /// VRPSolver keeps track of how changes to one variable affect other
990 /// variables, and forwards changes along to the InequalityGraph. It
991 /// also maintains the correct choice for "canonical" in the IG.
992 /// @brief VRPSolver calculates inferences from a new relationship.
993 class VISIBILITY_HIDDEN VRPSolver {
995 friend class ValueRanges;
999 ICmpInst::Predicate Op;
1001 BasicBlock *ContextBB;
1002 Instruction *ContextInst;
1004 std::deque<Operation> WorkList;
1006 InequalityGraph &IG;
1007 UnreachableBlocks &UB;
1013 Instruction *TopInst;
1016 typedef InequalityGraph::Node Node;
1018 /// IdomI - Determines whether one Instruction dominates another.
1019 bool IdomI(Instruction *I1, Instruction *I2) const {
1020 BasicBlock *BB1 = I1->getParent(),
1021 *BB2 = I2->getParent();
1023 if (isa<TerminatorInst>(I1)) return false;
1024 if (isa<TerminatorInst>(I2)) return true;
1025 if (isa<PHINode>(I1) && !isa<PHINode>(I2)) return true;
1026 if (!isa<PHINode>(I1) && isa<PHINode>(I2)) return false;
1028 for (BasicBlock::const_iterator I = BB1->begin(), E = BB1->end();
1030 if (&*I == I1) return true;
1031 if (&*I == I2) return false;
1033 assert(!"Instructions not found in parent BasicBlock?");
1035 return Forest->properlyDominates(BB1, BB2);
1040 /// Returns true if V1 is a better canonical value than V2.
1041 bool compare(Value *V1, Value *V2) const {
1042 if (isa<Constant>(V1))
1043 return !isa<Constant>(V2);
1044 else if (isa<Constant>(V2))
1046 else if (isa<Argument>(V1))
1047 return !isa<Argument>(V2);
1048 else if (isa<Argument>(V2))
1051 Instruction *I1 = dyn_cast<Instruction>(V1);
1052 Instruction *I2 = dyn_cast<Instruction>(V2);
1055 return V1->getNumUses() < V2->getNumUses();
1057 return IdomI(I1, I2);
1060 // below - true if the Instruction is dominated by the current context
1061 // block or instruction
1062 bool below(Instruction *I) {
1064 return IdomI(TopInst, I);
1066 ETNode *Node = Forest->getNodeForBlock(I->getParent());
1067 return Node->DominatedBy(Top);
1071 bool makeEqual(Value *V1, Value *V2) {
1072 DOUT << "makeEqual(" << *V1 << ", " << *V2 << ")\n";
1074 if (V1 == V2) return true;
1076 if (isa<Constant>(V1) && isa<Constant>(V2))
1079 unsigned n1 = IG.getNode(V1, Top), n2 = IG.getNode(V2, Top);
1082 if (n1 == n2) return true;
1083 if (IG.isRelatedBy(n1, n2, Top, NE)) return false;
1086 if (n1) assert(V1 == IG.node(n1)->getValue() && "Value isn't canonical.");
1087 if (n2) assert(V2 == IG.node(n2)->getValue() && "Value isn't canonical.");
1089 assert(!compare(V2, V1) && "Please order parameters to makeEqual.");
1091 assert(!isa<Constant>(V2) && "Tried to remove a constant.");
1093 SetVector<unsigned> Remove;
1094 if (n2) Remove.insert(n2);
1097 // Suppose we're being told that %x == %y, and %x <= %z and %y >= %z.
1098 // We can't just merge %x and %y because the relationship with %z would
1099 // be EQ and that's invalid. What we're doing is looking for any nodes
1100 // %z such that %x <= %z and %y >= %z, and vice versa.
1102 Node *N1 = IG.node(n1);
1103 Node *N2 = IG.node(n2);
1104 Node::iterator end = N2->end();
1106 // Find the intersection between N1 and N2 which is dominated by
1107 // Top. If we find %x where N1 <= %x <= N2 (or >=) then add %x to
1109 for (Node::iterator I = N1->begin(), E = N1->end(); I != E; ++I) {
1110 if (!(I->LV & EQ_BIT) || !Top->DominatedBy(I->Subtree)) continue;
1112 unsigned ILV_s = I->LV & (SLT_BIT|SGT_BIT);
1113 unsigned ILV_u = I->LV & (ULT_BIT|UGT_BIT);
1114 Node::iterator NI = N2->find(I->To, Top);
1116 LatticeVal NILV = reversePredicate(NI->LV);
1117 unsigned NILV_s = NILV & (SLT_BIT|SGT_BIT);
1118 unsigned NILV_u = NILV & (ULT_BIT|UGT_BIT);
1120 if ((ILV_s != (SLT_BIT|SGT_BIT) && ILV_s == NILV_s) ||
1121 (ILV_u != (ULT_BIT|UGT_BIT) && ILV_u == NILV_u))
1122 Remove.insert(I->To);
1126 // See if one of the nodes about to be removed is actually a better
1127 // canonical choice than n1.
1128 unsigned orig_n1 = n1;
1129 SetVector<unsigned>::iterator DontRemove = Remove.end();
1130 for (SetVector<unsigned>::iterator I = Remove.begin()+1 /* skip n2 */,
1131 E = Remove.end(); I != E; ++I) {
1133 Value *V = IG.node(n)->getValue();
1134 if (compare(V, V1)) {
1140 if (DontRemove != Remove.end()) {
1141 unsigned n = *DontRemove;
1143 Remove.insert(orig_n1);
1147 // We'd like to allow makeEqual on two values to perform a simple
1148 // substitution without every creating nodes in the IG whenever possible.
1150 // The first iteration through this loop operates on V2 before going
1151 // through the Remove list and operating on those too. If all of the
1152 // iterations performed simple replacements then we exit early.
1153 bool exitEarly = true;
1155 for (Value *R = V2; i == 0 || i < Remove.size(); ++i) {
1156 if (i) R = IG.node(Remove[i])->getValue(); // skip n2.
1158 // Try to replace the whole instruction. If we can, we're done.
1159 Instruction *I2 = dyn_cast<Instruction>(R);
1160 if (I2 && below(I2)) {
1161 std::vector<Instruction *> ToNotify;
1162 for (Value::use_iterator UI = R->use_begin(), UE = R->use_end();
1164 Use &TheUse = UI.getUse();
1166 if (Instruction *I = dyn_cast<Instruction>(TheUse.getUser()))
1167 ToNotify.push_back(I);
1170 DOUT << "Simply removing " << *I2
1171 << ", replacing with " << *V1 << "\n";
1172 I2->replaceAllUsesWith(V1);
1173 // leave it dead; it'll get erased later.
1177 for (std::vector<Instruction *>::iterator II = ToNotify.begin(),
1178 IE = ToNotify.end(); II != IE; ++II) {
1185 // Otherwise, replace all dominated uses.
1186 for (Value::use_iterator UI = R->use_begin(), UE = R->use_end();
1188 Use &TheUse = UI.getUse();
1190 if (Instruction *I = dyn_cast<Instruction>(TheUse.getUser())) {
1200 // If that killed the instruction, stop here.
1201 if (I2 && isInstructionTriviallyDead(I2)) {
1202 DOUT << "Killed all uses of " << *I2
1203 << ", replacing with " << *V1 << "\n";
1207 // If we make it to here, then we will need to create a node for N1.
1208 // Otherwise, we can skip out early!
1212 if (exitEarly) return true;
1215 if (!n1) n1 = IG.newNode(V1);
1217 // Migrate relationships from removed nodes to N1.
1218 Node *N1 = IG.node(n1);
1219 for (SetVector<unsigned>::iterator I = Remove.begin(), E = Remove.end();
1222 Node *N = IG.node(n);
1223 for (Node::iterator NI = N->begin(), NE = N->end(); NI != NE; ++NI) {
1224 if (NI->Subtree->DominatedBy(Top)) {
1226 assert((NI->LV & EQ_BIT) && "Node inequal to itself.");
1229 if (Remove.count(NI->To))
1232 IG.node(NI->To)->update(n1, reversePredicate(NI->LV), Top);
1233 N1->update(NI->To, NI->LV, Top);
1238 // Point V2 (and all items in Remove) to N1.
1240 IG.addEquality(n1, V2, Top);
1242 for (SetVector<unsigned>::iterator I = Remove.begin(),
1243 E = Remove.end(); I != E; ++I) {
1244 IG.addEquality(n1, IG.node(*I)->getValue(), Top);
1248 // If !Remove.empty() then V2 = Remove[0]->getValue().
1249 // Even when Remove is empty, we still want to process V2.
1251 for (Value *R = V2; i == 0 || i < Remove.size(); ++i) {
1252 if (i) R = IG.node(Remove[i])->getValue(); // skip n2.
1254 if (Instruction *I2 = dyn_cast<Instruction>(R)) {
1256 Top->DominatedBy(Forest->getNodeForBlock(I2->getParent())))
1259 for (Value::use_iterator UI = V2->use_begin(), UE = V2->use_end();
1261 Use &TheUse = UI.getUse();
1263 if (Instruction *I = dyn_cast<Instruction>(TheUse.getUser())) {
1265 Top->DominatedBy(Forest->getNodeForBlock(I->getParent())))
1274 /// cmpInstToLattice - converts an CmpInst::Predicate to lattice value
1275 /// Requires that the lattice value be valid; does not accept ICMP_EQ.
1276 static LatticeVal cmpInstToLattice(ICmpInst::Predicate Pred) {
1278 case ICmpInst::ICMP_EQ:
1279 assert(!"No matching lattice value.");
1280 return static_cast<LatticeVal>(EQ_BIT);
1282 assert(!"Invalid 'icmp' predicate.");
1283 case ICmpInst::ICMP_NE:
1285 case ICmpInst::ICMP_UGT:
1287 case ICmpInst::ICMP_UGE:
1289 case ICmpInst::ICMP_ULT:
1291 case ICmpInst::ICMP_ULE:
1293 case ICmpInst::ICMP_SGT:
1295 case ICmpInst::ICMP_SGE:
1297 case ICmpInst::ICMP_SLT:
1299 case ICmpInst::ICMP_SLE:
1305 VRPSolver(InequalityGraph &IG, UnreachableBlocks &UB, ValueRanges &VR,
1306 ETForest *Forest, bool &modified, BasicBlock *TopBB)
1311 Top(Forest->getNodeForBlock(TopBB)),
1314 modified(modified) {}
1316 VRPSolver(InequalityGraph &IG, UnreachableBlocks &UB, ValueRanges &VR,
1317 ETForest *Forest, bool &modified, Instruction *TopInst)
1325 TopBB = TopInst->getParent();
1326 Top = Forest->getNodeForBlock(TopBB);
1329 bool isRelatedBy(Value *V1, Value *V2, ICmpInst::Predicate Pred) const {
1330 if (Constant *C1 = dyn_cast<Constant>(V1))
1331 if (Constant *C2 = dyn_cast<Constant>(V2))
1332 return ConstantExpr::getCompare(Pred, C1, C2) ==
1333 ConstantInt::getTrue();
1335 if (unsigned n1 = IG.getNode(V1, Top))
1336 if (unsigned n2 = IG.getNode(V2, Top)) {
1337 if (n1 == n2) return Pred == ICmpInst::ICMP_EQ ||
1338 Pred == ICmpInst::ICMP_ULE ||
1339 Pred == ICmpInst::ICMP_UGE ||
1340 Pred == ICmpInst::ICMP_SLE ||
1341 Pred == ICmpInst::ICMP_SGE;
1342 if (Pred == ICmpInst::ICMP_EQ) return false;
1343 if (IG.isRelatedBy(n1, n2, Top, cmpInstToLattice(Pred))) return true;
1346 if (Pred == ICmpInst::ICMP_EQ) return V1 == V2;
1347 return VR.isRelatedBy(V1, V2, Top, cmpInstToLattice(Pred));
1350 /// add - adds a new property to the work queue
1351 void add(Value *V1, Value *V2, ICmpInst::Predicate Pred,
1352 Instruction *I = NULL) {
1353 DOUT << "adding " << *V1 << " " << Pred << " " << *V2;
1354 if (I) DOUT << " context: " << *I;
1355 else DOUT << " default context";
1358 WorkList.push_back(Operation());
1359 Operation &O = WorkList.back();
1360 O.LHS = V1, O.RHS = V2, O.Op = Pred, O.ContextInst = I;
1361 O.ContextBB = I ? I->getParent() : TopBB;
1364 /// defToOps - Given an instruction definition that we've learned something
1365 /// new about, find any new relationships between its operands.
1366 void defToOps(Instruction *I) {
1367 Instruction *NewContext = below(I) ? I : TopInst;
1368 Value *Canonical = IG.canonicalize(I, Top);
1370 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
1371 const Type *Ty = BO->getType();
1372 assert(!Ty->isFPOrFPVector() && "Float in work queue!");
1374 Value *Op0 = IG.canonicalize(BO->getOperand(0), Top);
1375 Value *Op1 = IG.canonicalize(BO->getOperand(1), Top);
1377 // TODO: "and i32 -1, %x" EQ %y then %x EQ %y.
1379 switch (BO->getOpcode()) {
1380 case Instruction::And: {
1381 // "and i32 %a, %b" EQ -1 then %a EQ -1 and %b EQ -1
1382 ConstantInt *CI = ConstantInt::getAllOnesValue(Ty);
1383 if (Canonical == CI) {
1384 add(CI, Op0, ICmpInst::ICMP_EQ, NewContext);
1385 add(CI, Op1, ICmpInst::ICMP_EQ, NewContext);
1388 case Instruction::Or: {
1389 // "or i32 %a, %b" EQ 0 then %a EQ 0 and %b EQ 0
1390 Constant *Zero = Constant::getNullValue(Ty);
1391 if (Canonical == Zero) {
1392 add(Zero, Op0, ICmpInst::ICMP_EQ, NewContext);
1393 add(Zero, Op1, ICmpInst::ICMP_EQ, NewContext);
1396 case Instruction::Xor: {
1397 // "xor i32 %c, %a" EQ %b then %a EQ %c ^ %b
1398 // "xor i32 %c, %a" EQ %c then %a EQ 0
1399 // "xor i32 %c, %a" NE %c then %a NE 0
1400 // Repeat the above, with order of operands reversed.
1403 if (!isa<Constant>(LHS)) std::swap(LHS, RHS);
1405 if (ConstantInt *CI = dyn_cast<ConstantInt>(Canonical)) {
1406 if (ConstantInt *Arg = dyn_cast<ConstantInt>(LHS)) {
1407 add(RHS, ConstantInt::get(CI->getValue() ^ Arg->getValue()),
1408 ICmpInst::ICMP_EQ, NewContext);
1411 if (Canonical == LHS) {
1412 if (isa<ConstantInt>(Canonical))
1413 add(RHS, Constant::getNullValue(Ty), ICmpInst::ICMP_EQ,
1415 } else if (isRelatedBy(LHS, Canonical, ICmpInst::ICMP_NE)) {
1416 add(RHS, Constant::getNullValue(Ty), ICmpInst::ICMP_NE,
1423 } else if (ICmpInst *IC = dyn_cast<ICmpInst>(I)) {
1424 // "icmp ult i32 %a, %y" EQ true then %a u< y
1427 if (Canonical == ConstantInt::getTrue()) {
1428 add(IC->getOperand(0), IC->getOperand(1), IC->getPredicate(),
1430 } else if (Canonical == ConstantInt::getFalse()) {
1431 add(IC->getOperand(0), IC->getOperand(1),
1432 ICmpInst::getInversePredicate(IC->getPredicate()), NewContext);
1434 } else if (SelectInst *SI = dyn_cast<SelectInst>(I)) {
1435 if (I->getType()->isFPOrFPVector()) return;
1437 // Given: "%a = select i1 %x, i32 %b, i32 %c"
1438 // %a EQ %b and %b NE %c then %x EQ true
1439 // %a EQ %c and %b NE %c then %x EQ false
1441 Value *True = SI->getTrueValue();
1442 Value *False = SI->getFalseValue();
1443 if (isRelatedBy(True, False, ICmpInst::ICMP_NE)) {
1444 if (Canonical == IG.canonicalize(True, Top) ||
1445 isRelatedBy(Canonical, False, ICmpInst::ICMP_NE))
1446 add(SI->getCondition(), ConstantInt::getTrue(),
1447 ICmpInst::ICMP_EQ, NewContext);
1448 else if (Canonical == IG.canonicalize(False, Top) ||
1449 isRelatedBy(Canonical, True, ICmpInst::ICMP_NE))
1450 add(SI->getCondition(), ConstantInt::getFalse(),
1451 ICmpInst::ICMP_EQ, NewContext);
1454 // TODO: CastInst "%a = cast ... %b" where %a is EQ or NE a constant.
1457 /// opsToDef - A new relationship was discovered involving one of this
1458 /// instruction's operands. Find any new relationship involving the
1460 void opsToDef(Instruction *I) {
1461 Instruction *NewContext = below(I) ? I : TopInst;
1463 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
1464 Value *Op0 = IG.canonicalize(BO->getOperand(0), Top);
1465 Value *Op1 = IG.canonicalize(BO->getOperand(1), Top);
1467 if (ConstantInt *CI0 = dyn_cast<ConstantInt>(Op0))
1468 if (ConstantInt *CI1 = dyn_cast<ConstantInt>(Op1)) {
1469 add(BO, ConstantExpr::get(BO->getOpcode(), CI0, CI1),
1470 ICmpInst::ICMP_EQ, NewContext);
1474 // "%y = and i1 true, %x" then %x EQ %y.
1475 // "%y = or i1 false, %x" then %x EQ %y.
1476 if (BO->getOpcode() == Instruction::Or) {
1477 Constant *Zero = Constant::getNullValue(BO->getType());
1479 add(BO, Op1, ICmpInst::ICMP_EQ, NewContext);
1481 } else if (Op1 == Zero) {
1482 add(BO, Op0, ICmpInst::ICMP_EQ, NewContext);
1485 } else if (BO->getOpcode() == Instruction::And) {
1486 Constant *AllOnes = ConstantInt::getAllOnesValue(BO->getType());
1487 if (Op0 == AllOnes) {
1488 add(BO, Op1, ICmpInst::ICMP_EQ, NewContext);
1490 } else if (Op1 == AllOnes) {
1491 add(BO, Op0, ICmpInst::ICMP_EQ, NewContext);
1496 // "%x = add i32 %y, %z" and %x EQ %y then %z EQ 0
1497 // "%x = mul i32 %y, %z" and %x EQ %y then %z EQ 1
1498 // 1. Repeat all of the above, with order of operands reversed.
1499 // "%x = udiv i32 %y, %z" and %x EQ %y then %z EQ 1
1501 Instruction::BinaryOps Opcode = BO->getOpcode();
1502 const Type *Ty = BO->getType();
1503 assert(!Ty->isFPOrFPVector() && "Float in work queue!");
1505 Value *Known = Op0, *Unknown = Op1;
1506 if (Known != BO) std::swap(Known, Unknown);
1510 case Instruction::Xor:
1511 case Instruction::Add:
1512 case Instruction::Sub:
1513 add(Unknown, Constant::getNullValue(Ty), ICmpInst::ICMP_EQ,
1516 case Instruction::UDiv:
1517 case Instruction::SDiv:
1518 if (Unknown == Op0) break; // otherwise, fallthrough
1519 case Instruction::Mul:
1520 if (isa<ConstantInt>(Unknown)) {
1521 Constant *One = ConstantInt::get(Ty, 1);
1522 add(Unknown, One, ICmpInst::ICMP_EQ, NewContext);
1528 // TODO: "%a = add i32 %b, 1" and %b > %z then %a >= %z.
1530 } else if (ICmpInst *IC = dyn_cast<ICmpInst>(I)) {
1531 // "%a = icmp ult i32 %b, %c" and %b u< %c then %a EQ true
1532 // "%a = icmp ult i32 %b, %c" and %b u>= %c then %a EQ false
1535 Value *Op0 = IG.canonicalize(IC->getOperand(0), Top);
1536 Value *Op1 = IG.canonicalize(IC->getOperand(1), Top);
1538 ICmpInst::Predicate Pred = IC->getPredicate();
1539 if (isRelatedBy(Op0, Op1, Pred)) {
1540 add(IC, ConstantInt::getTrue(), ICmpInst::ICMP_EQ, NewContext);
1541 } else if (isRelatedBy(Op0, Op1, ICmpInst::getInversePredicate(Pred))) {
1542 add(IC, ConstantInt::getFalse(), ICmpInst::ICMP_EQ, NewContext);
1545 } else if (SelectInst *SI = dyn_cast<SelectInst>(I)) {
1546 // Given: "%a = select i1 %x, i32 %b, i32 %c"
1547 // %x EQ true then %a EQ %b
1548 // %x EQ false then %a EQ %c
1549 // %b EQ %c then %a EQ %b
1551 Value *Canonical = IG.canonicalize(SI->getCondition(), Top);
1552 if (Canonical == ConstantInt::getTrue()) {
1553 add(SI, SI->getTrueValue(), ICmpInst::ICMP_EQ, NewContext);
1554 } else if (Canonical == ConstantInt::getFalse()) {
1555 add(SI, SI->getFalseValue(), ICmpInst::ICMP_EQ, NewContext);
1556 } else if (IG.canonicalize(SI->getTrueValue(), Top) ==
1557 IG.canonicalize(SI->getFalseValue(), Top)) {
1558 add(SI, SI->getTrueValue(), ICmpInst::ICMP_EQ, NewContext);
1560 } else if (CastInst *CI = dyn_cast<CastInst>(I)) {
1561 const Type *Ty = CI->getDestTy();
1562 if (Ty->isFPOrFPVector()) return;
1564 if (Constant *C = dyn_cast<Constant>(
1565 IG.canonicalize(CI->getOperand(0), Top))) {
1566 add(CI, ConstantExpr::getCast(CI->getOpcode(), C, Ty),
1567 ICmpInst::ICMP_EQ, NewContext);
1570 // TODO: "%a = cast ... %b" where %b is NE/LT/GT a constant.
1574 /// solve - process the work queue
1575 /// Return false if a logical contradiction occurs.
1577 //DOUT << "WorkList entry, size: " << WorkList.size() << "\n";
1578 while (!WorkList.empty()) {
1579 //DOUT << "WorkList size: " << WorkList.size() << "\n";
1581 Operation &O = WorkList.front();
1582 TopInst = O.ContextInst;
1583 TopBB = O.ContextBB;
1584 Top = Forest->getNodeForBlock(TopBB);
1586 O.LHS = IG.canonicalize(O.LHS, Top);
1587 O.RHS = IG.canonicalize(O.RHS, Top);
1589 assert(O.LHS == IG.canonicalize(O.LHS, Top) && "Canonicalize isn't.");
1590 assert(O.RHS == IG.canonicalize(O.RHS, Top) && "Canonicalize isn't.");
1592 DOUT << "solving " << *O.LHS << " " << O.Op << " " << *O.RHS;
1593 if (O.ContextInst) DOUT << " context inst: " << *O.ContextInst;
1594 else DOUT << " context block: " << O.ContextBB->getName();
1599 // If they're both Constant, skip it. Check for contradiction and mark
1600 // the BB as unreachable if so.
1601 if (Constant *CI_L = dyn_cast<Constant>(O.LHS)) {
1602 if (Constant *CI_R = dyn_cast<Constant>(O.RHS)) {
1603 if (ConstantExpr::getCompare(O.Op, CI_L, CI_R) ==
1604 ConstantInt::getFalse())
1607 WorkList.pop_front();
1612 if (compare(O.LHS, O.RHS)) {
1613 std::swap(O.LHS, O.RHS);
1614 O.Op = ICmpInst::getSwappedPredicate(O.Op);
1617 if (O.Op == ICmpInst::ICMP_EQ) {
1618 if (!makeEqual(O.RHS, O.LHS))
1621 LatticeVal LV = cmpInstToLattice(O.Op);
1623 if ((LV & EQ_BIT) &&
1624 isRelatedBy(O.LHS, O.RHS, ICmpInst::getSwappedPredicate(O.Op))) {
1625 if (!makeEqual(O.RHS, O.LHS))
1628 if (isRelatedBy(O.LHS, O.RHS, ICmpInst::getInversePredicate(O.Op))){
1630 WorkList.pop_front();
1634 unsigned n1 = IG.getNode(O.LHS, Top);
1635 unsigned n2 = IG.getNode(O.RHS, Top);
1637 if (n1 && n1 == n2) {
1638 if (O.Op != ICmpInst::ICMP_UGE && O.Op != ICmpInst::ICMP_ULE &&
1639 O.Op != ICmpInst::ICMP_SGE && O.Op != ICmpInst::ICMP_SLE)
1642 WorkList.pop_front();
1646 if (VR.isRelatedBy(O.LHS, O.RHS, Top, LV) ||
1647 (n1 && n2 && IG.isRelatedBy(n1, n2, Top, LV))) {
1648 WorkList.pop_front();
1652 VR.addInequality(O.LHS, O.RHS, Top, LV, this);
1653 if ((!isa<ConstantInt>(O.RHS) && !isa<ConstantInt>(O.LHS)) ||
1655 if (!n1) n1 = IG.newNode(O.LHS);
1656 if (!n2) n2 = IG.newNode(O.RHS);
1657 IG.addInequality(n1, n2, Top, LV);
1660 if (Instruction *I1 = dyn_cast<Instruction>(O.LHS)) {
1662 Top->DominatedBy(Forest->getNodeForBlock(I1->getParent())))
1665 if (isa<Instruction>(O.LHS) || isa<Argument>(O.LHS)) {
1666 for (Value::use_iterator UI = O.LHS->use_begin(),
1667 UE = O.LHS->use_end(); UI != UE;) {
1668 Use &TheUse = UI.getUse();
1670 if (Instruction *I = dyn_cast<Instruction>(TheUse.getUser())) {
1672 Top->DominatedBy(Forest->getNodeForBlock(I->getParent())))
1677 if (Instruction *I2 = dyn_cast<Instruction>(O.RHS)) {
1679 Top->DominatedBy(Forest->getNodeForBlock(I2->getParent())))
1682 if (isa<Instruction>(O.RHS) || isa<Argument>(O.RHS)) {
1683 for (Value::use_iterator UI = O.RHS->use_begin(),
1684 UE = O.RHS->use_end(); UI != UE;) {
1685 Use &TheUse = UI.getUse();
1687 if (Instruction *I = dyn_cast<Instruction>(TheUse.getUser())) {
1689 Top->DominatedBy(Forest->getNodeForBlock(I->getParent())))
1697 WorkList.pop_front();
1702 void ValueRanges::addToWorklist(Value *V, const APInt *I,
1703 ICmpInst::Predicate Pred, VRPSolver *VRP) {
1704 VRP->add(V, ConstantInt::get(*I), Pred, VRP->TopInst);
1707 /// PredicateSimplifier - This class is a simplifier that replaces
1708 /// one equivalent variable with another. It also tracks what
1709 /// can't be equal and will solve setcc instructions when possible.
1710 /// @brief Root of the predicate simplifier optimization.
1711 class VISIBILITY_HIDDEN PredicateSimplifier : public FunctionPass {
1715 InequalityGraph *IG;
1716 UnreachableBlocks UB;
1719 std::vector<DominatorTree::Node *> WorkList;
1722 bool runOnFunction(Function &F);
1724 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
1725 AU.addRequiredID(BreakCriticalEdgesID);
1726 AU.addRequired<DominatorTree>();
1727 AU.addRequired<ETForest>();
1731 /// Forwards - Adds new properties into PropertySet and uses them to
1732 /// simplify instructions. Because new properties sometimes apply to
1733 /// a transition from one BasicBlock to another, this will use the
1734 /// PredicateSimplifier::proceedToSuccessor(s) interface to enter the
1735 /// basic block with the new PropertySet.
1736 /// @brief Performs abstract execution of the program.
1737 class VISIBILITY_HIDDEN Forwards : public InstVisitor<Forwards> {
1738 friend class InstVisitor<Forwards>;
1739 PredicateSimplifier *PS;
1740 DominatorTree::Node *DTNode;
1743 InequalityGraph &IG;
1744 UnreachableBlocks &UB;
1747 Forwards(PredicateSimplifier *PS, DominatorTree::Node *DTNode)
1748 : PS(PS), DTNode(DTNode), IG(*PS->IG), UB(PS->UB), VR(*PS->VR) {}
1750 void visitTerminatorInst(TerminatorInst &TI);
1751 void visitBranchInst(BranchInst &BI);
1752 void visitSwitchInst(SwitchInst &SI);
1754 void visitAllocaInst(AllocaInst &AI);
1755 void visitLoadInst(LoadInst &LI);
1756 void visitStoreInst(StoreInst &SI);
1758 void visitSExtInst(SExtInst &SI);
1759 void visitZExtInst(ZExtInst &ZI);
1761 void visitBinaryOperator(BinaryOperator &BO);
1762 void visitICmpInst(ICmpInst &IC);
1765 // Used by terminator instructions to proceed from the current basic
1766 // block to the next. Verifies that "current" dominates "next",
1767 // then calls visitBasicBlock.
1768 void proceedToSuccessors(DominatorTree::Node *Current) {
1769 for (DominatorTree::Node::iterator I = Current->begin(),
1770 E = Current->end(); I != E; ++I) {
1771 WorkList.push_back(*I);
1775 void proceedToSuccessor(DominatorTree::Node *Next) {
1776 WorkList.push_back(Next);
1779 // Visits each instruction in the basic block.
1780 void visitBasicBlock(DominatorTree::Node *Node) {
1781 BasicBlock *BB = Node->getBlock();
1782 ETNode *ET = Forest->getNodeForBlock(BB);
1783 DOUT << "Entering Basic Block: " << BB->getName()
1784 << " (" << ET->getDFSNumIn() << ")\n";
1785 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;) {
1786 visitInstruction(I++, Node, ET);
1790 // Tries to simplify each Instruction and add new properties to
1792 void visitInstruction(Instruction *I, DominatorTree::Node *DT, ETNode *ET) {
1793 DOUT << "Considering instruction " << *I << "\n";
1796 // Sometimes instructions are killed in earlier analysis.
1797 if (isInstructionTriviallyDead(I)) {
1801 I->eraseFromParent();
1806 // Try to replace the whole instruction.
1807 Value *V = IG->canonicalize(I, ET);
1808 assert(V == I && "Late instruction canonicalization.");
1812 DOUT << "Removing " << *I << ", replacing with " << *V << "\n";
1814 I->replaceAllUsesWith(V);
1815 I->eraseFromParent();
1819 // Try to substitute operands.
1820 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
1821 Value *Oper = I->getOperand(i);
1822 Value *V = IG->canonicalize(Oper, ET);
1823 assert(V == Oper && "Late operand canonicalization.");
1827 DOUT << "Resolving " << *I;
1828 I->setOperand(i, V);
1829 DOUT << " into " << *I;
1834 std::string name = I->getParent()->getName();
1835 DOUT << "push (%" << name << ")\n";
1836 Forwards visit(this, DT);
1838 DOUT << "pop (%" << name << ")\n";
1842 bool PredicateSimplifier::runOnFunction(Function &F) {
1843 DT = &getAnalysis<DominatorTree>();
1844 Forest = &getAnalysis<ETForest>();
1846 Forest->updateDFSNumbers(); // XXX: should only act when numbers are out of date
1848 DOUT << "Entering Function: " << F.getName() << "\n";
1851 BasicBlock *RootBlock = &F.getEntryBlock();
1852 IG = new InequalityGraph(Forest->getNodeForBlock(RootBlock));
1853 VR = new ValueRanges();
1854 WorkList.push_back(DT->getRootNode());
1857 DominatorTree::Node *DTNode = WorkList.back();
1858 WorkList.pop_back();
1859 if (!UB.isDead(DTNode->getBlock())) visitBasicBlock(DTNode);
1860 } while (!WorkList.empty());
1865 modified |= UB.kill();
1870 void PredicateSimplifier::Forwards::visitTerminatorInst(TerminatorInst &TI) {
1871 PS->proceedToSuccessors(DTNode);
1874 void PredicateSimplifier::Forwards::visitBranchInst(BranchInst &BI) {
1875 if (BI.isUnconditional()) {
1876 PS->proceedToSuccessors(DTNode);
1880 Value *Condition = BI.getCondition();
1881 BasicBlock *TrueDest = BI.getSuccessor(0);
1882 BasicBlock *FalseDest = BI.getSuccessor(1);
1884 if (isa<Constant>(Condition) || TrueDest == FalseDest) {
1885 PS->proceedToSuccessors(DTNode);
1889 for (DominatorTree::Node::iterator I = DTNode->begin(), E = DTNode->end();
1891 BasicBlock *Dest = (*I)->getBlock();
1892 DOUT << "Branch thinking about %" << Dest->getName()
1893 << "(" << PS->Forest->getNodeForBlock(Dest)->getDFSNumIn() << ")\n";
1895 if (Dest == TrueDest) {
1896 DOUT << "(" << DTNode->getBlock()->getName() << ") true set:\n";
1897 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, Dest);
1898 VRP.add(ConstantInt::getTrue(), Condition, ICmpInst::ICMP_EQ);
1901 } else if (Dest == FalseDest) {
1902 DOUT << "(" << DTNode->getBlock()->getName() << ") false set:\n";
1903 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, Dest);
1904 VRP.add(ConstantInt::getFalse(), Condition, ICmpInst::ICMP_EQ);
1909 PS->proceedToSuccessor(*I);
1913 void PredicateSimplifier::Forwards::visitSwitchInst(SwitchInst &SI) {
1914 Value *Condition = SI.getCondition();
1916 // Set the EQProperty in each of the cases BBs, and the NEProperties
1917 // in the default BB.
1919 for (DominatorTree::Node::iterator I = DTNode->begin(), E = DTNode->end();
1921 BasicBlock *BB = (*I)->getBlock();
1922 DOUT << "Switch thinking about BB %" << BB->getName()
1923 << "(" << PS->Forest->getNodeForBlock(BB)->getDFSNumIn() << ")\n";
1925 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, BB);
1926 if (BB == SI.getDefaultDest()) {
1927 for (unsigned i = 1, e = SI.getNumCases(); i < e; ++i)
1928 if (SI.getSuccessor(i) != BB)
1929 VRP.add(Condition, SI.getCaseValue(i), ICmpInst::ICMP_NE);
1931 } else if (ConstantInt *CI = SI.findCaseDest(BB)) {
1932 VRP.add(Condition, CI, ICmpInst::ICMP_EQ);
1935 PS->proceedToSuccessor(*I);
1939 void PredicateSimplifier::Forwards::visitAllocaInst(AllocaInst &AI) {
1940 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &AI);
1941 VRP.add(Constant::getNullValue(AI.getType()), &AI, ICmpInst::ICMP_NE);
1945 void PredicateSimplifier::Forwards::visitLoadInst(LoadInst &LI) {
1946 Value *Ptr = LI.getPointerOperand();
1947 // avoid "load uint* null" -> null NE null.
1948 if (isa<Constant>(Ptr)) return;
1950 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &LI);
1951 VRP.add(Constant::getNullValue(Ptr->getType()), Ptr, ICmpInst::ICMP_NE);
1955 void PredicateSimplifier::Forwards::visitStoreInst(StoreInst &SI) {
1956 Value *Ptr = SI.getPointerOperand();
1957 if (isa<Constant>(Ptr)) return;
1959 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &SI);
1960 VRP.add(Constant::getNullValue(Ptr->getType()), Ptr, ICmpInst::ICMP_NE);
1964 void PredicateSimplifier::Forwards::visitSExtInst(SExtInst &SI) {
1965 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &SI);
1966 uint32_t SrcBitWidth = cast<IntegerType>(SI.getSrcTy())->getBitWidth();
1967 uint32_t DstBitWidth = cast<IntegerType>(SI.getDestTy())->getBitWidth();
1968 APInt Min(APInt::getSignedMinValue(SrcBitWidth));
1969 APInt Max(APInt::getSignedMaxValue(SrcBitWidth));
1970 Min.sext(DstBitWidth);
1971 Max.sext(DstBitWidth);
1972 VRP.add(ConstantInt::get(Min), &SI, ICmpInst::ICMP_SLE);
1973 VRP.add(ConstantInt::get(Max), &SI, ICmpInst::ICMP_SGE);
1977 void PredicateSimplifier::Forwards::visitZExtInst(ZExtInst &ZI) {
1978 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &ZI);
1979 uint32_t SrcBitWidth = cast<IntegerType>(ZI.getSrcTy())->getBitWidth();
1980 uint32_t DstBitWidth = cast<IntegerType>(ZI.getDestTy())->getBitWidth();
1981 APInt Max(APInt::getMaxValue(SrcBitWidth));
1982 Max.zext(DstBitWidth);
1983 VRP.add(ConstantInt::get(Max), &ZI, ICmpInst::ICMP_UGE);
1987 void PredicateSimplifier::Forwards::visitBinaryOperator(BinaryOperator &BO) {
1988 Instruction::BinaryOps ops = BO.getOpcode();
1992 case Instruction::URem:
1993 case Instruction::SRem:
1994 case Instruction::UDiv:
1995 case Instruction::SDiv: {
1996 Value *Divisor = BO.getOperand(1);
1997 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &BO);
1998 VRP.add(Constant::getNullValue(Divisor->getType()), Divisor,
2007 case Instruction::Shl: {
2008 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &BO);
2009 VRP.add(&BO, BO.getOperand(0), ICmpInst::ICMP_UGE);
2012 case Instruction::AShr: {
2013 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &BO);
2014 VRP.add(&BO, BO.getOperand(0), ICmpInst::ICMP_SLE);
2017 case Instruction::LShr:
2018 case Instruction::UDiv: {
2019 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &BO);
2020 VRP.add(&BO, BO.getOperand(0), ICmpInst::ICMP_ULE);
2023 case Instruction::URem: {
2024 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &BO);
2025 VRP.add(&BO, BO.getOperand(1), ICmpInst::ICMP_ULE);
2028 case Instruction::And: {
2029 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &BO);
2030 VRP.add(&BO, BO.getOperand(0), ICmpInst::ICMP_ULE);
2031 VRP.add(&BO, BO.getOperand(1), ICmpInst::ICMP_ULE);
2034 case Instruction::Or: {
2035 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &BO);
2036 VRP.add(&BO, BO.getOperand(0), ICmpInst::ICMP_UGE);
2037 VRP.add(&BO, BO.getOperand(1), ICmpInst::ICMP_UGE);
2043 void PredicateSimplifier::Forwards::visitICmpInst(ICmpInst &IC) {
2044 // If possible, squeeze the ICmp predicate into something simpler.
2045 // Eg., if x = [0, 4) and we're being asked icmp uge %x, 3 then change
2046 // the predicate to eq.
2048 ICmpInst::Predicate Pred = IC.getPredicate();
2050 if (ConstantInt *Op1 = dyn_cast<ConstantInt>(IC.getOperand(1))) {
2051 ConstantInt *NextVal = 0;
2054 case ICmpInst::ICMP_SLT:
2055 case ICmpInst::ICMP_ULT:
2056 if (Op1->getValue() != 0)
2057 NextVal = cast<ConstantInt>(ConstantExpr::getSub(
2058 Op1, ConstantInt::get(Op1->getType(), 1)));
2060 case ICmpInst::ICMP_SGT:
2061 case ICmpInst::ICMP_UGT:
2062 if (!Op1->getValue().isAllOnesValue())
2063 NextVal = cast<ConstantInt>(ConstantExpr::getAdd(
2064 Op1, ConstantInt::get(Op1->getType(), 1)));
2069 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &IC);
2070 if (VRP.isRelatedBy(IC.getOperand(0), NextVal,
2071 ICmpInst::getInversePredicate(Pred))) {
2072 ICmpInst *NewIC = new ICmpInst(ICmpInst::ICMP_EQ, IC.getOperand(0),
2074 NewIC->takeName(&IC);
2075 IC.replaceAllUsesWith(NewIC);
2076 IG.remove(&IC); // XXX: prove this isn't necessary
2077 IC.eraseFromParent();
2079 PS->modified = true;
2087 case ICmpInst::ICMP_ULE: Pred = ICmpInst::ICMP_ULT; break;
2088 case ICmpInst::ICMP_UGE: Pred = ICmpInst::ICMP_UGT; break;
2089 case ICmpInst::ICMP_SLE: Pred = ICmpInst::ICMP_SLT; break;
2090 case ICmpInst::ICMP_SGE: Pred = ICmpInst::ICMP_SGT; break;
2092 VRPSolver VRP(IG, UB, VR, PS->Forest, PS->modified, &IC);
2093 if (VRP.isRelatedBy(IC.getOperand(1), IC.getOperand(0), Pred)) {
2095 PS->modified = true;
2096 IC.setPredicate(Pred);
2100 RegisterPass<PredicateSimplifier> X("predsimplify",
2101 "Predicate Simplifier");
2104 FunctionPass *llvm::createPredicateSimplifierPass() {
2105 return new PredicateSimplifier();