Package br.usp.each.saeg.bytecode.analysis.graph

Examples of br.usp.each.saeg.bytecode.analysis.graph.PreOrderTraversalStrategy


       
        graph = new ProgramGraph(
            className, methodNode.name, methodNode.desc, nodes.get(0));
       
        if ((type & BASIC_BLOCK) != 0) {
          new PreOrderTraversalStrategy(new BasicBlockGraphNodeJoiner()).traverse(graph.getRootNode());
        }
        if ((type & COMPUTE_DEF_USE) != 0) {
          new DataflowVerifierTraversalStrategy(new DefUseFrameComputer()).traverse(graph.getRootNode());
        }
        if ((type & REMOVE_LOCAL_USES) != 0) {
          new PreOrderTraversalStrategy(new LocalUseRemover()).traverse(graph.getRootNode());
        }
        if ((type & REMOVE_UNUSED_DEFS) != 0) {
          new PreOrderTraversalStrategy(new LonelyDefinitionsRemover()).traverse(graph.getRootNode());
        }
       
      }

      // Releasing references in order to save memory
View Full Code Here


  @Override
  public void start(final GraphNode root) {
   
    final VariablesCollector variables = new VariablesCollector();
    new PreOrderTraversalStrategy(variables).traverse(root);
   
    uses = variables.getUsesVariableRefs();
   
  }
View Full Code Here

TOP

Related Classes of br.usp.each.saeg.bytecode.analysis.graph.PreOrderTraversalStrategy

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.