pascal.taie.analysis.pta.toolkit.zipper.PrecisionFlowGraph 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.zipper;
import pascal.taie.analysis.graph.flowgraph.FlowEdge;
import pascal.taie.analysis.graph.flowgraph.Node;
import pascal.taie.analysis.graph.flowgraph.ObjectFlowGraph;
import pascal.taie.analysis.graph.flowgraph.VarNode;
import pascal.taie.language.type.Type;
import pascal.taie.util.collection.Maps;
import pascal.taie.util.collection.MultiMap;
import pascal.taie.util.collection.Views;
import pascal.taie.util.graph.Graph;
import java.util.Set;
import java.util.stream.Collectors;
class PrecisionFlowGraph implements Graph {
private final Type type;
private final ObjectFlowGraph ofg;
private final Set nodes;
private final Set outNodes;
private final MultiMap inWUEdges;
private final MultiMap outWUEdges;
PrecisionFlowGraph(Type type, ObjectFlowGraph ofg,
Set nodes, Set outNodes,
MultiMap outWUEdges) {
this.type = type;
this.ofg = ofg;
this.nodes = nodes;
this.outNodes = outNodes
.stream()
.filter(nodes::contains)
.collect(Collectors.toUnmodifiableSet());
this.outWUEdges = outWUEdges;
this.inWUEdges = Maps.newMultiMap();
outWUEdges.values()
.forEach(edge -> inWUEdges.put(edge.target(), edge));
}
Type getType() {
return type;
}
Set getOutNodes() {
return outNodes;
}
@Override
public boolean hasEdge(Node source, Node target) {
throw new UnsupportedOperationException();
}
@Override
public Set getPredsOf(Node node) {
return Views.toMappedSet(getInEdgesOf(node), FlowEdge::source);
}
@Override
public Set getInEdgesOf(Node node) {
Set inEdges = ofg.getInEdgesOf(node)
.stream()
.filter(e -> nodes.contains(e.source()))
.collect(Collectors.toSet());
inEdges.addAll(inWUEdges.get(node));
return inEdges;
}
@Override
public Set getSuccsOf(Node node) {
return Views.toMappedSet(getOutEdgesOf(node), FlowEdge::target);
}
@Override
public Set getOutEdgesOf(Node node) {
Set outEdges = ofg.getOutEdgesOf(node)
.stream()
.filter(e -> nodes.contains(e.target()))
.collect(Collectors.toSet());
outEdges.addAll(outWUEdges.get(node));
return outEdges;
}
@Override
public Set getNodes() {
return nodes;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy