All Downloads are FREE. Search and download functionalities are using the official Maven repository.
  • Log In
  • Register

    • soot.jimple.toolkits.thread.mhp.DfsForBackEdge Maven / Gradle / Ivy

    The newest version!
    package soot.jimple.toolkits.thread.mhp;

/*-
 * #%L
 * Soot - a J*va Optimization Framework
 * %%
 * Copyright (C) 1997 - 2018 Raja Vallée-Rai and others
 * %%
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation, either version 2.1 of the
 * License, or (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Lesser Public License for more details.
 * 
 * You should have received a copy of the GNU General Lesser Public
 * License along with this program.  If not, see
 * .
 * #L%
 */

import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;

import soot.jimple.toolkits.thread.mhp.stmt.JPegStmt;
import soot.tagkit.Tag;
import soot.toolkits.graph.DirectedGraph;
import soot.toolkits.scalar.FlowSet;
import soot.util.Chain;

// *** USE AT YOUR OWN RISK ***
// May Happen in Parallel (MHP) analysis by Lin Li.
// This code should be treated as beta-quality code.
// It was written in 2003, but not incorporated into Soot until 2006.
// As such, it may contain incorrect assumptions about the usage
// of certain Soot classes.
// Some portions of this MHP analysis have been quality-checked, and are
// now used by the Transactions toolkit.
//
// -Richard L. Halpert, 2006-11-30

public class DfsForBackEdge {

  private final Map backEdges = new HashMap();
  private final Set gray = new HashSet();
  private final Set black = new HashSet();
  private final DominatorsFinder domFinder;

  DfsForBackEdge(Chain chain, DirectedGraph peg) {

    domFinder = new DominatorsFinder(chain, peg);
    Iterator it = chain.iterator();
    dfs(it, peg);
    testBackEdge();
  }

  private void dfs(Iterator it, DirectedGraph g) {

    // Visit each node
    {

      while (it.hasNext()) {
        Object s = it.next();
        if (!gray.contains(s)) {

          visitNode(g, s);
        }
      }

    }

  }

  private void visitNode(DirectedGraph g, Object s) {
    // System.out.println("s is: "+ s);
    gray.add(s);
    Iterator it = g.getSuccsOf(s).iterator();

    if (g.getSuccsOf(s).size() > 0) {
      while (it.hasNext()) {
        Object succ = it.next();
        if (!gray.contains(succ)) {

          visitNode(g, succ);
        } else {
          // if the color of the node is gray, then we found a retreating edge
          if (gray.contains(succ) && !black.contains(succ)) {
            /*
             * If succ is in s's dominator list, then this retreating edge is a back edge.
             */
            FlowSet dominators = domFinder.getDominatorsOf(s);
            if (dominators.contains(succ)) {
              System.out.println("s is " + s);
              System.out.println("succ is " + succ);
              backEdges.put(s, succ);
            }
          }

        }
      }
    }
    black.add(s);

  }

  protected Map getBackEdges() {
    return backEdges;
  }

  private void testBackEdge() {
    System.out.println("===test backEdges==");
    Set maps = backEdges.entrySet();
    for (Iterator iter = maps.iterator(); iter.hasNext();) {
      Map.Entry entry = (Map.Entry) iter.next();
      JPegStmt key = (JPegStmt) entry.getKey();
      Tag tag = (Tag) key.getTags().get(0);
      System.out.println("---key=  " + tag + " " + key);
      JPegStmt value = (JPegStmt) entry.getValue();
      Tag tag1 = (Tag) value.getTags().get(0);
      System.out.println("---value=  " + tag1 + " " + value);
    }
    System.out.println("===test backEdges==end==");
  }

}
    
    
    
    

    




    
    
    © 2015 - 2024 Weber Informatics LLC | Privacy Policy