Compare commits
21 Commits
8905ef67b2
...
b0268f29d7
| Author | SHA1 | Date | |
|---|---|---|---|
| b0268f29d7 | |||
| 6a05bd5fc7 | |||
| ca77cc05d5 | |||
|
|
a04ee16023 | ||
|
|
0c4f9465df | ||
| 9dbbe9fcdc | |||
| f5d2ecf549 | |||
| eee6f30f94 | |||
|
|
11b3ecba2e | ||
|
|
d4e7b39acd | ||
|
|
d8e5c1bdf6 | ||
|
|
9afdf2a98b | ||
|
|
6091fa474d | ||
|
|
bc9c7cba5c | ||
|
|
c1d94be0be | ||
|
|
d78753888f | ||
|
|
025bbbe259 | ||
|
|
076a0c9699 | ||
|
|
90b311d049 | ||
|
|
5a1377e7ea | ||
|
|
b90d200fad |
@@ -166,6 +166,8 @@ set(PARALLEL_REG src/ParallelizationRegions/ParRegions.cpp
|
|||||||
set(ARRAY_PROP src/ArrayConstantPropagation/propagation.cpp
|
set(ARRAY_PROP src/ArrayConstantPropagation/propagation.cpp
|
||||||
src/ArrayConstantPropagation/propagation.h
|
src/ArrayConstantPropagation/propagation.h
|
||||||
)
|
)
|
||||||
|
set(MERGE_COPY_ARRAYS src/ParallelizationRegions/parse_merge_dirs.cpp
|
||||||
|
src/ParallelizationRegions/parse_merge_dirs.h)
|
||||||
|
|
||||||
set(TR_DEAD_CODE src/Transformations/DeadCodeRemoving/dead_code.cpp
|
set(TR_DEAD_CODE src/Transformations/DeadCodeRemoving/dead_code.cpp
|
||||||
src/Transformations/DeadCodeRemoving/dead_code.h)
|
src/Transformations/DeadCodeRemoving/dead_code.h)
|
||||||
@@ -426,6 +428,7 @@ set(SOURCE_EXE
|
|||||||
${LOOP_ANALYZER}
|
${LOOP_ANALYZER}
|
||||||
${TRANSFORMS}
|
${TRANSFORMS}
|
||||||
${PARALLEL_REG}
|
${PARALLEL_REG}
|
||||||
|
${MERGE_COPY_ARRAYS}
|
||||||
${PRIV}
|
${PRIV}
|
||||||
${ARRAY_PROP}
|
${ARRAY_PROP}
|
||||||
${FDVM}
|
${FDVM}
|
||||||
@@ -479,6 +482,7 @@ source_group (GraphCall FILES ${GR_CALL})
|
|||||||
source_group (GraphLoop FILES ${GR_LOOP})
|
source_group (GraphLoop FILES ${GR_LOOP})
|
||||||
source_group (LoopAnalyzer FILES ${LOOP_ANALYZER})
|
source_group (LoopAnalyzer FILES ${LOOP_ANALYZER})
|
||||||
source_group (ParallelizationRegions FILES ${PARALLEL_REG})
|
source_group (ParallelizationRegions FILES ${PARALLEL_REG})
|
||||||
|
source_group (MergeCopyArrays FILES ${MERGE_COPY_ARRAYS})
|
||||||
source_group (PrivateAnalyzer FILES ${PRIV})
|
source_group (PrivateAnalyzer FILES ${PRIV})
|
||||||
source_group (ArrayConstantPropagation FILES ${ARRAY_PROP})
|
source_group (ArrayConstantPropagation FILES ${ARRAY_PROP})
|
||||||
source_group (FDVM_Compiler FILES ${FDVM})
|
source_group (FDVM_Compiler FILES ${FDVM})
|
||||||
|
|||||||
Submodule projects/dvm updated: 3aad02affb...cdda71deab
@@ -1162,8 +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)
|
if (!settings.withUnreachable)
|
||||||
removedUnreachableBlocks(blocks);
|
for (auto& [func, blocks] : result)
|
||||||
|
removedUnreachableBlocks(blocks);
|
||||||
|
|
||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -105,23 +105,52 @@ namespace SAPFOR
|
|||||||
|
|
||||||
struct CFG_Settings
|
struct CFG_Settings
|
||||||
{
|
{
|
||||||
|
enum setting { CFG_atLeastOneIterInLoop = 1,
|
||||||
|
CFG_withRD = 2,
|
||||||
|
CFG_withRegisters = 3,
|
||||||
|
CFG_withSPF = 4,
|
||||||
|
CFG_withDVM = 5,
|
||||||
|
CFG_withCallsInBlocks = 6,
|
||||||
|
CFG_withCallFrom = 7,
|
||||||
|
CFG_withDominators = 8,
|
||||||
|
CFG_withUnreachable = 9 };
|
||||||
|
|
||||||
bool atLeastOneIterInLoop = false;
|
bool atLeastOneIterInLoop = false;
|
||||||
bool withRD = true;
|
bool withRD = false;
|
||||||
bool withRegisters = false;
|
bool withRegisters = false;
|
||||||
bool withSPF = false;
|
bool withSPF = false;
|
||||||
bool withDVM = false;
|
bool withDVM = false;
|
||||||
bool withCallsInBlocks = false; // separate each F_CALL to own BasicBlock
|
bool withCallsInBlocks = false; // separate each F_CALL to own BasicBlock
|
||||||
bool withCallFrom = true;
|
bool withCallFrom = false;
|
||||||
bool withDominators = true;
|
bool withDominators = false;
|
||||||
|
bool withUnreachable = false;
|
||||||
|
|
||||||
explicit CFG_Settings(int) { }
|
explicit CFG_Settings(const std::set<setting> &settings = { CFG_withRD, CFG_withCallFrom, CFG_withDominators })
|
||||||
|
{
|
||||||
explicit CFG_Settings(bool atLeastOneIterInLoop = false, bool withRD = true, bool withRegisters = false,
|
for (auto& set : settings)
|
||||||
bool withDVM = false, bool withSPF = false, bool withCallsInBlocks = false,
|
{
|
||||||
bool withCallFrom = true, bool withDominators = true) :
|
if (set == CFG_atLeastOneIterInLoop)
|
||||||
atLeastOneIterInLoop(atLeastOneIterInLoop), withRD(withRD), withRegisters(withRegisters), withDVM(withDVM), withSPF(withSPF),
|
atLeastOneIterInLoop = true;
|
||||||
withCallsInBlocks(withCallsInBlocks), withCallFrom(withCallFrom), withDominators(withDominators)
|
else if (set == CFG_withRD)
|
||||||
{ }
|
withRD = true;
|
||||||
|
else if (set == CFG_withRegisters)
|
||||||
|
withRegisters = true;
|
||||||
|
else if (set == CFG_withSPF)
|
||||||
|
withSPF = true;
|
||||||
|
else if (set == CFG_withDVM)
|
||||||
|
withDVM = true;
|
||||||
|
else if (set == CFG_withCallsInBlocks)
|
||||||
|
withCallsInBlocks = true;
|
||||||
|
else if (set == CFG_withCallFrom)
|
||||||
|
withCallFrom = true;
|
||||||
|
else if (set == CFG_withDominators)
|
||||||
|
withDominators = true;
|
||||||
|
else if (set == CFG_withUnreachable)
|
||||||
|
withUnreachable = true;
|
||||||
|
else
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
}
|
||||||
|
}
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -321,6 +321,12 @@ static set<SAPFOR::BasicBlock*> analyzeLoop(LoopGraph* loop, const set<SAPFOR::B
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (currentLoop.empty()) // can't find loop IR - loop unreachable!
|
||||||
|
{
|
||||||
|
__spf_print(1, "Unreachable loop on %s:%d\n", current_file->filename(), loop_operator->lineNumber());
|
||||||
|
return currentLoop;
|
||||||
|
}
|
||||||
|
|
||||||
if (!head_block)
|
if (!head_block)
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
|||||||
@@ -853,12 +853,21 @@ static pair<string, string> getModuleRename(const set<SgStatement*>& allocatable
|
|||||||
return make_pair("", "");
|
return make_pair("", "");
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void doRename(string& str, const pair<string, string>& renamePair)
|
||||||
|
{
|
||||||
|
auto it = str.find(renamePair.first);
|
||||||
|
if (it != string::npos)
|
||||||
|
if (str[it + renamePair.first.size()] == '(' && str[it - 1] == ' ')
|
||||||
|
str = str.replace(it, renamePair.first.size(), renamePair.second);
|
||||||
|
}
|
||||||
|
|
||||||
static pair<DIST::Array*, string>
|
static pair<DIST::Array*, string>
|
||||||
getNewDirective(const string &fullArrayName,
|
getNewDirective(const string &fullArrayName,
|
||||||
const vector<string> &distrRules,
|
const vector<string> &distrRules,
|
||||||
const vector<string> &alignRules,
|
const vector<string> &alignRules,
|
||||||
const DataDirective &dataDir,
|
const DataDirective &dataDir,
|
||||||
const set<SgStatement*>& allocatableStmts)
|
const set<SgStatement*>& allocatableStmts,
|
||||||
|
const pair<string, int>& position_decl)
|
||||||
{
|
{
|
||||||
string out = "";
|
string out = "";
|
||||||
DIST::Array* outA = NULL;
|
DIST::Array* outA = NULL;
|
||||||
@@ -877,7 +886,8 @@ getNewDirective(const string &fullArrayName,
|
|||||||
|
|
||||||
for (int i = 0; i < dataDir.alignRules.size(); ++i)
|
for (int i = 0; i < dataDir.alignRules.size(); ++i)
|
||||||
{
|
{
|
||||||
if (dataDir.alignRules[i].alignArray->GetName() == fullArrayName)
|
auto alignArray = dataDir.alignRules[i].alignArray;
|
||||||
|
if (alignArray->GetName() == fullArrayName)
|
||||||
{
|
{
|
||||||
string rule = alignRules[i];
|
string rule = alignRules[i];
|
||||||
if (allocatableStmts.size())
|
if (allocatableStmts.size())
|
||||||
@@ -889,21 +899,21 @@ getNewDirective(const string &fullArrayName,
|
|||||||
it = rule.find("ALIGN", it + 7);
|
it = rule.find("ALIGN", it + 7);
|
||||||
}
|
}
|
||||||
|
|
||||||
auto renamePair = getModuleRename(allocatableStmts, dataDir.alignRules[i].alignArray);
|
auto renamePair = getModuleRename(allocatableStmts, alignArray);
|
||||||
if (renamePair.first != "")
|
doRename(rule, renamePair);
|
||||||
{
|
}
|
||||||
it = rule.find(renamePair.first);
|
else if (alignArray->GetLocation().first == DIST::l_COMMON)
|
||||||
if (it != string::npos)
|
{
|
||||||
if (rule[it + renamePair.first.size()] == '(' && rule[it - 1] == ' ')
|
auto symb = alignArray->GetDeclSymbol(position_decl);
|
||||||
rule = rule.replace(it, renamePair.first.size(), renamePair.second);
|
if (symb->identifier() != alignArray->GetShortName())
|
||||||
}
|
doRename(rule, make_pair(alignArray->GetShortName(), symb->identifier()));
|
||||||
}
|
}
|
||||||
|
|
||||||
out += "!DVM$ " + rule + "\n";
|
out += "!DVM$ " + rule + "\n";
|
||||||
if (!out_free_form)
|
if (!out_free_form)
|
||||||
out = splitDirective(out);
|
out = splitDirective(out);
|
||||||
|
|
||||||
return make_pair(dataDir.alignRules[i].alignArray, out);
|
return make_pair(alignArray, out);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -1743,7 +1753,7 @@ void insertDistributionToFile(SgFile *file, const char *fin_name, const DataDire
|
|||||||
if (allocatableStmtsCopy.size())
|
if (allocatableStmtsCopy.size())
|
||||||
allocatableStmts = filterAllocateStats(file, allocatableStmtsCopy, currSymb->identifier());
|
allocatableStmts = filterAllocateStats(file, allocatableStmtsCopy, currSymb->identifier());
|
||||||
|
|
||||||
pair<DIST::Array*, string> dirWithArray = getNewDirective(fullArrayName, distrRules, alignRules, dataDir, allocatableStmts);
|
pair<DIST::Array*, string> dirWithArray = getNewDirective(fullArrayName, distrRules, alignRules, dataDir, allocatableStmts, make_pair(st->fileName(), st->lineNumber()));
|
||||||
|
|
||||||
string toInsert = dirWithArray.second;
|
string toInsert = dirWithArray.second;
|
||||||
if (toInsert != "")
|
if (toInsert != "")
|
||||||
@@ -1975,20 +1985,27 @@ void insertDistributionToFile(SgFile *file, const char *fin_name, const DataDire
|
|||||||
set<string> toInsertArrays;
|
set<string> toInsertArrays;
|
||||||
for (auto &array : dynamicArraysLocal)
|
for (auto &array : dynamicArraysLocal)
|
||||||
{
|
{
|
||||||
|
string name = array->GetShortName();
|
||||||
|
if (array->GetLocation().first == DIST::l_COMMON)
|
||||||
|
{
|
||||||
|
auto symb = array->GetDeclSymbol(make_pair(st->fileName(), st->lineNumber()));
|
||||||
|
name = symb->identifier();
|
||||||
|
}
|
||||||
|
|
||||||
if (extractDir)
|
if (extractDir)
|
||||||
{
|
{
|
||||||
if (dynamicArraysAdded.find(array->GetShortName()) != dynamicArraysAdded.end())
|
if (dynamicArraysAdded.find(name) != dynamicArraysAdded.end())
|
||||||
{
|
{
|
||||||
dynamicArraysAdded.erase(array->GetShortName());
|
dynamicArraysAdded.erase(name);
|
||||||
toInsertArrays.insert(array->GetShortName());
|
toInsertArrays.insert(name);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
if (dynamicArraysAdded.find(array->GetShortName()) == dynamicArraysAdded.end())
|
if (dynamicArraysAdded.find(name) == dynamicArraysAdded.end())
|
||||||
{
|
{
|
||||||
dynamicArraysAdded.insert(array->GetShortName());
|
dynamicArraysAdded.insert(name);
|
||||||
toInsertArrays.insert(array->GetShortName());
|
toInsertArrays.insert(name);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -2145,7 +2162,14 @@ void insertShadowSpecToFile(SgFile *file, const char *fin_name, const set<string
|
|||||||
|
|
||||||
if (needToGen)
|
if (needToGen)
|
||||||
{
|
{
|
||||||
string shadowSpecInsert = "!DVM$ SHADOW " + array->GetShortName() + "(";
|
string name = array->GetShortName();
|
||||||
|
if (array->GetLocation().first == DIST::l_COMMON)
|
||||||
|
{
|
||||||
|
auto symb = array->GetDeclSymbol(make_pair(st->fileName(), st->lineNumber()));
|
||||||
|
name = symb->identifier();
|
||||||
|
}
|
||||||
|
|
||||||
|
string shadowSpecInsert = "!DVM$ SHADOW " + name + "(";
|
||||||
for (int k = 0; k < currSpec.size(); ++k)
|
for (int k = 0; k < currSpec.size(); ++k)
|
||||||
{
|
{
|
||||||
char buf[256];
|
char buf[256];
|
||||||
@@ -2157,7 +2181,7 @@ void insertShadowSpecToFile(SgFile *file, const char *fin_name, const set<string
|
|||||||
shadowSpecInsert += ")\n";
|
shadowSpecInsert += ")\n";
|
||||||
|
|
||||||
shadowsSpecsString.push_back(shadowSpecInsert);
|
shadowsSpecsString.push_back(shadowSpecInsert);
|
||||||
pair<SgExpression*, SgExpression*> newSpec = genShadowSpec(file, make_pair(array->GetShortName(), currSpec));
|
pair<SgExpression*, SgExpression*> newSpec = genShadowSpec(file, make_pair(name, currSpec));
|
||||||
if (newSpec.first == NULL || newSpec.second == NULL)
|
if (newSpec.first == NULL || newSpec.second == NULL)
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
shadowsSpecs.push_back(newSpec);
|
shadowsSpecs.push_back(newSpec);
|
||||||
|
|||||||
@@ -26,6 +26,7 @@ using std::string;
|
|||||||
using std::vector;
|
using std::vector;
|
||||||
using std::pair;
|
using std::pair;
|
||||||
using std::make_pair;
|
using std::make_pair;
|
||||||
|
using SAPFOR::CFG_Settings;
|
||||||
|
|
||||||
extern int debSh;
|
extern int debSh;
|
||||||
|
|
||||||
@@ -1672,9 +1673,12 @@ void GroupShadow(const map<string, vector<FuncInfo*>>& allFuncs,
|
|||||||
|
|
||||||
SgStatement* func = currF->funcPointer->GetOriginal();
|
SgStatement* func = currF->funcPointer->GetOriginal();
|
||||||
|
|
||||||
auto cfg = buildCFGforCurrentFunc(func, SAPFOR::CFG_Settings(true, false, false, true, false, true, false), commonBlocks, allFuncs);
|
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop, CFG_Settings::CFG_withDVM,
|
||||||
|
CFG_Settings::CFG_withCallsInBlocks, CFG_Settings::CFG_withUnreachable });
|
||||||
|
auto cfg = buildCFGforCurrentFunc(func, settings, commonBlocks, allFuncs);
|
||||||
if (cfg.size() != 1)
|
if (cfg.size() != 1)
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
auto& blocks = cfg.begin()->second;
|
auto& blocks = cfg.begin()->second;
|
||||||
|
|
||||||
//create reaching blocks
|
//create reaching blocks
|
||||||
|
|||||||
@@ -336,9 +336,24 @@ namespace Distribution
|
|||||||
if (pos != STRING::npos)
|
if (pos != STRING::npos)
|
||||||
{
|
{
|
||||||
name.erase(pos, shortName.size());
|
name.erase(pos, shortName.size());
|
||||||
shortName = newName;
|
|
||||||
name += newName;
|
name += newName;
|
||||||
}
|
}
|
||||||
|
else if (locationPos.first == l_COMMON) // name of array in common may be different
|
||||||
|
{
|
||||||
|
pos = name.rfind("_");
|
||||||
|
if (pos != STRING::npos)
|
||||||
|
{
|
||||||
|
name.erase(pos + 1, shortName.size());
|
||||||
|
name += newName;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
#if __SPF
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
}
|
||||||
|
shortName = newName;
|
||||||
GenUniqKey();
|
GenUniqKey();
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -542,6 +557,44 @@ namespace Distribution
|
|||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Symbol* GetDeclSymbol(const PAIR<STRING, int>& position_decl) const
|
||||||
|
{
|
||||||
|
if (!IsArray() || locationPos.first != l_COMMON)
|
||||||
|
return declSymbol;
|
||||||
|
|
||||||
|
auto it = declPlacesSymbol.find(position_decl);
|
||||||
|
if (it != declPlacesSymbol.end())
|
||||||
|
return it->second;
|
||||||
|
else // find nearest
|
||||||
|
{
|
||||||
|
MAP<PAIR<STRING, int>, Symbol*> currFile;
|
||||||
|
for (auto& [position, symb] : declPlacesSymbol)
|
||||||
|
{
|
||||||
|
if (position.first == position_decl.first)
|
||||||
|
currFile[position] = symb;
|
||||||
|
}
|
||||||
|
|
||||||
|
PAIR<int, Symbol*> nearest = { (int)0, NULL };
|
||||||
|
const int needed_pos = position_decl.second;
|
||||||
|
|
||||||
|
for (auto& [position, symb] : currFile)
|
||||||
|
{
|
||||||
|
if (nearest.second == NULL)
|
||||||
|
nearest = { abs(position.second - needed_pos), symb };
|
||||||
|
|
||||||
|
if (abs(position.second - needed_pos) < nearest.first)
|
||||||
|
nearest = { abs(position.second - needed_pos), symb };
|
||||||
|
}
|
||||||
|
|
||||||
|
if (nearest.second)
|
||||||
|
return nearest.second;
|
||||||
|
#if __SPF
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
Symbol* GetDeclSymbol() const { return declSymbol; }
|
Symbol* GetDeclSymbol() const { return declSymbol; }
|
||||||
void SetDeclSymbol(Symbol *s) { declSymbol = s; }
|
void SetDeclSymbol(Symbol *s) { declSymbol = s; }
|
||||||
|
|
||||||
|
|||||||
616
src/ParallelizationRegions/parse_merge_dirs.cpp
Normal file
616
src/ParallelizationRegions/parse_merge_dirs.cpp
Normal file
@@ -0,0 +1,616 @@
|
|||||||
|
#include "parse_merge_dirs.h"
|
||||||
|
|
||||||
|
#include <unordered_set>
|
||||||
|
|
||||||
|
using std::map;
|
||||||
|
using std::pair;
|
||||||
|
using std::string;
|
||||||
|
using std::unordered_map;
|
||||||
|
using std::unordered_set;
|
||||||
|
using std::vector;
|
||||||
|
|
||||||
|
static void parseMergeDirective(const char *comment,
|
||||||
|
vector<pair<string, string>> &parsed_mapping)
|
||||||
|
{
|
||||||
|
while (comment)
|
||||||
|
{
|
||||||
|
auto *line_end = strchr(comment, '\n');
|
||||||
|
|
||||||
|
static const char prefix[] = "!!SPF TRANSFORM(MERGE_ARRAYS(";
|
||||||
|
static const auto compare_chars = sizeof(prefix) - 1;
|
||||||
|
|
||||||
|
if (strncasecmp(comment, prefix, compare_chars) == 0)
|
||||||
|
{
|
||||||
|
auto *pair_start = comment + compare_chars;
|
||||||
|
auto *comma = strchr(pair_start, ',');
|
||||||
|
if (comma)
|
||||||
|
{
|
||||||
|
auto *close_br = strchr(comma + 1, ')');
|
||||||
|
if (close_br)
|
||||||
|
{
|
||||||
|
parsed_mapping.emplace_back(
|
||||||
|
string(pair_start, comma - pair_start),
|
||||||
|
string(comma + 1, close_br - comma - 1));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
comment = line_end;
|
||||||
|
|
||||||
|
if (comment)
|
||||||
|
comment++;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static string getNonDefaultRegion(DIST::Array *a)
|
||||||
|
{
|
||||||
|
string result;
|
||||||
|
|
||||||
|
if (!a)
|
||||||
|
return result;
|
||||||
|
|
||||||
|
for (const auto ®_name : a->GetRegionsName())
|
||||||
|
{
|
||||||
|
if (reg_name != "default")
|
||||||
|
{
|
||||||
|
if (!result.empty())
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
result = reg_name;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool hasSameSizes(DIST::Array *a, DIST::Array *b)
|
||||||
|
{
|
||||||
|
for (auto *array : {a, b})
|
||||||
|
{
|
||||||
|
for (const auto &p : array->GetSizes())
|
||||||
|
{
|
||||||
|
if (p.first < 0 || p.second < 0)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return a->GetSizes() == b->GetSizes() && a->GetTypeSize() == b->GetTypeSize();
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool checkSimilarTemplates(vector<ParallelRegion *> ®ions,
|
||||||
|
const unordered_map<string, string> &new_region_mapping)
|
||||||
|
{
|
||||||
|
// new region -> old regions
|
||||||
|
unordered_map<string, unordered_set<string>> new_region_inverse_mapping;
|
||||||
|
for (const auto &p : new_region_mapping)
|
||||||
|
new_region_inverse_mapping[p.second].insert(p.first);
|
||||||
|
|
||||||
|
for (const auto &new_reg : new_region_inverse_mapping)
|
||||||
|
{
|
||||||
|
DIST::Array *template_array = nullptr;
|
||||||
|
string first_reg_name;
|
||||||
|
|
||||||
|
for (const auto &old_region_name : new_reg.second)
|
||||||
|
{
|
||||||
|
auto *old_reg = getRegionByName(regions, old_region_name);
|
||||||
|
|
||||||
|
if (!old_reg)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
const auto &distr_rules = old_reg->GetDataDir().GetDistrRules();
|
||||||
|
if (distr_rules.size() != 1)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
auto *current_template = distr_rules.front().first;
|
||||||
|
|
||||||
|
if (template_array)
|
||||||
|
{
|
||||||
|
if (!hasSameSizes(template_array, current_template))
|
||||||
|
{
|
||||||
|
__spf_print(1, "Templates of %s and %s has different sizes\n",
|
||||||
|
first_reg_name.c_str(),
|
||||||
|
old_region_name.c_str());
|
||||||
|
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
// else everything OK
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
template_array = current_template;
|
||||||
|
first_reg_name = old_region_name;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool hasSameAlignment(const std::unordered_set<const AlignRule *> &align_a,
|
||||||
|
const std::unordered_set<const AlignRule *> &align_b)
|
||||||
|
{
|
||||||
|
if (align_a.size() != 1 || align_b.size() != 1)
|
||||||
|
return false;
|
||||||
|
|
||||||
|
const auto *rule_a = *align_a.begin();
|
||||||
|
const auto *rule_b = *align_b.begin();
|
||||||
|
|
||||||
|
if (rule_a->alignRule != rule_b->alignRule)
|
||||||
|
return false;
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void printExpr(SgExpression *e, string pad)
|
||||||
|
{
|
||||||
|
if (!e)
|
||||||
|
return;
|
||||||
|
|
||||||
|
__spf_print(1, "%s%d: %s\n", pad.c_str(), e->variant(), e->unparse());
|
||||||
|
|
||||||
|
printExpr(e->lhs(), pad + " ");
|
||||||
|
printExpr(e->rhs(), pad + " ");
|
||||||
|
}
|
||||||
|
|
||||||
|
static pair<vector<SgStatement *>, SgSymbol *> generateDeclaration(const string &array_name, const string &common_block_name,
|
||||||
|
const vector<pair<int, int>> &sizes, SgType *type, SgStatement *scope)
|
||||||
|
{
|
||||||
|
auto *array_symbol = new SgSymbol(VARIABLE_NAME, array_name.c_str(), new SgType(T_ARRAY), scope);
|
||||||
|
|
||||||
|
auto *decl = new SgDeclarationStatement(VAR_DECL);
|
||||||
|
|
||||||
|
decl->setExpression(1, new SgTypeExp(*type));
|
||||||
|
|
||||||
|
SgExpression *subs = new SgExprListExp();
|
||||||
|
|
||||||
|
auto *array_ref = new SgArrayRefExp(*array_symbol, *subs);
|
||||||
|
|
||||||
|
for (int i = 0; i < sizes.size(); i++)
|
||||||
|
{
|
||||||
|
const auto &p = sizes[i];
|
||||||
|
auto *d = new SgExpression(DDOT, new SgValueExp(p.first), new SgValueExp(p.second));
|
||||||
|
subs->setLhs(d);
|
||||||
|
|
||||||
|
if (i + 1 < sizes.size())
|
||||||
|
{
|
||||||
|
subs->setRhs(new SgExprListExp());
|
||||||
|
subs = subs->rhs();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
decl->setExpression(0, array_ref);
|
||||||
|
|
||||||
|
auto comm = new SgStatement(COMM_STAT);
|
||||||
|
|
||||||
|
comm->setExpression(0, new SgExpression(COMM_LIST,
|
||||||
|
new SgVarRefExp(array_symbol),
|
||||||
|
NULL,
|
||||||
|
new SgSymbol(COMMON_NAME, common_block_name.c_str())));
|
||||||
|
|
||||||
|
return {{decl, comm}, array_symbol};
|
||||||
|
}
|
||||||
|
|
||||||
|
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;
|
||||||
|
}
|
||||||
|
|
||||||
|
SgType* GetArrayType(DIST::Array *array)
|
||||||
|
{
|
||||||
|
if (!array)
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
for (const auto& decl_place : array->GetDeclInfo())
|
||||||
|
{
|
||||||
|
if (SgFile::switchToFile(decl_place.first) != -1)
|
||||||
|
{
|
||||||
|
auto* decl = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
||||||
|
if (decl)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < 3; i++)
|
||||||
|
{
|
||||||
|
auto* found_type = isSgTypeExp(findExprWithVariant(decl->expr(i), TYPE_OP));
|
||||||
|
if (found_type)
|
||||||
|
return found_type->type();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
SgSymbol *insertDeclIfNeeded(const string &array_name,
|
||||||
|
const string &common_block_name,
|
||||||
|
DIST::Array *example_array,
|
||||||
|
FuncInfo *dest,
|
||||||
|
unordered_map<FuncInfo *, unordered_map<string, SgSymbol *>> &inserted_arrays)
|
||||||
|
{
|
||||||
|
auto *type = GetArrayType(example_array);
|
||||||
|
|
||||||
|
if (!type)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
if (SgFile::switchToFile(dest->fileName) == -1)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
auto &by_func = inserted_arrays[dest];
|
||||||
|
auto it = by_func.find(array_name);
|
||||||
|
|
||||||
|
if (it != by_func.end())
|
||||||
|
return it->second;
|
||||||
|
|
||||||
|
SgStatement *st = dest->funcPointer;
|
||||||
|
|
||||||
|
auto *end = st->lastNodeOfStmt();
|
||||||
|
|
||||||
|
st = st->lexNext();
|
||||||
|
|
||||||
|
while (st != end && !isSgExecutableStatement(st))
|
||||||
|
{
|
||||||
|
st = st->lexNext();
|
||||||
|
}
|
||||||
|
|
||||||
|
auto generated = generateDeclaration(array_name, common_block_name,
|
||||||
|
example_array->GetSizes(),
|
||||||
|
type, dest->funcPointer);
|
||||||
|
for (auto *new_stmt : generated.first)
|
||||||
|
st->insertStmtBefore(*new_stmt, *dest->funcPointer);
|
||||||
|
|
||||||
|
by_func[array_name] = generated.second;
|
||||||
|
|
||||||
|
return generated.second;
|
||||||
|
}
|
||||||
|
|
||||||
|
static pair<string, string> createNewArray(DIST::Array *example_array, const string &base_name,
|
||||||
|
const map<string, vector<FuncInfo *>> &allFuncInfo,
|
||||||
|
unordered_map<FuncInfo *, unordered_map<string, SgSymbol *>> &inserted_arrays)
|
||||||
|
{
|
||||||
|
auto common_block_name = base_name + "_merge_cb";
|
||||||
|
auto array_name = base_name;
|
||||||
|
|
||||||
|
for (const auto &by_file : allFuncInfo)
|
||||||
|
{
|
||||||
|
for (auto *func_info : by_file.second)
|
||||||
|
{
|
||||||
|
if (func_info->isMain)
|
||||||
|
{
|
||||||
|
insertDeclIfNeeded(
|
||||||
|
array_name,
|
||||||
|
common_block_name,
|
||||||
|
example_array,
|
||||||
|
func_info,
|
||||||
|
inserted_arrays);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return std::make_pair(array_name, common_block_name);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void replaceArrayRec(SgExpression *e,
|
||||||
|
const unordered_set<string> &arrays_to_replace,
|
||||||
|
SgSymbol **func_symbol_hint,
|
||||||
|
const pair<string, string> &replace_by,
|
||||||
|
DIST::Array *example_array,
|
||||||
|
FuncInfo *func,
|
||||||
|
unordered_map<FuncInfo *, unordered_map<string, SgSymbol *>> &inserted_arrays)
|
||||||
|
{
|
||||||
|
if (!e)
|
||||||
|
return;
|
||||||
|
|
||||||
|
if (isArrayRef(e) && arrays_to_replace.find(e->symbol()->identifier()) != arrays_to_replace.end())
|
||||||
|
{
|
||||||
|
if (!(*func_symbol_hint))
|
||||||
|
{
|
||||||
|
*func_symbol_hint = insertDeclIfNeeded(
|
||||||
|
replace_by.first, replace_by.second,
|
||||||
|
example_array,
|
||||||
|
func,
|
||||||
|
inserted_arrays);
|
||||||
|
}
|
||||||
|
|
||||||
|
e->setSymbol(*func_symbol_hint);
|
||||||
|
}
|
||||||
|
|
||||||
|
replaceArrayRec(
|
||||||
|
e->lhs(),
|
||||||
|
arrays_to_replace,
|
||||||
|
func_symbol_hint,
|
||||||
|
replace_by,
|
||||||
|
example_array,
|
||||||
|
func,
|
||||||
|
inserted_arrays);
|
||||||
|
|
||||||
|
replaceArrayRec(
|
||||||
|
e->rhs(),
|
||||||
|
arrays_to_replace,
|
||||||
|
func_symbol_hint,
|
||||||
|
replace_by,
|
||||||
|
example_array,
|
||||||
|
func,
|
||||||
|
inserted_arrays);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void replaceRegion(SgStatement* st, const unordered_map<string, string> &new_region_mapping)
|
||||||
|
{
|
||||||
|
if (!st)
|
||||||
|
return;
|
||||||
|
|
||||||
|
if(isSPF_stat(st) && st->variant() == SPF_PARALLEL_REG_DIR)
|
||||||
|
{
|
||||||
|
auto it = new_region_mapping.find(st->symbol()->identifier());
|
||||||
|
|
||||||
|
if (it != new_region_mapping.end())
|
||||||
|
st->setSymbol(*(new SgSymbol(CONST_NAME, it->second.c_str())));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void mergeCopyArrays(vector<ParallelRegion *> ®ions, const map<string, vector<FuncInfo *>> &allFuncInfo)
|
||||||
|
{
|
||||||
|
for (const auto *region : regions)
|
||||||
|
{
|
||||||
|
__spf_print(1, "region %s\n", region->GetName().c_str());
|
||||||
|
|
||||||
|
const auto &dirs = region->GetDataDir();
|
||||||
|
|
||||||
|
__spf_print(1, " distr rules: %d\n", dirs.distrRules.size());
|
||||||
|
|
||||||
|
const auto ¤tVariant = region->GetCurrentVariant();
|
||||||
|
|
||||||
|
int distr_idx = 0;
|
||||||
|
for (const auto &distr : dirs.distrRules)
|
||||||
|
{
|
||||||
|
const auto &dist_rule = distr.second.back().distRule;
|
||||||
|
|
||||||
|
string sizes;
|
||||||
|
for (const auto &p : distr.first->GetSizes())
|
||||||
|
{
|
||||||
|
if (!sizes.empty())
|
||||||
|
sizes.push_back(',');
|
||||||
|
|
||||||
|
sizes += std::to_string(p.first) + ":" + std::to_string(p.second);
|
||||||
|
}
|
||||||
|
|
||||||
|
__spf_print(1, " DIST %s(%s)", distr.first->GetName().c_str(), sizes.c_str());
|
||||||
|
for (const auto &dim : dist_rule)
|
||||||
|
__spf_print(1, " %c", dim == dist::BLOCK ? 'B' : '*');
|
||||||
|
|
||||||
|
__spf_print(1, "\n");
|
||||||
|
distr_idx++;
|
||||||
|
}
|
||||||
|
|
||||||
|
__spf_print(1, " align rules: %d\n", dirs.alignRules.size());
|
||||||
|
|
||||||
|
for (const auto &align : dirs.alignRules)
|
||||||
|
{
|
||||||
|
string sub_a, sub_b;
|
||||||
|
|
||||||
|
int i = 0;
|
||||||
|
for (const auto coefs : align.alignRule)
|
||||||
|
{
|
||||||
|
if (!sub_a.empty())
|
||||||
|
sub_a.push_back(',');
|
||||||
|
|
||||||
|
sub_a += std::to_string(coefs.first) + "*i" +
|
||||||
|
std::to_string(i) + "+" + std::to_string(coefs.second);
|
||||||
|
|
||||||
|
i++;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (const auto coefs : align.alignRuleWith)
|
||||||
|
{
|
||||||
|
if (!sub_b.empty())
|
||||||
|
sub_b.push_back(',');
|
||||||
|
|
||||||
|
sub_b += std::to_string(coefs.second.first) + "*i" +
|
||||||
|
std::to_string(coefs.first) + "+" + std::to_string(coefs.second.second);
|
||||||
|
}
|
||||||
|
|
||||||
|
__spf_print(1, " ALIGN %s(%s) WITH %s(%s)\n",
|
||||||
|
align.alignArray->GetName().c_str(), sub_a.c_str(),
|
||||||
|
align.alignWith->GetName().c_str(), sub_b.c_str());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// parse directives
|
||||||
|
|
||||||
|
// new array name -> current arrays
|
||||||
|
unordered_map<string, unordered_set<DIST::Array *>> arrays_to_merge;
|
||||||
|
unordered_map<DIST::Array *, unordered_set<const AlignRule *>> array_alignment;
|
||||||
|
|
||||||
|
for (const auto &by_file : allFuncInfo)
|
||||||
|
{
|
||||||
|
const auto current_file_name = by_file.first;
|
||||||
|
|
||||||
|
if (SgFile::switchToFile(current_file_name) == -1)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
for (auto *func_info : by_file.second)
|
||||||
|
{
|
||||||
|
SgStatement *curr_stmt = func_info->funcPointer;
|
||||||
|
if (!curr_stmt)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
auto *stmt_end = curr_stmt->lastDeclaration();
|
||||||
|
if (!stmt_end)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
stmt_end = stmt_end->lexNext();
|
||||||
|
|
||||||
|
for (; curr_stmt && curr_stmt != stmt_end; curr_stmt = curr_stmt->lexNext())
|
||||||
|
{
|
||||||
|
if (curr_stmt->comments())
|
||||||
|
{
|
||||||
|
vector<pair<string, string>> parsed_mapping;
|
||||||
|
parseMergeDirective(curr_stmt->comments(), parsed_mapping);
|
||||||
|
|
||||||
|
for (const auto &p : parsed_mapping)
|
||||||
|
{
|
||||||
|
auto *found_array = getArrayFromDeclarated(curr_stmt, p.first);
|
||||||
|
if (found_array)
|
||||||
|
{
|
||||||
|
arrays_to_merge[p.second].insert(found_array);
|
||||||
|
array_alignment[found_array] = {};
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// find alignment rules for array
|
||||||
|
|
||||||
|
for (const auto *region : regions)
|
||||||
|
{
|
||||||
|
const auto &dirs = region->GetDataDir();
|
||||||
|
|
||||||
|
for (const auto &align : dirs.alignRules)
|
||||||
|
{
|
||||||
|
auto it = array_alignment.find(align.alignArray);
|
||||||
|
|
||||||
|
if (it != array_alignment.end())
|
||||||
|
it->second.insert(&align);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// old region -> new region
|
||||||
|
unordered_map<string, string> new_region_mapping;
|
||||||
|
|
||||||
|
// new array -> new region
|
||||||
|
unordered_map<string, string> arrays_new_region_mapping;
|
||||||
|
vector<string> created_region_names;
|
||||||
|
|
||||||
|
for (const auto &by_new_array : arrays_to_merge)
|
||||||
|
{
|
||||||
|
string new_region_name;
|
||||||
|
for (auto *current_array : by_new_array.second)
|
||||||
|
{
|
||||||
|
auto current_array_region = getNonDefaultRegion(current_array);
|
||||||
|
auto it = new_region_mapping.find(current_array_region);
|
||||||
|
if (it != new_region_mapping.end())
|
||||||
|
{
|
||||||
|
if (new_region_name.empty())
|
||||||
|
new_region_name = it->second;
|
||||||
|
else if (new_region_name != it->second)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (new_region_name.empty())
|
||||||
|
{
|
||||||
|
new_region_name = "merged_reg_" + std::to_string(created_region_names.size());
|
||||||
|
created_region_names.push_back(new_region_name);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (auto *current_array : by_new_array.second)
|
||||||
|
{
|
||||||
|
auto current_array_region = getNonDefaultRegion(current_array);
|
||||||
|
new_region_mapping[current_array_region] = new_region_name;
|
||||||
|
}
|
||||||
|
|
||||||
|
arrays_new_region_mapping[by_new_array.first] = new_region_name;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!checkSimilarTemplates(regions, new_region_mapping))
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
unordered_map<FuncInfo *, unordered_map<string, SgSymbol *>> inserted_arrays;
|
||||||
|
|
||||||
|
for (const auto &by_dest_array : arrays_to_merge)
|
||||||
|
{
|
||||||
|
const auto ©_arrays = by_dest_array.second;
|
||||||
|
|
||||||
|
if (copy_arrays.empty())
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
auto *first_element = *copy_arrays.begin();
|
||||||
|
auto first_elem_rules_it = array_alignment.find(first_element);
|
||||||
|
|
||||||
|
if (first_elem_rules_it == array_alignment.end())
|
||||||
|
continue;
|
||||||
|
|
||||||
|
const auto &first_elem_rules = first_elem_rules_it->second;
|
||||||
|
|
||||||
|
for (auto *array_to_merge : copy_arrays)
|
||||||
|
{
|
||||||
|
auto array_rules_it = array_alignment.find(array_to_merge);
|
||||||
|
|
||||||
|
if (array_rules_it == array_alignment.end())
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
const auto &array_rules = array_rules_it->second;
|
||||||
|
|
||||||
|
if (!hasSameSizes(array_to_merge, first_element) || !hasSameAlignment(first_elem_rules, array_rules))
|
||||||
|
{
|
||||||
|
__spf_print(1, "Arrays %s and %s has different sizes or align rules\n",
|
||||||
|
array_to_merge->GetName().c_str(),
|
||||||
|
first_element->GetName().c_str());
|
||||||
|
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
__spf_print(1, "merge into %s (%s):\n", by_dest_array.first.c_str(), arrays_new_region_mapping[by_dest_array.first].c_str());
|
||||||
|
for (auto *array_to_merge : copy_arrays)
|
||||||
|
__spf_print(1, "%s\n", array_to_merge->GetName().c_str());
|
||||||
|
|
||||||
|
auto created_array_info = createNewArray(first_element, by_dest_array.first, allFuncInfo, inserted_arrays);
|
||||||
|
|
||||||
|
unordered_set<string> arrays_to_replace;
|
||||||
|
for (auto *array_to_merge : copy_arrays)
|
||||||
|
arrays_to_replace.insert(array_to_merge->GetShortName());
|
||||||
|
|
||||||
|
for (const auto &by_file : allFuncInfo)
|
||||||
|
{
|
||||||
|
if (SgFile::switchToFile(by_file.first) == -1)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
for (auto *func_info : by_file.second)
|
||||||
|
{
|
||||||
|
SgSymbol *func_symbol_hint = nullptr;
|
||||||
|
SgStatement *st = func_info->funcPointer;
|
||||||
|
|
||||||
|
auto *func_end = st->lastNodeOfStmt();
|
||||||
|
|
||||||
|
st = st->lexNext();
|
||||||
|
|
||||||
|
while (st && !isSgExecutableStatement(st) && st != func_end)
|
||||||
|
st = st->lexNext();
|
||||||
|
|
||||||
|
while (st && st != func_end)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < 3; i++)
|
||||||
|
{
|
||||||
|
replaceArrayRec(
|
||||||
|
st->expr(i),
|
||||||
|
arrays_to_replace,
|
||||||
|
&func_symbol_hint,
|
||||||
|
created_array_info,
|
||||||
|
first_element,
|
||||||
|
func_info,
|
||||||
|
inserted_arrays);
|
||||||
|
}
|
||||||
|
|
||||||
|
replaceRegion(st, new_region_mapping);
|
||||||
|
|
||||||
|
st = st->lexNext();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
8
src/ParallelizationRegions/parse_merge_dirs.h
Normal file
8
src/ParallelizationRegions/parse_merge_dirs.h
Normal file
@@ -0,0 +1,8 @@
|
|||||||
|
#include "../GraphCall/graph_calls.h"
|
||||||
|
#include "ParRegions.h"
|
||||||
|
|
||||||
|
#include <string>
|
||||||
|
#include <vector>
|
||||||
|
#include <map>
|
||||||
|
|
||||||
|
void mergeCopyArrays(std::vector<ParallelRegion*> ®ions, const std::map<std::string, std::vector<FuncInfo*>> &allFuncInfo);
|
||||||
@@ -33,6 +33,7 @@ using std::set;
|
|||||||
using std::ofstream;
|
using std::ofstream;
|
||||||
using std::pair;
|
using std::pair;
|
||||||
using std::tuple;
|
using std::tuple;
|
||||||
|
using SAPFOR::CFG_Settings;
|
||||||
|
|
||||||
using json = nlohmann::json;
|
using json = nlohmann::json;
|
||||||
|
|
||||||
@@ -507,7 +508,8 @@ static void parallelDir(const map<DIST::Array*, int>& byPos, SgExpression* spec,
|
|||||||
if (currF == NULL)
|
if (currF == NULL)
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
auto cfg = buildCFGforCurrentFunc(func, SAPFOR::CFG_Settings(true, false, false, true, false, false, true), commonBlocks, allFuncInfo);
|
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop, CFG_Settings::CFG_withSPF, CFG_Settings::CFG_withDominators });
|
||||||
|
auto cfg = buildCFGforCurrentFunc(func, settings, commonBlocks, allFuncInfo);
|
||||||
//TODO IP analysis
|
//TODO IP analysis
|
||||||
|
|
||||||
unsigned countOfAccess = 0;
|
unsigned countOfAccess = 0;
|
||||||
|
|||||||
@@ -23,6 +23,7 @@
|
|||||||
#include "ParallelizationRegions/ParRegions_func.h"
|
#include "ParallelizationRegions/ParRegions_func.h"
|
||||||
#include "ParallelizationRegions/resolve_par_reg_conflicts.h"
|
#include "ParallelizationRegions/resolve_par_reg_conflicts.h"
|
||||||
#include "ParallelizationRegions/expand_extract_reg.h"
|
#include "ParallelizationRegions/expand_extract_reg.h"
|
||||||
|
#include "ParallelizationRegions/parse_merge_dirs.h"
|
||||||
|
|
||||||
#include "Distribution/Distribution.h"
|
#include "Distribution/Distribution.h"
|
||||||
#include "Distribution/GraphCSR.h"
|
#include "Distribution/GraphCSR.h"
|
||||||
@@ -1893,7 +1894,7 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
findParameters(parametersOfProject, fullIR, declaredArrays);
|
findParameters(parametersOfProject, fullIR, declaredArrays);
|
||||||
else if (curr_regime == BUILD_IR)
|
else if (curr_regime == BUILD_IR)
|
||||||
{
|
{
|
||||||
auto CFG_forFile = buildCFG(commonBlocks, allFuncInfo_IR, SAPFOR::CFG_Settings(0));
|
auto CFG_forFile = buildCFG(commonBlocks, allFuncInfo_IR, SAPFOR::CFG_Settings());
|
||||||
for (auto& byFunc : CFG_forFile)
|
for (auto& byFunc : CFG_forFile)
|
||||||
fullIR[byFunc.first].insert(fullIR[byFunc.first].end(), byFunc.second.begin(), byFunc.second.end());
|
fullIR[byFunc.first].insert(fullIR[byFunc.first].end(), byFunc.second.begin(), byFunc.second.end());
|
||||||
|
|
||||||
@@ -1922,6 +1923,10 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
transformAssumedSizeParameters(allFuncInfo);
|
transformAssumedSizeParameters(allFuncInfo);
|
||||||
else if (curr_regime == FIND_PRIVATE_ARRAYS_ANALYSIS)
|
else if (curr_regime == FIND_PRIVATE_ARRAYS_ANALYSIS)
|
||||||
FindPrivateArrays(loopGraph, fullIR, insertedPrivates);
|
FindPrivateArrays(loopGraph, fullIR, insertedPrivates);
|
||||||
|
else if (curr_regime == MERGE_COPY_ARRAYS)
|
||||||
|
{
|
||||||
|
mergeCopyArrays(parallelRegions, allFuncInfo);
|
||||||
|
}
|
||||||
|
|
||||||
else if (curr_regime == ARRAY_PROPAGATION)
|
else if (curr_regime == ARRAY_PROPAGATION)
|
||||||
ArrayConstantPropagation(project);
|
ArrayConstantPropagation(project);
|
||||||
@@ -2379,6 +2384,7 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
|||||||
case FIX_COMMON_BLOCKS:
|
case FIX_COMMON_BLOCKS:
|
||||||
case TEST_PASS:
|
case TEST_PASS:
|
||||||
case SET_IMPLICIT_NONE:
|
case SET_IMPLICIT_NONE:
|
||||||
|
case MERGE_COPY_ARRAYS:
|
||||||
runAnalysis(*project, curr_regime, false);
|
runAnalysis(*project, curr_regime, false);
|
||||||
case SUBST_EXPR_RD_AND_UNPARSE:
|
case SUBST_EXPR_RD_AND_UNPARSE:
|
||||||
case SUBST_EXPR_AND_UNPARSE:
|
case SUBST_EXPR_AND_UNPARSE:
|
||||||
@@ -2524,8 +2530,8 @@ int main(int argc, char **argv)
|
|||||||
out_free_form = 1;
|
out_free_form = 1;
|
||||||
out_line_unlimit = 1;
|
out_line_unlimit = 1;
|
||||||
}
|
}
|
||||||
else if (string(curr_arg) == "-sh")
|
/*else if (string(curr_arg) == "-sh")
|
||||||
staticShadowAnalysis = 1;
|
staticShadowAnalysis = 1;*/
|
||||||
else if (string(curr_arg) == "-shWidth")
|
else if (string(curr_arg) == "-shWidth")
|
||||||
{
|
{
|
||||||
i++;
|
i++;
|
||||||
|
|||||||
@@ -88,6 +88,8 @@ enum passes {
|
|||||||
REMOVE_DVM_INTERVALS,
|
REMOVE_DVM_INTERVALS,
|
||||||
VERIFY_DVM_DIRS,
|
VERIFY_DVM_DIRS,
|
||||||
|
|
||||||
|
MERGE_COPY_ARRAYS,
|
||||||
|
|
||||||
REMOVE_DIST_ARRAYS_FROM_IO,
|
REMOVE_DIST_ARRAYS_FROM_IO,
|
||||||
|
|
||||||
SUBST_EXPR,
|
SUBST_EXPR,
|
||||||
@@ -273,6 +275,7 @@ static void setPassValues()
|
|||||||
passNames[VERIFY_DVM_DIRS] = "VERIFY_DVM_DIRS";
|
passNames[VERIFY_DVM_DIRS] = "VERIFY_DVM_DIRS";
|
||||||
passNames[REMOVE_DVM_DIRS_TO_COMMENTS] = "REMOVE_DVM_DIRS_TO_COMMENTS";
|
passNames[REMOVE_DVM_DIRS_TO_COMMENTS] = "REMOVE_DVM_DIRS_TO_COMMENTS";
|
||||||
passNames[REMOVE_SPF_DIRS] = "REMOVE_SPF_DIRS";
|
passNames[REMOVE_SPF_DIRS] = "REMOVE_SPF_DIRS";
|
||||||
|
passNames[MERGE_COPY_ARRAYS] = "MERGE_COPY_ARRAYS";
|
||||||
passNames[REMOVE_DIST_ARRAYS_FROM_IO] = "REMOVE_DIST_ARRAYS_FROM_IO";
|
passNames[REMOVE_DIST_ARRAYS_FROM_IO] = "REMOVE_DIST_ARRAYS_FROM_IO";
|
||||||
passNames[SUBST_EXPR] = "SUBST_EXPR";
|
passNames[SUBST_EXPR] = "SUBST_EXPR";
|
||||||
passNames[SUBST_EXPR_RD] = "SUBST_EXPR_RD";
|
passNames[SUBST_EXPR_RD] = "SUBST_EXPR_RD";
|
||||||
|
|||||||
@@ -19,7 +19,7 @@
|
|||||||
extern std::map<std::string, std::string> shortFileNames;
|
extern std::map<std::string, std::string> shortFileNames;
|
||||||
static int activeState = 0;
|
static int activeState = 0;
|
||||||
|
|
||||||
int staticShadowAnalysis = 0;
|
int staticShadowAnalysis = 1;
|
||||||
int staticPrivateAnalysis = 0;
|
int staticPrivateAnalysis = 0;
|
||||||
int keepDvmDirectives = 0;
|
int keepDvmDirectives = 0;
|
||||||
int keepFiles = 0;
|
int keepFiles = 0;
|
||||||
|
|||||||
@@ -12,6 +12,7 @@ using std::map;
|
|||||||
using std::string;
|
using std::string;
|
||||||
using std::vector;
|
using std::vector;
|
||||||
using std::set;
|
using std::set;
|
||||||
|
using SAPFOR::CFG_Settings;
|
||||||
|
|
||||||
using std::remove_if;
|
using std::remove_if;
|
||||||
|
|
||||||
@@ -424,7 +425,8 @@ int removeDeadCode(SgStatement* func,
|
|||||||
if (intervalDelEnd->lineNumber() < prog->lineNumber() || intervalDelEnd->lineNumber() > prog->lastNodeOfStmt()->lineNumber())
|
if (intervalDelEnd->lineNumber() < prog->lineNumber() || intervalDelEnd->lineNumber() > prog->lastNodeOfStmt()->lineNumber())
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
auto cfg = buildCFGforCurrentFunc(func, SAPFOR::CFG_Settings(true, false, false, false, false, false, false), commonBlocks, allFuncs);
|
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop });
|
||||||
|
auto cfg = buildCFGforCurrentFunc(func, settings, commonBlocks, allFuncs);
|
||||||
|
|
||||||
if(cfg.size() != 1)
|
if(cfg.size() != 1)
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|||||||
@@ -18,69 +18,66 @@ using std::tuple;
|
|||||||
|
|
||||||
/// main function:
|
/// main function:
|
||||||
// renew unions for all common blocks in the file
|
// renew unions for all common blocks in the file
|
||||||
static void BuildNewCommDecls(SgFile* file, const map<string, CommonBlock*> allCommonBlocks,
|
//void BuildNewCommDecls
|
||||||
map<string, deque<CommConstraint>>& newCommonDecls, map<string, map<string, deque<CommConstraint>>>& commDecls,
|
|
||||||
set<string>& badCommon, map<string, set<string>>& notUsedVars, vector<SgStatement*>& programUnits);
|
|
||||||
|
|
||||||
// get names of variables and array elements, which were referenced in programm unit
|
// get names of variables and array elements, which were referenced in programm unit
|
||||||
static set<string> getUses(SgStatement* firstSt, const set<string>& commonVarNames);
|
//set<string> getUses
|
||||||
static void getUsesFromExpr(SgExpression* expr, const set<string>& commonVarNames, set<string>& used);
|
//void getUsesFromExpr
|
||||||
|
|
||||||
// splits arrays into elements and replaces not used vars with empty constraints
|
// splits arrays into elements and replaces not used vars with empty constraints
|
||||||
static bool splitType(deque<CommConstraint>& d, bool check_use, const set<string>& namesOfUsedVars);
|
//bool splitType
|
||||||
|
|
||||||
// create constraits set
|
// create constraits set
|
||||||
static deque<CommConstraint> makeConstraints(deque<CommConstraint>& constraints, const set<string>& namesOfUsedVars, set<string>& notUsedVars);
|
//deque<CommConstraint> makeConstraints
|
||||||
|
|
||||||
// build union
|
// build union
|
||||||
static bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint> B, const set<string>& namesOfUsedVars, pair<CommConstraint, CommConstraint>& problemConstraints);
|
//bool buildConstraintsUnion
|
||||||
static bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstraint>& B, deque<CommConstraint>& newU, pair<CommConstraint, CommConstraint>& problemConstraints);
|
//bool docheckUnequalConstraints
|
||||||
static bool check(deque<CommConstraint>& A, deque<CommConstraint>& B, pair<CommConstraint, CommConstraint>& problemConstraints);
|
//bool check
|
||||||
|
|
||||||
/// small help functions:
|
/// small help functions:
|
||||||
static string getParentName(const string& name);
|
//string getParentName
|
||||||
static bool equalDims(const CommConstraint& a, const CommConstraint& b);
|
//bool equalDims
|
||||||
static bool equalConstraints(const CommConstraint& a, const CommConstraint& b);
|
//bool equalConstraints
|
||||||
static void addElem(deque<CommConstraint>& comm, const CommConstraint& elem);
|
//void addElem
|
||||||
//////
|
|
||||||
|
|
||||||
// change names of variables in 'constraints'
|
// change names of variables in 'constraints'
|
||||||
static void fixNames(deque<CommConstraint>& constraints, const string& commName);
|
//void fixNames
|
||||||
|
|
||||||
////// step2: transformation
|
////// step2: transformation
|
||||||
|
|
||||||
/// main function
|
/// main function
|
||||||
// peform transformation on every program unit in the file
|
// peform transformation on every program unit in the file
|
||||||
static void fixFunctions(SgFile* file, vector<SgStatement*> programUnits, map<string, deque<CommConstraint>>& newCommonDecls,
|
//void fixFunctions
|
||||||
map<string, map<string, deque<CommConstraint>>>& commDecls, const set<string>& badCommon, map<string, set<string>>& notUsedVars);
|
|
||||||
|
|
||||||
// get pairs of names (namesOldToNew) for renaming
|
// get pairs of names (namesOldToNew) for renaming
|
||||||
static bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint> oldDecl, map<string, string>& namesOldToNew);
|
//bool getNamesOldToNew
|
||||||
|
|
||||||
// create new symbols for new variables in new common declaration (constraints)
|
// create new symbols for new variables in new common declaration (constraints)
|
||||||
static void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* file, SgStatement* func, string commName,
|
//void makeCommVarSymbs
|
||||||
map<string, SgSymbol*>& symbs, vector<SgSymbol*>& needNewDecl);
|
|
||||||
// delete from program unit all references to names in commVarNames
|
// delete from program unit all references to names in commVarNames
|
||||||
static void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames);
|
//void deleteOldVars
|
||||||
|
|
||||||
// calls fixExpression for each statement, replaces names in data statement
|
// calls fixExpression for each statement, replaces names in data statement
|
||||||
static void renameVariables(SgStatement* firstSt, const map<string, SgSymbol*>& newVarSymbs, const map<string, string>& namesOldToNew);
|
//void renameVariables
|
||||||
|
|
||||||
// replacing variables or array elements in expression expr if their names are in namesOldToNew
|
// replacing variables or array elements in expression expr if their names are in namesOldToNew
|
||||||
static SgExpression* fixExpression(SgExpression* expr, const map<string, SgSymbol*>& newSymbs, const map<string, string>& namesOldToNew);
|
//SgExpression* fixExpression
|
||||||
|
|
||||||
// make new exprList exprssion for new declaration decl with symbols from newSymbs
|
// make new exprList exprssion for new declaration decl with symbols from newSymbs
|
||||||
static SgExpression* makeExprListForCommon(const deque<CommConstraint>& decl, const map<string, SgSymbol*>& newSymbs,
|
//SgExpression* makeExprListForCommon
|
||||||
SgFile* file, SgStatement* firstSt);
|
|
||||||
// replace old common declarations with new ones
|
// replace old common declarations with new ones
|
||||||
static void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& commListExprs);
|
//void rewriteCommon
|
||||||
|
|
||||||
/// help functions:
|
/// help functions:
|
||||||
static SgExpression* makeIdxFromStr(const string& str);
|
//SgExpression* makeIdxFromStr(const string& str);
|
||||||
|
|
||||||
// make new expression of array element
|
// make new expression of array element
|
||||||
static SgExpression* newArrElemExpr(const string& newName, const map<string, SgSymbol*>& newSymbs);
|
//SgExpression* newArrElemExpr
|
||||||
static bool variablePositionComp(const Variable* lhs, const Variable* rhs);
|
//bool variablePositionComp
|
||||||
//////
|
//////
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
CommConstraint::CommConstraint(const Variable* var, bool u, const string& funcName, const string& fileName)
|
CommConstraint::CommConstraint(const Variable* var, bool u, const string& funcName, const string& fileName)
|
||||||
{
|
{
|
||||||
used = u;
|
used = u;
|
||||||
@@ -125,7 +122,6 @@ CommConstraint::CommConstraint(const Variable* var, bool u, const string& funcNa
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
CommConstraint::CommConstraint(const string& name, SgType* t, bool u) : used(u), type(t), identifier(name)
|
CommConstraint::CommConstraint(const string& name, SgType* t, bool u) : used(u), type(t), identifier(name)
|
||||||
{
|
{
|
||||||
typeVariant = type->variant();
|
typeVariant = type->variant();
|
||||||
@@ -139,8 +135,7 @@ CommConstraint::CommConstraint(const string& name, SgType* t, bool u, vector<Dec
|
|||||||
size = getSizeOfType(type);
|
size = getSizeOfType(type);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static string getParentName(const string& name)
|
||||||
string getParentName(const string& name)
|
|
||||||
{
|
{
|
||||||
size_t len = name.find("%");
|
size_t len = name.find("%");
|
||||||
size_t posB = name.find("(");
|
size_t posB = name.find("(");
|
||||||
@@ -154,8 +149,7 @@ string getParentName(const string& name)
|
|||||||
return name.substr(0, len);
|
return name.substr(0, len);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void getUsesFromExpr(SgExpression* expr, const set<string>& commonVarNames, set<string>& used)
|
||||||
void getUsesFromExpr(SgExpression* expr, const set<string>& commonVarNames, set<string>& used)
|
|
||||||
{
|
{
|
||||||
if (expr == NULL)
|
if (expr == NULL)
|
||||||
return;
|
return;
|
||||||
@@ -194,8 +188,7 @@ void getUsesFromExpr(SgExpression* expr, const set<string>& commonVarNames, set<
|
|||||||
getUsesFromExpr(expr->rhs(), commonVarNames, used);
|
getUsesFromExpr(expr->rhs(), commonVarNames, used);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static set<string> getUses(SgStatement* firstSt, const set<string>& commonVarNames)
|
||||||
set<string> getUses(SgStatement* firstSt, const set<string>& commonVarNames)
|
|
||||||
{
|
{
|
||||||
set<string> used;
|
set<string> used;
|
||||||
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
||||||
@@ -212,8 +205,7 @@ set<string> getUses(SgStatement* firstSt, const set<string>& commonVarNames)
|
|||||||
return used;
|
return used;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static bool equalDims(const CommConstraint& a, const CommConstraint& b)
|
||||||
bool equalDims(const CommConstraint& a, const CommConstraint& b)
|
|
||||||
{
|
{
|
||||||
const vector<pair<int, int>>& adim = a.arrayInfo->GetSizes();
|
const vector<pair<int, int>>& adim = a.arrayInfo->GetSizes();
|
||||||
const vector<pair<int, int>>& bdim = b.arrayInfo->GetSizes();
|
const vector<pair<int, int>>& bdim = b.arrayInfo->GetSizes();
|
||||||
@@ -224,11 +216,12 @@ bool equalDims(const CommConstraint& a, const CommConstraint& b)
|
|||||||
if (adim[i].second - adim[i].first != bdim[i].second - bdim[i].first)
|
if (adim[i].second - adim[i].first != bdim[i].second - bdim[i].first)
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
// TODO: add attributes to CommConstraints, check if a and b have equal attributes
|
// TODO: add attributes to CommConstraints, check if a and b have equal attributes
|
||||||
bool equalConstraints(const CommConstraint& a, const CommConstraint& b)
|
static bool equalConstraints(const CommConstraint& a, const CommConstraint& b)
|
||||||
{
|
{
|
||||||
if ((a.arrayInfo != NULL && b.arrayInfo == NULL) || ((a.arrayInfo == NULL && b.arrayInfo != NULL)))
|
if ((a.arrayInfo != NULL && b.arrayInfo == NULL) || ((a.arrayInfo == NULL && b.arrayInfo != NULL)))
|
||||||
return false;
|
return false;
|
||||||
@@ -239,8 +232,7 @@ bool equalConstraints(const CommConstraint& a, const CommConstraint& b)
|
|||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void addElem(deque<CommConstraint>& comm, const CommConstraint& elem)
|
||||||
void addElem(deque<CommConstraint>& comm, const CommConstraint& elem)
|
|
||||||
{
|
{
|
||||||
if (elem.typeVariant == 0 && !comm.empty() && comm.back().typeVariant == 0)
|
if (elem.typeVariant == 0 && !comm.empty() && comm.back().typeVariant == 0)
|
||||||
comm.back().size += elem.size;
|
comm.back().size += elem.size;
|
||||||
@@ -248,9 +240,8 @@ void addElem(deque<CommConstraint>& comm, const CommConstraint& elem)
|
|||||||
comm.push_back(elem);
|
comm.push_back(elem);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
// TODO: check attributes: do not split arrays with pointer or target attributes if check_use == true
|
// TODO: check attributes: do not split arrays with pointer or target attributes if check_use == true
|
||||||
bool splitType(deque<CommConstraint>& d, bool check_use, const set<string>& namesOfUsedVars = {})
|
static bool splitType(deque<CommConstraint>& d, bool check_use, const set<string>& namesOfUsedVars = {})
|
||||||
{
|
{
|
||||||
CommConstraint var = d.front();
|
CommConstraint var = d.front();
|
||||||
string name = var.identifier;
|
string name = var.identifier;
|
||||||
@@ -298,8 +289,7 @@ bool splitType(deque<CommConstraint>& d, bool check_use, const set<string>& name
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static deque<CommConstraint> makeConstraints(deque<CommConstraint>& constraints, const set<string>& namesOfUsedVars, set<string>& notUsedVars)
|
||||||
deque<CommConstraint> makeConstraints(deque<CommConstraint>& constraints, const set<string>& namesOfUsedVars, set<string>& notUsedVars)
|
|
||||||
{
|
{
|
||||||
deque<CommConstraint> res;
|
deque<CommConstraint> res;
|
||||||
while (!constraints.empty())
|
while (!constraints.empty())
|
||||||
@@ -316,8 +306,7 @@ deque<CommConstraint> makeConstraints(deque<CommConstraint>& constraints, const
|
|||||||
return res;
|
return res;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static bool check(deque<CommConstraint>& A, deque<CommConstraint>& B, pair<CommConstraint, CommConstraint>& problemConstraints)
|
||||||
bool check(deque<CommConstraint>& A, deque<CommConstraint>& B, pair<CommConstraint, CommConstraint>& problemConstraints)
|
|
||||||
{
|
{
|
||||||
while (!A.empty() && !B.empty())
|
while (!A.empty() && !B.empty())
|
||||||
{
|
{
|
||||||
@@ -356,8 +345,8 @@ bool check(deque<CommConstraint>& A, deque<CommConstraint>& B, pair<CommConstrai
|
|||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstraint>& B, deque<CommConstraint>& newU,
|
||||||
bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstraint>& B, deque<CommConstraint>& newU, pair<CommConstraint, CommConstraint>& problemConstraints)
|
pair<CommConstraint, CommConstraint>& problemConstraints)
|
||||||
{
|
{
|
||||||
if (U.front().typeVariant == 0)
|
if (U.front().typeVariant == 0)
|
||||||
{
|
{
|
||||||
@@ -380,8 +369,8 @@ bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstraint>&
|
|||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint> B,
|
||||||
bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint> B, const set<string>& namesOfUsedVars, pair<CommConstraint, CommConstraint>& problemConstraints)
|
const set<string>& namesOfUsedVars, pair<CommConstraint, CommConstraint>& problemConstraints)
|
||||||
{
|
{
|
||||||
deque<CommConstraint> newU;
|
deque<CommConstraint> newU;
|
||||||
while (!U.empty() && !B.empty())
|
while (!U.empty() && !B.empty())
|
||||||
@@ -436,8 +425,8 @@ bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint> B, co
|
|||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
//TODO: check this: newDecl and oldDecl => do these variables need references?
|
||||||
bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint> oldDecl, map<string, string>& namesOldToNew)
|
static bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint> oldDecl, map<string, string>& namesOldToNew)
|
||||||
{
|
{
|
||||||
bool needChange = false;
|
bool needChange = false;
|
||||||
map<string, string> rename;
|
map<string, string> rename;
|
||||||
@@ -502,16 +491,18 @@ bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint> oldDe
|
|||||||
newDecl.pop_front();
|
newDecl.pop_front();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (!oldDecl.empty() || !newDecl.empty())
|
if (!oldDecl.empty() || !newDecl.empty())
|
||||||
needChange = true;
|
needChange = true;
|
||||||
|
|
||||||
if (needChange)
|
if (needChange)
|
||||||
namesOldToNew.insert(rename.begin(), rename.end());
|
namesOldToNew.insert(rename.begin(), rename.end());
|
||||||
|
|
||||||
return needChange;
|
return needChange;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* file, SgStatement* func, const string& commName,
|
||||||
void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* file, SgStatement* func, string commName,
|
map<string, SgSymbol*>& symbs, vector<SgSymbol*>& needNewDecl)
|
||||||
map<string, SgSymbol*>& symbs, vector<SgSymbol*>& needNewDecl)
|
|
||||||
{
|
{
|
||||||
for (const CommConstraint& var : constraints)
|
for (const CommConstraint& var : constraints)
|
||||||
{
|
{
|
||||||
@@ -524,8 +515,7 @@ void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* file, Sg
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames)
|
||||||
void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames)
|
|
||||||
{
|
{
|
||||||
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
||||||
vector<SgStatement*> stmtsToDelete;
|
vector<SgStatement*> stmtsToDelete;
|
||||||
@@ -571,12 +561,12 @@ void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames)
|
|||||||
}
|
}
|
||||||
// TODO: delete common variables form attributes statements (like DIM_STAT)
|
// TODO: delete common variables form attributes statements (like DIM_STAT)
|
||||||
}
|
}
|
||||||
|
|
||||||
for (SgStatement* st : stmtsToDelete)
|
for (SgStatement* st : stmtsToDelete)
|
||||||
st->deleteStmt();
|
st->deleteStmt();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static SgExpression* makeIdxFromStr(const string& str)
|
||||||
SgExpression* makeIdxFromStr(const string& str)
|
|
||||||
{
|
{
|
||||||
vector<SgExpression*> items;
|
vector<SgExpression*> items;
|
||||||
int num = 0;
|
int num = 0;
|
||||||
@@ -591,13 +581,13 @@ SgExpression* makeIdxFromStr(const string& str)
|
|||||||
num = 0;
|
num = 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
reverse(items.begin(), items.end());
|
reverse(items.begin(), items.end());
|
||||||
SgExpression* exprList = makeExprList(items, false);
|
SgExpression* exprList = makeExprList(items, false);
|
||||||
return exprList;
|
return exprList;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static SgExpression* newArrElemExpr(const string& newName, const map<string, SgSymbol*>& newSymbs)
|
||||||
SgExpression* newArrElemExpr(const string& newName, const map<string, SgSymbol*>& newSymbs)
|
|
||||||
{
|
{
|
||||||
size_t pos = newName.find('(');
|
size_t pos = newName.find('(');
|
||||||
SgExpression* newExpr = new SgArrayRefExp(*newSymbs.at(newName.substr(0, pos)));
|
SgExpression* newExpr = new SgArrayRefExp(*newSymbs.at(newName.substr(0, pos)));
|
||||||
@@ -605,11 +595,11 @@ SgExpression* newArrElemExpr(const string& newName, const map<string, SgSymbol*>
|
|||||||
return newExpr;
|
return newExpr;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static SgExpression* fixExpression(SgExpression* expr, const map<string, SgSymbol*>& newSymbs, const map<string, string>& namesOldToNew)
|
||||||
SgExpression* fixExpression(SgExpression* expr, const map<string, SgSymbol*>& newSymbs, const map<string, string>& namesOldToNew)
|
|
||||||
{
|
{
|
||||||
if (expr == NULL)
|
if (expr == NULL)
|
||||||
return NULL;
|
return NULL;
|
||||||
|
|
||||||
if (expr->variant() == VAR_REF || expr->variant() == ARRAY_REF)
|
if (expr->variant() == VAR_REF || expr->variant() == ARRAY_REF)
|
||||||
{
|
{
|
||||||
string name = expr->symbol()->identifier();
|
string name = expr->symbol()->identifier();
|
||||||
@@ -645,17 +635,18 @@ SgExpression* fixExpression(SgExpression* expr, const map<string, SgSymbol*>& ne
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
SgExpression* lhs = fixExpression(expr->lhs(), newSymbs, namesOldToNew);
|
SgExpression* lhs = fixExpression(expr->lhs(), newSymbs, namesOldToNew);
|
||||||
if (lhs != NULL)
|
if (lhs != NULL)
|
||||||
expr->setLhs(lhs);
|
expr->setLhs(lhs);
|
||||||
|
|
||||||
SgExpression* rhs = fixExpression(expr->rhs(), newSymbs, namesOldToNew);
|
SgExpression* rhs = fixExpression(expr->rhs(), newSymbs, namesOldToNew);
|
||||||
if (rhs != NULL)
|
if (rhs != NULL)
|
||||||
expr->setRhs(rhs);
|
expr->setRhs(rhs);
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void renameVariables(SgStatement* firstSt, const map<string, SgSymbol*>& newVarSymbs, const map<string, string>& namesOldToNew)
|
||||||
void renameVariables(SgStatement* firstSt, const map<string, SgSymbol*>& newVarSymbs, const map<string, string>& namesOldToNew)
|
|
||||||
{
|
{
|
||||||
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
||||||
for (SgStatement* curSt = firstSt; curSt != NULL && curSt != lastSt; curSt = curSt->lexNext())
|
for (SgStatement* curSt = firstSt; curSt != NULL && curSt != lastSt; curSt = curSt->lexNext())
|
||||||
@@ -703,8 +694,7 @@ void renameVariables(SgStatement* firstSt, const map<string, SgSymbol*>& newVarS
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static SgExpression* makeExprListForCommon(const deque<CommConstraint>& decl, const map<string, SgSymbol*>& newSymbs,
|
||||||
SgExpression* makeExprListForCommon(const deque<CommConstraint>& decl, const map<string, SgSymbol*>& newSymbs,
|
|
||||||
SgFile* file, SgStatement* firstSt)
|
SgFile* file, SgStatement* firstSt)
|
||||||
{
|
{
|
||||||
vector<SgExpression*> items;
|
vector<SgExpression*> items;
|
||||||
@@ -738,8 +728,7 @@ SgExpression* makeExprListForCommon(const deque<CommConstraint>& decl, const map
|
|||||||
return exprList;
|
return exprList;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& commListExprs)
|
||||||
void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& commListExprs)
|
|
||||||
{
|
{
|
||||||
vector<SgStatement*> commonStmtsToDelete;
|
vector<SgStatement*> commonStmtsToDelete;
|
||||||
for (SgStatement* st = firstSt; st != firstSt->lastDeclaration()->lexNext(); st = st->lexNext())
|
for (SgStatement* st = firstSt; st != firstSt->lastDeclaration()->lexNext(); st = st->lexNext())
|
||||||
@@ -790,12 +779,12 @@ void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& commListExp
|
|||||||
commonStmtsToDelete.push_back(st);
|
commonStmtsToDelete.push_back(st);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
for (SgStatement* st : commonStmtsToDelete)
|
for (SgStatement* st : commonStmtsToDelete)
|
||||||
st->deleteStmt();
|
st->deleteStmt();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void fixNames(deque<CommConstraint>& constraints, const string& commName)
|
||||||
void fixNames(deque<CommConstraint>& constraints, const string& commName)
|
|
||||||
{
|
{
|
||||||
for (auto& var : constraints)
|
for (auto& var : constraints)
|
||||||
{
|
{
|
||||||
@@ -810,26 +799,26 @@ void fixNames(deque<CommConstraint>& constraints, const string& commName)
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static bool variablePositionComp(const Variable* lhs, const Variable* rhs)
|
||||||
bool variablePositionComp(const Variable* lhs, const Variable* rhs)
|
|
||||||
{
|
{
|
||||||
return lhs->getPosition() < rhs->getPosition();
|
return lhs->getPosition() < rhs->getPosition();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void fixFunctions(SgFile* file, const vector<SgStatement*>& programUnits, map<string, deque<CommConstraint>>& newCommonDecls,
|
||||||
void fixFunctions(SgFile* file, vector<SgStatement*> programUnits, map<string, deque<CommConstraint>>& newCommonDecls,
|
map<string, map<string, deque<CommConstraint>>>& commDecls, const set<string>& badCommon, map<string, set<string>>& notUsedVars)
|
||||||
map<string, map<string, deque<CommConstraint>>>& commDecls, const set<string>& badCommon, map<string, set<string>>& notUsedVars)
|
|
||||||
{
|
{
|
||||||
for (SgStatement* unitSt : programUnits)
|
for (SgStatement* unitSt : programUnits)
|
||||||
{
|
{
|
||||||
string funcName = unitSt->symbol()->identifier();
|
string funcName = unitSt->symbol()->identifier();
|
||||||
if (commDecls.find(funcName) == commDecls.end())
|
if (commDecls.find(funcName) == commDecls.end())
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
SgStatement* firstSt = unitSt;
|
SgStatement* firstSt = unitSt;
|
||||||
map<string, SgExpression*> commListExprs;
|
map<string, SgExpression*> commListExprs;
|
||||||
map<string, SgSymbol*> newVarSymbs; // new symbols for new variables
|
map<string, SgSymbol*> newVarSymbs; // new symbols for new variables
|
||||||
map<string, string> namesOldToNew; // for ranaming: old name -> new name
|
map<string, string> namesOldToNew; // for ranaming: old name -> new name
|
||||||
vector<SgSymbol*> needNewDecl;
|
vector<SgSymbol*> needNewDecl;
|
||||||
|
|
||||||
for (auto& common : commDecls[funcName])
|
for (auto& common : commDecls[funcName])
|
||||||
{
|
{
|
||||||
string commName = common.first;
|
string commName = common.first;
|
||||||
@@ -840,9 +829,11 @@ void fixFunctions(SgFile* file, vector<SgStatement*> programUnits, map<string, d
|
|||||||
bool needChange = getNamesOldToNew(newDecl, common.second, namesOldToNew);
|
bool needChange = getNamesOldToNew(newDecl, common.second, namesOldToNew);
|
||||||
if (!needChange)
|
if (!needChange)
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
makeCommVarSymbs(newDecl, file, firstSt, commName, newVarSymbs, needNewDecl);
|
makeCommVarSymbs(newDecl, file, firstSt, commName, newVarSymbs, needNewDecl);
|
||||||
commListExprs[commName] = makeExprListForCommon(newDecl, newVarSymbs, file, firstSt);
|
commListExprs[commName] = makeExprListForCommon(newDecl, newVarSymbs, file, firstSt);
|
||||||
}
|
}
|
||||||
|
|
||||||
if (!commListExprs.empty())
|
if (!commListExprs.empty())
|
||||||
{
|
{
|
||||||
for (const auto& item : commListExprs)
|
for (const auto& item : commListExprs)
|
||||||
@@ -856,10 +847,9 @@ void fixFunctions(SgFile* file, vector<SgStatement*> programUnits, map<string, d
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void buildNewCommDecls(SgFile* file, const map<string, CommonBlock*>& allCommonBlocks,
|
||||||
void BuildNewCommDecls(SgFile* file, const map<string, CommonBlock*> allCommonBlocks,
|
map<string, deque<CommConstraint>>& newCommonDecls, map<string, map<string, deque<CommConstraint>>>& commDecls,
|
||||||
map<string, deque<CommConstraint>>& newCommonDecls, map<string, map<string, deque<CommConstraint>>>& commDecls,
|
set<string>& badCommon, map<string, set<string>>& notUsedVars, vector<SgStatement*>& programUnits)
|
||||||
set<string>& badCommon, map<string, set<string>>& notUsedVars, vector<SgStatement*>& programUnits)
|
|
||||||
{
|
{
|
||||||
string fileName = file->filename();
|
string fileName = file->filename();
|
||||||
SgStatement* curSt = file->firstStatement();
|
SgStatement* curSt = file->firstStatement();
|
||||||
@@ -898,7 +888,8 @@ void BuildNewCommDecls(SgFile* file, const map<string, CommonBlock*> allCommonBl
|
|||||||
constraints.push_back(newConstr);
|
constraints.push_back(newConstr);
|
||||||
}
|
}
|
||||||
if (hasChar && hasNotChar) // TDOO: make proper warning message or separate such common blocks
|
if (hasChar && hasNotChar) // TDOO: make proper warning message or separate such common blocks
|
||||||
__spf_print(1, "common block '%s' ('%s':%d) contains variables of symbolic and numeric types. It is required to divide\n", commName.c_str(), fileName.c_str(), constraints.back().uses.back().lineNum);
|
__spf_print(1, "common block '%s' ('%s':%d) contains variables of symbolic and numeric types. It is required to divide\n",
|
||||||
|
commName.c_str(), fileName.c_str(), constraints.back().uses.back().getLineNum());
|
||||||
if (hasChar)
|
if (hasChar)
|
||||||
{
|
{
|
||||||
badCommon.insert(commName);
|
badCommon.insert(commName);
|
||||||
@@ -915,7 +906,7 @@ void BuildNewCommDecls(SgFile* file, const map<string, CommonBlock*> allCommonBl
|
|||||||
for (auto x : problemConstraints.first.uses) // TODO: make proper warning message
|
for (auto x : problemConstraints.first.uses) // TODO: make proper warning message
|
||||||
for (auto y : problemConstraints.second.uses)
|
for (auto y : problemConstraints.second.uses)
|
||||||
__spf_print(1, "variables '%s' and '%s' in one storage association (common block '%s') have different types (files - %s:%d and %s:%d)\n",
|
__spf_print(1, "variables '%s' and '%s' in one storage association (common block '%s') have different types (files - %s:%d and %s:%d)\n",
|
||||||
x.varName.c_str(), y.varName.c_str(), commName.c_str(), x.fileName.c_str(), x.lineNum, y.fileName.c_str(), y.lineNum);
|
x.getVarName(), y.getVarName(), commName.c_str(), x.getFileName(), x.getLineNum(), y.getFileName(), y.getLineNum());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
curSt = curSt->lastNodeOfStmt();
|
curSt = curSt->lastNodeOfStmt();
|
||||||
@@ -927,7 +918,7 @@ void BuildNewCommDecls(SgFile* file, const map<string, CommonBlock*> allCommonBl
|
|||||||
|
|
||||||
|
|
||||||
// main function
|
// main function
|
||||||
void fixCommonBlocks(const map<string, vector<FuncInfo*>> allFuncInfo, const map<string, CommonBlock*> allCommonBlocks, SgProject* project) // TODO: separate into 2 steps?
|
void fixCommonBlocks(const map<string, vector<FuncInfo*>>& allFuncInfo, const map<string, CommonBlock*>& allCommonBlocks, SgProject* project) // TODO: separate into 2 steps?
|
||||||
{
|
{
|
||||||
int filesNum = project->numberOfFiles();
|
int filesNum = project->numberOfFiles();
|
||||||
map<string, map<string, map<string, deque<CommConstraint>>>> commDecls; // file_name -> function_name -> common block name -> old declaration of common block
|
map<string, map<string, map<string, deque<CommConstraint>>>> commDecls; // file_name -> function_name -> common block name -> old declaration of common block
|
||||||
@@ -941,10 +932,12 @@ void fixCommonBlocks(const map<string, vector<FuncInfo*>> allFuncInfo, const map
|
|||||||
SgFile* file = &project->file(i);
|
SgFile* file = &project->file(i);
|
||||||
string fileName = file->filename();
|
string fileName = file->filename();
|
||||||
file->switchToFile(fileName);
|
file->switchToFile(fileName);
|
||||||
BuildNewCommDecls(file, allCommonBlocks, newCommonDecls, commDecls[fileName], badCommon, notUsedVars, programUnitsInFile[fileName]);
|
buildNewCommDecls(file, allCommonBlocks, newCommonDecls, commDecls[fileName], badCommon, notUsedVars, programUnitsInFile[fileName]);
|
||||||
}
|
}
|
||||||
|
|
||||||
for (auto& elem : newCommonDecls)
|
for (auto& elem : newCommonDecls)
|
||||||
fixNames(elem.second, elem.first);
|
fixNames(elem.second, elem.first);
|
||||||
|
|
||||||
for (int i = 0; i < filesNum; i++) // second step
|
for (int i = 0; i < filesNum; i++) // second step
|
||||||
{
|
{
|
||||||
SgFile* file = &project->file(i);
|
SgFile* file = &project->file(i);
|
||||||
|
|||||||
@@ -16,12 +16,18 @@
|
|||||||
|
|
||||||
struct DeclInfo // for error messages
|
struct DeclInfo // for error messages
|
||||||
{
|
{
|
||||||
|
private:
|
||||||
std::string varName;
|
std::string varName;
|
||||||
std::string fileName;
|
std::string fileName;
|
||||||
int lineNum;
|
int lineNum;
|
||||||
|
|
||||||
|
public:
|
||||||
DeclInfo() : varName(""), fileName(""), lineNum(0) {};
|
DeclInfo() : varName(""), fileName(""), lineNum(0) {};
|
||||||
DeclInfo(const std::string& vn, const std::string& fn, int ln) : varName(vn), fileName(fn), lineNum(ln) {};
|
DeclInfo(const std::string& vn, const std::string& fn, int ln) : varName(vn), fileName(fn), lineNum(ln) {};
|
||||||
|
|
||||||
|
const char* getVarName() const { return varName.c_str(); }
|
||||||
|
const char* getFileName() const { return fileName.c_str(); }
|
||||||
|
int getLineNum() const { return lineNum; }
|
||||||
};
|
};
|
||||||
|
|
||||||
struct CommConstraint // TODO: add variable attributes
|
struct CommConstraint // TODO: add variable attributes
|
||||||
@@ -42,4 +48,4 @@ struct CommConstraint // TODO: add variable attributes
|
|||||||
};
|
};
|
||||||
|
|
||||||
|
|
||||||
void fixCommonBlocks(const std::map<std::string, std::vector<FuncInfo*>> allFuncInfo, const std::map<std::string, CommonBlock*> allCommonBlocks, SgProject* project);
|
void fixCommonBlocks(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo, const std::map<std::string, CommonBlock*>& allCommonBlocks, SgProject* project);
|
||||||
@@ -19,6 +19,7 @@ using std::pair;
|
|||||||
using std::make_pair;
|
using std::make_pair;
|
||||||
using std::wstring;
|
using std::wstring;
|
||||||
using std::stack;
|
using std::stack;
|
||||||
|
using SAPFOR::CFG_Settings;
|
||||||
|
|
||||||
#define PRINT_SPLITTED_FRAGMENTS 0
|
#define PRINT_SPLITTED_FRAGMENTS 0
|
||||||
|
|
||||||
@@ -315,7 +316,7 @@ static map<SgStatement*, pair<set<SgStatement*>, set<SgStatement*>>>
|
|||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
map<SAPFOR::Argument*, set<int>> outForCurr;
|
map<SAPFOR::Argument*, set<int>> outForCurr;
|
||||||
buildGenKillForCFG(itCFG->second, funcByName, outForFunc, gen, kill, &genForIR, &killForIR, notInitedGlobals, SAPFOR::CFG_Settings(0));
|
buildGenKillForCFG(itCFG->second, funcByName, outForFunc, gen, kill, &genForIR, &killForIR, notInitedGlobals, SAPFOR::CFG_Settings());
|
||||||
|
|
||||||
if (outForFunc.count(byFunc))
|
if (outForFunc.count(byFunc))
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
@@ -1051,7 +1052,8 @@ int splitLoops(SgFile *file, vector<LoopGraph*> &loopGraphs, vector<Messages> &m
|
|||||||
checkNull(listExp, convertFileName(__FILE__).c_str(), __LINE__);
|
checkNull(listExp, convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
int deep = listExp->length();
|
int deep = listExp->length();
|
||||||
|
|
||||||
currIR = buildCFGforCurrentFunc(loop->loop, SAPFOR::CFG_Settings(true, true), commonBlocks, allFuncInfo);
|
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop, CFG_Settings::CFG_withRD, CFG_Settings::CFG_withCallFrom, CFG_Settings::CFG_withDominators });
|
||||||
|
currIR = buildCFGforCurrentFunc(loop->loop, settings, commonBlocks, allFuncInfo);
|
||||||
totalErr = splitLoop(loop, messages, deep, depInfoForLoopGraph);
|
totalErr = splitLoop(loop, messages, deep, depInfoForLoopGraph);
|
||||||
|
|
||||||
if (totalErr > 0)
|
if (totalErr > 0)
|
||||||
|
|||||||
@@ -13,6 +13,7 @@ using std::set;
|
|||||||
using std::string;
|
using std::string;
|
||||||
using std::vector;
|
using std::vector;
|
||||||
using std::wstring;
|
using std::wstring;
|
||||||
|
using SAPFOR::CFG_Settings;
|
||||||
|
|
||||||
using CFG_Type = map<FuncInfo*, vector<SAPFOR::BasicBlock*>>;
|
using CFG_Type = map<FuncInfo*, vector<SAPFOR::BasicBlock*>>;
|
||||||
using UsersDirectives = map<pair<string, int>, set<SgStatement*>>;
|
using UsersDirectives = map<pair<string, int>, set<SgStatement*>>;
|
||||||
@@ -2207,8 +2208,8 @@ static void removePrivateAnalyze(Context *ctx)
|
|||||||
makeDeclaration(ctx->loopStmt, vector<SgSymbol*> {receiverVar}, nullptr)
|
makeDeclaration(ctx->loopStmt, vector<SgSymbol*> {receiverVar}, nullptr)
|
||||||
));
|
));
|
||||||
|
|
||||||
CFG_Type CFG_ForFunc = buildCFGforCurrentFunc(ctx->loopStmt,
|
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop, CFG_Settings::CFG_withRD, CFG_Settings::CFG_withCallFrom, CFG_Settings::CFG_withDominators });
|
||||||
SAPFOR::CFG_Settings(true, true),
|
CFG_Type CFG_ForFunc = buildCFGforCurrentFunc(ctx->loopStmt, settings,
|
||||||
ctx->commonBlocks, ctx->allFuncInfo);
|
ctx->commonBlocks, ctx->allFuncInfo);
|
||||||
if (CFG_ForFunc.empty())
|
if (CFG_ForFunc.empty())
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|||||||
@@ -206,7 +206,9 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
Pass(DEF_USE_STAGE1) <= Pass(DEF_USE_STAGE2);
|
Pass(DEF_USE_STAGE1) <= Pass(DEF_USE_STAGE2);
|
||||||
|
|
||||||
list({ VERIFY_DVM_DIRS, PRIVATE_CALL_GRAPH_STAGE1, PRIVATE_CALL_GRAPH_STAGE2, MACRO_EXPANSION, CONVERT_ASSIGN_TO_LOOP, DEF_USE_STAGE1, DEF_USE_STAGE2, FILL_PARALLEL_REG_IR, VERIFY_COMMON, FILL_COMMON_BLOCKS, CALL_GRAPH_IR }) <= list({ SUBST_EXPR, SUBST_EXPR_RD, BUILD_IR });
|
list({ VERIFY_DVM_DIRS, VERIFY_COMMON, FILL_COMMON_BLOCKS, PRIVATE_CALL_GRAPH_STAGE1, PRIVATE_CALL_GRAPH_STAGE2, MACRO_EXPANSION, CONVERT_ASSIGN_TO_LOOP, DEF_USE_STAGE1, DEF_USE_STAGE2, FILL_PARALLEL_REG_IR, CALL_GRAPH_IR }) <= list({ SUBST_EXPR, SUBST_EXPR_RD, BUILD_IR });
|
||||||
|
|
||||||
|
Pass(VERIFY_COMMON) <= Pass(FILL_COMMON_BLOCKS);
|
||||||
|
|
||||||
Pass(BUILD_IR) <= Pass(SUBST_EXPR) <= Pass(SUBST_EXPR_AND_UNPARSE);
|
Pass(BUILD_IR) <= Pass(SUBST_EXPR) <= Pass(SUBST_EXPR_AND_UNPARSE);
|
||||||
|
|
||||||
@@ -217,7 +219,7 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
Pass(RESTORE_LOOP_FROM_ASSIGN) <= list({ SUBST_EXPR_AND_UNPARSE, SUBST_EXPR_RD_AND_UNPARSE });
|
Pass(RESTORE_LOOP_FROM_ASSIGN) <= list({ SUBST_EXPR_AND_UNPARSE, SUBST_EXPR_RD_AND_UNPARSE });
|
||||||
|
|
||||||
Pass(GET_ALL_ARRAY_DECL) <= list({ CALL_GRAPH_IR, INSERT_NO_DISTR_FLAGS_FROM_GUI });
|
Pass(FILL_COMMON_BLOCKS) <= Pass(GET_ALL_ARRAY_DECL) <= list({ CALL_GRAPH_IR, INSERT_NO_DISTR_FLAGS_FROM_GUI });
|
||||||
|
|
||||||
Pass(LOOP_GRAPH) <= Pass(PRIVATE_CALL_GRAPH_STAGE3) <= list(FIND_FUNC_TO_INCLUDE, PRIVATE_ANALYSIS_IR) <= list({ LOOP_ANALYZER_DATA_DIST_S0, LOOP_ANALYZER_DATA_DIST_S1, ONLY_ARRAY_GRAPH, LOOP_ANALYZER_ALIGNS });
|
Pass(LOOP_GRAPH) <= Pass(PRIVATE_CALL_GRAPH_STAGE3) <= list(FIND_FUNC_TO_INCLUDE, PRIVATE_ANALYSIS_IR) <= list({ LOOP_ANALYZER_DATA_DIST_S0, LOOP_ANALYZER_DATA_DIST_S1, ONLY_ARRAY_GRAPH, LOOP_ANALYZER_ALIGNS });
|
||||||
|
|
||||||
@@ -227,7 +229,7 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
list({ VERIFY_OPERATORS, VERIFY_ENDDO, VERIFY_INCLUDES, PREPROC_SPF, PREPROC_ALLOCATES, GET_ALL_ARRAY_DECL, GCOV_PARSER }) <= list({ CALL_GRAPH, MACRO_EXPANSION, DEF_USE_STAGE1 });
|
list({ VERIFY_OPERATORS, VERIFY_ENDDO, VERIFY_INCLUDES, PREPROC_SPF, PREPROC_ALLOCATES, GET_ALL_ARRAY_DECL, GCOV_PARSER }) <= list({ CALL_GRAPH, MACRO_EXPANSION, DEF_USE_STAGE1 });
|
||||||
|
|
||||||
list({ VERIFY_OPERATORS, VERIFY_ENDDO, VERIFY_INCLUDES, PREPROC_ALLOCATES, FILL_PARALLEL_REG_IR }) <= list({ GET_ALL_ARRAY_DECL, FILL_COMMON_BLOCKS, PARSE_OMP_DIRS }) <= Pass(PREPROC_SPF);
|
list({ VERIFY_OPERATORS, VERIFY_ENDDO, VERIFY_INCLUDES, PREPROC_ALLOCATES, FILL_PARALLEL_REG_IR }) <= list({ FILL_COMMON_BLOCKS, GET_ALL_ARRAY_DECL, PARSE_OMP_DIRS }) <= Pass(PREPROC_SPF);
|
||||||
|
|
||||||
Pass(CHECK_PAR_REG_DIR) <= Pass(FILL_PARALLEL_REG_IR);
|
Pass(CHECK_PAR_REG_DIR) <= Pass(FILL_PARALLEL_REG_IR);
|
||||||
|
|
||||||
@@ -320,6 +322,7 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
list({ FIND_PRIVATE_ARRAYS_ANALYSIS, CONVERT_LOOP_TO_ASSIGN, RESTORE_LOOP_FROM_ASSIGN, REVERT_SUBST_EXPR_RD }) <= Pass(FIND_PRIVATE_ARRAYS);
|
list({ FIND_PRIVATE_ARRAYS_ANALYSIS, CONVERT_LOOP_TO_ASSIGN, RESTORE_LOOP_FROM_ASSIGN, REVERT_SUBST_EXPR_RD }) <= Pass(FIND_PRIVATE_ARRAYS);
|
||||||
|
|
||||||
list({ BUILD_IR, CALL_GRAPH2, RESTORE_LOOP_FROM_ASSIGN, REVERT_SUBST_EXPR_RD }) <= Pass(MOVE_OPERATORS);
|
list({ BUILD_IR, CALL_GRAPH2, RESTORE_LOOP_FROM_ASSIGN, REVERT_SUBST_EXPR_RD }) <= Pass(MOVE_OPERATORS);
|
||||||
|
Pass(CREATE_TEMPLATE_LINKS) <= Pass(MERGE_COPY_ARRAYS);
|
||||||
|
|
||||||
passesIgnoreStateDone.insert({ CREATE_PARALLEL_DIRS, INSERT_PARALLEL_DIRS, INSERT_SHADOW_DIRS, EXTRACT_PARALLEL_DIRS,
|
passesIgnoreStateDone.insert({ CREATE_PARALLEL_DIRS, INSERT_PARALLEL_DIRS, INSERT_SHADOW_DIRS, EXTRACT_PARALLEL_DIRS,
|
||||||
EXTRACT_SHADOW_DIRS, CREATE_REMOTES, UNPARSE_FILE, REMOVE_AND_CALC_SHADOW,
|
EXTRACT_SHADOW_DIRS, CREATE_REMOTES, UNPARSE_FILE, REMOVE_AND_CALC_SHADOW,
|
||||||
|
|||||||
@@ -934,8 +934,14 @@ void fillNonDistrArraysAsPrivate(SgStatement *st,
|
|||||||
{
|
{
|
||||||
auto itD = declaredArrays.find(*itSet);
|
auto itD = declaredArrays.find(*itSet);
|
||||||
if (itD != declaredArrays.end())
|
if (itD != declaredArrays.end())
|
||||||
if (itD->second.first->IsNotDistribute())
|
{
|
||||||
privatesVars.insert(itD->second.first->GetShortName());
|
const auto array = itD->second.first;
|
||||||
|
if (array->IsNotDistribute())
|
||||||
|
{
|
||||||
|
auto symb = array->GetDeclSymbol(make_pair(st->fileName(), st->lineNumber()));
|
||||||
|
privatesVars.insert(symb->identifier());
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -953,9 +959,21 @@ DIST::Array* getArrayFromDeclarated(SgStatement *st, const string &arrayName)
|
|||||||
for (auto itSet = it->second.begin(); itSet != it->second.end() && !found; ++itSet)
|
for (auto itSet = it->second.begin(); itSet != it->second.end() && !found; ++itSet)
|
||||||
{
|
{
|
||||||
auto itD = declaredArrays.find(*itSet);
|
auto itD = declaredArrays.find(*itSet);
|
||||||
if (itD != declaredArrays.end())
|
if (itD != declaredArrays.end())
|
||||||
if (itD->second.first->GetShortName() == arrayName)
|
{
|
||||||
found = itD->second.first;
|
DIST::Array* array = itD->second.first;
|
||||||
|
if (array->GetLocation().first == DIST::l_COMMON)
|
||||||
|
{
|
||||||
|
auto symb = array->GetDeclSymbol(make_pair(st->fileName(), st->lineNumber()));
|
||||||
|
if (symb && symb->identifier() == arrayName)
|
||||||
|
found = array;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
if (array->GetShortName() == arrayName)
|
||||||
|
found = array;
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return found;
|
return found;
|
||||||
@@ -1264,6 +1282,32 @@ static SgExpression* isInCommon(const vector<SgExpression*> &commonBlocks, const
|
|||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
//all common block in project
|
||||||
|
extern map<string, CommonBlock*> commonBlocks;
|
||||||
|
static string getCommonNameOnPos(const string& name, const int commonPos)
|
||||||
|
{
|
||||||
|
if (commonBlocks.size() == 0)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
auto it = commonBlocks.find(name);
|
||||||
|
if (it == commonBlocks.end())
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
auto inPos = it->second->getGroupedVars().find(commonPos);
|
||||||
|
if (inPos == it->second->getGroupedVars().end())
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
set<string> namesOnPos;
|
||||||
|
|
||||||
|
for (auto& var : inPos->second)
|
||||||
|
namesOnPos.insert(var->getName());
|
||||||
|
|
||||||
|
if (namesOnPos.size() == 0)
|
||||||
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
|
return *namesOnPos.begin();
|
||||||
|
}
|
||||||
|
|
||||||
static map<tuple<string, string, int>, tuple<int, string, string>> tableOfUniqNames;
|
static map<tuple<string, string, int>, tuple<int, string, string>> tableOfUniqNames;
|
||||||
tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>> &commonBlocks, SgStatement *decl, SgSymbol *symb)
|
tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>> &commonBlocks, SgStatement *decl, SgSymbol *symb)
|
||||||
{
|
{
|
||||||
@@ -1272,6 +1316,7 @@ tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>>
|
|||||||
int commonPos = 0;
|
int commonPos = 0;
|
||||||
|
|
||||||
SgExpression *foundCommon = NULL;
|
SgExpression *foundCommon = NULL;
|
||||||
|
string symbCommn = "";
|
||||||
|
|
||||||
SgStatement *declCP = decl->controlParent();
|
SgStatement *declCP = decl->controlParent();
|
||||||
// find symbol in parameter list of functions
|
// find symbol in parameter list of functions
|
||||||
@@ -1307,6 +1352,7 @@ tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>>
|
|||||||
if (foundCommon)
|
if (foundCommon)
|
||||||
{
|
{
|
||||||
inCommon = true;
|
inCommon = true;
|
||||||
|
symbCommn = getCommonNameOnPos(common.first, commonPos);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -1314,7 +1360,7 @@ tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>>
|
|||||||
|
|
||||||
tuple<int, string, string> retVal;
|
tuple<int, string, string> retVal;
|
||||||
if (inCommon)
|
if (inCommon)
|
||||||
retVal = make_tuple(commonPos, string("common_") + getCommonName(foundCommon), string(symb->identifier()));
|
retVal = make_tuple(commonPos, string("common_") + getCommonName(foundCommon), symbCommn);
|
||||||
else
|
else
|
||||||
retVal = make_tuple(decl->lineNumber(), string(decl->fileName()), string(symb->identifier()));
|
retVal = make_tuple(decl->lineNumber(), string(decl->fileName()), string(symb->identifier()));
|
||||||
|
|
||||||
|
|||||||
@@ -337,10 +337,15 @@ const set<SgSymbol*>& getModuleSymbols(SgStatement *func)
|
|||||||
//if function or module in contains
|
//if function or module in contains
|
||||||
auto cp = func->controlParent();
|
auto cp = func->controlParent();
|
||||||
if (isSgProgHedrStmt(cp) || cp->variant() == MODULE_STMT)
|
if (isSgProgHedrStmt(cp) || cp->variant() == MODULE_STMT)
|
||||||
|
{
|
||||||
getModuleSymbols(cp, symbs);
|
getModuleSymbols(cp, symbs);
|
||||||
|
|
||||||
|
if (func->variant() == FUNC_HEDR)
|
||||||
|
symbs.insert(func->symbol());
|
||||||
|
}
|
||||||
|
|
||||||
symbolsForFunc[func->symbol()->identifier()] = symbs;
|
symbolsForFunc[func->symbol()->identifier()] = symbs;
|
||||||
return symbs;
|
return symbolsForFunc[func->symbol()->identifier()];
|
||||||
}
|
}
|
||||||
|
|
||||||
static void findSymbol(SgStatement* func, const string& varName, const string& locName,
|
static void findSymbol(SgStatement* func, const string& varName, const string& locName,
|
||||||
@@ -349,9 +354,19 @@ static void findSymbol(SgStatement* func, const string& varName, const string& l
|
|||||||
for (const auto& s : getModuleSymbols(func))
|
for (const auto& s : getModuleSymbols(func))
|
||||||
{
|
{
|
||||||
SgSymbol* orig = OriginalSymbol(s);
|
SgSymbol* orig = OriginalSymbol(s);
|
||||||
|
printf("%s == %s\n", orig->identifier(), s->identifier());
|
||||||
//any suitable symbol can be used
|
//any suitable symbol can be used
|
||||||
if (orig->identifier() == varName && orig->scope()->symbol()->identifier() == locName)
|
|
||||||
altNames[s->identifier()] = s;
|
if (orig->variant() == FUNCTION_NAME)
|
||||||
|
{
|
||||||
|
if (orig->identifier() == varName)
|
||||||
|
altNames[s->identifier()] = s;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
if (orig->identifier() == varName && orig->scope()->symbol()->identifier() == locName)
|
||||||
|
altNames[s->identifier()] = s;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -369,6 +384,7 @@ SgSymbol* getNameInLocation(SgStatement* func, const string& varName, const stri
|
|||||||
return altNames.begin()->second;
|
return altNames.begin()->second;
|
||||||
else {
|
else {
|
||||||
__spf_print(1, "%s (%s %s) %s\n", func->symbol()->identifier(), clearName.c_str(), varName.c_str(), locName.c_str());
|
__spf_print(1, "%s (%s %s) %s\n", func->symbol()->identifier(), clearName.c_str(), varName.c_str(), locName.c_str());
|
||||||
|
findSymbol(func, varName, locName, altNames);
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -569,8 +569,8 @@ void copyIncludes(const set<string> &allIncludeFiles, const map<string, map<int,
|
|||||||
|
|
||||||
while (!feof(oldFile))
|
while (!feof(oldFile))
|
||||||
{
|
{
|
||||||
char buf[8192];
|
char buf[16384];
|
||||||
char *res = fgets(buf, 16384, oldFile);
|
char *res = fgets(buf, sizeof(buf), oldFile);
|
||||||
if (res == NULL)
|
if (res == NULL)
|
||||||
break;
|
break;
|
||||||
|
|
||||||
|
|||||||
@@ -1,3 +1,3 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#define VERSION_SPF "2453"
|
#define VERSION_SPF "2465"
|
||||||
|
|||||||
@@ -152,7 +152,7 @@ static void setOptions(const short* options, bool isBuildParallel = false, const
|
|||||||
intOptions[z] = -1;
|
intOptions[z] = -1;
|
||||||
}
|
}
|
||||||
|
|
||||||
staticShadowAnalysis = intOptions[STATIC_SHADOW_ANALYSIS];
|
//staticShadowAnalysis = intOptions[STATIC_SHADOW_ANALYSIS];
|
||||||
staticPrivateAnalysis = intOptions[STATIC_PRIVATE_ANALYSIS];
|
staticPrivateAnalysis = intOptions[STATIC_PRIVATE_ANALYSIS];
|
||||||
out_free_form = intOptions[FREE_FORM];
|
out_free_form = intOptions[FREE_FORM];
|
||||||
if (out_free_form == 1)
|
if (out_free_form == 1)
|
||||||
|
|||||||
Reference in New Issue
Block a user