Lines Matching defs:bytecode
26 Bytecode bytecode,
29 bytecode_(bytecode),
55 // Save the bytecode offset immediately if bytecode will make a call along
56 // the critical path, or it is a return bytecode.
57 if (Bytecodes::MakesCallAlongCriticalPath(bytecode) ||
58 Bytecodes::Returns(bytecode)) {
65 // accumulator in the way described in the bytecode definitions in
96 // Add one to the offset such that it points to the actual bytecode rather
97 // than the Wide / ExtraWide prefix bytecode.
107 // ExtraWide prefix bytecode.
132 // Force a re-load of the bytecode array after every call in case the debugger
413 // Read the most signicant bytecode into bytes[0] and then in order
693 // Bytecodes that make a call along the critical path save the bytecode
694 // offset in the bytecode handler's prologue. For other bytecodes, if
695 // there are multiple calls in the bytecode handler, you need to spill
848 // TODO(bmeurer): Unify this with the Construct bytecode feedback
1015 // Make sure we include the current bytecode in the budget calculation.
1031 CallRuntime(bytecode() == Bytecode::kJumpLoop
1163 TNode<Uint8T> bytecode =
1165 return ChangeUint32ToWord(bytecode);
1202 // At this point we don't know statically what bytecode we're executing, but
1258 // Dispatching a wide bytecode requires treating the prefix
1259 // bytecode a base pointer into the dispatch table and dispatching
1260 // the bytecode that follows relative to this base.
1296 // current bytecode and the start of the first one, to simulate backedge to
1299 // With headers and current offset, the bytecode array layout looks like:
1302 // | header | first bytecode | .... | return bytecode |
1304 // ^ tagged bytecode array pointer
1306 // UpdateInterruptBudget already handles adding the bytecode size to the
1308 // of the first bytecode.