Lines Matching defs:inputs

380       // get a copy of the base memory, and patch some inputs into it
854 int inputs = 0, depth = 0;
857 if (compute_stack_effects(inputs, depth)) {
859 stack_slots_not_pruned = inputs;
987 bool GraphKit::compute_stack_effects(int& inputs, int& depth) {
1010 inputs = 0;
1013 case Bytecodes::_dup: inputs = 1; break;
1014 case Bytecodes::_dup_x1: inputs = 2; break;
1015 case Bytecodes::_dup_x2: inputs = 3; break;
1016 case Bytecodes::_dup2: inputs = 2; break;
1017 case Bytecodes::_dup2_x1: inputs = 3; break;
1018 case Bytecodes::_dup2_x2: inputs = 4; break;
1019 case Bytecodes::_swap: inputs = 2; break;
1020 case Bytecodes::_arraylength: inputs = 1; break;
1031 inputs = (is_static ? 0 : 1);
1033 depth = size - inputs;
1035 inputs += size; // putxxx pops the value from the stack
1036 depth = - inputs;
1051 inputs = declared_signature->arg_size_for_bc(code);
1053 depth = size - inputs;
1062 inputs = iter.get_dimensions();
1064 depth = rsize - inputs;
1074 inputs = rsize;
1079 inputs = 0;
1085 inputs = rsize - depth;
1086 assert(inputs >= 0, "");
1092 int outputs = depth + inputs;
1095 case Bytecodes::_checkcast: assert(inputs == 1 && outputs == 1, ""); break;
1096 case Bytecodes::_athrow: assert(inputs == 1 && outputs == 0, ""); break;
1097 case Bytecodes::_aload_0: assert(inputs == 0 && outputs == 1, ""); break;
1098 case Bytecodes::_return: assert(inputs == 0 && outputs == 0, ""); break;
1099 case Bytecodes::_drem: assert(inputs == 4 && outputs == 2, ""); break;
1650 // Add the predefined inputs:
1893 int inputs, ignored_depth;
1894 if (compute_stack_effects(inputs, ignored_depth)) {
1895 assert(sp() >= inputs, err_msg_res("must have enough JVMS stack to execute %s: sp=%d, inputs=%d",
1896 Bytecodes::name(java_bc()), sp(), inputs));