|
ROSE
0.9.6a
|
#include "genericDataflowCommon.h"#include "VirtualCFGIterator.h"#include "cfgUtils.h"#include "CallGraphTraverse.h"#include "analysis.h"#include "divAnalysis.h"#include "printAnalysisStates.h"#include "LogicalCond.h"#include <sstream>#include <iostream>#include <string>#include <functional>#include <queue>#include <list>#include <set>

Go to the source code of this file.
Classes | |
| class | affineInequality |
| class | varAffineInequality |
| class | affineInequalityFact |
| class | affineInequalitiesPlacer |
Functions | |
| void | setTrueFalseIneq (SgExpression *expr, affineInequalityFact **trueIneqFact, affineInequalityFact **falseIneqFact, bool doFalseBranch) |
| void | printAffineInequalities (affineInequalitiesPlacer *aip, std::string indent="") |
| void | runAffineIneqPlacer (bool printStates=false) |
| const std::set < varAffineInequality > & | getAffineIneq (const DataflowNode &n) |
| std::list< std::set < varAffineInequality > > | getAffineIneqDesc (const DataflowNode &n) |
| void setTrueFalseIneq | ( | SgExpression * | expr, |
| affineInequalityFact ** | trueIneqFact, | ||
| affineInequalityFact ** | falseIneqFact, | ||
| bool | doFalseBranch | ||
| ) |
| void printAffineInequalities | ( | affineInequalitiesPlacer * | aip, |
| std::string | indent = "" |
||
| ) |
| void runAffineIneqPlacer | ( | bool | printStates = false) |
| const std::set<varAffineInequality>& getAffineIneq | ( | const DataflowNode & | n) |
| std::list<std::set<varAffineInequality> > getAffineIneqDesc | ( | const DataflowNode & | n) |