Package org.candle.decompiler.intermediate.code

Examples of org.candle.decompiler.intermediate.code.TryIntermediate

29
30
31
32
33
34
35
36
37
38
39
    for(IntermediateEdge ie : edges) {
      if(ie.getType() == EdgeType.EXCEPTION) {
        System.out.println("EXCEEEEEPTIONS!");
       
       
        TryIntermediate ti = new TryIntermediate(line.getInstruction());
        igc.getGraph().addVertex(ti);
        igc.redirectPredecessors(line, ti);
      }
    }
  }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
      line.getBlockRange().setEnd(lastStatement.getInstruction());
    }
  }
 
  public void processLastCatch(CatchIntermediate line) {
    TryIntermediate tryBlock = (TryIntermediate)igc.getSinglePredecessor(line);
    if(igc.getFinallyClause(tryBlock) != null) {
      return;
    }
   
    //now, we are going to look for the block jump.
    InstructionHandle ih = tryBlock.getBlockRange().getEnd();
    //see about a goto.
    GoToIntermediate gotoHandle = (GoToIntermediate)igc.findNextNode(ih.getNext());
    TreeSet<AbstractIntermediate> ordered = new TreeSet<AbstractIntermediate>(new IntermediateComparator());
    //no finally clause...
    ordered.addAll(igc.getCatchClauses(tryBlock));
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
    InstructionHandle min = getLowestBound(line.getCodeExceptions());
    InstructionHandle max = getHighestBound(line.getCodeExceptions());
   
    LOG.debug("Finally Range: "+min.getPosition() + " -> "+max.getPosition());
   
    TryIntermediate matched = matchTryBlock(min, max);
    if(matched != null) {
      final Set<Integer> offsets = collectOffsets(line);
      //ok, now we need to eliminate finally blocks from this try and all of the catches.  thanks Java!
      List<CatchIntermediate> catchClauses = igc.getCatchClauses(matched);
      //for each catch clause...
View Full Code Here
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
  protected TryIntermediate matchTryBlock(InstructionHandle min, InstructionHandle max) {
    LinkedList<TryIntermediate> matches = new LinkedList<TryIntermediate>();
    //find the try block...
    for(AbstractIntermediate ai : igc.getGraph().vertexSet()) {
      if(ai instanceof TryIntermediate) {
        TryIntermediate tryIntermediate = ((TryIntermediate) ai);
        LOG.debug("Finally: "+tryIntermediate+ " , "+tryIntermediate.getInstruction().getPosition()+" , "+tryIntermediate.getBlockRange().getStart());
        if(tryIntermediate.getBlockRange().getStart().getPosition() == min.getPosition()) {
         
          //only add where max > try's max range...
          if(tryIntermediate.getBlockRange().getEnd().getPosition() < max.getPosition()) {
            matches.add(tryIntermediate);
          }
        }
      }
    }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
   
    for(BlockRange tryRange : tryBlock) {
      //create try block... create each catch block... link the two together for graph sake.
      //look up block...
      InstructionHandle start = tryRange.getStart();
      TryIntermediate tryIntermediate = new TryIntermediate(start);
      tryIntermediate.getBlockRange().setStart(tryRange.getStart());
      tryIntermediate.getBlockRange().setEnd(tryRange.getEnd());
     
     
      igc.getGraph().addVertex(tryIntermediate);
     
      //add line between try and node.
View Full Code Here
TOP

Related Classes of org.candle.decompiler.intermediate.code.TryIntermediate

  • org.candle.decompiler.intermediate.graph.enhancer.RetractDuplicateFinally
  • org.candle.decompiler.intermediate.graph.enhancer.Try
  • org.candle.decompiler.intermediate.graph.IntermediateTryCatch
  • org.candle.decompiler.intermediate.graph.range.CatchUpperRangeVisitor
  • java.io.StringWriter
    • 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.