1// Copyright 2009 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
33namespace v8 {
34namespace internal {
35
36
37void FuncNameInferrer::PushEnclosingName(Handle<String> name) {
38  // Enclosing name is a name of a constructor function. To check
39  // that it is really a constructor, we check that it is not empty
40  // and starts with a capital letter.
41  if (name->length() > 0 && Runtime::IsUpperCaseChar(
42      Isolate::Current()->runtime_state(), name->Get(0))) {
43    names_stack_.Add(name);
44  }
45}
46
47
48void FuncNameInferrer::PushLiteralName(Handle<String> name) {
49  if (IsOpen() && !HEAP->prototype_symbol()->Equals(*name)) {
50    names_stack_.Add(name);
51  }
52}
53
54
55void FuncNameInferrer::PushVariableName(Handle<String> name) {
56  if (IsOpen() && !HEAP->result_symbol()->Equals(*name)) {
57    names_stack_.Add(name);
58  }
59}
60
61
62Handle<String> FuncNameInferrer::MakeNameFromStack() {
63  if (names_stack_.is_empty()) {
64    return FACTORY->empty_string();
65  } else {
66    return MakeNameFromStackHelper(1, names_stack_.at(0));
67  }
68}
69
70
71Handle<String> FuncNameInferrer::MakeNameFromStackHelper(int pos,
72                                                         Handle<String> prev) {
73  if (pos >= names_stack_.length()) {
74    return prev;
75  } else {
76    Handle<String> curr = FACTORY->NewConsString(dot_, names_stack_.at(pos));
77    return MakeNameFromStackHelper(pos + 1, FACTORY->NewConsString(prev, curr));
78  }
79}
80
81
82void FuncNameInferrer::InferFunctionsNames() {
83  Handle<String> func_name = MakeNameFromStack();
84  for (int i = 0; i < funcs_to_infer_.length(); ++i) {
85    funcs_to_infer_[i]->set_inferred_name(func_name);
86  }
87  funcs_to_infer_.Rewind(0);
88}
89
90
91} }  // namespace v8::internal
92