151 lines
5.8 KiB
Java
151 lines
5.8 KiB
Java
/******************************************************************************
|
|
* Copyright (c) 2002 - 2012 IBM Corporation.
|
|
* All rights reserved. This program and the accompanying materials
|
|
* are made available under the terms of the Eclipse Public License v1.0
|
|
* which accompanies this distribution, and is available at
|
|
* http://www.eclipse.org/legal/epl-v10.html
|
|
*
|
|
* Contributors:
|
|
* IBM Corporation - initial API and implementation
|
|
*****************************************************************************/
|
|
package com.ibm.wala.cast.js.rhino.callgraph.fieldbased.test;
|
|
|
|
import java.io.File;
|
|
import java.io.IOException;
|
|
import java.net.URL;
|
|
import java.util.Collections;
|
|
import java.util.Map;
|
|
import java.util.Set;
|
|
|
|
import com.ibm.wala.cast.ipa.callgraph.CAstAnalysisScope;
|
|
import com.ibm.wala.cast.ir.ssa.AstIRFactory;
|
|
import com.ibm.wala.cast.ir.translator.TranslatorToCAst.Error;
|
|
import com.ibm.wala.cast.js.callgraph.fieldbased.FieldBasedCallGraphBuilder;
|
|
import com.ibm.wala.cast.js.callgraph.fieldbased.OptimisticCallgraphBuilder;
|
|
import com.ibm.wala.cast.js.callgraph.fieldbased.PessimisticCallGraphBuilder;
|
|
import com.ibm.wala.cast.js.callgraph.fieldbased.WorklistBasedOptimisticCallgraphBuilder;
|
|
import com.ibm.wala.cast.js.html.JSSourceExtractor;
|
|
import com.ibm.wala.cast.js.html.WebPageLoaderFactory;
|
|
import com.ibm.wala.cast.js.html.WebUtil;
|
|
import com.ibm.wala.cast.js.ipa.callgraph.JSCallGraph;
|
|
import com.ibm.wala.cast.js.ipa.callgraph.JSCallGraphUtil;
|
|
import com.ibm.wala.cast.js.loader.JavaScriptLoader;
|
|
import com.ibm.wala.cast.js.loader.JavaScriptLoaderFactory;
|
|
import com.ibm.wala.cast.js.test.JSCallGraphBuilderUtil;
|
|
import com.ibm.wala.cast.js.translator.CAstRhinoTranslatorFactory;
|
|
import com.ibm.wala.cast.js.translator.JavaScriptTranslatorFactory;
|
|
import com.ibm.wala.cast.js.util.CallGraph2JSON;
|
|
import com.ibm.wala.cast.js.util.Util;
|
|
import com.ibm.wala.classLoader.SourceFileModule;
|
|
import com.ibm.wala.classLoader.SourceModule;
|
|
import com.ibm.wala.classLoader.SourceURLModule;
|
|
import com.ibm.wala.ipa.callgraph.AnalysisCache;
|
|
import com.ibm.wala.ipa.callgraph.Entrypoint;
|
|
import com.ibm.wala.ipa.cha.ClassHierarchy;
|
|
import com.ibm.wala.ipa.cha.IClassHierarchy;
|
|
import com.ibm.wala.util.CancelException;
|
|
import com.ibm.wala.util.NullProgressMonitor;
|
|
import com.ibm.wala.util.WalaException;
|
|
|
|
/**
|
|
* Utility class for building call graphs.
|
|
*
|
|
* @author mschaefer
|
|
*
|
|
*/
|
|
public class CGUtil {
|
|
public static enum BuilderType { PESSIMISTIC, OPTIMISTIC, OPTIMISTIC_WORKLIST };
|
|
|
|
private final JavaScriptTranslatorFactory translatorFactory;
|
|
|
|
public CGUtil(JavaScriptTranslatorFactory translatorFactory) {
|
|
this.translatorFactory = translatorFactory;
|
|
}
|
|
|
|
public JSCallGraph buildCG(URL url, BuilderType builderType) throws IOException, WalaException, Error {
|
|
JavaScriptLoaderFactory loaders = makeLoaderFactory(url);
|
|
SourceModule[] scripts;
|
|
if (url.getFile().endsWith(".js")) {
|
|
scripts = new SourceModule[]{
|
|
new SourceURLModule(url),
|
|
JSCallGraphBuilderUtil.getPrologueFile("prologue.js")
|
|
};
|
|
} else {
|
|
scripts = JSCallGraphBuilderUtil.makeHtmlScope(url, loaders);
|
|
}
|
|
|
|
CAstAnalysisScope scope = new CAstAnalysisScope(scripts, loaders, Collections.singleton(JavaScriptLoader.JS));
|
|
IClassHierarchy cha = ClassHierarchy.make(scope, loaders, JavaScriptLoader.JS);
|
|
Util.checkForFrontEndErrors(cha);
|
|
Iterable<Entrypoint> roots = JSCallGraphUtil.makeScriptRoots(cha);
|
|
FieldBasedCallGraphBuilder builder = null;
|
|
|
|
AnalysisCache cache = new AnalysisCache(AstIRFactory.makeDefaultFactory());
|
|
switch(builderType) {
|
|
case PESSIMISTIC:
|
|
builder = new PessimisticCallGraphBuilder(cha, JSCallGraphUtil.makeOptions(scope, cha, roots), cache);
|
|
break;
|
|
case OPTIMISTIC:
|
|
builder = new OptimisticCallgraphBuilder(cha, JSCallGraphUtil.makeOptions(scope, cha, roots), cache);
|
|
break;
|
|
case OPTIMISTIC_WORKLIST:
|
|
builder = new WorklistBasedOptimisticCallgraphBuilder(cha, JSCallGraphUtil.makeOptions(scope, cha, roots), cache);
|
|
break;
|
|
}
|
|
|
|
try {
|
|
return builder.buildCallGraph(roots, new NullProgressMonitor());
|
|
} catch (CancelException e) {
|
|
return null;
|
|
}
|
|
}
|
|
|
|
private JavaScriptLoaderFactory makeLoaderFactory(URL url) {
|
|
return url.getFile().endsWith(".js") ? new JavaScriptLoaderFactory(translatorFactory) : new WebPageLoaderFactory(translatorFactory);
|
|
}
|
|
|
|
public static void main(String[] args) throws IOException, WalaException, Error {
|
|
JSSourceExtractor.DELETE_UPON_EXIT = true;
|
|
URL url = new File(args[0]).toURI().toURL();
|
|
System.err.println("Analysing " + url);
|
|
Map<String, Set<String>> edges = CallGraph2JSON.extractEdges(new CGUtil(new CAstRhinoTranslatorFactory()).buildCG(url, BuilderType.OPTIMISTIC_WORKLIST));
|
|
|
|
for(Map.Entry<String, Set<String>> e : edges.entrySet()) {
|
|
String site = e.getKey();
|
|
for(String callee : e.getValue())
|
|
System.out.println(site + " -> " + callee);
|
|
}
|
|
}
|
|
|
|
@SuppressWarnings("unused")
|
|
private static void compareCGs(Map<String, Set<String>> cg1, Map<String, Set<String>> cg2) {
|
|
boolean diff = false;
|
|
for(String key : cg1.keySet()) {
|
|
Set<String> targets1 = cg1.get(key), targets2 = cg2.get(key);
|
|
if(targets2 == null) {
|
|
diff = true;
|
|
System.err.println("CG2 doesn't have call site" + key);
|
|
} else {
|
|
for(String target : targets1)
|
|
if(!targets2.contains(target)) {
|
|
diff = true;
|
|
System.err.println("CG2 doesn't have edge " + key + " -> " + target);
|
|
}
|
|
for(String target : targets2)
|
|
if(!targets1.contains(target)) {
|
|
diff = true;
|
|
System.err.println("CG1 doesn't have edge " + key + " -> " + target);
|
|
}
|
|
}
|
|
}
|
|
for(String key : cg2.keySet()) {
|
|
if(!cg1.containsKey(key)) {
|
|
diff = true;
|
|
System.err.println("CG1 doesn't have call site " + key);
|
|
}
|
|
}
|
|
if(!diff)
|
|
System.err.println("call graphs are identical");
|
|
}
|
|
}
|