v8  3.25.30(node0.11.13)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
scopeinfo.h
Go to the documentation of this file.
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 #ifndef V8_SCOPEINFO_H_
29 #define V8_SCOPEINFO_H_
30 
31 #include "allocation.h"
32 #include "variables.h"
33 #include "zone-inl.h"
34 
35 namespace v8 {
36 namespace internal {
37 
38 // Cache for mapping (data, property name) into context slot index.
39 // The cache contains both positive and negative results.
40 // Slot index equals -1 means the property is absent.
41 // Cleared at startup and prior to mark sweep collection.
43  public:
44  // Lookup context slot index for (data, name).
45  // If absent, kNotFound is returned.
46  int Lookup(Object* data,
47  String* name,
49  InitializationFlag* init_flag);
50 
51  // Update an element in the cache.
52  void Update(Object* data,
53  String* name,
54  VariableMode mode,
55  InitializationFlag init_flag,
56  int slot_index);
57 
58  // Clear the cache.
59  void Clear();
60 
61  static const int kNotFound = -2;
62 
63  private:
65  for (int i = 0; i < kLength; ++i) {
66  keys_[i].data = NULL;
67  keys_[i].name = NULL;
68  values_[i] = kNotFound;
69  }
70  }
71 
72  inline static int Hash(Object* data, String* name);
73 
74 #ifdef DEBUG
75  void ValidateEntry(Object* data,
76  String* name,
77  VariableMode mode,
78  InitializationFlag init_flag,
79  int slot_index);
80 #endif
81 
82  static const int kLength = 256;
83  struct Key {
84  Object* data;
85  String* name;
86  };
87 
88  struct Value {
89  Value(VariableMode mode,
90  InitializationFlag init_flag,
91  int index) {
93  ASSERT(InitField::is_valid(init_flag));
95  value_ = ModeField::encode(mode) |
96  IndexField::encode(index) |
97  InitField::encode(init_flag);
98  ASSERT(mode == this->mode());
99  ASSERT(init_flag == this->initialization_flag());
100  ASSERT(index == this->index());
101  }
102 
103  explicit inline Value(uint32_t value) : value_(value) {}
104 
105  uint32_t raw() { return value_; }
106 
107  VariableMode mode() { return ModeField::decode(value_); }
108 
109  InitializationFlag initialization_flag() {
110  return InitField::decode(value_);
111  }
112 
113  int index() { return IndexField::decode(value_); }
114 
115  // Bit fields in value_ (type, shift, size). Must be public so the
116  // constants can be embedded in generated code.
117  class ModeField: public BitField<VariableMode, 0, 4> {};
118  class InitField: public BitField<InitializationFlag, 4, 1> {};
119  class IndexField: public BitField<int, 5, 32-5> {};
120 
121  private:
122  uint32_t value_;
123  };
124 
125  Key keys_[kLength];
126  uint32_t values_[kLength];
127 
128  friend class Isolate;
130 };
131 
132 
133 
134 
135 //---------------------------------------------------------------------------
136 // Auxiliary class used for the description of module instances.
137 // Used by Runtime_DeclareModules.
138 
139 class ModuleInfo: public FixedArray {
140  public:
141  static ModuleInfo* cast(Object* description) {
142  return static_cast<ModuleInfo*>(FixedArray::cast(description));
143  }
144 
145  static Handle<ModuleInfo> Create(
146  Isolate* isolate, Interface* interface, Scope* scope);
147 
148  // Index of module's context in host context.
149  int host_index() { return Smi::cast(get(HOST_OFFSET))->value(); }
150 
151  // Name, mode, and index of the i-th export, respectively.
152  // For value exports, the index is the slot of the value in the module
153  // context, for exported modules it is the slot index of the
154  // referred module's context in the host context.
155  // TODO(rossberg): This format cannot yet handle exports of modules declared
156  // in earlier scripts.
157  String* name(int i) { return String::cast(get(name_offset(i))); }
159  return static_cast<VariableMode>(Smi::cast(get(mode_offset(i)))->value());
160  }
161  int index(int i) { return Smi::cast(get(index_offset(i)))->value(); }
162 
163  int length() { return (FixedArray::length() - HEADER_SIZE) / ITEM_SIZE; }
164 
165  private:
166  // The internal format is: Index, (Name, VariableMode, Index)*
167  enum {
168  HOST_OFFSET,
169  NAME_OFFSET,
170  MODE_OFFSET,
171  INDEX_OFFSET,
172  HEADER_SIZE = NAME_OFFSET,
173  ITEM_SIZE = INDEX_OFFSET - NAME_OFFSET + 1
174  };
175  inline int name_offset(int i) { return NAME_OFFSET + i * ITEM_SIZE; }
176  inline int mode_offset(int i) { return MODE_OFFSET + i * ITEM_SIZE; }
177  inline int index_offset(int i) { return INDEX_OFFSET + i * ITEM_SIZE; }
178 
179  static Handle<ModuleInfo> Allocate(Isolate* isolate, int length) {
181  isolate->factory()->NewFixedArray(HEADER_SIZE + ITEM_SIZE * length));
182  }
183  void set_host_index(int index) { set(HOST_OFFSET, Smi::FromInt(index)); }
184  void set_name(int i, String* name) { set(name_offset(i), name); }
185  void set_mode(int i, VariableMode mode) {
186  set(mode_offset(i), Smi::FromInt(mode));
187  }
188  void set_index(int i, int index) {
189  set(index_offset(i), Smi::FromInt(index));
190  }
191 };
192 
193 
194 } } // namespace v8::internal
195 
196 #endif // V8_SCOPEINFO_H_
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Definition: flags.cc:269
void set(int index, Object *value)
Definition: objects-inl.h:2147
static String * cast(Object *obj)
Definition: v8.h:1407
static Smi * FromInt(int value)
Definition: objects-inl.h:1209
static Handle< T > cast(Handle< S > that)
Definition: handles.h:75
String * name(int i)
Definition: scopeinfo.h:157
int Lookup(Object *data, String *name, VariableMode *mode, InitializationFlag *init_flag)
Definition: scopeinfo.cc:422
static const int kNotFound
Definition: scopeinfo.h:61
#define ASSERT(condition)
Definition: checks.h:329
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in only print modified registers Don t break for ASM_UNIMPLEMENTED_BREAK macros print stack trace when an illegal exception is thrown randomize hashes to avoid predictable hash Fixed seed to use to hash property Print the time it takes to deserialize the snapshot testing_bool_flag testing_int_flag string flag tmp file in which to serialize heap Print the time it takes to lazily compile hydrogen code stubs concurrent_recompilation concurrent_sweeping Print usage including on console Map counters to a file Enable debugger compile events enable GDBJIT interface(disables compacting GC)") DEFINE_bool(gdbjit_full
static Smi * cast(Object *object)
VariableMode mode(int i)
Definition: scopeinfo.h:158
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long mode(MIPS only)") DEFINE_string(expose_natives_as
static ModuleInfo * cast(Object *description)
Definition: scopeinfo.h:141
static Handle< ModuleInfo > Create(Isolate *isolate, Interface *interface, Scope *scope)
Definition: scopeinfo.cc:537
#define DISALLOW_COPY_AND_ASSIGN(TypeName)
Definition: globals.h:359
void Update(Object *data, String *name, VariableMode mode, InitializationFlag init_flag, int slot_index)
Definition: scopeinfo.cc:438
static FixedArray * cast(Object *obj)
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flags.cc:505