Package org.objectweb.asm.tree

Examples of org.objectweb.asm.tree.InsnNode

458
459
460
461
462
463
464
465
466
467
468
469
    VarInsnNode ni = (VarInsnNode) n;
    return oi.var == ni.var;
  }

  private static boolean sameInsnNode(AbstractInsnNode o, AbstractInsnNode n) {
    InsnNode oi = (InsnNode) o;
    if (!(n instanceof InsnNode)) {
      return false;
    }
    InsnNode ni = (InsnNode) n;
    return oi.getOpcode() == ni.getOpcode();
  }
View Full Code Here
493
494
495
496
497
498
499
500
501
502
503
                // Rather than JSRing, we will jump to the inline version and
                // push NULL for what was once the return value. This hack
                // allows us to avoid doing any sort of data flow analysis to
                // figure out which instructions manipulate the old return value
                // pointer which is now known to be unneeded.
                newInstructions.add(new InsnNode(ACONST_NULL));
                newInstructions.add(new JumpInsnNode(GOTO, startlbl));
                newInstructions.add(newinst.returnLabel);

                // Insert this new instantiation into the queue to be emitted
                // later.
View Full Code Here
207
208
209
210
211
212
213
214
215
216
217
            if (left != null) {
                if (DEBUG_FRAGMENT) System.out.printf("Breaking switch at %d\n", cutoff);

                LabelNode high = new LabelNode();
                instructions.insertBefore(ptr, new InsnNode(Opcodes.DUP));
                instructions.insertBefore(ptr, intNode(cutoff));
                instructions.insertBefore(ptr, new JumpInsnNode(Opcodes.IF_ICMPGE, high));
                instructions.insertBefore(ptr, left);
                instructions.insertBefore(ptr, high);
                instructions.insertBefore(ptr, right);
View Full Code Here
223
224
225
226
227
228
229
230
231
232
            }
        }
    }

    private AbstractInsnNode intNode(int value) {
        return (value >= -1   && value <= 5) ? new InsnNode(Opcodes.ICONST_0 + value) :
               (value >= -128 && value <= 127) ? new IntInsnNode(Opcodes.BIPUSH, value) :
               (value >= -32768 && value <= 32767) ? new IntInsnNode(Opcodes.SIPUSH, value) :
               new LdcInsnNode(value);
    }
View Full Code Here
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
                retinst = Opcodes.ARETURN; rty = rtyty.getInternalName(); break;
        }

        if (rty != null) {
            instructions.add(new VarInsnNode(Opcodes.ALOAD, 0));
            instructions.add(new InsnNode(Opcodes.ICONST_0));
            instructions.add(new InsnNode(Opcodes.AALOAD));
            instructions.add(new TypeInsnNode(Opcodes.CHECKCAST, rty));
            if (unboxName != null)
                instructions.add(new MethodInsnNode(Opcodes.INVOKEVIRTUAL, rty, unboxName, unboxDesc));
        }
        instructions.add(new InsnNode(retinst));
    }
View Full Code Here
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
        }
        instructions.add(new InsnNode(retinst));
    }

    private int saveArg(InsnList il, int ltmp, Type at) {
        il.add(new InsnNode(Opcodes.DUP));
        il.add(intNode(ltmp));
        int opc;
        String ty = null, desc = null;
        switch (at.getSort()) {
            case Type.BOOLEAN:
            case Type.CHAR:
            case Type.INT:
            case Type.SHORT:
            case Type.BYTE:
                opc = Opcodes.ILOAD; ty = "java/lang/Integer"; desc = "(I)V"; break;
            case Type.LONG:
                opc = Opcodes.LLOAD; ty = "java/lang/Long"; desc = "(J)V"; break;
            case Type.FLOAT:
                opc = Opcodes.FLOAD; ty = "java/lang/Float"; desc = "(F)V"; break;
            case Type.DOUBLE:
                opc = Opcodes.DLOAD; ty = "java/lang/Double"; desc = "(D)V"; break;
            default:
                opc = Opcodes.ALOAD; break;
        }

        if (ty != null) {
            il.add(new TypeInsnNode(Opcodes.NEW, ty));
            il.add(new InsnNode(Opcodes.DUP));
        }
        il.add(new VarInsnNode(opc, ltmp));
        if (ty != null) il.add(new MethodInsnNode(Opcodes.INVOKESPECIAL, ty, "<init>", desc));
        il.add(new InsnNode(Opcodes.AASTORE));
        return at.getSize();
    }
View Full Code Here
482
483
484
485
486
487
488
489
490
491
492
                // Rather than JSRing, we will jump to the inline version and
                // push NULL for what was once the return value. This hack
                // allows us to avoid doing any sort of data flow analysis to
                // figure out which instructions manipulate the old return value
                // pointer which is now known to be unneeded.
                newInstructions.add(new InsnNode(ACONST_NULL));
                newInstructions.add(new JumpInsnNode(GOTO, startlbl));
                newInstructions.add(newinst.returnLabel);

                // Insert this new instantiation into the queue to be emitted
                // later.
View Full Code Here
259
260
261
262
263
264
265
266
267
268
269
        methodVisitor.visitCode();

        // visit instructions
        body.accept(methodVisitor);
        if (addReturn) {
            new InsnNode(RETURN).accept(methodVisitor);
        }

        // visit local variable declarations
        for (LocalVariableNode localVariableNode : localVariableNodes) {
            localVariableNode.accept(methodVisitor);
View Full Code Here
579
580
581
582
583
584
585
586
587
588
589
           
            VarInsnNode varInsn = (VarInsnNode)insn;
           
            Value topValue = getStack(getStackSize() - 1);
            if (!liveOut.get(varInsn.var) && topValue != IsNullInterpreter.NULL) {
                InsnNode pop = new InsnNode(Opcodes.POP);
                instructions.insert(insn, pop);
                instructions.remove(insn);
                def.clear();
            }
        }
View Full Code Here
608
609
610
611
612
613
614
615
616
617
618
            if (toNull.cardinality() > 0) {
                // Construct the nulling instructions.
                InsnList nullingInsns = new InsnList();
                for (int i = 0; i < toNull.length(); i++) {
                    if (toNull.get(i)) {
                        AbstractInsnNode pushNull = new InsnNode(Opcodes.ACONST_NULL);
                        AbstractInsnNode store = new VarInsnNode(Opcodes.ASTORE, i);
                        nullingInsns.add(pushNull);
                        nullingInsns.add(store);
                    }
                }
View Full Code Here
TOP

Related Classes of org.objectweb.asm.tree.InsnNode

  • appeng.transformer.asm.ASMTweaker
  • br.usp.each.saeg.bytecode.analysis.graph.defuse.DefUseFrameComputer
  • br.usp.each.saeg.bytecode.analysis.GraphBuilder
  • ch6.sec1.AddTimerTransformer
  • ch6.sec1.BeanGenerator
  • ch7.sec2.CyclomaticComplexityTest
  • cofh.asm.ASMCore
  • com.artemis.weaver.packed.FieldToStructMethodTransformer
  • com.dragome.callbackevictor.serverside.bytecode.transformation.asm.ContinuationMethodAnalyzer
  • com.facebook.presto.byteCode.MethodDefinition
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.