| Index: src/fast-codegen.cc
|
| ===================================================================
|
| --- src/fast-codegen.cc (revision 0)
|
| +++ src/fast-codegen.cc (revision 0)
|
| @@ -0,0 +1,236 @@
|
| +// Copyright 2009 the V8 project authors. All rights reserved.
|
| +// Redistribution and use in source and binary forms, with or without
|
| +// modification, are permitted provided that the following conditions are
|
| +// met:
|
| +//
|
| +// * Redistributions of source code must retain the above copyright
|
| +// notice, this list of conditions and the following disclaimer.
|
| +// * Redistributions in binary form must reproduce the above
|
| +// copyright notice, this list of conditions and the following
|
| +// disclaimer in the documentation and/or other materials provided
|
| +// with the distribution.
|
| +// * Neither the name of Google Inc. nor the names of its
|
| +// contributors may be used to endorse or promote products derived
|
| +// from this software without specific prior written permission.
|
| +//
|
| +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| +
|
| +#include "v8.h"
|
| +
|
| +#include "codegen-inl.h"
|
| +#include "fast-codegen.h"
|
| +
|
| +namespace v8 {
|
| +namespace internal {
|
| +
|
| +Handle<Code> FastCodeGenerator::MakeCode(FunctionLiteral* fun,
|
| + Handle<Script> script) {
|
| + CodeGenerator::MakeCodePrologue(fun);
|
| + const int kInitialBufferSize = 4 * KB;
|
| + MacroAssembler masm(NULL, kInitialBufferSize);
|
| + FastCodeGenerator cgen(&masm);
|
| + cgen.Generate(fun);
|
| + if (cgen.HasStackOverflow()) {
|
| + ASSERT(!Top::has_pending_exception());
|
| + return Handle<Code>::null();
|
| + }
|
| + Code::Flags flags = Code::ComputeFlags(Code::FUNCTION, NOT_IN_LOOP);
|
| + return CodeGenerator::MakeCodeEpilogue(fun, &masm, flags, script);
|
| +}
|
| +
|
| +
|
| +int FastCodeGenerator::SlotOffset(Slot* slot) {
|
| + // Offset is negative because higher indexes are at lower addresses.
|
| + int offset = -slot->index() * kPointerSize;
|
| + // Adjust by a (parameter or local) base offset.
|
| + switch (slot->type()) {
|
| + case Slot::PARAMETER:
|
| + offset += (function_->scope()->num_parameters() + 1) * kPointerSize;
|
| + break;
|
| + case Slot::LOCAL:
|
| + offset += JavaScriptFrameConstants::kLocal0Offset;
|
| + break;
|
| + default:
|
| + UNREACHABLE();
|
| + }
|
| + return offset;
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitDeclaration(Declaration* decl) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitBlock(Block* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitEmptyStatement(EmptyStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitIfStatement(IfStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitContinueStatement(ContinueStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitBreakStatement(BreakStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitWithEnterStatement(WithEnterStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitWithExitStatement(WithExitStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitDoWhileStatement(DoWhileStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitWhileStatement(WhileStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitForStatement(ForStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitForInStatement(ForInStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitTryCatchStatement(TryCatchStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitTryFinallyStatement(TryFinallyStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitDebuggerStatement(DebuggerStatement* stmt) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitFunctionLiteral(FunctionLiteral* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitFunctionBoilerplateLiteral(
|
| + FunctionBoilerplateLiteral* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitConditional(Conditional* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitRegExpLiteral(RegExpLiteral* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitObjectLiteral(ObjectLiteral* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitArrayLiteral(ArrayLiteral* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitCatchExtensionObject(CatchExtensionObject* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitThrow(Throw* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitProperty(Property* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitCall(Call* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitCallNew(CallNew* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitCallRuntime(CallRuntime* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitUnaryOperation(UnaryOperation* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitCountOperation(CountOperation* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitBinaryOperation(BinaryOperation* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitCompareOperation(CompareOperation* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +void FastCodeGenerator::VisitThisFunction(ThisFunction* expr) {
|
| + UNREACHABLE();
|
| +}
|
| +
|
| +
|
| +} } // namespace v8::internal
|
|
|