Lines Matching refs:bytecode
11 #include "src/compiler/bytecode-analysis.h"
12 #include "src/compiler/bytecode-liveness-map.h"
15 #include "src/interpreter/bytecode-register.h"
134 interpreter::Bytecode bytecode = iterator_.current_bytecode();
135 if (interpreter::Bytecodes::IsForwardJump(bytecode)) {
139 if (interpreter::Bytecodes::IsConditionalJump(bytecode)) {
142 } else if (bytecode == interpreter::Bytecode::kJumpLoop) {
146 } else if (interpreter::Bytecodes::IsSwitch(bytecode)) {
152 } else if (!interpreter::Bytecodes::Returns(bytecode) &&
153 !interpreter::Bytecodes::UnconditionallyThrows(bytecode)) {
154 // Any other bytecode that doesn't return or throw will merge into the
470 // Add 1 after the end of the bytecode so we can always write to the offset
471 // after the last bytecode.
472 size_t array_length = bytecode().length() + 1;
476 interpreter::BytecodeArrayIterator iterator(bytecode().object());
478 interpreter::Bytecode bytecode = iterator.current_bytecode();
479 if (interpreter::Bytecodes::IsJump(bytecode)) {
481 if (!interpreter::Bytecodes::IsConditionalJump(bytecode)) {
484 } else if (interpreter::Bytecodes::IsSwitch(bytecode)) {
488 } else if (interpreter::Bytecodes::Returns(bytecode) ||
489 interpreter::Bytecodes::UnconditionallyThrows(bytecode)) {
492 // TODO(leszeks): Also consider handler entries (the bytecode analysis)
495 DCHECK_EQ(0, predecessors_[bytecode().length()]);
513 const compiler::BytecodeArrayRef& bytecode() const {
514 return compilation_unit_->bytecode();