V8 Project
v8::internal::compiler::GenericNode< B, S >::Uses::iterator Class Reference

#include <generic-node.h>

+ Collaboration diagram for v8::internal::compiler::GenericNode< B, S >::Uses::iterator:

Public Member Functions

 iterator (const typename GenericNode< B, S >::Uses::iterator &other)
 
Soperator* ()
 
GenericNode< B, S >::Edge edge ()
 
bool operator== (const iterator &other)
 
bool operator!= (const iterator &other)
 
iteratoroperator++ ()
 
iteratorUpdateToAndIncrement (GenericNode< B, S > *new_to)
 
int index () const
 

Private Member Functions

 iterator ()
 
 iterator (GenericNode< B, S > *node)
 
InputCurrentInput () const
 

Private Attributes

GenericNode< B, S >::Usecurrent_
 
int index_
 

Detailed Description

template<class B, class S>
class v8::internal::compiler::GenericNode< B, S >::Uses::iterator

Definition at line 225 of file generic-node.h.

Constructor & Destructor Documentation

◆ iterator() [1/3]

template<class B , class S >
v8::internal::compiler::GenericNode< B, S >::Uses::iterator::iterator ( const typename GenericNode< B, S >::Uses::iterator other)
inline

Definition at line 227 of file generic-node.h.

228  : current_(other.current_),
229  index_(other.index_) {}

◆ iterator() [2/3]

template<class B , class S >
v8::internal::compiler::GenericNode< B, S >::Uses::iterator::iterator ( )
inlineprivate

Definition at line 257 of file generic-node.h.

257 : current_(NULL), index_(0) {}
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

◆ iterator() [3/3]

template<class B , class S >
v8::internal::compiler::GenericNode< B, S >::Uses::iterator::iterator ( GenericNode< B, S > *  node)
inlineexplicitprivate

Definition at line 258 of file generic-node.h.

259  : current_(node->first_use_), index_(0) {}

Member Function Documentation

◆ CurrentInput()

template<class B , class S >
Input* v8::internal::compiler::GenericNode< B, S >::Uses::iterator::CurrentInput ( ) const
inlineprivate

Definition at line 261 of file generic-node.h.

◆ edge()

template<class B , class S >
GenericNode<B, S>::Edge v8::internal::compiler::GenericNode< B, S >::Uses::iterator::edge ( )
inline

Definition at line 232 of file generic-node.h.

232  {
233  return typename GenericNode::Edge(CurrentInput());
234  }

◆ index()

template<class B , class S >
int v8::internal::compiler::GenericNode< B, S >::Uses::iterator::index ( ) const
inline

Definition at line 252 of file generic-node.h.

252 { return index_; }

◆ operator!=()

template<class B , class S >
bool v8::internal::compiler::GenericNode< B, S >::Uses::iterator::operator!= ( const iterator other)
inline

Definition at line 237 of file generic-node.h.

237 { return other.current_ != current_; }

References v8::internal::compiler::GenericNode< B, S >::Uses::iterator::current_.

◆ operator*()

template<class B , class S >
S* v8::internal::compiler::GenericNode< B, S >::Uses::iterator::operator* ( )
inline

Definition at line 231 of file generic-node.h.

231 { return static_cast<S*>(current_->from); }

References v8::internal::S.

◆ operator++()

template<class B , class S >
iterator& v8::internal::compiler::GenericNode< B, S >::Uses::iterator::operator++ ( )
inline

Definition at line 238 of file generic-node.h.

238  {
239  DCHECK(current_ != NULL);
240  index_++;
242  return *this;
243  }
#define DCHECK(condition)
Definition: logging.h:205

References DCHECK, and NULL.

◆ operator==()

template<class B , class S >
bool v8::internal::compiler::GenericNode< B, S >::Uses::iterator::operator== ( const iterator other)
inline

Definition at line 236 of file generic-node.h.

236 { return other.current_ == current_; }

References v8::internal::compiler::GenericNode< B, S >::Uses::iterator::current_.

◆ UpdateToAndIncrement()

template<class B , class S >
iterator& v8::internal::compiler::GenericNode< B, S >::Uses::iterator::UpdateToAndIncrement ( GenericNode< B, S > *  new_to)
inline

Definition at line 244 of file generic-node.h.

244  {
245  DCHECK(current_ != NULL);
246  index_++;
247  typename GenericNode<B, S>::Input* input = CurrentInput();
249  input->Update(new_to);
250  return *this;
251  }

References DCHECK, NULL, and v8::internal::compiler::GenericNode< B, S >::Input::Update().

+ Here is the call graph for this function:

Member Data Documentation

◆ current_

◆ index_

template<class B , class S >
int v8::internal::compiler::GenericNode< B, S >::Uses::iterator::index_
private

Definition at line 266 of file generic-node.h.


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