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

soot.jimple.toolkits.thread.mhp.pegcallgraph.CheckRecursiveCalls Maven / Gradle / Ivy

Go to download

A Java Optimization Framework

There is a newer version: 4.6.0
Show newest version
package soot.jimple.toolkits.thread.mhp.pegcallgraph;

/*-
 * #%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.Iterator;
import java.util.List;
import java.util.Set;

import soot.jimple.toolkits.thread.mhp.SCC;

// *** 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 CheckRecursiveCalls {
  List newSccList = null;

  public CheckRecursiveCalls(PegCallGraph pcg, Set methodNeedExtent) {
    Iterator it = pcg.iterator();
    // PegCallGraphToDot pcgtd = new PegCallGraphToDot(pcg, false, "pegcallgraph");
    SCC scc = new SCC(it, pcg);
    List> sccList = scc.getSccList();
    // printSCC(sccList);
    newSccList = updateScc(sccList, pcg);

    // System.out.println("after update scc");
    // printSCC(newSccList);
    check(newSccList, methodNeedExtent);
  }

  private List updateScc(List> sccList, PegCallGraph pcg) {
    List newList = new ArrayList();
    Iterator> listIt = sccList.iterator();
    while (listIt.hasNext()) {
      List s = listIt.next();
      if (s.size() == 1) {
        Object o = s.get(0);

        if ((pcg.getSuccsOf(o)).contains(o) || (pcg.getPredsOf(o)).contains(o)) {
          // sccList.remove(s);
          newList.add(s);
        }
      } else {
        newList.add(s);
      }
    }
    return newList;
  }

  private void check(List sccList, Set methodNeedExtent) {
    Iterator listIt = sccList.iterator();
    while (listIt.hasNext()) {
      List s = listIt.next();
      // printSCC(s);
      if (s.size() > 0) {
        Iterator it = s.iterator();
        while (it.hasNext()) {
          Object o = it.next();
          if (methodNeedExtent.contains(o)) {
            // if (((Boolean)methodsNeedingInlining.get(o)).booleanValue() == true){
            System.err.println("Fail to compute MHP because interested method call relate to recursive calls!");
            System.err.println("interested method: " + o);
            throw new RuntimeException("Fail to compute MHP because interested method call relate to recursive calls!");
            // }
          }
        }
      }
    }
  }
}
    

    

    

            

    

            



    
    






    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy