27 if (!key_->IsUniqueName()) {
28 key_ = key_->GetIsolate()->factory()->InternalizeString(
66 details_(attributes, type, representation, field_index) { }
83 FIELD, representation, field_index) {}
90 representation, field_index) { }
100 value->OptimalRepresentation()) {}
118 next_(isolate->top_lookup_result()),
119 lookup_type_(NOT_FOUND),
123 isolate->set_top_lookup_result(
this);
127 DCHECK(isolate()->top_lookup_result() ==
this);
128 isolate()->set_top_lookup_result(next_);
134 lookup_type_ = DESCRIPTOR_TYPE;
142 lookup_type_ = TRANSITION_TYPE;
144 details_ = target->instance_descriptors()->GetDetails(number_);
146 transition_ = target;
150 lookup_type_ = NOT_FOUND;
158 return details_.representation();
164 return !IsTransition() && details_.type() ==
CALLBACKS;
169 return details_.IsReadOnly();
174 return lookup_type_ == DESCRIPTOR_TYPE && details_.type() ==
FIELD;
179 return lookup_type_ == DESCRIPTOR_TYPE && details_.type() ==
CONSTANT;
183 bool IsFound()
const {
return lookup_type_ != NOT_FOUND; }
188 return IsFound() && !IsTransition();
197 return IsTransition() && details_.type() ==
FIELD;
201 return GetFieldIndexFromMap(
map) -
map->inobject_properties();
206 return GetValueFromMap(
map);
210 DCHECK(lookup_type_ == DESCRIPTOR_TYPE ||
211 lookup_type_ == TRANSITION_TYPE);
212 DCHECK(number_ < map->NumberOfOwnDescriptors());
213 return map->instance_descriptors()->GetValue(number_);
217 DCHECK(lookup_type_ == DESCRIPTOR_TYPE ||
218 lookup_type_ == TRANSITION_TYPE);
219 DCHECK(number_ < map->NumberOfOwnDescriptors());
220 return map->instance_descriptors()->GetFieldIndex(number_);
225 DCHECK(number_ < map->NumberOfOwnDescriptors());
226 return map->instance_descriptors()->GetFieldType(number_);
230 DCHECK(lookup_type_ == DESCRIPTOR_TYPE ||
231 lookup_type_ == TRANSITION_TYPE);
232 DCHECK(number_ < map->NumberOfOwnDescriptors());
233 return map->FindFieldOwner(number_);
248 PropertyDetails details_;
bool IsTransition() const
Isolate * isolate() const
Object * GetConstantFromMap(Map *map) const
Map * GetTransitionTarget() const
int GetLocalFieldIndexFromMap(Map *map) const
Descriptor(Handle< Name > key, Handle< Object > value, PropertyDetails details)
bool IsPropertyCallbacks() const
void Iterate(ObjectVisitor *visitor)
int GetFieldIndexFromMap(Map *map) const
Object * GetValueFromMap(Map *map) const
Descriptor(Handle< Name > key, Handle< Object > value, PropertyAttributes attributes, PropertyType type, Representation representation, int field_index=0)
PropertyDetails GetDetails() const
HeapType * GetFieldTypeFromMap(Map *map) const
bool IsConfigurable() const
void SetSortedKeyIndex(int index)
bool IsTransitionToField() const
Representation representation() const
Handle< Object > GetValue() const
void TransitionResult(JSObject *holder, Map *target)
void DescriptorResult(JSObject *holder, PropertyDetails details, int number)
LookupResult(Isolate *isolate)
Map * GetFieldOwnerFromMap(Map *map) const
Handle< Name > GetKey() const
void Init(Handle< Name > key, Handle< Object > value, PropertyDetails details)
Source to read snapshot and builtins files from.
CallbacksDescriptor(Handle< Name > key, Handle< Object > foreign, PropertyAttributes attributes)
FieldDescriptor(Handle< Name > key, int field_index, Handle< HeapType > field_type, PropertyAttributes attributes, Representation representation)
ConstantDescriptor(Handle< Name > key, Handle< Object > value, PropertyAttributes attributes)
FieldDescriptor(Handle< Name > key, int field_index, PropertyAttributes attributes, Representation representation)
static Representation None()
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf map
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS 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 enable alignment of csp to bytes on platforms which prefer the register to always be NULL
#define DCHECK_NE(v1, v2)
#define DCHECK(condition)
OStream & operator<<(OStream &os, const BasicBlockProfiler &p)
Debugger support for the V8 JavaScript engine.