Remove no-zone versions of intersection and union.

src/compiler/verifier.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/verifier.h"
 
 #include <algorithm>
 #include <deque>
 #include <queue>
 #include <sstream>
@@ skipping 573 matching lines @@
       CheckUpperIs(node, Type::Any());
       break;
     }
     case IrOpcode::kJSForInDone: {
       // TODO(bmeurer): OSR breaks this invariant, although the node is not user
       // visible, so we know it is safe (fullcodegen has an unsigned smi there).
       // CheckValueInputIs(node, 0, Type::UnsignedSmall());
       break;
     }
     case IrOpcode::kJSForInNext: {
-      CheckUpperIs(node, Type::Union(Type::Name(), Type::Undefined()));
+      CheckUpperIs(node, Type::Union(Type::Name(), Type::Undefined(), zone));
       break;
     }
     case IrOpcode::kJSForInStep: {
       // TODO(bmeurer): OSR breaks this invariant, although the node is not user
       // visible, so we know it is safe (fullcodegen has an unsigned smi there).
       // CheckValueInputIs(node, 0, Type::UnsignedSmall());
       CheckUpperIs(node, Type::UnsignedSmall());
       break;
     }
 
@@ skipping 544 matching lines @@
     // Check inputs for all nodes in the block.
     for (size_t i = 0; i < block->NodeCount(); i++) {
       Node* node = block->NodeAt(i);
       CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1);
     }
   }
 }
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8