#include <loop-analysis.h>
|
| NodeCopier (TFGraph *graph, uint32_t max, NodeVector *p, uint32_t copy_count) |
|
Node * | map (Node *node, uint32_t copy_index) |
|
V8_INLINE Node * | map (Node *node) |
|
void | Insert (Node *original, const NodeVector &new_copies) |
|
void | Insert (Node *original, Node *copy) |
|
template<typename InputIterator > |
void | CopyNodes (TFGraph *graph, Zone *tmp_zone_, Node *dead, base::iterator_range< InputIterator > nodes, SourcePositionTable *source_positions, NodeOriginTable *node_origins) |
|
bool | Marked (Node *node) |
|
Definition at line 202 of file loop-analysis.h.
◆ NodeCopier()
v8::internal::compiler::NodeCopier::NodeCopier |
( |
TFGraph * | graph, |
|
|
uint32_t | max, |
|
|
NodeVector * | p, |
|
|
uint32_t | copy_count ) |
|
inline |
◆ CopyNodes()
template<typename InputIterator >
◆ Insert() [1/2]
void v8::internal::compiler::NodeCopier::Insert |
( |
Node * | original, |
|
|
const NodeVector & | new_copies ) |
◆ Insert() [2/2]
void v8::internal::compiler::NodeCopier::Insert |
( |
Node * | original, |
|
|
Node * | copy ) |
◆ map() [1/2]
◆ map() [2/2]
Node * v8::internal::compiler::NodeCopier::map |
( |
Node * | node, |
|
|
uint32_t | copy_index ) |
◆ Marked()
bool v8::internal::compiler::NodeCopier::Marked |
( |
Node * | node | ) |
|
|
inline |
◆ copies_
NodeVector* v8::internal::compiler::NodeCopier::copies_ |
|
private |
◆ copy_count_
const uint32_t v8::internal::compiler::NodeCopier::copy_count_ |
|
private |
◆ node_map_
The documentation for this class was generated from the following files: