Package jadx.core.dex.nodes

Examples of jadx.core.dex.nodes.InsnNode

158
159
160
161
162
163
164
165
166
167
168
169
170
171
        continue;
      }
      for (PhiInsn phi : phiList.getList()) {
        for (int i = 0; i < phi.getArgsCount(); i++) {
          RegisterArg arg = phi.getArg(i);
          InsnNode parentInsn = arg.getAssignInsn();
          if (parentInsn != null
              && parentInsn.getResult() != null
              && parentInsn.contains(AFlag.TRY_LEAVE)) {
            phi.removeArg(arg);
          }
        }
      }
    }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
185
  private static boolean removeUselessPhi(MethodNode mth) {
    List<PhiInsn> insnToRemove = new ArrayList<PhiInsn>();
    for (SSAVar var : mth.getSVars()) {
      // phi result not used
      if (var.getUseCount() == 0) {
        InsnNode assignInsn = var.getAssign().getParentInsn();
        if (assignInsn != null && assignInsn.getType() == InsnType.PHI) {
          insnToRemove.add((PhiInsn) assignInsn);
        }
      }
    }
    for (BlockNode block : mth.getBasicBlocks()) {
View Full Code Here
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
      }
      if (!mth.getReturnType().equals(ArgType.VOID)
          && mth.getExitBlocks().size() > 1) {
        // fix debug for splitter 'return' instructions
        for (BlockNode exit : mth.getExitBlocks()) {
          InsnNode ret = exit.getInstructions().get(0);
          InsnNode oldRet = insnArr[ret.getOffset()];
          if (oldRet != ret) {
            RegisterArg oldArg = (RegisterArg) oldRet.getArg(0);
            RegisterArg newArg = (RegisterArg) ret.getArg(0);
            newArg.mergeDebugInfo(oldArg.getType(), oldArg.getName());
            ret.setSourceLine(oldRet.getSourceLine());
          }
        }
      }
    }
    mth.unloadInsnArr();
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
  }

  private static void removeInsn(MethodNode mth, BlockNode block, PhiInsn phiInsn) {
    Iterator<InsnNode> it = block.getInstructions().iterator();
    while (it.hasNext()) {
      InsnNode insn = it.next();
      if (insn == phiInsn) {
        it.remove();
        return;
      }
    }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
    BlockProcessingHelper.visit(mth);
    mth.finishBasicBlocks();
  }

  private static void splitBasicBlocks(MethodNode mth) {
    InsnNode prevInsn = null;
    Map<Integer, BlockNode> blocksMap = new HashMap<Integer, BlockNode>();
    BlockNode curBlock = startNewBlock(mth, 0);
    mth.setEnterBlock(curBlock);

    // split into blocks
    for (InsnNode insn : mth.getInstructions()) {
      if (insn == null) {
        continue;
      }
      boolean startNew = false;
      if (prevInsn != null) {
        InsnType type = prevInsn.getType();
        if (type == InsnType.GOTO
            || type == InsnType.THROW
            || SEPARATE_INSNS.contains(type)) {

          if (type == InsnType.RETURN || type == InsnType.THROW) {
View Full Code Here
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
    }
    BlockNode exitBlock = mth.getExitBlocks().get(0);
    if (exitBlock.getPredecessors().size() > 1
        && exitBlock.getInstructions().size() == 1
        && !exitBlock.contains(AFlag.SYNTHETIC)) {
      InsnNode returnInsn = exitBlock.getInstructions().get(0);
      List<BlockNode> preds = new ArrayList<BlockNode>(exitBlock.getPredecessors());
      if (returnInsn.getArgsCount() != 0 && !isReturnArgAssignInPred(preds, returnInsn)) {
        return false;
      }
      boolean first = true;
      for (BlockNode pred : preds) {
        BlockNode newRetBlock = startNewBlock(mth, exitBlock.getStartOffset());
        newRetBlock.add(AFlag.SYNTHETIC);
        InsnNode newRetInsn;
        if (first) {
          newRetInsn = returnInsn;
          first = false;
        } else {
          newRetInsn = duplicateReturnInsn(returnInsn);
View Full Code Here
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
      }
    }
  }

  private static InsnNode duplicateReturnInsn(InsnNode returnInsn) {
    InsnNode insn = new InsnNode(returnInsn.getType(), returnInsn.getArgsCount());
    if (returnInsn.getArgsCount() == 1) {
      RegisterArg arg = (RegisterArg) returnInsn.getArg(0);
      insn.addArg(InsnArg.reg(arg.getRegNum(), arg.getType()));
    }
    insn.copyAttributesFrom(returnInsn);
    insn.setOffset(returnInsn.getOffset());
    insn.setSourceLine(returnInsn.getSourceLine());
    return insn;
  }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
  private static void removeSynchronized(MethodNode mth) {
    Region startRegion = mth.getRegion();
    List<IContainer> subBlocks = startRegion.getSubBlocks();
    if (!subBlocks.isEmpty() && subBlocks.get(0) instanceof SynchronizedRegion) {
      SynchronizedRegion synchRegion = (SynchronizedRegion) subBlocks.get(0);
      InsnNode synchInsn = synchRegion.getEnterInsn();
      if (!synchInsn.getArg(0).isThis()) {
        LOG.warn("In synchronized method {}, top region not synchronized by 'this' {}", mth, synchInsn);
        return;
      }
      // replace synchronized block with inner region
      startRegion.getSubBlocks().set(0, synchRegion.getRegion());
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
    BlockNode staticBlock = staticMethod.getBasicBlocks().get(0);
    List<InsnNode> insns = new ArrayList<InsnNode>();
    List<InsnNode> list = staticBlock.getInstructions();
    int size = list.size();
    for (int i = 0; i < size; i++) {
      InsnNode insn = list.get(i);
      insns.add(insn);
      if (insn.getType() == InsnType.SPUT) {
        IndexInsnNode fp = (IndexInsnNode) insn;
        FieldInfo f = (FieldInfo) fp.getIndex();
        if (f.getName().equals("$VALUES")) {
          if (i == size - 1) {
            cls.getMethods().remove(staticMethod);
          } else {
            list.subList(0, i + 1).clear();
          }
          break;
        }
      }
    }

    for (InsnNode insn : insns) {
      if (insn.getType() == InsnType.CONSTRUCTOR) {
        ConstructorInsn co = (ConstructorInsn) insn;
        if (insn.getArgsCount() < 2) {
          continue;
        }
        ClassInfo clsInfo = co.getClassType();
        ClassNode constrCls = cls.dex().resolveClass(clsInfo);
        if (constrCls == null) {
          continue;
        }
        if (!clsInfo.equals(cls.getClassInfo()) && !constrCls.getAccessFlags().isEnum()) {
          continue;
        }
        RegisterArg nameArg = (RegisterArg) insn.getArg(0);
        // InsnArg pos = insn.getArg(1);
        // TODO add check: pos == j
        String name = (String) nameArg.getConstValue(cls.dex());
        if (name == null) {
          throw new JadxException("Unknown enum field name: " + cls);
        }
        EnumField field = new EnumField(name, insn.getArgsCount() - 2);
        attr.getFields().add(field);
        for (int i = 2; i < insn.getArgsCount(); i++) {
          InsnArg constrArg;
          InsnArg iArg = insn.getArg(i);
          if (iArg.isLiteral()) {
            constrArg = iArg;
          } else {
            constrArg = CodeShrinker.inlineArgument(staticMethod, (RegisterArg) iArg);
            if (constrArg == null) {
View Full Code Here
308
309
310
311
312
313
314
315
316
317
318
        if (useList.size() != 1) {
          pass = false;
          break;
        }
        InsnArg arg = useList.get(0);
        InsnNode usePlace = arg.getParentInsn();
        if (!BlockUtils.blockContains(block, usePlace)
            && !BlockUtils.blockContains(next, usePlace)) {
          pass = false;
          break;
        }
View Full Code Here
TOP

Related Classes of jadx.core.dex.nodes.InsnNode

  • jadx.core.codegen.ConditionGen
  • jadx.core.codegen.InsnGen
  • jadx.core.codegen.NameGen
  • jadx.core.codegen.RegionGen
  • jadx.core.dex.instructions.args.InsnArg
  • jadx.core.dex.instructions.args.RegisterArg
  • jadx.core.dex.instructions.InsnDecoder
  • jadx.core.dex.nodes.parser.DebugInfoParser
  • jadx.core.dex.regions.conditions.IfCondition
  • jadx.core.dex.regions.loops.LoopRegion
    • 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.