Compare commits
1 Commits
6907f44ac5
...
private_ar
| Author | SHA1 | Date | |
|---|---|---|---|
| 3eb09fe5cf |
1
.gitignore
vendored
1
.gitignore
vendored
@@ -78,4 +78,3 @@ Sapfor/Sapc++/x64/
|
|||||||
|
|
||||||
Sapfor/out/
|
Sapfor/out/
|
||||||
Sapfor/_bin/*
|
Sapfor/_bin/*
|
||||||
_bin/*
|
|
||||||
|
|||||||
@@ -208,8 +208,6 @@ set(TR_INLINER src/Transformations/FunctionInlining/inliner.cpp
|
|||||||
src/Transformations/FunctionInlining/inliner.h)
|
src/Transformations/FunctionInlining/inliner.h)
|
||||||
set(TR_RENAME_SYMBOLS src/Transformations/RenameSymbols/rename_symbols.cpp
|
set(TR_RENAME_SYMBOLS src/Transformations/RenameSymbols/rename_symbols.cpp
|
||||||
src/Transformations/RenameSymbols/rename_symbols.h)
|
src/Transformations/RenameSymbols/rename_symbols.h)
|
||||||
SET(TR_SWAP_OPERATORS src/Transformations/SwapOperators/swap_operators.cpp
|
|
||||||
src/Transformations/SwapOperators/swap_operators.h)
|
|
||||||
|
|
||||||
set(TRANSFORMS
|
set(TRANSFORMS
|
||||||
${TR_DEAD_CODE}
|
${TR_DEAD_CODE}
|
||||||
@@ -232,8 +230,7 @@ set(TRANSFORMS
|
|||||||
${TR_REPLACE_ARRAYS_IN_IO}
|
${TR_REPLACE_ARRAYS_IN_IO}
|
||||||
${TR_EXPR_TRANSFORM}
|
${TR_EXPR_TRANSFORM}
|
||||||
${TR_INLINER}
|
${TR_INLINER}
|
||||||
${TR_RENAME_SYMBOLS}
|
${TR_RENAME_SYMBOLS})
|
||||||
${TR_SWAP_OPERATORS})
|
|
||||||
|
|
||||||
set(CFG src/CFGraph/IR.cpp
|
set(CFG src/CFGraph/IR.cpp
|
||||||
src/CFGraph/IR.h
|
src/CFGraph/IR.h
|
||||||
@@ -467,7 +464,6 @@ source_group (Transformations\\GlobalVariables FILES ${TR_GV})
|
|||||||
source_group (Transformations\\ConvertToC FILES ${TR_CONV})
|
source_group (Transformations\\ConvertToC FILES ${TR_CONV})
|
||||||
source_group (Transformations\\SetImplicitNone FILES ${TR_IMPLICIT_NONE})
|
source_group (Transformations\\SetImplicitNone FILES ${TR_IMPLICIT_NONE})
|
||||||
source_group (Transformations\\ReplaceArraysInIO FILES ${TR_REPLACE_ARRAYS_IN_IO})
|
source_group (Transformations\\ReplaceArraysInIO FILES ${TR_REPLACE_ARRAYS_IN_IO})
|
||||||
source_group (Transformations\\SwapOperators FILES ${TR_SWAP_OPERATORS})
|
|
||||||
|
|
||||||
|
|
||||||
source_group (CreateIntervals FILES ${CREATE_INTER_T})
|
source_group (CreateIntervals FILES ${CREATE_INTER_T})
|
||||||
|
|||||||
@@ -10,6 +10,7 @@
|
|||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
static SgStatement* declPlace = NULL;
|
static SgStatement* declPlace = NULL;
|
||||||
|
static unordered_set<SgStatement*> changed;;
|
||||||
|
|
||||||
static bool CheckConstIndexes(SgExpression* exp)
|
static bool CheckConstIndexes(SgExpression* exp)
|
||||||
{
|
{
|
||||||
@@ -36,13 +37,13 @@ static bool CheckConstIndexes(SgExpression* exp)
|
|||||||
|
|
||||||
static SgExpression* CreateVar(int& variableNumber, SgType* type)
|
static SgExpression* CreateVar(int& variableNumber, SgType* type)
|
||||||
{
|
{
|
||||||
string varName = "__tmp_prop_var";
|
string varName = "tmp_prop_var";
|
||||||
string name = varName + std::to_string(variableNumber) + "__";
|
string name = varName + std::to_string(variableNumber) + "__";
|
||||||
variableNumber++;
|
variableNumber++;
|
||||||
|
|
||||||
SgSymbol* varSymbol = new SgSymbol(VARIABLE_NAME, name.c_str(), *type, *declPlace->controlParent());
|
SgSymbol* varSymbol = new SgSymbol(VARIABLE_NAME, name.c_str(), *type, *declPlace->controlParent());
|
||||||
|
|
||||||
const string commonBlockName = "__propagation_common__";
|
const string commonBlockName = "propagation_common__";
|
||||||
|
|
||||||
SgStatement* funcStart = declPlace->controlParent();
|
SgStatement* funcStart = declPlace->controlParent();
|
||||||
SgStatement* commonStat = NULL;
|
SgStatement* commonStat = NULL;
|
||||||
@@ -169,8 +170,7 @@ static SgExpression* CreateVar(int& variableNumber, SgType* type)
|
|||||||
|
|
||||||
commonList->setLhs(varList);
|
commonList->setLhs(varList);
|
||||||
}
|
}
|
||||||
|
return new SgExpression(VAR_REF, NULL, NULL, varSymbol, type->copyPtr());
|
||||||
return new SgExpression(VAR_REF, NULL, NULL, varSymbol, type->copyPtr());
|
|
||||||
}
|
}
|
||||||
|
|
||||||
static void TransformRightPart(SgStatement* st, SgExpression* exp, unordered_map<string, SgExpression*>& arrayToVariable, int& variableNumber)
|
static void TransformRightPart(SgStatement* st, SgExpression* exp, unordered_map<string, SgExpression*>& arrayToVariable, int& variableNumber)
|
||||||
@@ -227,6 +227,8 @@ static void TransformLeftPart(SgStatement* st, SgExpression* exp, unordered_map<
|
|||||||
{
|
{
|
||||||
if (exp->symbol()->type()->variant() == T_STRING)
|
if (exp->symbol()->type()->variant() == T_STRING)
|
||||||
return;
|
return;
|
||||||
|
if (changed.find(st) != changed.end())
|
||||||
|
return;
|
||||||
string expUnparsed = exp->unparse();
|
string expUnparsed = exp->unparse();
|
||||||
if (arrayToVariable.find(expUnparsed) == arrayToVariable.end() && exp->symbol()->type()->baseType())
|
if (arrayToVariable.find(expUnparsed) == arrayToVariable.end() && exp->symbol()->type()->baseType())
|
||||||
{
|
{
|
||||||
@@ -234,12 +236,62 @@ static void TransformLeftPart(SgStatement* st, SgExpression* exp, unordered_map<
|
|||||||
}
|
}
|
||||||
SgStatement* newStatement = new SgStatement(ASSIGN_STAT, NULL, NULL, arrayToVariable[expUnparsed]->copyPtr(), st->expr(1)->copyPtr(), NULL);
|
SgStatement* newStatement = new SgStatement(ASSIGN_STAT, NULL, NULL, arrayToVariable[expUnparsed]->copyPtr(), st->expr(1)->copyPtr(), NULL);
|
||||||
|
|
||||||
newStatement->setFileId(st->getFileId());
|
newStatement->setFileId(st->getFileId());
|
||||||
newStatement->setProject(st->getProject());
|
newStatement->setProject(st->getProject());
|
||||||
|
|
||||||
newStatement->setlineNumber(getNextNegativeLineNumber());
|
newStatement->setlineNumber(getNextNegativeLineNumber());
|
||||||
newStatement->setLocalLineNumber(st->lineNumber());
|
newStatement->setLocalLineNumber(st->lineNumber());
|
||||||
st->insertStmtBefore(*newStatement, *st->controlParent());
|
st->insertStmtBefore(*newStatement, *st->controlParent());
|
||||||
|
changed.insert(st);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void TransformBorder(SgStatement* st, SgExpression* exp, unordered_map<string, SgExpression*>& arrayToVariable, int& variableNumber)
|
||||||
|
{
|
||||||
|
SgStatement* firstStatement = declPlace->lexPrev();
|
||||||
|
st = st->lexPrev();
|
||||||
|
string array = exp->unparse();
|
||||||
|
arrayToVariable[array] = CreateVar(variableNumber, exp->symbol()->type()->baseType());
|
||||||
|
while (st != firstStatement)
|
||||||
|
{
|
||||||
|
if (st->variant() == ASSIGN_STAT && arrayToVariable.find(st->expr(0)->unparse()) != arrayToVariable.end())
|
||||||
|
{
|
||||||
|
if (st->expr(1))
|
||||||
|
{
|
||||||
|
TransformRightPart(st, st->expr(1), arrayToVariable, variableNumber);
|
||||||
|
}
|
||||||
|
if (st->expr(0) && st->expr(0)->variant() == ARRAY_REF && CheckConstIndexes(st->expr(0)->lhs()) && arrayToVariable.find(st->expr(0)->unparse()) != arrayToVariable.end())
|
||||||
|
{
|
||||||
|
TransformLeftPart(st, st->expr(0), arrayToVariable, variableNumber);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
st = st->lexPrev();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void CheckVariable(SgStatement* st, SgExpression* exp, unordered_map<string, SgExpression*>& arrayToVariable, int& variableNumber)
|
||||||
|
{
|
||||||
|
SgStatement* firstStatement = declPlace->lexPrev();
|
||||||
|
st = st->lexPrev();
|
||||||
|
string varName = exp->unparse();
|
||||||
|
while (st != firstStatement)
|
||||||
|
{
|
||||||
|
if (st->variant() == ASSIGN_STAT && st->expr(0)->symbol() == exp->symbol())
|
||||||
|
{
|
||||||
|
TransformRightPart(st, st->expr(1), arrayToVariable, variableNumber);
|
||||||
|
}
|
||||||
|
if (st->variant() == ASSIGN_STAT && arrayToVariable.find(st->expr(0)->unparse()) != arrayToVariable.end())
|
||||||
|
{
|
||||||
|
if (st->expr(1))
|
||||||
|
{
|
||||||
|
TransformRightPart(st, st->expr(1), arrayToVariable, variableNumber);
|
||||||
|
}
|
||||||
|
if (st->expr(0) && st->expr(0)->variant() == ARRAY_REF && CheckConstIndexes(st->expr(0)->lhs()) && arrayToVariable.find(st->expr(0)->unparse()) != arrayToVariable.end())
|
||||||
|
{
|
||||||
|
TransformLeftPart(st, st->expr(0), arrayToVariable, variableNumber);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
st = st->lexPrev();
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void ArrayConstantPropagation(SgProject& project)
|
void ArrayConstantPropagation(SgProject& project)
|
||||||
@@ -262,40 +314,29 @@ void ArrayConstantPropagation(SgProject& project)
|
|||||||
|
|
||||||
for (; st != lastNode; st = st->lexNext())
|
for (; st != lastNode; st = st->lexNext())
|
||||||
{
|
{
|
||||||
if (st->variant() == ASSIGN_STAT)
|
if (st->variant() == FOR_NODE)
|
||||||
{
|
|
||||||
if (st->expr(1))
|
|
||||||
{
|
|
||||||
TransformRightPart(st, st->expr(1), arrayToVariable, variableNumber);
|
|
||||||
}
|
|
||||||
if (st->expr(0) && st->expr(0)->variant() == ARRAY_REF && CheckConstIndexes(st->expr(0)->lhs()))
|
|
||||||
{
|
|
||||||
TransformLeftPart(st, st->expr(0), arrayToVariable, variableNumber);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (st->variant() == FOR_NODE)
|
|
||||||
{
|
{
|
||||||
SgExpression* lowerBound = st->expr(0)->lhs();
|
SgExpression* lowerBound = st->expr(0)->lhs();
|
||||||
SgExpression* upperBound = st->expr(0)->rhs();
|
SgExpression* upperBound = st->expr(0)->rhs();
|
||||||
string lowerBoundUnparsed = lowerBound->unparse(), upperBoundUnparsed = upperBound->unparse();
|
string lowerBoundUnparsed = lowerBound->unparse(), upperBoundUnparsed = upperBound->unparse();
|
||||||
if (upperBound->variant() == ARRAY_REF && upperBound->symbol()->type()->baseType() && CheckConstIndexes(upperBound->lhs()))
|
if (upperBound->variant() == ARRAY_REF && upperBound->symbol()->type()->baseType() && CheckConstIndexes(upperBound->lhs()))
|
||||||
{
|
{
|
||||||
if (arrayToVariable.find(upperBoundUnparsed) == arrayToVariable.end())
|
TransformBorder(st, upperBound, arrayToVariable, variableNumber);
|
||||||
{
|
|
||||||
arrayToVariable[upperBoundUnparsed] = CreateVar(variableNumber, upperBound->symbol()->type()->baseType());
|
|
||||||
}
|
|
||||||
st->expr(0)->setRhs(arrayToVariable[upperBoundUnparsed]->copyPtr());
|
st->expr(0)->setRhs(arrayToVariable[upperBoundUnparsed]->copyPtr());
|
||||||
}
|
}
|
||||||
|
else if (upperBound->variant() == VAR_REF)
|
||||||
|
CheckVariable(st, upperBound, arrayToVariable, variableNumber);
|
||||||
|
|
||||||
if (lowerBound->variant() == ARRAY_REF && lowerBound->symbol()->type()->baseType() && CheckConstIndexes(lowerBound->lhs()))
|
if (lowerBound->variant() == ARRAY_REF && lowerBound->symbol()->type()->baseType() && CheckConstIndexes(lowerBound->lhs()))
|
||||||
{
|
{
|
||||||
if (arrayToVariable.find(lowerBoundUnparsed) == arrayToVariable.end())
|
TransformBorder(st, lowerBound, arrayToVariable, variableNumber);
|
||||||
{
|
|
||||||
arrayToVariable[lowerBoundUnparsed] = CreateVar(variableNumber, lowerBound->symbol()->type()->baseType());
|
|
||||||
}
|
|
||||||
st->expr(0)->setLhs(arrayToVariable[lowerBoundUnparsed]->copyPtr());
|
st->expr(0)->setLhs(arrayToVariable[lowerBoundUnparsed]->copyPtr());
|
||||||
}
|
}
|
||||||
|
else if (lowerBound->variant() == VAR_REF)
|
||||||
|
CheckVariable(st, lowerBound, arrayToVariable, variableNumber);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
cout << file->functions(i)->unparse() << endl;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -67,12 +67,14 @@ static void Collapse(Region* region)
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
ArrayAccessingIndexes useUnion;
|
ArrayAccessingIndexes useUnionB;
|
||||||
for (auto& byBlock : region->getBasickBlocks())
|
for (auto& byBlock : region->getBasickBlocks())
|
||||||
for (auto& [arrayName, arrayRanges] : byBlock->array_use)
|
for (auto& [arrayName, _] : byBlock->array_use)
|
||||||
useUnion[arrayName] = useUnion[arrayName].Union(byBlock->array_use[arrayName]);
|
useUnionB[arrayName] = useUnionB[arrayName].Union(byBlock->array_use[arrayName]);
|
||||||
|
|
||||||
|
for (auto& [arrayName, _] : useUnionB)
|
||||||
|
region->array_priv[arrayName] = useUnionB[arrayName].Diff(region->array_use[arrayName]);
|
||||||
|
|
||||||
region->array_priv = region->array_use;
|
|
||||||
|
|
||||||
for (Region* prevBlock : region->getHeader()->getPrevRegions())
|
for (Region* prevBlock : region->getHeader()->getPrevRegions())
|
||||||
prevBlock->replaceInNextRegions(region, region->getHeader());
|
prevBlock->replaceInNextRegions(region, region->getHeader());
|
||||||
|
|||||||
@@ -9,6 +9,7 @@
|
|||||||
#include "range_structures.h"
|
#include "range_structures.h"
|
||||||
#include "region.h"
|
#include "region.h"
|
||||||
|
|
||||||
|
#include "..\Transformations\ExpressionSubstitution\expr_transform.h"
|
||||||
#include "SgUtils.h"
|
#include "SgUtils.h"
|
||||||
|
|
||||||
using namespace std;
|
using namespace std;
|
||||||
@@ -131,7 +132,7 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
|||||||
{
|
{
|
||||||
vector<SAPFOR::Argument*> index_vars;
|
vector<SAPFOR::Argument*> index_vars;
|
||||||
vector<int> refPos;
|
vector<int> refPos;
|
||||||
string array_name = instruction->getInstruction()->getArg1()->getValue();
|
string array_name = instruction->getInstruction()->getArg1()->getValue();
|
||||||
|
|
||||||
int j = i - 1;
|
int j = i - 1;
|
||||||
while (j >= 0 && instructions[j]->getInstruction()->getOperation() == SAPFOR::CFG_OP::REF)
|
while (j >= 0 && instructions[j]->getInstruction()->getOperation() == SAPFOR::CFG_OP::REF)
|
||||||
@@ -148,13 +149,27 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
|||||||
auto* ref = isSgArrayRefExp(instruction->getInstruction()->getExpression());
|
auto* ref = isSgArrayRefExp(instruction->getInstruction()->getExpression());
|
||||||
int fillCount = 0;
|
int fillCount = 0;
|
||||||
|
|
||||||
while (!index_vars.empty() && !refPos.empty())
|
vector<pair<int, int>> coefsForDims;
|
||||||
|
int subs = ref->numberOfSubscripts();
|
||||||
|
for (int i = 0; ref && i < ref->numberOfSubscripts(); ++i)
|
||||||
|
{
|
||||||
|
const vector<int*>& coefs = getAttributes<SgExpression*, int*>(ref->subscript(i), set<int>{ INT_VAL });
|
||||||
|
if (coefs.size() == 1)
|
||||||
|
{
|
||||||
|
const pair<int, int> coef(coefs[0][0], coefs[0][1]);
|
||||||
|
coefsForDims.push_back(coef);
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
coefsForDims = {coefsForDims.rbegin(), coefsForDims.rend()};
|
||||||
|
|
||||||
|
while (!index_vars.empty() && !refPos.empty() && !coefsForDims.empty())
|
||||||
{
|
{
|
||||||
auto var = index_vars.back();
|
auto var = index_vars.back();
|
||||||
int currentVarPos = refPos.back();
|
int currentVarPos = refPos.back();
|
||||||
ArrayDimension current_dim;
|
ArrayDimension current_dim;
|
||||||
if (var->getType() == SAPFOR::CFG_ARG_TYPE::CONST)
|
if (var->getType() == SAPFOR::CFG_ARG_TYPE::CONST)
|
||||||
current_dim = { stoul(var->getValue()), 1, 1, ref};
|
current_dim = { stoul(var->getValue()), 1, 1, ref };
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
string name, full_name = var->getValue();
|
string name, full_name = var->getValue();
|
||||||
@@ -180,7 +195,7 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
|||||||
return -1;
|
return -1;
|
||||||
}
|
}
|
||||||
|
|
||||||
uint64_t start = currentLoop->startVal;
|
uint64_t start = coefsForDims.back().second * currentLoop->startVal + coefsForDims.back().first;
|
||||||
uint64_t step = currentLoop->stepVal;
|
uint64_t step = currentLoop->stepVal;
|
||||||
uint64_t iters = currentLoop->calculatedCountOfIters;
|
uint64_t iters = currentLoop->calculatedCountOfIters;
|
||||||
current_dim = { start, step, iters, ref };
|
current_dim = { start, step, iters, ref };
|
||||||
@@ -193,6 +208,7 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
|||||||
}
|
}
|
||||||
index_vars.pop_back();
|
index_vars.pop_back();
|
||||||
refPos.pop_back();
|
refPos.pop_back();
|
||||||
|
coefsForDims.pop_back();
|
||||||
}
|
}
|
||||||
|
|
||||||
if (fillCount == accessPoint.size())
|
if (fillCount == accessPoint.size())
|
||||||
|
|||||||
@@ -90,7 +90,6 @@
|
|||||||
#include "Transformations/DeadCodeRemoving/dead_code.h"
|
#include "Transformations/DeadCodeRemoving/dead_code.h"
|
||||||
#include "Transformations/RenameSymbols/rename_symbols.h"
|
#include "Transformations/RenameSymbols/rename_symbols.h"
|
||||||
#include "Transformations/FunctionInlining/inliner.h"
|
#include "Transformations/FunctionInlining/inliner.h"
|
||||||
#include "Transformations/SwapOperators/swap_operators.h"
|
|
||||||
|
|
||||||
#include "ProjectParameters/projectParameters.h"
|
#include "ProjectParameters/projectParameters.h"
|
||||||
|
|
||||||
@@ -942,8 +941,6 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
internalExit = err;
|
internalExit = err;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else if (curr_regime == SWAP_OPERATORS)
|
|
||||||
runSwapOperators(file, loopGraph, fullIR, countOfTransform);
|
|
||||||
else if (curr_regime == PRIVATE_REMOVING_ANALYSIS)
|
else if (curr_regime == PRIVATE_REMOVING_ANALYSIS)
|
||||||
{
|
{
|
||||||
auto itFound = loopGraph.find(file->filename());
|
auto itFound = loopGraph.find(file->filename());
|
||||||
@@ -1040,8 +1037,7 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
PRIVATE_REMOVING,
|
PRIVATE_REMOVING,
|
||||||
PRIVATE_ARRAYS_EXPANSION,
|
PRIVATE_ARRAYS_EXPANSION,
|
||||||
PRIVATE_ARRAYS_SHRINKING,
|
PRIVATE_ARRAYS_SHRINKING,
|
||||||
REMOVE_DEAD_CODE,
|
REMOVE_DEAD_CODE };
|
||||||
SWAP_OPERATORS };
|
|
||||||
|
|
||||||
if ((countOfTransform == 0 || internalExit > 0) && applyFor.find(curr_regime) != applyFor.end())
|
if ((countOfTransform == 0 || internalExit > 0) && applyFor.find(curr_regime) != applyFor.end())
|
||||||
{
|
{
|
||||||
@@ -2343,7 +2339,6 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
|||||||
case INSERT_NO_DISTR_FLAGS_FROM_GUI:
|
case INSERT_NO_DISTR_FLAGS_FROM_GUI:
|
||||||
case PRIVATE_REMOVING:
|
case PRIVATE_REMOVING:
|
||||||
case RENAME_INLCUDES:
|
case RENAME_INLCUDES:
|
||||||
case SWAP_OPERATORS:
|
|
||||||
runAnalysis(*project, curr_regime, true, "", folderName);
|
runAnalysis(*project, curr_regime, true, "", folderName);
|
||||||
break;
|
break;
|
||||||
case INLINE_PROCEDURES:
|
case INLINE_PROCEDURES:
|
||||||
|
|||||||
@@ -122,8 +122,6 @@ enum passes {
|
|||||||
CREATE_INTER_TREE,
|
CREATE_INTER_TREE,
|
||||||
INSERT_INTER_TREE,
|
INSERT_INTER_TREE,
|
||||||
|
|
||||||
SWAP_OPERATORS,
|
|
||||||
|
|
||||||
SHADOW_GROUPING,
|
SHADOW_GROUPING,
|
||||||
INLINE_PROCEDURES,
|
INLINE_PROCEDURES,
|
||||||
FILL_PARALLEL_REG_IR,
|
FILL_PARALLEL_REG_IR,
|
||||||
@@ -323,7 +321,6 @@ static void setPassValues()
|
|||||||
passNames[CHECK_PAR_REG_DIR] = "CHECK_PAR_REG_DIR";
|
passNames[CHECK_PAR_REG_DIR] = "CHECK_PAR_REG_DIR";
|
||||||
passNames[CREATE_INTER_TREE] = "CREATE_INTER_TREE";
|
passNames[CREATE_INTER_TREE] = "CREATE_INTER_TREE";
|
||||||
passNames[INSERT_INTER_TREE] = "INSERT_INTER_TREE";
|
passNames[INSERT_INTER_TREE] = "INSERT_INTER_TREE";
|
||||||
passNames[SWAP_OPERATORS] = "SWAP_OPERATORS";
|
|
||||||
passNames[CREATE_PARALLEL_REGIONS] = "CREATE_PARALLEL_REGIONS";
|
passNames[CREATE_PARALLEL_REGIONS] = "CREATE_PARALLEL_REGIONS";
|
||||||
passNames[PRIVATE_REMOVING_ANALYSIS] = "PRIVATE_REMOVING_ANALYSIS";
|
passNames[PRIVATE_REMOVING_ANALYSIS] = "PRIVATE_REMOVING_ANALYSIS";
|
||||||
passNames[PRIVATE_REMOVING] = "PRIVATE_REMOVING";
|
passNames[PRIVATE_REMOVING] = "PRIVATE_REMOVING";
|
||||||
|
|||||||
@@ -1,817 +0,0 @@
|
|||||||
#include <map>
|
|
||||||
#include <unordered_set>
|
|
||||||
#include <vector>
|
|
||||||
#include <queue>
|
|
||||||
#include <iostream>
|
|
||||||
#include <algorithm>
|
|
||||||
|
|
||||||
#include "../../Utils/errors.h"
|
|
||||||
#include "../../Utils/SgUtils.h"
|
|
||||||
#include "../../GraphCall/graph_calls.h"
|
|
||||||
#include "../../GraphCall/graph_calls_func.h"
|
|
||||||
#include "../../CFGraph/CFGraph.h"
|
|
||||||
#include "../../CFGraph/IR.h"
|
|
||||||
#include "../../GraphLoop/graph_loops.h"
|
|
||||||
#include "swap_operators.h"
|
|
||||||
|
|
||||||
using namespace std;
|
|
||||||
|
|
||||||
string getNameByArg(SAPFOR::Argument* arg);
|
|
||||||
|
|
||||||
static vector<SAPFOR::IR_Block*> findInstructionsFromOperator(SgStatement* st, vector<SAPFOR::BasicBlock*> Blocks) {
|
|
||||||
vector<SAPFOR::IR_Block*> result;
|
|
||||||
string filename = st->fileName();
|
|
||||||
|
|
||||||
for (auto& block: Blocks) {
|
|
||||||
vector<SAPFOR::IR_Block*> instructionsInBlock = block->getInstructions();
|
|
||||||
for (auto& instruction: instructionsInBlock) {
|
|
||||||
SgStatement* curOperator = instruction->getInstruction()->getOperator();
|
|
||||||
if (curOperator->lineNumber() == st->lineNumber()) {
|
|
||||||
result.push_back(instruction);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
unordered_set<int> loop_tags = {FOR_NODE};
|
|
||||||
unordered_set<int> control_tags = {IF_NODE, ELSEIF_NODE, DO_WHILE_NODE, WHILE_NODE, LOGIF_NODE};
|
|
||||||
unordered_set<int> control_end_tags = {CONTROL_END};
|
|
||||||
|
|
||||||
struct OperatorInfo {
|
|
||||||
SgStatement* stmt;
|
|
||||||
set<string> usedVars;
|
|
||||||
set<string> definedVars;
|
|
||||||
int lineNumber;
|
|
||||||
bool isMovable;
|
|
||||||
|
|
||||||
OperatorInfo(SgStatement* s) : stmt(s), lineNumber(s->lineNumber()), isMovable(true) {}
|
|
||||||
};
|
|
||||||
|
|
||||||
static bool isStatementEmbedded(SgStatement* stmt, SgStatement* parent) {
|
|
||||||
if (!stmt || !parent || stmt == parent) return false;
|
|
||||||
|
|
||||||
if (parent->variant() == LOGIF_NODE) {
|
|
||||||
if (stmt->lineNumber() == parent->lineNumber()) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* current = parent;
|
|
||||||
SgStatement* lastNode = parent->lastNodeOfStmt();
|
|
||||||
|
|
||||||
while (current && current != lastNode) {
|
|
||||||
if (current == stmt) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (current->isIncludedInStmt(*stmt)) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (parent->isIncludedInStmt(*stmt)) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool isLoopBoundary(SgStatement* stmt) {
|
|
||||||
if (!stmt) return false;
|
|
||||||
|
|
||||||
if (stmt->variant() == FOR_NODE || stmt->variant() == CONTROL_END) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool isPartOfNestedLoop(SgStatement* stmt, SgForStmt* loop) {
|
|
||||||
if (!stmt || !loop) return false;
|
|
||||||
|
|
||||||
SgStatement* loopStart = loop->lexNext();
|
|
||||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
|
||||||
if (!loopStart || !loopEnd) return false;
|
|
||||||
|
|
||||||
if (stmt->lineNumber() < loopStart->lineNumber() || stmt->lineNumber() > loopEnd->lineNumber()) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* current = loopStart;
|
|
||||||
|
|
||||||
while (current && current != loopEnd) {
|
|
||||||
|
|
||||||
if (current->variant() == FOR_NODE && current != loop) {
|
|
||||||
SgForStmt* nestedLoop = (SgForStmt*)current;
|
|
||||||
SgStatement* nestedStart = nestedLoop->lexNext();
|
|
||||||
SgStatement* nestedEnd = nestedLoop->lastNodeOfStmt();
|
|
||||||
|
|
||||||
if (nestedStart && nestedEnd &&
|
|
||||||
stmt->lineNumber() >= nestedStart->lineNumber() &&
|
|
||||||
stmt->lineNumber() <= nestedEnd->lineNumber()) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool canSafelyExtract(SgStatement* stmt, SgForStmt* loop) {
|
|
||||||
if (!stmt || !loop) return false;
|
|
||||||
|
|
||||||
if (isLoopBoundary(stmt)) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (control_tags.find(stmt->variant()) != control_tags.end()) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (isPartOfNestedLoop(stmt, loop)) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* loopStart = loop->lexNext();
|
|
||||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
|
||||||
if (!loopStart || !loopEnd) return false;
|
|
||||||
|
|
||||||
SgStatement* current = loopStart;
|
|
||||||
|
|
||||||
while (current && current != loopEnd) {
|
|
||||||
if (current->variant() == LOGIF_NODE && current->lineNumber() == stmt->lineNumber()) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (control_tags.find(current->variant()) != control_tags.end()) {
|
|
||||||
if (isStatementEmbedded(stmt, current)) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (current == stmt) break;
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
static vector<OperatorInfo> analyzeOperatorsInLoop(SgForStmt* loop, vector<SAPFOR::BasicBlock*> blocks, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR) {
|
|
||||||
vector<OperatorInfo> operators;
|
|
||||||
SgStatement* loopStart = loop->lexNext();
|
|
||||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
|
||||||
|
|
||||||
if (!loopStart || !loopEnd) {
|
|
||||||
return operators;
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* current = loopStart;
|
|
||||||
unordered_set<SgStatement*> visited;
|
|
||||||
|
|
||||||
while (current && current != loopEnd) {
|
|
||||||
|
|
||||||
if (visited.find(current) != visited.end()) {
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
visited.insert(current);
|
|
||||||
|
|
||||||
if (isLoopBoundary(current)) {
|
|
||||||
current = current->lexNext();
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (current->variant() == FOR_NODE && current != loop) {
|
|
||||||
SgStatement* nestedEnd = current->lastNodeOfStmt();
|
|
||||||
if (nestedEnd) {
|
|
||||||
current = nestedEnd->lexNext();
|
|
||||||
} else {
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (isSgExecutableStatement(current)) {
|
|
||||||
if (control_tags.find(current->variant()) != control_tags.end()) {
|
|
||||||
current = current->lexNext();
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
if (current->variant() != ASSIGN_STAT) {
|
|
||||||
current = current->lexNext();
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
OperatorInfo opInfo(current);
|
|
||||||
|
|
||||||
vector<SAPFOR::IR_Block*> irBlocks = findInstructionsFromOperator(current, blocks);
|
|
||||||
for (auto irBlock : irBlocks) {
|
|
||||||
if (!irBlock || !irBlock->getInstruction()) continue;
|
|
||||||
|
|
||||||
SAPFOR::Instruction* instr = irBlock->getInstruction();
|
|
||||||
|
|
||||||
if (instr->getArg1()) {
|
|
||||||
string varName = getNameByArg(instr->getArg1());
|
|
||||||
if (!varName.empty()) {
|
|
||||||
opInfo.usedVars.insert(varName);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (instr->getArg2()) {
|
|
||||||
string varName = getNameByArg(instr->getArg2());
|
|
||||||
if (!varName.empty()) {
|
|
||||||
opInfo.usedVars.insert(varName);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (instr->getResult()) {
|
|
||||||
string varName = getNameByArg(instr->getResult());
|
|
||||||
if (!varName.empty()) {
|
|
||||||
opInfo.definedVars.insert(varName);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
operators.push_back(opInfo);
|
|
||||||
}
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
|
|
||||||
return operators;
|
|
||||||
}
|
|
||||||
|
|
||||||
static map<string, vector<SgStatement*>> findVariableDefinitions(SgForStmt* loop, vector<OperatorInfo>& operators) {
|
|
||||||
map<string, vector<SgStatement*>> varDefinitions;
|
|
||||||
for (auto& op : operators) {
|
|
||||||
for (const string& var : op.definedVars) {
|
|
||||||
varDefinitions[var].push_back(op.stmt);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return varDefinitions;
|
|
||||||
}
|
|
||||||
|
|
||||||
static int calculateDistance(SgStatement* from, SgStatement* to) {
|
|
||||||
if (!from || !to) return INT_MAX;
|
|
||||||
return abs(to->lineNumber() - from->lineNumber());
|
|
||||||
}
|
|
||||||
|
|
||||||
static SgStatement* findBestPosition(SgStatement* operatorStmt, vector<OperatorInfo>& operators, map<string, vector<SgStatement*>>& varDefinitions, SgForStmt* loop) {
|
|
||||||
OperatorInfo* opInfo = nullptr;
|
|
||||||
for (auto& op : operators) {
|
|
||||||
if (op.stmt == operatorStmt) {
|
|
||||||
opInfo = &op;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!opInfo || !opInfo->isMovable) {
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* bestPos = nullptr;
|
|
||||||
int bestLine = -1;
|
|
||||||
|
|
||||||
for (const string& usedVar : opInfo->usedVars) {
|
|
||||||
if (varDefinitions.find(usedVar) != varDefinitions.end()) {
|
|
||||||
for (SgStatement* defStmt : varDefinitions[usedVar]) {
|
|
||||||
if (defStmt->lineNumber() < operatorStmt->lineNumber()) {
|
|
||||||
if (defStmt->controlParent() == operatorStmt->controlParent()) {
|
|
||||||
if (defStmt->lineNumber() > bestLine) {
|
|
||||||
bestLine = defStmt->lineNumber();
|
|
||||||
bestPos = defStmt;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!bestPos) {
|
|
||||||
bool allLoopCarried = true;
|
|
||||||
bool hasAnyDefinition = false;
|
|
||||||
|
|
||||||
for (const string& usedVar : opInfo->usedVars) {
|
|
||||||
if (varDefinitions.find(usedVar) != varDefinitions.end()) {
|
|
||||||
for (SgStatement* defStmt : varDefinitions[usedVar]) {
|
|
||||||
if (defStmt == operatorStmt) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
hasAnyDefinition = true;
|
|
||||||
|
|
||||||
if (defStmt->lineNumber() < operatorStmt->lineNumber() &&
|
|
||||||
defStmt->controlParent() == operatorStmt->controlParent()) {
|
|
||||||
allLoopCarried = false;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (!allLoopCarried) break;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (allLoopCarried || (!hasAnyDefinition && !opInfo->usedVars.empty())) {
|
|
||||||
SgStatement* loopStart = loop->lexNext();
|
|
||||||
return loopStart;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return bestPos;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool canMoveTo(SgStatement* from, SgStatement* to, SgForStmt* loop) {
|
|
||||||
if (!from || !to || from == to) return false;
|
|
||||||
|
|
||||||
SgStatement* loopStart = loop->lexNext();
|
|
||||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
|
||||||
|
|
||||||
if (!loopStart || !loopEnd) return false;
|
|
||||||
|
|
||||||
if (to == loopStart) {
|
|
||||||
SgStatement* fromControlParent = from->controlParent();
|
|
||||||
if (!fromControlParent) fromControlParent = loop;
|
|
||||||
return fromControlParent == loop || fromControlParent == loopStart->controlParent();
|
|
||||||
}
|
|
||||||
|
|
||||||
if (from->lineNumber() < loopStart->lineNumber() || from->lineNumber() > loopEnd->lineNumber()) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
if (to->lineNumber() < loopStart->lineNumber() || to->lineNumber() > loopEnd->lineNumber()) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (to->lineNumber() >= from->lineNumber()) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (from->controlParent() != to->controlParent()) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* current = to->lexNext();
|
|
||||||
while (current && current != from && current != loopEnd) {
|
|
||||||
if (control_tags.find(current->variant()) != control_tags.end()) {
|
|
||||||
SgStatement* controlEnd = current->lastNodeOfStmt();
|
|
||||||
if (controlEnd && from->lineNumber() <= controlEnd->lineNumber()) {
|
|
||||||
if (from->controlParent() == current && to->controlParent() != current) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
static vector<SgStatement*> optimizeOperatorOrder(SgForStmt* loop, vector<OperatorInfo>& operators, map<string, vector<SgStatement*>>& varDefinitions) {
|
|
||||||
vector<SgStatement*> newOrder;
|
|
||||||
for (auto& op : operators) {
|
|
||||||
newOrder.push_back(op.stmt);
|
|
||||||
}
|
|
||||||
|
|
||||||
map<SgStatement*, OperatorInfo*> stmtToOpInfo;
|
|
||||||
for (auto& op : operators) {
|
|
||||||
stmtToOpInfo[op.stmt] = &op;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool changed = true;
|
|
||||||
int iterations = 0;
|
|
||||||
const int MAX_ITERATIONS = 50;
|
|
||||||
|
|
||||||
while (changed && iterations < MAX_ITERATIONS) {
|
|
||||||
changed = false;
|
|
||||||
iterations++;
|
|
||||||
|
|
||||||
for (int i = operators.size() - 1; i >= 0; i--) {
|
|
||||||
if (!operators[i].isMovable) continue;
|
|
||||||
|
|
||||||
SgStatement* stmt = operators[i].stmt;
|
|
||||||
OperatorInfo* opInfo = stmtToOpInfo[stmt];
|
|
||||||
if (!opInfo) continue;
|
|
||||||
|
|
||||||
size_t currentPos = 0;
|
|
||||||
for (size_t j = 0; j < newOrder.size(); j++) {
|
|
||||||
if (newOrder[j] == stmt) {
|
|
||||||
currentPos = j;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* bestPos = findBestPosition(stmt, operators, varDefinitions, loop);
|
|
||||||
|
|
||||||
if (!bestPos) {
|
|
||||||
bool hasDependents = false;
|
|
||||||
for (size_t j = currentPos + 1; j < newOrder.size(); j++) {
|
|
||||||
SgStatement* candidate = newOrder[j];
|
|
||||||
OperatorInfo* candidateOpInfo = stmtToOpInfo[candidate];
|
|
||||||
if (candidateOpInfo) {
|
|
||||||
for (const string& definedVar : opInfo->definedVars) {
|
|
||||||
if (candidateOpInfo->usedVars.find(definedVar) != candidateOpInfo->usedVars.end()) {
|
|
||||||
hasDependents = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (hasDependents) break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t targetPos = 0;
|
|
||||||
bool foundTarget = false;
|
|
||||||
|
|
||||||
if (bestPos == loop->lexNext()) {
|
|
||||||
targetPos = 0;
|
|
||||||
|
|
||||||
for (size_t j = 0; j < currentPos && j < newOrder.size(); j++) {
|
|
||||||
SgStatement* candidate = newOrder[j];
|
|
||||||
OperatorInfo* candidateOpInfo = stmtToOpInfo[candidate];
|
|
||||||
if (candidateOpInfo) {
|
|
||||||
bool usesDefinedVar = false;
|
|
||||||
for (const string& definedVar : opInfo->definedVars) {
|
|
||||||
if (candidateOpInfo->usedVars.find(definedVar) != candidateOpInfo->usedVars.end()) {
|
|
||||||
usesDefinedVar = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (usesDefinedVar) {
|
|
||||||
targetPos = j;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
foundTarget = true;
|
|
||||||
|
|
||||||
if (currentPos != targetPos && canMoveTo(stmt, bestPos, loop)) {
|
|
||||||
newOrder.erase(newOrder.begin() + currentPos);
|
|
||||||
newOrder.insert(newOrder.begin() + targetPos, stmt);
|
|
||||||
changed = true;
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
size_t bestPosIdx = 0;
|
|
||||||
bool foundBestPos = false;
|
|
||||||
for (size_t j = 0; j < newOrder.size(); j++) {
|
|
||||||
if (newOrder[j] == bestPos) {
|
|
||||||
bestPosIdx = j;
|
|
||||||
foundBestPos = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (foundBestPos) {
|
|
||||||
targetPos = bestPosIdx + 1;
|
|
||||||
|
|
||||||
for (size_t j = bestPosIdx + 1; j < currentPos && j < newOrder.size(); j++) {
|
|
||||||
SgStatement* candidate = newOrder[j];
|
|
||||||
OperatorInfo* candidateOpInfo = stmtToOpInfo[candidate];
|
|
||||||
if (candidateOpInfo) {
|
|
||||||
bool definesUsedVar = false;
|
|
||||||
for (const string& usedVar : opInfo->usedVars) {
|
|
||||||
if (candidateOpInfo->definedVars.find(usedVar) != candidateOpInfo->definedVars.end()) {
|
|
||||||
definesUsedVar = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (definesUsedVar) {
|
|
||||||
targetPos = j + 1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
bool wouldBreakDependency = false;
|
|
||||||
for (size_t j = targetPos; j < currentPos && j < newOrder.size(); j++) {
|
|
||||||
SgStatement* candidate = newOrder[j];
|
|
||||||
OperatorInfo* candidateOpInfo = stmtToOpInfo[candidate];
|
|
||||||
if (candidateOpInfo) {
|
|
||||||
for (const string& definedVar : opInfo->definedVars) {
|
|
||||||
if (candidateOpInfo->usedVars.find(definedVar) != candidateOpInfo->usedVars.end()) {
|
|
||||||
wouldBreakDependency = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (wouldBreakDependency) break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!wouldBreakDependency && currentPos > targetPos && canMoveTo(stmt, bestPos, loop)) {
|
|
||||||
newOrder.erase(newOrder.begin() + currentPos);
|
|
||||||
newOrder.insert(newOrder.begin() + targetPos, stmt);
|
|
||||||
changed = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
bool dependencyViolation = true;
|
|
||||||
set<pair<SgStatement*, SgStatement*>> triedPairs;
|
|
||||||
|
|
||||||
while (dependencyViolation) {
|
|
||||||
dependencyViolation = false;
|
|
||||||
triedPairs.clear();
|
|
||||||
|
|
||||||
for (size_t i = 0; i < newOrder.size(); i++) {
|
|
||||||
SgStatement* stmt = newOrder[i];
|
|
||||||
OperatorInfo* opInfo = stmtToOpInfo[stmt];
|
|
||||||
if (!opInfo) continue;
|
|
||||||
|
|
||||||
for (size_t j = 0; j < i; j++) {
|
|
||||||
SgStatement* prevStmt = newOrder[j];
|
|
||||||
OperatorInfo* prevOpInfo = stmtToOpInfo[prevStmt];
|
|
||||||
if (!prevOpInfo) continue;
|
|
||||||
|
|
||||||
pair<SgStatement*, SgStatement*> key = make_pair(stmt, prevStmt);
|
|
||||||
if (triedPairs.find(key) != triedPairs.end()) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool violation = false;
|
|
||||||
for (const string& definedVar : opInfo->definedVars) {
|
|
||||||
if (prevOpInfo->usedVars.find(definedVar) != prevOpInfo->usedVars.end()) {
|
|
||||||
violation = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (violation) {
|
|
||||||
triedPairs.insert(key);
|
|
||||||
|
|
||||||
bool wouldCreateViolation = false;
|
|
||||||
for (size_t k = j; k < i; k++) {
|
|
||||||
SgStatement* betweenStmt = newOrder[k];
|
|
||||||
OperatorInfo* betweenOpInfo = stmtToOpInfo[betweenStmt];
|
|
||||||
if (!betweenOpInfo) continue;
|
|
||||||
|
|
||||||
for (const string& usedVar : opInfo->usedVars) {
|
|
||||||
if (betweenOpInfo->definedVars.find(usedVar) != betweenOpInfo->definedVars.end()) {
|
|
||||||
wouldCreateViolation = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (wouldCreateViolation) break;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!wouldCreateViolation) {
|
|
||||||
newOrder.erase(newOrder.begin() + i);
|
|
||||||
newOrder.insert(newOrder.begin() + j, stmt);
|
|
||||||
dependencyViolation = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (dependencyViolation) break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return newOrder;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool applyOperatorReordering(SgForStmt* loop, vector<SgStatement*>& newOrder) {
|
|
||||||
if (!loop || newOrder.empty()) return false;
|
|
||||||
|
|
||||||
SgStatement* loopStart = loop->lexNext();
|
|
||||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
|
||||||
|
|
||||||
if (!loopStart || !loopEnd) return false;
|
|
||||||
|
|
||||||
vector<SgStatement*> originalOrder;
|
|
||||||
SgStatement* current = loopStart;
|
|
||||||
while (current && current != loopEnd) {
|
|
||||||
if (isSgExecutableStatement(current) && current->variant() == ASSIGN_STAT) {
|
|
||||||
originalOrder.push_back(current);
|
|
||||||
}
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
|
|
||||||
bool orderChanged = false;
|
|
||||||
if (originalOrder.size() == newOrder.size()) {
|
|
||||||
for (size_t i = 0; i < originalOrder.size(); i++) {
|
|
||||||
if (originalOrder[i] != newOrder[i]) {
|
|
||||||
orderChanged = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
orderChanged = true;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!orderChanged) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
vector<SgStatement*> extractedStatements;
|
|
||||||
vector<char*> savedComments;
|
|
||||||
unordered_set<SgStatement*> extractedSet;
|
|
||||||
map<SgStatement*, int> originalLineNumbers;
|
|
||||||
map<SgStatement*, SgStatement*> stmtToExtracted;
|
|
||||||
|
|
||||||
for (SgStatement* stmt : newOrder) {
|
|
||||||
if (stmt && stmt != loop && stmt != loopEnd && extractedSet.find(stmt) == extractedSet.end()) {
|
|
||||||
if (control_tags.find(stmt->variant()) != control_tags.end()) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!canSafelyExtract(stmt, loop)) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool isMoving = false;
|
|
||||||
for (size_t i = 0; i < originalOrder.size(); i++) {
|
|
||||||
if (originalOrder[i] == stmt) {
|
|
||||||
for (size_t j = 0; j < newOrder.size(); j++) {
|
|
||||||
if (newOrder[j] == stmt && i != j) {
|
|
||||||
isMoving = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!isMoving) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
originalLineNumbers[stmt] = stmt->lineNumber();
|
|
||||||
savedComments.push_back(stmt->comments() ? strdup(stmt->comments()) : nullptr);
|
|
||||||
SgStatement* extracted = stmt->extractStmt();
|
|
||||||
if (extracted) {
|
|
||||||
extractedStatements.push_back(extracted);
|
|
||||||
extractedSet.insert(stmt);
|
|
||||||
stmtToExtracted[stmt] = extracted;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
map<SgStatement*, SgStatement*> insertedStatements;
|
|
||||||
|
|
||||||
for (size_t idx = 0; idx < newOrder.size(); idx++) {
|
|
||||||
SgStatement* stmt = newOrder[idx];
|
|
||||||
|
|
||||||
if (extractedSet.find(stmt) != extractedSet.end()) {
|
|
||||||
SgStatement* stmtToInsert = stmtToExtracted[stmt];
|
|
||||||
if (!stmtToInsert) continue;
|
|
||||||
|
|
||||||
SgStatement* insertAfter = loop;
|
|
||||||
|
|
||||||
for (int i = idx - 1; i >= 0; i--) {
|
|
||||||
SgStatement* prevStmt = newOrder[i];
|
|
||||||
|
|
||||||
if (extractedSet.find(prevStmt) != extractedSet.end()) {
|
|
||||||
if (insertedStatements.find(prevStmt) != insertedStatements.end()) {
|
|
||||||
insertAfter = insertedStatements[prevStmt];
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
SgStatement* search = loop->lexNext();
|
|
||||||
while (search && search != loopEnd) {
|
|
||||||
bool skip = false;
|
|
||||||
for (size_t j = idx; j < newOrder.size(); j++) {
|
|
||||||
if (extractedSet.find(newOrder[j]) != extractedSet.end() &&
|
|
||||||
search == newOrder[j]) {
|
|
||||||
skip = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (skip) {
|
|
||||||
search = search->lexNext();
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (search == prevStmt) {
|
|
||||||
insertAfter = search;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
search = search->lexNext();
|
|
||||||
}
|
|
||||||
if (insertAfter != loop) break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t commentIdx = 0;
|
|
||||||
for (size_t i = 0; i < extractedStatements.size(); i++) {
|
|
||||||
if (extractedStatements[i] == stmtToInsert) {
|
|
||||||
commentIdx = i;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (commentIdx < savedComments.size() && savedComments[commentIdx]) {
|
|
||||||
stmtToInsert->setComments(savedComments[commentIdx]);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (originalLineNumbers.find(stmt) != originalLineNumbers.end()) {
|
|
||||||
stmtToInsert->setlineNumber(originalLineNumbers[stmt]);
|
|
||||||
}
|
|
||||||
|
|
||||||
SgStatement* controlParent = stmt->controlParent();
|
|
||||||
if (!controlParent) controlParent = loop;
|
|
||||||
|
|
||||||
insertAfter->insertStmtAfter(*stmtToInsert, *controlParent);
|
|
||||||
insertedStatements[stmt] = stmtToInsert;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for (char* comment : savedComments) {
|
|
||||||
if (comment) {
|
|
||||||
free(comment);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
vector<SAPFOR::BasicBlock*> findFuncBlocksByFuncStatement(SgStatement *st, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR) {
|
|
||||||
vector<SAPFOR::BasicBlock*> result;
|
|
||||||
Statement* forSt = (Statement*)st;
|
|
||||||
for (auto& func: FullIR) {
|
|
||||||
if (func.first -> funcPointer -> getCurrProcessFile() == forSt -> getCurrProcessFile()
|
|
||||||
&& func.first -> funcPointer -> lineNumber() == forSt -> lineNumber())
|
|
||||||
result = func.second;
|
|
||||||
}
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> findAndAnalyzeLoops(SgStatement *st, vector<SAPFOR::BasicBlock*> blocks) {
|
|
||||||
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> result;
|
|
||||||
SgStatement *lastNode = st->lastNodeOfStmt();
|
|
||||||
|
|
||||||
while (st && st != lastNode) {
|
|
||||||
if (loop_tags.find(st -> variant()) != loop_tags.end()) {
|
|
||||||
SgForStmt *forSt = (SgForStmt*)st;
|
|
||||||
SgStatement *loopBody = forSt -> body();
|
|
||||||
SgStatement *lastLoopNode = st->lastNodeOfStmt();
|
|
||||||
unordered_set<int> blocks_nums;
|
|
||||||
|
|
||||||
while (loopBody && loopBody != lastLoopNode) {
|
|
||||||
vector<SAPFOR::IR_Block*> irBlocks = findInstructionsFromOperator(loopBody, blocks);
|
|
||||||
if (!irBlocks.empty()) {
|
|
||||||
SAPFOR::IR_Block* IR = irBlocks.front();
|
|
||||||
if (IR && IR->getBasicBlock()) {
|
|
||||||
if (blocks_nums.find(IR -> getBasicBlock() -> getNumber()) == blocks_nums.end()) {
|
|
||||||
result[forSt].push_back(IR -> getBasicBlock());
|
|
||||||
blocks_nums.insert(IR -> getBasicBlock() -> getNumber());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
loopBody = loopBody -> lexNext();
|
|
||||||
}
|
|
||||||
std::sort(result[forSt].begin(), result[forSt].end());
|
|
||||||
}
|
|
||||||
st = st -> lexNext();
|
|
||||||
}
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void processLoopRecursively(SgForStmt* loop, vector<SAPFOR::BasicBlock*> blocks, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR) {
|
|
||||||
if (!loop) return;
|
|
||||||
|
|
||||||
SgStatement* loopStart = loop->lexNext();
|
|
||||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
|
||||||
if (loopStart && loopEnd) {
|
|
||||||
SgStatement* current = loopStart;
|
|
||||||
while (current && current != loopEnd) {
|
|
||||||
if (current->variant() == FOR_NODE && current != loop) {
|
|
||||||
SgForStmt* nestedLoop = (SgForStmt*)current;
|
|
||||||
processLoopRecursively(nestedLoop, blocks, FullIR);
|
|
||||||
SgStatement* nestedEnd = nestedLoop->lastNodeOfStmt();
|
|
||||||
if (nestedEnd) {
|
|
||||||
current = nestedEnd->lexNext();
|
|
||||||
} else {
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
current = current->lexNext();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
vector<OperatorInfo> operators = analyzeOperatorsInLoop(loop, blocks, FullIR);
|
|
||||||
if (!operators.empty()) {
|
|
||||||
map<string, vector<SgStatement*>> varDefinitions = findVariableDefinitions(loop, operators);
|
|
||||||
vector<SgStatement*> newOrder = optimizeOperatorOrder(loop, operators, varDefinitions);
|
|
||||||
applyOperatorReordering(loop, newOrder);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void runSwapOperators(SgFile *file, std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR, int& countOfTransform) {
|
|
||||||
countOfTransform += 1;
|
|
||||||
|
|
||||||
std::cout << "SWAP_OPERATORS Pass Started" << std::endl;
|
|
||||||
|
|
||||||
const int funcNum = file -> numberOfFunctions();
|
|
||||||
|
|
||||||
for (int i = 0; i < funcNum; ++i) {
|
|
||||||
SgStatement *st = file -> functions(i);
|
|
||||||
|
|
||||||
vector<SAPFOR::BasicBlock*> blocks = findFuncBlocksByFuncStatement(st, FullIR);
|
|
||||||
|
|
||||||
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> loopsMapping = findAndAnalyzeLoops(st, blocks);
|
|
||||||
|
|
||||||
for (pair<SgForStmt*, vector<SAPFOR::BasicBlock*>> loopForAnalyze: loopsMapping) {
|
|
||||||
processLoopRecursively(loopForAnalyze.first, loopForAnalyze.second, FullIR);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
std::cout << "SWAP_OPERATORS Pass Completed" << std::endl;
|
|
||||||
}
|
|
||||||
@@ -1,6 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "../../GraphLoop/graph_loops.h"
|
|
||||||
#include "../../CFGraph/CFGraph.h"
|
|
||||||
|
|
||||||
void runSwapOperators(SgFile *file, std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR, int& countOfTransform);
|
|
||||||
@@ -212,8 +212,6 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
Pass(BUILD_IR) <= Pass(SUBST_EXPR_RD) <= Pass(SUBST_EXPR_RD_AND_UNPARSE);
|
Pass(BUILD_IR) <= Pass(SUBST_EXPR_RD) <= Pass(SUBST_EXPR_RD_AND_UNPARSE);
|
||||||
|
|
||||||
list({BUILD_IR, CALL_GRAPH2}) <= Pass(SWAP_OPERATORS);
|
|
||||||
|
|
||||||
list({ LOOP_ANALYZER_DATA_DIST_S1, SUBST_EXPR_RD } ) <= Pass(PRIVATE_REMOVING_ANALYSIS);
|
list({ LOOP_ANALYZER_DATA_DIST_S1, SUBST_EXPR_RD } ) <= Pass(PRIVATE_REMOVING_ANALYSIS);
|
||||||
list({ PRIVATE_REMOVING_ANALYSIS, REVERT_SUBST_EXPR_RD }) <= Pass(PRIVATE_REMOVING);
|
list({ PRIVATE_REMOVING_ANALYSIS, REVERT_SUBST_EXPR_RD }) <= Pass(PRIVATE_REMOVING);
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user