MIPS: Fix test-simplified-lowering to pass without tf implemention.

test/cctest/compiler/test-simplified-lowering.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 <limits>
 
 #include "src/compiler/control-builders.h"
 #include "src/compiler/generic-node-inl.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/node-properties-inl.h"
@@ skipping 389 matching lines @@
     BoundsCheck(from_index);
     BoundsCheck(to_index);
     ElementAccess access = GetElementAccess();
 
     SimplifiedLoweringTester<Object*> t;
     Node* ptr = GetBaseNode(&t);
     Node* load = t.LoadElement(access, ptr, t.Int32Constant(from_index));
     t.StoreElement(access, ptr, t.Int32Constant(to_index), load);
     t.Return(t.jsgraph.TrueConstant());
     t.LowerAllNodes();
-    t.GenerateCode();
 
     if (Pipeline::SupportedTarget()) {
+      t.GenerateCode();
       Object* result = t.Call();
       CHECK_EQ(t.isolate()->heap()->true_value(), result);
     }
   }
 
   // Create and run code that copies the field in either {untagged_array}
   // or {tagged_array} at index {from_index} to index {to_index}.
   void RunCopyField(int from_index, int to_index) {
     BoundsCheck(from_index);
     BoundsCheck(to_index);
     FieldAccess from_access = GetFieldAccess(from_index);
     FieldAccess to_access = GetFieldAccess(to_index);
 
     SimplifiedLoweringTester<Object*> t;
     Node* ptr = GetBaseNode(&t);
     Node* load = t.LoadField(from_access, ptr);
     t.StoreField(to_access, ptr, load);
     t.Return(t.jsgraph.TrueConstant());
     t.LowerAllNodes();
-    t.GenerateCode();
 
     if (Pipeline::SupportedTarget()) {
+      t.GenerateCode();
       Object* result = t.Call();
       CHECK_EQ(t.isolate()->heap()->true_value(), result);
     }
   }
 
   // Create and run code that copies the elements from {this} to {that}.
   void RunCopyElements(AccessTester<E>* that) {
     SimplifiedLoweringTester<Object*> t;
 
     Node* one = t.Int32Constant(1);
@@ skipping 16 matching lines @@
       // index++
       index = t.Int32Add(index, one);
       t.environment()->Push(index);
       // continue
       loop.EndBody();
       loop.EndLoop();
     }
     index = t.environment()->Pop();
     t.Return(t.jsgraph.TrueConstant());
     t.LowerAllNodes();
-    t.GenerateCode();
 
     if (Pipeline::SupportedTarget()) {
+      t.GenerateCode();
       Object* result = t.Call();
       CHECK_EQ(t.isolate()->heap()->true_value(), result);
     }
   }
 
   E GetElement(int index) {
     BoundsCheck(index);
     if (tagged) {
       E* raw = reinterpret_cast<E*>(tagged_array->GetDataStartAddress());
       return raw[index];
@@ skipping 879 matching lines @@
 
   Node* store = t.graph()->NewNode(t.simplified()->StoreField(access), t.p0,
                                    t.p1, t.start, t.start);
   t.Effect(store);
   t.Lower();
 
   CHECK_EQ(IrOpcode::kStore, store->opcode());
   CHECK_EQ(t.p0, store->InputAt(0));
   CheckChangeOf(IrOpcode::kChangeTaggedToFloat64, t.p1, store->InputAt(2));
 }