New array bounds check elimination pass (focused on induction variables and bitwise operations).

src/token.h

Index: src/token.h
diff --git a/src/token.h b/src/token.h
index 04d7f7639b08506a27d7f7b93a6358506bf05983..992adaa77c27c50dac0ed7fe48ee05bf8c41a6a8 100644
--- a/src/token.h
+++ b/src/token.h
@@ -225,8 +225,17 @@ class Token {
     return op == EQ || op == EQ_STRICT;
   }
 
+  static bool IsInequalityOp(Value op) {
+    return op == NE || op == NE_STRICT;
+  }
+
+  static bool IsArithmeticCompareOp(Value op) {
+    return IsOrderedRelationalCompareOp(op) ||
+        IsEqualityOp(op) || IsInequalityOp(op);
+  }
+
   static Value NegateCompareOp(Value op) {
-    ASSERT(IsCompareOp(op));
+    ASSERT(IsArithmeticCompareOp(op));
     switch (op) {
       case EQ: return NE;
       case NE: return EQ;
@@ -243,7 +252,7 @@ class Token {
   }
 
   static Value ReverseCompareOp(Value op) {
-    ASSERT(IsCompareOp(op));
+    ASSERT(IsArithmeticCompareOp(op));
     switch (op) {
       case EQ: return EQ;
       case NE: return NE;