Use simple loop tracking instead of size to determine if

lib/compiler/implementation/ssa/nodes.dart

 // Copyright (c) 2011, 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.
 
 interface HVisitor<R> {
   R visitAdd(HAdd node);
   R visitBitAnd(HBitAnd node);
   R visitBitNot(HBitNot node);
   R visitBitOr(HBitOr node);
   R visitBitXor(HBitXor node);
@@ skipping 96 matching lines @@
 
     currentBlock = node;
     visitInstructionList(node);
   }
 }
 
 class HGraph {
   HBasicBlock entry;
   HBasicBlock exit;
   bool isRecursiveMethod = false;
+  bool calledInLoop = false;
   final List<HBasicBlock> blocks;
 
   // We canonicalize all constants used within a graph so we do not
   // have to worry about them for global value numbering.
   Map<Constant, HConstant> constants;
 
   HGraph()
       : blocks = new List<HBasicBlock>(),
         constants = new Map<Constant, HConstant>() {
     entry = addNewBlock();
@@ skipping 2453 matching lines @@
   HBasicBlock get start() => expression.start;
   HBasicBlock get end() {
     // We don't create a switch block if there are no cases.
     assert(!statements.isEmpty());
     return statements.last().end;
   }
 
   bool accept(HStatementInformationVisitor visitor) =>
       visitor.visitSwitchInfo(this);
 }