anchor.diff:              if (cont.isRecursive) {
                 return node.isRecursive
                     ? new Continue(labels[cont])
  -                  : new WhileTrue(labels[cont], makeLoopBody(cont.body));
  +                  : new WhileTrue(labels[cont], visit(cont.body));
               } else {
                 if (cont.hasExactlyOneUse) {
                   if (safeForInlining.contains(cont)) {
  
positive.code:   /// The 'this' Parameter for currentElement or the enclosing method.
    cps_ir.Parameter thisParameter;
    cps_ir.Continuation returnContinuation;
  
    /// Number of loops enclosing the currently visited node.
    int enclosingLoops = 0;
  
    Builder parent;
  
  
negative.code:             }
            });
      }
    }
  
    Statement visitBranch(cps_ir.Branch node) {
  