Package jadx.core.dex.nodes

Examples of jadx.core.dex.nodes.BlockNode

127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
  private static boolean sameElements(Collection<BlockNode> c1, Collection<BlockNode> c2) {
    return c1.size() == c2.size() && c1.containsAll(c2);
  }

  static IfInfo mergeNestedIfNodes(IfInfo currentIf) {
    BlockNode curThen = currentIf.getThenBlock();
    BlockNode curElse = currentIf.getElseBlock();
    if (curThen == curElse) {
      return null;
    }
    boolean followThenBranch;
    IfInfo nextIf = getNextIf(currentIf, curThen);
    if (nextIf != null) {
      followThenBranch = true;
    } else {
      nextIf = getNextIf(currentIf, curElse);
      if (nextIf != null) {
        followThenBranch = false;
      } else {
        return null;
      }
    }
    if (isInversionNeeded(currentIf, nextIf)) {
      // invert current node for match pattern
      nextIf = IfInfo.invert(nextIf);
    }
    if (!RegionMaker.isEqualPaths(curElse, nextIf.getElseBlock())
        && !RegionMaker.isEqualPaths(curThen, nextIf.getThenBlock())) {
      // complex condition, run additional checks
      if (checkConditionBranches(curThen, curElse)
          || checkConditionBranches(curElse, curThen)) {
        return null;
      }
      BlockNode otherBranchBlock = followThenBranch ? curElse : curThen;
      if (!isPathExists(nextIf.getIfBlock(), otherBranchBlock)) {
        return checkForTernaryInCondition(currentIf);
      }
      if (isPathExists(nextIf.getThenBlock(), otherBranchBlock)
          && isPathExists(nextIf.getElseBlock(), otherBranchBlock)) {
View Full Code Here
233
234
235
236
237
238
239
240
241
    IfCondition condition = IfCondition.merge(mergeOperation, first.getCondition(), second.getCondition());
    IfInfo result = new IfInfo(condition, second);
    result.setIfBlock(first.getIfBlock());
    result.merge(first, second);

    BlockNode otherPathBlock = followThenBranch ? first.getElseBlock() : first.getThenBlock();
    skipSimplePath(otherPathBlock, result.getSkipBlocks());
    return result;
  }
View Full Code Here
258
259
260
261
262
263
264
265
266
267
268
  private static IfInfo getNextIf(IfInfo info, BlockNode block) {
    if (!canSelectNext(info, block)) {
      return null;
    }
    BlockNode nestedIfBlock = getNextIfNode(block);
    if (nestedIfBlock != null) {
      return makeIfInfo(nestedIfBlock);
    }
    return null;
  }
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
300
    List<BlockNode> successors = block.getSuccessors();
    if (successors.size() != 1) {
      return null;
    }

    BlockNode next = successors.get(0);
    if (next.getPredecessors().size() != 1) {
      return null;
    }
    boolean pass = true;
    if (!insns.isEmpty()) {
      // check that all instructions can be inlined
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
    }
    RegisterArg arg = args.get(0);
    if (!arg.getType().equals(fieldsCls.getClassInfo().getType())) {
      return false;
    }
    BlockNode block = mth.getBasicBlocks().get(0);
    List<InsnNode> instructions = block.getInstructions();
    if (instructions.isEmpty()) {
      return false;
    }
    InsnNode insn = instructions.get(0);
    if (insn.getType() != InsnType.IPUT) {
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
    IContainer thenRegion = ifRegion.getThenRegion();
    IContainer elseRegion = ifRegion.getElseRegion();
    if (thenRegion == null || elseRegion == null) {
      return false;
    }
    BlockNode tb = getTernaryInsnBlock(thenRegion);
    BlockNode eb = getTernaryInsnBlock(elseRegion);
    if (tb == null || eb == null) {
      return false;
    }
    BlockNode header = ifRegion.getHeader();
    InsnNode t = tb.getInstructions().get(0);
    InsnNode e = eb.getInstructions().get(0);

    if (t.getSourceLine() != e.getSourceLine()) {
      if (t.getSourceLine() != 0 && e.getSourceLine() != 0) {
        // sometimes source lines incorrect
        if (!checkLineStats(t, e)) {
          return false;
        }
      } else {
        // no debug info
        if (containsTernary(t) || containsTernary(e)) {
          // don't make nested ternary by default
          // TODO: add addition checks
          return false;
        }
      }
    }

    if (t.getResult() != null && e.getResult() != null) {
      PhiInsn phi = t.getResult().getSVar().getUsedInPhi();
      if (phi == null || !t.getResult().equalRegisterAndType(e.getResult())) {
        return false;
      }
      if (!ifRegion.getParent().replaceSubBlock(ifRegion, header)) {
        return false;
      }
      InsnList.remove(tb, t);
      InsnList.remove(eb, e);

      RegisterArg resArg;
      if (phi.getArgsCount() == 2) {
        resArg = phi.getResult();
      } else {
        resArg = t.getResult();
        phi.removeArg(e.getResult());
      }
      TernaryInsn ternInsn = new TernaryInsn(ifRegion.getCondition(),
          resArg, InsnArg.wrapArg(t), InsnArg.wrapArg(e));
      ternInsn.setSourceLine(t.getSourceLine());

      // remove 'if' instruction
      header.getInstructions().clear();
      header.getInstructions().add(ternInsn);

      // shrink method again
      CodeShrinker.shrinkMethod(mth);
      return true;
    }

    if (!mth.getReturnType().equals(ArgType.VOID)
        && t.getType() == InsnType.RETURN && e.getType() == InsnType.RETURN) {

      if (!ifRegion.getParent().replaceSubBlock(ifRegion, header)) {
        return false;
      }
      InsnList.remove(tb, t);
      InsnList.remove(eb, e);
      tb.remove(AFlag.RETURN);
      eb.remove(AFlag.RETURN);

      TernaryInsn ternInsn = new TernaryInsn(ifRegion.getCondition(), null, t.getArg(0), e.getArg(0));
      ternInsn.setSourceLine(t.getSourceLine());
      InsnNode retInsn = new InsnNode(InsnType.RETURN, 1);
      retInsn.addArg(InsnArg.wrapArg(ternInsn));

      header.getInstructions().clear();
      header.getInstructions().add(retInsn);
      header.add(AFlag.RETURN);

      CodeShrinker.shrinkMethod(mth);
      return true;
    }
    return false;
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
131
    if (thenRegion instanceof Region) {
      Region r = (Region) thenRegion;
      if (r.getSubBlocks().size() == 1) {
        IContainer container = r.getSubBlocks().get(0);
        if (container instanceof BlockNode) {
          BlockNode block = (BlockNode) container;
          if (block.getInstructions().size() == 1) {
            return block;
          }
        }
      }
    }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
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
      @Override
      public void processBlock(MethodNode mth, IBlock container) {
        if (!(container instanceof BlockNode)) {
          return;
        }
        BlockNode block = (BlockNode) container;
        if (blocksInRegions.add(block)) {
          return;
        }
        if (!block.contains(AFlag.RETURN)
            && !block.contains(AFlag.SKIP)
            && !block.contains(AFlag.SYNTHETIC)
            && !block.getInstructions().isEmpty()) {
          // TODO
          // mth.add(AFlag.INCONSISTENT_CODE);
          LOG.debug(" Duplicated block: {} in {}", block, mth);
          // printRegionsWithBlock(mth, block);
        }
      }
    });
    if (mth.getBasicBlocks().size() != blocksInRegions.size()) {
      for (BlockNode block : mth.getBasicBlocks()) {
        if (!blocksInRegions.contains(block)
            && !block.getInstructions().isEmpty()
            && !block.contains(AFlag.SKIP)) {
          mth.add(AFlag.INCONSISTENT_CODE);
          LOG.debug(" Missing block: {} in {}", block, mth);
        }
      }
    }

    // check loop conditions
    DepthRegionTraversal.traverseAll(mth, new AbstractRegionVisitor() {
      @Override
      public void enterRegion(MethodNode mth, IRegion region) {
        if (region instanceof LoopRegion) {
          BlockNode loopHeader = ((LoopRegion) region).getHeader();
          if (loopHeader != null && loopHeader.getInstructions().size() != 1) {
            ErrorsCounter.methodError(mth, "Incorrect condition in loop: " + loopHeader);
          }
        }
      }
    });
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
      if (domBlocks.size() != 1) {
        throw new JadxRuntimeException(
            "Exception block dominator not found, method:" + mth + ". bs: " + bs);
      }

      BlockNode domBlock = domBlocks.get(0);

      TryCatchBlock prevTB = tryBlocksMap.put(domBlock, tb);
      if (prevTB != null) {
        LOG.info("!!! TODO: merge try blocks in {}", mth);
      }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
  }

  private static void checkAndWrap(MethodNode mth, Map<BlockNode, TryCatchBlock> tryBlocksMap, IRegion region) {
    // search dominator blocks in this region (don't need to go deeper)
    for (Map.Entry<BlockNode, TryCatchBlock> entry : tryBlocksMap.entrySet()) {
      BlockNode dominator = entry.getKey();
      if (region.getSubBlocks().contains(dominator)) {
        TryCatchBlock tb = tryBlocksMap.get(dominator);
        if (!wrapBlocks(region, tb, dominator)) {
          ErrorsCounter.methodError(mth, "Can't wrap try/catch for " + region);
        }
View Full Code Here
TOP

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

  • jadx.core.codegen.RegionGen
  • jadx.core.dex.instructions.IfNode
  • jadx.core.dex.visitors.BlockMakerVisitor
  • jadx.core.dex.visitors.ClassModifier
  • jadx.core.dex.visitors.CodeShrinker
  • jadx.core.dex.visitors.DotGraphVisitor$DumpDotGraph
  • jadx.core.dex.visitors.EnumVisitor
  • jadx.core.dex.visitors.MethodInlineVisitor
  • jadx.core.dex.visitors.regions.CheckRegions
  • jadx.core.dex.visitors.regions.CleanRegions
    • 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.