---

HierarchyQuery.java

package edu.ksu.cis.bandera.prog;

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Bandera, a Java(TM) analysis and transformation toolkit           *
 * Copyright (C) 1998-2001 SAnToS Laboratories (santos@cis.ksu.edu)  *

 * All rights reserved.                                              *
 *                                                                   *
 * This work was done as a project in the SAnToS Laboratory,         *
 * Department of Computing and Information Sciences, Kansas State    *
 * University, USA (http://www.cis.ksu.edu/santos).                  *
 * It is understood that any modification not identified as such is  *
 * not covered by the preceding statement.                           *
 *                                                                   *
 * This work is free software; you can redistribute it and/or        *
 * modify it under the terms of the GNU Library General Public       *
 * License as published by the Free Software Foundation; either      *
 * version 2 of the License, or (at your option) any later version.  *
 *                                                                   *
 * This work 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 *
 * Library General Public License for more details.                  *
 *                                                                   *
 * You should have received a copy of the GNU Library General Public *
 * License along with this toolkit; if not, write to the             *
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,      *
 * Boston, MA  02111-1307, USA.                                      *
 *                                                                   *
 * Java is a trademark of Sun Microsystems, Inc.                     *
 *                                                                   *
 * To submit a bug report, send a comment, or get the latest news on *
 * this project and other SAnToS projects, please visit the web-site *
 *                http://www.cis.ksu.edu/santos                      *
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
import java.util.Hashtable;
import java.util.HashMap;
import java.util.Enumeration;
import java.util.Iterator;
import java.io.*;

import ca.mcgill.sable.soot.*;
import ca.mcgill.sable.soot.jimple.*;
import ca.mcgill.sable.util.*;

import edu.ksu.cis.bandera.jjjc.*;

public class HierarchyQuery {
        private static HashMap classHierarchies;

public static void buildAncestors(SootClass theClass) {
    if (classHierarchies == null) classHierarchies = new HashMap();
    HashMap theMap = new HashMap();
    buildMap(theMap, theClass); 
    classHierarchies.put(theClass, theMap);
}
private static int buildMap(HashMap map, SootClass current) {
        if (current.hasSuperClass()) {
          int depth = buildMap(map, current.getSuperClass());
      map.put(new Integer(depth+1), current);
      return depth+1;
        } else {
      map.put(new Integer(0), current.getManager().getClass("java.lang.Object"));
      return 0;
        }
}
public static SootClass leastAncestor(SootClass aClass, SootClass bClass) {
    try {
    HashMap aMap = (HashMap)classHierarchies.get(aClass);
    HashMap bMap = (HashMap)classHierarchies.get(bClass);
        int maxDepth;

    if (aMap.size() > bMap.size()) {
      maxDepth = bMap.size();
    } else {
      maxDepth = aMap.size();
    } 

    // At this point maxDepth is the size of the shorter of the two Maps
    //  
    // The maxDepth is one greater than the maximal "depth from Object" 
    // since there is an explicit mapping for "Object" at depth 0.

        for (int i=maxDepth-1; i>0; i--) {
      if ( aMap.get(new Integer(i)) == bMap.get(new Integer(i)) )
        return (SootClass)aMap.get(new Integer(i));
        }
    return (SootClass)aMap.get(new Integer(0));
    } catch(java.lang.NullPointerException e) {
       System.out.println("Called with " + aClass.getName() + " and " +
                          bClass.getName());
       System.out.println("Hierarchy has maps for:");
       Iterator chIt = classHierarchies.values().iterator();
       while (chIt.hasNext()) {
         HashMap thisMap = (HashMap)chIt.next();
         System.out.println("   " + thisMap.get(new Integer(thisMap.size()-1)));
       }
       throw e;   
    }
}
public static void main(String args[]) {
    SootClassManager classManager = new SootClassManager();
    CompilationManager.reset();
    CompilationManager.setFilename(args[0]);
    CompilationManager.setClasspath(".");
    CompilationManager.setIncludedPackagesOrTypes(new String[0]);

    //Compile 
    try { CompilationManager.compile(); } 
        catch (Exception e) { 
      System.out.println(e);
      System.out.println("Compilation failed");
    }

    Hashtable storedClasses = CompilationManager.getCompiledClasses();

    Enumeration scIter = storedClasses.elements();
    while (scIter.hasMoreElements()) {
      ((SootClass) scIter.nextElement()).resolveIfNecessary();
    }

    scIter = storedClasses.elements();
    while (scIter.hasMoreElements()) {
      buildAncestors((SootClass)scIter.nextElement());
    }

    SootClass a = null;
        SootClass b = null;

    scIter = storedClasses.elements();
    while (scIter.hasMoreElements()) {
      SootClass tmp = (SootClass) scIter.nextElement();
      if (tmp.getName().equals(args[1])) {
        a = tmp;
      }
          if (tmp.getName().equals(args[2])) {
        b = tmp; 
      }
    }

        System.out.println("Least ancestor of " + a.getName() + " and " +
                           b.getName() + " is " + leastAncestor(a,b).getName());
}
}

---