Index: lib/Transforms/InstCombine/InstCombineCompares.cpp
===================================================================
--- lib/Transforms/InstCombine/InstCombineCompares.cpp
+++ lib/Transforms/InstCombine/InstCombineCompares.cpp
@@ -2444,9 +2444,8 @@
     // Cases where const1 doesn't divide const2 exactly or Quotient is not
     // exact of log2 are handled by SimplifyICmpInst call above where we
     // return false.
-    // TODO: Handle this for lshr exact with udiv.
     {
-      ConstantInt *CI2;
+      ConstantInt *CI2 = nullptr;
       if (match(Op0, m_AShr(m_ConstantInt(CI2), m_Value(A))) &&
           (cast<BinaryOperator>(Op0)->isExact())) {
         APInt Quotient = CI2->getValue().sdiv(CI->getValue());
@@ -2455,6 +2454,18 @@
                             ConstantInt::get(A->getType(), shift));
       }
     }
+    
+    // Handle the case for lhsr similar to above transformation.
+    {
+      ConstantInt *CI2 = nullptr;
+      if (match(Op0, m_LShr(m_ConstantInt(CI2), m_Value(A))) &&
+          (cast<BinaryOperator>(Op0)->isExact())) {
+        APInt Quotient = CI2->getValue().udiv(CI->getValue());
+        unsigned shift = Quotient.logBase2();
+        return new ICmpInst(I.getPredicate(), A,
+                            ConstantInt::get(A->getType(), shift));
+      }
+    }
 
     // If we have an icmp le or icmp ge instruction, turn it into the
     // appropriate icmp lt or icmp gt instruction.  This allows us to rely on
Index: test/Transforms/InstCombine/icmp.ll
===================================================================
--- test/Transforms/InstCombine/icmp.ll
+++ test/Transforms/InstCombine/icmp.ll
@@ -1373,3 +1373,11 @@
   %cmp = icmp eq i32 %shr, -15
   ret i1 %cmp
 }
+
+; CHECK-LABEL: @exact_lhsr
+; CHECK-NEXT: icmp eq i32 %a, 3
+define i1 @exact_lhsr(i32 %a) {
+  %shr = lshr exact i32 80, %a
+  %cmp = icmp eq i32 %shr, 10
+  ret i1 %cmp
+}