public void visitLookupSwitchInsn(Label dflt, int keys[], Label labels[]) { mv1.visitLookupSwitchInsn(dflt, keys, labels); mv2.visitLookupSwitchInsn(dflt, keys, labels); }
public void visitLookupSwitchInsn(Label dflt, int keys[], Label labels[]) { mv1.visitLookupSwitchInsn(dflt, keys, labels); mv2.visitLookupSwitchInsn(dflt, keys, labels); }
/** * Visits a LOOKUPSWITCH instruction. * * @param dflt beginning of the default handler block. * @param keys the values of the keys. * @param labels beginnings of the handler blocks. {@code labels[i]} is the beginning of the * handler block for the {@code keys[i]} key. */ public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { if (mv != null) { mv.visitLookupSwitchInsn(dflt, keys, labels); } }
@Override public void caseLookupSwitchInst(LookupSwitchInst i) { List<IntConstant> values = i.getLookupValues(); List<Unit> targets = i.getTargets(); int[] keys = new int[values.size()]; Label[] labels = new Label[values.size()]; for (int j = 0; j < values.size(); j++) { keys[j] = values.get(j).value; labels[j] = branchTargetLabels.get(targets.get(j)); } mv.visitLookupSwitchInsn(branchTargetLabels.get(i.getDefaultTarget()), keys, labels); }
targets[i] = (Label) lss.targets[i].tag; asm.visitLookupSwitchInsn((Label) lss.defaultTarget.tag, lss.lookupValues, targets);
@Override public void visitLookupSwitchInsn(Label dflt, int[] keys, Label[] labels) { super.visitLookupSwitchInsn(dflt, keys, labels); skipNextFrame = false; }
keys[i] = keyList.get(i); mv.visitLookupSwitchInsn(defLabel, keys, labels); break;
labels[i] = make_label(); mv.visitLookupSwitchInsn(def, keys, labels); for (int i = 0; i < len; i++) { mark(labels[i]);
labels[i] = make_label(); mv.visitLookupSwitchInsn(def, keys, labels); for (int i = 0; i < len; i++) { mark(labels[i]);
currentOffset += 8; methodVisitor.visitLookupSwitchInsn(defaultLabel, keys, values); break;
@Test public void shouldForwardVisitLookupSwitchInsnToChild() { final Label l = new Label(); final Label[] l2 = { new Label() }; final int[] i = { 1, 2, 3 }; getTesteeVisitor().visitLookupSwitchInsn(l, i, l2); verify(this.mv).visitLookupSwitchInsn(l, i, l2); }
@Override public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { minSize += 9 + keys.length * 8; maxSize += 12 + keys.length * 8; super.visitLookupSwitchInsn(dflt, keys, labels); }
@Override public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { minSize += 9 + keys.length * 8; maxSize += 12 + keys.length * 8; if (mv != null) { mv.visitLookupSwitchInsn(dflt, keys, labels); } }
@Override public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { instruction = true; mv.visitLookupSwitchInsn(dflt, keys, labels); }
@Override public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { super.visitLookupSwitchInsn(dflt, keys, labels); execute(Opcodes.LOOKUPSWITCH, 0, null); this.locals = null; this.stack = null; }
@Override public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { super.visitLookupSwitchInsn(dflt, keys, labels); execute(Opcodes.LOOKUPSWITCH, 0, null); this.locals = null; this.stack = null; }
@Override public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { p.visitLookupSwitchInsn(dflt, keys, labels); super.visitLookupSwitchInsn(dflt, keys, labels); }
@Override public void visitLookupSwitchInsn(Label label, int[] ints, Label[] labels) { Log.logEach("visitLookupSwitchInsn", label, ints, labels); super.visitLookupSwitchInsn(label, ints, labels); }
@Override public void visitLookupSwitchInsn(final Label dflt, final int[] keys, final Label[] labels) { mv.visitLookupSwitchInsn(dflt, keys, labels); if (constructor) { popValue(); addBranches(dflt, labels); } }
@Override public void visitLookupSwitchInsn(Label arg0, int[] arg1, Label[] arg2) { super.visitLookupSwitchInsn(arg0, arg1, arg2); LabelNode nodes[] = new LabelNode[arg2.length]; for (int i = 0; i < arg2.length; i++) { nodes[i] = new LabelNode(arg2[i]); } appendToBacklog(new LookupSwitchInsnNode(new LabelNode(arg0), arg1, nodes)); }