Compare commits
42 Commits
fdab7096d4
...
private_ar
| Author | SHA1 | Date | |
|---|---|---|---|
| 3eb09fe5cf | |||
| 032cdb9b03 | |||
|
|
a8f8f44ac1 | ||
| 1c39001e28 | |||
| 7802f538e8 | |||
| 93fa183b63 | |||
| a07a701826 | |||
|
|
e99855cdff | ||
| f07bea4980 | |||
|
|
3de06d9261 | ||
| 678c2cf351 | |||
| 40cfd83de5 | |||
|
|
a0cea2df91 | ||
|
|
4b7df86b8a | ||
| 836894fef1 | |||
| 9ac15eec79 | |||
| 03f565f50b | |||
| 47e2b961e2 | |||
|
|
b95b336372 | ||
| f35d7cb4bd | |||
| 54615e34d4 | |||
| 8752f4a139 | |||
| 453105d273 | |||
| cad0a0b217 | |||
| 9c0fd40e7b | |||
| c7a31c8bbb | |||
|
|
9900929349 | ||
|
|
e1ba299159 | ||
|
|
8de18d1788 | ||
| 06aabdbee6 | |||
|
|
c6f290bb56 | ||
| 49d3b9b96e | |||
| 280beb13cc | |||
| 3bc9351641 | |||
| 16b2c6b42b | |||
| fe31df0ef2 | |||
|
|
4c8681bfe2 | ||
|
|
d330a6ee23 | ||
|
|
b439759e9b | ||
| b11973cb64 | |||
|
|
df9a9a30bb | ||
|
|
2cd02c295f |
@@ -163,6 +163,10 @@ set(PARALLEL_REG src/ParallelizationRegions/ParRegions.cpp
|
||||
src/ParallelizationRegions/resolve_par_reg_conflicts.cpp
|
||||
src/ParallelizationRegions/resolve_par_reg_conflicts.h)
|
||||
|
||||
set(ARRAY_PROP src/ArrayConstantPropagation/propagation.cpp
|
||||
src/ArrayConstantPropagation/propagation.h
|
||||
)
|
||||
|
||||
set(TR_DEAD_CODE src/Transformations/DeadCodeRemoving/dead_code.cpp
|
||||
src/Transformations/DeadCodeRemoving/dead_code.h)
|
||||
set(TR_CP src/Transformations/CheckPoints/checkpoints.cpp
|
||||
@@ -420,6 +424,7 @@ set(SOURCE_EXE
|
||||
${TRANSFORMS}
|
||||
${PARALLEL_REG}
|
||||
${PRIV}
|
||||
${ARRAY_PROP}
|
||||
${FDVM}
|
||||
${OMEGA}
|
||||
${UTILS}
|
||||
@@ -471,6 +476,7 @@ source_group (GraphLoop FILES ${GR_LOOP})
|
||||
source_group (LoopAnalyzer FILES ${LOOP_ANALYZER})
|
||||
source_group (ParallelizationRegions FILES ${PARALLEL_REG})
|
||||
source_group (PrivateAnalyzer FILES ${PRIV})
|
||||
source_group (ArrayConstantPropagation FILES ${ARRAY_PROP})
|
||||
source_group (FDVM_Compiler FILES ${FDVM})
|
||||
source_group (SageExtension FILES ${OMEGA})
|
||||
source_group (Utils FILES ${UTILS})
|
||||
@@ -496,7 +502,9 @@ else()
|
||||
else()
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
|
||||
endif()
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O2")
|
||||
if(NOT CMAKE_BUILD_TYPE)
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O3")
|
||||
endif()
|
||||
endif()
|
||||
|
||||
add_subdirectory(projects/Fdvm)
|
||||
|
||||
Submodule projects/dvm updated: 3a567d7582...4d4041a081
342
src/ArrayConstantPropagation/propagation.cpp
Normal file
342
src/ArrayConstantPropagation/propagation.cpp
Normal file
@@ -0,0 +1,342 @@
|
||||
#include "propagation.h"
|
||||
|
||||
#include "../Utils/SgUtils.h"
|
||||
|
||||
#include <iostream>
|
||||
#include <unordered_map>
|
||||
#include <unordered_set>
|
||||
#include <vector>
|
||||
|
||||
using namespace std;
|
||||
|
||||
static SgStatement* declPlace = NULL;
|
||||
static unordered_set<SgStatement*> changed;;
|
||||
|
||||
static bool CheckConstIndexes(SgExpression* exp)
|
||||
{
|
||||
if (!exp)
|
||||
{
|
||||
return true;
|
||||
}
|
||||
SgExpression* lhs = exp->lhs();
|
||||
SgExpression* rhs = exp->rhs();
|
||||
do
|
||||
{
|
||||
if (lhs->variant() != INT_VAL)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
if (rhs)
|
||||
{
|
||||
lhs = rhs->lhs();
|
||||
rhs = rhs->rhs();
|
||||
}
|
||||
} while (rhs);
|
||||
return true;
|
||||
}
|
||||
|
||||
static SgExpression* CreateVar(int& variableNumber, SgType* type)
|
||||
{
|
||||
string varName = "tmp_prop_var";
|
||||
string name = varName + std::to_string(variableNumber) + "__";
|
||||
variableNumber++;
|
||||
|
||||
SgSymbol* varSymbol = new SgSymbol(VARIABLE_NAME, name.c_str(), *type, *declPlace->controlParent());
|
||||
|
||||
const string commonBlockName = "propagation_common__";
|
||||
|
||||
SgStatement* funcStart = declPlace->controlParent();
|
||||
SgStatement* commonStat = NULL;
|
||||
SgExpression* commonList = NULL;
|
||||
|
||||
SgStatement* funcEnd = funcStart->lastNodeOfStmt();
|
||||
SgStatement* current = funcStart->lexNext();
|
||||
|
||||
while (current != funcEnd && current)
|
||||
{
|
||||
if (current->variant() == COMM_STAT)
|
||||
{
|
||||
for (SgExpression* exp = current->expr(0); exp; exp = exp->rhs())
|
||||
{
|
||||
if (exp->variant() == COMM_LIST)
|
||||
{
|
||||
string existingName = exp->symbol() ?
|
||||
string(exp->symbol()->identifier()) :
|
||||
string("spf_unnamed");
|
||||
if (existingName == commonBlockName)
|
||||
{
|
||||
commonStat = current;
|
||||
commonList = exp;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (commonStat)
|
||||
break;
|
||||
}
|
||||
current = current->lexNext();
|
||||
}
|
||||
|
||||
vector<SgExpression*> varRefs;
|
||||
if (commonList)
|
||||
{
|
||||
SgExpression* varList = commonList->lhs();
|
||||
if (varList)
|
||||
{
|
||||
auto extractSymbol = [](SgExpression* exp) -> SgSymbol* {
|
||||
if (!exp)
|
||||
return NULL;
|
||||
if (exp->symbol())
|
||||
return exp->symbol();
|
||||
if (exp->lhs() && exp->lhs()->symbol())
|
||||
return exp->lhs()->symbol();
|
||||
return NULL;
|
||||
};
|
||||
if (varList->variant() == EXPR_LIST)
|
||||
{
|
||||
for (SgExpression* exp = varList; exp; exp = exp->rhs())
|
||||
{
|
||||
SgExpression* varExp = exp->lhs();
|
||||
SgSymbol* sym = extractSymbol(varExp);
|
||||
if (sym)
|
||||
{
|
||||
varRefs.push_back(new SgVarRefExp(sym));
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
for (SgExpression* varExp = varList; varExp; varExp = varExp->rhs())
|
||||
{
|
||||
SgSymbol* sym = extractSymbol(varExp);
|
||||
if (sym)
|
||||
{
|
||||
varRefs.push_back(new SgVarRefExp(sym));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (!commonList)
|
||||
{
|
||||
current = funcStart->lexNext();
|
||||
while (current != funcEnd && current)
|
||||
{
|
||||
if (current->variant() == COMM_STAT)
|
||||
{
|
||||
commonStat = current;
|
||||
break;
|
||||
}
|
||||
current = current->lexNext();
|
||||
}
|
||||
|
||||
SgSymbol* commonSymbol = new SgSymbol(COMMON_NAME, commonBlockName.c_str());
|
||||
commonList = new SgExpression(COMM_LIST, NULL, NULL, commonSymbol);
|
||||
|
||||
if (commonStat)
|
||||
{
|
||||
SgExpression* lastCommList = commonStat->expr(0);
|
||||
if (lastCommList)
|
||||
{
|
||||
while (lastCommList->rhs())
|
||||
lastCommList = lastCommList->rhs();
|
||||
lastCommList->setRhs(commonList);
|
||||
}
|
||||
else
|
||||
{
|
||||
commonStat->setExpression(0, commonList);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
commonStat = new SgStatement(COMM_STAT);
|
||||
commonStat->setFileName(declPlace->fileName());
|
||||
commonStat->setFileId(declPlace->getFileId());
|
||||
commonStat->setProject(declPlace->getProject());
|
||||
commonStat->setlineNumber(getNextNegativeLineNumber());
|
||||
commonStat->setExpression(0, commonList);
|
||||
|
||||
declPlace->insertStmtBefore(*commonStat, *declPlace->controlParent());
|
||||
}
|
||||
|
||||
}
|
||||
varRefs.push_back(new SgVarRefExp(varSymbol));
|
||||
|
||||
if (varRefs.size() > 0)
|
||||
{
|
||||
std::reverse(varRefs.begin(), varRefs.end());
|
||||
SgExpression* varList = makeExprList(varRefs, false);
|
||||
|
||||
commonList->setLhs(varList);
|
||||
}
|
||||
return new SgExpression(VAR_REF, NULL, NULL, varSymbol, type->copyPtr());
|
||||
}
|
||||
|
||||
static void TransformRightPart(SgStatement* st, SgExpression* exp, unordered_map<string, SgExpression*>& arrayToVariable, int& variableNumber)
|
||||
{
|
||||
if (!exp)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
vector<SgExpression*> subnodes = { exp->lhs(), exp->rhs() };
|
||||
|
||||
string expUnparsed;
|
||||
SgExpression* toAdd = NULL;
|
||||
if (exp->variant() == ARRAY_REF && CheckConstIndexes(exp->lhs()))
|
||||
{
|
||||
cout << st->unparse() << endl;
|
||||
if (arrayToVariable.find(expUnparsed) == arrayToVariable.end() && exp->symbol()->type()->baseType())
|
||||
{
|
||||
arrayToVariable[expUnparsed] = CreateVar(variableNumber, exp->symbol()->type()->baseType());
|
||||
}
|
||||
st->setExpression(1, arrayToVariable[expUnparsed]->copyPtr());
|
||||
return;
|
||||
}
|
||||
for (int i = 0; i < 2; i++)
|
||||
{
|
||||
if (subnodes[i] && subnodes[i]->variant() == ARRAY_REF && subnodes[i]->symbol()->type()->baseType() && CheckConstIndexes(subnodes[i]->lhs()))
|
||||
{
|
||||
expUnparsed = subnodes[i]->unparse();
|
||||
if (arrayToVariable.find(expUnparsed) == arrayToVariable.end())
|
||||
{
|
||||
arrayToVariable[expUnparsed] = CreateVar(variableNumber, subnodes[i]->symbol()->type()->baseType());;
|
||||
}
|
||||
toAdd = arrayToVariable[expUnparsed]->copyPtr();
|
||||
if (toAdd)
|
||||
{
|
||||
if (i == 0)
|
||||
{
|
||||
exp->setLhs(toAdd);
|
||||
}
|
||||
else
|
||||
{
|
||||
exp->setRhs(toAdd);
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
TransformRightPart(st, subnodes[i], arrayToVariable, variableNumber);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void TransformLeftPart(SgStatement* st, SgExpression* exp, unordered_map<string, SgExpression*>& arrayToVariable, int& variableNumber)
|
||||
{
|
||||
if (exp->symbol()->type()->variant() == T_STRING)
|
||||
return;
|
||||
if (changed.find(st) != changed.end())
|
||||
return;
|
||||
string expUnparsed = exp->unparse();
|
||||
if (arrayToVariable.find(expUnparsed) == arrayToVariable.end() && exp->symbol()->type()->baseType())
|
||||
{
|
||||
arrayToVariable[expUnparsed] = CreateVar(variableNumber, exp->symbol()->type()->baseType());
|
||||
}
|
||||
SgStatement* newStatement = new SgStatement(ASSIGN_STAT, NULL, NULL, arrayToVariable[expUnparsed]->copyPtr(), st->expr(1)->copyPtr(), NULL);
|
||||
|
||||
newStatement->setFileId(st->getFileId());
|
||||
newStatement->setProject(st->getProject());
|
||||
|
||||
newStatement->setlineNumber(getNextNegativeLineNumber());
|
||||
newStatement->setLocalLineNumber(st->lineNumber());
|
||||
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)
|
||||
{
|
||||
unordered_map<string, SgExpression*> arrayToVariable;
|
||||
int variableNumber = 0;
|
||||
for (int i = 0; i < project.numberOfFiles(); i++)
|
||||
{
|
||||
SgFile* file = &(project.file(i));
|
||||
|
||||
if (!file)
|
||||
continue;
|
||||
|
||||
const int funcNum = file->numberOfFunctions();
|
||||
for (int i = 0; i < funcNum; ++i)
|
||||
{
|
||||
SgStatement* st = file->functions(i);
|
||||
declPlace = st->lexNext();
|
||||
SgStatement* lastNode = st->lastNodeOfStmt();
|
||||
|
||||
for (; st != lastNode; st = st->lexNext())
|
||||
{
|
||||
if (st->variant() == FOR_NODE)
|
||||
{
|
||||
SgExpression* lowerBound = st->expr(0)->lhs();
|
||||
SgExpression* upperBound = st->expr(0)->rhs();
|
||||
string lowerBoundUnparsed = lowerBound->unparse(), upperBoundUnparsed = upperBound->unparse();
|
||||
if (upperBound->variant() == ARRAY_REF && upperBound->symbol()->type()->baseType() && CheckConstIndexes(upperBound->lhs()))
|
||||
{
|
||||
TransformBorder(st, upperBound, arrayToVariable, variableNumber);
|
||||
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()))
|
||||
{
|
||||
TransformBorder(st, lowerBound, arrayToVariable, variableNumber);
|
||||
st->expr(0)->setLhs(arrayToVariable[lowerBoundUnparsed]->copyPtr());
|
||||
}
|
||||
else if (lowerBound->variant() == VAR_REF)
|
||||
CheckVariable(st, lowerBound, arrayToVariable, variableNumber);
|
||||
}
|
||||
}
|
||||
cout << file->functions(i)->unparse() << endl;
|
||||
}
|
||||
}
|
||||
}
|
||||
4
src/ArrayConstantPropagation/propagation.h
Normal file
4
src/ArrayConstantPropagation/propagation.h
Normal file
@@ -0,0 +1,4 @@
|
||||
#pragma once
|
||||
#include "../Utils/SgUtils.h"
|
||||
|
||||
void ArrayConstantPropagation(SgProject& project);
|
||||
@@ -15,7 +15,7 @@
|
||||
#include "SgUtils.h"
|
||||
#include "expr_transform.h"
|
||||
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
#include "shadow.h"
|
||||
#include "dvm.h"
|
||||
|
||||
@@ -241,13 +241,15 @@ static void findArrayRefs (SgExpression* ex, SgStatement* st, string fName, int
|
||||
itNew->second.first->SetRegionPlace(reg);
|
||||
|
||||
const auto oldVal = itNew->second.first->GetDistributeFlagVal();
|
||||
bool isarrayInModule = (itNew->second.first->GetLocation().first == DIST::l_MODULE);
|
||||
bool isArrayInModule = (itNew->second.first->GetLocation().first == DIST::l_MODULE);
|
||||
|
||||
if (oldVal == DIST::DISTR || oldVal == DIST::NO_DISTR)
|
||||
{
|
||||
if (itNew->second.first->IsOmpThreadPrivate())
|
||||
itNew->second.first->SetDistributeFlag(DIST::SPF_PRIV);
|
||||
else if (privates.find(symb->identifier()) != privates.end() || isarrayInModule)
|
||||
else if (deprecatedByIO.find(symb->identifier()) != deprecatedByIO.end())
|
||||
itNew->second.first->SetDistributeFlag(DIST::IO_PRIV);
|
||||
else if (isArrayInModule || privates.find(symb->identifier()) != privates.end())
|
||||
{
|
||||
//check in module
|
||||
if (itNew->second.first->GetLocation().first == DIST::l_MODULE)
|
||||
@@ -274,8 +276,6 @@ static void findArrayRefs (SgExpression* ex, SgStatement* st, string fName, int
|
||||
else
|
||||
itNew->second.first->SetDistributeFlag(DIST::SPF_PRIV);
|
||||
}
|
||||
else if (deprecatedByIO.find(symb->identifier()) != deprecatedByIO.end())
|
||||
itNew->second.first->SetDistributeFlag(DIST::IO_PRIV);
|
||||
else if (isSgConstantSymb(symb) || inDataStat)
|
||||
itNew->second.first->SetDistributeFlag(DIST::SPF_PRIV);
|
||||
else
|
||||
|
||||
@@ -274,7 +274,7 @@ static void convertTrees(const map<DIST::Array*, int> &treesIn, map<int, vector<
|
||||
static DIST::Array* findBestInEqual(vector<DIST::Array*> &arrays, DIST::GraphCSR<int, double, attrType> &reducedG, DIST::Arrays<int> &allArrays)
|
||||
{
|
||||
DIST::Array *retVal = NULL;
|
||||
vector<vector<attrType>> coefsByDims;
|
||||
vector<vector<attrType>> coeffsByDims;
|
||||
for (auto &array : arrays)
|
||||
{
|
||||
vector<int> verts;
|
||||
@@ -285,7 +285,7 @@ static DIST::Array* findBestInEqual(vector<DIST::Array*> &arrays, DIST::GraphCSR
|
||||
{
|
||||
retVal = array;
|
||||
for (auto &V : verts)
|
||||
coefsByDims.push_back(reducedG.GetAllAttributes(V));
|
||||
coeffsByDims.push_back(reducedG.GetAllAttributes(V));
|
||||
}
|
||||
else
|
||||
{
|
||||
@@ -294,11 +294,11 @@ static DIST::Array* findBestInEqual(vector<DIST::Array*> &arrays, DIST::GraphCSR
|
||||
toCmp.push_back(reducedG.GetAllAttributes(V));
|
||||
for (int z = 0; z < toCmp.size(); ++z)
|
||||
{
|
||||
if (toCmp[z].size() && coefsByDims[z].size())
|
||||
if (toCmp[z].size() && coeffsByDims[z].size())
|
||||
{
|
||||
if (toCmp[z].back().first.first > coefsByDims[z].back().first.first)
|
||||
if (toCmp[z].back().first.first > coeffsByDims[z].back().first.first)
|
||||
{
|
||||
coefsByDims = toCmp;
|
||||
coeffsByDims = toCmp;
|
||||
retVal = array;
|
||||
break;
|
||||
}
|
||||
|
||||
@@ -45,10 +45,10 @@ static bool findArrayRefAndCheck(SgExpression *ex, const DIST::Array* currArray,
|
||||
int countOfShadows = 0;
|
||||
for (int i = 0; i < ref->numberOfSubscripts(); ++i)
|
||||
{
|
||||
const vector<int*> &coefs = getAttributes<SgExpression*, int*>(ref->subscript(i), set<int>{ INT_VAL });
|
||||
if (coefs.size() == 1)
|
||||
const vector<int*> &coeffs = getAttributes<SgExpression*, int*>(ref->subscript(i), set<int>{ INT_VAL });
|
||||
if (coeffs.size() == 1)
|
||||
{
|
||||
const pair<int, int> coef(coefs[0][0], coefs[0][1]);
|
||||
const pair<int, int> coef(coeffs[0][0], coeffs[0][1]);
|
||||
auto it = shiftsByAccess[i].find(coef);
|
||||
if (it != shiftsByAccess[i].end())
|
||||
if (it->second != 0)
|
||||
|
||||
@@ -364,11 +364,11 @@ static inline string calculateShifts(DIST::GraphCSR<int, double, attrType> &redu
|
||||
{
|
||||
if (sharedMemoryParallelization)
|
||||
{
|
||||
for (auto& coefs : currReadOp->first[k].coefficients)
|
||||
for (auto& coeffs : currReadOp->first[k].coefficients)
|
||||
{
|
||||
auto currAccess = coefs.first;
|
||||
auto currAccess = coeffs.first;
|
||||
|
||||
const int currShift = coefs.first.second;
|
||||
const int currShift = coeffs.first.second;
|
||||
|
||||
auto itFound = shiftsByAccess[k].find(currAccess);
|
||||
if (itFound == shiftsByAccess[k].end())
|
||||
@@ -393,9 +393,9 @@ static inline string calculateShifts(DIST::GraphCSR<int, double, attrType> &redu
|
||||
int minShift = 9999999;
|
||||
int maxShift = -9999999;
|
||||
|
||||
for (auto &coefs : currReadOp->first[k].coefficients)
|
||||
for (auto &coeffs : currReadOp->first[k].coefficients)
|
||||
{
|
||||
auto currAccess = coefs.first;
|
||||
auto currAccess = coeffs.first;
|
||||
auto result = DIST::Fx(currAccess, currRuleShadow);
|
||||
|
||||
if (result.first == loopRule.first)
|
||||
@@ -417,7 +417,7 @@ static inline string calculateShifts(DIST::GraphCSR<int, double, attrType> &redu
|
||||
auto it = remoteRegularReads.find(calcForArray);
|
||||
if (it == remoteRegularReads.end())
|
||||
it = remoteRegularReads.insert(it, make_pair(calcForArray, vector<ArrayOp>(calcForArray->GetDimSize())));
|
||||
it->second[k].coefficients.insert(coefs);
|
||||
it->second[k].coefficients.insert(coeffs);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -14,7 +14,7 @@
|
||||
#include "dvm.h"
|
||||
#include "graph_calls_func.h"
|
||||
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "graph_loops_func.h"
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "SgUtils.h"
|
||||
|
||||
@@ -1137,9 +1137,9 @@ static bool isMapped(const vector<ArrayOp> &allOps)
|
||||
bool mapped = false;
|
||||
for (auto &ops : allOps)
|
||||
{
|
||||
for (auto &coefs : ops.coefficients)
|
||||
for (auto &coeffs : ops.coefficients)
|
||||
{
|
||||
if (coefs.first.first != 0)
|
||||
if (coeffs.first.first != 0)
|
||||
{
|
||||
mapped = true;
|
||||
break;
|
||||
|
||||
@@ -247,7 +247,7 @@ static vector<int> matchSubscriptToLoopSymbols(const vector<SgForStmt*> &parentL
|
||||
}
|
||||
}
|
||||
|
||||
pair<int, int> coefs = pair<int, int>(0, 0);
|
||||
pair<int, int> coeffs = pair<int, int>(0, 0);
|
||||
// more than one loop symbol in subscription
|
||||
if (countOfSymbols > 1)
|
||||
{
|
||||
@@ -326,16 +326,16 @@ static vector<int> matchSubscriptToLoopSymbols(const vector<SgForStmt*> &parentL
|
||||
{
|
||||
if (subscr->symbol()->id() == (parentLoops[position]->doName())->id())
|
||||
{
|
||||
coefs.first = 1;
|
||||
coeffs.first = 1;
|
||||
needToCacl = false;
|
||||
}
|
||||
}
|
||||
|
||||
if (needToCacl)
|
||||
getCoefsOfSubscript(coefs, subscr, parentLoops[position]->doName());
|
||||
__spf_print(PRINT_ARRAY_ARCS, " <%d %d> ", coefs.first, coefs.second);
|
||||
getCoefsOfSubscript(coeffs, subscr, parentLoops[position]->doName());
|
||||
__spf_print(PRINT_ARRAY_ARCS, " <%d %d> ", coeffs.first, coeffs.second);
|
||||
|
||||
if (coefs.first == 0) // && coefs.second == 0)
|
||||
if (coeffs.first == 0) // && coeffs.second == 0)
|
||||
{
|
||||
if (currRegime == REMOTE_ACC)
|
||||
{
|
||||
@@ -346,7 +346,7 @@ static vector<int> matchSubscriptToLoopSymbols(const vector<SgForStmt*> &parentL
|
||||
{
|
||||
const pair<bool, string> &arrayRefString = constructArrayRefForPrint(arrayRef, dimNum, origSubscr);
|
||||
__spf_print(1, "WARN: can not calculate index expression for array ref '%s' at line %d\n", arrayRefString.second.c_str(), currLine);
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coefs, UNREC_OP, numOfSubscriptions, currentW);
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coeffs, UNREC_OP, numOfSubscriptions, currentW);
|
||||
if (side == LEFT)
|
||||
allPositions.clear();
|
||||
|
||||
@@ -371,19 +371,19 @@ static vector<int> matchSubscriptToLoopSymbols(const vector<SgForStmt*> &parentL
|
||||
currOp.resize(numOfSubscriptions);
|
||||
|
||||
//add only uniq
|
||||
auto itAdd = currOp[dimNum].coefficients.find(coefs);
|
||||
auto itAdd = currOp[dimNum].coefficients.find(coeffs);
|
||||
if (itAdd == currOp[dimNum].coefficients.end())
|
||||
itAdd = currOp[dimNum].coefficients.insert(itAdd, make_pair(coefs, currentW));
|
||||
itAdd = currOp[dimNum].coefficients.insert(itAdd, make_pair(coeffs, currentW));
|
||||
}
|
||||
|
||||
if (coefs.first < 0)
|
||||
if (coeffs.first < 0)
|
||||
addInfoToMap(loopInfo, parentLoops[position], currOrigArrayS, arrayRef, dimNum, REMOTE_TRUE, currLine, numOfSubscriptions);
|
||||
else
|
||||
//if we found regular access to array - set it false
|
||||
addInfoToMap(loopInfo, parentLoops[position], currOrigArrayS, arrayRef, dimNum, REMOTE_FALSE, currLine, numOfSubscriptions);
|
||||
}
|
||||
|
||||
if (coefs.first < 0 && sharedMemoryParallelization == 0)
|
||||
if (coeffs.first < 0 && sharedMemoryParallelization == 0)
|
||||
{
|
||||
if (currRegime == DATA_DISTR)
|
||||
{
|
||||
@@ -402,15 +402,15 @@ static vector<int> matchSubscriptToLoopSymbols(const vector<SgForStmt*> &parentL
|
||||
if (side == LEFT)
|
||||
allPositions.clear();
|
||||
else
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coefs, UNREC_OP, numOfSubscriptions, currentW);
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coeffs, UNREC_OP, numOfSubscriptions, currentW);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if (side == LEFT)
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coefs, WRITE_OP, numOfSubscriptions, currentW);
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coeffs, WRITE_OP, numOfSubscriptions, currentW);
|
||||
else
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coefs, READ_OP, numOfSubscriptions, currentW);
|
||||
addInfoToVectors(loopInfo, parentLoops[position], currOrigArrayS, dimNum, coeffs, READ_OP, numOfSubscriptions, currentW);
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -418,13 +418,13 @@ static vector<int> matchSubscriptToLoopSymbols(const vector<SgForStmt*> &parentL
|
||||
if (currRegime == ARRAY_ACC_CORNER)
|
||||
{
|
||||
int *valueSubs = new int[2];
|
||||
valueSubs[0] = coefs.first;
|
||||
valueSubs[1] = coefs.second;
|
||||
valueSubs[0] = coeffs.first;
|
||||
valueSubs[1] = coeffs.second;
|
||||
#ifdef __SPF
|
||||
addToCollection(__LINE__, __FILE__, valueSubs, 2);
|
||||
#endif
|
||||
const vector<int*> &coefs = getAttributes<SgExpression*, int*>(subscr, set<int>{ INT_VAL });
|
||||
if (coefs.size() == 0)
|
||||
const vector<int*> &coeffs = getAttributes<SgExpression*, int*>(subscr, set<int>{ INT_VAL });
|
||||
if (coeffs.size() == 0)
|
||||
{
|
||||
subscr->addAttribute(INT_VAL, valueSubs, sizeof(int*));
|
||||
if (position != -1 && allPositions.size() == 1 && position < parentLoops.size())
|
||||
|
||||
@@ -22,7 +22,7 @@
|
||||
#include "graph_loops_func.h"
|
||||
#include "expr_transform.h"
|
||||
#include "../LoopAnalyzer/loop_analyzer.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
#include "json.hpp"
|
||||
|
||||
@@ -326,7 +326,7 @@ static json parseAlign(const map<DIST::Array*, int>& byPos, SgSymbol* srcArr, Sg
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
vector<pair<int, int>> coefs(srcSymbs.size());
|
||||
vector<pair<int, int>> coeffs(srcSymbs.size());
|
||||
list = listTgt;
|
||||
while (list)
|
||||
{
|
||||
@@ -337,8 +337,8 @@ static json parseAlign(const map<DIST::Array*, int>& byPos, SgSymbol* srcArr, Sg
|
||||
has = recSymbolFind(exp, srcSymbs[z].first, VAR_REF);
|
||||
if (has)
|
||||
{
|
||||
getCoefsOfSubscript(coefs[z], exp, srcSymbs[z].second);
|
||||
if (coefs[z].first == 0)
|
||||
getCoefsOfSubscript(coeffs[z], exp, srcSymbs[z].second);
|
||||
if (coeffs[z].first == 0)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
break;
|
||||
}
|
||||
@@ -346,14 +346,14 @@ static json parseAlign(const map<DIST::Array*, int>& byPos, SgSymbol* srcArr, Sg
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
for (int z = 0; z < coefs.size(); ++z)
|
||||
for (int z = 0; z < coeffs.size(); ++z)
|
||||
{
|
||||
if (coefs[z].first == 0)
|
||||
if (coeffs[z].first == 0)
|
||||
continue;
|
||||
if (coefs[z].second)
|
||||
align["rules"].push_back({ z, coefs[z].first });
|
||||
if (coeffs[z].second)
|
||||
align["rules"].push_back({ z, coeffs[z].first });
|
||||
else
|
||||
align["rules"].push_back({ z, coefs[z].first, coefs[z].second });
|
||||
align["rules"].push_back({ z, coeffs[z].first, coeffs[z].second });
|
||||
}
|
||||
return align;
|
||||
}
|
||||
|
||||
@@ -12,7 +12,7 @@
|
||||
#include "graph_calls.h"
|
||||
#include "private_analyzer.h"
|
||||
#include "dvm.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
using std::vector;
|
||||
|
||||
|
||||
@@ -11,11 +11,40 @@
|
||||
#include "region.h"
|
||||
#include "SgUtils.h"
|
||||
#include "graph_loops.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "utils.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
void Collapse(Region* region)
|
||||
static void RemoveEmptyPoints(ArrayAccessingIndexes& container)
|
||||
{
|
||||
ArrayAccessingIndexes resultContainer;
|
||||
unordered_set<string> toRemove;
|
||||
|
||||
for (auto& [arrayName, accessingSet] : container)
|
||||
{
|
||||
vector<vector<ArrayDimension>> points;
|
||||
for (auto& arrayPoint : accessingSet.GetElements())
|
||||
{
|
||||
if (!arrayPoint.empty())
|
||||
points.push_back(arrayPoint);
|
||||
}
|
||||
|
||||
if (points.size() < accessingSet.GetElements().size() && !points.empty())
|
||||
resultContainer[arrayName] = points;
|
||||
|
||||
if (points.empty())
|
||||
toRemove.insert(arrayName);
|
||||
}
|
||||
|
||||
for (const string& name : toRemove)
|
||||
container.erase(name);
|
||||
|
||||
for (auto& [arrayName, accessingSet] : resultContainer)
|
||||
container[arrayName] = accessingSet;
|
||||
}
|
||||
|
||||
static void Collapse(Region* region)
|
||||
{
|
||||
if (region->getBasickBlocks().empty())
|
||||
return;
|
||||
@@ -37,13 +66,15 @@ void Collapse(Region* region)
|
||||
region->array_use[arrayName] = region->array_use[arrayName].Union(diff);
|
||||
}
|
||||
}
|
||||
ArrayAccessingIndexes useUnion;
|
||||
for (auto& byBlock : region->getBasickBlocks())
|
||||
for (auto& [arrayName, arrayRanges] : byBlock->array_use)
|
||||
useUnion[arrayName] = useUnion[arrayName].Union(byBlock->array_use[arrayName]);
|
||||
|
||||
for (auto& [arrayName, arrayRanges] : useUnion)
|
||||
region->array_priv[arrayName] = useUnion[arrayName].Diff(region->array_use[arrayName]);
|
||||
ArrayAccessingIndexes useUnionB;
|
||||
for (auto& byBlock : region->getBasickBlocks())
|
||||
for (auto& [arrayName, _] : byBlock->array_use)
|
||||
useUnionB[arrayName] = useUnionB[arrayName].Union(byBlock->array_use[arrayName]);
|
||||
|
||||
for (auto& [arrayName, _] : useUnionB)
|
||||
region->array_priv[arrayName] = useUnionB[arrayName].Diff(region->array_use[arrayName]);
|
||||
|
||||
|
||||
for (Region* prevBlock : region->getHeader()->getPrevRegions())
|
||||
prevBlock->replaceInNextRegions(region, region->getHeader());
|
||||
@@ -74,6 +105,7 @@ static void SolveDataFlowIteratively(Region* DFG)
|
||||
newIn.clear();
|
||||
continue;
|
||||
}
|
||||
|
||||
for (const auto& [arrayName, accessSet] : prevBlock->array_out)
|
||||
{
|
||||
if (newIn.find(arrayName) != newIn.end())
|
||||
@@ -86,6 +118,7 @@ static void SolveDataFlowIteratively(Region* DFG)
|
||||
|
||||
b->array_in = move(newIn);
|
||||
ArrayAccessingIndexes newOut;
|
||||
|
||||
if (b->array_def.empty())
|
||||
newOut = b->array_in;
|
||||
else if (b->array_in.empty())
|
||||
@@ -121,21 +154,83 @@ static void SolveDataFlow(Region* DFG)
|
||||
Collapse(DFG);
|
||||
}
|
||||
|
||||
map<LoopGraph*, ArrayAccessingIndexes> FindPrivateArrays(map<string, vector<LoopGraph*>> &loopGraph, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR)
|
||||
static void AddPrivateArraysToLoop(LoopGraph* loop, const ArrayAccessingIndexes& privates, set<SgStatement*>& insertedPrivates)
|
||||
{
|
||||
SgStatement* spfStat = new SgStatement(SPF_ANALYSIS_DIR);
|
||||
spfStat->setlineNumber(loop->loop->lineNumber());
|
||||
spfStat->setFileName(loop->loop->fileName());
|
||||
SgExpression* toAdd = new SgExpression(EXPR_LIST, new SgExpression(ACC_PRIVATE_OP), NULL, NULL);
|
||||
set<SgSymbol*> arraysToInsert;
|
||||
for (const auto& [_, accessingSet] : privates)
|
||||
{
|
||||
for (const auto& arrayElement : accessingSet.GetElements())
|
||||
{
|
||||
if (arrayElement.empty())
|
||||
continue;
|
||||
arraysToInsert.insert(arrayElement[0].array->symbol());
|
||||
}
|
||||
}
|
||||
|
||||
spfStat->setExpression(0, *toAdd);
|
||||
toAdd = toAdd->lhs();
|
||||
bool first = true;
|
||||
for (auto& elem : arraysToInsert)
|
||||
{
|
||||
if (first)
|
||||
{
|
||||
toAdd->setLhs(new SgExpression(EXPR_LIST));
|
||||
toAdd = toAdd->lhs();
|
||||
first = false;
|
||||
}
|
||||
else
|
||||
{
|
||||
toAdd->setRhs(new SgExpression(EXPR_LIST));
|
||||
toAdd = toAdd->rhs();
|
||||
}
|
||||
toAdd->setLhs(new SgVarRefExp(elem));
|
||||
}
|
||||
|
||||
if (arraysToInsert.size() == 0)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
loop->loop->insertStmtBefore(*spfStat, *loop->loop->controlParent());
|
||||
insertedPrivates.insert(spfStat);
|
||||
}
|
||||
|
||||
void FindPrivateArrays(map<string, vector<LoopGraph*>> &loopGraph, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR, set<SgStatement*> &insertedPrivates)
|
||||
{
|
||||
map<LoopGraph*, ArrayAccessingIndexes> result;
|
||||
for (const auto& [loopName, loops] : loopGraph)
|
||||
for (const auto& [fileName, loops] : loopGraph)
|
||||
{
|
||||
SgFile::switchToFile(fileName);
|
||||
for (const auto& loop : loops)
|
||||
{
|
||||
if (!loop->isFor())
|
||||
continue;
|
||||
SgStatement* search_func = loop->loop->GetOriginal();
|
||||
|
||||
while (search_func && (!isSgProgHedrStmt(search_func)))
|
||||
search_func = search_func->controlParent();
|
||||
|
||||
for (const auto& [funcInfo, blocks]: FullIR)
|
||||
{
|
||||
if (funcInfo->fileName == fileName && funcInfo->funcPointer->GetOriginal() == search_func)
|
||||
{
|
||||
Region* loopRegion = new Region(loop, blocks);
|
||||
if (loopRegion->getBasickBlocks().size() <= 1)
|
||||
{
|
||||
delete(loopRegion);
|
||||
continue;
|
||||
}
|
||||
SolveDataFlow(loopRegion);
|
||||
RemoveEmptyPoints(loopRegion->array_priv);
|
||||
result[loop] = loopRegion->array_priv;
|
||||
delete(loopRegion);
|
||||
}
|
||||
}
|
||||
|
||||
if (result.find(loop) != result.end() && !result[loop].empty())
|
||||
AddPrivateArraysToLoop(loop, result[loop], insertedPrivates);
|
||||
}
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
@@ -2,13 +2,12 @@
|
||||
|
||||
#include <vector>
|
||||
#include <map>
|
||||
#include <set>
|
||||
#include <unordered_set>
|
||||
|
||||
#include "range_structures.h"
|
||||
#include "region.h"
|
||||
#include "graph_loops.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
void Collapse(Region* region);
|
||||
std::map<LoopGraph*, ArrayAccessingIndexes> FindPrivateArrays(std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR);
|
||||
void FindPrivateArrays(std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR, std::set<SgStatement*>& insertedPrivates);
|
||||
std::pair<SAPFOR::BasicBlock*, std::unordered_set<SAPFOR::BasicBlock*>> GetBasicBlocksForLoop(const LoopGraph* loop, const std::vector<SAPFOR::BasicBlock*> blocks);
|
||||
|
||||
@@ -47,7 +47,7 @@ static ArrayDimension* DimensionIntersection(const ArrayDimension& dim1, const A
|
||||
|
||||
uint64_t start3 = dim1.start + x0 * dim1.step;
|
||||
uint64_t step3 = c * dim1.step;
|
||||
ArrayDimension* result = new(ArrayDimension){ start3, step3, tMax + 1 };
|
||||
ArrayDimension* result = new(ArrayDimension){ start3, step3, tMax + 1 , dim1.array};
|
||||
return result;
|
||||
}
|
||||
|
||||
@@ -61,21 +61,16 @@ static vector<ArrayDimension> DimensionDifference(const ArrayDimension& dim1, co
|
||||
vector<ArrayDimension> result;
|
||||
/* add the part before intersection */
|
||||
if (dim1.start < intersection->start)
|
||||
result.push_back({ dim1.start, dim1.step, (intersection->start - dim1.start) / dim1.step });
|
||||
result.push_back({ dim1.start, dim1.step, (intersection->start - dim1.start) / dim1.step, dim1.array});
|
||||
|
||||
/* add the parts between intersection steps */
|
||||
if (intersection->step > dim1.step)
|
||||
{
|
||||
uint64_t start = (intersection->start - dim1.start) / dim1.step;
|
||||
uint64_t interValue = intersection->start;
|
||||
for (int64_t i = start; dim1.start + i * dim1.step <= intersection->start + intersection->step * (intersection->tripCount - 1); i++)
|
||||
for (int64_t i = start; interValue <= intersection->start + intersection->step * (intersection->tripCount - 1); i++)
|
||||
{
|
||||
uint64_t centerValue = dim1.start + i * dim1.step;
|
||||
if (centerValue == interValue)
|
||||
{
|
||||
if (i - start > 1)
|
||||
{
|
||||
result.push_back({ dim1.start + (start + 1) * dim1.step, dim1.step, i - start - 1 });
|
||||
start = i;
|
||||
}
|
||||
result.push_back({interValue + dim1.step, dim1.step, intersection->step / dim1.step, dim1.array});
|
||||
interValue += intersection->step;
|
||||
}
|
||||
}
|
||||
@@ -85,7 +80,7 @@ static vector<ArrayDimension> DimensionDifference(const ArrayDimension& dim1, co
|
||||
/* first value after intersection */
|
||||
uint64_t right_start = intersection->start + intersection->step * (intersection->tripCount - 1) + dim1.step;
|
||||
uint64_t tripCount = (dim1.start + dim1.step * dim1.tripCount - right_start) / dim1.step;
|
||||
result.push_back({ right_start, dim1.step, tripCount });
|
||||
result.push_back({ right_start, dim1.step, tripCount, dim1.array });
|
||||
}
|
||||
delete(intersection);
|
||||
return result;
|
||||
@@ -216,6 +211,10 @@ void AccessingSet::Insert(const vector<ArrayDimension>& element)
|
||||
}
|
||||
|
||||
AccessingSet AccessingSet::Union(const AccessingSet& source) {
|
||||
if (source.GetElements().empty())
|
||||
return *this;
|
||||
if (allElements.empty())
|
||||
return source;
|
||||
AccessingSet result;
|
||||
for (auto& element : source.GetElements())
|
||||
result.Insert(element);
|
||||
|
||||
@@ -6,9 +6,12 @@
|
||||
#include <string>
|
||||
#include <cstdint>
|
||||
|
||||
#include "SgUtils.h"
|
||||
|
||||
struct ArrayDimension
|
||||
{
|
||||
uint64_t start, step, tripCount;
|
||||
SgArrayRefExp* array;
|
||||
};
|
||||
|
||||
class AccessingSet {
|
||||
|
||||
@@ -4,10 +4,12 @@
|
||||
#include<unordered_map>
|
||||
#include<string>
|
||||
#include <numeric>
|
||||
#include <iostream>
|
||||
|
||||
#include "range_structures.h"
|
||||
#include "region.h"
|
||||
|
||||
#include "..\Transformations\ExpressionSubstitution\expr_transform.h"
|
||||
#include "SgUtils.h"
|
||||
|
||||
using namespace std;
|
||||
@@ -104,15 +106,33 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
||||
|
||||
auto operation = instruction->getInstruction()->getOperation();
|
||||
auto type = instruction->getInstruction()->getArg1()->getType();
|
||||
if (operation == SAPFOR::CFG_OP::ASSIGN && instruction->getInstruction()->getResult()->getType() == SAPFOR::CFG_ARG_TYPE::ARRAY)
|
||||
{
|
||||
SgStatement* op = instruction->getInstruction()->getOperator();
|
||||
if (op && op->expr(0) && isArrayRef(op->expr(0)) && op->expr(0)->symbol() && op->expr(0)->type())
|
||||
{
|
||||
if (isSgArrayType(op->expr(0)->symbol()->type()))
|
||||
{
|
||||
SgArrayType* arrayType = (SgArrayType*)op->expr(0)->symbol()->type();
|
||||
int dimCount = ((SgArrayType*)op->expr(0)->symbol()->type())->dimension();
|
||||
vector<ArrayDimension> point;
|
||||
for (int i = 0; i < dimCount; i++)
|
||||
{
|
||||
string strDimLength = arrayType->sizeInDim(i)->unparse();
|
||||
if (arrayType->sizeInDim(i)->variant() == INT_VAL && strDimLength != "0")
|
||||
point.push_back({ 1ULL, 1ULL, (uint64_t)stoi(strDimLength), (SgArrayRefExp*)op->expr(0) });
|
||||
}
|
||||
|
||||
if (point.size() == dimCount)
|
||||
def[instruction->getInstruction()->getResult()->getValue()] = AccessingSet({point});
|
||||
}
|
||||
}
|
||||
}
|
||||
if ((operation == SAPFOR::CFG_OP::STORE || operation == SAPFOR::CFG_OP::LOAD) && type == SAPFOR::CFG_ARG_TYPE::ARRAY)
|
||||
{
|
||||
vector<SAPFOR::Argument*> index_vars;
|
||||
vector<int> refPos;
|
||||
string array_name;
|
||||
if (operation == SAPFOR::CFG_OP::STORE)
|
||||
array_name = instruction->getInstruction()->getArg1()->getValue();
|
||||
else
|
||||
array_name = instruction->getInstruction()->getArg2()->getValue();
|
||||
string array_name = instruction->getInstruction()->getArg1()->getValue();
|
||||
|
||||
int j = i - 1;
|
||||
while (j >= 0 && instructions[j]->getInstruction()->getOperation() == SAPFOR::CFG_OP::REF)
|
||||
@@ -127,7 +147,10 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
||||
vector<ArrayDimension> accessPoint(n);
|
||||
|
||||
auto* ref = isSgArrayRefExp(instruction->getInstruction()->getExpression());
|
||||
int fillCount = 0;
|
||||
|
||||
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 });
|
||||
@@ -138,18 +161,15 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
||||
}
|
||||
|
||||
}
|
||||
coefsForDims = {coefsForDims.rbegin(), coefsForDims.rend()};
|
||||
|
||||
if(coefsForDims.empty())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
while (!index_vars.empty())
|
||||
while (!index_vars.empty() && !refPos.empty() && !coefsForDims.empty())
|
||||
{
|
||||
auto var = index_vars.back();
|
||||
int currentVarPos = refPos.back();
|
||||
pair<int, int> currentCoefs = coefsForDims.back();
|
||||
ArrayDimension current_dim;
|
||||
if (var->getType() == SAPFOR::CFG_ARG_TYPE::CONST)
|
||||
current_dim = { stoul(var->getValue()), 1, 1 };
|
||||
current_dim = { stoul(var->getValue()), 1, 1, ref };
|
||||
else
|
||||
{
|
||||
string name, full_name = var->getValue();
|
||||
@@ -175,23 +195,31 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
||||
return -1;
|
||||
}
|
||||
|
||||
uint64_t start = currentLoop->startVal * currentCoefs.first + currentCoefs.second;
|
||||
uint64_t step = currentCoefs.first;
|
||||
current_dim = { start, step, (uint64_t)currentLoop->calculatedCountOfIters };
|
||||
uint64_t start = coefsForDims.back().second * currentLoop->startVal + coefsForDims.back().first;
|
||||
uint64_t step = currentLoop->stepVal;
|
||||
uint64_t iters = currentLoop->calculatedCountOfIters;
|
||||
current_dim = { start, step, iters, ref };
|
||||
}
|
||||
|
||||
if (current_dim.start != 0 && current_dim.step != 0 && current_dim.tripCount != 0)
|
||||
{
|
||||
accessPoint[n - index_vars.size()] = current_dim;
|
||||
fillCount++;
|
||||
}
|
||||
index_vars.pop_back();
|
||||
refPos.pop_back();
|
||||
coefsForDims.pop_back();
|
||||
}
|
||||
|
||||
if (fillCount == accessPoint.size())
|
||||
{
|
||||
if (operation == SAPFOR::CFG_OP::STORE)
|
||||
def[array_name].Insert(accessPoint);
|
||||
else
|
||||
use[array_name].Insert(accessPoint);
|
||||
}
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
|
||||
}
|
||||
@@ -227,8 +255,11 @@ static Region* CreateSubRegion(LoopGraph* loop, const vector<SAPFOR::BasicBlock*
|
||||
region->addBasickBlocks(bbToRegion.at(block));
|
||||
|
||||
for (LoopGraph* childLoop : loop->children)
|
||||
{
|
||||
if (!childLoop->isFor())
|
||||
continue;
|
||||
region->addSubRegions(CreateSubRegion(childLoop, Blocks, bbToRegion));
|
||||
|
||||
}
|
||||
return region;
|
||||
}
|
||||
|
||||
@@ -247,5 +278,9 @@ Region::Region(LoopGraph* loop, const vector<SAPFOR::BasicBlock*>& Blocks)
|
||||
SetConnections(bbToRegion, blockSet);
|
||||
//create subRegions
|
||||
for (LoopGraph* childLoop : loop->children)
|
||||
{
|
||||
if (!childLoop->isFor())
|
||||
continue;
|
||||
subRegions.insert(CreateSubRegion(childLoop, Blocks, bbToRegion));
|
||||
}
|
||||
}
|
||||
|
||||
@@ -6,7 +6,7 @@
|
||||
#include <string>
|
||||
|
||||
#include "graph_loops.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
class Region : public SAPFOR::BasicBlock {
|
||||
public:
|
||||
|
||||
@@ -403,7 +403,7 @@ static int convertFile(int argc, char* argv[], const set<string>& filesInProj, c
|
||||
fprintf(stderr, "<<<<< Unparsing %s >>>>>\n", fout_name);
|
||||
|
||||
if (mod_gpu) /*ACC*/
|
||||
UnparseTo_CufAndCu_Files(file, fout_cuf, fout_C_cu, fout_info);
|
||||
UnparseTo_CufAndCu_Files(file, fout_cuf, fout_C_cu, fout_info, fout_name);
|
||||
|
||||
const string fileN = file->filename();
|
||||
set<SgStatement*> toRemove;
|
||||
|
||||
@@ -46,6 +46,7 @@
|
||||
#include "DynamicAnalysis/gCov_parser_func.h"
|
||||
#include "DynamicAnalysis/createParallelRegions.h"
|
||||
|
||||
#include "ArrayConstantPropagation/propagation.h"
|
||||
#include "DirectiveProcessing/directive_analyzer.h"
|
||||
#include "DirectiveProcessing/directive_creator.h"
|
||||
#include "DirectiveProcessing/insert_directive.h"
|
||||
@@ -279,6 +280,7 @@ static string unparseProjectIfNeed(SgFile* file, const int curr_regime, const bo
|
||||
for (SgStatement* st = file->firstStatement(); st; st = st->lexNext())
|
||||
if (isSPF_stat(st)) // except sapfor parallel regions and if attributes dont move
|
||||
if (st->variant() != SPF_PARALLEL_REG_DIR && st->variant() != SPF_END_PARALLEL_REG_DIR)
|
||||
if (insertedPrivates.find(st) == insertedPrivates.end())
|
||||
toDel.push_back(st);
|
||||
|
||||
for (auto& elem : toDel)
|
||||
@@ -1019,8 +1021,6 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
if(func->funcPointer->variant() != ENTRY_STAT)
|
||||
countOfTransform += removeDeadCode(func->funcPointer, allFuncInfo, commonBlocks);
|
||||
}
|
||||
else if (curr_regime == FIND_PRIVATE_ARRAYS)
|
||||
FindPrivateArrays(loopGraph, fullIR);
|
||||
else if (curr_regime == TEST_PASS)
|
||||
{
|
||||
//test pass
|
||||
@@ -1916,6 +1916,11 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
}
|
||||
else if (curr_regime == TRANSFORM_ASSUMED_SIZE_PARAMETERS)
|
||||
transformAssumedSizeParameters(allFuncInfo);
|
||||
else if (curr_regime == FIND_PRIVATE_ARRAYS_ANALYSIS)
|
||||
FindPrivateArrays(loopGraph, fullIR, insertedPrivates);
|
||||
|
||||
else if (curr_regime == ARRAY_PROPAGATION)
|
||||
ArrayConstantPropagation(project);
|
||||
|
||||
const float elapsed = duration_cast<milliseconds>(high_resolution_clock::now() - timeForPass).count() / 1000.;
|
||||
const float elapsedGlobal = duration_cast<milliseconds>(high_resolution_clock::now() - globalTime).count() / 1000.;
|
||||
@@ -2373,6 +2378,7 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
||||
case SUBST_EXPR_RD_AND_UNPARSE:
|
||||
case SUBST_EXPR_AND_UNPARSE:
|
||||
case REMOVE_DEAD_CODE_AND_UNPARSE:
|
||||
case FIND_PRIVATE_ARRAYS:
|
||||
if (folderName)
|
||||
runAnalysis(*project, UNPARSE_FILE, true, "", folderName);
|
||||
else
|
||||
@@ -2634,7 +2640,7 @@ int main(int argc, char **argv)
|
||||
}
|
||||
}
|
||||
|
||||
if (curr_regime == INSERT_PARALLEL_DIRS_NODIST)
|
||||
if (curr_regime == INSERT_PARALLEL_DIRS_NODIST || curr_regime == FIND_PRIVATE_ARRAYS)
|
||||
{
|
||||
ignoreArrayDistributeState = true;
|
||||
sharedMemoryParallelization = 1;
|
||||
|
||||
@@ -183,9 +183,11 @@ enum passes {
|
||||
SET_IMPLICIT_NONE,
|
||||
RENAME_INLCUDES,
|
||||
|
||||
FIND_PRIVATE_ARRAYS_ANALYSIS,
|
||||
FIND_PRIVATE_ARRAYS,
|
||||
|
||||
TRANSFORM_ASSUMED_SIZE_PARAMETERS,
|
||||
ARRAY_PROPAGATION,
|
||||
|
||||
TEST_PASS,
|
||||
EMPTY_PASS
|
||||
@@ -371,9 +373,11 @@ static void setPassValues()
|
||||
passNames[SET_IMPLICIT_NONE] = "SET_IMPLICIT_NONE";
|
||||
passNames[RENAME_INLCUDES] = "RENAME_INLCUDES";
|
||||
passNames[INSERT_NO_DISTR_FLAGS_FROM_GUI] = "INSERT_NO_DISTR_FLAGS_FROM_GUI";
|
||||
passNames[FIND_PRIVATE_ARRAYS_ANALYSIS] = "FIND_PRIVATE_ARRAYS_ANALYSIS";
|
||||
passNames[FIND_PRIVATE_ARRAYS] = "FIND_PRIVATE_ARRAYS";
|
||||
|
||||
passNames[TRANSFORM_ASSUMED_SIZE_PARAMETERS] = "TRANSFORM_ASSUMED_SIZE_PARAMETERS";
|
||||
passNames[ARRAY_PROPAGATION] = "ARRAY_PROPAGATION";
|
||||
|
||||
passNames[TEST_PASS] = "TEST_PASS";
|
||||
}
|
||||
|
||||
@@ -175,6 +175,11 @@ std::set<std::tuple<std::string, int, std::string>> parametersOfProject; // [fil
|
||||
//for GET_MIN_MAX_BLOCK_DIST
|
||||
std::pair<int, int> min_max_block = std::make_pair(-1, -1);
|
||||
//
|
||||
|
||||
//for FIND_PRIVATE_ARRAYS
|
||||
std::set<SgStatement*> insertedPrivates;
|
||||
//
|
||||
|
||||
const char* passNames[EMPTY_PASS + 1];
|
||||
const char* optionNames[EMPTY_OPTION + 1];
|
||||
bool passNamesWasInit = false;
|
||||
|
||||
@@ -6,7 +6,7 @@
|
||||
#include <set>
|
||||
#include <algorithm>
|
||||
|
||||
#include "../../CFGraph/CFGraph.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
|
||||
using std::map;
|
||||
using std::string;
|
||||
|
||||
@@ -4,10 +4,10 @@
|
||||
#include<vector>
|
||||
|
||||
#include "SgUtils.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "../CFGraph/live_variable_analysis.h"
|
||||
#include "../CFGraph/DataFlow/data_flow.h"
|
||||
#include "../CFGraph/DataFlow/backward_data_flow.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "CFGraph/live_variable_analysis.h"
|
||||
#include "CFGraph/DataFlow/data_flow.h"
|
||||
#include "CFGraph/DataFlow/backward_data_flow.h"
|
||||
|
||||
int removeDeadCode(SgStatement* func,
|
||||
const std::map<std::string, std::vector<FuncInfo*>>&allFuncs,
|
||||
|
||||
@@ -440,15 +440,18 @@ bool replaceConstantRec(SgExpression *&exp)
|
||||
if (exp->variant() == CONST_REF)
|
||||
{
|
||||
SgExpression *ret = ReplaceParameter_(exp);
|
||||
|
||||
int sign = 1;
|
||||
SgExpression* toCalc = ret;
|
||||
if (ret->variant() == UNARY_ADD_OP)
|
||||
toCalc = ret->lhs();
|
||||
if (ret->variant() == MINUS_OP)
|
||||
if (toCalc->variant() == UNARY_ADD_OP)
|
||||
toCalc = toCalc->lhs();
|
||||
|
||||
if (toCalc->variant() == MINUS_OP)
|
||||
{
|
||||
toCalc = ret->lhs();
|
||||
toCalc = toCalc->lhs();
|
||||
sign = -1;
|
||||
}
|
||||
|
||||
if (toCalc->isInteger())
|
||||
{
|
||||
exp = new SgValueExp(sign * toCalc->valueInteger());
|
||||
|
||||
@@ -103,7 +103,7 @@ void insertIntrinsicStat(const vector<FuncInfo*>& allFuncInfo)
|
||||
if (line <= 0)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
intr->setlineNumber(line);
|
||||
intr->setlineNumber(getNextNegativeLineNumber());
|
||||
st->insertStmtBefore(*intr, *func->funcPointer);
|
||||
}
|
||||
else
|
||||
@@ -525,7 +525,7 @@ static void insertIntents(set<string>& identificators, SgStatement* header, cons
|
||||
if (args.size())
|
||||
{
|
||||
SgIntentStmt* intent = new SgIntentStmt(*makeExprList(args), *attr);
|
||||
intent->setlineNumber(lastDecl->lineNumber());
|
||||
intent->setlineNumber(getNextNegativeLineNumber());
|
||||
|
||||
lastDecl->insertStmtAfter(*intent, (header == lastDecl) ? *header : *lastDecl->controlParent());
|
||||
}
|
||||
|
||||
@@ -1123,7 +1123,7 @@ static bool hasDependenciesBetweenArrays(LoopGraph* firstLoop, LoopGraph* loop,
|
||||
for (int d = 0; d < dimensions; ++d)
|
||||
{
|
||||
//по измерениям массива отображение на цикл вложенности d
|
||||
vector<set<pair<int, int>>> coefsRead[2], coefsWrite[2];
|
||||
vector<set<pair<int, int>>> coeffsRead[2], coeffsWrite[2];
|
||||
|
||||
checkNull(currLoop[0], convertFileName(__FILE__).c_str(), __LINE__);
|
||||
checkNull(currLoop[1], convertFileName(__FILE__).c_str(), __LINE__);
|
||||
@@ -1133,31 +1133,31 @@ static bool hasDependenciesBetweenArrays(LoopGraph* firstLoop, LoopGraph* loop,
|
||||
auto it = currLoop[k]->readOpsForLoop.find(array);
|
||||
if (it != currLoop[k]->readOpsForLoop.end())
|
||||
{
|
||||
if (coefsRead[k].size() == 0)
|
||||
coefsRead[k].resize(it->second.size());
|
||||
if (coeffsRead[k].size() == 0)
|
||||
coeffsRead[k].resize(it->second.size());
|
||||
|
||||
for (int z = 0; z < it->second.size(); ++z)
|
||||
if (it->second[z].coefficients.size())
|
||||
for (auto& coef : it->second[z].coefficients)
|
||||
coefsRead[k][z].insert(coef.first);
|
||||
coeffsRead[k][z].insert(coef.first);
|
||||
}
|
||||
|
||||
auto itW = currLoop[k]->writeOpsForLoop.find(array);
|
||||
if (itW != currLoop[k]->writeOpsForLoop.end())
|
||||
{
|
||||
if (coefsWrite[k].size() == 0)
|
||||
coefsWrite[k].resize(itW->second.size());
|
||||
if (coeffsWrite[k].size() == 0)
|
||||
coeffsWrite[k].resize(itW->second.size());
|
||||
|
||||
for (int z = 0; z < itW->second.size(); ++z)
|
||||
if (itW->second[z].coefficients.size())
|
||||
for (auto& coef : itW->second[z].coefficients)
|
||||
coefsWrite[k][z].insert(coef.first);
|
||||
coeffsWrite[k][z].insert(coef.first);
|
||||
}
|
||||
}
|
||||
|
||||
//нет записей, значит нет зависимости
|
||||
bool nulWrite = true;
|
||||
for (auto& wr : coefsWrite)
|
||||
for (auto& wr : coeffsWrite)
|
||||
for (auto& elem : wr)
|
||||
if (elem.size() != 0)
|
||||
nulWrite = false;
|
||||
@@ -1168,62 +1168,62 @@ static bool hasDependenciesBetweenArrays(LoopGraph* firstLoop, LoopGraph* loop,
|
||||
// если чтение в одном цикле и запись (и наоборот) в другом идут по разным правилам, то пока что это зависимость.
|
||||
// здесь можно уточнить.
|
||||
|
||||
const int len = std::max(coefsWrite[0].size(), coefsRead[0].size());
|
||||
const int len = std::max(coeffsWrite[0].size(), coeffsRead[0].size());
|
||||
int countW[2] = { 0, 0 };
|
||||
int countR[2] = { 0, 0 };
|
||||
|
||||
for (int L = 0; L < 2; ++L)
|
||||
for (int z = 0; z < coefsWrite[L].size(); ++z)
|
||||
countW[L] += (coefsWrite[L][z].size() ? 1 : 0);
|
||||
for (int z = 0; z < coeffsWrite[L].size(); ++z)
|
||||
countW[L] += (coeffsWrite[L][z].size() ? 1 : 0);
|
||||
|
||||
for (int L = 0; L < 2; ++L)
|
||||
for (int z = 0; z < coefsRead[L].size(); ++z)
|
||||
countR[L] += (coefsRead[L][z].size() ? 1 : 0);
|
||||
for (int z = 0; z < coeffsRead[L].size(); ++z)
|
||||
countR[L] += (coeffsRead[L][z].size() ? 1 : 0);
|
||||
|
||||
for (int p = 0; p < len; ++p)
|
||||
{
|
||||
if (coefsWrite[1].size() && coefsWrite[0].size())
|
||||
if (coefsWrite[0][p].size() != 0 && coefsWrite[1][p].size() != 0)
|
||||
if (coefsWrite[0][p] != coefsWrite[1][p])
|
||||
if (coeffsWrite[1].size() && coeffsWrite[0].size())
|
||||
if (coeffsWrite[0][p].size() != 0 && coeffsWrite[1][p].size() != 0)
|
||||
if (coeffsWrite[0][p] != coeffsWrite[1][p])
|
||||
return true;
|
||||
|
||||
if (coefsRead[1].size() && coefsWrite[0].size())
|
||||
if (coefsWrite[0][p].size() != 0 && coefsRead[1][p].size() != 0)
|
||||
if (coefsWrite[0][p] != coefsRead[1][p])
|
||||
if (coeffsRead[1].size() && coeffsWrite[0].size())
|
||||
if (coeffsWrite[0][p].size() != 0 && coeffsRead[1][p].size() != 0)
|
||||
if (coeffsWrite[0][p] != coeffsRead[1][p])
|
||||
return true;
|
||||
|
||||
if (coefsWrite[1].size() && coefsRead[0].size())
|
||||
if (coefsWrite[1][p].size() != 0 && coefsRead[0][p].size() != 0)
|
||||
if (coefsWrite[1][p] != coefsRead[0][p])
|
||||
if (coeffsWrite[1].size() && coeffsRead[0].size())
|
||||
if (coeffsWrite[1][p].size() != 0 && coeffsRead[0][p].size() != 0)
|
||||
if (coeffsWrite[1][p] != coeffsRead[0][p])
|
||||
return true;
|
||||
|
||||
|
||||
//отображение на разные измерения
|
||||
if (coefsWrite[1].size() && coefsWrite[0].size())
|
||||
if (coeffsWrite[1].size() && coeffsWrite[0].size())
|
||||
{
|
||||
if (coefsWrite[0][p].size() != 0 && coefsWrite[1][p].size() == 0 && countW[1] ||
|
||||
coefsWrite[0][p].size() == 0 && coefsWrite[1][p].size() != 0 && countW[0])
|
||||
if (coeffsWrite[0][p].size() != 0 && coeffsWrite[1][p].size() == 0 && countW[1] ||
|
||||
coeffsWrite[0][p].size() == 0 && coeffsWrite[1][p].size() != 0 && countW[0])
|
||||
return true;
|
||||
}
|
||||
|
||||
if (coefsRead[1].size() && coefsWrite[0].size())
|
||||
if (coeffsRead[1].size() && coeffsWrite[0].size())
|
||||
{
|
||||
if (coefsWrite[0][p].size() != 0 && coefsRead[1][p].size() == 0 && countR[1] ||
|
||||
coefsWrite[0][p].size() == 0 && coefsRead[1][p].size() != 0 && countW[0])
|
||||
if (coeffsWrite[0][p].size() != 0 && coeffsRead[1][p].size() == 0 && countR[1] ||
|
||||
coeffsWrite[0][p].size() == 0 && coeffsRead[1][p].size() != 0 && countW[0])
|
||||
return true;
|
||||
}
|
||||
|
||||
if (coefsWrite[1].size() && coefsRead[1].size())
|
||||
if (coeffsWrite[1].size() && coeffsRead[1].size())
|
||||
{
|
||||
if (coefsWrite[1][p].size() != 0 && coefsRead[0][p].size() == 0 && countR[0] ||
|
||||
coefsWrite[1][p].size() == 0 && coefsRead[0][p].size() != 0 && countW[1])
|
||||
if (coeffsWrite[1][p].size() != 0 && coeffsRead[0][p].size() == 0 && countR[0] ||
|
||||
coeffsWrite[1][p].size() == 0 && coeffsRead[0][p].size() != 0 && countW[1])
|
||||
return true;
|
||||
}
|
||||
|
||||
//где то нет правил отображения вообще, но есть факт его наличия.
|
||||
if ( ((coefsWrite[0].size() == 0 && coefsRead[0].size() == 0) && (countW[0] == 0 && countR[0] == 0))
|
||||
if ( ((coeffsWrite[0].size() == 0 && coeffsRead[0].size() == 0) && (countW[0] == 0 && countR[0] == 0))
|
||||
||
|
||||
((coefsWrite[1].size() == 0 && coefsRead[1].size() == 0) && (countW[1] == 0 && countR[1] == 0)) )
|
||||
((coeffsWrite[1].size() == 0 && coeffsRead[1].size() == 0) && (countW[1] == 0 && countR[1] == 0)) )
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
@@ -6,7 +6,7 @@
|
||||
#include "../LoopAnalyzer/loop_analyzer.h"
|
||||
#include "expr_transform.h"
|
||||
#include "errors.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "../SageAnalysisTool/OmegaForSage/include/lang-interf.h"
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "../DirectiveProcessing/directive_omp_parser.h"
|
||||
|
||||
@@ -2,8 +2,8 @@
|
||||
|
||||
#include "dvm.h"
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "../CFGraph/RD_subst.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "CFGraph/RD_subst.h"
|
||||
|
||||
// Regime defines the regime of private removing
|
||||
enum class Regime { DEFLT = 1, REGULAR_INDEXES };
|
||||
|
||||
@@ -17,27 +17,17 @@ using std::pair;
|
||||
|
||||
#define DEBUG_TRACE 0
|
||||
|
||||
static bool findAlloatableKeyword(SgExpression* exp)
|
||||
static bool hasArrayRef(SgExpression* ex)
|
||||
{
|
||||
if (exp)
|
||||
{
|
||||
if (exp->variant() == ALLOCATABLE_OP)
|
||||
return true;
|
||||
|
||||
return findAlloatableKeyword(exp->lhs()) || findAlloatableKeyword(exp->rhs());
|
||||
}
|
||||
if (ex)
|
||||
return isArrayRef(ex) || hasArrayRef(ex->lhs()) || hasArrayRef(ex->rhs());
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
static bool checkDynamicArray(DIST::Array *array)
|
||||
static inline bool isArrayDeclaration(SgStatement* st)
|
||||
{
|
||||
for (const auto &bounds : array->GetSizes())
|
||||
if (bounds.first == -1 || bounds.second == -1)
|
||||
return true;
|
||||
|
||||
return false;
|
||||
return isSgDeclarationStatement(st) || isSgVarListDeclStmt(st) || isSgNestedVarListDeclStmt(st);
|
||||
}
|
||||
|
||||
static SgExpression* findExprWithVariant(SgExpression* exp, int variant)
|
||||
@@ -59,27 +49,110 @@ static SgExpression* findExprWithVariant(SgExpression* exp, int variant)
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static bool checkAssumedSize(SgStatement *st, const string &arrayName, const string ¤tFile)
|
||||
static bool switchToDeclarationFile(DIST::Array* array_p,
|
||||
pair<string, int>& decl_place,
|
||||
const string ¤t_file_name,
|
||||
FuncInfo *current_func)
|
||||
{
|
||||
if (!array_p)
|
||||
return false;
|
||||
|
||||
// try to find declaration from current function
|
||||
for (const auto &p : array_p->GetDeclInfo())
|
||||
{
|
||||
if (p.first == current_file_name &&
|
||||
current_func->linesNum.first <= p.second &&
|
||||
p.second <= current_func->linesNum.second)
|
||||
{
|
||||
decl_place = p;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
for (const auto &p : array_p->GetDeclInfo())
|
||||
{
|
||||
if (SgFile::switchToFile(p.first) != -1)
|
||||
{
|
||||
decl_place = p;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool checkAssumedShape(SgStatement* decl, const string& array_name)
|
||||
{
|
||||
SgExpression* list = decl->expr(0);
|
||||
SgExpression* dim_list = NULL;
|
||||
|
||||
while (list)
|
||||
{
|
||||
auto *arr_ref = list->lhs();
|
||||
|
||||
if (arr_ref &&
|
||||
arr_ref->symbol() &&
|
||||
arr_ref->symbol()->identifier() &&
|
||||
arr_ref->symbol()->identifier() == array_name)
|
||||
{
|
||||
dim_list = arr_ref->lhs();
|
||||
break;
|
||||
}
|
||||
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (!dim_list)
|
||||
{
|
||||
auto *dim_expr = findExprWithVariant(decl->expr(2), DIMENSION_OP);
|
||||
if (dim_expr)
|
||||
dim_list = dim_expr->lhs();
|
||||
}
|
||||
|
||||
while (dim_list)
|
||||
{
|
||||
auto *lhs = dim_list->lhs();
|
||||
|
||||
if (lhs && lhs->variant() == DDOT && (!lhs->lhs() || !lhs->rhs()))
|
||||
return true;
|
||||
|
||||
dim_list = dim_list->rhs();
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool checkAssumedSize(const string &array_name, DIST::Array* array_p, const string ¤t_file_name, FuncInfo *current_func)
|
||||
{
|
||||
if (!array_p)
|
||||
return true; // raise true to prevent array from copying
|
||||
|
||||
bool found = false;
|
||||
|
||||
DIST::Array* array_p = getArrayFromDeclarated(st, arrayName);
|
||||
pair<string, int> decl_place;
|
||||
|
||||
auto place = *array_p->GetDeclInfo().begin();
|
||||
auto decl_file_name = place.first;
|
||||
if (!switchToDeclarationFile(array_p, decl_place, current_file_name, current_func))
|
||||
return true;
|
||||
|
||||
SgFile::switchToFile(decl_file_name);
|
||||
auto *st = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
||||
checkNull(st, convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
SgExpression* list = st->expr(0);
|
||||
while (list)
|
||||
{
|
||||
if (list->lhs() && list->lhs()->symbol()->identifier() == arrayName)
|
||||
if (list->lhs() &&
|
||||
list->lhs()->symbol() &&
|
||||
list->lhs()->symbol()->identifier() &&
|
||||
list->lhs()->symbol()->identifier() == array_name
|
||||
)
|
||||
{
|
||||
if(findExprWithVariant(list->lhs(), STAR_RANGE))
|
||||
found = true;
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (!found)
|
||||
@@ -89,7 +162,8 @@ static bool checkAssumedSize(SgStatement *st, const string &arrayName, const str
|
||||
found = true;
|
||||
}
|
||||
|
||||
SgFile::switchToFile(currentFile);
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); // can't switch back to file with array usage
|
||||
|
||||
return found;
|
||||
}
|
||||
@@ -106,12 +180,15 @@ static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
|
||||
}
|
||||
}
|
||||
|
||||
static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays, SgStatement* stat, const string& current_file)
|
||||
static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays,
|
||||
SgStatement* stat,
|
||||
const string& current_file_name,
|
||||
FuncInfo *current_func)
|
||||
{
|
||||
auto var = stat->variant();
|
||||
|
||||
if (var != READ_STAT && var != PRINT_STAT && var != WRITE_STAT)
|
||||
return;
|
||||
return false;
|
||||
|
||||
// check if such IO allowed in dvm:
|
||||
// list should consist only of single array and format string should be *
|
||||
@@ -121,24 +198,28 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
SgExpression* ioList = stat->expr(0);
|
||||
|
||||
if (!ioList)
|
||||
return;
|
||||
return false;
|
||||
|
||||
if (ioList->variant() != EXPR_LIST)
|
||||
return;
|
||||
return false;
|
||||
|
||||
if (ioList->rhs() == NULL)
|
||||
{
|
||||
SgExpression* arg = ioList->lhs();
|
||||
if (!arg)
|
||||
return;
|
||||
return false;
|
||||
|
||||
if (!isArrayRef(arg))
|
||||
return;
|
||||
|
||||
if (arg->lhs())
|
||||
if (hasArrayRef(arg))
|
||||
{
|
||||
if (isArrayRef(arg) && arg->lhs())
|
||||
need_replace = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
need_replace = true;
|
||||
}
|
||||
@@ -156,7 +237,6 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
if (fmt->rhs()->variant() != KEYWORD_VAL || fmt->rhs()->sunparse() != "*")
|
||||
need_replace = true;
|
||||
|
||||
|
||||
break;
|
||||
}
|
||||
case READ_STAT:
|
||||
@@ -189,6 +269,7 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
spec = spec->rhs();
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
default:
|
||||
break;
|
||||
@@ -196,7 +277,9 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
}
|
||||
|
||||
if (!need_replace)
|
||||
return;
|
||||
return false;
|
||||
|
||||
bool ret = false;
|
||||
|
||||
set<SgSymbol*> found_arrays;
|
||||
|
||||
@@ -209,15 +292,19 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(by_symb), array_name);
|
||||
if (array_p &&
|
||||
array_p->GetDistributeFlagVal() == Distribution::distFlag::IO_PRIV &&
|
||||
!checkAssumedSize(declaratedInStmt(by_symb), array_name, current_file) &&
|
||||
arrays[by_symb].insert(stat).second
|
||||
)
|
||||
!checkAssumedSize(array_name, array_p, current_file_name, current_func))
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[%d]: add array %s\n", stat->lineNumber(), array_p->GetName().c_str());
|
||||
auto inserted = arrays[by_symb].insert(stat).second;
|
||||
|
||||
if (inserted)
|
||||
__spf_print(DEBUG_TRACE, "[%d]: add array %s %p\n", stat->lineNumber(), array_p->GetName().c_str(), by_symb);
|
||||
|
||||
ret = true;
|
||||
}
|
||||
}
|
||||
|
||||
__spf_print(DEBUG_TRACE, "[replace]\n");
|
||||
return ret;
|
||||
}
|
||||
|
||||
static void replaceArrayRec(SgSymbol* arr, SgSymbol* replace_by, SgExpression* exp, bool& has_read, bool& has_write, bool from_read, bool from_write)
|
||||
@@ -311,6 +398,7 @@ static void copyArrayBetweenStatements(SgSymbol* replace_symb,
|
||||
auto* parent = start_is_scope ? start : start->controlParent();
|
||||
if (parent && parent->lastNodeOfStmt() == start)
|
||||
parent = parent->controlParent();
|
||||
checkNull(parent, convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
start->insertStmtAfter(*assign, *parent);
|
||||
}
|
||||
@@ -342,8 +430,7 @@ static void replaceArrayInFragment(SgSymbol* replace_symb,
|
||||
SgSymbol* replace_by,
|
||||
SgStatement* start,
|
||||
SgStatement* last,
|
||||
FuncInfo *func_info,
|
||||
const string& filename)
|
||||
FuncInfo *func_info)
|
||||
{
|
||||
while (start->lexNext() && (!isSgExecutableStatement(start->lexNext()) || start->lexNext()->variant() == ALLOCATE_STMT))
|
||||
start = start->lexNext();
|
||||
@@ -435,12 +522,16 @@ static bool ioReginBorder(SgStatement* stat, SgStatement* last_io_bound)
|
||||
STOP_STAT,
|
||||
STOP_NODE,
|
||||
EXIT_STMT,
|
||||
EXIT_NODE
|
||||
EXIT_NODE,
|
||||
GOTO_NODE
|
||||
};
|
||||
|
||||
if (border_stats.find(var) != border_stats.end())
|
||||
return true;
|
||||
|
||||
if (stat->hasLabel())
|
||||
return true;
|
||||
|
||||
if (last_io_bound && last_io_bound->lastNodeOfStmt() && last_io_bound->lastNodeOfStmt() == stat)
|
||||
return true;
|
||||
|
||||
@@ -464,26 +555,23 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[%s]: enter region\n", region->GetName().c_str());
|
||||
|
||||
for (auto& linesByFile : region->GetAllLinesToModify())
|
||||
for (auto& lines_by_file : region->GetAllLinesToModify())
|
||||
{
|
||||
const auto& filename = linesByFile.first;
|
||||
const auto& current_file_name = lines_by_file.first;
|
||||
|
||||
if (SgFile::switchToFile(filename) == -1)
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto func_info_it = allFuncInfo.find(filename);
|
||||
auto func_info_it = allFuncInfo.find(current_file_name);
|
||||
if (func_info_it == allFuncInfo.end())
|
||||
{
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
|
||||
auto *lbound_symb = new SgSymbol(PROCEDURE_NAME, "lbound");
|
||||
auto *ubound_symb = new SgSymbol(PROCEDURE_NAME, "ubound");
|
||||
auto *lbound_symb = new SgSymbol(FUNCTION_NAME, "lbound");
|
||||
auto *ubound_symb = new SgSymbol(FUNCTION_NAME, "ubound");
|
||||
|
||||
for (auto& lines : linesByFile.second)
|
||||
for (auto& lines : lines_by_file.second)
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[fragment] %s: %d:%d %d\n", filename.c_str(), lines.lines.first,
|
||||
__spf_print(DEBUG_TRACE, "[fragment] %s: %d:%d %d\n", current_file_name.c_str(), lines.lines.first,
|
||||
lines.lines.second, lines.isImplicit());
|
||||
|
||||
SgStatement* curr_stmt, * end;
|
||||
@@ -527,10 +615,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
}
|
||||
|
||||
if (!current_func_info)
|
||||
{
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
|
||||
curr_stmt = curr_stmt->lexNext();
|
||||
while (curr_stmt && !isSgExecutableStatement(curr_stmt))
|
||||
@@ -555,90 +640,86 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
string array_name = string(array_to_copy->identifier());
|
||||
DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(array_to_copy), array_name);
|
||||
|
||||
bool fromModule = (array_p->GetLocation().first == DIST::l_MODULE);
|
||||
const string locationName = array_p->GetLocation().second;
|
||||
// at this point all considered arrays must have DIST::Array* references
|
||||
if (!array_p)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
// ... and be declared in switchable files (not in headers)
|
||||
pair<string, int> decl_place;
|
||||
if (!switchToDeclarationFile(array_p, decl_place, current_file_name, current_func_info))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto place = *array_p->GetDeclInfo().begin();
|
||||
auto decl_file_name = place.first;
|
||||
string suffix = "_io_l";
|
||||
|
||||
if (fromModule)
|
||||
switch (array_p->GetLocation().first)
|
||||
{
|
||||
case DIST::l_MODULE:
|
||||
suffix = "_io_m";
|
||||
|
||||
pair<SgSymbol*, SgSymbol*> copied;
|
||||
copied.first = array_to_copy;
|
||||
|
||||
if (SgFile::switchToFile(decl_file_name) == -1)
|
||||
{
|
||||
auto* func_stmt = curr_stmt->getScopeForDeclare();
|
||||
|
||||
SgStatement* insertPlace = NULL;
|
||||
for (auto iterator = func_stmt->lexNext();
|
||||
!isSgExecutableStatement(iterator) || isSPF_stat(iterator) &&
|
||||
!(iterator->variant() == SPF_PARALLEL_REG_DIR || iterator->variant() == SPF_END_PARALLEL_REG_DIR);
|
||||
iterator = iterator->lexNext())
|
||||
{
|
||||
insertPlace = iterator;
|
||||
break;
|
||||
case DIST::l_COMMON:
|
||||
suffix = "_io_c";
|
||||
break;
|
||||
}
|
||||
|
||||
//NULL - no decl stats in function!
|
||||
if (!insertPlace)
|
||||
insertPlace = func_stmt;
|
||||
auto copied_symbol = copyArray(decl_place,
|
||||
array_p,
|
||||
lines_by_file.second,
|
||||
suffix + to_string(region->GetId()),
|
||||
decl_place.first,
|
||||
newDeclsToInclude,
|
||||
copied_syms);
|
||||
|
||||
auto st = insertPlace->controlParent();
|
||||
if (st->variant() == GLOBAL)
|
||||
st = insertPlace;
|
||||
// original declaration statement
|
||||
auto *decl_stmt = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
||||
|
||||
auto& copied_symb = array_to_copy->copy();
|
||||
copied.second = &copied_symb;
|
||||
if (!decl_stmt || !isArrayDeclaration(decl_stmt))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto new_name = string(array_to_copy->identifier()) + "_io_c";
|
||||
copied_symb.changeName(new_name.c_str());
|
||||
auto dynamic_array = checkAssumedShape(decl_stmt, array_name);
|
||||
|
||||
auto stat = array_to_copy->makeVarDeclStmt();
|
||||
auto res = CalculateInteger(stat->expr(0)->copyPtr());
|
||||
res->lhs()->setSymbol(copied_symb);
|
||||
stat->setExpression(0, res);
|
||||
|
||||
insertPlace->insertStmtAfter(*stat, *st);
|
||||
}
|
||||
else
|
||||
while (decl_stmt && !isSgExecutableStatement(decl_stmt))
|
||||
{
|
||||
copied = copyArray(place, array_p, linesByFile.second, suffix + to_string(region->GetId()), decl_file_name, newDeclsToInclude, copied_syms);
|
||||
if (isArrayDeclaration(decl_stmt) &&
|
||||
decl_stmt->expr(0) &&
|
||||
decl_stmt->expr(0)->lhs() &&
|
||||
decl_stmt->expr(0)->lhs()->symbol() == copied_symbol.second)
|
||||
{
|
||||
break;
|
||||
}
|
||||
|
||||
SgStatement* decl = SgStatement::getStatementByFileAndLine(place.first, place.second);
|
||||
decl_stmt = decl_stmt->lexNext();
|
||||
}
|
||||
|
||||
if (decl)
|
||||
decl = decl->lexNext();
|
||||
// created declaration statement
|
||||
if (!decl_stmt || !isArrayDeclaration(decl_stmt))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
// insert !$SPF ANALYSIS(PROCESS_PRIVATE(array)) directive before declaration statement
|
||||
|
||||
if (decl)
|
||||
{
|
||||
string dir_str;
|
||||
if (decl->comments())
|
||||
if (decl_stmt->comments())
|
||||
{
|
||||
string str_comment = string(decl->comments());
|
||||
auto str_comment = string(decl_stmt->comments());
|
||||
if (str_comment.size() && str_comment.back() != '\n')
|
||||
dir_str += "\n";
|
||||
}
|
||||
|
||||
dir_str += "!$SPF ANALYSIS(PROCESS_PRIVATE(" + string(copied.second->identifier()) + "))\n";
|
||||
decl->addComment(dir_str.c_str());
|
||||
}
|
||||
dir_str += "!$SPF ANALYSIS(PROCESS_PRIVATE(" + string(copied_symbol.second->identifier()) + "))\n";
|
||||
decl_stmt->addComment(dir_str.c_str());
|
||||
|
||||
created_copies.insert({ array_to_copy, copied.second });
|
||||
created_copies.insert({ array_to_copy, copied_symbol.second });
|
||||
|
||||
// make array-copy allocatable in case of main array shape not constant
|
||||
if(checkDynamicArray(array_p))
|
||||
// make array copy allocatable in case of assumed-shape array
|
||||
if(dynamic_array)
|
||||
{
|
||||
// insert allocatable keyword in declaration
|
||||
auto *kword_list = decl->expr(2);
|
||||
if (!findAlloatableKeyword(kword_list))
|
||||
auto *kword_list = decl_stmt->expr(2);
|
||||
if (!findExprWithVariant(kword_list, ALLOCATABLE_OP))
|
||||
{
|
||||
if (!kword_list)
|
||||
{
|
||||
kword_list = new SgExprListExp();
|
||||
decl->setExpression(2, *kword_list);
|
||||
decl_stmt->setExpression(2, *kword_list);
|
||||
}
|
||||
|
||||
while (kword_list->rhs())
|
||||
@@ -653,29 +734,30 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
kword_list->setLhs(new SgExpression(ALLOCATABLE_OP));
|
||||
}
|
||||
|
||||
// can't switch back to file with array usage
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
// insert allocate(a_l(lbound(a, 1):ubound(a,1),...)) statement
|
||||
SgFile::switchToFile(filename);
|
||||
SgStatement* insertPlace = NULL;
|
||||
SgStatement* allocate_stmt_place = NULL;
|
||||
|
||||
auto* func_stmt = curr_stmt->getScopeForDeclare();
|
||||
for (auto iterator = func_stmt->lexNext();
|
||||
!isSgExecutableStatement(iterator) || isSPF_stat(iterator) &&
|
||||
!(iterator->variant() == SPF_PARALLEL_REG_DIR || iterator->variant() == SPF_END_PARALLEL_REG_DIR);
|
||||
iterator && !isSgExecutableStatement(iterator);
|
||||
iterator = iterator->lexNext())
|
||||
{
|
||||
insertPlace = iterator;
|
||||
allocate_stmt_place = iterator;
|
||||
}
|
||||
|
||||
//NULL - no decl stats in function!
|
||||
if (!insertPlace)
|
||||
insertPlace = func_stmt;
|
||||
if (!allocate_stmt_place)
|
||||
allocate_stmt_place = func_stmt;
|
||||
|
||||
auto st = insertPlace->controlParent();
|
||||
if (st->variant() == GLOBAL)
|
||||
st = insertPlace;
|
||||
auto *allocate_stmt_parent = allocate_stmt_place->controlParent();
|
||||
if (allocate_stmt_parent->variant() == GLOBAL)
|
||||
allocate_stmt_parent = allocate_stmt_place;
|
||||
|
||||
auto *stat = new SgStatement(ALLOCATE_STMT);
|
||||
auto *created_array_ref = new SgArrayRefExp(*copied.second);
|
||||
auto *created_array_ref = new SgArrayRefExp(*copied_symbol.second);
|
||||
|
||||
auto* dim_list = new SgExprListExp();
|
||||
created_array_ref->setLhs(dim_list);
|
||||
@@ -708,9 +790,10 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
}
|
||||
}
|
||||
|
||||
stat->setExpression(0, created_array_ref);
|
||||
auto *allocate_stmt = new SgStatement(ALLOCATE_STMT);
|
||||
allocate_stmt->setExpression(0, created_array_ref);
|
||||
|
||||
insertPlace->insertStmtAfter(*stat, *st);
|
||||
allocate_stmt_place->insertStmtAfter(*allocate_stmt, *allocate_stmt_parent);
|
||||
|
||||
// insert deallocate statemens before all returns
|
||||
auto *find_return_stmt = func_stmt;
|
||||
@@ -728,7 +811,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
auto *dealloc_stmt = new SgStatement(DEALLOCATE_STMT);
|
||||
|
||||
dealloc_stmt->setExpression(0, new SgExprListExp());
|
||||
dealloc_stmt->expr(0)->setLhs(new SgArrayRefExp(*copied.second));
|
||||
dealloc_stmt->expr(0)->setLhs(new SgArrayRefExp(*copied_symbol.second));
|
||||
|
||||
find_return_stmt->insertStmtAfter(*dealloc_stmt, *next->controlParent());
|
||||
|
||||
@@ -740,9 +823,9 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
}
|
||||
}
|
||||
|
||||
SgFile::switchToFile(filename);
|
||||
|
||||
|
||||
// can't switch back to file with array usage
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
}
|
||||
}
|
||||
|
||||
@@ -754,7 +837,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
{
|
||||
auto it = created_copies.find(p.first);
|
||||
if (it != created_copies.end())
|
||||
replaceArrayInFragment(p.first, p.second, it->second, last_io_bound, curr_stmt, current_func_info, filename);
|
||||
replaceArrayInFragment(p.first, p.second, it->second, last_io_bound, curr_stmt, current_func_info);
|
||||
else
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
}
|
||||
@@ -774,7 +857,17 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
}
|
||||
}
|
||||
|
||||
populateDistributedIoArrays(need_replace, curr_stmt, filename);
|
||||
auto need_fix_io = populateDistributedIoArrays(need_replace, curr_stmt, current_file_name, current_func_info);
|
||||
|
||||
// incorrect IO statement with label
|
||||
// move label to dummy statement and insert copy statements between dummy statement and IO
|
||||
if (need_fix_io && curr_stmt->hasLabel())
|
||||
{
|
||||
moveLabelBefore(curr_stmt);
|
||||
if (last_io_bound == curr_stmt) // always true
|
||||
last_io_bound = curr_stmt->lexPrev();
|
||||
}
|
||||
|
||||
curr_stmt = curr_stmt->lexNext();
|
||||
}
|
||||
}
|
||||
|
||||
@@ -316,7 +316,8 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
||||
|
||||
list({ VERIFY_INCLUDES, CORRECT_VAR_DECL }) <= Pass(SET_IMPLICIT_NONE);
|
||||
|
||||
list({ CALL_GRAPH2, CALL_GRAPH, BUILD_IR, LOOP_GRAPH, LOOP_ANALYZER_DATA_DIST_S2 }) <= Pass(FIND_PRIVATE_ARRAYS);
|
||||
list({ CALL_GRAPH2, CALL_GRAPH, BUILD_IR, LOOP_GRAPH, LOOP_ANALYZER_DATA_DIST_S2 }) <= Pass(FIND_PRIVATE_ARRAYS_ANALYSIS);
|
||||
list({ FIND_PRIVATE_ARRAYS_ANALYSIS, CONVERT_LOOP_TO_ASSIGN, RESTORE_LOOP_FROM_ASSIGN, REVERT_SUBST_EXPR_RD }) <= Pass(FIND_PRIVATE_ARRAYS);
|
||||
|
||||
passesIgnoreStateDone.insert({ CREATE_PARALLEL_DIRS, INSERT_PARALLEL_DIRS, INSERT_SHADOW_DIRS, EXTRACT_PARALLEL_DIRS,
|
||||
EXTRACT_SHADOW_DIRS, CREATE_REMOTES, UNPARSE_FILE, REMOVE_AND_CALC_SHADOW,
|
||||
|
||||
@@ -390,31 +390,14 @@ void clearGlobalBuffer() { globalOutputBuffer = ""; }
|
||||
const string& getGlobalBuffer() { return globalOutputBuffer; }
|
||||
|
||||
set<short*> allocated;
|
||||
set<int*> allocatedInt;
|
||||
static void convertGlobalBuffer(short *&result, int *&resultSize)
|
||||
{
|
||||
const unsigned len = (unsigned)globalOutputBuffer.size();
|
||||
result = new short[len + 1];
|
||||
allocated.insert(result);
|
||||
|
||||
result[len] = '\0';
|
||||
for (unsigned i = 0; i < len; ++i)
|
||||
result[i] = globalOutputBuffer[i];
|
||||
|
||||
resultSize = new int[1];
|
||||
resultSize[0] = (int)len;
|
||||
}
|
||||
|
||||
extern map<string, vector<Messages>> SPF_messages; //file ->messages
|
||||
void clearGlobalMessagesBuffer()
|
||||
{
|
||||
//clear allocated memory
|
||||
for (auto& elem : allocated)
|
||||
delete[]elem;
|
||||
for (auto& elem : allocatedInt)
|
||||
delete[]elem;
|
||||
delete []elem;
|
||||
allocated.clear();
|
||||
allocatedInt.clear();
|
||||
|
||||
|
||||
SPF_messages.clear();
|
||||
}
|
||||
@@ -451,7 +434,7 @@ static map<string, vector<Messages>> removeCopies(map<string, vector<Messages>>
|
||||
return out;
|
||||
}
|
||||
|
||||
static void convertGlobalMessagesBuffer(short *&result, int *&resultSize)
|
||||
static string convertGlobalMessagesBuffer()
|
||||
{
|
||||
auto copySPF_messages = removeCopies(SPF_messages);
|
||||
for (auto &byFile : copySPF_messages)
|
||||
@@ -489,21 +472,13 @@ static void convertGlobalMessagesBuffer(short *&result, int *&resultSize)
|
||||
json all;
|
||||
all["allMessages"] = allMessages;
|
||||
|
||||
const string str = all.dump();
|
||||
const unsigned len = (unsigned)str.size();
|
||||
|
||||
copyStringToShort(result, str);
|
||||
allocated.insert(result);
|
||||
|
||||
resultSize = new int[1];
|
||||
resultSize[0] = (int)len;
|
||||
return all.dump();
|
||||
}
|
||||
|
||||
|
||||
void convertBuffers(short*& resultM, int*& resultSizeM, short*& result, int*& resultSize)
|
||||
void convertBuffers(string &resultM, string &result)
|
||||
{
|
||||
convertGlobalMessagesBuffer(resultM, resultSizeM);
|
||||
convertGlobalBuffer(result, resultSize);
|
||||
resultM = convertGlobalMessagesBuffer();
|
||||
result = getGlobalBuffer();
|
||||
}
|
||||
|
||||
bool isSPF_comment(const string &bufStr)
|
||||
|
||||
@@ -33,7 +33,7 @@ void addToGlobalBufferAndPrint(const std::string &toPrint);
|
||||
void clearGlobalBuffer();
|
||||
const std::string& getGlobalBuffer();
|
||||
std::wstring to_wstring(const std::string);
|
||||
void convertBuffers(short*& resultM, int*& resultSizeM, short*& result, int*& resultSize);
|
||||
void convertBuffers(std::string& resultM, std::string& result);
|
||||
void clearGlobalMessagesBuffer();
|
||||
std::string renameInclude(const std::string& inc);
|
||||
void copyIncludes(const std::set<std::string> &allIncludeFiles, const std::map<std::string, std::map<int, std::set<std::string>>> &commentsToInclude, const std::map<std::string, std::map<int, std::set<std::string>>>& newCopyDeclToIncl, const char *folderName, bool keepSpfDirs, bool isFreeStyle, bool isRename, int removeDirs = 0);
|
||||
|
||||
@@ -1,3 +1,3 @@
|
||||
#pragma once
|
||||
|
||||
#define VERSION_SPF "2440"
|
||||
#define VERSION_SPF "2450"
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user