528eb97b3a
the parser in preparation for not using the optimizer when using the full codegen. Code covered by existing tests. Review URL: http://codereview.chromium.org/3141034 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@5321 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
91 lines
3.1 KiB
C++
91 lines
3.1 KiB
C++
// 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 "ast.h"
|
|
#include "func-name-inferrer.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
|
|
void FuncNameInferrer::PushEnclosingName(Handle<String> name) {
|
|
// Enclosing name is a name of a constructor function. To check
|
|
// that it is really a constructor, we check that it is not empty
|
|
// and starts with a capital letter.
|
|
if (name->length() > 0 && Runtime::IsUpperCaseChar(name->Get(0))) {
|
|
names_stack_.Add(name);
|
|
}
|
|
}
|
|
|
|
|
|
void FuncNameInferrer::PushLiteralName(Handle<String> name) {
|
|
if (IsOpen() && !Heap::prototype_symbol()->Equals(*name)) {
|
|
names_stack_.Add(name);
|
|
}
|
|
}
|
|
|
|
|
|
void FuncNameInferrer::PushVariableName(Handle<String> name) {
|
|
if (IsOpen() && !Heap::result_symbol()->Equals(*name)) {
|
|
names_stack_.Add(name);
|
|
}
|
|
}
|
|
|
|
|
|
Handle<String> FuncNameInferrer::MakeNameFromStack() {
|
|
if (names_stack_.is_empty()) {
|
|
return Factory::empty_string();
|
|
} else {
|
|
return MakeNameFromStackHelper(1, names_stack_.at(0));
|
|
}
|
|
}
|
|
|
|
|
|
Handle<String> FuncNameInferrer::MakeNameFromStackHelper(int pos,
|
|
Handle<String> prev) {
|
|
if (pos >= names_stack_.length()) {
|
|
return prev;
|
|
} else {
|
|
Handle<String> curr = Factory::NewConsString(dot_, names_stack_.at(pos));
|
|
return MakeNameFromStackHelper(pos + 1, Factory::NewConsString(prev, curr));
|
|
}
|
|
}
|
|
|
|
|
|
void FuncNameInferrer::InferFunctionsNames() {
|
|
Handle<String> func_name = MakeNameFromStack();
|
|
for (int i = 0; i < funcs_to_infer_.length(); ++i) {
|
|
funcs_to_infer_[i]->set_inferred_name(func_name);
|
|
}
|
|
funcs_to_infer_.Rewind(0);
|
|
}
|
|
|
|
|
|
} } // namespace v8::internal
|