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

soot.jimple.toolkits.thread.mhp.LoopBodyFinder 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;

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

import soot.toolkits.graph.DirectedGraph;
import soot.util.FastStack;

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

  private final FastStack stack = new FastStack();
  private final Set> loops = new HashSet>();

  LoopBodyFinder(Map backEdges, DirectedGraph g) {
    findLoopBody(backEdges, g);
  }

  private void findLoopBody(Map backEdges, DirectedGraph g) {
    Set maps = backEdges.entrySet();
    for (Iterator iter = maps.iterator(); iter.hasNext();) {
      Map.Entry entry = (Map.Entry) iter.next();
      Object tail = entry.getKey();
      // Tag tag = (Tag)key.getTags().get(0);
      // System.out.println("---key= "+tag+" "+key);
      Object head = entry.getValue();
      Set loopBody = finder(tail, head, g);
      loops.add(loopBody);
    }

  }

  private Set finder(Object tail, Object head, DirectedGraph g) {
    Set loop = new HashSet();
    loop.add(head);
    insert(tail, loop);
    while (!stack.empty()) {
      Object p = stack.pop();
      Iterator predsListIt = g.getPredsOf(p).iterator();
      while (predsListIt.hasNext()) {
        Object pred = predsListIt.next();
        insert(pred, loop);
      }
    }
    return loop;
  }

  private void insert(Object m, Set loop) {
    if (!loop.contains(m)) {
      loop.add(m);
      stack.push(m);
    }
  }

  public Set> getLoopBody() {
    return loops;
  }
}
    

    

    

            

    

            



    
    






    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy