16 Commits

Author SHA1 Message Date
b5c923193c REMOVE_DIST_ARRAYS_FROM_IO: handle assumed-size and assumed-shape arrays 2025-08-17 15:54:18 +03:00
ALEXks
278fc1ff9c fixed replace_dist_array pass: added more file switching 2025-07-27 08:52:28 +03:00
ALEXks
80eac5b957 fixed region inserter 2025-07-27 08:20:36 +03:00
ALEXks
0c9eed4bb7 fixed transformation 2025-07-27 07:59:25 +03:00
ALEXks
d3d6d0bec7 added TRANSFORM_ASSUMED_SIZE_PARAMETERS pass, fixed shared memory parallelization 2025-07-26 20:22:15 +03:00
ALEXks
3095510826 improved cmake 2025-07-22 08:54:21 +03:00
ALEXks
85e2a60183 removed createInterfacesForAssumedSize call 2025-07-09 14:46:29 +03:00
ALEXks
68bd21b7b0 fixed inout analysis for function's parameters 2025-07-09 12:00:27 +03:00
ALEXks
177433a95b turn off createInterfacesForAssumedSize call 2025-07-05 20:58:12 +03:00
ALEXks
29ece9072e fixed shared memory parallelization 2025-07-05 20:49:23 +03:00
ALEXks
feafa43f32 fixed declare insertion 2025-07-02 12:02:30 +03:00
ALEXks
b8f429256f added removedUnreachableBlocks call for buildCFG 2025-06-29 16:02:37 +03:00
ALEXks
2f53d6ae2e fixed 2025-06-22 09:22:10 +03:00
ALEXks
65237e4d63 added inductive variables and loop type to LoopGraph 2025-06-22 09:19:37 +03:00
ALEXks
7533739488 moved to removedUnreachableBlocks 2025-06-18 16:26:43 +03:00
c1d31b809b Merge pull request 'REMOVE_DIST_ARRAYS_FROM_IO: improve parsing of IO operators, fix substitution borders' (#63) from replace_io_arrays into master
Reviewed-on: #63
2025-06-15 17:07:00 +00:00
26 changed files with 699 additions and 380 deletions

View File

@@ -12,6 +12,7 @@ add_definitions("-D SYS5")
add_definitions("-D YYDEBUG") add_definitions("-D YYDEBUG")
set(CMAKE_CXX_STANDARD 17) set(CMAKE_CXX_STANDARD 17)
set(CMAKE_C_STANDARD 17)
set(fdvm_include projects/dvm/fdvmh/include/fdvmh/) set(fdvm_include projects/dvm/fdvmh/include/fdvmh/)
set(fdvm_sources projects/dvm/fdvmh/tools/fdvmh/) set(fdvm_sources projects/dvm/fdvmh/tools/fdvmh/)
@@ -33,6 +34,7 @@ include_directories(src/Distribution)
include_directories(src/GraphCall) include_directories(src/GraphCall)
include_directories(src/GraphLoop) include_directories(src/GraphLoop)
include_directories(src/Transformations/ExpressionSubstitution) include_directories(src/Transformations/ExpressionSubstitution)
include_directories(src/Transformations)
#Sage lib includes #Sage lib includes
include_directories(${fdvm_include}) include_directories(${fdvm_include})

View File

@@ -1162,6 +1162,9 @@ map<FuncInfo*, vector<BBlock*>> buildCFG(const map<string, CommonBlock*>& common
if (SgFile::switchToFile(oldFile) == -1) if (SgFile::switchToFile(oldFile) == -1)
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
for (auto& [func, blocks] : result)
removedUnreachableBlocks(blocks);
return result; return result;
} }
@@ -1237,3 +1240,48 @@ map<FuncInfo*, vector<SAPFOR::BasicBlock*>>
return buildCFG(commonBlocks, fileFuncInfoMap, settings); return buildCFG(commonBlocks, fileFuncInfoMap, settings);
} }
void removedUnreachableBlocks(vector<SAPFOR::BasicBlock*>& blocks)
{
set<SAPFOR::BasicBlock*> reachable;
for (auto& b : blocks)
if (b->getInstructions().front()->isHeader() ||
b->getInstructions().front()->getInstruction()->getOperation() == SAPFOR::CFG_OP::ENTRY)
reachable.insert(b);
set<SAPFOR::BasicBlock*> worklist = reachable;
while (worklist.size() != 0)
{
set<SAPFOR::BasicBlock*> to_insert;
for (auto& b : worklist)
for (auto& next : b->getNext())
if (reachable.insert(next).second)
to_insert.insert(next);
worklist = to_insert;
}
auto remove_unreachable_it = remove_if(blocks.begin(), blocks.end(),
[&reachable](SAPFOR::BasicBlock* b)
{
if (reachable.find(b) == reachable.end())
{
for (auto& next : b->getNext())
if (reachable.find(next) != reachable.end())
next->removePrev(b);
delete b;
return true;
}
return false;
}
);
reachable.clear();
blocks.erase(remove_unreachable_it, blocks.end());
}

View File

@@ -156,3 +156,5 @@ static inline void deleteCFG(std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*
} }
cfg.clear(); cfg.clear();
} }
void removedUnreachableBlocks(std::vector<SAPFOR::BasicBlock*>& blocks);

View File

@@ -250,7 +250,7 @@ static set<SAPFOR::BasicBlock*> analyzeLoop(LoopGraph* loop, const set<SAPFOR::B
const map<string, SgSymbol*>& commonArgs, FuncInfo* func, const map<string, SgSymbol*>& commonArgs, FuncInfo* func,
map<string, vector<Messages>>& messages) map<string, vector<Messages>>& messages)
{ {
if (!loop->isFor) if (!loop->isFor())
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); //should be called only with FOR loops printInternalError(convertFileName(__FILE__).c_str(), __LINE__); //should be called only with FOR loops
SgStatement* loop_operator = loop->loop->GetOriginal(); SgStatement* loop_operator = loop->loop->GetOriginal();
@@ -450,7 +450,7 @@ static void recAnalyzeLoop(LoopGraph* loop, const set<SAPFOR::BasicBlock*>& bloc
const map<string, SgSymbol*>& commonArgs, const map<string, SgSymbol*>& commonArgs,
FuncInfo* func, map<string, vector<Messages>>& messages) FuncInfo* func, map<string, vector<Messages>>& messages)
{ {
const auto& loop_body = loop->isFor ? analyzeLoop(loop, blocks, commonVars, commonArgs, func, messages) : blocks; const auto& loop_body = loop->isFor() ? analyzeLoop(loop, blocks, commonVars, commonArgs, func, messages) : blocks;
for (const auto& inner_loop : loop->children) for (const auto& inner_loop : loop->children)
recAnalyzeLoop(inner_loop, loop_body, commonVars, commonArgs, func, messages); recAnalyzeLoop(inner_loop, loop_body, commonVars, commonArgs, func, messages);

View File

@@ -22,7 +22,7 @@
#include "SgUtils.h" #include "SgUtils.h"
#include "../Sapfor.h" #include "../Sapfor.h"
#include "graph_loops_func.h" #include "graph_loops_func.h"
#include "../Transformations/LoopNesting/loop_transform.h" #include "LoopNesting/loop_transform.h"
#include "expr_transform.h" #include "expr_transform.h"
#include "graph_calls_func.h" #include "graph_calls_func.h"

View File

@@ -10,7 +10,7 @@
#include "../ParallelizationRegions/ParRegions.h" #include "../ParallelizationRegions/ParRegions.h"
#include "../Distribution/Arrays.h" #include "../Distribution/Arrays.h"
#include "../Transformations/LoopNesting/loop_transform.h" #include "LoopNesting/loop_transform.h"
#include "errors.h" #include "errors.h"
#include "directive_parser.h" #include "directive_parser.h"
@@ -75,7 +75,7 @@ static LoopGraph* createDirectiveForLoop(LoopGraph *currentLoop, MapToArray &mai
} }
} }
directive->parallel.push_back(currentLoop->loopSymbol); directive->parallel.push_back(currentLoop->loopSymbol());
directive->arrayRef = mainArray.arrayRef; directive->arrayRef = mainArray.arrayRef;
DIST::Array *tmp = mainArray.arrayRef; DIST::Array *tmp = mainArray.arrayRef;
@@ -84,7 +84,7 @@ static LoopGraph* createDirectiveForLoop(LoopGraph *currentLoop, MapToArray &mai
for (int i = 0; i < tmp->GetDimSize(); ++i) for (int i = 0; i < tmp->GetDimSize(); ++i)
{ {
if (i == pos) if (i == pos)
directive->on.push_back(make_pair(currentLoop->loopSymbol, mainAccess)); directive->on.push_back(make_pair(currentLoop->loopSymbol(), mainAccess));
else else
directive->on.push_back(make_pair("*", make_pair(0, 0))); directive->on.push_back(make_pair("*", make_pair(0, 0)));
} }
@@ -808,7 +808,7 @@ void createParallelDirectives(const map<LoopGraph*, map<DIST::Array*, ArrayInfo*
for (int i = 0; i < mainArrayOfLoop->GetDimSize(); ++i) for (int i = 0; i < mainArrayOfLoop->GetDimSize(); ++i)
{ {
if (i == dimPos) if (i == dimPos)
parDir->on2.push_back(make_pair(currLoop->loopSymbol, mainAccess)); parDir->on2.push_back(make_pair(currLoop->loopSymbol(), mainAccess));
else else
parDir->on2.push_back(make_pair("*", make_pair(0, 0))); parDir->on2.push_back(make_pair("*", make_pair(0, 0)));
} }
@@ -1100,7 +1100,7 @@ static bool tryToResolveUnmatchedDims(const map<DIST::Array*, vector<bool>> &dim
LoopGraph* tmpL = loop; LoopGraph* tmpL = loop;
for (int z = 0; z < nested; ++z) for (int z = 0; z < nested; ++z)
{ {
deprecateToMatch.insert(tmpL->loopSymbol); deprecateToMatch.insert(tmpL->loopSymbol());
if (tmpL->children.size()) if (tmpL->children.size())
tmpL = tmpL->children[0]; tmpL = tmpL->children[0];
else if (z != nested - 1) else if (z != nested - 1)
@@ -1113,7 +1113,7 @@ static bool tryToResolveUnmatchedDims(const map<DIST::Array*, vector<bool>> &dim
tmpL = loop->parent; tmpL = loop->parent;
while (tmpL) while (tmpL)
{ {
if (!tmpL->isFor) // TODO: need to add all inductive variables! if (tmpL->isWhile()) // TODO: need to add all inductive variables!
{ {
SgWhileStmt* dow = isSgWhileStmt(tmpL->loop->GetOriginal()); SgWhileStmt* dow = isSgWhileStmt(tmpL->loop->GetOriginal());
if (dow->conditional()) if (dow->conditional())
@@ -1124,7 +1124,7 @@ static bool tryToResolveUnmatchedDims(const map<DIST::Array*, vector<bool>> &dim
} }
} }
else else
deprecateToMatch.insert(tmpL->loopSymbol); deprecateToMatch.insert(tmpL->loopSymbol());
tmpL = tmpL->parent; tmpL = tmpL->parent;
} }

View File

@@ -346,7 +346,7 @@ static vector<SgExpression*>
{ {
needToAdd = true; needToAdd = true;
dim_found = true; dim_found = true;
subs[i] = new SgVarRefExp(findSymbolOrCreate(file, currLoop->loopSymbol)); subs[i] = new SgVarRefExp(findSymbolOrCreate(file, currLoop->loopSymbol()));
break; break;
} }
} }

View File

@@ -11,9 +11,9 @@
#include "DvmhRegionInserter.h" #include "DvmhRegionInserter.h"
#include "DvmhRegions/RegionsMerger.h" #include "DvmhRegions/RegionsMerger.h"
#include "../VerificationCode/verifications.h" #include "../VerificationCode/verifications.h"
#include "../Transformations/FunctionPurifying/function_purifying.h"
#include "../LoopAnalyzer/loop_analyzer.h" #include "../LoopAnalyzer/loop_analyzer.h"
#include "../DirectiveProcessing/directive_parser.h" #include "../DirectiveProcessing/directive_parser.h"
#include "FunctionPurifying/function_purifying.h"
using namespace std; using namespace std;
@@ -794,154 +794,6 @@ ArraySet DvmhRegionInserter::get_used_arrs_for_block(SgStatement* st, int usage_
return usages; return usages;
} }
static bool filterFromList(SgStatement* st, const set<string>& idents, bool exclude = false)
{
bool empty = false;
SgExpression* list = st->expr(0);
vector<SgExpression*> newList;
int total = 0;
while (list)
{
if (exclude)
{
if (idents.find(list->lhs()->symbol()->identifier()) == idents.end())
newList.push_back(list->lhs());
}
else
{
if (idents.find(list->lhs()->symbol()->identifier()) != idents.end())
newList.push_back(list->lhs());
}
total++;
list = list->rhs();
}
if (newList.size() == 0)
empty = true;
else if (total != newList.size())
st->setExpression(0, makeExprList(newList));
return empty;
}
static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
{
string oldFile = current_file->filename();
if (!func->switchToFile())
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
auto copy = duplicateProcedure(func, NULL, false, false, false, true);
const set<string> idents(pars.identificators.begin(), pars.identificators.end());
bool need = (func->symbol()->identifier() == string("bl182"));
//remove all exec
SgStatement* st = copy->lexNext();
SgStatement* last = copy->lastNodeOfStmt();
vector<SgStatement*> toExtract;
while (st != last)
{
if (isDVM_stat(st) || isSPF_stat(st))
{
if (st->variant() != ACC_ROUTINE_DIR)
{
toExtract.push_back(st);
st = st->lexNext();
}
else
st = st->lexNext();
}
else if (isSgExecutableStatement(st))
{
SgStatement* next = st->lastNodeOfStmt();
if (next != last)
next = next->lexNext();
toExtract.push_back(st);
st = next;
}
else
st = st->lexNext();
}
//remove unused declarations
st = copy->lexNext();
while (st != last)
{
const int var = st->variant();
if (var == VAR_DECL
|| var == VAR_DECL_90
|| var == DIM_STAT
|| var == INTENT_STMT
|| var == EXTERN_STAT)
{
bool empty = filterFromList(st, idents);
if (empty)
{
toExtract.push_back(st);
st = st->lexNext();
continue;
}
}
else if (!isDVM_stat(st) && !isSPF_stat(st))
toExtract.push_back(st);
if (st->variant() == CONTAINS_STMT)
break;
st = st->lexNext();
}
for (auto& elem : toExtract)
elem->extractStmt();
string retVal = copy->unparse();
if (SgFile::switchToFile(oldFile) == -1)
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
return retVal;
}
static void insertInterface(SgStatement* func, const string& iface, const string& fName)
{
string oldFile = current_file->filename();
if (!func->switchToFile())
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
SgStatement* st = func->lexNext();
SgStatement* last = func->lastNodeOfStmt();
while (st != last)
{
if (st->variant() == VAR_DECL || st->variant() == VAR_DECL_90)
{
bool empty = filterFromList(st, { fName }, true);
if (empty)
{
SgStatement* next = st->lexNext();
st->extractStmt();
st = next;
continue;
}
}
if (isSgExecutableStatement(st))
break;
st = st->lexNext();
}
SgStatement* ifaceBlock = new SgStatement(INTERFACE_STMT);
addControlEndToStmt(ifaceBlock->thebif);
ifaceBlock->setlineNumber(getNextNegativeLineNumber()); // st->lineNumber()
ifaceBlock->setFileName(st->fileName());
st->insertStmtBefore(*ifaceBlock, *st->controlParent());
ifaceBlock->lastNodeOfStmt()->addComment(iface.c_str());
if (SgFile::switchToFile(oldFile) == -1)
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
}
static LoopGraph* getParallelLoop(LoopGraph* loop) static LoopGraph* getParallelLoop(LoopGraph* loop)
{ {
auto prev_st = loop->loop->lexPrev(); auto prev_st = loop->loop->lexPrev();
@@ -1172,7 +1024,7 @@ static bool isPure(SgStatement* func)
void DvmhRegionInserter::createInterfaceBlockForOutCall(FuncInfo* func, FuncInfo* callFrom) void DvmhRegionInserter::createInterfaceBlockForOutCall(FuncInfo* func, FuncInfo* callFrom)
{ {
insertInterface(func->funcPointer, getInterfaceBlock(callFrom->funcPointer->GetOriginal(), callFrom->funcParams), callFrom->funcName); insertInterface(func->funcPointer, callFrom);
} }
void DvmhRegionInserter::createInterfaceBlockForParallelFunctions(bool onlyRoutine) void DvmhRegionInserter::createInterfaceBlockForParallelFunctions(bool onlyRoutine)
@@ -1446,6 +1298,9 @@ static set<DIST::Array*>
declStat = SgStatement::getStatementByFileAndLine(decl.first, decl.second); declStat = SgStatement::getStatementByFileAndLine(decl.first, decl.second);
if (declStat == NULL) // check in inlcudes if (declStat == NULL) // check in inlcudes
{ {
if (!main->switchToFile())
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
for (auto st = main; st != main->lastNodeOfStmt() && !declStat; st = st->lexNext()) for (auto st = main; st != main->lastNodeOfStmt() && !declStat; st = st->lexNext())
{ {
if (st->fileName() == decl.first && st->lineNumber() == decl.second) if (st->fileName() == decl.first && st->lineNumber() == decl.second)
@@ -1457,7 +1312,7 @@ static set<DIST::Array*>
} }
else else
{ {
declStat = getFuncStat(declStat); declStat = getFuncStat(declStat, { BLOCK_DATA });
if (declStat != main) if (declStat != main)
{ {
declStat = NULL; declStat = NULL;

View File

@@ -779,6 +779,20 @@ static void checkSpecList(SgExpression *spec, FuncInfo* currF, const map<string,
} }
} }
static void checkInTypeDescription(SgExpression *ex, FuncInfo* currF, const map<string, int>& parNames)
{
if (ex)
{
if (ex->variant() == ARRAY_REF)
fillIn(currF, ex->lhs(), parNames, false);
else
{
checkInTypeDescription(ex->lhs(), currF, parNames);
checkInTypeDescription(ex->rhs(), currF, parNames);
}
}
}
static void fillInOut(FuncInfo *currF, SgStatement *start, SgStatement *last, const set<SgStatement*>& activeOps) static void fillInOut(FuncInfo *currF, SgStatement *start, SgStatement *last, const set<SgStatement*>& activeOps)
{ {
if (currF->funcParams.countOfPars == 0) if (currF->funcParams.countOfPars == 0)
@@ -799,7 +813,12 @@ static void fillInOut(FuncInfo *currF, SgStatement *start, SgStatement *last, co
if (st->variant() == ENTRY_STAT) if (st->variant() == ENTRY_STAT)
continue; continue;
if (isSgExecutableStatement(st) == NULL || st->lineNumber() <= 0) if (isSgExecutableStatement(st) == NULL) {
checkInTypeDescription(st->expr(0), currF, parNames);
continue;
}
if (st->lineNumber() <= 0)
continue; continue;
if (activeOps.size() && activeOps.find(st) == activeOps.end()) if (activeOps.size() && activeOps.find(st) == activeOps.end())

View File

@@ -31,7 +31,7 @@
#include "../DirectiveProcessing/directive_parser.h" #include "../DirectiveProcessing/directive_parser.h"
#include "../DynamicAnalysis/gCov_parser_func.h" #include "../DynamicAnalysis/gCov_parser_func.h"
#include "../Transformations/VectorAssignToLoop/array_assign_to_loop.h" #include "VectorAssignToLoop/array_assign_to_loop.h"
using std::vector; using std::vector;
using std::map; using std::map;
@@ -699,7 +699,12 @@ void loopGraphAnalyzer(SgFile *file, vector<LoopGraph*> &loopGraph, const vector
newLoop->hasPrints = hasThisIds(st, newLoop->linesOfIO, { WRITE_STAT, READ_STAT, OPEN_STAT, CLOSE_STAT, PRINT_STAT } ); // FORMAT_STAT newLoop->hasPrints = hasThisIds(st, newLoop->linesOfIO, { WRITE_STAT, READ_STAT, OPEN_STAT, CLOSE_STAT, PRINT_STAT } ); // FORMAT_STAT
newLoop->hasStops = hasThisIds(st, newLoop->linesOfStop, { STOP_STAT, PAUSE_NODE }); newLoop->hasStops = hasThisIds(st, newLoop->linesOfStop, { STOP_STAT, PAUSE_NODE });
newLoop->hasDvmIntervals = hasThisIds(st, tmpLines, { DVM_INTERVAL_DIR, DVM_ENDINTERVAL_DIR, DVM_EXIT_INTERVAL_DIR }); newLoop->hasDvmIntervals = hasThisIds(st, tmpLines, { DVM_INTERVAL_DIR, DVM_ENDINTERVAL_DIR, DVM_EXIT_INTERVAL_DIR });
newLoop->isFor = isSgForStmt(st) ? true : false; if (isSgForStmt(st))
newLoop->loopType = LoopType::FOR;
else if (isSgWhileStmt(st))
newLoop->loopType = LoopType::WHILE;
else
newLoop->loopType = LoopType::NONE;
newLoop->inCanonicalFrom = isSgForStmt(st) ? true : false; newLoop->inCanonicalFrom = isSgForStmt(st) ? true : false;
newLoop->hasSubstringRefs = hasSubstringRef(st); newLoop->hasSubstringRefs = hasSubstringRef(st);
@@ -777,7 +782,7 @@ void loopGraphAnalyzer(SgFile *file, vector<LoopGraph*> &loopGraph, const vector
newLoop->startEndExpr = std::make_pair((Expression*)NULL, (Expression*)NULL); newLoop->startEndExpr = std::make_pair((Expression*)NULL, (Expression*)NULL);
newLoop->loop = new Statement(st); newLoop->loop = new Statement(st);
newLoop->loopSymbol = st->symbol() ? st->symbol()->identifier() : "unknown"; newLoop->loopSymbols.addMainVar(st->symbol() ? st->symbol()->identifier() : "unknown");
findArrayRefs(newLoop); findArrayRefs(newLoop);
SgStatement *lexPrev = st->lexPrev(); SgStatement *lexPrev = st->lexPrev();

View File

@@ -25,6 +25,33 @@ namespace DIST = Distribution;
void getRealArrayRefs(DIST::Array* addTo, DIST::Array* curr, std::set<DIST::Array*>& realArrayRefs, const std::map<DIST::Array*, std::set<DIST::Array*>>& arrayLinksByFuncCalls); void getRealArrayRefs(DIST::Array* addTo, DIST::Array* curr, std::set<DIST::Array*>& realArrayRefs, const std::map<DIST::Array*, std::set<DIST::Array*>>& arrayLinksByFuncCalls);
void getAllArrayRefs(DIST::Array* addTo, DIST::Array* curr, std::set<DIST::Array*>& realArrayRefs, const std::map<DIST::Array*, std::set<DIST::Array*>>& arrayLinksByFuncCalls); void getAllArrayRefs(DIST::Array* addTo, DIST::Array* curr, std::set<DIST::Array*>& realArrayRefs, const std::map<DIST::Array*, std::set<DIST::Array*>>& arrayLinksByFuncCalls);
enum class LoopType { NONE, FOR, WHILE, IMPLICIT };
struct InductiveVariables
{
private:
std::string mainVar;
std::set<std::string> allVars;
public:
InductiveVariables() { }
explicit InductiveVariables(const std::string& mainVar, const std::set<std::string>& allVars) : mainVar(mainVar), allVars(allVars) { };
std::string getMainVar() const { return mainVar; }
std::set<std::string> getAllVars() const { return allVars; }
void addVar(const std::string& var) { allVars.insert(var); }
void addMainVar(const std::string& var) { mainVar = var; allVars.insert(var); }
void replaceMainVar(const std::string& var)
{
allVars.erase(mainVar);
addMainVar(var);
}
};
struct LoopGraph struct LoopGraph
{ {
private: private:
@@ -70,7 +97,7 @@ public:
calculatedCountOfIters = 0; calculatedCountOfIters = 0;
executionTimeInSec = -1.0; executionTimeInSec = -1.0;
inDvmhRegion = 0; inDvmhRegion = 0;
isFor = false; loopType = LoopType::NONE;
inCanonicalFrom = false; inCanonicalFrom = false;
hasAccessToSubArray = false; hasAccessToSubArray = false;
hasSubstringRefs = false; hasSubstringRefs = false;
@@ -113,21 +140,24 @@ public:
{ {
return hasUnknownArrayDep || hasUnknownScalarDep || hasGoto || hasPrints || (hasConflicts.size() != 0) || hasStops || hasNonPureProcedures || return hasUnknownArrayDep || hasUnknownScalarDep || hasGoto || hasPrints || (hasConflicts.size() != 0) || hasStops || hasNonPureProcedures ||
hasUnknownArrayAssigns || hasNonRectangularBounds || hasIndirectAccess || hasWritesToNonDistribute || hasDifferentAlignRules || hasDvmIntervals || hasUnknownArrayAssigns || hasNonRectangularBounds || hasIndirectAccess || hasWritesToNonDistribute || hasDifferentAlignRules || hasDvmIntervals ||
!isFor || lastprivateScalars.size() || hasAccessToSubArray || hasSubstringRefs; !isFor() || lastprivateScalars.size() || hasAccessToSubArray || hasSubstringRefs;
} }
bool hasLimitsToSplit() const bool hasLimitsToSplit() const
{ {
return hasGoto || hasStops || !isFor || hasPrints; return hasGoto || hasStops || !isFor() || hasPrints;
} }
bool hasLimitsToCombine() const bool hasLimitsToCombine() const
{ {
return hasGoto || hasStops || !isFor || hasPrints || linesOfCycle.size(); return hasGoto || hasStops || !isFor() || hasPrints || linesOfCycle.size();
} }
void addConflictMessages(std::vector<Messages> *messages) void addConflictMessages(std::vector<Messages> *messages)
{ {
if (messages == NULL)
return;
const int line = altLineNum > 0 ? altLineNum : lineNum; const int line = altLineNum > 0 ? altLineNum : lineNum;
if (hasUnknownArrayDep) if (hasUnknownArrayDep)
messages->push_back(Messages(NOTE, line, R113, L"unknown array dependency prevents parallelization of this loop", 3006)); messages->push_back(Messages(NOTE, line, R113, L"unknown array dependency prevents parallelization of this loop", 3006));
@@ -168,7 +198,7 @@ public:
if (hasDvmIntervals) if (hasDvmIntervals)
messages->push_back(Messages(NOTE, line, R145, L"DVM intervals prevent parallelization of this loop", 3006)); messages->push_back(Messages(NOTE, line, R145, L"DVM intervals prevent parallelization of this loop", 3006));
if (!isFor || !inCanonicalFrom) if (!isFor() || !inCanonicalFrom)
messages->push_back(Messages(NOTE, line, R178, L"This type of loop is not supported by the system", 3006)); messages->push_back(Messages(NOTE, line, R178, L"This type of loop is not supported by the system", 3006));
if (lastprivateScalars.size()) if (lastprivateScalars.size())
@@ -393,6 +423,14 @@ public:
void* getRealStat(const char* file) const; void* getRealStat(const char* file) const;
bool isFor() const { return loopType == LoopType::FOR; }
bool isWhile() const { return loopType == LoopType::WHILE; }
bool isImplicit() const { return loopType == LoopType::IMPLICIT; }
std::string loopSymbol() const { return loopSymbols.getMainVar(); }
public: public:
int lineNum; int lineNum;
int altLineNum; int altLineNum;
@@ -407,7 +445,7 @@ public:
int startVal, endVal, stepVal; int startVal, endVal, stepVal;
std::tuple<Expression*, Expression*, Expression*> startEndStepVals; std::tuple<Expression*, Expression*, Expression*> startEndStepVals;
std::string loopSymbol; InductiveVariables loopSymbols;
std::pair<Expression*, Expression*> startEndExpr; std::pair<Expression*, Expression*> startEndExpr;
bool hasGoto; bool hasGoto;
@@ -448,7 +486,7 @@ public:
bool hasSubstringRefs; bool hasSubstringRefs;
bool isFor; LoopType loopType;
bool inCanonicalFrom; bool inCanonicalFrom;

View File

@@ -551,7 +551,7 @@ void addToDistributionGraph(const map<LoopGraph*, map<DIST::Array*, ArrayInfo*>>
continue; continue;
} }
if (!loopAccess.first->isFor) if (!loopAccess.first->isFor())
continue; continue;
DIST::GraphCSR<int, double, attrType>& G = currReg->GetGraphToModify(); DIST::GraphCSR<int, double, attrType>& G = currReg->GetGraphToModify();
@@ -775,7 +775,7 @@ static void isAllOk(const vector<LoopGraph*> &loops, vector<Messages> &currMessa
{ {
if (loops[i]->region) if (loops[i]->region)
{ {
if (loops[i]->countOfIters == 0 && loops[i]->region && loops[i]->isFor) if (loops[i]->countOfIters == 0 && loops[i]->region && loops[i]->isFor())
{ {
wstring bufE, bufR; wstring bufE, bufR;
__spf_printToLongBuf(bufE, L" Can not calculate count of iterations for this loop, information about iterations in all loops in parallel regions '%s' will be ignored", __spf_printToLongBuf(bufE, L" Can not calculate count of iterations for this loop, information about iterations in all loops in parallel regions '%s' will be ignored",

View File

@@ -48,7 +48,7 @@ extern int passDone;
#include "../VisualizerCalls/get_information.h" #include "../VisualizerCalls/get_information.h"
#include "../VisualizerCalls/SendMessage.h" #include "../VisualizerCalls/SendMessage.h"
#include "../Transformations/LoopEndDoConverter/enddo_loop_converter.h" #include "LoopEndDoConverter/enddo_loop_converter.h"
#include "../DirectiveProcessing/remote_access.h" #include "../DirectiveProcessing/remote_access.h"
#include "../DirectiveProcessing/directive_omp_parser.h" #include "../DirectiveProcessing/directive_omp_parser.h"
@@ -2199,7 +2199,7 @@ void loopAnalyzer(SgFile *file, vector<ParallelRegion*> &regions, map<tuple<int,
LoopGraph *tmpLoop = new LoopGraph(); LoopGraph *tmpLoop = new LoopGraph();
tmpLoop->region = reg; tmpLoop->region = reg;
tmpLoop->isFor = true; tmpLoop->loopType = LoopType::FOR;
tmpLoops.push_back(tmpLoop); tmpLoops.push_back(tmpLoop);

View File

@@ -18,7 +18,7 @@
#include "../DirectiveProcessing/insert_directive.h" #include "../DirectiveProcessing/insert_directive.h"
#include "SgUtils.h" #include "SgUtils.h"
#include "expr_transform.h" #include "expr_transform.h"
#include "../Transformations/FunctionPurifying/function_purifying.h" #include "FunctionPurifying/function_purifying.h"
using std::map; using std::map;
using std::pair; using std::pair;

View File

@@ -51,7 +51,7 @@ pair<SAPFOR::BasicBlock*, unordered_set<SAPFOR::BasicBlock*>> GetBasicBlocksForL
} }
static void BuildLoopIndex(map<string, LoopGraph*>& loopForIndex, LoopGraph* loop) { static void BuildLoopIndex(map<string, LoopGraph*>& loopForIndex, LoopGraph* loop) {
string index = loop->loopSymbol; string index = loop->loopSymbol();
loopForIndex[index] = loop; loopForIndex[index] = loop;
for (const auto& childLoop : loop->children) for (const auto& childLoop : loop->children)

View File

@@ -1281,7 +1281,6 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
detectCopies(allFuncInfo); detectCopies(allFuncInfo);
fillInterfaceBlock(allFuncInfo); fillInterfaceBlock(allFuncInfo);
intentInsertToInterfaces(allFuncInfo); intentInsertToInterfaces(allFuncInfo);
createInterfacesForAssumedSize(allFuncInfo);
//this call is only for testing //this call is only for testing
//setPureStatus(allFuncInfo); //setPureStatus(allFuncInfo);
@@ -1915,6 +1914,8 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
calculateStatsForPredictor(allFuncInfo, gCovInfo); calculateStatsForPredictor(allFuncInfo, gCovInfo);
parseDvmDirForPredictor(declaredArrays, commonBlocks, allFuncInfo, gCovInfo); parseDvmDirForPredictor(declaredArrays, commonBlocks, allFuncInfo, gCovInfo);
} }
else if (curr_regime == TRANSFORM_ASSUMED_SIZE_PARAMETERS)
transformAssumedSizeParameters(allFuncInfo);
const float elapsed = duration_cast<milliseconds>(high_resolution_clock::now() - timeForPass).count() / 1000.; 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.; const float elapsedGlobal = duration_cast<milliseconds>(high_resolution_clock::now() - globalTime).count() / 1000.;
@@ -2150,6 +2151,8 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
runAnalysis(*project, REMOVE_COPIES, false); runAnalysis(*project, REMOVE_COPIES, false);
runAnalysis(*project, SWAP_LOOPS, false); runAnalysis(*project, SWAP_LOOPS, false);
runPass(TRANSFORM_ASSUMED_SIZE_PARAMETERS, proj_name, folderName);
if (folderName || consoleMode) if (folderName || consoleMode)
runAnalysis(*project, UNPARSE_FILE, true, additionalName.c_str(), folderName); runAnalysis(*project, UNPARSE_FILE, true, additionalName.c_str(), folderName);
} }
@@ -2632,7 +2635,10 @@ int main(int argc, char **argv)
} }
if (curr_regime == INSERT_PARALLEL_DIRS_NODIST) if (curr_regime == INSERT_PARALLEL_DIRS_NODIST)
{
ignoreArrayDistributeState = true; ignoreArrayDistributeState = true;
sharedMemoryParallelization = 1;
}
if (runAsClient) if (runAsClient)
{ {

View File

@@ -185,6 +185,8 @@ enum passes {
FIND_PRIVATE_ARRAYS, FIND_PRIVATE_ARRAYS,
TRANSFORM_ASSUMED_SIZE_PARAMETERS,
TEST_PASS, TEST_PASS,
EMPTY_PASS EMPTY_PASS
}; };
@@ -371,6 +373,8 @@ static void setPassValues()
passNames[INSERT_NO_DISTR_FLAGS_FROM_GUI] = "INSERT_NO_DISTR_FLAGS_FROM_GUI"; passNames[INSERT_NO_DISTR_FLAGS_FROM_GUI] = "INSERT_NO_DISTR_FLAGS_FROM_GUI";
passNames[FIND_PRIVATE_ARRAYS] = "FIND_PRIVATE_ARRAYS"; passNames[FIND_PRIVATE_ARRAYS] = "FIND_PRIVATE_ARRAYS";
passNames[TRANSFORM_ASSUMED_SIZE_PARAMETERS] = "TRANSFORM_ASSUMED_SIZE_PARAMETERS";
passNames[TEST_PASS] = "TEST_PASS"; passNames[TEST_PASS] = "TEST_PASS";
} }

View File

@@ -6,6 +6,8 @@
#include <set> #include <set>
#include <algorithm> #include <algorithm>
#include "../../CFGraph/CFGraph.h"
using std::map; using std::map;
using std::string; using std::string;
using std::vector; using std::vector;
@@ -88,13 +90,13 @@ static void updateUseDefForInstruction(SAPFOR::BasicBlock* block, SAPFOR::Instru
instr_operation == SAPFOR::CFG_OP::STORE) instr_operation == SAPFOR::CFG_OP::STORE)
last_stack_op_useful = true; last_stack_op_useful = true;
for (auto e : res) for (auto& e : res)
{ {
def.insert(e); def.insert(e);
use.erase(e); use.erase(e);
} }
for (auto e : args) for (auto& e : args)
{ {
use.insert(e); use.insert(e);
def.erase(e); def.erase(e);
@@ -164,7 +166,7 @@ public:
{ {
const auto& example = dynamic_cast<DeadCodeAnalysisNode*>(*prev.begin())->next_notempty_out; const auto& example = dynamic_cast<DeadCodeAnalysisNode*>(*prev.begin())->next_notempty_out;
for (auto p : prev) for (auto& p : prev)
{ {
DeadCodeAnalysisNode* next = dynamic_cast<DeadCodeAnalysisNode*>(p); DeadCodeAnalysisNode* next = dynamic_cast<DeadCodeAnalysisNode*>(p);
@@ -188,7 +190,7 @@ public:
{ {
set<DeadCodeAnalysisNode*> current = {}; set<DeadCodeAnalysisNode*> current = {};
for (auto nextP : getPrevBlocks()) for (auto& nextP : getPrevBlocks())
{ {
DeadCodeAnalysisNode* next = dynamic_cast<DeadCodeAnalysisNode*>(nextP); DeadCodeAnalysisNode* next = dynamic_cast<DeadCodeAnalysisNode*>(nextP);
@@ -428,49 +430,7 @@ int removeDeadCode(SgStatement* func,
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
auto& cfg_pair = *(cfg.begin()); auto& cfg_pair = *(cfg.begin());
removedUnreachableBlocks(cfg_pair.second);
// delete unreachable blocks
set<SAPFOR::BasicBlock*> reachable;
for (auto b : cfg_pair.second)
if(b->getInstructions().front()->isHeader() ||
b->getInstructions().front()->getInstruction()->getOperation() == SAPFOR::CFG_OP::ENTRY)
reachable.insert(b);
set<SAPFOR::BasicBlock*> worklist = reachable;
while (worklist.size() != 0)
{
set<SAPFOR::BasicBlock*> to_insert;
for(auto b : worklist)
for(auto next: b->getNext())
if(reachable.insert(next).second)
to_insert.insert(next);
worklist = to_insert;
}
auto remove_unreachable_it = remove_if(cfg_pair.second.begin(), cfg_pair.second.end(),
[&reachable](SAPFOR::BasicBlock* b)
{
if (reachable.find(b) == reachable.end())
{
for(auto next: b->getNext())
if(reachable.find(next) != reachable.end())
next->removePrev(b);
delete b;
return true;
}
return false;
}
);
reachable.clear();
cfg_pair.second.erase(remove_unreachable_it, cfg_pair.second.end());
#if DEBUG_IR #if DEBUG_IR
dumpCFG({ cfg_pair }, false); dumpCFG({ cfg_pair }, false);
@@ -481,7 +441,7 @@ int removeDeadCode(SgStatement* func,
map<string, FuncInfo*> funcByName; map<string, FuncInfo*> funcByName;
for (auto& byFile : allFuncs) for (auto& byFile : allFuncs)
for (auto byFunc : byFile.second) for (auto& byFunc : byFile.second)
funcByName[byFunc->funcName] = byFunc; funcByName[byFunc->funcName] = byFunc;
DeadCodeAnalysis analysis_object(func_parameters, funcByName); DeadCodeAnalysis analysis_object(func_parameters, funcByName);

View File

@@ -136,33 +136,41 @@ void createInterfacesForOutCalls(FuncInfo* func)
} }
} }
static bool changeIfHasStarRange(SgExpression* arrayDecl, bool doReplace = false) static bool changeIfHasStarRange(SgExpression* arrayDecl, SgStatement* scope, vector<SgSymbol*>& parNames)
{ {
SgExpression* list = arrayDecl->lhs(); SgExpression* list = arrayDecl->lhs();
bool has = doReplace; string varN = arrayDecl->symbol()->identifier() + string("_sz");
bool has = false;
SgExpression* allDimsBefore = NULL;
while (list) while (list)
{ {
const int var = list->lhs()->variant(); const int var = list->lhs()->variant();
if (var == STAR_RANGE) if (var == STAR_RANGE)
{
has = true; has = true;
list = list->rhs();
parNames.push_back(new SgSymbol(VARIABLE_NAME, varN.c_str(), SgTypeInt(), scope));
SgExpression* par = allDimsBefore ? &(*new SgVarRefExp(parNames.back()) / *allDimsBefore) : (new SgVarRefExp(parNames.back()));
list->setLhs(par);
break;
}
else
{
if (allDimsBefore == NULL)
allDimsBefore = list->lhs();
else
allDimsBefore = &(*allDimsBefore * *list->lhs()->copyPtr());
} }
if (has)
{
list = arrayDecl->lhs();
while (list)
{
list->setLhs(new SgExpression(DDOT));
list = list->rhs(); list = list->rhs();
} }
}
return has; return has;
} }
static void removeExternalStat(SgStatement* func, const set<string>& addedInterfaceFor) /*static void removeExternalStat(SgStatement* func, const set<string>& addedInterfaceFor)
{ {
vector<SgStatement*> toRem; vector<SgStatement*> toRem;
for (auto st = func; st != func->lastNodeOfStmt(); st = st->lexNext()) for (auto st = func; st != func->lastNodeOfStmt(); st = st->lexNext())
@@ -197,7 +205,7 @@ static void removeExternalStat(SgStatement* func, const set<string>& addedInterf
for (auto& rem : toRem) for (auto& rem : toRem)
rem->deleteStmt(); rem->deleteStmt();
} }*/
template<typename T> template<typename T>
static vector<FuncInfo*> sortByName(const T &funcs) static vector<FuncInfo*> sortByName(const T &funcs)
@@ -210,9 +218,25 @@ static vector<FuncInfo*> sortByName(const T &funcs)
return funcList; return funcList;
} }
void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFuncInfo) static bool hasDvmParallel(SgStatement *func)
{ {
set<FuncInfo*> hasAssumedSizeArrays; for (auto st = func; st != func->lastNodeOfStmt(); st = st->lexNext())
{
const int var = st->variant();
if (var == DVM_PARALLEL_ON_DIR || var == ACC_REGION_DIR ||
var == ACC_ACTUAL_DIR || var == ACC_GET_ACTUAL_DIR)
return true;
if (st->variant() == CONTAINS_STMT)
break;
}
return false;
}
void transformAssumedSizeParameters(const map<string, vector<FuncInfo*>>& allFuncInfo)
{
map<string, vector<int>> assumedSizeArraysByFunc;
for (auto& funcByFile : allFuncInfo) for (auto& funcByFile : allFuncInfo)
{ {
@@ -225,6 +249,12 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
if (prog == NULL) if (prog == NULL)
continue; continue;
if (!hasDvmParallel(prog))
continue;
vector<SgSymbol*> parNames;
SgStatement* scope = prog->getScopeForDeclare();
vector<SgExpression*> arrayRefs; vector<SgExpression*> arrayRefs;
bool hasRefs = false; bool hasRefs = false;
for (int z = 0; z < func->funcParams.countOfPars; ++z) for (int z = 0; z < func->funcParams.countOfPars; ++z)
@@ -244,13 +274,8 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
{ {
if (list->lhs() && list->lhs()->symbol()->identifier() == name) if (list->lhs() && list->lhs()->symbol()->identifier() == name)
{ {
if (changeIfHasStarRange(list->lhs())) if (changeIfHasStarRange(list->lhs(), scope, parNames))
{ assumedSizeArraysByFunc[func->funcName].push_back(z);
hasRefs = true;
hasAssumedSizeArrays.insert(func);
}
else
arrayRefs.push_back(list->lhs());
break; break;
} }
list = list->rhs(); list = list->rhs();
@@ -259,13 +284,20 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
} }
} }
if (hasRefs) if (parNames.size())
for (auto& ref : arrayRefs) {
changeIfHasStarRange(ref, true); SgProcHedrStmt* proc = isSgProcHedrStmt(func->funcPointer->GetOriginal());
checkNull(proc, convertFileName(__FILE__).c_str(), __LINE__);
//makeDeclaration(parNames, scope);
for (auto& newPar : parNames)
proc->AddArg(*new SgVarRefExp(newPar));
}
} }
} }
if (hasAssumedSizeArrays.size() == 0) if (assumedSizeArraysByFunc.size() == 0)
return; return;
for (auto& funcByFile : allFuncInfo) for (auto& funcByFile : allFuncInfo)
@@ -273,26 +305,60 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
if (SgFile::switchToFile(funcByFile.first) == -1) if (SgFile::switchToFile(funcByFile.first) == -1)
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
SgSymbol* funcSize = new SgSymbol(FUNCTION_NAME, "size");
for (auto& func : sortByName(funcByFile.second)) for (auto& func : sortByName(funcByFile.second))
{ {
SgProgHedrStmt* prog = isSgProgHedrStmt(func->funcPointer->GetOriginal()); SgProgHedrStmt* prog = isSgProgHedrStmt(func->funcPointer->GetOriginal());
if (prog == NULL) if (prog == NULL)
continue; continue;
set<string> addedInterfaceFor; for (auto& detailedCall : func->callsFromDetailed)
for (auto& elem : sortByName(func->callsFromV))
{ {
auto it = hasAssumedSizeArrays.find(elem); auto it = assumedSizeArraysByFunc.find(detailedCall.detailCallsFrom.first);
if (it != hasAssumedSizeArrays.end()) if (it != assumedSizeArraysByFunc.end())
{ {
auto callFrom = *it; auto pointer = detailedCall.pointerDetailCallsFrom;
DvmhRegionInserter::createInterfaceBlockForOutCall(func, callFrom);
addedInterfaceFor.insert(callFrom->funcName); SgExpression* list = NULL;
if (pointer.second == FUNC_CALL)
{
SgExpression* p = (SgExpression*)pointer.first;
list = p->lhs();
} }
else
{
SgStatement* p = (SgStatement*)pointer.first;
list = p->expr(0);
} }
if (addedInterfaceFor.size()) SgExpression* last = list;
removeExternalStat(prog, addedInterfaceFor); vector<SgExpression*> pars;
while (list)
{
last = list;
pars.push_back(list->lhs());
list = list->rhs();
}
for (int z = 0; z < it->second.size(); ++z)
{
int parNum = it->second[z];
if (parNum >= pars.size())
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
//TODO: need to do it better
SgExpression* parArray = pars[parNum]->copyPtr();
parArray->setLhs(NULL);
parArray->setRhs(NULL);
SgFunctionCallExp* call = new SgFunctionCallExp(*funcSize, *parArray);
last->setRhs(new SgExpression(EXPR_LIST, call));
last = last->rhs();
}
}
}
} }
} }
} }
@@ -1388,6 +1454,37 @@ static string makeName(SgSymbol* var, map<SgSymbol*, set< SgSymbol*>>& modVarsTo
return name; return name;
} }
static bool filterFromList(SgStatement* st, const set<string>& idents, bool exclude = false)
{
bool empty = false;
SgExpression* list = st->expr(0);
vector<SgExpression*> newList;
int total = 0;
while (list)
{
if (exclude)
{
if (idents.find(list->lhs()->symbol()->identifier()) == idents.end())
newList.push_back(list->lhs());
}
else
{
if (idents.find(list->lhs()->symbol()->identifier()) != idents.end())
newList.push_back(list->lhs());
}
total++;
list = list->rhs();
}
if (newList.size() == 0)
empty = true;
else if (total != newList.size())
st->setExpression(0, makeExprList(newList));
return empty;
}
static string getInterfaceBlock(SgStatement* func, const FuncParam& pars) static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
{ {
string oldFile = current_file->filename(); string oldFile = current_file->filename();
@@ -1395,22 +1492,21 @@ static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
auto copy = duplicateProcedure(func, NULL, false, false, false, true); auto copy = duplicateProcedure(func, NULL, false, false, false, true);
const set<string> idents(pars.identificators.begin(), pars.identificators.end());
const set<string> ident(pars.identificators.begin(), pars.identificators.end());
//remove all exec //remove all exec
SgStatement* st = copy->lexNext(); SgStatement* st = copy->lexNext();
SgStatement* last = copy->lastNodeOfStmt(); SgStatement* last = copy->lastNodeOfStmt();
vector<SgStatement*> toExtract; vector<SgStatement*> toExtract;
while (st != last) while (st != last)
{ {
if (isDVM_stat(st) || isSPF_stat(st)) if (isDVM_stat(st) || isSPF_stat(st))
{ {
if (st->variant() != ACC_ROUTINE_DIR) if (st->variant() != ACC_ROUTINE_DIR)
{ {
SgStatement* next = st->lexNext(); toExtract.push_back(st);
st->extractStmt(); st = st->lexNext();
st = next;
} }
else else
st = st->lexNext(); st = st->lexNext();
@@ -1431,31 +1527,20 @@ static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
st = copy->lexNext(); st = copy->lexNext();
while (st != last) while (st != last)
{ {
if (st->variant() == VAR_DECL const int var = st->variant();
|| st->variant() == VAR_DECL_90
|| st->variant() == DIM_STAT
|| st->variant() == INTENT_STMT)
{
SgExpression* list = st->expr(0);
vector<SgExpression*> newList;
while (list)
{
if (ident.find(list->lhs()->symbol()->identifier()) != ident.end())
newList.push_back(list->lhs());
list = list->rhs();
}
if (newList.size() == 0) if (var == VAR_DECL || var == VAR_DECL_90 || var == DIM_STAT ||
var == INTENT_STMT || var == EXTERN_STAT)
{
bool empty = filterFromList(st, idents);
if (empty)
{ {
SgStatement* next = st->lexNext();
toExtract.push_back(st); toExtract.push_back(st);
st = next; st = st->lexNext();
continue; continue;
} }
else
st->setExpression(0, makeExprList(newList));
} }
else else if (!isDVM_stat(st) && !isSPF_stat(st))
toExtract.push_back(st); toExtract.push_back(st);
if (st->variant() == CONTAINS_STMT) if (st->variant() == CONTAINS_STMT)
@@ -1466,16 +1551,56 @@ static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
for (auto& elem : toExtract) for (auto& elem : toExtract)
elem->extractStmt(); elem->extractStmt();
string retVal = copy->unparse(); string codeString = copy->unparse();
if (SgFile::switchToFile(oldFile) == -1) if (SgFile::switchToFile(oldFile) == -1)
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
//insert tabs
const string tab = " ";
const int countEnds = std::count(codeString.begin(), codeString.end(), '\n');
string retVal = " ";
retVal.reserve(retVal.size() + codeString.size() + countEnds * tab.size());
for (int z = 0, ends = 0; z < codeString.size(); ++z)
{
retVal += codeString[z];
if (codeString[z] == '\n')
{
ends++;
if (ends == countEnds)
continue;
int p = z + 1;
while (codeString[p] == ' ' && p < codeString.size())
++p;
auto start = p;
auto end = string::npos;
auto sub = codeString.find("subroutine", p);
auto func = codeString.find("function", p);
auto end_sub = codeString.find("end subroutine", p);
auto end_func = codeString.find("end function", p);
if (sub != end && sub == start || end_sub != end && end_sub == start ||
func != end && func == start || end_func != end && end_func == start)
{
retVal += " ";
}
else
retVal += tab;
}
}
return retVal; return retVal;
} }
static void insertInterface(SgStatement* func, const string& iface) void insertInterface(SgStatement* func, const FuncInfo *callFrom)
{ {
const string& iface = getInterfaceBlock(callFrom->funcPointer->GetOriginal(), callFrom->funcParams);
const string& fName = callFrom->funcName;
string oldFile = current_file->filename(); string oldFile = current_file->filename();
if (!func->switchToFile()) if (!func->switchToFile())
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
@@ -1484,6 +1609,18 @@ static void insertInterface(SgStatement* func, const string& iface)
SgStatement* last = func->lastNodeOfStmt(); SgStatement* last = func->lastNodeOfStmt();
while (st != last) while (st != last)
{ {
if (st->variant() == VAR_DECL || st->variant() == VAR_DECL_90)
{
bool empty = filterFromList(st, { fName }, true);
if (empty)
{
SgStatement* next = st->lexNext();
st->extractStmt();
st = next;
continue;
}
}
if (isSgExecutableStatement(st)) if (isSgExecutableStatement(st))
break; break;
st = st->lexNext(); st = st->lexNext();
@@ -1491,7 +1628,7 @@ static void insertInterface(SgStatement* func, const string& iface)
SgStatement* ifaceBlock = new SgStatement(INTERFACE_STMT); SgStatement* ifaceBlock = new SgStatement(INTERFACE_STMT);
addControlEndToStmt(ifaceBlock->thebif); addControlEndToStmt(ifaceBlock->thebif);
ifaceBlock->setlineNumber(st->lineNumber()); ifaceBlock->setlineNumber(getNextNegativeLineNumber());
ifaceBlock->setFileName(st->fileName()); ifaceBlock->setFileName(st->fileName());
st->insertStmtBefore(*ifaceBlock, *st->controlParent()); st->insertStmtBefore(*ifaceBlock, *st->controlParent());
ifaceBlock->lastNodeOfStmt()->addComment(iface.c_str()); ifaceBlock->lastNodeOfStmt()->addComment(iface.c_str());
@@ -1507,7 +1644,7 @@ static void createInterfaceBlockForToCalls(FuncInfo* func)
if (callTo->interfaceBlocks.find(func->funcName) == callTo->interfaceBlocks.end()) if (callTo->interfaceBlocks.find(func->funcName) == callTo->interfaceBlocks.end())
{ {
callTo->interfaceBlocks[func->funcName] = func; callTo->interfaceBlocks[func->funcName] = func;
insertInterface(callTo->funcPointer, getInterfaceBlock(func->funcPointer->GetOriginal(), func->funcParams)); insertInterface(callTo->funcPointer, func);
} }
} }
} }

View File

@@ -6,7 +6,6 @@ bool checkOutCalls(const std::set<std::string>& outCalls);
std::map<SgStatement*, std::set<std::string>> fillFromIntent(SgStatement* header); std::map<SgStatement*, std::set<std::string>> fillFromIntent(SgStatement* header);
void intentInsert(const std::vector<FuncInfo*>& allFuncInfo); void intentInsert(const std::vector<FuncInfo*>& allFuncInfo);
void intentInsertToInterfaces(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo); void intentInsertToInterfaces(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
void createInterfacesForAssumedSize(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
void createInterfacesForOutCalls(FuncInfo* func); void createInterfacesForOutCalls(FuncInfo* func);
void setPureStatus(const std::set<FuncInfo*>& funcInfo); void setPureStatus(const std::set<FuncInfo*>& funcInfo);
void setPureStatus(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo); void setPureStatus(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
@@ -14,3 +13,7 @@ void setPureStatus(const std::map<std::string, std::vector<FuncInfo*>>& allFuncI
void commonTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo, const std::map<std::string, CommonBlock*>& commonBlocks); void commonTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo, const std::map<std::string, CommonBlock*>& commonBlocks);
void saveTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo); void saveTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
void moduleTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo); void moduleTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
void insertInterface(SgStatement* func, const FuncInfo* callFrom);
void transformAssumedSizeParameters(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);

View File

@@ -20,7 +20,7 @@ using std::wstring;
static SgSymbol* getLoopSymbol(const LoopGraph* loop) static SgSymbol* getLoopSymbol(const LoopGraph* loop)
{ {
if (!loop || !loop->isFor) if (!loop || !loop->isFor())
return NULL; return NULL;
SgForStmt* stmt = (SgForStmt*)loop->loop->GetOriginal(); SgForStmt* stmt = (SgForStmt*)loop->loop->GetOriginal();
@@ -667,12 +667,12 @@ static void renameIterationVariables(LoopGraph* loop, const map<SgSymbol*, SgSym
{ {
if (loop) if (loop)
{ {
string& loopName = loop->loopSymbol; const string& loopName = loop->loopSymbol();
for (auto& pair : symbols) for (auto& [from, to] : symbols)
{ {
if (pair.first->identifier() == loopName) if (from->identifier() == loopName)
{ {
loop->loopSymbol = (string)pair.second->identifier(); loop->loopSymbols.replaceMainVar(to->identifier());
break; break;
} }
} }
@@ -691,9 +691,9 @@ static void renameVariablesInLoop(LoopGraph* loop, const map<SgSymbol*, SgSymbol
if (st->variant() == FOR_NODE) if (st->variant() == FOR_NODE)
{ {
SgForStmt* for_st = (SgForStmt*)st; SgForStmt* for_st = (SgForStmt*)st;
for (auto& pair : symbols) for (auto& [from, to] : symbols)
if (isEqSymbols(pair.first, for_st->symbol())) if (isEqSymbols(from, for_st->symbol()))
for_st->setDoName(*pair.second); for_st->setDoName(*to);
} }
for (int i = 0; i < 3; ++i) for (int i = 0; i < 3; ++i)
@@ -710,12 +710,12 @@ static void renamePrivatesInMap(LoopGraph* loop, const map<SgSymbol*, SgSymbol*>
for (auto& priv : privates->second) for (auto& priv : privates->second)
{ {
bool found = false; bool found = false;
for (auto& pair : symbols) for (auto& [from, to] : symbols)
{ {
if (isEqSymbols(priv, pair.first)) if (isEqSymbols(priv, from))
{ {
found = true; found = true;
newList.insert(pair.second); newList.insert(to);
break; break;
} }
} }
@@ -1590,7 +1590,7 @@ static bool combine(LoopGraph* firstLoop, const vector<LoopGraph*>& nextLoops, s
bool wasCombine = false; bool wasCombine = false;
for (LoopGraph* loop : nextLoops) for (LoopGraph* loop : nextLoops)
{ {
if (!loop->isFor) if (!loop->isFor())
return wasCombine; return wasCombine;
int perfectLoop = std::min(firstLoop->perfectLoop, loop->perfectLoop); int perfectLoop = std::min(firstLoop->perfectLoop, loop->perfectLoop);
@@ -1723,7 +1723,7 @@ static bool tryToCombine(vector<LoopGraph*>& loopGraphs, map<LoopGraph*, set<SgS
{ {
LoopGraph* loop = loops[z]; LoopGraph* loop = loops[z];
newloopGraphs.push_back(loop); newloopGraphs.push_back(loop);
if (!loop->isFor) if (!loop->isFor())
continue; continue;
vector<LoopGraph*> nextLoops = getNextLoops(loop, loopGraphs, -1); vector<LoopGraph*> nextLoops = getNextLoops(loop, loopGraphs, -1);

View File

@@ -1035,7 +1035,7 @@ int splitLoops(SgFile *file, vector<LoopGraph*> &loopGraphs, vector<Messages> &m
for (auto &loopPair : mapLoopGraph) for (auto &loopPair : mapLoopGraph)
{ {
if (!loopPair.second->isFor) if (!loopPair.second->isFor())
continue; continue;
LoopGraph *loop = loopPair.second; LoopGraph *loop = loopPair.second;

View File

@@ -2257,7 +2257,7 @@ void removePrivatesAnalysis(string filename,
{ {
for (LoopGraph* loop : loopGraphs) for (LoopGraph* loop : loopGraphs)
{ {
if (!loop->isFor) if (!loop->isFor())
continue; continue;
SgForStmt* loopStmt = (SgForStmt*)loop->loop->GetOriginal(); SgForStmt* loopStmt = (SgForStmt*)loop->loop->GetOriginal();

View File

@@ -74,7 +74,7 @@ static void fillIterationVariables(const LoopGraph* loop, set<string>& vars, int
{ {
if (dimensions == -1) if (dimensions == -1)
{ {
vars.insert(loop->loopSymbol); vars.insert(loop->loopSymbol());
for (LoopGraph* child : loop->children) for (LoopGraph* child : loop->children)
fillIterationVariables(child, vars); fillIterationVariables(child, vars);
} }
@@ -82,7 +82,7 @@ static void fillIterationVariables(const LoopGraph* loop, set<string>& vars, int
{ {
for (int i = 0; i < dimensions; ++i) for (int i = 0; i < dimensions; ++i)
{ {
vars.insert(loop->loopSymbol); vars.insert(loop->loopSymbol());
if (i != dimensions - 1) if (i != dimensions - 1)
loop = loop->children[0]; loop = loop->children[0];
} }

View File

@@ -17,6 +17,86 @@ using std::pair;
#define DEBUG_TRACE 0 #define DEBUG_TRACE 0
static bool findAlloatableKeyword(SgExpression* exp)
{
if (exp)
{
if (exp->variant() == ALLOCATABLE_OP)
return true;
return findAlloatableKeyword(exp->lhs()) || findAlloatableKeyword(exp->rhs());
}
return false;
}
static bool checkDynamicArray(DIST::Array *array)
{
for (const auto &bounds : array->GetSizes())
if (bounds.first == -1 || bounds.second == -1)
return true;
return false;
}
static SgExpression* findExprWithVariant(SgExpression* exp, int variant)
{
if (exp)
{
if (exp->variant() == variant)
return exp;
auto *l = findExprWithVariant(exp->lhs(), variant);
if (l)
return l;
auto *r = findExprWithVariant(exp->rhs(), variant);
if (r)
return r;
}
return NULL;
}
static bool checkAssumedSize(SgStatement *st, const string &arrayName, const string &currentFile)
{
__spf_print(1, "Try array %s\n", arrayName.c_str());
bool found = false;
DIST::Array* array_p = getArrayFromDeclarated(st, arrayName);
auto place = *array_p->GetDeclInfo().begin();
auto decl_file_name = place.first;
SgFile::switchToFile(decl_file_name);
SgExpression* list = st->expr(0);
while (list)
{
__spf_print(1, "Try list %s\n", list->lhs()->unparse());
if (list->lhs() && list->lhs()->symbol()->identifier() == arrayName)
{
if(findExprWithVariant(list->lhs(), STAR_RANGE))
found = true;
break;
}
}
if (!found)
{
auto *dim_expr = findExprWithVariant(st->expr(2), DIMENSION_OP);
if (dim_expr && findExprWithVariant(dim_expr, STAR_RANGE))
found = true;
}
SgFile::switchToFile(currentFile);
return found;
}
static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays) static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
{ {
if (exp) if (exp)
@@ -29,7 +109,7 @@ static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
} }
} }
static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays, SgStatement* stat) static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays, SgStatement* stat, const string& current_file)
{ {
auto var = stat->variant(); auto var = stat->variant();
@@ -74,10 +154,7 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
{ {
SgExpression* fmt = stat->expr(1); SgExpression* fmt = stat->expr(1);
if (!fmt || fmt->variant() != SPEC_PAIR || fmt->lhs()->variant() != KEYWORD_VAL) if (!fmt || fmt->variant() != SPEC_PAIR || fmt->lhs()->variant() != KEYWORD_VAL)
{
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
return;
}
if (fmt->rhs()->variant() != KEYWORD_VAL || fmt->rhs()->sunparse() != "*") if (fmt->rhs()->variant() != KEYWORD_VAL || fmt->rhs()->sunparse() != "*")
need_replace = true; need_replace = true;
@@ -104,10 +181,7 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
{ {
auto *kv = spec->lhs(); auto *kv = spec->lhs();
if (!kv || kv->variant() != SPEC_PAIR || !kv->rhs()) if (!kv || kv->variant() != SPEC_PAIR || !kv->rhs())
{
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
return;
}
if (kv->rhs()->variant() != KEYWORD_VAL || kv->rhs()->sunparse() != "*") if (kv->rhs()->variant() != KEYWORD_VAL || kv->rhs()->sunparse() != "*")
{ {
@@ -136,9 +210,15 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
{ {
string array_name = string(by_symb->identifier()); string array_name = string(by_symb->identifier());
DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(by_symb), array_name); DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(by_symb), array_name);
if (array_p && array_p->GetDistributeFlagVal() == Distribution::distFlag::IO_PRIV && arrays[by_symb].insert(stat).second) if (array_p &&
array_p->GetDistributeFlagVal() == Distribution::distFlag::IO_PRIV &&
!checkAssumedSize(declaratedInStmt(by_symb), array_name, current_file) &&
arrays[by_symb].insert(stat).second
)
{
__spf_print(DEBUG_TRACE, "[%d]: add array %s\n", stat->lineNumber(), array_p->GetName().c_str()); __spf_print(DEBUG_TRACE, "[%d]: add array %s\n", stat->lineNumber(), array_p->GetName().c_str());
} }
}
__spf_print(DEBUG_TRACE, "[replace]\n"); __spf_print(DEBUG_TRACE, "[replace]\n");
} }
@@ -210,7 +290,12 @@ static void replaceArrayRec(SgSymbol* arr, SgSymbol* replace_by, SgStatement* st
} }
} }
static void copyArrayBetweenStatements(SgSymbol* replace_symb, SgSymbol* replace_by, SgStatement* start, SgStatement* last, bool start_is_scope) static void copyArrayBetweenStatements(SgSymbol* replace_symb,
SgSymbol* replace_by,
SgStatement* start,
SgStatement* last,
bool start_is_scope,
FuncInfo *func_info)
{ {
while (start->lexNext() && !isSgExecutableStatement(start->lexNext())) while (start->lexNext() && !isSgExecutableStatement(start->lexNext()))
start = start->lexNext(); start = start->lexNext();
@@ -233,6 +318,18 @@ static void copyArrayBetweenStatements(SgSymbol* replace_symb, SgSymbol* replace
start->insertStmtAfter(*assign, *parent); start->insertStmtAfter(*assign, *parent);
} }
if (has_write)
{
for (int i = 0; i < func_info->funcParams.identificators.size(); i++)
{
if (func_info->funcParams.identificators[i] == replace_symb->identifier())
{
has_write &= func_info->funcParams.isArgOut(i);
break;
}
}
}
if (has_write) if (has_write)
{ {
// A = A_reg // A = A_reg
@@ -243,9 +340,15 @@ static void copyArrayBetweenStatements(SgSymbol* replace_symb, SgSymbol* replace
} }
} }
static void replaceArrayInFragment(SgSymbol* replace_symb, const set<SgStatement*> usages, SgSymbol* replace_by, SgStatement* start, SgStatement* last, const string& filename) static void replaceArrayInFragment(SgSymbol* replace_symb,
const set<SgStatement*> usages,
SgSymbol* replace_by,
SgStatement* start,
SgStatement* last,
FuncInfo *func_info,
const string& filename)
{ {
while (start->lexNext() && !isSgExecutableStatement(start->lexNext())) while (start->lexNext() && (!isSgExecutableStatement(start->lexNext()) || start->lexNext()->variant() == ALLOCATE_STMT))
start = start->lexNext(); start = start->lexNext();
set<SgStatement*> not_opened, not_closed, copied; set<SgStatement*> not_opened, not_closed, copied;
@@ -312,7 +415,7 @@ static void replaceArrayInFragment(SgSymbol* replace_symb, const set<SgStatement
} }
__spf_print(DEBUG_TRACE, "[copy %s] [%d, %d]\n", replace_symb->identifier(), scope_start->lineNumber(), scope_end->lineNumber()); __spf_print(DEBUG_TRACE, "[copy %s] [%d, %d]\n", replace_symb->identifier(), scope_start->lineNumber(), scope_end->lineNumber());
copyArrayBetweenStatements(replace_symb, replace_by, scope_start, scope_end, copy_scope == scope_start); copyArrayBetweenStatements(replace_symb, replace_by, scope_start, scope_end, copy_scope == scope_start, func_info);
copied.insert(copy_scope); copied.insert(copy_scope);
} }
} }
@@ -368,12 +471,19 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
{ {
const auto& filename = linesByFile.first; const auto& filename = linesByFile.first;
if (SgFile::switchToFile(filename) < 0) if (SgFile::switchToFile(filename) == -1)
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
auto func_info_it = allFuncInfo.find(filename);
if (func_info_it == allFuncInfo.end())
{ {
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
return; return;
} }
auto *lbound_symb = new SgSymbol(PROCEDURE_NAME, "lbound");
auto *ubound_symb = new SgSymbol(PROCEDURE_NAME, "ubound");
for (auto& lines : linesByFile.second) for (auto& lines : linesByFile.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", filename.c_str(), lines.lines.first,
@@ -383,7 +493,6 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
if (lines.isImplicit()) if (lines.isImplicit())
{ {
curr_stmt = current_file->SgStatementAtLine(lines.lines.first); curr_stmt = current_file->SgStatementAtLine(lines.lines.first);
end = current_file->SgStatementAtLine(lines.lines.second); end = current_file->SgStatementAtLine(lines.lines.second);
@@ -399,6 +508,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
map<SgSymbol*, set<SgStatement*>> need_replace; map<SgSymbol*, set<SgStatement*>> need_replace;
SgStatement* last_io_bound = NULL; SgStatement* last_io_bound = NULL;
FuncInfo *current_func_info = NULL;
while (curr_stmt != end) while (curr_stmt != end)
{ {
@@ -407,9 +517,24 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
auto var = curr_stmt->variant(); auto var = curr_stmt->variant();
if (var == PROC_HEDR || var == PROG_HEDR || var == FUNC_HEDR) if (var == PROC_HEDR || var == PROG_HEDR || var == FUNC_HEDR)
{ {
current_func_info = NULL;
for (auto *func_info : func_info_it->second)
{
if (func_info->funcName == curr_stmt->symbol()->identifier())
{
current_func_info = func_info;
break;
}
}
if (!current_func_info)
{
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
return;
}
curr_stmt = curr_stmt->lexNext(); curr_stmt = curr_stmt->lexNext();
while (curr_stmt && !isSgExecutableStatement(curr_stmt)) while (curr_stmt && !isSgExecutableStatement(curr_stmt))
{ {
@@ -437,7 +562,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
const string locationName = array_p->GetLocation().second; const string locationName = array_p->GetLocation().second;
auto place = *array_p->GetDeclInfo().begin(); auto place = *array_p->GetDeclInfo().begin();
string fileName = place.first; auto decl_file_name = place.first;
string suffix = "_io_l"; string suffix = "_io_l";
if (fromModule) if (fromModule)
@@ -446,7 +571,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
pair<SgSymbol*, SgSymbol*> copied; pair<SgSymbol*, SgSymbol*> copied;
copied.first = array_to_copy; copied.first = array_to_copy;
if (SgFile::switchToFile(fileName) == -1) if (SgFile::switchToFile(decl_file_name) == -1)
{ {
auto* func_stmt = curr_stmt->getScopeForDeclare(); auto* func_stmt = curr_stmt->getScopeForDeclare();
@@ -482,7 +607,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
} }
else else
{ {
copied = copyArray(place, array_p, linesByFile.second, suffix + to_string(region->GetId()), fileName, newDeclsToInclude, copied_syms); copied = copyArray(place, array_p, linesByFile.second, suffix + to_string(region->GetId()), decl_file_name, newDeclsToInclude, copied_syms);
} }
SgStatement* decl = SgStatement::getStatementByFileAndLine(place.first, place.second); SgStatement* decl = SgStatement::getStatementByFileAndLine(place.first, place.second);
@@ -503,7 +628,125 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
dir_str += "!$SPF ANALYSIS(PROCESS_PRIVATE(" + string(copied.second->identifier()) + "))\n"; dir_str += "!$SPF ANALYSIS(PROCESS_PRIVATE(" + string(copied.second->identifier()) + "))\n";
decl->addComment(dir_str.c_str()); decl->addComment(dir_str.c_str());
} }
created_copies.insert({ array_to_copy, copied.second }); created_copies.insert({ array_to_copy, copied.second });
// make array-copy allocatable in case of main array shape not constant
if(checkDynamicArray(array_p))
{
// insert allocatable keyword in declaration
auto *kword_list = decl->expr(2);
if (!findAlloatableKeyword(kword_list))
{
if (!kword_list)
{
kword_list = new SgExprListExp();
decl->setExpression(2, *kword_list);
}
while (kword_list->rhs())
kword_list = kword_list->rhs();
if (kword_list->lhs())
{
kword_list->setRhs(new SgExprListExp());
kword_list = kword_list->rhs();
}
kword_list->setLhs(new SgExpression(ALLOCATABLE_OP));
}
// insert allocate(a_l(lbound(a, 1):ubound(a,1),...)) statement
SgFile::switchToFile(filename);
SgStatement* insertPlace = 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 = iterator->lexNext())
{
insertPlace = iterator;
}
//NULL - no decl stats in function!
if (!insertPlace)
insertPlace = func_stmt;
auto st = insertPlace->controlParent();
if (st->variant() == GLOBAL)
st = insertPlace;
auto *stat = new SgStatement(ALLOCATE_STMT);
auto *created_array_ref = new SgArrayRefExp(*copied.second);
auto* dim_list = new SgExprListExp();
created_array_ref->setLhs(dim_list);
int dim_len = array_p->GetSizes().size();
for (int i = 1; i <= dim_len; i++)
{
auto *lcall = new SgFunctionCallExp(*lbound_symb);
auto *rcall = new SgFunctionCallExp(*ubound_symb);
for (auto *call : {lcall, rcall})
{
call->setLhs(new SgExprListExp());
call->lhs()->setLhs(new SgArrayRefExp(*array_to_copy));
call->lhs()->setRhs(new SgValueExp(i));
}
auto *dot_expr = new SgExpression(DDOT);
dot_expr->setLhs(lcall);
dot_expr->setRhs(rcall);
dim_list->setLhs(dot_expr);
if (i < dim_len)
{
auto *next = new SgExprListExp();
dim_list->setRhs(next);
dim_list = next;
}
}
stat->setExpression(0, created_array_ref);
insertPlace->insertStmtAfter(*stat, *st);
// insert deallocate statemens before all returns
auto *find_return_stmt = func_stmt;
while (find_return_stmt != func_stmt->lastNodeOfStmt())
{
auto *next = find_return_stmt->lexNext();
if (next && (isSgReturnStmt(next) || next == func_stmt->lastNodeOfStmt()))
{
if (next->hasLabel())
{
__spf_print(1, "%s has label\n", next->unparse());
moveLabelBefore(next);
find_return_stmt = next->lexPrev();
}
auto *dealloc_stmt = new SgStatement(DEALLOCATE_STMT);
dealloc_stmt->setExpression(0, new SgExprListExp());
dealloc_stmt->expr(0)->setLhs(new SgArrayRefExp(*copied.second));
find_return_stmt->insertStmtAfter(*dealloc_stmt, *next->controlParent());
if (next == curr_stmt)
curr_stmt = dealloc_stmt;
}
find_return_stmt = next;
}
}
SgFile::switchToFile(filename);
} }
} }
@@ -515,12 +758,9 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
{ {
auto it = created_copies.find(p.first); auto it = created_copies.find(p.first);
if (it != created_copies.end()) if (it != created_copies.end())
replaceArrayInFragment(p.first, p.second, it->second, last_io_bound, curr_stmt, filename); replaceArrayInFragment(p.first, p.second, it->second, last_io_bound, curr_stmt, current_func_info, filename);
else else
{
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
return;
}
} }
} }
@@ -538,7 +778,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
} }
} }
populateDistributedIoArrays(need_replace, curr_stmt); populateDistributedIoArrays(need_replace, curr_stmt, filename);
curr_stmt = curr_stmt->lexNext(); curr_stmt = curr_stmt->lexNext();
} }
} }

View File

@@ -1,3 +1,3 @@
#pragma once #pragma once
#define VERSION_SPF "2429" #define VERSION_SPF "2440"