551 return;
552 case 'F':
553 push(Opcodes.FLOAT);
554 return;
555 case 'J':
556 push(Opcodes.LONG);
557 push(Opcodes.TOP);
558 return;
559 case 'D':
560 push(Opcodes.DOUBLE);
561 push(Opcodes.TOP);
562 return;
563 case '[':
564 if (index == 0) {
565 push(desc);
566 } else {
567 push(desc.substring(index, desc.length()));
568 }
569 break;
570 // case 'L':
571 default:
572 if (index == 0) {
573 push(desc.substring(1, desc.length() - 1));
574 } else {
575 push(desc.substring(index + 1, desc.length() - 1));
576 }
577 }
578 }
579
580 private Object pop() {
581 return stack.remove(stack.size() - 1);
582 }
583
584 private void pop(final int n) {
585 int size = stack.size();
586 int end = size - n;
587 for (int i = size - 1; i >= end; --i) {
588 stack.remove(i);
589 }
590 }
|
551 return;
552 case 'F':
553 push(Opcodes.FLOAT);
554 return;
555 case 'J':
556 push(Opcodes.LONG);
557 push(Opcodes.TOP);
558 return;
559 case 'D':
560 push(Opcodes.DOUBLE);
561 push(Opcodes.TOP);
562 return;
563 case '[':
564 if (index == 0) {
565 push(desc);
566 } else {
567 push(desc.substring(index, desc.length()));
568 }
569 break;
570 // case 'L':
571 // case 'Q':
572 default:
573 if (index == 0) {
574 push(desc.substring(1, desc.length() - 1));
575 } else {
576 push(desc.substring(index + 1, desc.length() - 1));
577 }
578 }
579 }
580
581 private Object pop() {
582 return stack.remove(stack.size() - 1);
583 }
584
585 private void pop(final int n) {
586 int size = stack.size();
587 int end = size - n;
588 for (int i = size - 1; i >= end; --i) {
589 stack.remove(i);
590 }
591 }
|