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

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

Go to download 

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.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;

import soot.SootMethod;
import soot.jimple.toolkits.callgraph.CallGraph;
import soot.jimple.toolkits.callgraph.Edge;
import soot.toolkits.graph.DirectedGraph;
import soot.util.Chain;
import soot.util.HashChain;

// *** 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 PegCallGraph implements DirectedGraph {
  List heads;
  List tails;
  Chain chain;
  // protected Map methodToSuccs;
  // protected Map methodToPreds;
  private final Map methodToSuccs;
  private final Map methodToPreds;
  private final Map methodToSuccsTrim;
  private final Set clinitMethods;

  public PegCallGraph(CallGraph cg) {
    clinitMethods = new HashSet();
    chain = new HashChain();
    heads = new ArrayList();
    tails = new ArrayList();
    methodToSuccs = new HashMap();
    methodToPreds = new HashMap();
    methodToSuccsTrim = new HashMap();
    // buildfortest();
    buildChainAndSuccs(cg);
    // testChain();
    // testMethodToSucc();
    buildPreds();
    // trim(); BROKEN
    // testMethodToPred();
    // testClinitMethods();
  }

  protected void testChain() {
    System.out.println("******** chain of pegcallgraph********");
    Iterator it = chain.iterator();
    while (it.hasNext()) {
      SootMethod sm = (SootMethod) it.next();
      System.out.println(sm);
      // System.out.println("name: "+sm.getName());
    }
  }

  public Set getClinitMethods() {
    return clinitMethods;
  }

  private void buildChainAndSuccs(CallGraph cg) {
    Iterator it = cg.sourceMethods();
    while (it.hasNext()) {
      SootMethod sm = (SootMethod) it.next();
      if (sm.getName().equals("main")) {
        heads.add(sm);
      }
      // if (sm.isConcrete() && !sm.getDeclaringClass().isLibraryClass()){
      // if (sm.hasActiveBody() && sm.getDeclaringClass().isApplicationClass() ){
      if (sm.isConcrete() && sm.getDeclaringClass().isApplicationClass()) {
        if (!chain.contains(sm)) {
          chain.add(sm);
        }
        List succsList = new ArrayList();
        Iterator edgeIt = cg.edgesOutOf(sm);
        while (edgeIt.hasNext()) {
          Edge edge = (Edge) edgeIt.next();
          SootMethod target = edge.tgt();
          // if (target.isConcrete() && !target.getDeclaringClass().isLibraryClass()){
          // if (target.hasActiveBody() && target.getDeclaringClass().isApplicationClass()){
          if (target.isConcrete() && target.getDeclaringClass().isApplicationClass()) {
            succsList.add(target);
            if (!chain.contains(target)) {
              chain.add(target);
              // System.out.println("add: "+target);
            }
            if (edge.isClinit()) {
              clinitMethods.add(target);
            }

          }
        }
        // if (succsList == null) System.out.println("null succsList");
        if (succsList.size() > 0) {
          methodToSuccs.put(sm, succsList);
        }
      }
    }
    // testChain();
    /*
     * Because CallGraph.sourceMethods only "Returns an iterator over all methods that are the sources of at least one edge",
     * some application methods may not in methodToSuccs. So add them.
     */
    {
      Iterator chainIt = chain.iterator();
      while (chainIt.hasNext()) {
        SootMethod sm = (SootMethod) chainIt.next();

        if (!methodToSuccs.containsKey(sm)) {
          methodToSuccs.put(sm, new ArrayList());
          // System.out.println("put: "+sm+"into methodToSuccs");
        }
      }
    }
    // remove the entry for those who's preds are null.
    {
      Iterator chainIt = chain.iterator();
      while (it.hasNext()) {
        SootMethod s = (SootMethod) chainIt.next();
        if (methodToSuccs.containsKey(s)) {
          List succList = methodToSuccs.get(s);
          if (succList.size() <= 0) {
            // methodToSuccs.remove(s);
          }
        }
      }
    }
    // testMethodToSucc();

    // unmodidiable
    {
      Iterator chainIt = chain.iterator();
      while (chainIt.hasNext()) {

        SootMethod s = (SootMethod) chainIt.next();
        // System.out.println(s);
        if (methodToSuccs.containsKey(s)) {
          methodToSuccs.put(s, Collections.unmodifiableList(methodToSuccs.get(s)));
        }
      }
    }

  }

  private void buildPreds() {

    // initialize the pred sets to empty
    {
      Iterator unitIt = chain.iterator();

      while (unitIt.hasNext()) {

        methodToPreds.put(unitIt.next(), new ArrayList());
      }
    }

    {
      Iterator unitIt = chain.iterator();

      while (unitIt.hasNext()) {
        Object s = unitIt.next();

        // Modify preds set for each successor for this statement
        List succList = methodToSuccs.get(s);
        if (succList.size() > 0) {
          Iterator succIt = succList.iterator();

          while (succIt.hasNext()) {

            Object successor = succIt.next();

            List predList = methodToPreds.get(successor);
            // if (predList == null) System.out.println("null predList");
            // if (s == null) System.out.println("null s");
            try {
              predList.add(s);
            } catch (NullPointerException e) {
              System.out.println(s + "successor: " + successor);
              throw e;
            }
          }
        }
      }
    }

    // Make pred lists unmodifiable.
    {
      Iterator unitIt = chain.iterator();

      while (unitIt.hasNext()) {
        SootMethod s = (SootMethod) unitIt.next();
        if (methodToPreds.containsKey(s)) {
          List predList = methodToPreds.get(s);
          methodToPreds.put(s, Collections.unmodifiableList(predList));
        }
      }
    }

  }

  public void trim() {
    // If there are multiple edges from one method to another, we only keeps one edge. BROKEN
    Set maps = methodToSuccs.entrySet();
    for (Iterator iter = maps.iterator(); iter.hasNext();) {
      Map.Entry entry = (Map.Entry) iter.next();
      List list = (List) entry.getValue();
      List newList = new ArrayList();
      Iterator it = list.iterator();
      while (it.hasNext()) {
        Object obj = it.next();
        if (!list.contains(obj)) {
          newList.add(obj);
        }
      }
      methodToSuccsTrim.put(entry.getKey(), newList);
    }
  }

  public List getHeads() {
    return heads;
  }

  public List getTails() {
    return tails;
  }

  public List getTrimSuccsOf(Object s) {
    if (!methodToSuccsTrim.containsKey(s)) {
      return java.util.Collections.EMPTY_LIST;
    }
    // throw new RuntimeException("Invalid method"+s);
    return methodToSuccsTrim.get(s);
  }

  public List getSuccsOf(Object s) {
    if (!methodToSuccs.containsKey(s)) {
      return java.util.Collections.EMPTY_LIST;
    }
    // throw new RuntimeException("Invalid method"+s);
    return methodToSuccs.get(s);
  }

  public List getPredsOf(Object s) {
    if (!methodToPreds.containsKey(s)) {
      return java.util.Collections.EMPTY_LIST;
    }
    // throw new RuntimeException("Invalid method"+s);
    return methodToPreds.get(s);
  }

  public Iterator iterator() {
    return chain.iterator();
  }

  public int size() {
    return chain.size();
  }

  protected void testMethodToSucc() {
    System.out.println("=====test methodToSucc ");
    Set maps = methodToSuccs.entrySet();
    for (Iterator iter = maps.iterator(); iter.hasNext();) {
      Map.Entry entry = (Map.Entry) iter.next();
      System.out.println("---key=  " + entry.getKey());
      List list = (List) entry.getValue();
      if (list.size() > 0) {

        System.out.println("**succ set:");
        Iterator it = list.iterator();
        while (it.hasNext()) {
          System.out.println(it.next());

        }

      }
    }
    System.out.println("=========methodToSucc--ends--------");
  }

  protected void testMethodToPred() {
    System.out.println("=====test methodToPred ");
    Set maps = methodToPreds.entrySet();
    for (Iterator iter = maps.iterator(); iter.hasNext();) {
      Map.Entry entry = (Map.Entry) iter.next();
      System.out.println("---key=  " + entry.getKey());
      List list = (List) entry.getValue();
      if (list.size() > 0) {

        System.out.println("**pred set:");
        Iterator it = list.iterator();
        while (it.hasNext()) {
          System.out.println(it.next());

        }

      }
    }
    System.out.println("=========methodToPred--ends--------");
  }

}
 















© 2015 - 2024 Weber Informatics LLC | Privacy Policy