Home
last modified time | relevance | path

Searched refs:to_visit_ (Results 1 - 4 of 4) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Dbranch-condition-duplicator.cc82 to_visit_.push(node); in Enqueue()
95 while (!to_visit_.empty()) { in ProcessGraph()
96 Node* node = to_visit_.front(); in ProcessGraph()
97 to_visit_.pop(); in ProcessGraph()
103 : graph_(graph), to_visit_(zone), seen_(graph, 2) {} in BranchConditionDuplicator()
H A Ddecompression-optimizer.cc52 to_visit_(zone), in DecompressionOptimizer()
57 while (!to_visit_.empty()) { in MarkNodes()
58 Node* const node = to_visit_.front(); in MarkNodes()
59 to_visit_.pop_front(); in MarkNodes()
164 to_visit_.push_back(node); in MaybeMarkAndQueueForRevisit()
H A Dbranch-condition-duplicator.h77 ZoneQueue<Node*> to_visit_; member in v8::internal::compiler::final
H A Ddecompression-optimizer.h53 // to_visit_. We couldn't find a node that observes the upper bits.
55 // to_visit_. We found at least one node that observes the upper bits.
111 // to_visit_ is a Deque but it's used as if it were a Queue. The reason why we
114 NodeDeque to_visit_; member in v8::internal::compiler::final

Completed in 3 milliseconds