Compare commits
11 Commits
egormayoro
...
b298cc03bf
| Author | SHA1 | Date | |
|---|---|---|---|
| b298cc03bf | |||
|
|
8c6a55463c | ||
|
|
32a4a7fd0a | ||
|
|
507305ac3a | ||
|
|
a3939ed274 | ||
|
|
95ef954b6e | ||
|
|
243b1f5bdb | ||
|
|
5fb2bd79df | ||
|
|
d33659290e | ||
|
|
b8a6c92ca8 | ||
|
|
1028e20177 |
@@ -12,7 +12,6 @@ add_definitions("-D SYS5")
|
||||
add_definitions("-D YYDEBUG")
|
||||
|
||||
set(CMAKE_CXX_STANDARD 17)
|
||||
set(CMAKE_C_STANDARD 17)
|
||||
|
||||
set(fdvm_include projects/dvm/fdvmh/include/fdvmh/)
|
||||
set(fdvm_sources projects/dvm/fdvmh/tools/fdvmh/)
|
||||
@@ -491,7 +490,7 @@ source_group (Predictor\\Library FILES ${LIBPREDICTOR})
|
||||
source_group (Parser FILES ${PARSER})
|
||||
source_group (PPPA\\PPPA FILES ${PPPA})
|
||||
source_group (PPPA\\ZLib FILES ${ZLIB})
|
||||
|
||||
|
||||
if (MSVC_IDE)
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /MP /Zc:__cplusplus")
|
||||
else()
|
||||
@@ -500,9 +499,7 @@ else()
|
||||
else()
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
|
||||
endif()
|
||||
if(NOT CMAKE_BUILD_TYPE)
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O3")
|
||||
endif()
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O2")
|
||||
endif()
|
||||
|
||||
add_subdirectory(projects/Fdvm)
|
||||
|
||||
Submodule projects/dvm updated: 4b7ef11871...3a567d7582
@@ -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,15 +241,13 @@ 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 (deprecatedByIO.find(symb->identifier()) != deprecatedByIO.end())
|
||||
itNew->second.first->SetDistributeFlag(DIST::IO_PRIV);
|
||||
else if (isArrayInModule || privates.find(symb->identifier()) != privates.end())
|
||||
else if (privates.find(symb->identifier()) != privates.end() || isarrayInModule)
|
||||
{
|
||||
//check in module
|
||||
if (itNew->second.first->GetLocation().first == DIST::l_MODULE)
|
||||
@@ -276,6 +274,8 @@ 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
|
||||
|
||||
@@ -1297,10 +1297,7 @@ static set<DIST::Array*>
|
||||
{
|
||||
declStat = SgStatement::getStatementByFileAndLine(decl.first, decl.second);
|
||||
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())
|
||||
{
|
||||
if (st->fileName() == decl.first && st->lineNumber() == decl.second)
|
||||
|
||||
@@ -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"
|
||||
|
||||
@@ -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"
|
||||
|
||||
|
||||
@@ -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,11 @@
|
||||
#include "region.h"
|
||||
#include "SgUtils.h"
|
||||
#include "graph_loops.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
static void Collapse(Region* region)
|
||||
void Collapse(Region* region)
|
||||
{
|
||||
if (region->getBasickBlocks().empty())
|
||||
return;
|
||||
|
||||
@@ -5,8 +5,10 @@
|
||||
#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);
|
||||
std::pair<SAPFOR::BasicBlock*, std::unordered_set<SAPFOR::BasicBlock*>> GetBasicBlocksForLoop(const LoopGraph* loop, const std::vector<SAPFOR::BasicBlock*> blocks);
|
||||
|
||||
@@ -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, fout_name);
|
||||
UnparseTo_CufAndCu_Files(file, fout_cuf, fout_C_cu, fout_info);
|
||||
|
||||
const string fileN = file->filename();
|
||||
set<SgStatement*> toRemove;
|
||||
|
||||
@@ -1918,8 +1918,6 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
calculateStatsForPredictor(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 elapsedGlobal = duration_cast<milliseconds>(high_resolution_clock::now() - globalTime).count() / 1000.;
|
||||
@@ -2155,8 +2153,6 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
||||
runAnalysis(*project, REMOVE_COPIES, false);
|
||||
runAnalysis(*project, SWAP_LOOPS, false);
|
||||
|
||||
runPass(TRANSFORM_ASSUMED_SIZE_PARAMETERS, proj_name, folderName);
|
||||
|
||||
if (folderName || consoleMode)
|
||||
runAnalysis(*project, UNPARSE_FILE, true, additionalName.c_str(), folderName);
|
||||
}
|
||||
|
||||
@@ -187,8 +187,6 @@ enum passes {
|
||||
|
||||
FIND_PRIVATE_ARRAYS,
|
||||
|
||||
TRANSFORM_ASSUMED_SIZE_PARAMETERS,
|
||||
|
||||
TEST_PASS,
|
||||
EMPTY_PASS
|
||||
};
|
||||
@@ -376,8 +374,6 @@ static void setPassValues()
|
||||
passNames[INSERT_NO_DISTR_FLAGS_FROM_GUI] = "INSERT_NO_DISTR_FLAGS_FROM_GUI";
|
||||
passNames[FIND_PRIVATE_ARRAYS] = "FIND_PRIVATE_ARRAYS";
|
||||
|
||||
passNames[TRANSFORM_ASSUMED_SIZE_PARAMETERS] = "TRANSFORM_ASSUMED_SIZE_PARAMETERS";
|
||||
|
||||
passNames[TEST_PASS] = "TEST_PASS";
|
||||
}
|
||||
|
||||
|
||||
@@ -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,18 +440,15 @@ bool replaceConstantRec(SgExpression *&exp)
|
||||
if (exp->variant() == CONST_REF)
|
||||
{
|
||||
SgExpression *ret = ReplaceParameter_(exp);
|
||||
|
||||
int sign = 1;
|
||||
SgExpression* toCalc = ret;
|
||||
if (toCalc->variant() == UNARY_ADD_OP)
|
||||
toCalc = toCalc->lhs();
|
||||
|
||||
if (toCalc->variant() == MINUS_OP)
|
||||
if (ret->variant() == UNARY_ADD_OP)
|
||||
toCalc = ret->lhs();
|
||||
if (ret->variant() == MINUS_OP)
|
||||
{
|
||||
toCalc = toCalc->lhs();
|
||||
toCalc = ret->lhs();
|
||||
sign = -1;
|
||||
}
|
||||
|
||||
if (toCalc->isInteger())
|
||||
{
|
||||
exp = new SgValueExp(sign * toCalc->valueInteger());
|
||||
|
||||
@@ -66,7 +66,7 @@ void insertIntrinsicStat(const vector<FuncInfo*>& allFuncInfo)
|
||||
|
||||
void* ptr = call.pointerDetailCallsFrom.first;
|
||||
int var = call.pointerDetailCallsFrom.second;
|
||||
|
||||
|
||||
SgSymbol* s = NULL;
|
||||
if (var == PROC_STAT)
|
||||
s = ((SgStatement*)ptr)->symbol();
|
||||
@@ -103,7 +103,7 @@ void insertIntrinsicStat(const vector<FuncInfo*>& allFuncInfo)
|
||||
if (line <= 0)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
intr->setlineNumber(getNextNegativeLineNumber());
|
||||
intr->setlineNumber(line);
|
||||
st->insertStmtBefore(*intr, *func->funcPointer);
|
||||
}
|
||||
else
|
||||
@@ -126,7 +126,7 @@ bool checkOutCalls(const set<string>& outCalls)
|
||||
return false;
|
||||
}
|
||||
|
||||
void createInterfacesForOutCalls(FuncInfo* func)
|
||||
void createInterfacesForOutCalls(FuncInfo* func)
|
||||
{
|
||||
if (func->isPure && !func->isMain)
|
||||
{
|
||||
@@ -136,41 +136,33 @@ void createInterfacesForOutCalls(FuncInfo* func)
|
||||
}
|
||||
}
|
||||
|
||||
static bool changeIfHasStarRange(SgExpression* arrayDecl, SgStatement* scope, vector<SgSymbol*>& parNames)
|
||||
static bool changeIfHasStarRange(SgExpression* arrayDecl, bool doReplace = false)
|
||||
{
|
||||
SgExpression* list = arrayDecl->lhs();
|
||||
string varN = arrayDecl->symbol()->identifier() + string("_sz");
|
||||
bool has = false;
|
||||
|
||||
SgExpression* allDimsBefore = NULL;
|
||||
bool has = doReplace;
|
||||
|
||||
while (list)
|
||||
{
|
||||
const int var = list->lhs()->variant();
|
||||
if (var == STAR_RANGE)
|
||||
{
|
||||
has = true;
|
||||
|
||||
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());
|
||||
}
|
||||
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (has)
|
||||
{
|
||||
list = arrayDecl->lhs();
|
||||
while (list)
|
||||
{
|
||||
list->setLhs(new SgExpression(DDOT));
|
||||
list = list->rhs();
|
||||
}
|
||||
}
|
||||
|
||||
return has;
|
||||
}
|
||||
|
||||
/*static void removeExternalStat(SgStatement* func, const set<string>& addedInterfaceFor)
|
||||
static void removeExternalStat(SgStatement* func, const set<string>& addedInterfaceFor)
|
||||
{
|
||||
vector<SgStatement*> toRem;
|
||||
for (auto st = func; st != func->lastNodeOfStmt(); st = st->lexNext())
|
||||
@@ -205,7 +197,7 @@ static bool changeIfHasStarRange(SgExpression* arrayDecl, SgStatement* scope, ve
|
||||
|
||||
for (auto& rem : toRem)
|
||||
rem->deleteStmt();
|
||||
}*/
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
static vector<FuncInfo*> sortByName(const T &funcs)
|
||||
@@ -218,25 +210,10 @@ static vector<FuncInfo*> sortByName(const T &funcs)
|
||||
return funcList;
|
||||
}
|
||||
|
||||
static bool hasDvmParallel(SgStatement *func)
|
||||
//XXX: incorrect!!
|
||||
/*void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
{
|
||||
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;
|
||||
set<FuncInfo*> hasAssumedSizeArrays;
|
||||
|
||||
for (auto& funcByFile : allFuncInfo)
|
||||
{
|
||||
@@ -244,17 +221,11 @@ void transformAssumedSizeParameters(const map<string, vector<FuncInfo*>>& allFun
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
for (auto& func : funcByFile.second)
|
||||
{
|
||||
{
|
||||
SgProgHedrStmt* prog = isSgProgHedrStmt(func->funcPointer->GetOriginal());
|
||||
if (prog == NULL)
|
||||
continue;
|
||||
|
||||
if (!hasDvmParallel(prog))
|
||||
continue;
|
||||
|
||||
vector<SgSymbol*> parNames;
|
||||
SgStatement* scope = prog->getScopeForDeclare();
|
||||
|
||||
vector<SgExpression*> arrayRefs;
|
||||
bool hasRefs = false;
|
||||
for (int z = 0; z < func->funcParams.countOfPars; ++z)
|
||||
@@ -274,8 +245,13 @@ void transformAssumedSizeParameters(const map<string, vector<FuncInfo*>>& allFun
|
||||
{
|
||||
if (list->lhs() && list->lhs()->symbol()->identifier() == name)
|
||||
{
|
||||
if (changeIfHasStarRange(list->lhs(), scope, parNames))
|
||||
assumedSizeArraysByFunc[func->funcName].push_back(z);
|
||||
if (changeIfHasStarRange(list->lhs()))
|
||||
{
|
||||
hasRefs = true;
|
||||
hasAssumedSizeArrays.insert(func);
|
||||
}
|
||||
else
|
||||
arrayRefs.push_back(list->lhs());
|
||||
break;
|
||||
}
|
||||
list = list->rhs();
|
||||
@@ -284,20 +260,13 @@ void transformAssumedSizeParameters(const map<string, vector<FuncInfo*>>& allFun
|
||||
}
|
||||
}
|
||||
|
||||
if (parNames.size())
|
||||
{
|
||||
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 (hasRefs)
|
||||
for (auto& ref : arrayRefs)
|
||||
changeIfHasStarRange(ref, true);
|
||||
}
|
||||
}
|
||||
|
||||
if (assumedSizeArraysByFunc.size() == 0)
|
||||
if (hasAssumedSizeArrays.size() == 0)
|
||||
return;
|
||||
|
||||
for (auto& funcByFile : allFuncInfo)
|
||||
@@ -305,63 +274,29 @@ void transformAssumedSizeParameters(const map<string, vector<FuncInfo*>>& allFun
|
||||
if (SgFile::switchToFile(funcByFile.first) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
SgSymbol* funcSize = new SgSymbol(FUNCTION_NAME, "size");
|
||||
|
||||
for (auto& func : sortByName(funcByFile.second))
|
||||
{
|
||||
SgProgHedrStmt* prog = isSgProgHedrStmt(func->funcPointer->GetOriginal());
|
||||
if (prog == NULL)
|
||||
continue;
|
||||
|
||||
for (auto& detailedCall : func->callsFromDetailed)
|
||||
set<string> addedInterfaceFor;
|
||||
for (auto& elem : sortByName(func->callsFromV))
|
||||
{
|
||||
auto it = assumedSizeArraysByFunc.find(detailedCall.detailCallsFrom.first);
|
||||
if (it != assumedSizeArraysByFunc.end())
|
||||
auto it = hasAssumedSizeArrays.find(elem);
|
||||
if (it != hasAssumedSizeArrays.end())
|
||||
{
|
||||
auto pointer = detailedCall.pointerDetailCallsFrom;
|
||||
|
||||
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);
|
||||
}
|
||||
|
||||
SgExpression* last = list;
|
||||
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();
|
||||
}
|
||||
auto callFrom = *it;
|
||||
DvmhRegionInserter::createInterfaceBlockForOutCall(func, callFrom);
|
||||
addedInterfaceFor.insert(callFrom->funcName);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (addedInterfaceFor.size())
|
||||
removeExternalStat(prog, addedInterfaceFor);
|
||||
}
|
||||
}
|
||||
}
|
||||
}*/
|
||||
|
||||
static void setPureStatus(FuncInfo* func)
|
||||
{
|
||||
@@ -379,7 +314,7 @@ static void setPureStatus(FuncInfo* func)
|
||||
bool hasIO = func->linesOfIO.size() || func->linesOfStop.size();
|
||||
|
||||
if (!hasPure && !hasIO && ((isFunc == false) || (isFunc && hasOut == false)))
|
||||
{
|
||||
{
|
||||
header->setExpression(2, new SgExpression(PURE_OP));
|
||||
header->symbol()->setAttribute(header->symbol()->attributes() | PURE_BIT);
|
||||
}
|
||||
@@ -525,7 +460,7 @@ static void insertIntents(set<string>& identificators, SgStatement* header, cons
|
||||
if (args.size())
|
||||
{
|
||||
SgIntentStmt* intent = new SgIntentStmt(*makeExprList(args), *attr);
|
||||
intent->setlineNumber(getNextNegativeLineNumber());
|
||||
intent->setlineNumber(lastDecl->lineNumber());
|
||||
|
||||
lastDecl->insertStmtAfter(*intent, (header == lastDecl) ? *header : *lastDecl->controlParent());
|
||||
}
|
||||
@@ -593,7 +528,7 @@ static void intentInsert(const FuncInfo* func, SgStatement* headerSt)
|
||||
OutIdentificators.insert(ident);
|
||||
}
|
||||
|
||||
//remove conflicted intents
|
||||
//remove conflicted intents
|
||||
for (auto& entry : func->entry)
|
||||
{
|
||||
for (int i = 0; i < entry->funcParams.countOfPars; i++)
|
||||
@@ -624,11 +559,11 @@ static void intentInsert(const FuncInfo* func, SgStatement* headerSt)
|
||||
}
|
||||
|
||||
insertIntents(InOutIdentificators, headerSt, parSym, INOUT_OP, INOUT_BIT);
|
||||
insertIntents(InIdentificators, headerSt, parSym, IN_OP, IN_BIT);
|
||||
insertIntents(InIdentificators, headerSt, parSym, IN_OP, IN_BIT);
|
||||
insertIntents(OutIdentificators, headerSt, parSym, OUT_OP, OUT_BIT);
|
||||
}
|
||||
|
||||
void intentInsert(const vector<FuncInfo*>& allFuncInfo)
|
||||
void intentInsert(const vector<FuncInfo*>& allFuncInfo)
|
||||
{
|
||||
for (auto& func : allFuncInfo)
|
||||
{
|
||||
@@ -697,7 +632,7 @@ static void collectForChange(set<FuncInfo*>& allForChange, FuncInfo* start)
|
||||
for (auto& call : elem->callsFromV)
|
||||
if (allForChange.find(call) == allForChange.end())
|
||||
newAdd.insert(call);
|
||||
|
||||
|
||||
chagned = newAdd.size() != 0;
|
||||
|
||||
allForChange.insert(newAdd.begin(), newAdd.end());
|
||||
@@ -705,7 +640,7 @@ static void collectForChange(set<FuncInfo*>& allForChange, FuncInfo* start)
|
||||
}
|
||||
|
||||
template<typename CallExp>
|
||||
static void transferVarToArg(const map<string, vector<int>>& commonVarsUsed, const map<string, CommonBlock*>& commonBlocks,
|
||||
static void transferVarToArg(const map<string, vector<int>>& commonVarsUsed, const map<string, CommonBlock*>& commonBlocks,
|
||||
const FuncInfo* curFunc, CallExp* callExp)
|
||||
{
|
||||
for (auto& common : commonVarsUsed)
|
||||
@@ -789,7 +724,7 @@ static void transferCommons(set<FuncInfo*>& allForChange, map <FuncInfo*, map<st
|
||||
{
|
||||
SgFunctionCallExp* callExp = (SgFunctionCallExp*)call.first;
|
||||
if (callExp->funName()->identifier() == precFunc->funcName)
|
||||
transferVarToArg(commonVarsUsed, commonBlocks, curFunc, callExp);
|
||||
transferVarToArg(commonVarsUsed, commonBlocks, curFunc, callExp);
|
||||
}
|
||||
else if (isSgProcHedrStmt(precFunc->funcPointer->GetOriginal()) && call.second == PROC_STAT)
|
||||
{
|
||||
@@ -814,7 +749,7 @@ static void transferCommons(set<FuncInfo*>& allForChange, map <FuncInfo*, map<st
|
||||
if (v == var)
|
||||
done = true;
|
||||
|
||||
if (!done)
|
||||
if (!done)
|
||||
{
|
||||
funcCommons[curFunc][common.first].push_back(var);
|
||||
if (nextCommonVarsUsed.count(common.first) == 0)
|
||||
@@ -832,7 +767,7 @@ static void transferCommons(set<FuncInfo*>& allForChange, map <FuncInfo*, map<st
|
||||
{
|
||||
bool uses = false;
|
||||
auto groupedVars = commonBlocks.find(common.first)->second->getGroupedVars();
|
||||
|
||||
|
||||
if (curFunc->commonBlocks.count(common.first) > 0) //rename common vars in funcs
|
||||
{
|
||||
uses = true;
|
||||
@@ -864,7 +799,7 @@ static void transferCommons(set<FuncInfo*>& allForChange, map <FuncInfo*, map<st
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
else if (!allForChange.count(curFunc)) //add of commons to main
|
||||
{
|
||||
SgExprListExp* res = NULL;
|
||||
@@ -1027,13 +962,13 @@ void commonTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo, const map
|
||||
|
||||
if (func->commonBlocks.size() > 0 && st->variant() != PROG_HEDR)
|
||||
{
|
||||
for (SgStatement* start = st, *end = st->lastNodeOfStmt(); start != end;)
|
||||
for (SgStatement* start = st, *end = st->lastNodeOfStmt(); start != end;)
|
||||
{
|
||||
if (start->variant() == CONTAINS_STMT)
|
||||
break;
|
||||
|
||||
SgStatement* next = start->lexNext();
|
||||
if (start->variant() == COMM_STAT && string(start->fileName()) == func->fileName)
|
||||
if (start->variant() == COMM_STAT && string(start->fileName()) == func->fileName)
|
||||
{
|
||||
if (funcCommonDeclared.count(func) == 0)
|
||||
funcCommonDeclared[func] = set<string>();
|
||||
@@ -1064,11 +999,11 @@ void commonTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo, const map
|
||||
if (st->variant() < 0 || st->variant() == PROG_HEDR || func->isInterface)
|
||||
continue;
|
||||
|
||||
if (func->commonBlocks.size() > 0)
|
||||
if (func->commonBlocks.size() > 0)
|
||||
{
|
||||
map<string, vector<int>> commonVarsUsed;
|
||||
set<string> usedVars;
|
||||
for (SgStatement* start = st->lastDeclaration()->lexNext(), *end = st->lastNodeOfStmt(); start != end; start = start->lexNext())
|
||||
for (SgStatement* start = st->lastDeclaration()->lexNext(), *end = st->lastNodeOfStmt(); start != end; start = start->lexNext())
|
||||
{
|
||||
if (start->variant() == CONTAINS_STMT)
|
||||
break;
|
||||
@@ -1138,7 +1073,7 @@ static string changeData(const string& data, const map<string, string>& constSym
|
||||
return res;
|
||||
}
|
||||
|
||||
static void transferSave(map<FuncInfo*, set<FuncInfo*>>& funcAddedVarsFuncs, vector <SgSymbol*>& varsToTransfer, vector <string>& dataToTransfer,
|
||||
static void transferSave(map<FuncInfo*, set<FuncInfo*>>& funcAddedVarsFuncs, vector <SgSymbol*>& varsToTransfer, vector <string>& dataToTransfer,
|
||||
FuncInfo* curFunc, FuncInfo* precFunc, FuncInfo* startFunc)
|
||||
{
|
||||
if (curFunc != precFunc)
|
||||
@@ -1159,7 +1094,7 @@ static void transferSave(map<FuncInfo*, set<FuncInfo*>>& funcAddedVarsFuncs, vec
|
||||
else if (isSgProcHedrStmt(precFunc->funcPointer->GetOriginal()) && call.second == PROC_STAT)
|
||||
{
|
||||
SgCallStmt* callSt = (SgCallStmt*)call.first;
|
||||
if (callSt->name()->identifier() == precFunc->funcName)
|
||||
if (callSt->name()->identifier() == precFunc->funcName)
|
||||
for (auto& var : varsToTransfer)
|
||||
callSt->addArg(*new SgVarRefExp(*var));
|
||||
}
|
||||
@@ -1185,7 +1120,7 @@ static void transferSave(map<FuncInfo*, set<FuncInfo*>>& funcAddedVarsFuncs, vec
|
||||
{
|
||||
((SgProcHedrStmt*)(hedr))->AddArg(*new SgVarRefExp(var->copy()));
|
||||
hedr->lexNext()->deleteStmt();
|
||||
if (curFunc != startFunc || i!=0)
|
||||
if (curFunc != startFunc || i!=0)
|
||||
{
|
||||
vector<SgSymbol*> varVec = vector<SgSymbol*>();
|
||||
varVec.push_back(var);
|
||||
@@ -1225,7 +1160,7 @@ static void transferSave(map<FuncInfo*, set<FuncInfo*>>& funcAddedVarsFuncs, vec
|
||||
|
||||
for (SgStatement* start = hedr->lexNext(), *end = hedr->lastNodeOfStmt(); start != end; start = start->lexNext())
|
||||
{
|
||||
if ((isSgExecutableStatement(start) || isSgDeclarationStatement(start)) && !strcmp(hedr->fileName(), start->fileName()))
|
||||
if ((isSgExecutableStatement(start) || isSgDeclarationStatement(start)) && !strcmp(hedr->fileName(), start->fileName()))
|
||||
{
|
||||
firstExDec = start;
|
||||
break;
|
||||
@@ -1264,7 +1199,7 @@ void saveTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
for (auto& byfile : allFuncInfo)
|
||||
for (auto& func : byfile.second)
|
||||
if (func->isMain)
|
||||
start = func;
|
||||
start = func;
|
||||
|
||||
collectForChange(allForChange, start);
|
||||
allForChange.erase(start);
|
||||
@@ -1306,8 +1241,8 @@ void saveTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
|
||||
if (s->scope() == st)
|
||||
{
|
||||
if ( (s->attributes() & SAVE_BIT) ||
|
||||
(s->attributes() & DATA_BIT) ||
|
||||
if ( (s->attributes() & SAVE_BIT) ||
|
||||
(s->attributes() & DATA_BIT) ||
|
||||
allSave && s->variant() == VARIABLE_NAME && !params.count(s->identifier()))
|
||||
{
|
||||
if ((s->type() ? s->type()->variant() : (T_COMPLEX + 1)) > T_COMPLEX)
|
||||
@@ -1358,21 +1293,21 @@ void saveTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
|
||||
SgExprListExp* attrsNoSave = new SgExprListExp();
|
||||
bool needChange = false;
|
||||
for (int i = 0; i < vst->numberOfAttributes(); i++)
|
||||
for (int i = 0; i < vst->numberOfAttributes(); i++)
|
||||
{
|
||||
if (vst->attribute(i)->variant() != SAVE_OP)
|
||||
{
|
||||
attrsNoSave->append(vst->attribute(i)->copy());
|
||||
}
|
||||
}
|
||||
else
|
||||
needChange = true;
|
||||
needChange = true;
|
||||
}
|
||||
|
||||
if (needChange)
|
||||
if (needChange)
|
||||
{
|
||||
SgVarDeclStmt* newVst;
|
||||
if (!attrsNoSave->length())
|
||||
newVst = new SgVarDeclStmt(vst->varList()->copy(), *attrsNoSave, vst->type()->copy());
|
||||
newVst = new SgVarDeclStmt(vst->varList()->copy(), *attrsNoSave, vst->type()->copy());
|
||||
else
|
||||
newVst = new SgVarDeclStmt(vst->varList()->copy(), vst->type()->copy());
|
||||
|
||||
@@ -1400,8 +1335,8 @@ void saveTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
}
|
||||
}*/
|
||||
|
||||
static string makeName(SgSymbol* var, map<SgSymbol*, set< SgSymbol*>>& modVarsToAdd, const set<string>& useMod,
|
||||
const map<string, vector<pair<SgSymbol*, SgSymbol*>>>& modByUse,
|
||||
static string makeName(SgSymbol* var, map<SgSymbol*, set< SgSymbol*>>& modVarsToAdd, const set<string>& useMod,
|
||||
const map<string, vector<pair<SgSymbol*, SgSymbol*>>>& modByUse,
|
||||
const map<string, vector<pair<SgSymbol*, SgSymbol*>>>& modByUseOnly)
|
||||
{
|
||||
string name = "", modName = OriginalSymbol(var)->scope()->symbol()->identifier();
|
||||
@@ -1423,7 +1358,7 @@ static string makeName(SgSymbol* var, map<SgSymbol*, set< SgSymbol*>>& modVarsTo
|
||||
}
|
||||
|
||||
if (!name.length())
|
||||
name = varOrName;
|
||||
name = varOrName;
|
||||
}
|
||||
else if (mbuo)
|
||||
{
|
||||
@@ -1557,7 +1492,7 @@ static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
//insert tabs
|
||||
const string tab = " ";
|
||||
const string tab = " ";
|
||||
const int countEnds = std::count(codeString.begin(), codeString.end(), '\n');
|
||||
|
||||
string retVal = " ";
|
||||
@@ -1649,7 +1584,7 @@ static void createInterfaceBlockForToCalls(FuncInfo* func)
|
||||
}
|
||||
}
|
||||
|
||||
static void transferModule(map<FuncInfo*, set<SgSymbol*>>& funcAddedVarsMods, set<FuncInfo*>& allForChange,
|
||||
static void transferModule(map<FuncInfo*, set<SgSymbol*>>& funcAddedVarsMods, set<FuncInfo*>& allForChange,
|
||||
vector<SgSymbol*>& varsToTransfer, FuncInfo* curFunc, FuncInfo* precFunc, set<FuncInfo*>& funcForInterfaceAdd)
|
||||
{
|
||||
SgStatement* st = curFunc->funcPointer->GetOriginal();
|
||||
@@ -1701,7 +1636,7 @@ static void transferModule(map<FuncInfo*, set<SgSymbol*>>& funcAddedVarsMods, se
|
||||
else if (isSgProcHedrStmt(precFunc->funcPointer->GetOriginal()) && call.second == PROC_STAT)
|
||||
{
|
||||
SgCallStmt* callSt = (SgCallStmt*)call.first;
|
||||
if (callSt->name()->identifier() == precFunc->funcName)
|
||||
if (callSt->name()->identifier() == precFunc->funcName)
|
||||
{
|
||||
for (auto& var : varsToTransfer)
|
||||
{
|
||||
@@ -1753,7 +1688,7 @@ static void transferModule(map<FuncInfo*, set<SgSymbol*>>& funcAddedVarsMods, se
|
||||
{
|
||||
if (i == 0)
|
||||
curFunc->funcParams.identificators.push_back(var->identifier());
|
||||
|
||||
|
||||
((SgProcHedrStmt*)(hedr))->AddArg(*new SgVarRefExp(var->copy()));
|
||||
hedr->lexNext()->deleteStmt();
|
||||
vector<SgSymbol*> varVec = vector<SgSymbol*>();
|
||||
@@ -1777,7 +1712,7 @@ static void transferModule(map<FuncInfo*, set<SgSymbol*>>& funcAddedVarsMods, se
|
||||
}
|
||||
}
|
||||
|
||||
if (!isAuto)
|
||||
if (!isAuto)
|
||||
{
|
||||
funcForInterfaceAdd.insert(curFunc);
|
||||
SgAttributeExp* a = new SgAttributeExp(ALLOCATABLE_OP);
|
||||
@@ -1797,8 +1732,8 @@ static void transferModule(map<FuncInfo*, set<SgSymbol*>>& funcAddedVarsMods, se
|
||||
SgStatement* firstExDec = NULL;
|
||||
for (SgStatement* start = hedr->lexNext(), *end = hedr->lastNodeOfStmt(); start != end; start = start->lexNext())
|
||||
{
|
||||
if ((isSgExecutableStatement(start) || isSgDeclarationStatement(start)) &&
|
||||
!strcmp(hedr->fileName(), start->fileName()))
|
||||
if ((isSgExecutableStatement(start) || isSgDeclarationStatement(start)) &&
|
||||
!strcmp(hedr->fileName(), start->fileName()))
|
||||
{
|
||||
firstExDec = start;
|
||||
break;
|
||||
@@ -1889,7 +1824,7 @@ void moduleTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
break;
|
||||
|
||||
SgStatement* next = start->lexNext();
|
||||
if (start->variant() == USE_STMT)
|
||||
if (start->variant() == USE_STMT)
|
||||
{
|
||||
SgExpression* onlyE = start->expr(0);
|
||||
if (onlyE)
|
||||
@@ -1915,7 +1850,7 @@ void moduleTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
}
|
||||
|
||||
if (renameL)
|
||||
onlyE->setLhs(renameL);
|
||||
onlyE->setLhs(renameL);
|
||||
else
|
||||
start->deleteStmt();
|
||||
}
|
||||
@@ -1923,7 +1858,7 @@ void moduleTransfer(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
if (isSgExecutableStatement(start)|| isSgDeclarationStatement(start))
|
||||
for (int i = 0; i < 3; i++)
|
||||
fillUsedVars(usedVars, start->expr(i));
|
||||
|
||||
|
||||
// if (start->variant() == IMPL_DECL)
|
||||
// start->deleteStmt();
|
||||
start = next;
|
||||
|
||||
@@ -14,6 +14,4 @@ void commonTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFunc
|
||||
void saveTransfer(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);
|
||||
void insertInterface(SgStatement* func, const FuncInfo* callFrom);
|
||||
@@ -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,157 +17,6 @@ using std::pair;
|
||||
|
||||
#define DEBUG_TRACE 0
|
||||
|
||||
static bool hasArrayRef(SgExpression* ex)
|
||||
{
|
||||
if (ex)
|
||||
return isArrayRef(ex) || hasArrayRef(ex->lhs()) || hasArrayRef(ex->rhs());
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static inline bool isArrayDeclaration(SgStatement* st)
|
||||
{
|
||||
return isSgDeclarationStatement(st) || isSgVarListDeclStmt(st) || isSgNestedVarListDeclStmt(st);
|
||||
}
|
||||
|
||||
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 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;
|
||||
|
||||
pair<string, int> decl_place;
|
||||
|
||||
if (!switchToDeclarationFile(array_p, decl_place, current_file_name, current_func))
|
||||
return true;
|
||||
|
||||
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() &&
|
||||
list->lhs()->symbol()->identifier() &&
|
||||
list->lhs()->symbol()->identifier() == array_name
|
||||
)
|
||||
{
|
||||
if(findExprWithVariant(list->lhs(), STAR_RANGE))
|
||||
found = true;
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (!found)
|
||||
{
|
||||
auto *dim_expr = findExprWithVariant(st->expr(2), DIMENSION_OP);
|
||||
if (dim_expr && findExprWithVariant(dim_expr, STAR_RANGE))
|
||||
found = true;
|
||||
}
|
||||
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); // can't switch back to file with array usage
|
||||
|
||||
return found;
|
||||
}
|
||||
|
||||
static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
|
||||
{
|
||||
if (exp)
|
||||
@@ -180,15 +29,12 @@ static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
|
||||
}
|
||||
}
|
||||
|
||||
static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays,
|
||||
SgStatement* stat,
|
||||
const string& current_file_name,
|
||||
FuncInfo *current_func)
|
||||
static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays, SgStatement* stat)
|
||||
{
|
||||
auto var = stat->variant();
|
||||
|
||||
if (var != READ_STAT && var != PRINT_STAT && var != WRITE_STAT)
|
||||
return false;
|
||||
return;
|
||||
|
||||
// check if such IO allowed in dvm:
|
||||
// list should consist only of single array and format string should be *
|
||||
@@ -198,26 +44,22 @@ static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
SgExpression* ioList = stat->expr(0);
|
||||
|
||||
if (!ioList)
|
||||
return false;
|
||||
return;
|
||||
|
||||
if (ioList->variant() != EXPR_LIST)
|
||||
return false;
|
||||
return;
|
||||
|
||||
if (ioList->rhs() == NULL)
|
||||
{
|
||||
SgExpression* arg = ioList->lhs();
|
||||
if (!arg)
|
||||
return false;
|
||||
return;
|
||||
|
||||
if (hasArrayRef(arg))
|
||||
{
|
||||
if (isArrayRef(arg) && arg->lhs())
|
||||
need_replace = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
return false;
|
||||
}
|
||||
if (!isArrayRef(arg))
|
||||
return;
|
||||
|
||||
if (arg->lhs())
|
||||
need_replace = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
@@ -232,11 +74,15 @@ static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
{
|
||||
SgExpression* fmt = stat->expr(1);
|
||||
if (!fmt || fmt->variant() != SPEC_PAIR || fmt->lhs()->variant() != KEYWORD_VAL)
|
||||
{
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
|
||||
if (fmt->rhs()->variant() != KEYWORD_VAL || fmt->rhs()->sunparse() != "*")
|
||||
need_replace = true;
|
||||
|
||||
|
||||
break;
|
||||
}
|
||||
case READ_STAT:
|
||||
@@ -258,7 +104,10 @@ static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
{
|
||||
auto *kv = spec->lhs();
|
||||
if (!kv || kv->variant() != SPEC_PAIR || !kv->rhs())
|
||||
{
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
|
||||
if (kv->rhs()->variant() != KEYWORD_VAL || kv->rhs()->sunparse() != "*")
|
||||
{
|
||||
@@ -269,7 +118,6 @@ static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
spec = spec->rhs();
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
default:
|
||||
break;
|
||||
@@ -277,9 +125,7 @@ static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
}
|
||||
|
||||
if (!need_replace)
|
||||
return false;
|
||||
|
||||
bool ret = false;
|
||||
return;
|
||||
|
||||
set<SgSymbol*> found_arrays;
|
||||
|
||||
@@ -290,21 +136,11 @@ static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
{
|
||||
string array_name = string(by_symb->identifier());
|
||||
DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(by_symb), array_name);
|
||||
if (array_p &&
|
||||
array_p->GetDistributeFlagVal() == Distribution::distFlag::IO_PRIV &&
|
||||
!checkAssumedSize(array_name, array_p, current_file_name, current_func))
|
||||
{
|
||||
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;
|
||||
}
|
||||
if (array_p && array_p->GetDistributeFlagVal() == Distribution::distFlag::IO_PRIV && 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, "[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)
|
||||
@@ -374,12 +210,7 @@ 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,
|
||||
FuncInfo *func_info)
|
||||
static void copyArrayBetweenStatements(SgSymbol* replace_symb, SgSymbol* replace_by, SgStatement* start, SgStatement* last, bool start_is_scope)
|
||||
{
|
||||
while (start->lexNext() && !isSgExecutableStatement(start->lexNext()))
|
||||
start = start->lexNext();
|
||||
@@ -398,23 +229,10 @@ 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);
|
||||
}
|
||||
|
||||
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)
|
||||
{
|
||||
// A = A_reg
|
||||
@@ -425,14 +243,9 @@ static void copyArrayBetweenStatements(SgSymbol* replace_symb,
|
||||
}
|
||||
}
|
||||
|
||||
static void replaceArrayInFragment(SgSymbol* replace_symb,
|
||||
const set<SgStatement*> usages,
|
||||
SgSymbol* replace_by,
|
||||
SgStatement* start,
|
||||
SgStatement* last,
|
||||
FuncInfo *func_info)
|
||||
static void replaceArrayInFragment(SgSymbol* replace_symb, const set<SgStatement*> usages, SgSymbol* replace_by, SgStatement* start, SgStatement* last, const string& filename)
|
||||
{
|
||||
while (start->lexNext() && (!isSgExecutableStatement(start->lexNext()) || start->lexNext()->variant() == ALLOCATE_STMT))
|
||||
while (start->lexNext() && !isSgExecutableStatement(start->lexNext()))
|
||||
start = start->lexNext();
|
||||
|
||||
set<SgStatement*> not_opened, not_closed, copied;
|
||||
@@ -499,7 +312,7 @@ static void replaceArrayInFragment(SgSymbol* replace_symb,
|
||||
}
|
||||
|
||||
__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, func_info);
|
||||
copyArrayBetweenStatements(replace_symb, replace_by, scope_start, scope_end, copy_scope == scope_start);
|
||||
copied.insert(copy_scope);
|
||||
}
|
||||
}
|
||||
@@ -522,16 +335,12 @@ static bool ioReginBorder(SgStatement* stat, SgStatement* last_io_bound)
|
||||
STOP_STAT,
|
||||
STOP_NODE,
|
||||
EXIT_STMT,
|
||||
EXIT_NODE,
|
||||
GOTO_NODE
|
||||
EXIT_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;
|
||||
|
||||
@@ -544,9 +353,9 @@ static bool ioReginBorder(SgStatement* stat, SgStatement* last_io_bound)
|
||||
}
|
||||
|
||||
void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
const map<string, vector<FuncInfo*>>& allFuncInfo,
|
||||
map<string, vector<Messages>>& SPF_messages,
|
||||
map<string, map<int, set<string>>>& newDeclsToInclude)
|
||||
const map<string, vector<FuncInfo*>>& allFuncInfo,
|
||||
map<string, vector<Messages>>& SPF_messages,
|
||||
map<string, map<int, set<string>>>& newDeclsToInclude)
|
||||
{
|
||||
map<SgSymbol*, SgSymbol*> created_copies;
|
||||
map<string, map<int, set<string>>> copied_syms;
|
||||
@@ -555,29 +364,26 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[%s]: enter region\n", region->GetName().c_str());
|
||||
|
||||
for (auto& lines_by_file : region->GetAllLinesToModify())
|
||||
for (auto& linesByFile : region->GetAllLinesToModify())
|
||||
{
|
||||
const auto& current_file_name = lines_by_file.first;
|
||||
const auto& filename = linesByFile.first;
|
||||
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto func_info_it = allFuncInfo.find(current_file_name);
|
||||
if (func_info_it == allFuncInfo.end())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto *lbound_symb = new SgSymbol(FUNCTION_NAME, "lbound");
|
||||
auto *ubound_symb = new SgSymbol(FUNCTION_NAME, "ubound");
|
||||
|
||||
for (auto& lines : lines_by_file.second)
|
||||
if (SgFile::switchToFile(filename) < 0)
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[fragment] %s: %d:%d %d\n", current_file_name.c_str(), lines.lines.first,
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
|
||||
for (auto& lines : linesByFile.second)
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[fragment] %s: %d:%d %d\n", filename.c_str(), lines.lines.first,
|
||||
lines.lines.second, lines.isImplicit());
|
||||
|
||||
SgStatement* curr_stmt, * end;
|
||||
|
||||
if (lines.isImplicit())
|
||||
{
|
||||
|
||||
curr_stmt = current_file->SgStatementAtLine(lines.lines.first);
|
||||
end = current_file->SgStatementAtLine(lines.lines.second);
|
||||
|
||||
@@ -593,7 +399,6 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
map<SgSymbol*, set<SgStatement*>> need_replace;
|
||||
SgStatement* last_io_bound = NULL;
|
||||
|
||||
FuncInfo *current_func_info = NULL;
|
||||
|
||||
while (curr_stmt != end)
|
||||
{
|
||||
@@ -602,21 +407,9 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
|
||||
auto var = curr_stmt->variant();
|
||||
|
||||
|
||||
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__);
|
||||
|
||||
curr_stmt = curr_stmt->lexNext();
|
||||
while (curr_stmt && !isSgExecutableStatement(curr_stmt))
|
||||
{
|
||||
@@ -640,192 +433,77 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
string array_name = string(array_to_copy->identifier());
|
||||
DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(array_to_copy), array_name);
|
||||
|
||||
// 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__);
|
||||
bool fromModule = (array_p->GetLocation().first == DIST::l_MODULE);
|
||||
const string locationName = array_p->GetLocation().second;
|
||||
|
||||
auto place = *array_p->GetDeclInfo().begin();
|
||||
string fileName = place.first;
|
||||
string suffix = "_io_l";
|
||||
|
||||
switch (array_p->GetLocation().first)
|
||||
if (fromModule)
|
||||
suffix = "_io_m";
|
||||
|
||||
pair<SgSymbol*, SgSymbol*> copied;
|
||||
copied.first = array_to_copy;
|
||||
|
||||
if (SgFile::switchToFile(fileName) == -1)
|
||||
{
|
||||
case DIST::l_MODULE:
|
||||
suffix = "_io_m";
|
||||
break;
|
||||
case DIST::l_COMMON:
|
||||
suffix = "_io_c";
|
||||
break;
|
||||
}
|
||||
|
||||
auto copied_symbol = copyArray(decl_place,
|
||||
array_p,
|
||||
lines_by_file.second,
|
||||
suffix + to_string(region->GetId()),
|
||||
decl_place.first,
|
||||
newDeclsToInclude,
|
||||
copied_syms);
|
||||
|
||||
// original declaration statement
|
||||
auto *decl_stmt = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
||||
|
||||
if (!decl_stmt || !isArrayDeclaration(decl_stmt))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto dynamic_array = checkAssumedShape(decl_stmt, array_name);
|
||||
|
||||
while (decl_stmt && !isSgExecutableStatement(decl_stmt))
|
||||
{
|
||||
if (isArrayDeclaration(decl_stmt) &&
|
||||
decl_stmt->expr(0) &&
|
||||
decl_stmt->expr(0)->lhs() &&
|
||||
decl_stmt->expr(0)->lhs()->symbol() == copied_symbol.second)
|
||||
{
|
||||
break;
|
||||
}
|
||||
|
||||
decl_stmt = decl_stmt->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
|
||||
|
||||
string dir_str;
|
||||
if (decl_stmt->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_symbol.second->identifier()) + "))\n";
|
||||
decl_stmt->addComment(dir_str.c_str());
|
||||
|
||||
created_copies.insert({ array_to_copy, copied_symbol.second });
|
||||
|
||||
// make array copy allocatable in case of assumed-shape array
|
||||
if(dynamic_array)
|
||||
{
|
||||
// insert allocatable keyword in declaration
|
||||
auto *kword_list = decl_stmt->expr(2);
|
||||
if (!findExprWithVariant(kword_list, ALLOCATABLE_OP))
|
||||
{
|
||||
if (!kword_list)
|
||||
{
|
||||
kword_list = new SgExprListExp();
|
||||
decl_stmt->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));
|
||||
}
|
||||
|
||||
// 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
|
||||
SgStatement* allocate_stmt_place = NULL;
|
||||
|
||||
auto* func_stmt = curr_stmt->getScopeForDeclare();
|
||||
|
||||
SgStatement* insertPlace = NULL;
|
||||
for (auto iterator = func_stmt->lexNext();
|
||||
iterator && !isSgExecutableStatement(iterator);
|
||||
!isSgExecutableStatement(iterator) || isSPF_stat(iterator) &&
|
||||
!(iterator->variant() == SPF_PARALLEL_REG_DIR || iterator->variant() == SPF_END_PARALLEL_REG_DIR);
|
||||
iterator = iterator->lexNext())
|
||||
{
|
||||
allocate_stmt_place = iterator;
|
||||
insertPlace = iterator;
|
||||
}
|
||||
|
||||
//NULL - no decl stats in function!
|
||||
if (!allocate_stmt_place)
|
||||
allocate_stmt_place = func_stmt;
|
||||
if (!insertPlace)
|
||||
insertPlace = func_stmt;
|
||||
|
||||
auto *allocate_stmt_parent = allocate_stmt_place->controlParent();
|
||||
if (allocate_stmt_parent->variant() == GLOBAL)
|
||||
allocate_stmt_parent = allocate_stmt_place;
|
||||
|
||||
auto *created_array_ref = new SgArrayRefExp(*copied_symbol.second);
|
||||
auto st = insertPlace->controlParent();
|
||||
if (st->variant() == GLOBAL)
|
||||
st = insertPlace;
|
||||
|
||||
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());
|
||||
auto& copied_symb = array_to_copy->copy();
|
||||
copied.second = &copied_symb;
|
||||
|
||||
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);
|
||||
auto new_name = string(array_to_copy->identifier()) + "_io_c";
|
||||
copied_symb.changeName(new_name.c_str());
|
||||
|
||||
dim_list->setLhs(dot_expr);
|
||||
auto stat = array_to_copy->makeVarDeclStmt();
|
||||
auto res = CalculateInteger(stat->expr(0)->copyPtr());
|
||||
res->lhs()->setSymbol(copied_symb);
|
||||
stat->setExpression(0, res);
|
||||
|
||||
if (i < dim_len)
|
||||
{
|
||||
auto *next = new SgExprListExp();
|
||||
dim_list->setRhs(next);
|
||||
dim_list = next;
|
||||
}
|
||||
}
|
||||
|
||||
auto *allocate_stmt = new SgStatement(ALLOCATE_STMT);
|
||||
allocate_stmt->setExpression(0, created_array_ref);
|
||||
|
||||
allocate_stmt_place->insertStmtAfter(*allocate_stmt, *allocate_stmt_parent);
|
||||
|
||||
// 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())
|
||||
{
|
||||
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_symbol.second));
|
||||
|
||||
find_return_stmt->insertStmtAfter(*dealloc_stmt, *next->controlParent());
|
||||
|
||||
if (next == curr_stmt)
|
||||
curr_stmt = dealloc_stmt;
|
||||
}
|
||||
|
||||
find_return_stmt = next;
|
||||
}
|
||||
insertPlace->insertStmtAfter(*stat, *st);
|
||||
}
|
||||
else
|
||||
{
|
||||
copied = copyArray(place, array_p, linesByFile.second, suffix + to_string(region->GetId()), fileName, newDeclsToInclude, copied_syms);
|
||||
}
|
||||
|
||||
// can't switch back to file with array usage
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
SgStatement* decl = SgStatement::getStatementByFileAndLine(place.first, place.second);
|
||||
|
||||
if (decl)
|
||||
decl = decl->lexNext();
|
||||
|
||||
if (decl)
|
||||
{
|
||||
string dir_str;
|
||||
if (decl->comments())
|
||||
{
|
||||
string str_comment = string(decl->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());
|
||||
}
|
||||
created_copies.insert({ array_to_copy, copied.second });
|
||||
}
|
||||
}
|
||||
|
||||
@@ -837,9 +515,12 @@ 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);
|
||||
replaceArrayInFragment(p.first, p.second, it->second, last_io_bound, curr_stmt, filename);
|
||||
else
|
||||
{
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -857,17 +538,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
}
|
||||
}
|
||||
|
||||
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();
|
||||
}
|
||||
|
||||
populateDistributedIoArrays(need_replace, curr_stmt);
|
||||
curr_stmt = curr_stmt->lexNext();
|
||||
}
|
||||
}
|
||||
|
||||
@@ -3,7 +3,6 @@
|
||||
#include <vector>
|
||||
#include <queue>
|
||||
#include <iostream>
|
||||
#include <algorithm>
|
||||
|
||||
#include "../../Utils/errors.h"
|
||||
#include "../../Utils/SgUtils.h"
|
||||
@@ -16,238 +15,36 @@
|
||||
|
||||
using namespace std;
|
||||
|
||||
string getNameByArg(SAPFOR::Argument* arg);
|
||||
SgSymbol* getSybolByArg(SAPFOR::Argument* arg);
|
||||
|
||||
static vector<SAPFOR::IR_Block*> findInstructionsFromOperator(SgStatement* st, vector<SAPFOR::BasicBlock*> Blocks) {
|
||||
unordered_set<int> loop_tags = {FOR_NODE/*, FORALL_NODE, WHILE_NODE, DO_WHILE_NODE*/};
|
||||
unordered_set<int> importantDepsTags = {FOR_NODE, IF_NODE};
|
||||
unordered_set<int> importantUpdDepsTags = {ELSEIF_NODE};
|
||||
unordered_set<int> importantEndTags = {CONTROL_END};
|
||||
|
||||
|
||||
vector<SAPFOR::IR_Block*> findInstructionsFromOperator(SgStatement* st, vector<SAPFOR::BasicBlock*> Blocks)
|
||||
{
|
||||
vector<SAPFOR::IR_Block*> result;
|
||||
string filename = st->fileName();
|
||||
|
||||
for (auto& block: Blocks) {
|
||||
vector<SAPFOR::IR_Block*> instructionsInBlock = block->getInstructions();
|
||||
for (auto& instruction: instructionsInBlock) {
|
||||
SgStatement* curOperator = instruction->getInstruction()->getOperator();
|
||||
// Match by line number to find corresponding IR instruction
|
||||
if (curOperator->lineNumber() == st->lineNumber()) {
|
||||
string filename = st -> fileName();
|
||||
for (auto& block: Blocks)
|
||||
{
|
||||
vector<SAPFOR::IR_Block*> instructionsInBlock = block -> getInstructions();
|
||||
for (auto& instruction: instructionsInBlock)
|
||||
{
|
||||
SgStatement* curOperator = instruction -> getInstruction() -> getOperator();
|
||||
if (curOperator -> lineNumber() == st -> lineNumber())
|
||||
result.push_back(instruction);
|
||||
}
|
||||
}
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
unordered_set<int> loop_tags = {FOR_NODE};
|
||||
unordered_set<int> control_tags = {IF_NODE, ELSEIF_NODE, DO_WHILE_NODE, WHILE_NODE};
|
||||
unordered_set<int> control_end_tags = {CONTROL_END};
|
||||
|
||||
struct OperatorInfo {
|
||||
SgStatement* stmt;
|
||||
set<string> usedVars;
|
||||
set<string> definedVars;
|
||||
int lineNumber;
|
||||
bool isMovable;
|
||||
OperatorInfo(SgStatement* s) : stmt(s), lineNumber(s->lineNumber()), isMovable(true) {}
|
||||
};
|
||||
|
||||
static vector<OperatorInfo> analyzeOperatorsInLoop(SgForStmt* loop, vector<SAPFOR::BasicBlock*> blocks, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR) {
|
||||
vector<OperatorInfo> operators;
|
||||
SgStatement* loopStart = loop->lexNext();
|
||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
||||
|
||||
SgStatement* current = loopStart;
|
||||
while (current && current != loopEnd) {
|
||||
if (isSgExecutableStatement(current)) {
|
||||
OperatorInfo opInfo(current);
|
||||
|
||||
vector<SAPFOR::IR_Block*> irBlocks = findInstructionsFromOperator(current, blocks);
|
||||
for (auto irBlock : irBlocks) {
|
||||
SAPFOR::Instruction* instr = irBlock->getInstruction();
|
||||
|
||||
if (instr->getArg1()) {
|
||||
string varName = getNameByArg(instr->getArg1());
|
||||
if (!varName.empty()) {
|
||||
opInfo.usedVars.insert(varName);
|
||||
}
|
||||
}
|
||||
if (instr->getArg2()) {
|
||||
string varName = getNameByArg(instr->getArg2());
|
||||
if (!varName.empty()) {
|
||||
opInfo.usedVars.insert(varName);
|
||||
}
|
||||
}
|
||||
if (instr->getResult()) {
|
||||
string varName = getNameByArg(instr->getResult());
|
||||
if (!varName.empty()) {
|
||||
opInfo.definedVars.insert(varName);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (control_tags.find(current->variant()) != control_tags.end()) {
|
||||
opInfo.isMovable = false;
|
||||
}
|
||||
|
||||
operators.push_back(opInfo);
|
||||
}
|
||||
current = current->lexNext();
|
||||
}
|
||||
|
||||
return operators;
|
||||
}
|
||||
|
||||
static map<string, vector<SgStatement*>> findVariableDefinitions(SgForStmt* loop, vector<OperatorInfo>& operators) {
|
||||
map<string, vector<SgStatement*>> varDefinitions;
|
||||
|
||||
for (auto& op : operators) {
|
||||
for (const string& var : op.definedVars) {
|
||||
varDefinitions[var].push_back(op.stmt);
|
||||
}
|
||||
}
|
||||
|
||||
return varDefinitions;
|
||||
}
|
||||
|
||||
static int calculateDistance(SgStatement* from, SgStatement* to) {
|
||||
if (!from || !to) return INT_MAX;
|
||||
return abs(to->lineNumber() - from->lineNumber());
|
||||
}
|
||||
|
||||
static SgStatement* findBestPosition(SgStatement* operatorStmt, vector<OperatorInfo>& operators, map<string, vector<SgStatement*>>& varDefinitions) {
|
||||
OperatorInfo* opInfo = nullptr;
|
||||
for (auto& op : operators) {
|
||||
if (op.stmt == operatorStmt) {
|
||||
opInfo = &op;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (!opInfo || !opInfo->isMovable) return nullptr;
|
||||
|
||||
SgStatement* bestPos = nullptr;
|
||||
int minDistance = INT_MAX;
|
||||
|
||||
for (const string& usedVar : opInfo->usedVars) {
|
||||
if (varDefinitions.find(usedVar) != varDefinitions.end()) {
|
||||
for (SgStatement* defStmt : varDefinitions[usedVar]) {
|
||||
int distance = calculateDistance(operatorStmt, defStmt);
|
||||
if (distance < minDistance) {
|
||||
minDistance = distance;
|
||||
bestPos = defStmt;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return bestPos;
|
||||
}
|
||||
|
||||
static bool canMoveTo(SgStatement* from, SgStatement* to, SgForStmt* loop) {
|
||||
if (!from || !to || from == to) return false;
|
||||
|
||||
SgStatement* loopStart = loop->lexNext();
|
||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
||||
|
||||
if (to->lineNumber() < loopStart->lineNumber() || to->lineNumber() > loopEnd->lineNumber()) {
|
||||
return false;
|
||||
}
|
||||
|
||||
SgStatement* current = from;
|
||||
while (current && current != loopEnd) {
|
||||
if (control_tags.find(current->variant()) != control_tags.end()) {
|
||||
return false;
|
||||
}
|
||||
if (current == to) break;
|
||||
current = current->lexNext();
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
static vector<SgStatement*> optimizeOperatorOrder(SgForStmt* loop, vector<OperatorInfo>& operators, map<string, vector<SgStatement*>>& varDefinitions) {
|
||||
vector<SgStatement*> newOrder;
|
||||
vector<bool> moved(operators.size(), false);
|
||||
|
||||
for (size_t i = 0; i < operators.size(); i++) {
|
||||
if (moved[i] || !operators[i].isMovable) {
|
||||
newOrder.push_back(operators[i].stmt);
|
||||
moved[i] = true;
|
||||
continue;
|
||||
}
|
||||
|
||||
SgStatement* bestPos = findBestPosition(operators[i].stmt, operators, varDefinitions);
|
||||
|
||||
if (bestPos && canMoveTo(operators[i].stmt, bestPos, loop)) {
|
||||
bool inserted = false;
|
||||
for (size_t j = 0; j < newOrder.size(); j++) {
|
||||
if (newOrder[j] == bestPos) {
|
||||
newOrder.insert(newOrder.begin() + j + 1, operators[i].stmt);
|
||||
inserted = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!inserted) {
|
||||
newOrder.push_back(operators[i].stmt);
|
||||
}
|
||||
} else {
|
||||
newOrder.push_back(operators[i].stmt);
|
||||
}
|
||||
moved[i] = true;
|
||||
}
|
||||
|
||||
return newOrder;
|
||||
}
|
||||
|
||||
static bool applyOperatorReordering(SgForStmt* loop, vector<SgStatement*>& newOrder) {
|
||||
if (!loop || newOrder.empty()) return false;
|
||||
|
||||
SgStatement* loopStart = loop->lexNext();
|
||||
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
||||
|
||||
vector<SgStatement*> extractedStatements;
|
||||
vector<char*> savedComments;
|
||||
|
||||
for (SgStatement* stmt : newOrder) {
|
||||
if (stmt && stmt != loop && stmt != loopEnd) {
|
||||
savedComments.push_back(stmt->comments() ? strdup(stmt->comments()) : nullptr);
|
||||
SgStatement* extracted = stmt->extractStmt();
|
||||
if (extracted) {
|
||||
extractedStatements.push_back(extracted);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
SgStatement* currentPos = loop;
|
||||
int lineCounter = loop->lineNumber() + 1;
|
||||
|
||||
for (size_t i = 0; i < extractedStatements.size(); i++) {
|
||||
SgStatement* stmt = extractedStatements[i];
|
||||
if (stmt) {
|
||||
if (i < savedComments.size() && savedComments[i]) {
|
||||
stmt->setComments(savedComments[i]);
|
||||
}
|
||||
stmt->setlineNumber(lineCounter++);
|
||||
currentPos->insertStmtAfter(*stmt, *loop);
|
||||
currentPos = stmt;
|
||||
}
|
||||
}
|
||||
|
||||
for (char* comment : savedComments) {
|
||||
if (comment) {
|
||||
free(comment);
|
||||
}
|
||||
}
|
||||
|
||||
if (currentPos && currentPos->lexNext() != loopEnd) {
|
||||
currentPos->setLexNext(*loopEnd);
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
vector<SAPFOR::BasicBlock*> findFuncBlocksByFuncStatement(SgStatement *st, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR) {
|
||||
vector<SAPFOR::BasicBlock*> findFuncBlocksByFuncStatement(SgStatement *st, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR)
|
||||
{
|
||||
vector<SAPFOR::BasicBlock*> result;
|
||||
Statement* forSt = (Statement*)st;
|
||||
for (auto& func: FullIR) {
|
||||
for (auto& func: FullIR)
|
||||
{
|
||||
if (func.first -> funcPointer -> getCurrProcessFile() == forSt -> getCurrProcessFile()
|
||||
&& func.first -> funcPointer -> lineNumber() == forSt -> lineNumber())
|
||||
result = func.second;
|
||||
@@ -255,18 +52,25 @@ vector<SAPFOR::BasicBlock*> findFuncBlocksByFuncStatement(SgStatement *st, map<F
|
||||
return result;
|
||||
}
|
||||
|
||||
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> findAndAnalyzeLoops(SgStatement *st, vector<SAPFOR::BasicBlock*> blocks) {
|
||||
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> findAndAnalyzeLoops(SgStatement *st, vector<SAPFOR::BasicBlock*> blocks)
|
||||
{
|
||||
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> result;
|
||||
SgStatement *lastNode = st->lastNodeOfStmt();
|
||||
while (st && st != lastNode) {
|
||||
if (loop_tags.find(st -> variant()) != loop_tags.end()) {
|
||||
while (st && st != lastNode)
|
||||
{
|
||||
if (loop_tags.find(st -> variant()) != loop_tags.end())
|
||||
{
|
||||
// part with find statements of loop
|
||||
SgForStmt *forSt = (SgForStmt*)st;
|
||||
SgStatement *loopBody = forSt -> body();
|
||||
SgStatement *lastLoopNode = st->lastNodeOfStmt();
|
||||
// part with find blocks and instructions of loops
|
||||
unordered_set<int> blocks_nums;
|
||||
while (loopBody && loopBody != lastLoopNode) {
|
||||
while (loopBody && loopBody != lastLoopNode)
|
||||
{
|
||||
SAPFOR::IR_Block* IR = findInstructionsFromOperator(loopBody, blocks).front();
|
||||
if (blocks_nums.find(IR -> getBasicBlock() -> getNumber()) == blocks_nums.end()) {
|
||||
if (blocks_nums.find(IR -> getBasicBlock() -> getNumber()) == blocks_nums.end())
|
||||
{
|
||||
result[forSt].push_back(IR -> getBasicBlock());
|
||||
blocks_nums.insert(IR -> getBasicBlock() -> getNumber());
|
||||
}
|
||||
@@ -279,21 +83,271 @@ map<SgForStmt*, vector<SAPFOR::BasicBlock*>> findAndAnalyzeLoops(SgStatement *st
|
||||
return result;
|
||||
}
|
||||
|
||||
void runSwapOperators(SgFile *file, std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR, int& countOfTransform) {
|
||||
countOfTransform += 1;
|
||||
map<SgStatement*, set<SgStatement*>> AnalyzeLoopAndFindDeps(SgForStmt* forStatement, vector<SAPFOR::BasicBlock*> loopBlocks, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR)
|
||||
{
|
||||
map<SgStatement*, set<SgStatement*>> result;
|
||||
for (SAPFOR::BasicBlock* bb: loopBlocks)
|
||||
{
|
||||
map<SAPFOR::Argument*, set<int>> blockReachingDefinitions = bb -> getRD_In();
|
||||
vector<SAPFOR::IR_Block*> instructions = bb -> getInstructions();
|
||||
for (SAPFOR::IR_Block* irBlock: instructions)
|
||||
{
|
||||
// TODO: Think about what to do with function calls and array references. Because there are also dependencies there that are not reflected in RD, but they must be taken into account
|
||||
SAPFOR::Instruction* instr = irBlock -> getInstruction();
|
||||
result[instr -> getOperator()];
|
||||
// take Argument 1 and it's RD and push operators to final set
|
||||
if (instr -> getArg1() != NULL)
|
||||
{
|
||||
SAPFOR::Argument* arg = instr -> getArg1();
|
||||
set<int> prevInstructionsNumbers = blockReachingDefinitions[arg];
|
||||
for (int i: prevInstructionsNumbers)
|
||||
{
|
||||
SAPFOR::Instruction* foundInstruction = getInstructionAndBlockByNumber(FullIR, i).first;
|
||||
if (foundInstruction != NULL)
|
||||
{
|
||||
SgStatement* prevOp = foundInstruction -> getOperator();
|
||||
if (prevOp != forStatement && instr -> getOperator() != forStatement && instr -> getOperator() -> lineNumber() > prevOp -> lineNumber()
|
||||
&& prevOp -> lineNumber() > forStatement -> lineNumber())
|
||||
result[instr -> getOperator()].insert(prevOp);
|
||||
}
|
||||
}
|
||||
}
|
||||
// take Argument 2 (if exists) and it's RD and push operators to final set
|
||||
if (instr -> getArg2() != NULL)
|
||||
{
|
||||
SAPFOR::Argument* arg = instr -> getArg2();
|
||||
set<int> prevInstructionsNumbers = blockReachingDefinitions[arg];
|
||||
for (int i: prevInstructionsNumbers)
|
||||
{
|
||||
SAPFOR::Instruction* foundInstruction = getInstructionAndBlockByNumber(FullIR, i).first;
|
||||
if (foundInstruction != NULL)
|
||||
{
|
||||
SgStatement* prevOp = foundInstruction -> getOperator();
|
||||
if (prevOp != forStatement && instr -> getOperator() != forStatement&& instr -> getOperator() -> lineNumber() > prevOp -> lineNumber()
|
||||
&& prevOp -> lineNumber() > forStatement -> lineNumber())
|
||||
result[instr -> getOperator()].insert(prevOp);
|
||||
}
|
||||
}
|
||||
}
|
||||
// update RD
|
||||
if (instr -> getResult() != NULL)
|
||||
blockReachingDefinitions[instr -> getResult()] = {instr -> getNumber()};
|
||||
}
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
void buildAdditionalDeps(SgForStmt* forStatement, map<SgStatement*, set<SgStatement*>>& dependencies)
|
||||
{
|
||||
SgStatement* lastNode = forStatement->lastNodeOfStmt();
|
||||
vector<SgStatement*> importantDeps;
|
||||
SgStatement* st = (SgStatement*) forStatement;
|
||||
st = st -> lexNext();
|
||||
SgStatement* logIfOp = NULL;
|
||||
while (st && st != lastNode)
|
||||
{
|
||||
if(importantDeps.size() != 0)
|
||||
{
|
||||
if (st != importantDeps.back())
|
||||
{
|
||||
dependencies[st].insert(importantDeps.back());
|
||||
}
|
||||
}
|
||||
if (logIfOp != NULL)
|
||||
{
|
||||
dependencies[st].insert(logIfOp);
|
||||
logIfOp = NULL;
|
||||
}
|
||||
if (st -> variant() == LOGIF_NODE)
|
||||
{
|
||||
logIfOp = st;
|
||||
}
|
||||
if (importantDepsTags.find(st -> variant()) != importantDepsTags.end())
|
||||
{
|
||||
importantDeps.push_back(st);
|
||||
}
|
||||
if (importantUpdDepsTags.find(st -> variant()) != importantUpdDepsTags.end())
|
||||
{
|
||||
importantDeps.pop_back();
|
||||
importantDeps.push_back(st);
|
||||
}
|
||||
if (importantEndTags.find(st -> variant()) != importantEndTags.end())
|
||||
{
|
||||
if(importantDeps.size() != 0)
|
||||
{
|
||||
importantDeps.pop_back();
|
||||
}
|
||||
}
|
||||
st = st -> lexNext();
|
||||
}
|
||||
}
|
||||
|
||||
struct ReadyOp {
|
||||
SgStatement* stmt;
|
||||
int degree;
|
||||
size_t arrival;
|
||||
ReadyOp(SgStatement* s, int d, size_t a): stmt(s), degree(d), arrival(a) {}
|
||||
};
|
||||
|
||||
struct ReadyOpCompare {
|
||||
bool operator()(const ReadyOp& a, const ReadyOp& b) const {
|
||||
if (a.degree != b.degree)
|
||||
return a.degree > b.degree;
|
||||
else
|
||||
return a.arrival > b.arrival;
|
||||
}
|
||||
};
|
||||
|
||||
vector<SgStatement*> scheduleOperations(const map<SgStatement*, set<SgStatement*>>& dependencies)
|
||||
{
|
||||
// get all statements
|
||||
unordered_set<SgStatement*> allStmtsSet;
|
||||
for (const auto& pair : dependencies)
|
||||
{
|
||||
allStmtsSet.insert(pair.first);
|
||||
for (SgStatement* dep : pair.second)
|
||||
{
|
||||
allStmtsSet.insert(dep);
|
||||
}
|
||||
}
|
||||
vector<SgStatement*> allStmts(allStmtsSet.begin(), allStmtsSet.end());
|
||||
// count deps and build reversed graph
|
||||
unordered_map<SgStatement*, vector<SgStatement*>> graph;
|
||||
unordered_map<SgStatement*, int> inDegree;
|
||||
unordered_map<SgStatement*, int> degree;
|
||||
for (auto op : allStmts)
|
||||
inDegree[op] = 0;
|
||||
// find and remember initial dependencies
|
||||
unordered_set<SgStatement*> dependentStmts;
|
||||
for (const auto& pair : dependencies)
|
||||
{
|
||||
SgStatement* op = pair.first;
|
||||
const auto& deps = pair.second;
|
||||
degree[op] = deps.size();
|
||||
inDegree[op] = deps.size();
|
||||
if (!deps.empty())
|
||||
dependentStmts.insert(op);
|
||||
for (auto dep : deps)
|
||||
graph[dep].push_back(op);
|
||||
}
|
||||
for (SgStatement* op : allStmts)
|
||||
{
|
||||
if (!degree.count(op))
|
||||
{
|
||||
degree[op] = 0;
|
||||
}
|
||||
}
|
||||
// build queues
|
||||
using PQ = priority_queue<ReadyOp, vector<ReadyOp>, ReadyOpCompare>;
|
||||
PQ readyDependent;
|
||||
queue<SgStatement*> readyIndependent;
|
||||
size_t arrivalCounter = 0;
|
||||
for (auto op : allStmts)
|
||||
{
|
||||
if (inDegree[op] == 0)
|
||||
{
|
||||
if (dependentStmts.count(op))
|
||||
{
|
||||
readyDependent.emplace(op, degree[op], arrivalCounter++);
|
||||
}
|
||||
else
|
||||
{
|
||||
readyIndependent.push(op);
|
||||
}
|
||||
}
|
||||
}
|
||||
// main sort algorythm
|
||||
vector<SgStatement*> executionOrder;
|
||||
while (!readyDependent.empty() || !readyIndependent.empty())
|
||||
{
|
||||
SgStatement* current = nullptr;
|
||||
if (!readyDependent.empty())
|
||||
{
|
||||
current = readyDependent.top().stmt;
|
||||
readyDependent.pop();
|
||||
}
|
||||
else
|
||||
{
|
||||
current = readyIndependent.front();
|
||||
readyIndependent.pop();
|
||||
}
|
||||
executionOrder.push_back(current);
|
||||
for (SgStatement* neighbor : graph[current])
|
||||
{
|
||||
inDegree[neighbor]--;
|
||||
if (inDegree[neighbor] == 0) {
|
||||
if (dependentStmts.count(neighbor))
|
||||
{
|
||||
readyDependent.emplace(neighbor, degree[neighbor], arrivalCounter++);
|
||||
}
|
||||
else
|
||||
{
|
||||
readyIndependent.push(neighbor);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return executionOrder;
|
||||
}
|
||||
|
||||
void buildNewAST(SgStatement* loop, vector<SgStatement*>& newBody)
|
||||
{
|
||||
SgStatement* endDo = loop->lastNodeOfStmt();
|
||||
SgStatement* st = loop;
|
||||
int lineNum = loop -> lineNumber() + 1;
|
||||
for (int i = 0; i < newBody.size(); i++)
|
||||
{
|
||||
st -> setLexNext(*newBody[i]);
|
||||
st = st -> lexNext();
|
||||
st -> setlineNumber(lineNum);
|
||||
lineNum++;
|
||||
}
|
||||
st -> setLexNext(*endDo);
|
||||
}
|
||||
|
||||
|
||||
|
||||
void runSwapOperators(SgFile *file, std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR, int& countOfTransform)
|
||||
{
|
||||
std::cout << "SWAP_OPERATORS Pass" << std::endl; // to remove
|
||||
countOfTransform += 1; // to remove
|
||||
|
||||
const int funcNum = file -> numberOfFunctions();
|
||||
for (int i = 0; i < funcNum; ++i) {
|
||||
for (int i = 0; i < funcNum; ++i)
|
||||
{
|
||||
SgStatement *st = file -> functions(i);
|
||||
vector<SAPFOR::BasicBlock*> blocks = findFuncBlocksByFuncStatement(st, FullIR);
|
||||
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> loopsMapping = findAndAnalyzeLoops(st, blocks);
|
||||
|
||||
for (pair<SgForStmt*, vector<SAPFOR::BasicBlock*>> loopForAnalyze: loopsMapping) {
|
||||
vector<OperatorInfo> operators = analyzeOperatorsInLoop(loopForAnalyze.first, loopForAnalyze.second, FullIR);
|
||||
map<string, vector<SgStatement*>> varDefinitions = findVariableDefinitions(loopForAnalyze.first, operators);
|
||||
|
||||
vector<SgStatement*> newOrder = optimizeOperatorOrder(loopForAnalyze.first, operators, varDefinitions);
|
||||
applyOperatorReordering(loopForAnalyze.first, newOrder);
|
||||
for (pair<SgForStmt*, vector<SAPFOR::BasicBlock*>> loopForAnalyze: loopsMapping)
|
||||
{
|
||||
map<SgStatement*, set<SgStatement*>> dependencyGraph = AnalyzeLoopAndFindDeps(loopForAnalyze.first, loopForAnalyze.second, FullIR);
|
||||
// TODO: Write a function that will go through the operators and update all dependencies so that there are no mix-ups and splits inside the semantic blocks (for if, do and may be some other cases)
|
||||
buildAdditionalDeps(loopForAnalyze.first, dependencyGraph);
|
||||
cout << endl;
|
||||
int firstLine = loopForAnalyze.first -> lineNumber();
|
||||
int lastLine = loopForAnalyze.first -> lastNodeOfStmt() -> lineNumber();
|
||||
cout << "LOOP ANALYZE FROM " << firstLine << " TO " << lastLine << " RES" << endl;
|
||||
// for (auto &v: dependencyGraph) {
|
||||
// cout << "OPERATOR: " << v.first -> lineNumber() << " " << v.first -> variant() << "\nDEPENDS ON:" << endl;
|
||||
// if (v.second.size() != 0)
|
||||
// for (auto vv: v.second)
|
||||
// cout << vv -> lineNumber() << " ";
|
||||
// cout << endl;
|
||||
// }
|
||||
vector<SgStatement*> new_order = scheduleOperations(dependencyGraph);
|
||||
cout << "RESULT ORDER:" << endl;
|
||||
for (auto v: new_order)
|
||||
if (v -> lineNumber() > firstLine)
|
||||
cout << v -> lineNumber() << endl;
|
||||
buildNewAST(loopForAnalyze.first, new_order);
|
||||
st = loopForAnalyze.first -> lexNext();
|
||||
while (st != loopForAnalyze.first -> lastNodeOfStmt())
|
||||
{
|
||||
cout << st -> lineNumber() << " " << st -> sunparse() << endl;
|
||||
st = st -> lexNext();
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return;
|
||||
};
|
||||
|
||||
@@ -390,15 +390,32 @@ 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;
|
||||
delete[]elem;
|
||||
for (auto& elem : allocatedInt)
|
||||
delete[]elem;
|
||||
allocated.clear();
|
||||
|
||||
|
||||
allocatedInt.clear();
|
||||
|
||||
SPF_messages.clear();
|
||||
}
|
||||
|
||||
@@ -434,7 +451,7 @@ static map<string, vector<Messages>> removeCopies(map<string, vector<Messages>>
|
||||
return out;
|
||||
}
|
||||
|
||||
static string convertGlobalMessagesBuffer()
|
||||
static void convertGlobalMessagesBuffer(short *&result, int *&resultSize)
|
||||
{
|
||||
auto copySPF_messages = removeCopies(SPF_messages);
|
||||
for (auto &byFile : copySPF_messages)
|
||||
@@ -472,13 +489,21 @@ static string convertGlobalMessagesBuffer()
|
||||
json all;
|
||||
all["allMessages"] = allMessages;
|
||||
|
||||
return all.dump();
|
||||
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;
|
||||
}
|
||||
|
||||
void convertBuffers(string &resultM, string &result)
|
||||
|
||||
void convertBuffers(short*& resultM, int*& resultSizeM, short*& result, int*& resultSize)
|
||||
{
|
||||
resultM = convertGlobalMessagesBuffer();
|
||||
result = getGlobalBuffer();
|
||||
convertGlobalMessagesBuffer(resultM, resultSizeM);
|
||||
convertGlobalBuffer(result, resultSize);
|
||||
}
|
||||
|
||||
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(std::string& resultM, std::string& result);
|
||||
void convertBuffers(short*& resultM, int*& resultSizeM, short*& result, int*& resultSize);
|
||||
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 "2446"
|
||||
#define VERSION_SPF "2436"
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user