Compare commits
1 Commits
b9e6791f61
...
486b4c1a13
| Author | SHA1 | Date | |
|---|---|---|---|
| 486b4c1a13 |
Submodule projects/dvm updated: cdda71deab...3aad02affb
@@ -1162,9 +1162,8 @@ map<FuncInfo*, vector<BBlock*>> buildCFG(const map<string, CommonBlock*>& common
|
||||
if (SgFile::switchToFile(oldFile) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
if (!settings.withUnreachable)
|
||||
for (auto& [func, blocks] : result)
|
||||
removedUnreachableBlocks(blocks);
|
||||
for (auto& [func, blocks] : result)
|
||||
removedUnreachableBlocks(blocks);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
@@ -105,52 +105,23 @@ namespace SAPFOR
|
||||
|
||||
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 withRD = false;
|
||||
bool withRegisters = false;
|
||||
bool withSPF = false;
|
||||
bool withDVM = false;
|
||||
bool withCallsInBlocks = false; // separate each F_CALL to own BasicBlock
|
||||
bool withCallFrom = false;
|
||||
bool withDominators = false;
|
||||
bool withUnreachable = false;
|
||||
bool withRD = true;
|
||||
bool withRegisters = false;
|
||||
bool withSPF = false;
|
||||
bool withDVM = false;
|
||||
bool withCallsInBlocks = false; // separate each F_CALL to own BasicBlock
|
||||
bool withCallFrom = true;
|
||||
bool withDominators = true;
|
||||
|
||||
explicit CFG_Settings(const std::set<setting> &settings = { CFG_withRD, CFG_withCallFrom, CFG_withDominators })
|
||||
{
|
||||
for (auto& set : settings)
|
||||
{
|
||||
if (set == CFG_atLeastOneIterInLoop)
|
||||
atLeastOneIterInLoop = true;
|
||||
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__);
|
||||
}
|
||||
}
|
||||
explicit CFG_Settings(int) { }
|
||||
|
||||
explicit CFG_Settings(bool atLeastOneIterInLoop = false, bool withRD = true, bool withRegisters = false,
|
||||
bool withDVM = false, bool withSPF = false, bool withCallsInBlocks = false,
|
||||
bool withCallFrom = true, bool withDominators = true) :
|
||||
atLeastOneIterInLoop(atLeastOneIterInLoop), withRD(withRD), withRegisters(withRegisters), withDVM(withDVM), withSPF(withSPF),
|
||||
withCallsInBlocks(withCallsInBlocks), withCallFrom(withCallFrom), withDominators(withDominators)
|
||||
{ }
|
||||
};
|
||||
}
|
||||
|
||||
|
||||
@@ -321,12 +321,6 @@ 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)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
|
||||
@@ -853,21 +853,12 @@ static pair<string, string> getModuleRename(const set<SgStatement*>& allocatable
|
||||
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>
|
||||
getNewDirective(const string &fullArrayName,
|
||||
const vector<string> &distrRules,
|
||||
const vector<string> &alignRules,
|
||||
const DataDirective &dataDir,
|
||||
const set<SgStatement*>& allocatableStmts,
|
||||
const pair<string, int>& position_decl)
|
||||
const set<SgStatement*>& allocatableStmts)
|
||||
{
|
||||
string out = "";
|
||||
DIST::Array* outA = NULL;
|
||||
@@ -886,8 +877,7 @@ getNewDirective(const string &fullArrayName,
|
||||
|
||||
for (int i = 0; i < dataDir.alignRules.size(); ++i)
|
||||
{
|
||||
auto alignArray = dataDir.alignRules[i].alignArray;
|
||||
if (alignArray->GetName() == fullArrayName)
|
||||
if (dataDir.alignRules[i].alignArray->GetName() == fullArrayName)
|
||||
{
|
||||
string rule = alignRules[i];
|
||||
if (allocatableStmts.size())
|
||||
@@ -899,21 +889,21 @@ getNewDirective(const string &fullArrayName,
|
||||
it = rule.find("ALIGN", it + 7);
|
||||
}
|
||||
|
||||
auto renamePair = getModuleRename(allocatableStmts, alignArray);
|
||||
doRename(rule, renamePair);
|
||||
}
|
||||
else if (alignArray->GetLocation().first == DIST::l_COMMON)
|
||||
{
|
||||
auto symb = alignArray->GetDeclSymbol(position_decl);
|
||||
if (symb->identifier() != alignArray->GetShortName())
|
||||
doRename(rule, make_pair(alignArray->GetShortName(), symb->identifier()));
|
||||
auto renamePair = getModuleRename(allocatableStmts, dataDir.alignRules[i].alignArray);
|
||||
if (renamePair.first != "")
|
||||
{
|
||||
it = rule.find(renamePair.first);
|
||||
if (it != string::npos)
|
||||
if (rule[it + renamePair.first.size()] == '(' && rule[it - 1] == ' ')
|
||||
rule = rule.replace(it, renamePair.first.size(), renamePair.second);
|
||||
}
|
||||
}
|
||||
|
||||
out += "!DVM$ " + rule + "\n";
|
||||
if (!out_free_form)
|
||||
out = splitDirective(out);
|
||||
|
||||
return make_pair(alignArray, out);
|
||||
return make_pair(dataDir.alignRules[i].alignArray, out);
|
||||
}
|
||||
}
|
||||
|
||||
@@ -1753,7 +1743,7 @@ void insertDistributionToFile(SgFile *file, const char *fin_name, const DataDire
|
||||
if (allocatableStmtsCopy.size())
|
||||
allocatableStmts = filterAllocateStats(file, allocatableStmtsCopy, currSymb->identifier());
|
||||
|
||||
pair<DIST::Array*, string> dirWithArray = getNewDirective(fullArrayName, distrRules, alignRules, dataDir, allocatableStmts, make_pair(st->fileName(), st->lineNumber()));
|
||||
pair<DIST::Array*, string> dirWithArray = getNewDirective(fullArrayName, distrRules, alignRules, dataDir, allocatableStmts);
|
||||
|
||||
string toInsert = dirWithArray.second;
|
||||
if (toInsert != "")
|
||||
@@ -1985,27 +1975,20 @@ void insertDistributionToFile(SgFile *file, const char *fin_name, const DataDire
|
||||
set<string> toInsertArrays;
|
||||
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 (dynamicArraysAdded.find(name) != dynamicArraysAdded.end())
|
||||
if (dynamicArraysAdded.find(array->GetShortName()) != dynamicArraysAdded.end())
|
||||
{
|
||||
dynamicArraysAdded.erase(name);
|
||||
toInsertArrays.insert(name);
|
||||
dynamicArraysAdded.erase(array->GetShortName());
|
||||
toInsertArrays.insert(array->GetShortName());
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if (dynamicArraysAdded.find(name) == dynamicArraysAdded.end())
|
||||
if (dynamicArraysAdded.find(array->GetShortName()) == dynamicArraysAdded.end())
|
||||
{
|
||||
dynamicArraysAdded.insert(name);
|
||||
toInsertArrays.insert(name);
|
||||
dynamicArraysAdded.insert(array->GetShortName());
|
||||
toInsertArrays.insert(array->GetShortName());
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -2162,14 +2145,7 @@ void insertShadowSpecToFile(SgFile *file, const char *fin_name, const set<string
|
||||
|
||||
if (needToGen)
|
||||
{
|
||||
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 + "(";
|
||||
string shadowSpecInsert = "!DVM$ SHADOW " + array->GetShortName() + "(";
|
||||
for (int k = 0; k < currSpec.size(); ++k)
|
||||
{
|
||||
char buf[256];
|
||||
@@ -2181,7 +2157,7 @@ void insertShadowSpecToFile(SgFile *file, const char *fin_name, const set<string
|
||||
shadowSpecInsert += ")\n";
|
||||
|
||||
shadowsSpecsString.push_back(shadowSpecInsert);
|
||||
pair<SgExpression*, SgExpression*> newSpec = genShadowSpec(file, make_pair(name, currSpec));
|
||||
pair<SgExpression*, SgExpression*> newSpec = genShadowSpec(file, make_pair(array->GetShortName(), currSpec));
|
||||
if (newSpec.first == NULL || newSpec.second == NULL)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
shadowsSpecs.push_back(newSpec);
|
||||
|
||||
@@ -26,7 +26,6 @@ using std::string;
|
||||
using std::vector;
|
||||
using std::pair;
|
||||
using std::make_pair;
|
||||
using SAPFOR::CFG_Settings;
|
||||
|
||||
extern int debSh;
|
||||
|
||||
@@ -1673,12 +1672,9 @@ void GroupShadow(const map<string, vector<FuncInfo*>>& allFuncs,
|
||||
|
||||
SgStatement* func = currF->funcPointer->GetOriginal();
|
||||
|
||||
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);
|
||||
auto cfg = buildCFGforCurrentFunc(func, SAPFOR::CFG_Settings(true, false, false, true, false, true, false), commonBlocks, allFuncs);
|
||||
if (cfg.size() != 1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto& blocks = cfg.begin()->second;
|
||||
|
||||
//create reaching blocks
|
||||
|
||||
@@ -336,24 +336,9 @@ namespace Distribution
|
||||
if (pos != STRING::npos)
|
||||
{
|
||||
name.erase(pos, shortName.size());
|
||||
shortName = 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();
|
||||
}
|
||||
|
||||
@@ -557,44 +542,6 @@ namespace Distribution
|
||||
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; }
|
||||
void SetDeclSymbol(Symbol *s) { declSymbol = s; }
|
||||
|
||||
|
||||
@@ -33,7 +33,6 @@ using std::set;
|
||||
using std::ofstream;
|
||||
using std::pair;
|
||||
using std::tuple;
|
||||
using SAPFOR::CFG_Settings;
|
||||
|
||||
using json = nlohmann::json;
|
||||
|
||||
@@ -508,8 +507,7 @@ static void parallelDir(const map<DIST::Array*, int>& byPos, SgExpression* spec,
|
||||
if (currF == NULL)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop, CFG_Settings::CFG_withSPF, CFG_Settings::CFG_withDominators });
|
||||
auto cfg = buildCFGforCurrentFunc(func, settings, commonBlocks, allFuncInfo);
|
||||
auto cfg = buildCFGforCurrentFunc(func, SAPFOR::CFG_Settings(true, false, false, true, false, false, true), commonBlocks, allFuncInfo);
|
||||
//TODO IP analysis
|
||||
|
||||
unsigned countOfAccess = 0;
|
||||
|
||||
@@ -1893,7 +1893,7 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
findParameters(parametersOfProject, fullIR, declaredArrays);
|
||||
else if (curr_regime == BUILD_IR)
|
||||
{
|
||||
auto CFG_forFile = buildCFG(commonBlocks, allFuncInfo_IR, SAPFOR::CFG_Settings());
|
||||
auto CFG_forFile = buildCFG(commonBlocks, allFuncInfo_IR, SAPFOR::CFG_Settings(0));
|
||||
for (auto& byFunc : CFG_forFile)
|
||||
fullIR[byFunc.first].insert(fullIR[byFunc.first].end(), byFunc.second.begin(), byFunc.second.end());
|
||||
|
||||
@@ -2524,8 +2524,8 @@ int main(int argc, char **argv)
|
||||
out_free_form = 1;
|
||||
out_line_unlimit = 1;
|
||||
}
|
||||
/*else if (string(curr_arg) == "-sh")
|
||||
staticShadowAnalysis = 1;*/
|
||||
else if (string(curr_arg) == "-sh")
|
||||
staticShadowAnalysis = 1;
|
||||
else if (string(curr_arg) == "-shWidth")
|
||||
{
|
||||
i++;
|
||||
|
||||
@@ -19,7 +19,7 @@
|
||||
extern std::map<std::string, std::string> shortFileNames;
|
||||
static int activeState = 0;
|
||||
|
||||
int staticShadowAnalysis = 1;
|
||||
int staticShadowAnalysis = 0;
|
||||
int staticPrivateAnalysis = 0;
|
||||
int keepDvmDirectives = 0;
|
||||
int keepFiles = 0;
|
||||
|
||||
@@ -12,7 +12,6 @@ using std::map;
|
||||
using std::string;
|
||||
using std::vector;
|
||||
using std::set;
|
||||
using SAPFOR::CFG_Settings;
|
||||
|
||||
using std::remove_if;
|
||||
|
||||
@@ -425,8 +424,7 @@ int removeDeadCode(SgStatement* func,
|
||||
if (intervalDelEnd->lineNumber() < prog->lineNumber() || intervalDelEnd->lineNumber() > prog->lastNodeOfStmt()->lineNumber())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop });
|
||||
auto cfg = buildCFGforCurrentFunc(func, settings, commonBlocks, allFuncs);
|
||||
auto cfg = buildCFGforCurrentFunc(func, SAPFOR::CFG_Settings(true, false, false, false, false, false, false), commonBlocks, allFuncs);
|
||||
|
||||
if(cfg.size() != 1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
@@ -18,66 +18,69 @@ using std::tuple;
|
||||
|
||||
/// main function:
|
||||
// renew unions for all common blocks in the file
|
||||
//void BuildNewCommDecls
|
||||
static void BuildNewCommDecls(SgFile* file, const map<string, CommonBlock*> allCommonBlocks,
|
||||
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
|
||||
//set<string> getUses
|
||||
//void getUsesFromExpr
|
||||
static set<string> getUses(SgStatement* firstSt, const set<string>& commonVarNames);
|
||||
static void getUsesFromExpr(SgExpression* expr, const set<string>& commonVarNames, set<string>& used);
|
||||
|
||||
// splits arrays into elements and replaces not used vars with empty constraints
|
||||
//bool splitType
|
||||
|
||||
static bool splitType(deque<CommConstraint>& d, bool check_use, const set<string>& namesOfUsedVars);
|
||||
// create constraits set
|
||||
//deque<CommConstraint> makeConstraints
|
||||
|
||||
static deque<CommConstraint> makeConstraints(deque<CommConstraint>& constraints, const set<string>& namesOfUsedVars, set<string>& notUsedVars);
|
||||
// build union
|
||||
//bool buildConstraintsUnion
|
||||
//bool docheckUnequalConstraints
|
||||
//bool check
|
||||
static bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint> B, const set<string>& namesOfUsedVars, pair<CommConstraint, CommConstraint>& problemConstraints);
|
||||
static bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstraint>& B, deque<CommConstraint>& newU, pair<CommConstraint, CommConstraint>& problemConstraints);
|
||||
static bool check(deque<CommConstraint>& A, deque<CommConstraint>& B, pair<CommConstraint, CommConstraint>& problemConstraints);
|
||||
|
||||
/// small help functions:
|
||||
//string getParentName
|
||||
//bool equalDims
|
||||
//bool equalConstraints
|
||||
//void addElem
|
||||
static string getParentName(const string& name);
|
||||
static bool equalDims(const CommConstraint& a, const CommConstraint& b);
|
||||
static bool equalConstraints(const CommConstraint& a, const CommConstraint& b);
|
||||
static void addElem(deque<CommConstraint>& comm, const CommConstraint& elem);
|
||||
//////
|
||||
|
||||
// change names of variables in 'constraints'
|
||||
//void fixNames
|
||||
static void fixNames(deque<CommConstraint>& constraints, const string& commName);
|
||||
|
||||
////// step2: transformation
|
||||
|
||||
/// main function
|
||||
// peform transformation on every program unit in the file
|
||||
//void fixFunctions
|
||||
static 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);
|
||||
|
||||
// get pairs of names (namesOldToNew) for renaming
|
||||
//bool getNamesOldToNew
|
||||
static bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint> oldDecl, map<string, string>& namesOldToNew);
|
||||
|
||||
// create new symbols for new variables in new common declaration (constraints)
|
||||
//void makeCommVarSymbs
|
||||
|
||||
static void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* file, SgStatement* func, string commName,
|
||||
map<string, SgSymbol*>& symbs, vector<SgSymbol*>& needNewDecl);
|
||||
// delete from program unit all references to names in commVarNames
|
||||
//void deleteOldVars
|
||||
static void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames);
|
||||
|
||||
// calls fixExpression for each statement, replaces names in data statement
|
||||
//void renameVariables
|
||||
|
||||
static void renameVariables(SgStatement* firstSt, const map<string, SgSymbol*>& newVarSymbs, const map<string, string>& namesOldToNew);
|
||||
// replacing variables or array elements in expression expr if their names are in namesOldToNew
|
||||
//SgExpression* fixExpression
|
||||
static SgExpression* fixExpression(SgExpression* expr, const map<string, SgSymbol*>& newSymbs, const map<string, string>& namesOldToNew);
|
||||
|
||||
// make new exprList exprssion for new declaration decl with symbols from newSymbs
|
||||
//SgExpression* makeExprListForCommon
|
||||
|
||||
static SgExpression* makeExprListForCommon(const deque<CommConstraint>& decl, const map<string, SgSymbol*>& newSymbs,
|
||||
SgFile* file, SgStatement* firstSt);
|
||||
// replace old common declarations with new ones
|
||||
//void rewriteCommon
|
||||
static void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& commListExprs);
|
||||
|
||||
/// help functions:
|
||||
//SgExpression* makeIdxFromStr(const string& str);
|
||||
|
||||
static SgExpression* makeIdxFromStr(const string& str);
|
||||
// make new expression of array element
|
||||
//SgExpression* newArrElemExpr
|
||||
//bool variablePositionComp
|
||||
static SgExpression* newArrElemExpr(const string& newName, const map<string, SgSymbol*>& newSymbs);
|
||||
static bool variablePositionComp(const Variable* lhs, const Variable* rhs);
|
||||
//////
|
||||
|
||||
|
||||
|
||||
CommConstraint::CommConstraint(const Variable* var, bool u, const string& funcName, const string& fileName)
|
||||
{
|
||||
used = u;
|
||||
@@ -122,6 +125,7 @@ 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)
|
||||
{
|
||||
typeVariant = type->variant();
|
||||
@@ -135,7 +139,8 @@ CommConstraint::CommConstraint(const string& name, SgType* t, bool u, vector<Dec
|
||||
size = getSizeOfType(type);
|
||||
}
|
||||
|
||||
static string getParentName(const string& name)
|
||||
|
||||
string getParentName(const string& name)
|
||||
{
|
||||
size_t len = name.find("%");
|
||||
size_t posB = name.find("(");
|
||||
@@ -149,7 +154,8 @@ static string getParentName(const string& name)
|
||||
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)
|
||||
return;
|
||||
@@ -188,7 +194,8 @@ static void getUsesFromExpr(SgExpression* expr, const set<string>& commonVarName
|
||||
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;
|
||||
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
||||
@@ -205,7 +212,8 @@ static set<string> getUses(SgStatement* firstSt, const set<string>& commonVarNam
|
||||
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>>& bdim = b.arrayInfo->GetSizes();
|
||||
@@ -216,12 +224,11 @@ static bool equalDims(const CommConstraint& a, const CommConstraint& b)
|
||||
if (adim[i].second - adim[i].first != bdim[i].second - bdim[i].first)
|
||||
return false;
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
// TODO: add attributes to CommConstraints, check if a and b have equal attributes
|
||||
static bool equalConstraints(const CommConstraint& a, const CommConstraint& b)
|
||||
bool equalConstraints(const CommConstraint& a, const CommConstraint& b)
|
||||
{
|
||||
if ((a.arrayInfo != NULL && b.arrayInfo == NULL) || ((a.arrayInfo == NULL && b.arrayInfo != NULL)))
|
||||
return false;
|
||||
@@ -232,7 +239,8 @@ static bool equalConstraints(const CommConstraint& a, const CommConstraint& b)
|
||||
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)
|
||||
comm.back().size += elem.size;
|
||||
@@ -240,8 +248,9 @@ static void addElem(deque<CommConstraint>& comm, const CommConstraint& elem)
|
||||
comm.push_back(elem);
|
||||
}
|
||||
|
||||
|
||||
// TODO: check attributes: do not split arrays with pointer or target attributes if check_use == true
|
||||
static bool splitType(deque<CommConstraint>& d, bool check_use, const set<string>& namesOfUsedVars = {})
|
||||
bool splitType(deque<CommConstraint>& d, bool check_use, const set<string>& namesOfUsedVars = {})
|
||||
{
|
||||
CommConstraint var = d.front();
|
||||
string name = var.identifier;
|
||||
@@ -289,7 +298,8 @@ static bool splitType(deque<CommConstraint>& d, bool check_use, const set<string
|
||||
}
|
||||
}
|
||||
|
||||
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;
|
||||
while (!constraints.empty())
|
||||
@@ -306,7 +316,8 @@ static deque<CommConstraint> makeConstraints(deque<CommConstraint>& constraints,
|
||||
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())
|
||||
{
|
||||
@@ -345,8 +356,8 @@ static bool check(deque<CommConstraint>& A, deque<CommConstraint>& B, pair<CommC
|
||||
return true;
|
||||
}
|
||||
|
||||
static bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstraint>& B, deque<CommConstraint>& newU,
|
||||
pair<CommConstraint, CommConstraint>& problemConstraints)
|
||||
|
||||
bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstraint>& B, deque<CommConstraint>& newU, pair<CommConstraint, CommConstraint>& problemConstraints)
|
||||
{
|
||||
if (U.front().typeVariant == 0)
|
||||
{
|
||||
@@ -369,8 +380,8 @@ static bool docheckUnequalConstraints(deque<CommConstraint>& U, deque<CommConstr
|
||||
return true;
|
||||
}
|
||||
|
||||
static bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint> B,
|
||||
const set<string>& namesOfUsedVars, pair<CommConstraint, CommConstraint>& problemConstraints)
|
||||
|
||||
bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint> B, const set<string>& namesOfUsedVars, pair<CommConstraint, CommConstraint>& problemConstraints)
|
||||
{
|
||||
deque<CommConstraint> newU;
|
||||
while (!U.empty() && !B.empty())
|
||||
@@ -425,8 +436,8 @@ static bool buildConstraintsUnion(deque<CommConstraint>& U, deque<CommConstraint
|
||||
return true;
|
||||
}
|
||||
|
||||
//TODO: check this: newDecl and oldDecl => do these variables need references?
|
||||
static bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint> oldDecl, map<string, string>& namesOldToNew)
|
||||
|
||||
bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint> oldDecl, map<string, string>& namesOldToNew)
|
||||
{
|
||||
bool needChange = false;
|
||||
map<string, string> rename;
|
||||
@@ -491,18 +502,16 @@ static bool getNamesOldToNew(deque<CommConstraint> newDecl, deque<CommConstraint
|
||||
newDecl.pop_front();
|
||||
}
|
||||
}
|
||||
|
||||
if (!oldDecl.empty() || !newDecl.empty())
|
||||
needChange = true;
|
||||
|
||||
if (needChange)
|
||||
namesOldToNew.insert(rename.begin(), rename.end());
|
||||
|
||||
return needChange;
|
||||
}
|
||||
|
||||
static void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* file, SgStatement* func, const string& commName,
|
||||
map<string, SgSymbol*>& symbs, vector<SgSymbol*>& needNewDecl)
|
||||
|
||||
void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* file, SgStatement* func, string commName,
|
||||
map<string, SgSymbol*>& symbs, vector<SgSymbol*>& needNewDecl)
|
||||
{
|
||||
for (const CommConstraint& var : constraints)
|
||||
{
|
||||
@@ -515,7 +524,8 @@ static void makeCommVarSymbs(const deque<CommConstraint>& constraints, SgFile* f
|
||||
}
|
||||
}
|
||||
|
||||
static void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames)
|
||||
|
||||
void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames)
|
||||
{
|
||||
SgStatement* lastSt = firstSt->lastNodeOfStmt();
|
||||
vector<SgStatement*> stmtsToDelete;
|
||||
@@ -561,12 +571,12 @@ static void deleteOldVars(SgStatement* firstSt, const set<string>& commVarNames)
|
||||
}
|
||||
// TODO: delete common variables form attributes statements (like DIM_STAT)
|
||||
}
|
||||
|
||||
for (SgStatement* st : stmtsToDelete)
|
||||
st->deleteStmt();
|
||||
}
|
||||
|
||||
static SgExpression* makeIdxFromStr(const string& str)
|
||||
|
||||
SgExpression* makeIdxFromStr(const string& str)
|
||||
{
|
||||
vector<SgExpression*> items;
|
||||
int num = 0;
|
||||
@@ -581,13 +591,13 @@ static SgExpression* makeIdxFromStr(const string& str)
|
||||
num = 0;
|
||||
}
|
||||
}
|
||||
|
||||
reverse(items.begin(), items.end());
|
||||
SgExpression* exprList = makeExprList(items, false);
|
||||
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('(');
|
||||
SgExpression* newExpr = new SgArrayRefExp(*newSymbs.at(newName.substr(0, pos)));
|
||||
@@ -595,11 +605,11 @@ static SgExpression* newArrElemExpr(const string& newName, const map<string, SgS
|
||||
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)
|
||||
return NULL;
|
||||
|
||||
if (expr->variant() == VAR_REF || expr->variant() == ARRAY_REF)
|
||||
{
|
||||
string name = expr->symbol()->identifier();
|
||||
@@ -635,18 +645,17 @@ static SgExpression* fixExpression(SgExpression* expr, const map<string, SgSymbo
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
SgExpression* lhs = fixExpression(expr->lhs(), newSymbs, namesOldToNew);
|
||||
if (lhs != NULL)
|
||||
expr->setLhs(lhs);
|
||||
|
||||
SgExpression* rhs = fixExpression(expr->rhs(), newSymbs, namesOldToNew);
|
||||
if (rhs != NULL)
|
||||
expr->setRhs(rhs);
|
||||
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();
|
||||
for (SgStatement* curSt = firstSt; curSt != NULL && curSt != lastSt; curSt = curSt->lexNext())
|
||||
@@ -694,7 +703,8 @@ static void renameVariables(SgStatement* firstSt, const map<string, SgSymbol*>&
|
||||
}
|
||||
}
|
||||
|
||||
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)
|
||||
{
|
||||
vector<SgExpression*> items;
|
||||
@@ -728,7 +738,8 @@ static SgExpression* makeExprListForCommon(const deque<CommConstraint>& decl, co
|
||||
return exprList;
|
||||
}
|
||||
|
||||
static void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& commListExprs)
|
||||
|
||||
void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& commListExprs)
|
||||
{
|
||||
vector<SgStatement*> commonStmtsToDelete;
|
||||
for (SgStatement* st = firstSt; st != firstSt->lastDeclaration()->lexNext(); st = st->lexNext())
|
||||
@@ -779,12 +790,12 @@ static void rewriteCommon(SgStatement* firstSt, map<string, SgExpression*>& comm
|
||||
commonStmtsToDelete.push_back(st);
|
||||
}
|
||||
}
|
||||
|
||||
for (SgStatement* st : commonStmtsToDelete)
|
||||
st->deleteStmt();
|
||||
}
|
||||
|
||||
static void fixNames(deque<CommConstraint>& constraints, const string& commName)
|
||||
|
||||
void fixNames(deque<CommConstraint>& constraints, const string& commName)
|
||||
{
|
||||
for (auto& var : constraints)
|
||||
{
|
||||
@@ -799,26 +810,26 @@ static 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();
|
||||
}
|
||||
|
||||
static void fixFunctions(SgFile* file, const vector<SgStatement*>& programUnits, map<string, deque<CommConstraint>>& newCommonDecls,
|
||||
map<string, map<string, deque<CommConstraint>>>& commDecls, const set<string>& badCommon, map<string, set<string>>& notUsedVars)
|
||||
|
||||
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)
|
||||
{
|
||||
for (SgStatement* unitSt : programUnits)
|
||||
{
|
||||
string funcName = unitSt->symbol()->identifier();
|
||||
if (commDecls.find(funcName) == commDecls.end())
|
||||
continue;
|
||||
|
||||
SgStatement* firstSt = unitSt;
|
||||
map<string, SgExpression*> commListExprs;
|
||||
map<string, SgSymbol*> newVarSymbs; // new symbols for new variables
|
||||
map<string, string> namesOldToNew; // for ranaming: old name -> new name
|
||||
vector<SgSymbol*> needNewDecl;
|
||||
|
||||
for (auto& common : commDecls[funcName])
|
||||
{
|
||||
string commName = common.first;
|
||||
@@ -829,11 +840,9 @@ static void fixFunctions(SgFile* file, const vector<SgStatement*>& programUnits,
|
||||
bool needChange = getNamesOldToNew(newDecl, common.second, namesOldToNew);
|
||||
if (!needChange)
|
||||
continue;
|
||||
|
||||
makeCommVarSymbs(newDecl, file, firstSt, commName, newVarSymbs, needNewDecl);
|
||||
commListExprs[commName] = makeExprListForCommon(newDecl, newVarSymbs, file, firstSt);
|
||||
}
|
||||
|
||||
if (!commListExprs.empty())
|
||||
{
|
||||
for (const auto& item : commListExprs)
|
||||
@@ -847,9 +856,10 @@ static void fixFunctions(SgFile* file, const vector<SgStatement*>& programUnits,
|
||||
}
|
||||
}
|
||||
|
||||
static void buildNewCommDecls(SgFile* file, const map<string, CommonBlock*>& allCommonBlocks,
|
||||
map<string, deque<CommConstraint>>& newCommonDecls, map<string, map<string, deque<CommConstraint>>>& commDecls,
|
||||
set<string>& badCommon, map<string, set<string>>& notUsedVars, vector<SgStatement*>& programUnits)
|
||||
|
||||
void BuildNewCommDecls(SgFile* file, const map<string, CommonBlock*> allCommonBlocks,
|
||||
map<string, deque<CommConstraint>>& newCommonDecls, map<string, map<string, deque<CommConstraint>>>& commDecls,
|
||||
set<string>& badCommon, map<string, set<string>>& notUsedVars, vector<SgStatement*>& programUnits)
|
||||
{
|
||||
string fileName = file->filename();
|
||||
SgStatement* curSt = file->firstStatement();
|
||||
@@ -888,8 +898,7 @@ static void buildNewCommDecls(SgFile* file, const map<string, CommonBlock*>& all
|
||||
constraints.push_back(newConstr);
|
||||
}
|
||||
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().getLineNum());
|
||||
__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);
|
||||
if (hasChar)
|
||||
{
|
||||
badCommon.insert(commName);
|
||||
@@ -906,7 +915,7 @@ static void buildNewCommDecls(SgFile* file, const map<string, CommonBlock*>& all
|
||||
for (auto x : problemConstraints.first.uses) // TODO: make proper warning message
|
||||
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",
|
||||
x.getVarName(), y.getVarName(), commName.c_str(), x.getFileName(), x.getLineNum(), y.getFileName(), y.getLineNum());
|
||||
x.varName.c_str(), y.varName.c_str(), commName.c_str(), x.fileName.c_str(), x.lineNum, y.fileName.c_str(), y.lineNum);
|
||||
}
|
||||
}
|
||||
curSt = curSt->lastNodeOfStmt();
|
||||
@@ -918,7 +927,7 @@ static void buildNewCommDecls(SgFile* file, const map<string, CommonBlock*>& all
|
||||
|
||||
|
||||
// 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();
|
||||
map<string, map<string, map<string, deque<CommConstraint>>>> commDecls; // file_name -> function_name -> common block name -> old declaration of common block
|
||||
@@ -932,12 +941,10 @@ void fixCommonBlocks(const map<string, vector<FuncInfo*>>& allFuncInfo, const ma
|
||||
SgFile* file = &project->file(i);
|
||||
string fileName = file->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)
|
||||
fixNames(elem.second, elem.first);
|
||||
|
||||
for (int i = 0; i < filesNum; i++) // second step
|
||||
{
|
||||
SgFile* file = &project->file(i);
|
||||
|
||||
@@ -16,18 +16,12 @@
|
||||
|
||||
struct DeclInfo // for error messages
|
||||
{
|
||||
private:
|
||||
std::string varName;
|
||||
std::string fileName;
|
||||
int lineNum;
|
||||
|
||||
public:
|
||||
DeclInfo() : varName(""), fileName(""), lineNum(0) {};
|
||||
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
|
||||
@@ -48,4 +42,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,7 +19,6 @@ using std::pair;
|
||||
using std::make_pair;
|
||||
using std::wstring;
|
||||
using std::stack;
|
||||
using SAPFOR::CFG_Settings;
|
||||
|
||||
#define PRINT_SPLITTED_FRAGMENTS 0
|
||||
|
||||
@@ -316,7 +315,7 @@ static map<SgStatement*, pair<set<SgStatement*>, set<SgStatement*>>>
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
map<SAPFOR::Argument*, set<int>> outForCurr;
|
||||
buildGenKillForCFG(itCFG->second, funcByName, outForFunc, gen, kill, &genForIR, &killForIR, notInitedGlobals, SAPFOR::CFG_Settings());
|
||||
buildGenKillForCFG(itCFG->second, funcByName, outForFunc, gen, kill, &genForIR, &killForIR, notInitedGlobals, SAPFOR::CFG_Settings(0));
|
||||
|
||||
if (outForFunc.count(byFunc))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
@@ -1052,8 +1051,7 @@ int splitLoops(SgFile *file, vector<LoopGraph*> &loopGraphs, vector<Messages> &m
|
||||
checkNull(listExp, convertFileName(__FILE__).c_str(), __LINE__);
|
||||
int deep = listExp->length();
|
||||
|
||||
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);
|
||||
currIR = buildCFGforCurrentFunc(loop->loop, SAPFOR::CFG_Settings(true, true), commonBlocks, allFuncInfo);
|
||||
totalErr = splitLoop(loop, messages, deep, depInfoForLoopGraph);
|
||||
|
||||
if (totalErr > 0)
|
||||
|
||||
@@ -13,7 +13,6 @@ using std::set;
|
||||
using std::string;
|
||||
using std::vector;
|
||||
using std::wstring;
|
||||
using SAPFOR::CFG_Settings;
|
||||
|
||||
using CFG_Type = map<FuncInfo*, vector<SAPFOR::BasicBlock*>>;
|
||||
using UsersDirectives = map<pair<string, int>, set<SgStatement*>>;
|
||||
@@ -2208,8 +2207,8 @@ static void removePrivateAnalyze(Context *ctx)
|
||||
makeDeclaration(ctx->loopStmt, vector<SgSymbol*> {receiverVar}, nullptr)
|
||||
));
|
||||
|
||||
const auto settings = CFG_Settings({ CFG_Settings::CFG_atLeastOneIterInLoop, CFG_Settings::CFG_withRD, CFG_Settings::CFG_withCallFrom, CFG_Settings::CFG_withDominators });
|
||||
CFG_Type CFG_ForFunc = buildCFGforCurrentFunc(ctx->loopStmt, settings,
|
||||
CFG_Type CFG_ForFunc = buildCFGforCurrentFunc(ctx->loopStmt,
|
||||
SAPFOR::CFG_Settings(true, true),
|
||||
ctx->commonBlocks, ctx->allFuncInfo);
|
||||
if (CFG_ForFunc.empty())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
@@ -206,9 +206,7 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
||||
|
||||
Pass(DEF_USE_STAGE1) <= Pass(DEF_USE_STAGE2);
|
||||
|
||||
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);
|
||||
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 });
|
||||
|
||||
Pass(BUILD_IR) <= Pass(SUBST_EXPR) <= Pass(SUBST_EXPR_AND_UNPARSE);
|
||||
|
||||
@@ -219,7 +217,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(FILL_COMMON_BLOCKS) <= Pass(GET_ALL_ARRAY_DECL) <= list({ CALL_GRAPH_IR, INSERT_NO_DISTR_FLAGS_FROM_GUI });
|
||||
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 });
|
||||
|
||||
@@ -229,7 +227,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_ALLOCATES, FILL_PARALLEL_REG_IR }) <= list({ FILL_COMMON_BLOCKS, GET_ALL_ARRAY_DECL, PARSE_OMP_DIRS }) <= Pass(PREPROC_SPF);
|
||||
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);
|
||||
|
||||
Pass(CHECK_PAR_REG_DIR) <= Pass(FILL_PARALLEL_REG_IR);
|
||||
|
||||
|
||||
@@ -934,14 +934,8 @@ void fillNonDistrArraysAsPrivate(SgStatement *st,
|
||||
{
|
||||
auto itD = declaredArrays.find(*itSet);
|
||||
if (itD != declaredArrays.end())
|
||||
{
|
||||
const auto array = itD->second.first;
|
||||
if (array->IsNotDistribute())
|
||||
{
|
||||
auto symb = array->GetDeclSymbol(make_pair(st->fileName(), st->lineNumber()));
|
||||
privatesVars.insert(symb->identifier());
|
||||
}
|
||||
}
|
||||
if (itD->second.first->IsNotDistribute())
|
||||
privatesVars.insert(itD->second.first->GetShortName());
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -959,21 +953,9 @@ DIST::Array* getArrayFromDeclarated(SgStatement *st, const string &arrayName)
|
||||
for (auto itSet = it->second.begin(); itSet != it->second.end() && !found; ++itSet)
|
||||
{
|
||||
auto itD = declaredArrays.find(*itSet);
|
||||
if (itD != declaredArrays.end())
|
||||
{
|
||||
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;
|
||||
}
|
||||
}
|
||||
if (itD != declaredArrays.end())
|
||||
if (itD->second.first->GetShortName() == arrayName)
|
||||
found = itD->second.first;
|
||||
}
|
||||
}
|
||||
return found;
|
||||
@@ -1282,32 +1264,6 @@ static SgExpression* isInCommon(const vector<SgExpression*> &commonBlocks, const
|
||||
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;
|
||||
tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>> &commonBlocks, SgStatement *decl, SgSymbol *symb)
|
||||
{
|
||||
@@ -1316,7 +1272,6 @@ tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>>
|
||||
int commonPos = 0;
|
||||
|
||||
SgExpression *foundCommon = NULL;
|
||||
string symbCommn = "";
|
||||
|
||||
SgStatement *declCP = decl->controlParent();
|
||||
// find symbol in parameter list of functions
|
||||
@@ -1352,7 +1307,6 @@ tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>>
|
||||
if (foundCommon)
|
||||
{
|
||||
inCommon = true;
|
||||
symbCommn = getCommonNameOnPos(common.first, commonPos);
|
||||
break;
|
||||
}
|
||||
}
|
||||
@@ -1360,7 +1314,7 @@ tuple<int, string, string> getUniqName(const map<string, vector<SgExpression*>>
|
||||
|
||||
tuple<int, string, string> retVal;
|
||||
if (inCommon)
|
||||
retVal = make_tuple(commonPos, string("common_") + getCommonName(foundCommon), symbCommn);
|
||||
retVal = make_tuple(commonPos, string("common_") + getCommonName(foundCommon), string(symb->identifier()));
|
||||
else
|
||||
retVal = make_tuple(decl->lineNumber(), string(decl->fileName()), string(symb->identifier()));
|
||||
|
||||
|
||||
@@ -337,15 +337,10 @@ const set<SgSymbol*>& getModuleSymbols(SgStatement *func)
|
||||
//if function or module in contains
|
||||
auto cp = func->controlParent();
|
||||
if (isSgProgHedrStmt(cp) || cp->variant() == MODULE_STMT)
|
||||
{
|
||||
getModuleSymbols(cp, symbs);
|
||||
|
||||
if (func->variant() == FUNC_HEDR)
|
||||
symbs.insert(func->symbol());
|
||||
}
|
||||
|
||||
symbolsForFunc[func->symbol()->identifier()] = symbs;
|
||||
return symbolsForFunc[func->symbol()->identifier()];
|
||||
return symbs;
|
||||
}
|
||||
|
||||
static void findSymbol(SgStatement* func, const string& varName, const string& locName,
|
||||
@@ -354,19 +349,9 @@ static void findSymbol(SgStatement* func, const string& varName, const string& l
|
||||
for (const auto& s : getModuleSymbols(func))
|
||||
{
|
||||
SgSymbol* orig = OriginalSymbol(s);
|
||||
printf("%s == %s\n", orig->identifier(), s->identifier());
|
||||
//any suitable symbol can be used
|
||||
|
||||
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;
|
||||
}
|
||||
if (orig->identifier() == varName && orig->scope()->symbol()->identifier() == locName)
|
||||
altNames[s->identifier()] = s;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -384,7 +369,6 @@ SgSymbol* getNameInLocation(SgStatement* func, const string& varName, const stri
|
||||
return altNames.begin()->second;
|
||||
else {
|
||||
__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__);
|
||||
}
|
||||
|
||||
|
||||
@@ -569,8 +569,8 @@ void copyIncludes(const set<string> &allIncludeFiles, const map<string, map<int,
|
||||
|
||||
while (!feof(oldFile))
|
||||
{
|
||||
char buf[16384];
|
||||
char *res = fgets(buf, sizeof(buf), oldFile);
|
||||
char buf[8192];
|
||||
char *res = fgets(buf, 16384, oldFile);
|
||||
if (res == NULL)
|
||||
break;
|
||||
|
||||
|
||||
@@ -1,3 +1,3 @@
|
||||
#pragma once
|
||||
|
||||
#define VERSION_SPF "2465"
|
||||
#define VERSION_SPF "2453"
|
||||
|
||||
@@ -152,7 +152,7 @@ static void setOptions(const short* options, bool isBuildParallel = false, const
|
||||
intOptions[z] = -1;
|
||||
}
|
||||
|
||||
//staticShadowAnalysis = intOptions[STATIC_SHADOW_ANALYSIS];
|
||||
staticShadowAnalysis = intOptions[STATIC_SHADOW_ANALYSIS];
|
||||
staticPrivateAnalysis = intOptions[STATIC_PRIVATE_ANALYSIS];
|
||||
out_free_form = intOptions[FREE_FORM];
|
||||
if (out_free_form == 1)
|
||||
|
||||
Reference in New Issue
Block a user