pascal.taie.analysis.pta.toolkit.util.OAGs Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of tai-e Show documentation
Show all versions of tai-e Show documentation
An easy-to-learn/use static analysis framework for Java
The newest version!
/*
* Tai-e: A Static Analysis Framework for Java
*
* Copyright (C) 2022 Tian Tan
* Copyright (C) 2022 Yue Li
*
* This file is part of Tai-e.
*
* Tai-e 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 3
* of the License, or (at your option) any later version.
*
* Tai-e 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 Lesser General
* Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with Tai-e. If not, see .
*/
package pascal.taie.analysis.pta.toolkit.util;
import pascal.taie.analysis.pta.core.heap.Obj;
import pascal.taie.analysis.pta.toolkit.PointerAnalysisResultEx;
import pascal.taie.language.classes.JMethod;
import pascal.taie.util.collection.Maps;
import pascal.taie.util.collection.Sets;
import pascal.taie.util.graph.Graph;
import pascal.taie.util.graph.SimpleGraph;
import java.util.ArrayDeque;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
/**
* Provides utility methods for object allocation graph.
*/
public class OAGs {
private OAGs() {
}
/**
* Builds object allocation graph.
*
* @return the object allocation graph for the program.
*/
public static Graph build(PointerAnalysisResultEx pta) {
SimpleGraph oag = new SimpleGraph<>();
computeInvokedMethods(pta).forEach((obj, methods) -> methods.stream()
.map(pta::getObjectsAllocatedIn)
.flatMap(Set::stream)
.forEach(succ -> oag.addEdge(obj, succ)));
return oag;
}
/**
* Computes the methods invoked on all objects in the program.
* For a static method, say m, we trace back its caller chain until
* we find the first instance method on the chain, say m' , and
* consider that m is invoked on the receiver object of m'.
*/
public static Map> computeInvokedMethods(
PointerAnalysisResultEx pta) {
Map> invokedMethods = Maps.newConcurrentMap();
pta.getBase()
.getObjects()
.parallelStream()
.forEach(obj -> {
Set methods = Sets.newHybridSet();
Queue workList = new ArrayDeque<>(
pta.getMethodsInvokedOn(obj));
while (!workList.isEmpty()) {
JMethod method = workList.poll();
methods.add(method);
pta.getBase().getCallGraph()
.getCalleesOfM(method)
.stream()
.filter(m -> m.isStatic() && !methods.contains(m))
.forEach(workList::add);
}
invokedMethods.put(obj, methods);
});
return invokedMethods;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy