asm/tree/InsnList.java

149      * @param insn
153     public boolean contains(final AbstractInsnNode insn) {
155         while (i != null && i != insn) {
168      * @param insn
175     public int indexOf(final AbstractInsnNode insn) {
179         return insn.index;
189         AbstractInsnNode insn = first;
190         while (insn != null) {
191             insn.accept(mv);
192             insn = insn.next;
240      * @param insn
244     public void set(final AbstractInsnNode location, final AbstractInsnNode insn) {
246         insn.next = next;
248             next.prev = insn;
250             last = insn;
253         insn.prev = prev;
255             prev.next = insn;
257             first = insn;
261             cache[index] = insn;
262             insn.index = index;
264             insn.index = 0; // insn now belongs to an InsnList
274      * @param insn
278     public void add(final AbstractInsnNode insn) {
281             first = insn;
282             last = insn;
284             last.next = insn;
285             insn.prev = last;
287         last = insn;
289         insn.index = 0; // insn now belongs to an InsnList
320      * @param insn
324     public void insert(final AbstractInsnNode insn) {
327             first = insn;
328             last = insn;
330             first.prev = insn;
331             insn.next = first;
333         first = insn;
335         insn.index = 0; // insn now belongs to an InsnList
367      *            an instruction <i>of this list</i> after which insn must be
369      * @param insn
374             final AbstractInsnNode insn) {
378             last = insn;
380             next.prev = insn;
382         location.next = insn;
383         insn.next = next;
384         insn.prev = location;
386         insn.index = 0; // insn now belongs to an InsnList
423      *            an instruction <i>of this list</i> before which insn must be
425      * @param insn
430             final AbstractInsnNode insn) {
434             first = insn;
436             prev.next = insn;
438         location.prev = insn;
439         insn.next = location;
440         insn.prev = prev;
442         insn.index = 0; // insn now belongs to an InsnList
479      * @param insn
482     public void remove(final AbstractInsnNode insn) {
484         AbstractInsnNode next = insn.next;
485         AbstractInsnNode prev = insn.prev;
504         insn.index = -1; // insn no longer belongs to an InsnList
505         insn.prev = null;
506         insn.next = null;
518             AbstractInsnNode insn = first;
519             while (insn != null) {
520                 AbstractInsnNode next = insn.next;
521                 insn.index = -1; // insn no longer belongs to an InsnList
522                 insn.prev = null;
523                 insn.next = null;
524                 insn = next;
546         AbstractInsnNode insn = first;
547         while (insn != null) {
548             if (insn instanceof LabelNode) {
549                 ((LabelNode) insn).resetLabel();
551             insn = insn.next;