Examples of InsnNode

Examples of br.com.caelum.vraptor.asm.tree.InsnNode

446
447
448
449
450
451
452
453
454
455
456
                // 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

Examples of com.alibaba.citrus.asm.tree.InsnNode

447
448
449
450
451
452
453
454
455
456
457
                // 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

Examples of com.googlecode.aviator.asm.tree.InsnNode

451
452
453
454
455
456
457
458
459
460
461
                // 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

Examples of jadx.core.dex.nodes.InsnNode

38
39
40
41
42
43
44
45
46
47
48
      return;
    }
    for (BlockNode block : mth.getBasicBlocks()) {
      List<InsnNode> list = block.getInstructions();
      for (int i = 0; i < list.size(); i++) {
        InsnNode modInsn = simplifyInsn(mth, list.get(i));
        if (modInsn != null) {
          list.set(i, modInsn);
        }
      }
    }
View Full Code Here

Examples of jadx.core.dex.nodes.InsnNode

49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
  }

  private static InsnNode simplifyInsn(MethodNode mth, InsnNode insn) {
    for (InsnArg arg : insn.getArguments()) {
      if (arg.isInsnWrap()) {
        InsnNode ni = simplifyInsn(mth, ((InsnWrapArg) arg).getWrapInsn());
        if (ni != null) {
          arg.wrapInstruction(ni);
        }
      }
    }
    switch (insn.getType()) {
      case ARITH:
        return simplifyArith(insn);

      case IF:
        simplifyIf((IfNode) insn);
        break;
      case TERNARY:
        simplifyTernary((TernaryInsn) insn);
        break;

      case INVOKE:
        return convertInvoke(mth, insn);

      case IPUT:
      case SPUT:
        return convertFieldArith(mth, insn);

      case CHECK_CAST:
        InsnArg castArg = insn.getArg(0);
        ArgType castType = (ArgType) ((IndexInsnNode) insn).getIndex();
        if (!ArgType.isCastNeeded(castArg.getType(), castType)) {
          InsnNode insnNode = new InsnNode(InsnType.MOVE, 1);
          insnNode.setResult(insn.getResult());
          insnNode.addArg(castArg);
          return insnNode;
        }
        break;

      default:
View Full Code Here

Examples of jadx.core.dex.nodes.InsnNode

96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
   * Simplify 'cmp' instruction in if condition
   */
  private static void simplifyIf(IfNode insn) {
    InsnArg f = insn.getArg(0);
    if (f.isInsnWrap()) {
      InsnNode wi = ((InsnWrapArg) f).getWrapInsn();
      if (wi.getType() == InsnType.CMP_L || wi.getType() == InsnType.CMP_G) {
        if (insn.getArg(1).isLiteral()
            && ((LiteralArg) insn.getArg(1)).getLiteral() == 0) {
          insn.changeCondition(insn.getOp(), wi.getArg(0), wi.getArg(1));
        } else {
          LOG.warn("TODO: cmp {}", insn);
        }
      }
    }
View Full Code Here

Examples of jadx.core.dex.nodes.InsnNode

132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
        if (chain.size() > 1 && chain.get(0).getType() == InsnType.CONSTRUCTOR) {
          ConstructorInsn constr = (ConstructorInsn) chain.get(0);
          if (constr.getClassType().getFullName().equals(Consts.CLASS_STRING_BUILDER)
              && constr.getArgsCount() == 0) {
            int len = chain.size();
            InsnNode concatInsn = new InsnNode(InsnType.STR_CONCAT, len - 1);
            for (int i = 1; i < len; i++) {
              concatInsn.addArg(chain.get(i).getArg(1));
            }
            concatInsn.setResult(insn.getResult());
            return concatInsn;
          }
        }
      } catch (Throwable e) {
        LOG.debug("Can't convert string concatenation: {} insn: {}", mth, insn, e);
View Full Code Here

Examples of jadx.core.dex.nodes.InsnNode

155
156
157
158
159
160
161
162
163
164
165
166
167
      return null;
    }
    InsnArg litArg = null;
    InsnArg secondArg = arith.getArg(1);
    if (secondArg.isInsnWrap()) {
      InsnNode wr = ((InsnWrapArg) secondArg).getWrapInsn();
      if (wr.getType() == InsnType.CONST) {
        litArg = wr.getArg(0);
      }
    } else if (secondArg.isLiteral()) {
      litArg = secondArg;
    }
    if (litArg != null) {
View Full Code Here

Examples of jadx.core.dex.nodes.InsnNode

183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
  private static InsnNode convertFieldArith(MethodNode mth, InsnNode insn) {
    InsnArg arg = insn.getArg(0);
    if (!arg.isInsnWrap()) {
      return null;
    }
    InsnNode wrap = ((InsnWrapArg) arg).getWrapInsn();
    InsnType wrapType = wrap.getType();
    if ((wrapType != InsnType.ARITH && wrapType != InsnType.STR_CONCAT)
        || !wrap.getArg(0).isInsnWrap()) {
      return null;
    }
    InsnNode get = ((InsnWrapArg) wrap.getArg(0)).getWrapInsn();
    InsnType getType = get.getType();
    if (getType != InsnType.IGET && getType != InsnType.SGET) {
      return null;
    }
    FieldInfo field = (FieldInfo) ((IndexInsnNode) insn).getIndex();
    FieldInfo innerField = (FieldInfo) ((IndexInsnNode) get).getIndex();
    if (!field.equals(innerField)) {
      return null;
    }
    try {
      InsnArg reg = null;
      if (getType == InsnType.IGET) {
        reg = get.getArg(0);
      }
      FieldArg fArg = new FieldArg(field, reg);
      if (reg != null) {
        fArg.setType(get.getArg(0).getType());
      }
      if (wrapType == InsnType.ARITH) {
        ArithNode ar = (ArithNode) wrap;
        return new ArithNode(ar.getOp(), fArg, ar.getArg(1));
      } else {
        int argsCount = wrap.getArgsCount();
        InsnNode concat = new InsnNode(InsnType.STR_CONCAT, argsCount - 1);
        for (int i = 1; i < argsCount; i++) {
          concat.addArg(wrap.getArg(i));
        }
        return new ArithNode(ArithOp.ADD, fArg, InsnArg.wrapArg(concat));
      }
    } catch (Throwable e) {
      LOG.debug("Can't convert field arith insn: {}, mth: {}", insn, mth, e);
View Full Code Here

Examples of jadx.core.dex.nodes.InsnNode

229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
  private static List<InsnNode> flattenInsnChain(InsnNode insn) {
    List<InsnNode> chain = new ArrayList<InsnNode>();
    InsnArg i = insn.getArg(0);
    while (i.isInsnWrap()) {
      InsnNode wrapInsn = ((InsnWrapArg) i).getWrapInsn();
      chain.add(wrapInsn);
      if (wrapInsn.getArgsCount() == 0) {
        break;
      }

      i = wrapInsn.getArg(0);
    }
    Collections.reverse(chain);
    return chain;
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.