[turbofan] Inline the allocation fast path.

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/ast/scopes.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/change-lowering.h"
 #include "src/compiler/control-builders.h"
@@ skipping 49 matching lines @@
   void LowerAllNodesAndLowerChanges() {
     this->End();
     typer.Run();
     lowering.LowerAllNodes();
 
     Schedule* schedule = Scheduler::ComputeSchedule(this->zone(), this->graph(),
                                                     Scheduler::kNoFlags);
     EffectControlLinearizer linearizer(&jsgraph, schedule, this->zone());
     linearizer.Run();
 
-    ChangeLowering lowering(&jsgraph);
     GraphReducer reducer(this->zone(), this->graph());
+    ChangeLowering lowering(&reducer, &jsgraph);
     reducer.AddReducer(&lowering);
     reducer.ReduceGraph();
     Verifier::Run(this->graph());
   }
 
   void CheckNumberCall(double expected, double input) {
     // TODO(titzer): make calls to NewNumber work in cctests.
     if (expected <= Smi::kMinValue) return;
     if (expected >= Smi::kMaxValue) return;
     Handle<Object> num = factory()->NewNumber(input);
@@ skipping 649 matching lines @@
 
   void LowerAllNodesAndLowerChanges() {
     SourcePositionTable table(jsgraph.graph());
     SimplifiedLowering(&jsgraph, jsgraph.zone(), &table).LowerAllNodes();
 
     Schedule* schedule = Scheduler::ComputeSchedule(this->zone(), this->graph(),
                                                     Scheduler::kNoFlags);
     EffectControlLinearizer linearizer(&jsgraph, schedule, this->zone());
     linearizer.Run();
 
-    ChangeLowering lowering(&jsgraph);
     GraphReducer reducer(this->zone(), this->graph());
+    ChangeLowering lowering(&reducer, &jsgraph);
     reducer.AddReducer(&lowering);
     reducer.ReduceGraph();
     Verifier::Run(this->graph());
   }
 
   // Inserts the node as the return value of the graph.
   Node* Return(Node* node) {
     ret->ReplaceInput(0, node);
     return node;
   }
@@ skipping 1186 matching lines @@
     t.Return(use);
     t.Lower();
 
     CHECK_EQ(d.expected, PhiRepresentationOf(phi->op()));
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8