Home
last modified time | relevance | path

Searched refs:Revisit (Results 1 - 17 of 17) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Dgraph-reducer.cc188 Revisit(user); in ReduceTop()
228 if (user != node) Revisit(user); in Replace()
239 if (user != node) Revisit(user); in Replace()
270 Revisit(user); in ReplaceWithValue()
274 Revisit(user); in ReplaceWithValue()
279 Revisit(user); in ReplaceWithValue()
283 Revisit(user); in ReplaceWithValue()
310 void GraphReducer::Revisit(Node* node) { in Revisit() function in v8::internal::GraphReducer
H A Dgraph-reducer.h90 // Revisit the {node} again later.
91 virtual void Revisit(Node* node) = 0;
110 void Revisit(Node* node) { in Revisit() function in v8::internal::compiler::AdvancedReducer
112 editor_->Revisit(node); in Revisit()
189 // Revisit queue operations.
191 void Revisit(Node* node) final;
H A Dcommon-operator-reducer.cc173 Revisit(graph()->end()); in ReduceDeoptimizeConditional()
234 Revisit(merge); in ReduceEffectPhi()
271 Revisit(merge); in ReducePhi()
282 Revisit(merge); in ReducePhi()
301 Revisit(merge); in ReducePhi()
497 Revisit(graph()->end()); in ReduceTrapConditional()
H A Dbranch-elimination.cc160 Revisit(use); in ReduceBranch()
226 Revisit(merge); in TryPullTrapIntoMerge()
299 Revisit(graph()->end()); in ReduceTrapConditional()
340 Revisit(graph()->end()); in ReduceDeoptimizeConditional()
H A Ddead-code-elimination.cc160 Revisit(loop_exit); in ReduceLoopOrMerge()
173 Revisit(use); in ReduceLoopOrMerge()
254 Revisit(merge); in ReduceEffectPhi()
255 Revisit(graph_->end()); in ReduceEffectPhi()
H A Descape-analysis.h50 void Revisit(Node* node);
114 reducer->Revisit(node); in RevisitDependants()
H A Dadd-type-assertions-reducer.cc43 Revisit(user); in Reduce()
H A Dwasm-escape-analysis.cc53 Revisit(stored_value); in ReduceAllocateRaw()
H A Dwasm-inlining.cc281 Revisit(edge.from()); in RewireFunctionEntry()
304 Revisit(graph()->end()); in InlineTailCall()
380 Revisit(graph()->end()); in InlineCall()
H A Descape-analysis.cc339 if (reduction.effect_changed()) Revisit(use); in ReduceFrom()
341 if (reduction.value_changed()) Revisit(use); in ReduceFrom()
360 void EffectGraphReducer::Revisit(Node* node) { in Revisit() function in v8::internal::compiler::EffectGraphReducer
465 reducer_->Revisit(old_value); in MergeInputs()
H A Djs-typed-lowering.cc633 Revisit(on_exception); in ReduceJSAdd()
642 Revisit(graph()->end()); in ReduceJSAdd()
1155 Revisit(on_exception); in ReduceJSToObject()
1274 Revisit(on_exception); in ReduceJSHasInPrototypeChain()
1932 Revisit(if_exception); in ReduceJSForInNext()
2057 Revisit(user); in ReduceJSForInPrepare()
2060 Revisit(user); in ReduceJSForInPrepare()
2300 Revisit(on_exception); in ReduceObjectIsArray()
H A Djs-call-reducer.h71 void RevisitForGraphAssembler(Node* node) { Revisit(node); } in RevisitForGraphAssembler()
H A Djs-intrinsic-lowering.cc132 Revisit(graph()->end()); in ReduceDeoptimizeNow()
H A Dcsa-load-elimination.cc361 Revisit(object); in ReduceLoadFromObject()
H A Djs-inlining.cc218 Revisit(graph()->end()); in InlineCall()
H A Djs-native-context-specialization.cc505 Revisit(edge.from()); in ReduceJSInstanceOf()
1990 Revisit(graph()->end()); in ReduceEagerDeoptimize()
H A Djs-call-reducer.cc5487 Revisit(graph()->end());

Completed in 29 milliseconds