Home
last modified time | relevance | path

Searched refs:JumpLoop (Results 1 - 11 of 11) sorted by relevance

/third_party/node/deps/v8/src/maglev/
H A Dmaglev-graph-printer.cc223 if (block->control_node()->Is<JumpLoop>()) { in PreProcessGraph()
224 loop_headers_.insert(block->control_node()->Cast<JumpLoop>()->target()); in PreProcessGraph()
239 if (node->Is<JumpLoop>()) { in PreProcessGraph()
240 BasicBlock* target = node->Cast<JumpLoop>()->target(); in PreProcessGraph()
439 if (control_node->Is<JumpLoop>()) { in Process()
440 BasicBlock* target = control_node->Cast<JumpLoop>()->target(); in Process()
H A Dmaglev-ir.h97 V(JumpLoop)
1428 node->Is<JumpLoop>()); in set_next_post_dominating_hole()
1537 class JumpLoop : public UnconditionalControlNodeT<JumpLoop> { class
1538 using Base = UnconditionalControlNodeT<JumpLoop>;
1541 explicit JumpLoop(uint32_t bitfield, BasicBlock* target) in JumpLoop() function in v8::internal::maglev::JumpLoop
1544 explicit JumpLoop(uint32_t bitfield, BasicBlockRef* ref) in JumpLoop() function in v8::internal::maglev::JumpLoop
H A Dmaglev-regalloc.cc90 // Compute, for all forward control nodes (i.e. excluding Return and JumpLoop) a
179 first->Is<JumpLoop>()) { in ComputePostDominatingHoles()
231 if (!control->Is<JumpLoop>()) { in AllocateRegisters()
247 } else if (control->Is<JumpLoop>()) { in AllocateRegisters()
H A Dmaglev-compiler.cc83 // Instead, they'll be visited while processing Jump/JumpLoop. in Process()
89 void Process(JumpLoop* node, const ProcessingState& state) { in Process()
H A Dmaglev-graph-builder.cc739 ? FinishBlock<JumpLoop>(next_offset(), {}, &jump_targets_[target]) in VisitJumpLoop()
740 : FinishBlock<JumpLoop>(next_offset(), {}, in VisitJumpLoop()
H A Dmaglev-ir.cc903 void JumpLoop::AllocateVreg(MaglevVregAllocationState* vreg_state, in AllocateVreg()
905 void JumpLoop::GenerateCode(MaglevCodeGenState* code_gen_state, in GenerateCode()
/third_party/node/deps/v8/src/interpreter/
H A Dcontrol-flow-builders.cc75 // than its parent loop, we do not create a JumpLoop bytecode. Instead, we in JumpToHeader()
76 // Jump to our parent's JumpToHeader which in turn can be a JumpLoop or, iff in JumpToHeader()
86 builder()->JumpLoop(&loop_header_, in JumpToHeader()
H A Dbytecodes.h342 V(JumpLoop, ImplicitRegisterUse::kNone, OperandType::kUImm, \
472 V(JumpLoop) \
534 V(JumpLoop)
744 // JumpIfTrueToBoolean, and JumpLoop due to having an implicit StackCheck.
H A Dbytecode-array-builder.h430 BytecodeArrayBuilder& JumpLoop(BytecodeLoopHeader* loop_header,
H A Dbytecode-array-builder.cc1259 BytecodeArrayBuilder& BytecodeArrayBuilder::JumpLoop( in JumpLoop() function in v8::internal::interpreter::BytecodeArrayBuilder
1262 // We need to attach a non-breakable source position to JumpLoop for its in JumpLoop()
H A Dinterpreter-generator.cc2166 // JumpLoop <imm> <loop_depth>
2170 IGNITION_HANDLER(JumpLoop, InterpreterAssembler) { in IGNITION_HANDLER()

Completed in 21 milliseconds