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

Public Member Functions

 IntrusiveMapTransitionIterator (Map *map, TransitionArray *transition_array, Object *constructor)
 
void StartIfNotStarted ()
 
bool IsIterating ()
 
MapNext ()
 

Private Member Functions

Object ** IteratorField ()
 

Private Attributes

Mapmap_
 
TransitionArraytransition_array_
 
Objectconstructor_
 

Detailed Description

Definition at line 7078 of file objects.cc.

Constructor & Destructor Documentation

◆ IntrusiveMapTransitionIterator()

v8::internal::IntrusiveMapTransitionIterator::IntrusiveMapTransitionIterator ( Map map,
TransitionArray transition_array,
Object constructor 
)
inline

Definition at line 7080 of file objects.cc.

7082  : map_(map),
7083  transition_array_(transition_array),
7084  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

◆ IsIterating()

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

Definition at line 7094 of file objects.cc.

7094  {
7095  return (*IteratorField())->IsSmi() &&
7096  Smi::cast(*IteratorField())->value() < 0;
7097  }

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

+ Here is the caller graph for this function:

◆ IteratorField()

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

Definition at line 7114 of file objects.cc.

7114  {
7116  }
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::IntrusiveMapTransitionIterator::Next ( )
inline

Definition at line 7099 of file objects.cc.

7099  {
7100  DCHECK(IsIterating());
7101  int value = Smi::cast(*IteratorField())->value();
7102  int index = -value - 1;
7103  int number_of_transitions = transition_array_->number_of_transitions();
7104  while (index < number_of_transitions) {
7105  *IteratorField() = Smi::FromInt(value - 1);
7106  return transition_array_->GetTarget(index);
7107  }
7108 
7110  return NULL;
7111  }
static Smi * FromInt(int value)
Definition: objects-inl.h:1321
Map * GetTarget(int transition_number)
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:

◆ StartIfNotStarted()

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

Definition at line 7086 of file objects.cc.

7086  {
7087  DCHECK(!(*IteratorField())->IsSmi() || IsIterating());
7088  if (!(*IteratorField())->IsSmi()) {
7090  *IteratorField() = Smi::FromInt(-1);
7091  }
7092  }

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::IntrusiveMapTransitionIterator::constructor_
private

Definition at line 7120 of file objects.cc.

◆ map_

Map* v8::internal::IntrusiveMapTransitionIterator::map_
private

Definition at line 7118 of file objects.cc.

◆ transition_array_

TransitionArray* v8::internal::IntrusiveMapTransitionIterator::transition_array_
private

Definition at line 7119 of file objects.cc.


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