1 //===- SCCP.cpp - Sparse Conditional Constant Propagation -----------------===//
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 implements sparse conditional constant propagation and merging:
12 // Specifically, this:
13 // * Assumes values are constant unless proven otherwise
14 // * Assumes BasicBlocks are dead unless proven otherwise
15 // * Proves values to be constant, and replaces them with constants
16 // * Proves conditional branches to be unconditional
19 // * This pass has a habit of making definitions be dead. It is a good idea
20 // to to run a DCE pass sometime after running this pass.
22 //===----------------------------------------------------------------------===//
24 #define DEBUG_TYPE "sccp"
25 #include "llvm/Transforms/Scalar.h"
26 #include "llvm/Transforms/IPO.h"
27 #include "llvm/Constants.h"
28 #include "llvm/DerivedTypes.h"
29 #include "llvm/Instructions.h"
30 #include "llvm/Pass.h"
31 #include "llvm/Analysis/ConstantFolding.h"
32 #include "llvm/Transforms/Utils/Local.h"
33 #include "llvm/Support/CallSite.h"
34 #include "llvm/Support/Compiler.h"
35 #include "llvm/Support/Debug.h"
36 #include "llvm/Support/InstVisitor.h"
37 #include "llvm/ADT/DenseMap.h"
38 #include "llvm/ADT/SmallSet.h"
39 #include "llvm/ADT/SmallVector.h"
40 #include "llvm/ADT/Statistic.h"
41 #include "llvm/ADT/STLExtras.h"
46 STATISTIC(NumInstRemoved, "Number of instructions removed");
47 STATISTIC(NumDeadBlocks , "Number of basic blocks unreachable");
49 STATISTIC(IPNumInstRemoved, "Number of instructions removed by IPSCCP");
50 STATISTIC(IPNumDeadBlocks , "Number of basic blocks unreachable by IPSCCP");
51 STATISTIC(IPNumArgsElimed ,"Number of arguments constant propagated by IPSCCP");
52 STATISTIC(IPNumGlobalConst, "Number of globals found to be constant by IPSCCP");
55 /// LatticeVal class - This class represents the different lattice values that
56 /// an LLVM value may occupy. It is a simple class with value semantics.
58 class VISIBILITY_HIDDEN LatticeVal {
60 /// undefined - This LLVM Value has no known value yet.
63 /// constant - This LLVM Value has a specific constant value.
66 /// forcedconstant - This LLVM Value was thought to be undef until
67 /// ResolvedUndefsIn. This is treated just like 'constant', but if merged
68 /// with another (different) constant, it goes to overdefined, instead of
72 /// overdefined - This instruction is not known to be constant, and we know
75 } LatticeValue; // The current lattice position
77 Constant *ConstantVal; // If Constant value, the current value
79 inline LatticeVal() : LatticeValue(undefined), ConstantVal(0) {}
81 // markOverdefined - Return true if this is a new status to be in...
82 inline bool markOverdefined() {
83 if (LatticeValue != overdefined) {
84 LatticeValue = overdefined;
90 // markConstant - Return true if this is a new status for us.
91 inline bool markConstant(Constant *V) {
92 if (LatticeValue != constant) {
93 if (LatticeValue == undefined) {
94 LatticeValue = constant;
95 assert(V && "Marking constant with NULL");
98 assert(LatticeValue == forcedconstant &&
99 "Cannot move from overdefined to constant!");
100 // Stay at forcedconstant if the constant is the same.
101 if (V == ConstantVal) return false;
103 // Otherwise, we go to overdefined. Assumptions made based on the
104 // forced value are possibly wrong. Assuming this is another constant
105 // could expose a contradiction.
106 LatticeValue = overdefined;
110 assert(ConstantVal == V && "Marking constant with different value");
115 inline void markForcedConstant(Constant *V) {
116 assert(LatticeValue == undefined && "Can't force a defined value!");
117 LatticeValue = forcedconstant;
121 inline bool isUndefined() const { return LatticeValue == undefined; }
122 inline bool isConstant() const {
123 return LatticeValue == constant || LatticeValue == forcedconstant;
125 inline bool isOverdefined() const { return LatticeValue == overdefined; }
127 inline Constant *getConstant() const {
128 assert(isConstant() && "Cannot get the constant of a non-constant!");
133 /// LatticeValIndex - LatticeVal and associated Index. This is used
134 /// to track individual operand Lattice values for multi value ret instructions.
135 class VISIBILITY_HIDDEN LatticeValIndexed {
137 LatticeValIndexed(unsigned I = 0) { Index = I; }
138 LatticeVal &getLatticeVal() { return LV; }
139 unsigned getIndex() const { return Index; }
141 void setLatticeVal(LatticeVal &L) { LV = L; }
142 void setIndex(unsigned I) { Index = I; }
148 //===----------------------------------------------------------------------===//
150 /// SCCPSolver - This class is a general purpose solver for Sparse Conditional
151 /// Constant Propagation.
153 class SCCPSolver : public InstVisitor<SCCPSolver> {
154 SmallSet<BasicBlock*, 16> BBExecutable;// The basic blocks that are executable
155 std::map<Value*, LatticeVal> ValueState; // The state each value is in.
157 /// GlobalValue - If we are tracking any values for the contents of a global
158 /// variable, we keep a mapping from the constant accessor to the element of
159 /// the global, to the currently known value. If the value becomes
160 /// overdefined, it's entry is simply removed from this map.
161 DenseMap<GlobalVariable*, LatticeVal> TrackedGlobals;
163 /// TrackedRetVals - If we are tracking arguments into and the return
164 /// value out of a function, it will have an entry in this map, indicating
165 /// what the known return value for the function is.
166 DenseMap<Function*, LatticeVal> TrackedRetVals;
168 /// TrackedMultipleRetVals - Same as TrackedRetVals, but used for functions
169 /// that return multiple values.
170 std::multimap<Function*, LatticeValIndexed> TrackedMultipleRetVals;
172 // The reason for two worklists is that overdefined is the lowest state
173 // on the lattice, and moving things to overdefined as fast as possible
174 // makes SCCP converge much faster.
175 // By having a separate worklist, we accomplish this because everything
176 // possibly overdefined will become overdefined at the soonest possible
178 std::vector<Value*> OverdefinedInstWorkList;
179 std::vector<Value*> InstWorkList;
182 std::vector<BasicBlock*> BBWorkList; // The BasicBlock work list
184 /// UsersOfOverdefinedPHIs - Keep track of any users of PHI nodes that are not
185 /// overdefined, despite the fact that the PHI node is overdefined.
186 std::multimap<PHINode*, Instruction*> UsersOfOverdefinedPHIs;
188 /// KnownFeasibleEdges - Entries in this set are edges which have already had
189 /// PHI nodes retriggered.
190 typedef std::pair<BasicBlock*,BasicBlock*> Edge;
191 std::set<Edge> KnownFeasibleEdges;
194 /// MarkBlockExecutable - This method can be used by clients to mark all of
195 /// the blocks that are known to be intrinsically live in the processed unit.
196 void MarkBlockExecutable(BasicBlock *BB) {
197 DOUT << "Marking Block Executable: " << BB->getName() << "\n";
198 BBExecutable.insert(BB); // Basic block is executable!
199 BBWorkList.push_back(BB); // Add the block to the work list!
202 /// TrackValueOfGlobalVariable - Clients can use this method to
203 /// inform the SCCPSolver that it should track loads and stores to the
204 /// specified global variable if it can. This is only legal to call if
205 /// performing Interprocedural SCCP.
206 void TrackValueOfGlobalVariable(GlobalVariable *GV) {
207 const Type *ElTy = GV->getType()->getElementType();
208 if (ElTy->isFirstClassType()) {
209 LatticeVal &IV = TrackedGlobals[GV];
210 if (!isa<UndefValue>(GV->getInitializer()))
211 IV.markConstant(GV->getInitializer());
215 /// AddTrackedFunction - If the SCCP solver is supposed to track calls into
216 /// and out of the specified function (which cannot have its address taken),
217 /// this method must be called.
218 void AddTrackedFunction(Function *F) {
219 assert(F->hasInternalLinkage() && "Can only track internal functions!");
220 // Add an entry, F -> undef.
221 if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
222 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
223 TrackedMultipleRetVals.insert(std::pair<Function *, LatticeValIndexed>
224 (F, LatticeValIndexed(i)));
230 /// Solve - Solve for constants and executable blocks.
234 /// ResolvedUndefsIn - While solving the dataflow for a function, we assume
235 /// that branches on undef values cannot reach any of their successors.
236 /// However, this is not a safe assumption. After we solve dataflow, this
237 /// method should be use to handle this. If this returns true, the solver
239 bool ResolvedUndefsIn(Function &F);
241 /// getExecutableBlocks - Once we have solved for constants, return the set of
242 /// blocks that is known to be executable.
243 SmallSet<BasicBlock*, 16> &getExecutableBlocks() {
247 /// getValueMapping - Once we have solved for constants, return the mapping of
248 /// LLVM values to LatticeVals.
249 std::map<Value*, LatticeVal> &getValueMapping() {
253 /// getTrackedRetVals - Get the inferred return value map.
255 const DenseMap<Function*, LatticeVal> &getTrackedRetVals() {
256 return TrackedRetVals;
259 /// getTrackedGlobals - Get and return the set of inferred initializers for
260 /// global variables.
261 const DenseMap<GlobalVariable*, LatticeVal> &getTrackedGlobals() {
262 return TrackedGlobals;
265 inline void markOverdefined(Value *V) {
266 markOverdefined(ValueState[V], V);
270 // markConstant - Make a value be marked as "constant". If the value
271 // is not already a constant, add it to the instruction work list so that
272 // the users of the instruction are updated later.
274 inline void markConstant(LatticeVal &IV, Value *V, Constant *C) {
275 if (IV.markConstant(C)) {
276 DOUT << "markConstant: " << *C << ": " << *V;
277 InstWorkList.push_back(V);
281 inline void markForcedConstant(LatticeVal &IV, Value *V, Constant *C) {
282 IV.markForcedConstant(C);
283 DOUT << "markForcedConstant: " << *C << ": " << *V;
284 InstWorkList.push_back(V);
287 inline void markConstant(Value *V, Constant *C) {
288 markConstant(ValueState[V], V, C);
291 // markOverdefined - Make a value be marked as "overdefined". If the
292 // value is not already overdefined, add it to the overdefined instruction
293 // work list so that the users of the instruction are updated later.
295 inline void markOverdefined(LatticeVal &IV, Value *V) {
296 if (IV.markOverdefined()) {
297 DEBUG(DOUT << "markOverdefined: ";
298 if (Function *F = dyn_cast<Function>(V))
299 DOUT << "Function '" << F->getName() << "'\n";
302 // Only instructions go on the work list
303 OverdefinedInstWorkList.push_back(V);
307 inline void mergeInValue(LatticeVal &IV, Value *V, LatticeVal &MergeWithV) {
308 if (IV.isOverdefined() || MergeWithV.isUndefined())
310 if (MergeWithV.isOverdefined())
311 markOverdefined(IV, V);
312 else if (IV.isUndefined())
313 markConstant(IV, V, MergeWithV.getConstant());
314 else if (IV.getConstant() != MergeWithV.getConstant())
315 markOverdefined(IV, V);
318 inline void mergeInValue(Value *V, LatticeVal &MergeWithV) {
319 return mergeInValue(ValueState[V], V, MergeWithV);
323 // getValueState - Return the LatticeVal object that corresponds to the value.
324 // This function is necessary because not all values should start out in the
325 // underdefined state... Argument's should be overdefined, and
326 // constants should be marked as constants. If a value is not known to be an
327 // Instruction object, then use this accessor to get its value from the map.
329 inline LatticeVal &getValueState(Value *V) {
330 std::map<Value*, LatticeVal>::iterator I = ValueState.find(V);
331 if (I != ValueState.end()) return I->second; // Common case, in the map
333 if (Constant *C = dyn_cast<Constant>(V)) {
334 if (isa<UndefValue>(V)) {
335 // Nothing to do, remain undefined.
337 LatticeVal &LV = ValueState[C];
338 LV.markConstant(C); // Constants are constant
342 // All others are underdefined by default...
343 return ValueState[V];
346 // markEdgeExecutable - Mark a basic block as executable, adding it to the BB
347 // work list if it is not already executable...
349 void markEdgeExecutable(BasicBlock *Source, BasicBlock *Dest) {
350 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
351 return; // This edge is already known to be executable!
353 if (BBExecutable.count(Dest)) {
354 DOUT << "Marking Edge Executable: " << Source->getName()
355 << " -> " << Dest->getName() << "\n";
357 // The destination is already executable, but we just made an edge
358 // feasible that wasn't before. Revisit the PHI nodes in the block
359 // because they have potentially new operands.
360 for (BasicBlock::iterator I = Dest->begin(); isa<PHINode>(I); ++I)
361 visitPHINode(*cast<PHINode>(I));
364 MarkBlockExecutable(Dest);
368 // getFeasibleSuccessors - Return a vector of booleans to indicate which
369 // successors are reachable from a given terminator instruction.
371 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
373 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
374 // block to the 'To' basic block is currently feasible...
376 bool isEdgeFeasible(BasicBlock *From, BasicBlock *To);
378 // OperandChangedState - This method is invoked on all of the users of an
379 // instruction that was just changed state somehow.... Based on this
380 // information, we need to update the specified user of this instruction.
382 void OperandChangedState(User *U) {
383 // Only instructions use other variable values!
384 Instruction &I = cast<Instruction>(*U);
385 if (BBExecutable.count(I.getParent())) // Inst is executable?
390 friend class InstVisitor<SCCPSolver>;
392 // visit implementations - Something changed in this instruction... Either an
393 // operand made a transition, or the instruction is newly executable. Change
394 // the value type of I to reflect these changes if appropriate.
396 void visitPHINode(PHINode &I);
399 void visitReturnInst(ReturnInst &I);
400 void visitTerminatorInst(TerminatorInst &TI);
402 void visitCastInst(CastInst &I);
403 void visitGetResultInst(GetResultInst &GRI);
404 void visitSelectInst(SelectInst &I);
405 void visitBinaryOperator(Instruction &I);
406 void visitCmpInst(CmpInst &I);
407 void visitExtractElementInst(ExtractElementInst &I);
408 void visitInsertElementInst(InsertElementInst &I);
409 void visitShuffleVectorInst(ShuffleVectorInst &I);
411 // Instructions that cannot be folded away...
412 void visitStoreInst (Instruction &I);
413 void visitLoadInst (LoadInst &I);
414 void visitGetElementPtrInst(GetElementPtrInst &I);
415 void visitCallInst (CallInst &I) { visitCallSite(CallSite::get(&I)); }
416 void visitInvokeInst (InvokeInst &II) {
417 visitCallSite(CallSite::get(&II));
418 visitTerminatorInst(II);
420 void visitCallSite (CallSite CS);
421 void visitUnwindInst (TerminatorInst &I) { /*returns void*/ }
422 void visitUnreachableInst(TerminatorInst &I) { /*returns void*/ }
423 void visitAllocationInst(Instruction &I) { markOverdefined(&I); }
424 void visitVANextInst (Instruction &I) { markOverdefined(&I); }
425 void visitVAArgInst (Instruction &I) { markOverdefined(&I); }
426 void visitFreeInst (Instruction &I) { /*returns void*/ }
428 void visitInstruction(Instruction &I) {
429 // If a new instruction is added to LLVM that we don't handle...
430 cerr << "SCCP: Don't know how to handle: " << I;
431 markOverdefined(&I); // Just in case
435 } // end anonymous namespace
438 // getFeasibleSuccessors - Return a vector of booleans to indicate which
439 // successors are reachable from a given terminator instruction.
441 void SCCPSolver::getFeasibleSuccessors(TerminatorInst &TI,
442 SmallVector<bool, 16> &Succs) {
443 Succs.resize(TI.getNumSuccessors());
444 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) {
445 if (BI->isUnconditional()) {
448 LatticeVal &BCValue = getValueState(BI->getCondition());
449 if (BCValue.isOverdefined() ||
450 (BCValue.isConstant() && !isa<ConstantInt>(BCValue.getConstant()))) {
451 // Overdefined condition variables, and branches on unfoldable constant
452 // conditions, mean the branch could go either way.
453 Succs[0] = Succs[1] = true;
454 } else if (BCValue.isConstant()) {
455 // Constant condition variables mean the branch can only go a single way
456 Succs[BCValue.getConstant() == ConstantInt::getFalse()] = true;
459 } else if (isa<InvokeInst>(&TI)) {
460 // Invoke instructions successors are always executable.
461 Succs[0] = Succs[1] = true;
462 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(&TI)) {
463 LatticeVal &SCValue = getValueState(SI->getCondition());
464 if (SCValue.isOverdefined() || // Overdefined condition?
465 (SCValue.isConstant() && !isa<ConstantInt>(SCValue.getConstant()))) {
466 // All destinations are executable!
467 Succs.assign(TI.getNumSuccessors(), true);
468 } else if (SCValue.isConstant()) {
469 Constant *CPV = SCValue.getConstant();
470 // Make sure to skip the "default value" which isn't a value
471 for (unsigned i = 1, E = SI->getNumSuccessors(); i != E; ++i) {
472 if (SI->getSuccessorValue(i) == CPV) {// Found the right branch...
478 // Constant value not equal to any of the branches... must execute
479 // default branch then...
483 assert(0 && "SCCP: Don't know how to handle this terminator!");
488 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
489 // block to the 'To' basic block is currently feasible...
491 bool SCCPSolver::isEdgeFeasible(BasicBlock *From, BasicBlock *To) {
492 assert(BBExecutable.count(To) && "Dest should always be alive!");
494 // Make sure the source basic block is executable!!
495 if (!BBExecutable.count(From)) return false;
497 // Check to make sure this edge itself is actually feasible now...
498 TerminatorInst *TI = From->getTerminator();
499 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
500 if (BI->isUnconditional())
503 LatticeVal &BCValue = getValueState(BI->getCondition());
504 if (BCValue.isOverdefined()) {
505 // Overdefined condition variables mean the branch could go either way.
507 } else if (BCValue.isConstant()) {
508 // Not branching on an evaluatable constant?
509 if (!isa<ConstantInt>(BCValue.getConstant())) return true;
511 // Constant condition variables mean the branch can only go a single way
512 return BI->getSuccessor(BCValue.getConstant() ==
513 ConstantInt::getFalse()) == To;
517 } else if (isa<InvokeInst>(TI)) {
518 // Invoke instructions successors are always executable.
520 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
521 LatticeVal &SCValue = getValueState(SI->getCondition());
522 if (SCValue.isOverdefined()) { // Overdefined condition?
523 // All destinations are executable!
525 } else if (SCValue.isConstant()) {
526 Constant *CPV = SCValue.getConstant();
527 if (!isa<ConstantInt>(CPV))
528 return true; // not a foldable constant?
530 // Make sure to skip the "default value" which isn't a value
531 for (unsigned i = 1, E = SI->getNumSuccessors(); i != E; ++i)
532 if (SI->getSuccessorValue(i) == CPV) // Found the taken branch...
533 return SI->getSuccessor(i) == To;
535 // Constant value not equal to any of the branches... must execute
536 // default branch then...
537 return SI->getDefaultDest() == To;
541 cerr << "Unknown terminator instruction: " << *TI;
546 // visit Implementations - Something changed in this instruction... Either an
547 // operand made a transition, or the instruction is newly executable. Change
548 // the value type of I to reflect these changes if appropriate. This method
549 // makes sure to do the following actions:
551 // 1. If a phi node merges two constants in, and has conflicting value coming
552 // from different branches, or if the PHI node merges in an overdefined
553 // value, then the PHI node becomes overdefined.
554 // 2. If a phi node merges only constants in, and they all agree on value, the
555 // PHI node becomes a constant value equal to that.
556 // 3. If V <- x (op) y && isConstant(x) && isConstant(y) V = Constant
557 // 4. If V <- x (op) y && (isOverdefined(x) || isOverdefined(y)) V = Overdefined
558 // 5. If V <- MEM or V <- CALL or V <- (unknown) then V = Overdefined
559 // 6. If a conditional branch has a value that is constant, make the selected
560 // destination executable
561 // 7. If a conditional branch has a value that is overdefined, make all
562 // successors executable.
564 void SCCPSolver::visitPHINode(PHINode &PN) {
565 LatticeVal &PNIV = getValueState(&PN);
566 if (PNIV.isOverdefined()) {
567 // There may be instructions using this PHI node that are not overdefined
568 // themselves. If so, make sure that they know that the PHI node operand
570 std::multimap<PHINode*, Instruction*>::iterator I, E;
571 tie(I, E) = UsersOfOverdefinedPHIs.equal_range(&PN);
573 SmallVector<Instruction*, 16> Users;
574 for (; I != E; ++I) Users.push_back(I->second);
575 while (!Users.empty()) {
580 return; // Quick exit
583 // Super-extra-high-degree PHI nodes are unlikely to ever be marked constant,
584 // and slow us down a lot. Just mark them overdefined.
585 if (PN.getNumIncomingValues() > 64) {
586 markOverdefined(PNIV, &PN);
590 // Look at all of the executable operands of the PHI node. If any of them
591 // are overdefined, the PHI becomes overdefined as well. If they are all
592 // constant, and they agree with each other, the PHI becomes the identical
593 // constant. If they are constant and don't agree, the PHI is overdefined.
594 // If there are no executable operands, the PHI remains undefined.
596 Constant *OperandVal = 0;
597 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
598 LatticeVal &IV = getValueState(PN.getIncomingValue(i));
599 if (IV.isUndefined()) continue; // Doesn't influence PHI node.
601 if (isEdgeFeasible(PN.getIncomingBlock(i), PN.getParent())) {
602 if (IV.isOverdefined()) { // PHI node becomes overdefined!
603 markOverdefined(PNIV, &PN);
607 if (OperandVal == 0) { // Grab the first value...
608 OperandVal = IV.getConstant();
609 } else { // Another value is being merged in!
610 // There is already a reachable operand. If we conflict with it,
611 // then the PHI node becomes overdefined. If we agree with it, we
614 // Check to see if there are two different constants merging...
615 if (IV.getConstant() != OperandVal) {
616 // Yes there is. This means the PHI node is not constant.
617 // You must be overdefined poor PHI.
619 markOverdefined(PNIV, &PN); // The PHI node now becomes overdefined
620 return; // I'm done analyzing you
626 // If we exited the loop, this means that the PHI node only has constant
627 // arguments that agree with each other(and OperandVal is the constant) or
628 // OperandVal is null because there are no defined incoming arguments. If
629 // this is the case, the PHI remains undefined.
632 markConstant(PNIV, &PN, OperandVal); // Acquire operand value
635 void SCCPSolver::visitReturnInst(ReturnInst &I) {
636 if (I.getNumOperands() == 0) return; // Ret void
638 Function *F = I.getParent()->getParent();
639 // If we are tracking the return value of this function, merge it in.
640 if (!F->hasInternalLinkage())
643 if (!TrackedRetVals.empty()) {
644 DenseMap<Function*, LatticeVal>::iterator TFRVI =
645 TrackedRetVals.find(F);
646 if (TFRVI != TrackedRetVals.end() &&
647 !TFRVI->second.isOverdefined()) {
648 LatticeVal &IV = getValueState(I.getOperand(0));
649 mergeInValue(TFRVI->second, F, IV);
654 // Handle function that returns multiple values.
655 std::multimap<Function*, LatticeValIndexed>::iterator It, E;
656 tie(It, E) = TrackedMultipleRetVals.equal_range(F);
658 for (; It != E; ++It) {
659 LatticeValIndexed &LV = It->second;
660 unsigned Idx = LV.getIndex();
661 Value *V = I.getOperand(Idx);
662 mergeInValue(LV.getLatticeVal(), V, getValueState(V));
667 void SCCPSolver::visitTerminatorInst(TerminatorInst &TI) {
668 SmallVector<bool, 16> SuccFeasible;
669 getFeasibleSuccessors(TI, SuccFeasible);
671 BasicBlock *BB = TI.getParent();
673 // Mark all feasible successors executable...
674 for (unsigned i = 0, e = SuccFeasible.size(); i != e; ++i)
676 markEdgeExecutable(BB, TI.getSuccessor(i));
679 void SCCPSolver::visitCastInst(CastInst &I) {
680 Value *V = I.getOperand(0);
681 LatticeVal &VState = getValueState(V);
682 if (VState.isOverdefined()) // Inherit overdefinedness of operand
684 else if (VState.isConstant()) // Propagate constant value
685 markConstant(&I, ConstantExpr::getCast(I.getOpcode(),
686 VState.getConstant(), I.getType()));
689 void SCCPSolver::visitGetResultInst(GetResultInst &GRI) {
690 unsigned Idx = GRI.getIndex();
691 Value *Aggr = GRI.getOperand(0);
693 if (CallInst *CI = dyn_cast<CallInst>(Aggr))
694 F = CI->getCalledFunction();
695 else if (InvokeInst *II = dyn_cast<InvokeInst>(Aggr))
696 F = II->getCalledFunction();
701 std::multimap<Function*, LatticeValIndexed>::iterator It, E;
702 tie(It, E) = TrackedMultipleRetVals.equal_range(F);
706 for (; It != E; ++It) {
707 LatticeValIndexed &LIV = It->second;
708 if (LIV.getIndex() == Idx) {
709 mergeInValue(&GRI, LIV.getLatticeVal());
714 void SCCPSolver::visitSelectInst(SelectInst &I) {
715 LatticeVal &CondValue = getValueState(I.getCondition());
716 if (CondValue.isUndefined())
718 if (CondValue.isConstant()) {
719 if (ConstantInt *CondCB = dyn_cast<ConstantInt>(CondValue.getConstant())){
720 mergeInValue(&I, getValueState(CondCB->getZExtValue() ? I.getTrueValue()
721 : I.getFalseValue()));
726 // Otherwise, the condition is overdefined or a constant we can't evaluate.
727 // See if we can produce something better than overdefined based on the T/F
729 LatticeVal &TVal = getValueState(I.getTrueValue());
730 LatticeVal &FVal = getValueState(I.getFalseValue());
732 // select ?, C, C -> C.
733 if (TVal.isConstant() && FVal.isConstant() &&
734 TVal.getConstant() == FVal.getConstant()) {
735 markConstant(&I, FVal.getConstant());
739 if (TVal.isUndefined()) { // select ?, undef, X -> X.
740 mergeInValue(&I, FVal);
741 } else if (FVal.isUndefined()) { // select ?, X, undef -> X.
742 mergeInValue(&I, TVal);
748 // Handle BinaryOperators and Shift Instructions...
749 void SCCPSolver::visitBinaryOperator(Instruction &I) {
750 LatticeVal &IV = ValueState[&I];
751 if (IV.isOverdefined()) return;
753 LatticeVal &V1State = getValueState(I.getOperand(0));
754 LatticeVal &V2State = getValueState(I.getOperand(1));
756 if (V1State.isOverdefined() || V2State.isOverdefined()) {
757 // If this is an AND or OR with 0 or -1, it doesn't matter that the other
758 // operand is overdefined.
759 if (I.getOpcode() == Instruction::And || I.getOpcode() == Instruction::Or) {
760 LatticeVal *NonOverdefVal = 0;
761 if (!V1State.isOverdefined()) {
762 NonOverdefVal = &V1State;
763 } else if (!V2State.isOverdefined()) {
764 NonOverdefVal = &V2State;
768 if (NonOverdefVal->isUndefined()) {
769 // Could annihilate value.
770 if (I.getOpcode() == Instruction::And)
771 markConstant(IV, &I, Constant::getNullValue(I.getType()));
772 else if (const VectorType *PT = dyn_cast<VectorType>(I.getType()))
773 markConstant(IV, &I, ConstantVector::getAllOnesValue(PT));
775 markConstant(IV, &I, ConstantInt::getAllOnesValue(I.getType()));
778 if (I.getOpcode() == Instruction::And) {
779 if (NonOverdefVal->getConstant()->isNullValue()) {
780 markConstant(IV, &I, NonOverdefVal->getConstant());
781 return; // X and 0 = 0
784 if (ConstantInt *CI =
785 dyn_cast<ConstantInt>(NonOverdefVal->getConstant()))
786 if (CI->isAllOnesValue()) {
787 markConstant(IV, &I, NonOverdefVal->getConstant());
788 return; // X or -1 = -1
796 // If both operands are PHI nodes, it is possible that this instruction has
797 // a constant value, despite the fact that the PHI node doesn't. Check for
798 // this condition now.
799 if (PHINode *PN1 = dyn_cast<PHINode>(I.getOperand(0)))
800 if (PHINode *PN2 = dyn_cast<PHINode>(I.getOperand(1)))
801 if (PN1->getParent() == PN2->getParent()) {
802 // Since the two PHI nodes are in the same basic block, they must have
803 // entries for the same predecessors. Walk the predecessor list, and
804 // if all of the incoming values are constants, and the result of
805 // evaluating this expression with all incoming value pairs is the
806 // same, then this expression is a constant even though the PHI node
807 // is not a constant!
809 for (unsigned i = 0, e = PN1->getNumIncomingValues(); i != e; ++i) {
810 LatticeVal &In1 = getValueState(PN1->getIncomingValue(i));
811 BasicBlock *InBlock = PN1->getIncomingBlock(i);
813 getValueState(PN2->getIncomingValueForBlock(InBlock));
815 if (In1.isOverdefined() || In2.isOverdefined()) {
816 Result.markOverdefined();
817 break; // Cannot fold this operation over the PHI nodes!
818 } else if (In1.isConstant() && In2.isConstant()) {
819 Constant *V = ConstantExpr::get(I.getOpcode(), In1.getConstant(),
821 if (Result.isUndefined())
822 Result.markConstant(V);
823 else if (Result.isConstant() && Result.getConstant() != V) {
824 Result.markOverdefined();
830 // If we found a constant value here, then we know the instruction is
831 // constant despite the fact that the PHI nodes are overdefined.
832 if (Result.isConstant()) {
833 markConstant(IV, &I, Result.getConstant());
834 // Remember that this instruction is virtually using the PHI node
836 UsersOfOverdefinedPHIs.insert(std::make_pair(PN1, &I));
837 UsersOfOverdefinedPHIs.insert(std::make_pair(PN2, &I));
839 } else if (Result.isUndefined()) {
843 // Okay, this really is overdefined now. Since we might have
844 // speculatively thought that this was not overdefined before, and
845 // added ourselves to the UsersOfOverdefinedPHIs list for the PHIs,
846 // make sure to clean out any entries that we put there, for
848 std::multimap<PHINode*, Instruction*>::iterator It, E;
849 tie(It, E) = UsersOfOverdefinedPHIs.equal_range(PN1);
851 if (It->second == &I) {
852 UsersOfOverdefinedPHIs.erase(It++);
856 tie(It, E) = UsersOfOverdefinedPHIs.equal_range(PN2);
858 if (It->second == &I) {
859 UsersOfOverdefinedPHIs.erase(It++);
865 markOverdefined(IV, &I);
866 } else if (V1State.isConstant() && V2State.isConstant()) {
867 markConstant(IV, &I, ConstantExpr::get(I.getOpcode(), V1State.getConstant(),
868 V2State.getConstant()));
872 // Handle ICmpInst instruction...
873 void SCCPSolver::visitCmpInst(CmpInst &I) {
874 LatticeVal &IV = ValueState[&I];
875 if (IV.isOverdefined()) return;
877 LatticeVal &V1State = getValueState(I.getOperand(0));
878 LatticeVal &V2State = getValueState(I.getOperand(1));
880 if (V1State.isOverdefined() || V2State.isOverdefined()) {
881 // If both operands are PHI nodes, it is possible that this instruction has
882 // a constant value, despite the fact that the PHI node doesn't. Check for
883 // this condition now.
884 if (PHINode *PN1 = dyn_cast<PHINode>(I.getOperand(0)))
885 if (PHINode *PN2 = dyn_cast<PHINode>(I.getOperand(1)))
886 if (PN1->getParent() == PN2->getParent()) {
887 // Since the two PHI nodes are in the same basic block, they must have
888 // entries for the same predecessors. Walk the predecessor list, and
889 // if all of the incoming values are constants, and the result of
890 // evaluating this expression with all incoming value pairs is the
891 // same, then this expression is a constant even though the PHI node
892 // is not a constant!
894 for (unsigned i = 0, e = PN1->getNumIncomingValues(); i != e; ++i) {
895 LatticeVal &In1 = getValueState(PN1->getIncomingValue(i));
896 BasicBlock *InBlock = PN1->getIncomingBlock(i);
898 getValueState(PN2->getIncomingValueForBlock(InBlock));
900 if (In1.isOverdefined() || In2.isOverdefined()) {
901 Result.markOverdefined();
902 break; // Cannot fold this operation over the PHI nodes!
903 } else if (In1.isConstant() && In2.isConstant()) {
904 Constant *V = ConstantExpr::getCompare(I.getPredicate(),
907 if (Result.isUndefined())
908 Result.markConstant(V);
909 else if (Result.isConstant() && Result.getConstant() != V) {
910 Result.markOverdefined();
916 // If we found a constant value here, then we know the instruction is
917 // constant despite the fact that the PHI nodes are overdefined.
918 if (Result.isConstant()) {
919 markConstant(IV, &I, Result.getConstant());
920 // Remember that this instruction is virtually using the PHI node
922 UsersOfOverdefinedPHIs.insert(std::make_pair(PN1, &I));
923 UsersOfOverdefinedPHIs.insert(std::make_pair(PN2, &I));
925 } else if (Result.isUndefined()) {
929 // Okay, this really is overdefined now. Since we might have
930 // speculatively thought that this was not overdefined before, and
931 // added ourselves to the UsersOfOverdefinedPHIs list for the PHIs,
932 // make sure to clean out any entries that we put there, for
934 std::multimap<PHINode*, Instruction*>::iterator It, E;
935 tie(It, E) = UsersOfOverdefinedPHIs.equal_range(PN1);
937 if (It->second == &I) {
938 UsersOfOverdefinedPHIs.erase(It++);
942 tie(It, E) = UsersOfOverdefinedPHIs.equal_range(PN2);
944 if (It->second == &I) {
945 UsersOfOverdefinedPHIs.erase(It++);
951 markOverdefined(IV, &I);
952 } else if (V1State.isConstant() && V2State.isConstant()) {
953 markConstant(IV, &I, ConstantExpr::getCompare(I.getPredicate(),
954 V1State.getConstant(),
955 V2State.getConstant()));
959 void SCCPSolver::visitExtractElementInst(ExtractElementInst &I) {
960 // FIXME : SCCP does not handle vectors properly.
965 LatticeVal &ValState = getValueState(I.getOperand(0));
966 LatticeVal &IdxState = getValueState(I.getOperand(1));
968 if (ValState.isOverdefined() || IdxState.isOverdefined())
970 else if(ValState.isConstant() && IdxState.isConstant())
971 markConstant(&I, ConstantExpr::getExtractElement(ValState.getConstant(),
972 IdxState.getConstant()));
976 void SCCPSolver::visitInsertElementInst(InsertElementInst &I) {
977 // FIXME : SCCP does not handle vectors properly.
981 LatticeVal &ValState = getValueState(I.getOperand(0));
982 LatticeVal &EltState = getValueState(I.getOperand(1));
983 LatticeVal &IdxState = getValueState(I.getOperand(2));
985 if (ValState.isOverdefined() || EltState.isOverdefined() ||
986 IdxState.isOverdefined())
988 else if(ValState.isConstant() && EltState.isConstant() &&
989 IdxState.isConstant())
990 markConstant(&I, ConstantExpr::getInsertElement(ValState.getConstant(),
991 EltState.getConstant(),
992 IdxState.getConstant()));
993 else if (ValState.isUndefined() && EltState.isConstant() &&
994 IdxState.isConstant())
995 markConstant(&I,ConstantExpr::getInsertElement(UndefValue::get(I.getType()),
996 EltState.getConstant(),
997 IdxState.getConstant()));
1001 void SCCPSolver::visitShuffleVectorInst(ShuffleVectorInst &I) {
1002 // FIXME : SCCP does not handle vectors properly.
1003 markOverdefined(&I);
1006 LatticeVal &V1State = getValueState(I.getOperand(0));
1007 LatticeVal &V2State = getValueState(I.getOperand(1));
1008 LatticeVal &MaskState = getValueState(I.getOperand(2));
1010 if (MaskState.isUndefined() ||
1011 (V1State.isUndefined() && V2State.isUndefined()))
1012 return; // Undefined output if mask or both inputs undefined.
1014 if (V1State.isOverdefined() || V2State.isOverdefined() ||
1015 MaskState.isOverdefined()) {
1016 markOverdefined(&I);
1018 // A mix of constant/undef inputs.
1019 Constant *V1 = V1State.isConstant() ?
1020 V1State.getConstant() : UndefValue::get(I.getType());
1021 Constant *V2 = V2State.isConstant() ?
1022 V2State.getConstant() : UndefValue::get(I.getType());
1023 Constant *Mask = MaskState.isConstant() ?
1024 MaskState.getConstant() : UndefValue::get(I.getOperand(2)->getType());
1025 markConstant(&I, ConstantExpr::getShuffleVector(V1, V2, Mask));
1030 // Handle getelementptr instructions... if all operands are constants then we
1031 // can turn this into a getelementptr ConstantExpr.
1033 void SCCPSolver::visitGetElementPtrInst(GetElementPtrInst &I) {
1034 LatticeVal &IV = ValueState[&I];
1035 if (IV.isOverdefined()) return;
1037 SmallVector<Constant*, 8> Operands;
1038 Operands.reserve(I.getNumOperands());
1040 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1041 LatticeVal &State = getValueState(I.getOperand(i));
1042 if (State.isUndefined())
1043 return; // Operands are not resolved yet...
1044 else if (State.isOverdefined()) {
1045 markOverdefined(IV, &I);
1048 assert(State.isConstant() && "Unknown state!");
1049 Operands.push_back(State.getConstant());
1052 Constant *Ptr = Operands[0];
1053 Operands.erase(Operands.begin()); // Erase the pointer from idx list...
1055 markConstant(IV, &I, ConstantExpr::getGetElementPtr(Ptr, &Operands[0],
1059 void SCCPSolver::visitStoreInst(Instruction &SI) {
1060 if (TrackedGlobals.empty() || !isa<GlobalVariable>(SI.getOperand(1)))
1062 GlobalVariable *GV = cast<GlobalVariable>(SI.getOperand(1));
1063 DenseMap<GlobalVariable*, LatticeVal>::iterator I = TrackedGlobals.find(GV);
1064 if (I == TrackedGlobals.end() || I->second.isOverdefined()) return;
1066 // Get the value we are storing into the global.
1067 LatticeVal &PtrVal = getValueState(SI.getOperand(0));
1069 mergeInValue(I->second, GV, PtrVal);
1070 if (I->second.isOverdefined())
1071 TrackedGlobals.erase(I); // No need to keep tracking this!
1075 // Handle load instructions. If the operand is a constant pointer to a constant
1076 // global, we can replace the load with the loaded constant value!
1077 void SCCPSolver::visitLoadInst(LoadInst &I) {
1078 LatticeVal &IV = ValueState[&I];
1079 if (IV.isOverdefined()) return;
1081 LatticeVal &PtrVal = getValueState(I.getOperand(0));
1082 if (PtrVal.isUndefined()) return; // The pointer is not resolved yet!
1083 if (PtrVal.isConstant() && !I.isVolatile()) {
1084 Value *Ptr = PtrVal.getConstant();
1085 // TODO: Consider a target hook for valid address spaces for this xform.
1086 if (isa<ConstantPointerNull>(Ptr) &&
1087 cast<PointerType>(Ptr->getType())->getAddressSpace() == 0) {
1088 // load null -> null
1089 markConstant(IV, &I, Constant::getNullValue(I.getType()));
1093 // Transform load (constant global) into the value loaded.
1094 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Ptr)) {
1095 if (GV->isConstant()) {
1096 if (!GV->isDeclaration()) {
1097 markConstant(IV, &I, GV->getInitializer());
1100 } else if (!TrackedGlobals.empty()) {
1101 // If we are tracking this global, merge in the known value for it.
1102 DenseMap<GlobalVariable*, LatticeVal>::iterator It =
1103 TrackedGlobals.find(GV);
1104 if (It != TrackedGlobals.end()) {
1105 mergeInValue(IV, &I, It->second);
1111 // Transform load (constantexpr_GEP global, 0, ...) into the value loaded.
1112 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
1113 if (CE->getOpcode() == Instruction::GetElementPtr)
1114 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(CE->getOperand(0)))
1115 if (GV->isConstant() && !GV->isDeclaration())
1117 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE)) {
1118 markConstant(IV, &I, V);
1123 // Otherwise we cannot say for certain what value this load will produce.
1125 markOverdefined(IV, &I);
1128 void SCCPSolver::visitCallSite(CallSite CS) {
1129 Function *F = CS.getCalledFunction();
1131 DenseMap<Function*, LatticeVal>::iterator TFRVI =TrackedRetVals.end();
1132 // If we are tracking this function, we must make sure to bind arguments as
1134 bool FirstCall = false;
1135 if (F && F->hasInternalLinkage()) {
1136 TFRVI = TrackedRetVals.find(F);
1137 if (TFRVI != TrackedRetVals.end())
1140 std::multimap<Function*, LatticeValIndexed>::iterator It, E;
1141 tie(It, E) = TrackedMultipleRetVals.equal_range(F);
1148 // If this is the first call to the function hit, mark its entry block
1150 if (!BBExecutable.count(F->begin()))
1151 MarkBlockExecutable(F->begin());
1153 CallSite::arg_iterator CAI = CS.arg_begin();
1154 for (Function::arg_iterator AI = F->arg_begin(), E = F->arg_end();
1155 AI != E; ++AI, ++CAI) {
1156 LatticeVal &IV = ValueState[AI];
1157 if (!IV.isOverdefined())
1158 mergeInValue(IV, AI, getValueState(*CAI));
1161 Instruction *I = CS.getInstruction();
1163 if (!CS.doesNotThrow() && I->getParent()->getUnwindDest())
1164 markEdgeExecutable(I->getParent(), I->getParent()->getUnwindDest());
1166 if (I->getType() == Type::VoidTy) return;
1168 LatticeVal &IV = ValueState[I];
1169 if (IV.isOverdefined()) return;
1171 // Propagate the single return value of the function to the value of the
1173 if (TFRVI != TrackedRetVals.end()) {
1174 mergeInValue(IV, I, TFRVI->second);
1178 if (F == 0 || !F->isDeclaration() || !canConstantFoldCallTo(F)) {
1179 markOverdefined(IV, I);
1183 SmallVector<Constant*, 8> Operands;
1184 Operands.reserve(I->getNumOperands()-1);
1186 for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end();
1188 LatticeVal &State = getValueState(*AI);
1189 if (State.isUndefined())
1190 return; // Operands are not resolved yet...
1191 else if (State.isOverdefined()) {
1192 markOverdefined(IV, I);
1195 assert(State.isConstant() && "Unknown state!");
1196 Operands.push_back(State.getConstant());
1199 if (Constant *C = ConstantFoldCall(F, &Operands[0], Operands.size()))
1200 markConstant(IV, I, C);
1202 markOverdefined(IV, I);
1206 void SCCPSolver::Solve() {
1207 // Process the work lists until they are empty!
1208 while (!BBWorkList.empty() || !InstWorkList.empty() ||
1209 !OverdefinedInstWorkList.empty()) {
1210 // Process the instruction work list...
1211 while (!OverdefinedInstWorkList.empty()) {
1212 Value *I = OverdefinedInstWorkList.back();
1213 OverdefinedInstWorkList.pop_back();
1215 DOUT << "\nPopped off OI-WL: " << *I;
1217 // "I" got into the work list because it either made the transition from
1218 // bottom to constant
1220 // Anything on this worklist that is overdefined need not be visited
1221 // since all of its users will have already been marked as overdefined
1222 // Update all of the users of this instruction's value...
1224 for (Value::use_iterator UI = I->use_begin(), E = I->use_end();
1226 OperandChangedState(*UI);
1228 // Process the instruction work list...
1229 while (!InstWorkList.empty()) {
1230 Value *I = InstWorkList.back();
1231 InstWorkList.pop_back();
1233 DOUT << "\nPopped off I-WL: " << *I;
1235 // "I" got into the work list because it either made the transition from
1236 // bottom to constant
1238 // Anything on this worklist that is overdefined need not be visited
1239 // since all of its users will have already been marked as overdefined.
1240 // Update all of the users of this instruction's value...
1242 if (!getValueState(I).isOverdefined())
1243 for (Value::use_iterator UI = I->use_begin(), E = I->use_end();
1245 OperandChangedState(*UI);
1248 // Process the basic block work list...
1249 while (!BBWorkList.empty()) {
1250 BasicBlock *BB = BBWorkList.back();
1251 BBWorkList.pop_back();
1253 DOUT << "\nPopped off BBWL: " << *BB;
1255 // Notify all instructions in this basic block that they are newly
1262 /// ResolvedUndefsIn - While solving the dataflow for a function, we assume
1263 /// that branches on undef values cannot reach any of their successors.
1264 /// However, this is not a safe assumption. After we solve dataflow, this
1265 /// method should be use to handle this. If this returns true, the solver
1266 /// should be rerun.
1268 /// This method handles this by finding an unresolved branch and marking it one
1269 /// of the edges from the block as being feasible, even though the condition
1270 /// doesn't say it would otherwise be. This allows SCCP to find the rest of the
1271 /// CFG and only slightly pessimizes the analysis results (by marking one,
1272 /// potentially infeasible, edge feasible). This cannot usefully modify the
1273 /// constraints on the condition of the branch, as that would impact other users
1276 /// This scan also checks for values that use undefs, whose results are actually
1277 /// defined. For example, 'zext i8 undef to i32' should produce all zeros
1278 /// conservatively, as "(zext i8 X -> i32) & 0xFF00" must always return zero,
1279 /// even if X isn't defined.
1280 bool SCCPSolver::ResolvedUndefsIn(Function &F) {
1281 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
1282 if (!BBExecutable.count(BB))
1285 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
1286 // Look for instructions which produce undef values.
1287 if (I->getType() == Type::VoidTy) continue;
1289 LatticeVal &LV = getValueState(I);
1290 if (!LV.isUndefined()) continue;
1292 // Get the lattice values of the first two operands for use below.
1293 LatticeVal &Op0LV = getValueState(I->getOperand(0));
1295 if (I->getNumOperands() == 2) {
1296 // If this is a two-operand instruction, and if both operands are
1297 // undefs, the result stays undef.
1298 Op1LV = getValueState(I->getOperand(1));
1299 if (Op0LV.isUndefined() && Op1LV.isUndefined())
1303 // If this is an instructions whose result is defined even if the input is
1304 // not fully defined, propagate the information.
1305 const Type *ITy = I->getType();
1306 switch (I->getOpcode()) {
1307 default: break; // Leave the instruction as an undef.
1308 case Instruction::ZExt:
1309 // After a zero extend, we know the top part is zero. SExt doesn't have
1310 // to be handled here, because we don't know whether the top part is 1's
1312 assert(Op0LV.isUndefined());
1313 markForcedConstant(LV, I, Constant::getNullValue(ITy));
1315 case Instruction::Mul:
1316 case Instruction::And:
1317 // undef * X -> 0. X could be zero.
1318 // undef & X -> 0. X could be zero.
1319 markForcedConstant(LV, I, Constant::getNullValue(ITy));
1322 case Instruction::Or:
1323 // undef | X -> -1. X could be -1.
1324 if (const VectorType *PTy = dyn_cast<VectorType>(ITy))
1325 markForcedConstant(LV, I, ConstantVector::getAllOnesValue(PTy));
1327 markForcedConstant(LV, I, ConstantInt::getAllOnesValue(ITy));
1330 case Instruction::SDiv:
1331 case Instruction::UDiv:
1332 case Instruction::SRem:
1333 case Instruction::URem:
1334 // X / undef -> undef. No change.
1335 // X % undef -> undef. No change.
1336 if (Op1LV.isUndefined()) break;
1338 // undef / X -> 0. X could be maxint.
1339 // undef % X -> 0. X could be 1.
1340 markForcedConstant(LV, I, Constant::getNullValue(ITy));
1343 case Instruction::AShr:
1344 // undef >>s X -> undef. No change.
1345 if (Op0LV.isUndefined()) break;
1347 // X >>s undef -> X. X could be 0, X could have the high-bit known set.
1348 if (Op0LV.isConstant())
1349 markForcedConstant(LV, I, Op0LV.getConstant());
1351 markOverdefined(LV, I);
1353 case Instruction::LShr:
1354 case Instruction::Shl:
1355 // undef >> X -> undef. No change.
1356 // undef << X -> undef. No change.
1357 if (Op0LV.isUndefined()) break;
1359 // X >> undef -> 0. X could be 0.
1360 // X << undef -> 0. X could be 0.
1361 markForcedConstant(LV, I, Constant::getNullValue(ITy));
1363 case Instruction::Select:
1364 // undef ? X : Y -> X or Y. There could be commonality between X/Y.
1365 if (Op0LV.isUndefined()) {
1366 if (!Op1LV.isConstant()) // Pick the constant one if there is any.
1367 Op1LV = getValueState(I->getOperand(2));
1368 } else if (Op1LV.isUndefined()) {
1369 // c ? undef : undef -> undef. No change.
1370 Op1LV = getValueState(I->getOperand(2));
1371 if (Op1LV.isUndefined())
1373 // Otherwise, c ? undef : x -> x.
1375 // Leave Op1LV as Operand(1)'s LatticeValue.
1378 if (Op1LV.isConstant())
1379 markForcedConstant(LV, I, Op1LV.getConstant());
1381 markOverdefined(LV, I);
1386 TerminatorInst *TI = BB->getTerminator();
1387 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
1388 if (!BI->isConditional()) continue;
1389 if (!getValueState(BI->getCondition()).isUndefined())
1391 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
1392 if (!getValueState(SI->getCondition()).isUndefined())
1398 // If the edge to the second successor isn't thought to be feasible yet,
1399 // mark it so now. We pick the second one so that this goes to some
1400 // enumerated value in a switch instead of going to the default destination.
1401 if (KnownFeasibleEdges.count(Edge(BB, TI->getSuccessor(1))))
1404 // Otherwise, it isn't already thought to be feasible. Mark it as such now
1405 // and return. This will make other blocks reachable, which will allow new
1406 // values to be discovered and existing ones to be moved in the lattice.
1407 markEdgeExecutable(BB, TI->getSuccessor(1));
1409 // This must be a conditional branch of switch on undef. At this point,
1410 // force the old terminator to branch to the first successor. This is
1411 // required because we are now influencing the dataflow of the function with
1412 // the assumption that this edge is taken. If we leave the branch condition
1413 // as undef, then further analysis could think the undef went another way
1414 // leading to an inconsistent set of conclusions.
1415 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
1416 BI->setCondition(ConstantInt::getFalse());
1418 SwitchInst *SI = cast<SwitchInst>(TI);
1419 SI->setCondition(SI->getCaseValue(1));
1430 //===--------------------------------------------------------------------===//
1432 /// SCCP Class - This class uses the SCCPSolver to implement a per-function
1433 /// Sparse Conditional Constant Propagator.
1435 struct VISIBILITY_HIDDEN SCCP : public FunctionPass {
1436 static char ID; // Pass identification, replacement for typeid
1437 SCCP() : FunctionPass((intptr_t)&ID) {}
1439 // runOnFunction - Run the Sparse Conditional Constant Propagation
1440 // algorithm, and return true if the function was modified.
1442 bool runOnFunction(Function &F);
1444 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
1445 AU.setPreservesCFG();
1450 RegisterPass<SCCP> X("sccp", "Sparse Conditional Constant Propagation");
1451 } // end anonymous namespace
1454 // createSCCPPass - This is the public interface to this file...
1455 FunctionPass *llvm::createSCCPPass() {
1460 // runOnFunction() - Run the Sparse Conditional Constant Propagation algorithm,
1461 // and return true if the function was modified.
1463 bool SCCP::runOnFunction(Function &F) {
1464 DOUT << "SCCP on function '" << F.getName() << "'\n";
1467 // Mark the first block of the function as being executable.
1468 Solver.MarkBlockExecutable(F.begin());
1470 // Mark all arguments to the function as being overdefined.
1471 for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); AI != E;++AI)
1472 Solver.markOverdefined(AI);
1474 // Solve for constants.
1475 bool ResolvedUndefs = true;
1476 while (ResolvedUndefs) {
1478 DOUT << "RESOLVING UNDEFs\n";
1479 ResolvedUndefs = Solver.ResolvedUndefsIn(F);
1482 bool MadeChanges = false;
1484 // If we decided that there are basic blocks that are dead in this function,
1485 // delete their contents now. Note that we cannot actually delete the blocks,
1486 // as we cannot modify the CFG of the function.
1488 SmallSet<BasicBlock*, 16> &ExecutableBBs = Solver.getExecutableBlocks();
1489 SmallVector<Instruction*, 32> Insts;
1490 std::map<Value*, LatticeVal> &Values = Solver.getValueMapping();
1492 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1493 if (!ExecutableBBs.count(BB)) {
1494 DOUT << " BasicBlock Dead:" << *BB;
1497 // Delete the instructions backwards, as it has a reduced likelihood of
1498 // having to update as many def-use and use-def chains.
1499 for (BasicBlock::iterator I = BB->begin(), E = BB->getTerminator();
1502 while (!Insts.empty()) {
1503 Instruction *I = Insts.back();
1505 if (!I->use_empty())
1506 I->replaceAllUsesWith(UndefValue::get(I->getType()));
1507 BB->getInstList().erase(I);
1512 // Iterate over all of the instructions in a function, replacing them with
1513 // constants if we have found them to be of constant values.
1515 for (BasicBlock::iterator BI = BB->begin(), E = BB->end(); BI != E; ) {
1516 Instruction *Inst = BI++;
1517 if (Inst->getType() != Type::VoidTy) {
1518 LatticeVal &IV = Values[Inst];
1519 if ((IV.isConstant() || IV.isUndefined()) &&
1520 !isa<TerminatorInst>(Inst)) {
1521 Constant *Const = IV.isConstant()
1522 ? IV.getConstant() : UndefValue::get(Inst->getType());
1523 DOUT << " Constant: " << *Const << " = " << *Inst;
1525 // Replaces all of the uses of a variable with uses of the constant.
1526 Inst->replaceAllUsesWith(Const);
1528 // Delete the instruction.
1529 BB->getInstList().erase(Inst);
1531 // Hey, we just changed something!
1543 //===--------------------------------------------------------------------===//
1545 /// IPSCCP Class - This class implements interprocedural Sparse Conditional
1546 /// Constant Propagation.
1548 struct VISIBILITY_HIDDEN IPSCCP : public ModulePass {
1550 IPSCCP() : ModulePass((intptr_t)&ID) {}
1551 bool runOnModule(Module &M);
1554 char IPSCCP::ID = 0;
1555 RegisterPass<IPSCCP>
1556 Y("ipsccp", "Interprocedural Sparse Conditional Constant Propagation");
1557 } // end anonymous namespace
1559 // createIPSCCPPass - This is the public interface to this file...
1560 ModulePass *llvm::createIPSCCPPass() {
1561 return new IPSCCP();
1565 static bool AddressIsTaken(GlobalValue *GV) {
1566 // Delete any dead constantexpr klingons.
1567 GV->removeDeadConstantUsers();
1569 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end();
1571 if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
1572 if (SI->getOperand(0) == GV || SI->isVolatile())
1573 return true; // Storing addr of GV.
1574 } else if (isa<InvokeInst>(*UI) || isa<CallInst>(*UI)) {
1575 // Make sure we are calling the function, not passing the address.
1576 CallSite CS = CallSite::get(cast<Instruction>(*UI));
1577 for (CallSite::arg_iterator AI = CS.arg_begin(),
1578 E = CS.arg_end(); AI != E; ++AI)
1581 } else if (LoadInst *LI = dyn_cast<LoadInst>(*UI)) {
1582 if (LI->isVolatile())
1590 bool IPSCCP::runOnModule(Module &M) {
1593 // Loop over all functions, marking arguments to those with their addresses
1594 // taken or that are external as overdefined.
1596 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
1597 if (!F->hasInternalLinkage() || AddressIsTaken(F)) {
1598 if (!F->isDeclaration())
1599 Solver.MarkBlockExecutable(F->begin());
1600 for (Function::arg_iterator AI = F->arg_begin(), E = F->arg_end();
1602 Solver.markOverdefined(AI);
1604 Solver.AddTrackedFunction(F);
1607 // Loop over global variables. We inform the solver about any internal global
1608 // variables that do not have their 'addresses taken'. If they don't have
1609 // their addresses taken, we can propagate constants through them.
1610 for (Module::global_iterator G = M.global_begin(), E = M.global_end();
1612 if (!G->isConstant() && G->hasInternalLinkage() && !AddressIsTaken(G))
1613 Solver.TrackValueOfGlobalVariable(G);
1615 // Solve for constants.
1616 bool ResolvedUndefs = true;
1617 while (ResolvedUndefs) {
1620 DOUT << "RESOLVING UNDEFS\n";
1621 ResolvedUndefs = false;
1622 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
1623 ResolvedUndefs |= Solver.ResolvedUndefsIn(*F);
1626 bool MadeChanges = false;
1628 // Iterate over all of the instructions in the module, replacing them with
1629 // constants if we have found them to be of constant values.
1631 SmallSet<BasicBlock*, 16> &ExecutableBBs = Solver.getExecutableBlocks();
1632 SmallVector<Instruction*, 32> Insts;
1633 SmallVector<BasicBlock*, 32> BlocksToErase;
1634 std::map<Value*, LatticeVal> &Values = Solver.getValueMapping();
1636 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {
1637 for (Function::arg_iterator AI = F->arg_begin(), E = F->arg_end();
1639 if (!AI->use_empty()) {
1640 LatticeVal &IV = Values[AI];
1641 if (IV.isConstant() || IV.isUndefined()) {
1642 Constant *CST = IV.isConstant() ?
1643 IV.getConstant() : UndefValue::get(AI->getType());
1644 DOUT << "*** Arg " << *AI << " = " << *CST <<"\n";
1646 // Replaces all of the uses of a variable with uses of the
1648 AI->replaceAllUsesWith(CST);
1653 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
1654 if (!ExecutableBBs.count(BB)) {
1655 DOUT << " BasicBlock Dead:" << *BB;
1658 // Delete the instructions backwards, as it has a reduced likelihood of
1659 // having to update as many def-use and use-def chains.
1660 TerminatorInst *TI = BB->getTerminator();
1661 for (BasicBlock::iterator I = BB->begin(), E = TI; I != E; ++I)
1664 while (!Insts.empty()) {
1665 Instruction *I = Insts.back();
1667 if (!I->use_empty())
1668 I->replaceAllUsesWith(UndefValue::get(I->getType()));
1669 BB->getInstList().erase(I);
1674 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
1675 BasicBlock *Succ = TI->getSuccessor(i);
1676 if (!Succ->empty() && isa<PHINode>(Succ->begin()))
1677 TI->getSuccessor(i)->removePredecessor(BB);
1679 if (!TI->use_empty())
1680 TI->replaceAllUsesWith(UndefValue::get(TI->getType()));
1681 BB->getInstList().erase(TI);
1683 if (&*BB != &F->front())
1684 BlocksToErase.push_back(BB);
1686 new UnreachableInst(BB);
1689 for (BasicBlock::iterator BI = BB->begin(), E = BB->end(); BI != E; ) {
1690 Instruction *Inst = BI++;
1691 if (Inst->getType() != Type::VoidTy) {
1692 LatticeVal &IV = Values[Inst];
1693 if (IV.isConstant() ||
1694 (IV.isUndefined() && !isa<TerminatorInst>(Inst))) {
1695 Constant *Const = IV.isConstant()
1696 ? IV.getConstant() : UndefValue::get(Inst->getType());
1697 DOUT << " Constant: " << *Const << " = " << *Inst;
1699 // Replaces all of the uses of a variable with uses of the
1701 Inst->replaceAllUsesWith(Const);
1703 // Delete the instruction.
1704 if (!isa<TerminatorInst>(Inst) && !isa<CallInst>(Inst))
1705 BB->getInstList().erase(Inst);
1707 // Hey, we just changed something!
1715 // Now that all instructions in the function are constant folded, erase dead
1716 // blocks, because we can now use ConstantFoldTerminator to get rid of
1718 for (unsigned i = 0, e = BlocksToErase.size(); i != e; ++i) {
1719 // If there are any PHI nodes in this successor, drop entries for BB now.
1720 BasicBlock *DeadBB = BlocksToErase[i];
1721 while (!DeadBB->use_empty()) {
1722 if (BasicBlock *PredBB = dyn_cast<BasicBlock>(DeadBB->use_back())) {
1723 PredBB->setUnwindDest(NULL);
1727 Instruction *I = cast<Instruction>(DeadBB->use_back());
1728 bool Folded = ConstantFoldTerminator(I->getParent());
1730 // The constant folder may not have been able to fold the terminator
1731 // if this is a branch or switch on undef. Fold it manually as a
1732 // branch to the first successor.
1733 if (BranchInst *BI = dyn_cast<BranchInst>(I)) {
1734 assert(BI->isConditional() && isa<UndefValue>(BI->getCondition()) &&
1735 "Branch should be foldable!");
1736 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(I)) {
1737 assert(isa<UndefValue>(SI->getCondition()) && "Switch should fold");
1739 assert(0 && "Didn't fold away reference to block!");
1742 // Make this an uncond branch to the first successor.
1743 TerminatorInst *TI = I->getParent()->getTerminator();
1744 BranchInst::Create(TI->getSuccessor(0), TI);
1746 // Remove entries in successor phi nodes to remove edges.
1747 for (unsigned i = 1, e = TI->getNumSuccessors(); i != e; ++i)
1748 TI->getSuccessor(i)->removePredecessor(TI->getParent());
1750 // Remove the old terminator.
1751 TI->eraseFromParent();
1755 // Finally, delete the basic block.
1756 F->getBasicBlockList().erase(DeadBB);
1758 BlocksToErase.clear();
1761 // If we inferred constant or undef return values for a function, we replaced
1762 // all call uses with the inferred value. This means we don't need to bother
1763 // actually returning anything from the function. Replace all return
1764 // instructions with return undef.
1765 // TODO: Process multiple value ret instructions also.
1766 const DenseMap<Function*, LatticeVal> &RV = Solver.getTrackedRetVals();
1767 for (DenseMap<Function*, LatticeVal>::const_iterator I = RV.begin(),
1768 E = RV.end(); I != E; ++I)
1769 if (!I->second.isOverdefined() &&
1770 I->first->getReturnType() != Type::VoidTy) {
1771 Function *F = I->first;
1772 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
1773 if (ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator()))
1774 if (!isa<UndefValue>(RI->getOperand(0)))
1775 RI->setOperand(0, UndefValue::get(F->getReturnType()));
1778 // If we infered constant or undef values for globals variables, we can delete
1779 // the global and any stores that remain to it.
1780 const DenseMap<GlobalVariable*, LatticeVal> &TG = Solver.getTrackedGlobals();
1781 for (DenseMap<GlobalVariable*, LatticeVal>::const_iterator I = TG.begin(),
1782 E = TG.end(); I != E; ++I) {
1783 GlobalVariable *GV = I->first;
1784 assert(!I->second.isOverdefined() &&
1785 "Overdefined values should have been taken out of the map!");
1786 DOUT << "Found that GV '" << GV->getName()<< "' is constant!\n";
1787 while (!GV->use_empty()) {
1788 StoreInst *SI = cast<StoreInst>(GV->use_back());
1789 SI->eraseFromParent();
1791 M.getGlobalList().erase(GV);