From: Chris Lattner <sabre@nondot.org>
Date: Sat, 31 Jan 2009 07:26:06 +0000 (+0000)
Subject: minor cleanups
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=08d2cc70fe4733be6e5d2f2c5f37a887f36b4c17;p=oota-llvm.git

minor cleanups


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@63477 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Transforms/Scalar/InstructionCombining.cpp b/lib/Transforms/Scalar/InstructionCombining.cpp
index 6c571511e7c..f084420b88d 100644
--- a/lib/Transforms/Scalar/InstructionCombining.cpp
+++ b/lib/Transforms/Scalar/InstructionCombining.cpp
@@ -766,7 +766,7 @@ static void ComputeUnsignedMinMaxValuesFromKnownBits(const Type *Ty,
 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero
 /// and KnownOne must all be the same.
 bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
-                                        APInt& KnownZero, APInt& KnownOne,
+                                        APInt &KnownZero, APInt &KnownOne,
                                         unsigned Depth) {
   assert(V != 0 && "Null pointer of Value???");
   assert(Depth <= 6 && "Limit Search Depth");
@@ -784,7 +784,7 @@ bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
     return false;
   }
   
-  KnownZero.clear(); 
+  KnownZero.clear();
   KnownOne.clear();
   if (!V->hasOneUse()) {    // Other users may use these bits.
     if (Depth != 0) {       // Not at the root.
@@ -796,7 +796,7 @@ bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
     // just set the DemandedMask to all bits.
     DemandedMask = APInt::getAllOnesValue(BitWidth);
   } else if (DemandedMask == 0) {   // Not demanding any bits from V.
-    if (V != UndefValue::get(VTy))
+    if (!isa<UndefValue>(V))
       return UpdateValueUsesWith(V, UndefValue::get(VTy));
     return false;
   } else if (Depth == 6) {        // Limit search depth.