1// Copyright 2011 the V8 project authors. All rights reserved. 2// Redistribution and use in source and binary forms, with or without 3// modification, are permitted provided that the following conditions are 4// met: 5// 6// * Redistributions of source code must retain the above copyright 7// notice, this list of conditions and the following disclaimer. 8// * Redistributions in binary form must reproduce the above 9// copyright notice, this list of conditions and the following 10// disclaimer in the documentation and/or other materials provided 11// with the distribution. 12// * Neither the name of Google Inc. nor the names of its 13// contributors may be used to endorse or promote products derived 14// from this software without specific prior written permission. 15// 16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 28#include "v8.h" 29 30#include "ast.h" 31#include "func-name-inferrer.h" 32#include "list-inl.h" 33 34namespace v8 { 35namespace internal { 36 37FuncNameInferrer::FuncNameInferrer(Isolate* isolate) 38 : isolate_(isolate), 39 entries_stack_(10), 40 names_stack_(5), 41 funcs_to_infer_(4) { 42} 43 44 45void FuncNameInferrer::PushEnclosingName(Handle<String> name) { 46 // Enclosing name is a name of a constructor function. To check 47 // that it is really a constructor, we check that it is not empty 48 // and starts with a capital letter. 49 if (name->length() > 0 && Runtime::IsUpperCaseChar( 50 isolate()->runtime_state(), name->Get(0))) { 51 names_stack_.Add(Name(name, kEnclosingConstructorName)); 52 } 53} 54 55 56void FuncNameInferrer::PushLiteralName(Handle<String> name) { 57 if (IsOpen() && !isolate()->heap()->prototype_symbol()->Equals(*name)) { 58 names_stack_.Add(Name(name, kLiteralName)); 59 } 60} 61 62 63void FuncNameInferrer::PushVariableName(Handle<String> name) { 64 if (IsOpen() && !isolate()->heap()->result_symbol()->Equals(*name)) { 65 names_stack_.Add(Name(name, kVariableName)); 66 } 67} 68 69 70Handle<String> FuncNameInferrer::MakeNameFromStack() { 71 return MakeNameFromStackHelper(0, isolate()->factory()->empty_string()); 72} 73 74 75Handle<String> FuncNameInferrer::MakeNameFromStackHelper(int pos, 76 Handle<String> prev) { 77 if (pos >= names_stack_.length()) return prev; 78 if (pos < names_stack_.length() - 1 && 79 names_stack_.at(pos).type == kVariableName && 80 names_stack_.at(pos + 1).type == kVariableName) { 81 // Skip consecutive variable declarations. 82 return MakeNameFromStackHelper(pos + 1, prev); 83 } else { 84 if (prev->length() > 0) { 85 Factory* factory = isolate()->factory(); 86 Handle<String> curr = factory->NewConsString( 87 factory->dot_symbol(), names_stack_.at(pos).name); 88 return MakeNameFromStackHelper(pos + 1, 89 factory->NewConsString(prev, curr)); 90 } else { 91 return MakeNameFromStackHelper(pos + 1, names_stack_.at(pos).name); 92 } 93 } 94} 95 96 97void FuncNameInferrer::InferFunctionsNames() { 98 Handle<String> func_name = MakeNameFromStack(); 99 for (int i = 0; i < funcs_to_infer_.length(); ++i) { 100 funcs_to_infer_[i]->set_inferred_name(func_name); 101 } 102 funcs_to_infer_.Rewind(0); 103} 104 105 106} } // namespace v8::internal 107