Class AbstractCFG

src/main/java/pascal/taie/analysis/graph/cfg/AbstractCFG.java:36–158

import java.util.Set;

abstract class AbstractCFG<N> implements CFG<N> {

    protected final IR ir;

    protected N entry;

    protected N exit;

    protected final Set<N> nodes;

    private final MultiMap<N, CFGEdge<N>> inEdges;

    private final MultiMap<N, CFGEdge<N>> outEdges;

    AbstractCFG(IR ir) {
        this.ir = ir;
        // number of nodes = number of statements in IR + entry + exit
        int nNodes = ir.getStmts().size() + 2;
        nodes = Sets.newSet(nNodes);
        inEdges = Maps.newMultiMap(nNodes);
        outEdges = Maps.newMultiMap(nNodes);
    }

    @Override
    public IR getIR() {
        return ir;
    }

    @Override
    public JMethod getMethod() {
        return ir.getMethod();
    }

    void setEntry(N entry) {
        assert this.entry == null : "CFG entry should be set only once";
        this.entry = entry;
        nodes.add(entry);
    }

    @Override
    public N getEntry() {
        return entry;
    }

    void setExit(N exit) {
        assert this.exit == null : "CFG exit should be set only once";
        this.exit = exit;
        nodes.add(exit);
    }

    @Override
    public N getExit() {
        return exit;
    }

    @Override
    public boolean isEntry(N node) {
        return node == entry;