V8 Project
v8::internal::IntrusivePrototypeTransitionIterator Class Reference
+ Collaboration diagram for v8::internal::IntrusivePrototypeTransitionIterator:

Public Member Functions

 IntrusivePrototypeTransitionIterator (Map *map, HeapObject *proto_trans, Object *constructor)
 
void StartIfNotStarted ()
 
bool IsIterating ()
 
MapNext ()
 

Private Member Functions

Object ** IteratorField ()
 
int NumberOfTransitions ()
 
MapGetTransition (int transitionNumber)
 
int IndexFor (int transitionNumber)
 

Private Attributes

Mapmap_
 
HeapObjectproto_trans_
 
Objectconstructor_
 

Detailed Description

Definition at line 7128 of file objects.cc.

Constructor & Destructor Documentation

◆ IntrusivePrototypeTransitionIterator()

v8::internal::IntrusivePrototypeTransitionIterator::IntrusivePrototypeTransitionIterator ( Map map,
HeapObject proto_trans,
Object constructor 
)
inline

Definition at line 7130 of file objects.cc.

7132  : map_(map), proto_trans_(proto_trans), constructor_(constructor) { }
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

Member Function Documentation

◆ GetTransition()

Map* v8::internal::IntrusivePrototypeTransitionIterator::GetTransition ( int  transitionNumber)
inlineprivate

Definition at line 7168 of file objects.cc.

7168  {
7169  FixedArray* proto_trans = reinterpret_cast<FixedArray*>(proto_trans_);
7170  return Map::cast(proto_trans->get(IndexFor(transitionNumber)));
7171  }

References v8::internal::FixedArray::get().

+ Here is the call graph for this function:

◆ IndexFor()

int v8::internal::IntrusivePrototypeTransitionIterator::IndexFor ( int  transitionNumber)
inlineprivate

Definition at line 7173 of file objects.cc.

7173  {
7176  transitionNumber * Map::kProtoTransitionElementsPerEntry;
7177  }
static const int kProtoTransitionMapOffset
Definition: objects.h:5905
static const int kProtoTransitionElementsPerEntry
Definition: objects.h:5903
static const int kProtoTransitionHeaderSize
Definition: objects.h:5901

References v8::internal::Map::kProtoTransitionElementsPerEntry, v8::internal::Map::kProtoTransitionHeaderSize, and v8::internal::Map::kProtoTransitionMapOffset.

◆ IsIterating()

bool v8::internal::IntrusivePrototypeTransitionIterator::IsIterating ( )
inline

Definition at line 7141 of file objects.cc.

7141  {
7142  return (*IteratorField())->IsSmi() &&
7143  Smi::cast(*IteratorField())->value() >= 0;
7144  }

Referenced by v8::internal::TraversableMap::ChildIteratorNext().

+ Here is the caller graph for this function:

◆ IteratorField()

Object** v8::internal::IntrusivePrototypeTransitionIterator::IteratorField ( )
inlineprivate

Definition at line 7158 of file objects.cc.

7158  {
7160  }
static Object ** RawField(HeapObject *obj, int offset)
Definition: objects-inl.h:1311
static const int kConstructorOffset
Definition: objects.h:6191

References v8::internal::Map::kConstructorOffset, and v8::internal::HeapObject::RawField().

+ Here is the call graph for this function:

◆ Next()

Map* v8::internal::IntrusivePrototypeTransitionIterator::Next ( )
inline

Definition at line 7146 of file objects.cc.

7146  {
7147  DCHECK(IsIterating());
7148  int transitionNumber = Smi::cast(*IteratorField())->value();
7149  if (transitionNumber < NumberOfTransitions()) {
7150  *IteratorField() = Smi::FromInt(transitionNumber + 1);
7151  return GetTransition(transitionNumber);
7152  }
7154  return NULL;
7155  }
static Smi * FromInt(int value)
Definition: objects-inl.h:1321
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(condition)
Definition: logging.h:205

References DCHECK, v8::internal::Smi::FromInt(), and NULL.

Referenced by v8::internal::TraversableMap::ChildIteratorNext().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ NumberOfTransitions()

int v8::internal::IntrusivePrototypeTransitionIterator::NumberOfTransitions ( )
inlineprivate

Definition at line 7162 of file objects.cc.

7162  {
7163  FixedArray* proto_trans = reinterpret_cast<FixedArray*>(proto_trans_);
7164  Object* num = proto_trans->get(Map::kProtoTransitionNumberOfEntriesOffset);
7165  return Smi::cast(num)->value();
7166  }
static const int kProtoTransitionNumberOfEntriesOffset
Definition: objects.h:5902
kSerializedDataOffset Object
Definition: objects-inl.h:5322

References v8::internal::FixedArray::get(), and v8::internal::Map::kProtoTransitionNumberOfEntriesOffset.

+ Here is the call graph for this function:

◆ StartIfNotStarted()

void v8::internal::IntrusivePrototypeTransitionIterator::StartIfNotStarted ( )
inline

Definition at line 7134 of file objects.cc.

7134  {
7135  if (!(*IteratorField())->IsSmi()) {
7137  *IteratorField() = Smi::FromInt(0);
7138  }
7139  }

References DCHECK, and v8::internal::Smi::FromInt().

Referenced by v8::internal::TraversableMap::ChildIteratorNext().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

Member Data Documentation

◆ constructor_

Object* v8::internal::IntrusivePrototypeTransitionIterator::constructor_
private

Definition at line 7181 of file objects.cc.

◆ map_

Map* v8::internal::IntrusivePrototypeTransitionIterator::map_
private

Definition at line 7179 of file objects.cc.

◆ proto_trans_

HeapObject* v8::internal::IntrusivePrototypeTransitionIterator::proto_trans_
private

Definition at line 7180 of file objects.cc.


The documentation for this class was generated from the following file: