pascal.taie.analysis.dataflow.solver.AbstractSolver 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.dataflow.solver;
import pascal.taie.analysis.dataflow.analysis.DataflowAnalysis;
import pascal.taie.analysis.dataflow.fact.DataflowResult;
import pascal.taie.analysis.graph.cfg.CFG;
import pascal.taie.analysis.graph.cfg.CFGNodeIndexer;
import pascal.taie.util.collection.IndexMap;
/**
* Provides common functionalities for {@link Solver}.
*
* @param type of CFG nodes
* @param type of data-flow facts
*/
abstract class AbstractSolver implements Solver {
@Override
public DataflowResult solve(DataflowAnalysis analysis) {
DataflowResult result = initialize(analysis);
doSolve(analysis, result);
return result;
}
/**
* Creates and initializes a new data-flow result for given CFG.
*
* @return the initialized data-flow result
*/
private DataflowResult initialize(DataflowAnalysis analysis) {
CFG cfg = analysis.getCFG();
var indexer = new CFGNodeIndexer<>(cfg);
DataflowResult result = new DataflowResult<>(
new IndexMap<>(indexer, cfg.getNumberOfNodes()),
new IndexMap<>(indexer, cfg.getNumberOfNodes()));
if (analysis.isForward()) {
initializeForward(analysis, result);
} else {
initializeBackward(analysis, result);
}
return result;
}
protected void initializeForward(DataflowAnalysis analysis,
DataflowResult result) {
CFG cfg = analysis.getCFG();
// initialize entry
Node entry = cfg.getEntry();
result.setInFact(entry, analysis.newBoundaryFact());
result.setOutFact(entry, analysis.newBoundaryFact());
cfg.forEach(node -> {
// skip entry which has been initialized
if (cfg.isEntry(node)) {
return;
}
// initialize in & out fact
result.setInFact(node, analysis.newInitialFact());
result.setOutFact(node, analysis.newInitialFact());
});
}
protected void initializeBackward(DataflowAnalysis analysis,
DataflowResult result) {
CFG cfg = analysis.getCFG();
// initialize exit
Node exit = cfg.getExit();
result.setInFact(exit, analysis.newBoundaryFact());
result.setOutFact(exit, analysis.newBoundaryFact());
cfg.forEach(node -> {
// skip exit which has been initialized
if (cfg.isExit(node)) {
return;
}
// initialize in fact
result.setInFact(node, analysis.newInitialFact());
result.setOutFact(node, analysis.newInitialFact());
});
}
/**
* Solves the data-flow problem for given analysis.
*/
private void doSolve(DataflowAnalysis analysis,
DataflowResult result) {
if (analysis.isForward()) {
doSolveForward(analysis, result);
} else {
doSolveBackward(analysis, result);
}
}
protected abstract void doSolveForward(DataflowAnalysis analysis,
DataflowResult result);
protected abstract void doSolveBackward(DataflowAnalysis analysis,
DataflowResult result);
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy