in src/hotspot/share/interpreter/bytecodeUtils.cpp [536:1093]
int ExceptionMessageBuilder::do_instruction(int bci) {
ConstMethod* const_method = _method->constMethod();
address code_base = _method->constMethod()->code_base();
// We use the java code, since we don't want to cope with all the fast variants.
int len = Bytecodes::java_length_at(_method, code_base + bci);
// If we have no stack for this bci, we cannot process the bytecode now.
if (_stacks->at(bci) == nullptr) {
_all_processed = false;
return len;
}
// Make a local copy of the stack for this bci to work on.
SimulatedOperandStack* stack = new SimulatedOperandStack(*_stacks->at(bci));
// dest_bci is != -1 if we branch.
int dest_bci = -1;
// This is for table and lookup switch.
static const int initial_length = 2;
GrowableArray<int> dests(initial_length);
bool flow_ended = false;
// Get the bytecode.
bool is_wide = false;
Bytecodes::Code raw_code = Bytecodes::code_at(_method, code_base + bci);
Bytecodes::Code code = Bytecodes::java_code_at(_method, code_base + bci);
int pos = bci + 1;
if (code == Bytecodes::_wide) {
is_wide = true;
code = Bytecodes::java_code_at(_method, code_base + bci + 1);
pos += 1;
}
// Now simulate the action of each bytecode.
switch (code) {
case Bytecodes::_nop:
case Bytecodes::_aconst_null:
case Bytecodes::_iconst_m1:
case Bytecodes::_iconst_0:
case Bytecodes::_iconst_1:
case Bytecodes::_iconst_2:
case Bytecodes::_iconst_3:
case Bytecodes::_iconst_4:
case Bytecodes::_iconst_5:
case Bytecodes::_lconst_0:
case Bytecodes::_lconst_1:
case Bytecodes::_fconst_0:
case Bytecodes::_fconst_1:
case Bytecodes::_fconst_2:
case Bytecodes::_dconst_0:
case Bytecodes::_dconst_1:
case Bytecodes::_bipush:
case Bytecodes::_sipush:
case Bytecodes::_iload:
case Bytecodes::_lload:
case Bytecodes::_fload:
case Bytecodes::_dload:
case Bytecodes::_aload:
case Bytecodes::_iload_0:
case Bytecodes::_iload_1:
case Bytecodes::_iload_2:
case Bytecodes::_iload_3:
case Bytecodes::_lload_0:
case Bytecodes::_lload_1:
case Bytecodes::_lload_2:
case Bytecodes::_lload_3:
case Bytecodes::_fload_0:
case Bytecodes::_fload_1:
case Bytecodes::_fload_2:
case Bytecodes::_fload_3:
case Bytecodes::_dload_0:
case Bytecodes::_dload_1:
case Bytecodes::_dload_2:
case Bytecodes::_dload_3:
case Bytecodes::_aload_0:
case Bytecodes::_aload_1:
case Bytecodes::_aload_2:
case Bytecodes::_aload_3:
case Bytecodes::_iinc:
case Bytecodes::_new:
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_ldc:
case Bytecodes::_ldc_w:
case Bytecodes::_ldc2_w: {
int cp_index;
ConstantPool* cp = _method->constants();
if (code == Bytecodes::_ldc) {
cp_index = *(uint8_t*) (code_base + pos);
if (raw_code == Bytecodes::_fast_aldc) {
cp_index = cp->object_to_cp_index(cp_index);
}
} else {
if (raw_code == Bytecodes::_fast_aldc_w) {
cp_index = Bytes::get_native_u2(code_base + pos);
cp_index = cp->object_to_cp_index(cp_index);
}
else {
cp_index = Bytes::get_Java_u2(code_base + pos);
}
}
constantTag tag = cp->constant_tag_at(cp_index);
if (tag.is_klass() || tag.is_unresolved_klass() ||
tag.is_method() || tag.is_interface_method() ||
tag.is_field() || tag.is_string()) {
stack->push(bci, T_OBJECT);
} else if (tag.is_int()) {
stack->push(bci, T_INT);
} else if (tag.is_long()) {
stack->push(bci, T_LONG);
} else if (tag.is_float()) {
stack->push(bci, T_FLOAT);
} else if (tag.is_double()) {
stack->push(bci, T_DOUBLE);
} else {
assert(false, "Unexpected tag");
}
break;
}
case Bytecodes::_iaload:
case Bytecodes::_faload:
case Bytecodes::_aaload:
case Bytecodes::_baload:
case Bytecodes::_caload:
case Bytecodes::_saload:
case Bytecodes::_laload:
case Bytecodes::_daload:
stack->pop(2);
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_istore:
case Bytecodes::_lstore:
case Bytecodes::_fstore:
case Bytecodes::_dstore:
case Bytecodes::_astore:
int index;
if (is_wide) {
index = Bytes::get_Java_u2(code_base + bci + 2);
} else {
index = *(uint8_t*) (code_base + bci + 1);
}
stack->set_local_slot_written(index);
stack->pop(-Bytecodes::depth(code));
break;
case Bytecodes::_istore_0:
case Bytecodes::_lstore_0:
case Bytecodes::_fstore_0:
case Bytecodes::_dstore_0:
case Bytecodes::_astore_0:
stack->set_local_slot_written(0);
stack->pop(-Bytecodes::depth(code));
break;
case Bytecodes::_istore_1:
case Bytecodes::_fstore_1:
case Bytecodes::_lstore_1:
case Bytecodes::_dstore_1:
case Bytecodes::_astore_1:
stack->set_local_slot_written(1);
stack->pop(-Bytecodes::depth(code));
break;
case Bytecodes::_istore_2:
case Bytecodes::_lstore_2:
case Bytecodes::_fstore_2:
case Bytecodes::_dstore_2:
case Bytecodes::_astore_2:
stack->set_local_slot_written(2);
stack->pop(-Bytecodes::depth(code));
break;
case Bytecodes::_istore_3:
case Bytecodes::_lstore_3:
case Bytecodes::_fstore_3:
case Bytecodes::_dstore_3:
case Bytecodes::_astore_3:
stack->set_local_slot_written(3);
stack->pop(-Bytecodes::depth(code));
break;
case Bytecodes::_iastore:
case Bytecodes::_lastore:
case Bytecodes::_fastore:
case Bytecodes::_dastore:
case Bytecodes::_aastore:
case Bytecodes::_bastore:
case Bytecodes::_castore:
case Bytecodes::_sastore:
case Bytecodes::_pop:
case Bytecodes::_pop2:
case Bytecodes::_monitorenter:
case Bytecodes::_monitorexit:
case Bytecodes::_breakpoint:
stack->pop(-Bytecodes::depth(code));
break;
case Bytecodes::_dup:
stack->push_raw(stack->get_slot_data(0));
break;
case Bytecodes::_dup_x1: {
StackSlotAnalysisData top1 = stack->get_slot_data(0);
StackSlotAnalysisData top2 = stack->get_slot_data(1);
stack->pop(2);
stack->push_raw(top1);
stack->push_raw(top2);
stack->push_raw(top1);
break;
}
case Bytecodes::_dup_x2: {
StackSlotAnalysisData top1 = stack->get_slot_data(0);
StackSlotAnalysisData top2 = stack->get_slot_data(1);
StackSlotAnalysisData top3 = stack->get_slot_data(2);
stack->pop(3);
stack->push_raw(top1);
stack->push_raw(top3);
stack->push_raw(top2);
stack->push_raw(top1);
break;
}
case Bytecodes::_dup2:
stack->push_raw(stack->get_slot_data(1));
// The former '0' entry is now at '1'.
stack->push_raw(stack->get_slot_data(1));
break;
case Bytecodes::_dup2_x1: {
StackSlotAnalysisData top1 = stack->get_slot_data(0);
StackSlotAnalysisData top2 = stack->get_slot_data(1);
StackSlotAnalysisData top3 = stack->get_slot_data(2);
stack->pop(3);
stack->push_raw(top2);
stack->push_raw(top1);
stack->push_raw(top3);
stack->push_raw(top2);
stack->push_raw(top1);
break;
}
case Bytecodes::_dup2_x2: {
StackSlotAnalysisData top1 = stack->get_slot_data(0);
StackSlotAnalysisData top2 = stack->get_slot_data(1);
StackSlotAnalysisData top3 = stack->get_slot_data(2);
StackSlotAnalysisData top4 = stack->get_slot_data(3);
stack->pop(4);
stack->push_raw(top2);
stack->push_raw(top1);
stack->push_raw(top4);
stack->push_raw(top3);
stack->push_raw(top2);
stack->push_raw(top1);
break;
}
case Bytecodes::_swap: {
StackSlotAnalysisData top1 = stack->get_slot_data(0);
StackSlotAnalysisData top2 = stack->get_slot_data(1);
stack->pop(2);
stack->push(top1);
stack->push(top2);
break;
}
case Bytecodes::_iadd:
case Bytecodes::_ladd:
case Bytecodes::_fadd:
case Bytecodes::_dadd:
case Bytecodes::_isub:
case Bytecodes::_lsub:
case Bytecodes::_fsub:
case Bytecodes::_dsub:
case Bytecodes::_imul:
case Bytecodes::_lmul:
case Bytecodes::_fmul:
case Bytecodes::_dmul:
case Bytecodes::_idiv:
case Bytecodes::_ldiv:
case Bytecodes::_fdiv:
case Bytecodes::_ddiv:
case Bytecodes::_irem:
case Bytecodes::_lrem:
case Bytecodes::_frem:
case Bytecodes::_drem:
case Bytecodes::_iand:
case Bytecodes::_land:
case Bytecodes::_ior:
case Bytecodes::_lor:
case Bytecodes::_ixor:
case Bytecodes::_lxor:
stack->pop(2 * type2size[Bytecodes::result_type(code)]);
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_ineg:
case Bytecodes::_lneg:
case Bytecodes::_fneg:
case Bytecodes::_dneg:
stack->pop(type2size[Bytecodes::result_type(code)]);
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_ishl:
case Bytecodes::_lshl:
case Bytecodes::_ishr:
case Bytecodes::_lshr:
case Bytecodes::_iushr:
case Bytecodes::_lushr:
stack->pop(1 + type2size[Bytecodes::result_type(code)]);
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_i2l:
case Bytecodes::_i2f:
case Bytecodes::_i2d:
case Bytecodes::_f2i:
case Bytecodes::_f2l:
case Bytecodes::_f2d:
case Bytecodes::_i2b:
case Bytecodes::_i2c:
case Bytecodes::_i2s:
stack->pop(1);
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_l2i:
case Bytecodes::_l2f:
case Bytecodes::_l2d:
case Bytecodes::_d2i:
case Bytecodes::_d2l:
case Bytecodes::_d2f:
stack->pop(2);
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_lcmp:
case Bytecodes::_fcmpl:
case Bytecodes::_fcmpg:
case Bytecodes::_dcmpl:
case Bytecodes::_dcmpg:
stack->pop(1 - Bytecodes::depth(code));
stack->push(bci, T_INT);
break;
case Bytecodes::_ifeq:
case Bytecodes::_ifne:
case Bytecodes::_iflt:
case Bytecodes::_ifge:
case Bytecodes::_ifgt:
case Bytecodes::_ifle:
case Bytecodes::_if_icmpeq:
case Bytecodes::_if_icmpne:
case Bytecodes::_if_icmplt:
case Bytecodes::_if_icmpge:
case Bytecodes::_if_icmpgt:
case Bytecodes::_if_icmple:
case Bytecodes::_if_acmpeq:
case Bytecodes::_if_acmpne:
case Bytecodes::_ifnull:
case Bytecodes::_ifnonnull:
stack->pop(-Bytecodes::depth(code));
dest_bci = bci + (int16_t) Bytes::get_Java_u2(code_base + pos);
break;
case Bytecodes::_jsr:
// NOTE: Bytecodes has wrong depth for jsr.
stack->push(bci, T_ADDRESS);
dest_bci = bci + (int16_t) Bytes::get_Java_u2(code_base + pos);
flow_ended = true;
break;
case Bytecodes::_jsr_w: {
// NOTE: Bytecodes has wrong depth for jsr.
stack->push(bci, T_ADDRESS);
dest_bci = bci + (int32_t) Bytes::get_Java_u4(code_base + pos);
flow_ended = true;
break;
}
case Bytecodes::_ret:
// We don't track local variables, so we cannot know were we
// return. This makes the stacks imprecise, but we have to
// live with that.
flow_ended = true;
break;
case Bytecodes::_tableswitch: {
stack->pop(1);
pos = (pos + 3) & ~3;
dest_bci = bci + (int32_t) Bytes::get_Java_u4(code_base + pos);
int low = (int32_t) Bytes::get_Java_u4(code_base + pos + 4);
int high = (int32_t) Bytes::get_Java_u4(code_base + pos + 8);
for (int64_t i = low; i <= high; ++i) {
dests.push(bci + (int32_t) Bytes::get_Java_u4(code_base + pos + 12 + 4 * (i - low)));
}
break;
}
case Bytecodes::_lookupswitch: {
stack->pop(1);
pos = (pos + 3) & ~3;
dest_bci = bci + (int32_t) Bytes::get_Java_u4(code_base + pos);
int nr_of_dests = (int32_t) Bytes::get_Java_u4(code_base + pos + 4);
for (int i = 0; i < nr_of_dests; ++i) {
dests.push(bci + (int32_t) Bytes::get_Java_u4(code_base + pos + 12 + 8 * i));
}
break;
}
case Bytecodes::_ireturn:
case Bytecodes::_lreturn:
case Bytecodes::_freturn:
case Bytecodes::_dreturn:
case Bytecodes::_areturn:
case Bytecodes::_return:
case Bytecodes::_athrow:
stack->pop(-Bytecodes::depth(code));
flow_ended = true;
break;
case Bytecodes::_getstatic:
case Bytecodes::_getfield: {
// Find out the type of the field accessed.
int cp_index = Bytes::get_native_u2(code_base + pos);
ConstantPool* cp = _method->constants();
int name_and_type_index = cp->name_and_type_ref_index_at(cp_index, code);
int type_index = cp->signature_ref_index_at(name_and_type_index);
Symbol* signature = cp->symbol_at(type_index);
// Simulate the bytecode: pop the address, push the 'value' loaded
// from the field.
stack->pop(1 - Bytecodes::depth(code));
stack->push(bci, Signature::basic_type(signature));
break;
}
case Bytecodes::_putstatic:
case Bytecodes::_putfield: {
int cp_index = Bytes::get_native_u2(code_base + pos);
ConstantPool* cp = _method->constants();
int name_and_type_index = cp->name_and_type_ref_index_at(cp_index, code);
int type_index = cp->signature_ref_index_at(name_and_type_index);
Symbol* signature = cp->symbol_at(type_index);
BasicType bt = Signature::basic_type(signature);
stack->pop(type2size[bt] - Bytecodes::depth(code) - 1);
break;
}
case Bytecodes::_invokevirtual:
case Bytecodes::_invokespecial:
case Bytecodes::_invokestatic:
case Bytecodes::_invokeinterface:
case Bytecodes::_invokedynamic: {
ConstantPool* cp = _method->constants();
int cp_index;
if (code == Bytecodes::_invokedynamic) {
cp_index = ((int) Bytes::get_native_u4(code_base + pos));
} else {
cp_index = Bytes::get_native_u2(code_base + pos);
}
int name_and_type_index = cp->name_and_type_ref_index_at(cp_index, code);
int type_index = cp->signature_ref_index_at(name_and_type_index);
Symbol* signature = cp->symbol_at(type_index);
if ((code != Bytecodes::_invokestatic) && (code != Bytecodes::_invokedynamic)) {
// Pop receiver.
stack->pop(1);
}
stack->pop(ArgumentSizeComputer(signature).size());
ResultTypeFinder result_type(signature);
stack->push(bci, result_type.type());
break;
}
case Bytecodes::_newarray:
case Bytecodes::_anewarray:
case Bytecodes::_instanceof:
stack->pop(1);
stack->push(bci, Bytecodes::result_type(code));
break;
case Bytecodes::_arraylength:
stack->pop(1);
stack->push(bci, T_INT);
break;
case Bytecodes::_checkcast:
break;
case Bytecodes::_multianewarray:
stack->pop(*(uint8_t*) (code_base + pos + 2));
stack->push(bci, T_OBJECT);
break;
case Bytecodes::_goto:
stack->pop(-Bytecodes::depth(code));
dest_bci = bci + (int16_t) Bytes::get_Java_u2(code_base + pos);
flow_ended = true;
break;
case Bytecodes::_goto_w:
stack->pop(-Bytecodes::depth(code));
dest_bci = bci + (int32_t) Bytes::get_Java_u4(code_base + pos);
flow_ended = true;
break;
default:
// Allow at least the bcis which have stack info to work.
_all_processed = false;
_added_one = false;
delete stack;
return len;
}
// Put new stack to the next instruction, if we might reach it from
// this bci.
if (!flow_ended) {
if (_stacks->at(bci + len) == nullptr) {
_added_one = true;
}
merge(bci + len, stack);
}
// Put the stack to the branch target too.
if (dest_bci != -1) {
if (_stacks->at(dest_bci) == nullptr) {
_added_one = true;
}
merge(dest_bci, stack);
}
// If we have more than one branch target, process these too.
for (int i = 0; i < dests.length(); ++i) {
if (_stacks->at(dests.at(i)) == nullptr) {
_added_one = true;
}
merge(dests.at(i), stack);
}
delete stack;
return len;
}