Home
last modified time | relevance | path

Searched refs:revisit_ (Results 1 - 5 of 5) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Dgraph-reducer.cc49 revisit_(zone), in GraphReducer()
69 DCHECK(revisit_.empty()); in ReduceNode()
76 } else if (!revisit_.empty()) { in ReduceNode()
78 node = revisit_.front(); in ReduceNode()
79 revisit_.pop(); in ReduceNode()
89 if (revisit_.empty()) break; in ReduceNode()
92 DCHECK(revisit_.empty()); in ReduceNode()
313 revisit_.push(node); in Revisit()
H A Dstore-store-elimination.cc205 revisit_(temp_zone), in RedundantStoreFinder()
267 ZoneStack<Node*> revisit_; member in v8::internal::compiler::__anon14415::final
279 while (!revisit_.empty()) { in Find()
281 Node* next = revisit_.top(); in Find()
282 revisit_.pop(); in Find()
303 revisit_.push(node); in MarkForRevisit()
H A Descape-analysis.h58 revisit_.push(node); in AddRoot()
61 bool Complete() { return stack_.empty() && revisit_.empty(); } in Complete()
75 ZoneStack<Node*> revisit_; member in v8::internal::compiler::EffectGraphReducer
H A Descape-analysis.cc298 revisit_(zone), in EffectGraphReducer()
346 // of escape analysis. Using a stack for {revisit_} reverses the order in in ReduceFrom()
348 while (!revisit_.empty()) { in ReduceFrom()
349 Node* revisit = revisit_.top(); in ReduceFrom()
354 revisit_.pop(); in ReduceFrom()
365 revisit_.push(node); in Revisit()
H A Dgraph-reducer.h197 ZoneQueue<Node*> revisit_; member in v8::internal::compiler::GraphReducer

Completed in 4 milliseconds