All Downloads are FREE. Search and download functionalities are using the official Maven repository.

soot.jimple.toolkits.thread.mhp.SCC Maven / Gradle / Ivy

Go to download 


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.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;

import soot.toolkits.graph.DirectedGraph;

// *** 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 SCC {

  private Set gray;
  // private int time;
  private final LinkedList finishedOrder;
  private final List> sccList;

  // public SCC(Chain chain, DirectedGraph g){
  public SCC(Iterator it, DirectedGraph g) {

    gray = new HashSet();
    finishedOrder = new LinkedList();
    sccList = new ArrayList>();

    // Visit each node
    {

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

          visitNode(g, s);
        }
      }

    }

    // Re-color all nodes white
    gray = new HashSet();

    // visit nodes via tranpose edges according decreasing order of finish time of nodes

    {

      Iterator revNodeIt = finishedOrder.iterator();
      while (revNodeIt.hasNext()) {
        Object s = revNodeIt.next();
        if (!gray.contains(s)) {

          List scc = new ArrayList();

          visitRevNode(g, s, scc);
          sccList.add(scc);
        }

      }
    }
  }

  private void visitNode(DirectedGraph g, Object s) {
    // System.out.println("visit "+s);
    gray.add(s);
    // time++; // begin visit time
    Iterator it = g.getSuccsOf(s).iterator();
    // System.out.println("succs are: "+g.getSuccsOf(s));
    if (g.getSuccsOf(s).size() > 0) {
      while (it.hasNext()) {
        Object succ = it.next();
        if (!gray.contains(succ)) {

          visitNode(g, succ);
        }
      }
    }
    // time++;//end time
    finishedOrder.addFirst(s);
    // System.out.println("add "+s+ " to finished order ");

  }

  private void visitRevNode(DirectedGraph g, Object s, List scc) {

    scc.add(s);
    gray.add(s);

    if (g.getPredsOf(s) != null) {
      Iterator predsIt = g.getPredsOf(s).iterator();
      if (g.getPredsOf(s).size() > 0) {
        while (predsIt.hasNext()) {
          Object pred = predsIt.next();
          if (!gray.contains(pred)) {
            visitRevNode(g, pred, scc);

          }
        }

      }
    }
  }

  public List> getSccList() {
    return sccList;
  }

  public LinkedList getFinishedOrder() {
    return finishedOrder;
  }
}
 















© 2015 - 2024 Weber Informatics LLC | Privacy Policy