Home | History | Annotate | Download | only in src 
      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 
     34 namespace v8 {
     35 namespace internal {
     36 
     37 FuncNameInferrer::FuncNameInferrer(Isolate* isolate, Zone* zone)
     38     : isolate_(isolate),
     39       entries_stack_(10, zone),
     40       names_stack_(5, zone),
     41       funcs_to_infer_(4, zone),
     42       zone_(zone) {
     43 }
     44 
     45 
     46 void FuncNameInferrer::PushEnclosingName(Handle<String> name) {
     47   // Enclosing name is a name of a constructor function. To check
     48   // that it is really a constructor, we check that it is not empty
     49   // and starts with a capital letter.
     50   if (name->length() > 0 && Runtime::IsUpperCaseChar(
     51           isolate()->runtime_state(), name->Get(0))) {
     52     names_stack_.Add(Name(name, kEnclosingConstructorName), zone());
     53   }
     54 }
     55 
     56 
     57 void FuncNameInferrer::PushLiteralName(Handle<String> name) {
     58   if (IsOpen() && !isolate()->heap()->prototype_string()->Equals(*name)) {
     59     names_stack_.Add(Name(name, kLiteralName), zone());
     60   }
     61 }
     62 
     63 
     64 void FuncNameInferrer::PushVariableName(Handle<String> name) {
     65   if (IsOpen() && !isolate()->heap()->dot_result_string()->Equals(*name)) {
     66     names_stack_.Add(Name(name, kVariableName), zone());
     67   }
     68 }
     69 
     70 
     71 Handle<String> FuncNameInferrer::MakeNameFromStack() {
     72   return MakeNameFromStackHelper(0, isolate()->factory()->empty_string());
     73 }
     74 
     75 
     76 Handle<String> FuncNameInferrer::MakeNameFromStackHelper(int pos,
     77                                                          Handle<String> prev) {
     78   if (pos >= names_stack_.length()) return prev;
     79   if (pos < names_stack_.length() - 1 &&
     80       names_stack_.at(pos).type == kVariableName &&
     81       names_stack_.at(pos + 1).type == kVariableName) {
     82     // Skip consecutive variable declarations.
     83     return MakeNameFromStackHelper(pos + 1, prev);
     84   } else {
     85     if (prev->length() > 0) {
     86       Factory* factory = isolate()->factory();
     87       Handle<String> curr = factory->NewConsString(
     88           factory->dot_string(), names_stack_.at(pos).name);
     89       return MakeNameFromStackHelper(pos + 1,
     90                                      factory->NewConsString(prev, curr));
     91     } else {
     92       return MakeNameFromStackHelper(pos + 1, names_stack_.at(pos).name);
     93     }
     94   }
     95 }
     96 
     97 
     98 void FuncNameInferrer::InferFunctionsNames() {
     99   Handle<String> func_name = MakeNameFromStack();
    100   for (int i = 0; i < funcs_to_infer_.length(); ++i) {
    101     funcs_to_infer_[i]->set_inferred_name(func_name);
    102   }
    103   funcs_to_infer_.Rewind(0);
    104 }
    105 
    106 
    107 } }  // namespace v8::internal
    108