Remove DebuggerEvent. Refactor remaining code.

runtime/vm/flow_graph_range_analysis_test.cc

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/flow_graph_range_analysis.h"
 #include "vm/unit_test.h"
 
 namespace dart {
 
 TEST_CASE(RangeTests) {
@@ skipping 62 matching lines @@
                 RangeBoundary::NegativeInfinity(),
                 RangeBoundary::PositiveInfinity());
   TEST_RANGE_OP(Range::Shl, -1, 1, 63, 63,
                 RangeBoundary(kMinInt64),
                 RangeBoundary::PositiveInfinity());
   if (kBitsPerWord == 64) {
     TEST_RANGE_OP_SMI(Range::Shl, -1, 1, 62, 62,
                   RangeBoundary(kSmiMin),
                   RangeBoundary(kSmiMax));
     TEST_RANGE_OP_SMI(Range::Shl, -1, 1, 30, 30,
-                  RangeBoundary(-1 << 30),
+                  RangeBoundary(-(1 << 30)),
                   RangeBoundary(1 << 30));
   } else {
     TEST_RANGE_OP_SMI(Range::Shl, -1, 1, 30, 30,
                   RangeBoundary(kSmiMin),
                   RangeBoundary(kSmiMax));
     TEST_RANGE_OP_SMI(Range::Shl, -1, 1, 62, 62,
                   RangeBoundary(kSmiMin),
                   RangeBoundary(kSmiMax));
   }
   TEST_RANGE_OP(Range::Shl, 0, 100, 0, 64,
@@ skipping 605 matching lines @@
       p_infinity,
       size).IsMaximumOrAbove(size));
 
   EXPECT(RangeBoundary::JoinMax(
       p_infinity,
       RangeBoundary::FromConstant(1),
       size).IsMaximumOrAbove(size));
 }
 
 }  // namespace dart