Compare commits
71 Commits
a7764847c4
...
private_ar
| Author | SHA1 | Date | |
|---|---|---|---|
| 9ac15eec79 | |||
| 03f565f50b | |||
| 47e2b961e2 | |||
|
|
b95b336372 | ||
| f35d7cb4bd | |||
| 54615e34d4 | |||
| 8752f4a139 | |||
| 453105d273 | |||
| cad0a0b217 | |||
| 9c0fd40e7b | |||
| c7a31c8bbb | |||
|
|
9900929349 | ||
|
|
e1ba299159 | ||
|
|
8de18d1788 | ||
| 06aabdbee6 | |||
|
|
c6f290bb56 | ||
| 49d3b9b96e | |||
| 280beb13cc | |||
| 3bc9351641 | |||
| 16b2c6b42b | |||
| fe31df0ef2 | |||
|
|
4c8681bfe2 | ||
|
|
d330a6ee23 | ||
|
|
b439759e9b | ||
| b11973cb64 | |||
|
|
df9a9a30bb | ||
|
|
2cd02c295f | ||
|
|
278fc1ff9c | ||
|
|
80eac5b957 | ||
|
|
0c9eed4bb7 | ||
|
|
d3d6d0bec7 | ||
|
|
3095510826 | ||
|
|
85e2a60183 | ||
|
|
68bd21b7b0 | ||
|
|
177433a95b | ||
|
|
29ece9072e | ||
|
|
feafa43f32 | ||
|
|
b8f429256f | ||
|
|
2f53d6ae2e | ||
|
|
65237e4d63 | ||
|
|
7533739488 | ||
| c1d31b809b | |||
| 537f3eb6e9 | |||
| f5f99f6e8a | |||
|
|
fc47a1685c | ||
| 383d8df826 | |||
| ebc5a1cbc1 | |||
|
|
0eee799867 | ||
|
|
50dd54cec1 | ||
|
|
6a59bc0e09 | ||
|
|
9e777ceeab | ||
|
|
10636427ed | ||
|
|
a0704038db | ||
| 623f6c0d73 | |||
|
|
622159cba6 | ||
|
|
db26a2c332 | ||
|
|
8ad19cbfa5 | ||
|
|
1895a4b02a | ||
|
|
623898d913 | ||
|
|
a96a4bcaa6 | ||
| ae9cc2bf3b | |||
| c6a0c73287 | |||
| b454858647 | |||
|
|
ad99446b12 | ||
|
|
d3e8c481d2 | ||
| 4e16638c36 | |||
| 6742932862 | |||
| 8b2e59356a | |||
| f9d52c0c3e | |||
| 537d60222f | |||
| 4eb057731f |
@@ -12,6 +12,7 @@ add_definitions("-D SYS5")
|
||||
add_definitions("-D YYDEBUG")
|
||||
|
||||
set(CMAKE_CXX_STANDARD 17)
|
||||
set(CMAKE_C_STANDARD 17)
|
||||
|
||||
set(fdvm_include projects/dvm/fdvmh/include/fdvmh/)
|
||||
set(fdvm_sources projects/dvm/fdvmh/tools/fdvmh/)
|
||||
@@ -33,6 +34,7 @@ include_directories(src/Distribution)
|
||||
include_directories(src/GraphCall)
|
||||
include_directories(src/GraphLoop)
|
||||
include_directories(src/Transformations/ExpressionSubstitution)
|
||||
include_directories(src/Transformations)
|
||||
|
||||
#Sage lib includes
|
||||
include_directories(${fdvm_include})
|
||||
@@ -228,6 +230,8 @@ set(TRANSFORMS
|
||||
|
||||
set(CFG src/CFGraph/IR.cpp
|
||||
src/CFGraph/IR.h
|
||||
src/CFGraph/IR_domTree.cpp
|
||||
src/CFGraph/IR_domTree.h
|
||||
src/CFGraph/CFGraph.cpp
|
||||
src/CFGraph/CFGraph.h
|
||||
src/CFGraph/RD_subst.cpp
|
||||
@@ -492,7 +496,9 @@ else()
|
||||
else()
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
|
||||
endif()
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O2")
|
||||
if(NOT CMAKE_BUILD_TYPE)
|
||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O3")
|
||||
endif()
|
||||
endif()
|
||||
|
||||
add_subdirectory(projects/Fdvm)
|
||||
|
||||
Submodule projects/dvm updated: 3a567d7582...4d4041a081
@@ -1149,9 +1149,22 @@ map<FuncInfo*, vector<BBlock*>> buildCFG(const map<string, CommonBlock*>& common
|
||||
if (settings.withRD)
|
||||
buildReachingDefs(result, settings);
|
||||
|
||||
if (settings.withDominators)
|
||||
{
|
||||
auto t = high_resolution_clock::now();
|
||||
for (auto& [func, bblocks] : result)
|
||||
SAPFOR::buildDominatorTree(bblocks);
|
||||
|
||||
auto msec = duration_cast<milliseconds>(high_resolution_clock::now() - t).count();
|
||||
__spf_print(1, " dominator build time is %.3f sec\n", msec / 1000.);
|
||||
}
|
||||
|
||||
if (SgFile::switchToFile(oldFile) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
for (auto& [func, blocks] : result)
|
||||
removedUnreachableBlocks(blocks);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
@@ -1227,3 +1240,48 @@ map<FuncInfo*, vector<SAPFOR::BasicBlock*>>
|
||||
|
||||
return buildCFG(commonBlocks, fileFuncInfoMap, settings);
|
||||
}
|
||||
|
||||
|
||||
void removedUnreachableBlocks(vector<SAPFOR::BasicBlock*>& blocks)
|
||||
{
|
||||
set<SAPFOR::BasicBlock*> reachable;
|
||||
|
||||
for (auto& b : blocks)
|
||||
if (b->getInstructions().front()->isHeader() ||
|
||||
b->getInstructions().front()->getInstruction()->getOperation() == SAPFOR::CFG_OP::ENTRY)
|
||||
reachable.insert(b);
|
||||
|
||||
set<SAPFOR::BasicBlock*> worklist = reachable;
|
||||
while (worklist.size() != 0)
|
||||
{
|
||||
set<SAPFOR::BasicBlock*> to_insert;
|
||||
|
||||
for (auto& b : worklist)
|
||||
for (auto& next : b->getNext())
|
||||
if (reachable.insert(next).second)
|
||||
to_insert.insert(next);
|
||||
|
||||
worklist = to_insert;
|
||||
}
|
||||
|
||||
auto remove_unreachable_it = remove_if(blocks.begin(), blocks.end(),
|
||||
[&reachable](SAPFOR::BasicBlock* b)
|
||||
{
|
||||
if (reachable.find(b) == reachable.end())
|
||||
{
|
||||
for (auto& next : b->getNext())
|
||||
if (reachable.find(next) != reachable.end())
|
||||
next->removePrev(b);
|
||||
|
||||
delete b;
|
||||
return true;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
);
|
||||
|
||||
reachable.clear();
|
||||
|
||||
blocks.erase(remove_unreachable_it, blocks.end());
|
||||
}
|
||||
@@ -6,6 +6,7 @@
|
||||
#include <vector>
|
||||
|
||||
#include "IR.h"
|
||||
#include "IR_domTree.h"
|
||||
|
||||
namespace SAPFOR
|
||||
{
|
||||
@@ -24,7 +25,7 @@ namespace SAPFOR
|
||||
|
||||
std::vector<BasicBlock*> next;
|
||||
std::vector<BasicBlock*> prev;
|
||||
|
||||
BasicBlock* directDominator = NULL;
|
||||
//reaching definition
|
||||
std::map<SAPFOR::Argument*, std::set<int>> RD_in, RD_out;
|
||||
|
||||
@@ -34,6 +35,7 @@ namespace SAPFOR
|
||||
bool addLive(const std::map<SAPFOR::Argument*, std::vector<SAPFOR::BasicBlock*>>& to_add, bool in);
|
||||
std::map<SAPFOR::Argument*, std::vector<SAPFOR::BasicBlock*>> getLive(bool in) const;
|
||||
bool removeLive(SAPFOR::Argument* to_remove, bool in);
|
||||
|
||||
public:
|
||||
BasicBlock() { num = lastNumBlock++; }
|
||||
BasicBlock(IR_Block* item);
|
||||
@@ -42,6 +44,7 @@ namespace SAPFOR
|
||||
void addInstruction(IR_Block* item);
|
||||
void addPrev(BasicBlock* prev_) { prev.push_back(prev_); }
|
||||
void addNext(BasicBlock* next_) { next.push_back(next_); }
|
||||
void setDom(BasicBlock* dom) { directDominator = dom; }
|
||||
|
||||
int removePrev(BasicBlock* removed);
|
||||
int removeNext(BasicBlock* removed);
|
||||
@@ -69,6 +72,10 @@ namespace SAPFOR
|
||||
const std::vector<IR_Block*>& getInstructions() const { return instructions; }
|
||||
const std::vector<BasicBlock*>& getNext() const { return next; }
|
||||
const std::vector<BasicBlock*>& getPrev() const { return prev; }
|
||||
BasicBlock* getDom() const
|
||||
{
|
||||
return directDominator;
|
||||
}
|
||||
|
||||
/*
|
||||
* FOR LIVE ANALYSIS
|
||||
@@ -105,13 +112,15 @@ namespace SAPFOR
|
||||
bool withDVM = false;
|
||||
bool withCallsInBlocks = false; // separate each F_CALL to own BasicBlock
|
||||
bool withCallFrom = true;
|
||||
bool withDominators = true;
|
||||
|
||||
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 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)
|
||||
withCallsInBlocks(withCallsInBlocks), withCallFrom(withCallFrom), withDominators(withDominators)
|
||||
{ }
|
||||
};
|
||||
}
|
||||
@@ -147,3 +156,5 @@ static inline void deleteCFG(std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*
|
||||
}
|
||||
cfg.clear();
|
||||
}
|
||||
|
||||
void removedUnreachableBlocks(std::vector<SAPFOR::BasicBlock*>& blocks);
|
||||
|
||||
102
src/CFGraph/IR_domTree.cpp
Normal file
102
src/CFGraph/IR_domTree.cpp
Normal file
@@ -0,0 +1,102 @@
|
||||
#include "dvm.h"
|
||||
#include "IR_domTree.h"
|
||||
|
||||
namespace SAPFOR {
|
||||
void DominatorFinder::DFS(BasicBlock* v, int parent_num) {
|
||||
dfs_num[v] = n;
|
||||
vertex[n] = n;
|
||||
semi[n] = n;
|
||||
label[n] = n;
|
||||
ancestor[n] = -1;
|
||||
parent[n] = parent_num;
|
||||
vertices[n++] = v;
|
||||
|
||||
for (const auto& w : v->getNext()) {
|
||||
if (dfs_num[w] == -1)
|
||||
DFS(w, dfs_num[v]);
|
||||
}
|
||||
}
|
||||
|
||||
void DominatorFinder::Compress(int v) {
|
||||
if (ancestor[ancestor[v]] != -1) {
|
||||
Compress(ancestor[v]);
|
||||
|
||||
if (semi[label[ancestor[v]]] < semi[label[v]])
|
||||
label[v] = label[ancestor[v]];
|
||||
ancestor[v] = ancestor[ancestor[v]];
|
||||
}
|
||||
}
|
||||
|
||||
int DominatorFinder::Eval(int v) {
|
||||
if (ancestor[v] == -1)
|
||||
return v;
|
||||
|
||||
Compress(v);
|
||||
return label[v];
|
||||
}
|
||||
|
||||
void DominatorFinder::Link(int v, int w) {
|
||||
ancestor[w] = v;
|
||||
}
|
||||
|
||||
DominatorFinder::DominatorFinder(std::vector<BasicBlock*>& blocks) {
|
||||
if (blocks.empty())
|
||||
return;
|
||||
|
||||
entry = blocks[0];
|
||||
n = 0;
|
||||
|
||||
for (auto block : blocks)
|
||||
dfs_num[block] = -1;
|
||||
|
||||
int max_size = blocks.size();
|
||||
vertices.resize(max_size);
|
||||
parent.assign(max_size, -1);
|
||||
semi.assign(max_size, -1);
|
||||
vertex.assign(max_size, -1);
|
||||
ancestor.assign(max_size, -1);
|
||||
label.assign(max_size, -1);
|
||||
bucket.resize(max_size);
|
||||
|
||||
DFS(entry, -1);
|
||||
|
||||
for (int i = n - 1; i > 0; --i) {
|
||||
int w = vertex[i];
|
||||
|
||||
for (BasicBlock* v : vertices[w]->getPrev()) {
|
||||
if (dfs_num[v] == -1)
|
||||
continue;
|
||||
int u = Eval(dfs_num[v]);
|
||||
|
||||
if (semi[u] < semi[w])
|
||||
semi[w] = semi[u];
|
||||
}
|
||||
|
||||
bucket[vertex[semi[w]]].push_back(w);
|
||||
Link(parent[w], w);
|
||||
|
||||
for (int v : bucket[parent[w]])
|
||||
{
|
||||
int u = Eval(v);
|
||||
if (semi[u] < semi[v])
|
||||
vertices[v]->setDom(vertices[u]);
|
||||
else
|
||||
vertices[v]->setDom(vertices[parent[w]]);
|
||||
}
|
||||
bucket[parent[w]].clear();
|
||||
}
|
||||
|
||||
for (int i = 1; i < n; ++i) {
|
||||
int w = vertex[i];
|
||||
|
||||
if (vertices[w]->getDom() != vertices[vertex[semi[w]]])
|
||||
vertices[w]->setDom(vertices[w]->getDom()->getDom());
|
||||
}
|
||||
|
||||
entry->setDom(nullptr);
|
||||
}
|
||||
|
||||
void buildDominatorTree(std::vector<BasicBlock*>& blocks) {
|
||||
DominatorFinder finder(blocks);
|
||||
}
|
||||
}
|
||||
35
src/CFGraph/IR_domTree.h
Normal file
35
src/CFGraph/IR_domTree.h
Normal file
@@ -0,0 +1,35 @@
|
||||
#pragma once
|
||||
|
||||
#include <vector>
|
||||
#include <map>
|
||||
#include <unordered_map>
|
||||
|
||||
#include "CFGraph.h"
|
||||
|
||||
// Lengauer, Thomas. A fast algorithm for finding dominators in a flowgraph / Thomas Lengauer, Robert Endre Tarjan
|
||||
// ACM Transactions on Programming Languages and Systems (TOPLAS). <20> 1979. <20> Vol. 1, no. 1. <20> Pp. 121<32>141.
|
||||
|
||||
namespace SAPFOR {
|
||||
|
||||
class BasicBlock;
|
||||
|
||||
class DominatorFinder {
|
||||
private:
|
||||
BasicBlock* entry;
|
||||
std::vector<BasicBlock*> vertices;
|
||||
std::unordered_map<BasicBlock*, int> dfs_num;
|
||||
std::vector<int> parent, semi, vertex, ancestor, label;
|
||||
std::vector<std::vector<int>> bucket;
|
||||
int n;
|
||||
|
||||
void DFS(BasicBlock* v, int parent_num);
|
||||
void Compress(int v);
|
||||
int Eval(int v);
|
||||
void Link(int v, int w);
|
||||
|
||||
public:
|
||||
DominatorFinder(std::vector<BasicBlock*>& blocks);
|
||||
};
|
||||
|
||||
void buildDominatorTree(std::vector<BasicBlock*>& blocks);
|
||||
}
|
||||
@@ -250,7 +250,7 @@ static set<SAPFOR::BasicBlock*> analyzeLoop(LoopGraph* loop, const set<SAPFOR::B
|
||||
const map<string, SgSymbol*>& commonArgs, FuncInfo* func,
|
||||
map<string, vector<Messages>>& messages)
|
||||
{
|
||||
if (!loop->isFor)
|
||||
if (!loop->isFor())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); //should be called only with FOR loops
|
||||
|
||||
SgStatement* loop_operator = loop->loop->GetOriginal();
|
||||
@@ -450,7 +450,7 @@ static void recAnalyzeLoop(LoopGraph* loop, const set<SAPFOR::BasicBlock*>& bloc
|
||||
const map<string, SgSymbol*>& commonArgs,
|
||||
FuncInfo* func, map<string, vector<Messages>>& messages)
|
||||
{
|
||||
const auto& loop_body = loop->isFor ? analyzeLoop(loop, blocks, commonVars, commonArgs, func, messages) : blocks;
|
||||
const auto& loop_body = loop->isFor() ? analyzeLoop(loop, blocks, commonVars, commonArgs, func, messages) : blocks;
|
||||
|
||||
for (const auto& inner_loop : loop->children)
|
||||
recAnalyzeLoop(inner_loop, loop_body, commonVars, commonArgs, func, messages);
|
||||
|
||||
@@ -22,7 +22,7 @@
|
||||
#include "SgUtils.h"
|
||||
#include "../Sapfor.h"
|
||||
#include "graph_loops_func.h"
|
||||
#include "../Transformations/LoopNesting/loop_transform.h"
|
||||
#include "LoopNesting/loop_transform.h"
|
||||
#include "expr_transform.h"
|
||||
#include "graph_calls_func.h"
|
||||
|
||||
|
||||
@@ -10,7 +10,7 @@
|
||||
|
||||
#include "../ParallelizationRegions/ParRegions.h"
|
||||
#include "../Distribution/Arrays.h"
|
||||
#include "../Transformations/LoopNesting/loop_transform.h"
|
||||
#include "LoopNesting/loop_transform.h"
|
||||
|
||||
#include "errors.h"
|
||||
#include "directive_parser.h"
|
||||
@@ -75,7 +75,7 @@ static LoopGraph* createDirectiveForLoop(LoopGraph *currentLoop, MapToArray &mai
|
||||
}
|
||||
}
|
||||
|
||||
directive->parallel.push_back(currentLoop->loopSymbol);
|
||||
directive->parallel.push_back(currentLoop->loopSymbol());
|
||||
directive->arrayRef = mainArray.arrayRef;
|
||||
|
||||
DIST::Array *tmp = mainArray.arrayRef;
|
||||
@@ -84,7 +84,7 @@ static LoopGraph* createDirectiveForLoop(LoopGraph *currentLoop, MapToArray &mai
|
||||
for (int i = 0; i < tmp->GetDimSize(); ++i)
|
||||
{
|
||||
if (i == pos)
|
||||
directive->on.push_back(make_pair(currentLoop->loopSymbol, mainAccess));
|
||||
directive->on.push_back(make_pair(currentLoop->loopSymbol(), mainAccess));
|
||||
else
|
||||
directive->on.push_back(make_pair("*", make_pair(0, 0)));
|
||||
}
|
||||
@@ -808,7 +808,7 @@ void createParallelDirectives(const map<LoopGraph*, map<DIST::Array*, ArrayInfo*
|
||||
for (int i = 0; i < mainArrayOfLoop->GetDimSize(); ++i)
|
||||
{
|
||||
if (i == dimPos)
|
||||
parDir->on2.push_back(make_pair(currLoop->loopSymbol, mainAccess));
|
||||
parDir->on2.push_back(make_pair(currLoop->loopSymbol(), mainAccess));
|
||||
else
|
||||
parDir->on2.push_back(make_pair("*", make_pair(0, 0)));
|
||||
}
|
||||
@@ -1100,7 +1100,7 @@ static bool tryToResolveUnmatchedDims(const map<DIST::Array*, vector<bool>> &dim
|
||||
LoopGraph* tmpL = loop;
|
||||
for (int z = 0; z < nested; ++z)
|
||||
{
|
||||
deprecateToMatch.insert(tmpL->loopSymbol);
|
||||
deprecateToMatch.insert(tmpL->loopSymbol());
|
||||
if (tmpL->children.size())
|
||||
tmpL = tmpL->children[0];
|
||||
else if (z != nested - 1)
|
||||
@@ -1113,7 +1113,7 @@ static bool tryToResolveUnmatchedDims(const map<DIST::Array*, vector<bool>> &dim
|
||||
tmpL = loop->parent;
|
||||
while (tmpL)
|
||||
{
|
||||
if (!tmpL->isFor) // TODO: need to add all inductive variables!
|
||||
if (tmpL->isWhile()) // TODO: need to add all inductive variables!
|
||||
{
|
||||
SgWhileStmt* dow = isSgWhileStmt(tmpL->loop->GetOriginal());
|
||||
if (dow->conditional())
|
||||
@@ -1124,7 +1124,7 @@ static bool tryToResolveUnmatchedDims(const map<DIST::Array*, vector<bool>> &dim
|
||||
}
|
||||
}
|
||||
else
|
||||
deprecateToMatch.insert(tmpL->loopSymbol);
|
||||
deprecateToMatch.insert(tmpL->loopSymbol());
|
||||
tmpL = tmpL->parent;
|
||||
}
|
||||
|
||||
|
||||
@@ -15,7 +15,7 @@
|
||||
#include "SgUtils.h"
|
||||
#include "expr_transform.h"
|
||||
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
#include "shadow.h"
|
||||
#include "dvm.h"
|
||||
|
||||
@@ -241,13 +241,15 @@ static void findArrayRefs (SgExpression* ex, SgStatement* st, string fName, int
|
||||
itNew->second.first->SetRegionPlace(reg);
|
||||
|
||||
const auto oldVal = itNew->second.first->GetDistributeFlagVal();
|
||||
bool isarrayInModule = (itNew->second.first->GetLocation().first == DIST::l_MODULE);
|
||||
bool isArrayInModule = (itNew->second.first->GetLocation().first == DIST::l_MODULE);
|
||||
|
||||
if (oldVal == DIST::DISTR || oldVal == DIST::NO_DISTR)
|
||||
{
|
||||
if (itNew->second.first->IsOmpThreadPrivate())
|
||||
itNew->second.first->SetDistributeFlag(DIST::SPF_PRIV);
|
||||
else if (privates.find(symb->identifier()) != privates.end() || isarrayInModule)
|
||||
else if (deprecatedByIO.find(symb->identifier()) != deprecatedByIO.end())
|
||||
itNew->second.first->SetDistributeFlag(DIST::IO_PRIV);
|
||||
else if (isArrayInModule || privates.find(symb->identifier()) != privates.end())
|
||||
{
|
||||
//check in module
|
||||
if (itNew->second.first->GetLocation().first == DIST::l_MODULE)
|
||||
@@ -274,8 +276,6 @@ static void findArrayRefs (SgExpression* ex, SgStatement* st, string fName, int
|
||||
else
|
||||
itNew->second.first->SetDistributeFlag(DIST::SPF_PRIV);
|
||||
}
|
||||
else if (deprecatedByIO.find(symb->identifier()) != deprecatedByIO.end())
|
||||
itNew->second.first->SetDistributeFlag(DIST::IO_PRIV);
|
||||
else if (isSgConstantSymb(symb) || inDataStat)
|
||||
itNew->second.first->SetDistributeFlag(DIST::SPF_PRIV);
|
||||
else
|
||||
|
||||
@@ -455,15 +455,7 @@ namespace Distribution
|
||||
}
|
||||
|
||||
if (needPrint)
|
||||
{
|
||||
#if _WIN32
|
||||
wstring treeM = L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " + std::to_wstring(k + 1) + L"/" + std::to_wstring(AllCycles.size());
|
||||
#else
|
||||
wstring treeM = L"conflict resolution, processing group " + std::to_wstring(k + 1) + L"/" + std::to_wstring(AllCycles.size());
|
||||
#endif
|
||||
sendMessage_2lvl(treeM);
|
||||
|
||||
}
|
||||
sendMessage_2lvl(4, k, (int)AllCycles.size());
|
||||
|
||||
auto timeR = steady_clock::now();
|
||||
if (countConflicts != 0)
|
||||
@@ -516,7 +508,7 @@ namespace Distribution
|
||||
}
|
||||
|
||||
if (needPrint)
|
||||
sendMessage_2lvl(L"");
|
||||
sendMessage_2lvl(2);
|
||||
|
||||
return make_pair(allOnlySecondType, globalSum);
|
||||
}
|
||||
@@ -572,13 +564,7 @@ namespace Distribution
|
||||
for (int z = 0; z < arraysV.size(); ++z)
|
||||
{
|
||||
const DIST::Array *array = arraysV[z];
|
||||
|
||||
#ifdef _WIN32
|
||||
wstring treeM = L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " + std::to_wstring(z + 1) + L"/" + std::to_wstring(arrays.size());
|
||||
#else
|
||||
wstring treeM = L"conflict resolution, processing array " + std::to_wstring(z + 1) + L"/" + std::to_wstring(arrays.size());
|
||||
#endif
|
||||
sendMessage_2lvl(treeM);
|
||||
sendMessage_2lvl(5, z, (int)arrays.size());
|
||||
|
||||
vector<vType> verts;
|
||||
|
||||
@@ -605,7 +591,7 @@ namespace Distribution
|
||||
}
|
||||
}
|
||||
}
|
||||
sendMessage_2lvl(L"");
|
||||
sendMessage_2lvl(2);
|
||||
}
|
||||
else
|
||||
{
|
||||
|
||||
@@ -346,7 +346,7 @@ static vector<SgExpression*>
|
||||
{
|
||||
needToAdd = true;
|
||||
dim_found = true;
|
||||
subs[i] = new SgVarRefExp(findSymbolOrCreate(file, currLoop->loopSymbol));
|
||||
subs[i] = new SgVarRefExp(findSymbolOrCreate(file, currLoop->loopSymbol()));
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -830,13 +830,13 @@ namespace Distribution
|
||||
color[k] = WHITE;
|
||||
|
||||
findFrom = currentV;
|
||||
#ifdef _WIN32
|
||||
/*#ifdef _WIN32
|
||||
if (needPrint)
|
||||
{
|
||||
wstring vertexM = std::to_wstring(k + 1) + L"/" + std::to_wstring(vertByTrees[t].size());
|
||||
sendMessage_2lvl(wstring(L"<22><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> ") + wstring(treeM.begin(), treeM.end()) + L" <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " + wstring(vertexM.begin(), vertexM.end()));
|
||||
}
|
||||
#endif
|
||||
#endif*/
|
||||
__spf_print(PRINT_TIMES && needPrint, "v (tree %d) = %d (with neighb %d) ", t, i, neighbors[i + 1] - neighbors[i]);
|
||||
activeV[activeCounter++] = currentV;
|
||||
FindLoop(cyclesTmp[t], currentV, currentV, numbers);
|
||||
@@ -847,8 +847,8 @@ namespace Distribution
|
||||
maxLoopDim = wasMaxLoopDim;
|
||||
}
|
||||
|
||||
if (needPrint)
|
||||
sendMessage_2lvl(L"");
|
||||
/*if (needPrint)
|
||||
sendMessage_2lvl(2);*/
|
||||
}
|
||||
catch (int code)
|
||||
{
|
||||
|
||||
@@ -11,9 +11,9 @@
|
||||
#include "DvmhRegionInserter.h"
|
||||
#include "DvmhRegions/RegionsMerger.h"
|
||||
#include "../VerificationCode/verifications.h"
|
||||
#include "../Transformations/FunctionPurifying/function_purifying.h"
|
||||
#include "../LoopAnalyzer/loop_analyzer.h"
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "FunctionPurifying/function_purifying.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
@@ -794,154 +794,6 @@ ArraySet DvmhRegionInserter::get_used_arrs_for_block(SgStatement* st, int usage_
|
||||
return usages;
|
||||
}
|
||||
|
||||
static bool filterFromList(SgStatement* st, const set<string>& idents, bool exclude = false)
|
||||
{
|
||||
bool empty = false;
|
||||
SgExpression* list = st->expr(0);
|
||||
vector<SgExpression*> newList;
|
||||
|
||||
int total = 0;
|
||||
while (list)
|
||||
{
|
||||
if (exclude)
|
||||
{
|
||||
if (idents.find(list->lhs()->symbol()->identifier()) == idents.end())
|
||||
newList.push_back(list->lhs());
|
||||
}
|
||||
else
|
||||
{
|
||||
if (idents.find(list->lhs()->symbol()->identifier()) != idents.end())
|
||||
newList.push_back(list->lhs());
|
||||
}
|
||||
total++;
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (newList.size() == 0)
|
||||
empty = true;
|
||||
else if (total != newList.size())
|
||||
st->setExpression(0, makeExprList(newList));
|
||||
|
||||
return empty;
|
||||
}
|
||||
|
||||
static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
|
||||
{
|
||||
string oldFile = current_file->filename();
|
||||
if (!func->switchToFile())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto copy = duplicateProcedure(func, NULL, false, false, false, true);
|
||||
const set<string> idents(pars.identificators.begin(), pars.identificators.end());
|
||||
|
||||
bool need = (func->symbol()->identifier() == string("bl182"));
|
||||
|
||||
//remove all exec
|
||||
SgStatement* st = copy->lexNext();
|
||||
SgStatement* last = copy->lastNodeOfStmt();
|
||||
vector<SgStatement*> toExtract;
|
||||
|
||||
while (st != last)
|
||||
{
|
||||
if (isDVM_stat(st) || isSPF_stat(st))
|
||||
{
|
||||
if (st->variant() != ACC_ROUTINE_DIR)
|
||||
{
|
||||
toExtract.push_back(st);
|
||||
st = st->lexNext();
|
||||
}
|
||||
else
|
||||
st = st->lexNext();
|
||||
}
|
||||
else if (isSgExecutableStatement(st))
|
||||
{
|
||||
SgStatement* next = st->lastNodeOfStmt();
|
||||
if (next != last)
|
||||
next = next->lexNext();
|
||||
toExtract.push_back(st);
|
||||
st = next;
|
||||
}
|
||||
else
|
||||
st = st->lexNext();
|
||||
}
|
||||
|
||||
//remove unused declarations
|
||||
st = copy->lexNext();
|
||||
while (st != last)
|
||||
{
|
||||
const int var = st->variant();
|
||||
|
||||
if (var == VAR_DECL
|
||||
|| var == VAR_DECL_90
|
||||
|| var == DIM_STAT
|
||||
|| var == INTENT_STMT
|
||||
|| var == EXTERN_STAT)
|
||||
{
|
||||
bool empty = filterFromList(st, idents);
|
||||
if (empty)
|
||||
{
|
||||
toExtract.push_back(st);
|
||||
st = st->lexNext();
|
||||
continue;
|
||||
}
|
||||
}
|
||||
else if (!isDVM_stat(st) && !isSPF_stat(st))
|
||||
toExtract.push_back(st);
|
||||
|
||||
if (st->variant() == CONTAINS_STMT)
|
||||
break;
|
||||
st = st->lexNext();
|
||||
}
|
||||
|
||||
for (auto& elem : toExtract)
|
||||
elem->extractStmt();
|
||||
|
||||
string retVal = copy->unparse();
|
||||
|
||||
if (SgFile::switchToFile(oldFile) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
return retVal;
|
||||
}
|
||||
|
||||
static void insertInterface(SgStatement* func, const string& iface, const string& fName)
|
||||
{
|
||||
string oldFile = current_file->filename();
|
||||
if (!func->switchToFile())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
SgStatement* st = func->lexNext();
|
||||
SgStatement* last = func->lastNodeOfStmt();
|
||||
while (st != last)
|
||||
{
|
||||
if (st->variant() == VAR_DECL || st->variant() == VAR_DECL_90)
|
||||
{
|
||||
bool empty = filterFromList(st, { fName }, true);
|
||||
if (empty)
|
||||
{
|
||||
SgStatement* next = st->lexNext();
|
||||
st->extractStmt();
|
||||
st = next;
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (isSgExecutableStatement(st))
|
||||
break;
|
||||
st = st->lexNext();
|
||||
}
|
||||
SgStatement* ifaceBlock = new SgStatement(INTERFACE_STMT);
|
||||
addControlEndToStmt(ifaceBlock->thebif);
|
||||
|
||||
ifaceBlock->setlineNumber(getNextNegativeLineNumber()); // st->lineNumber()
|
||||
ifaceBlock->setFileName(st->fileName());
|
||||
st->insertStmtBefore(*ifaceBlock, *st->controlParent());
|
||||
ifaceBlock->lastNodeOfStmt()->addComment(iface.c_str());
|
||||
|
||||
if (SgFile::switchToFile(oldFile) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
}
|
||||
|
||||
static LoopGraph* getParallelLoop(LoopGraph* loop)
|
||||
{
|
||||
auto prev_st = loop->loop->lexPrev();
|
||||
@@ -1172,7 +1024,7 @@ static bool isPure(SgStatement* func)
|
||||
|
||||
void DvmhRegionInserter::createInterfaceBlockForOutCall(FuncInfo* func, FuncInfo* callFrom)
|
||||
{
|
||||
insertInterface(func->funcPointer, getInterfaceBlock(callFrom->funcPointer->GetOriginal(), callFrom->funcParams), callFrom->funcName);
|
||||
insertInterface(func->funcPointer, callFrom);
|
||||
}
|
||||
|
||||
void DvmhRegionInserter::createInterfaceBlockForParallelFunctions(bool onlyRoutine)
|
||||
@@ -1446,6 +1298,9 @@ static set<DIST::Array*>
|
||||
declStat = SgStatement::getStatementByFileAndLine(decl.first, decl.second);
|
||||
if (declStat == NULL) // check in inlcudes
|
||||
{
|
||||
if (!main->switchToFile())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
for (auto st = main; st != main->lastNodeOfStmt() && !declStat; st = st->lexNext())
|
||||
{
|
||||
if (st->fileName() == decl.first && st->lineNumber() == decl.second)
|
||||
@@ -1457,7 +1312,7 @@ static set<DIST::Array*>
|
||||
}
|
||||
else
|
||||
{
|
||||
declStat = getFuncStat(declStat);
|
||||
declStat = getFuncStat(declStat, { BLOCK_DATA });
|
||||
if (declStat != main)
|
||||
{
|
||||
declStat = NULL;
|
||||
|
||||
@@ -14,7 +14,7 @@
|
||||
#include "dvm.h"
|
||||
#include "graph_calls_func.h"
|
||||
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "graph_loops_func.h"
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "SgUtils.h"
|
||||
@@ -779,6 +779,20 @@ static void checkSpecList(SgExpression *spec, FuncInfo* currF, const map<string,
|
||||
}
|
||||
}
|
||||
|
||||
static void checkInTypeDescription(SgExpression *ex, FuncInfo* currF, const map<string, int>& parNames)
|
||||
{
|
||||
if (ex)
|
||||
{
|
||||
if (ex->variant() == ARRAY_REF)
|
||||
fillIn(currF, ex->lhs(), parNames, false);
|
||||
else
|
||||
{
|
||||
checkInTypeDescription(ex->lhs(), currF, parNames);
|
||||
checkInTypeDescription(ex->rhs(), currF, parNames);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void fillInOut(FuncInfo *currF, SgStatement *start, SgStatement *last, const set<SgStatement*>& activeOps)
|
||||
{
|
||||
if (currF->funcParams.countOfPars == 0)
|
||||
@@ -799,7 +813,12 @@ static void fillInOut(FuncInfo *currF, SgStatement *start, SgStatement *last, co
|
||||
if (st->variant() == ENTRY_STAT)
|
||||
continue;
|
||||
|
||||
if (isSgExecutableStatement(st) == NULL || st->lineNumber() <= 0)
|
||||
if (isSgExecutableStatement(st) == NULL) {
|
||||
checkInTypeDescription(st->expr(0), currF, parNames);
|
||||
continue;
|
||||
}
|
||||
|
||||
if (st->lineNumber() <= 0)
|
||||
continue;
|
||||
|
||||
if (activeOps.size() && activeOps.find(st) == activeOps.end())
|
||||
|
||||
@@ -31,7 +31,7 @@
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "../DynamicAnalysis/gCov_parser_func.h"
|
||||
|
||||
#include "../Transformations/VectorAssignToLoop/array_assign_to_loop.h"
|
||||
#include "VectorAssignToLoop/array_assign_to_loop.h"
|
||||
|
||||
using std::vector;
|
||||
using std::map;
|
||||
@@ -520,7 +520,7 @@ static void findArrayRef(SgExpression *exp, bool isWirte, set<DIST::Array*>& use
|
||||
{
|
||||
if (exp)
|
||||
{
|
||||
if (exp->variant() == ARRAY_REF)
|
||||
if (isArrayRef(exp))
|
||||
{
|
||||
DIST::Array *arrayRef = NULL;
|
||||
SgSymbol *symbS = OriginalSymbol(exp->symbol());
|
||||
@@ -699,7 +699,12 @@ void loopGraphAnalyzer(SgFile *file, vector<LoopGraph*> &loopGraph, const vector
|
||||
newLoop->hasPrints = hasThisIds(st, newLoop->linesOfIO, { WRITE_STAT, READ_STAT, OPEN_STAT, CLOSE_STAT, PRINT_STAT } ); // FORMAT_STAT
|
||||
newLoop->hasStops = hasThisIds(st, newLoop->linesOfStop, { STOP_STAT, PAUSE_NODE });
|
||||
newLoop->hasDvmIntervals = hasThisIds(st, tmpLines, { DVM_INTERVAL_DIR, DVM_ENDINTERVAL_DIR, DVM_EXIT_INTERVAL_DIR });
|
||||
newLoop->isFor = isSgForStmt(st) ? true : false;
|
||||
if (isSgForStmt(st))
|
||||
newLoop->loopType = LoopType::FOR;
|
||||
else if (isSgWhileStmt(st))
|
||||
newLoop->loopType = LoopType::WHILE;
|
||||
else
|
||||
newLoop->loopType = LoopType::NONE;
|
||||
newLoop->inCanonicalFrom = isSgForStmt(st) ? true : false;
|
||||
newLoop->hasSubstringRefs = hasSubstringRef(st);
|
||||
|
||||
@@ -777,7 +782,7 @@ void loopGraphAnalyzer(SgFile *file, vector<LoopGraph*> &loopGraph, const vector
|
||||
newLoop->startEndExpr = std::make_pair((Expression*)NULL, (Expression*)NULL);
|
||||
|
||||
newLoop->loop = new Statement(st);
|
||||
newLoop->loopSymbol = st->symbol() ? st->symbol()->identifier() : "unknown";
|
||||
newLoop->loopSymbols.addMainVar(st->symbol() ? st->symbol()->identifier() : "unknown");
|
||||
findArrayRefs(newLoop);
|
||||
|
||||
SgStatement *lexPrev = st->lexPrev();
|
||||
|
||||
@@ -25,6 +25,33 @@ namespace DIST = Distribution;
|
||||
void getRealArrayRefs(DIST::Array* addTo, DIST::Array* curr, std::set<DIST::Array*>& realArrayRefs, const std::map<DIST::Array*, std::set<DIST::Array*>>& arrayLinksByFuncCalls);
|
||||
void getAllArrayRefs(DIST::Array* addTo, DIST::Array* curr, std::set<DIST::Array*>& realArrayRefs, const std::map<DIST::Array*, std::set<DIST::Array*>>& arrayLinksByFuncCalls);
|
||||
|
||||
enum class LoopType { NONE, FOR, WHILE, IMPLICIT };
|
||||
|
||||
struct InductiveVariables
|
||||
{
|
||||
private:
|
||||
std::string mainVar;
|
||||
std::set<std::string> allVars;
|
||||
|
||||
public:
|
||||
InductiveVariables() { }
|
||||
|
||||
explicit InductiveVariables(const std::string& mainVar, const std::set<std::string>& allVars) : mainVar(mainVar), allVars(allVars) { };
|
||||
|
||||
std::string getMainVar() const { return mainVar; }
|
||||
std::set<std::string> getAllVars() const { return allVars; }
|
||||
|
||||
void addVar(const std::string& var) { allVars.insert(var); }
|
||||
void addMainVar(const std::string& var) { mainVar = var; allVars.insert(var); }
|
||||
|
||||
void replaceMainVar(const std::string& var)
|
||||
{
|
||||
allVars.erase(mainVar);
|
||||
|
||||
addMainVar(var);
|
||||
}
|
||||
};
|
||||
|
||||
struct LoopGraph
|
||||
{
|
||||
private:
|
||||
@@ -70,7 +97,7 @@ public:
|
||||
calculatedCountOfIters = 0;
|
||||
executionTimeInSec = -1.0;
|
||||
inDvmhRegion = 0;
|
||||
isFor = false;
|
||||
loopType = LoopType::NONE;
|
||||
inCanonicalFrom = false;
|
||||
hasAccessToSubArray = false;
|
||||
hasSubstringRefs = false;
|
||||
@@ -113,21 +140,24 @@ public:
|
||||
{
|
||||
return hasUnknownArrayDep || hasUnknownScalarDep || hasGoto || hasPrints || (hasConflicts.size() != 0) || hasStops || hasNonPureProcedures ||
|
||||
hasUnknownArrayAssigns || hasNonRectangularBounds || hasIndirectAccess || hasWritesToNonDistribute || hasDifferentAlignRules || hasDvmIntervals ||
|
||||
!isFor || lastprivateScalars.size() || hasAccessToSubArray || hasSubstringRefs;
|
||||
!isFor() || lastprivateScalars.size() || hasAccessToSubArray || hasSubstringRefs;
|
||||
}
|
||||
|
||||
bool hasLimitsToSplit() const
|
||||
{
|
||||
return hasGoto || hasStops || !isFor || hasPrints;
|
||||
return hasGoto || hasStops || !isFor() || hasPrints;
|
||||
}
|
||||
|
||||
bool hasLimitsToCombine() const
|
||||
{
|
||||
return hasGoto || hasStops || !isFor || hasPrints || linesOfCycle.size();
|
||||
return hasGoto || hasStops || !isFor() || hasPrints || linesOfCycle.size();
|
||||
}
|
||||
|
||||
void addConflictMessages(std::vector<Messages> *messages)
|
||||
{
|
||||
if (messages == NULL)
|
||||
return;
|
||||
|
||||
const int line = altLineNum > 0 ? altLineNum : lineNum;
|
||||
if (hasUnknownArrayDep)
|
||||
messages->push_back(Messages(NOTE, line, R113, L"unknown array dependency prevents parallelization of this loop", 3006));
|
||||
@@ -168,7 +198,7 @@ public:
|
||||
if (hasDvmIntervals)
|
||||
messages->push_back(Messages(NOTE, line, R145, L"DVM intervals prevent parallelization of this loop", 3006));
|
||||
|
||||
if (!isFor || !inCanonicalFrom)
|
||||
if (!isFor() || !inCanonicalFrom)
|
||||
messages->push_back(Messages(NOTE, line, R178, L"This type of loop is not supported by the system", 3006));
|
||||
|
||||
if (lastprivateScalars.size())
|
||||
@@ -393,6 +423,14 @@ public:
|
||||
|
||||
void* getRealStat(const char* file) const;
|
||||
|
||||
bool isFor() const { return loopType == LoopType::FOR; }
|
||||
|
||||
bool isWhile() const { return loopType == LoopType::WHILE; }
|
||||
|
||||
bool isImplicit() const { return loopType == LoopType::IMPLICIT; }
|
||||
|
||||
std::string loopSymbol() const { return loopSymbols.getMainVar(); }
|
||||
|
||||
public:
|
||||
int lineNum;
|
||||
int altLineNum;
|
||||
@@ -407,7 +445,7 @@ public:
|
||||
int startVal, endVal, stepVal;
|
||||
std::tuple<Expression*, Expression*, Expression*> startEndStepVals;
|
||||
|
||||
std::string loopSymbol;
|
||||
InductiveVariables loopSymbols;
|
||||
std::pair<Expression*, Expression*> startEndExpr;
|
||||
|
||||
bool hasGoto;
|
||||
@@ -448,7 +486,7 @@ public:
|
||||
|
||||
bool hasSubstringRefs;
|
||||
|
||||
bool isFor;
|
||||
LoopType loopType;
|
||||
|
||||
bool inCanonicalFrom;
|
||||
|
||||
|
||||
@@ -551,7 +551,7 @@ void addToDistributionGraph(const map<LoopGraph*, map<DIST::Array*, ArrayInfo*>>
|
||||
continue;
|
||||
}
|
||||
|
||||
if (!loopAccess.first->isFor)
|
||||
if (!loopAccess.first->isFor())
|
||||
continue;
|
||||
|
||||
DIST::GraphCSR<int, double, attrType>& G = currReg->GetGraphToModify();
|
||||
@@ -775,7 +775,7 @@ static void isAllOk(const vector<LoopGraph*> &loops, vector<Messages> &currMessa
|
||||
{
|
||||
if (loops[i]->region)
|
||||
{
|
||||
if (loops[i]->countOfIters == 0 && loops[i]->region && loops[i]->isFor)
|
||||
if (loops[i]->countOfIters == 0 && loops[i]->region && loops[i]->isFor())
|
||||
{
|
||||
wstring bufE, bufR;
|
||||
__spf_printToLongBuf(bufE, L" Can not calculate count of iterations for this loop, information about iterations in all loops in parallel regions '%s' will be ignored",
|
||||
|
||||
@@ -48,7 +48,7 @@ extern int passDone;
|
||||
#include "../VisualizerCalls/get_information.h"
|
||||
#include "../VisualizerCalls/SendMessage.h"
|
||||
|
||||
#include "../Transformations/LoopEndDoConverter/enddo_loop_converter.h"
|
||||
#include "LoopEndDoConverter/enddo_loop_converter.h"
|
||||
|
||||
#include "../DirectiveProcessing/remote_access.h"
|
||||
#include "../DirectiveProcessing/directive_omp_parser.h"
|
||||
@@ -1633,17 +1633,7 @@ void loopAnalyzer(SgFile *file, vector<ParallelRegion*> ®ions, map<tuple<int,
|
||||
createNeededException();
|
||||
|
||||
string fName = file->functions(i)->symbol()->identifier();
|
||||
#if _WIN32
|
||||
if (file->functions(i)->variant() != MODULE_STMT)
|
||||
sendMessage_2lvl(wstring(L"обработка функции '") + wstring(fName.begin(), fName.end()) + L"'");
|
||||
else
|
||||
sendMessage_2lvl(wstring(L"обработка модуля '") + wstring(fName.begin(), fName.end()) + L"'");
|
||||
#else
|
||||
if (file->functions(i)->variant() != MODULE_STMT)
|
||||
sendMessage_2lvl(wstring(L"processing function '") + wstring(fName.begin(), fName.end()) + L"'");
|
||||
else
|
||||
sendMessage_2lvl(wstring(L"processing module '") + wstring(fName.begin(), fName.end()) + L"'");
|
||||
#endif
|
||||
sendMessage_2lvl(0, (file->functions(i)->variant() != MODULE_STMT), fName);
|
||||
|
||||
set<SgSymbol*> delcsSymbViewed;
|
||||
set<SgStatement*> delcsStatViewed;
|
||||
@@ -2188,11 +2178,8 @@ void loopAnalyzer(SgFile *file, vector<ParallelRegion*> ®ions, map<tuple<int,
|
||||
if (!skipDeps)
|
||||
{
|
||||
string fName = file->functions(i)->symbol()->identifier();
|
||||
#ifdef _WIN32
|
||||
sendMessage_2lvl(wstring(L"обработка цикла ") + std::to_wstring(idx) + L"/" + std::to_wstring(convertedLoopInfo.size()));
|
||||
#else
|
||||
sendMessage_2lvl(wstring(L"processing loop ") + std::to_wstring(idx) + L"/" + std::to_wstring(convertedLoopInfo.size()));
|
||||
#endif
|
||||
sendMessage_2lvl(1, idx, (int)convertedLoopInfo.size());
|
||||
|
||||
tryToFindDependencies(loop.first, allLoops, funcWasInit, file, regions, currMessages, collection, funcByName, defUseByPlace);
|
||||
}
|
||||
}
|
||||
@@ -2212,7 +2199,7 @@ void loopAnalyzer(SgFile *file, vector<ParallelRegion*> ®ions, map<tuple<int,
|
||||
LoopGraph *tmpLoop = new LoopGraph();
|
||||
|
||||
tmpLoop->region = reg;
|
||||
tmpLoop->isFor = true;
|
||||
tmpLoop->loopType = LoopType::FOR;
|
||||
|
||||
tmpLoops.push_back(tmpLoop);
|
||||
|
||||
@@ -2340,7 +2327,7 @@ void loopAnalyzer(SgFile *file, vector<ParallelRegion*> ®ions, map<tuple<int,
|
||||
if (parallizeFreeLoops)
|
||||
selectFreeLoopsForParallelization(loopsForFunction, funcName, (regime == DATA_DISTR), regions, messagesForFile);
|
||||
}
|
||||
sendMessage_2lvl(L"");
|
||||
sendMessage_2lvl(2);
|
||||
}
|
||||
else if (regime == COMP_DISTR)
|
||||
{
|
||||
|
||||
@@ -18,7 +18,7 @@
|
||||
#include "../DirectiveProcessing/insert_directive.h"
|
||||
#include "SgUtils.h"
|
||||
#include "expr_transform.h"
|
||||
#include "../Transformations/FunctionPurifying/function_purifying.h"
|
||||
#include "FunctionPurifying/function_purifying.h"
|
||||
|
||||
using std::map;
|
||||
using std::pair;
|
||||
|
||||
@@ -22,7 +22,7 @@
|
||||
#include "graph_loops_func.h"
|
||||
#include "expr_transform.h"
|
||||
#include "../LoopAnalyzer/loop_analyzer.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
#include "json.hpp"
|
||||
|
||||
|
||||
@@ -12,7 +12,7 @@
|
||||
#include "graph_calls.h"
|
||||
#include "private_analyzer.h"
|
||||
#include "dvm.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
using std::vector;
|
||||
|
||||
|
||||
@@ -11,11 +11,11 @@
|
||||
#include "region.h"
|
||||
#include "SgUtils.h"
|
||||
#include "graph_loops.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
void Collapse(Region* region)
|
||||
static void Collapse(Region* region)
|
||||
{
|
||||
if (region->getBasickBlocks().empty())
|
||||
return;
|
||||
@@ -124,18 +124,32 @@ static void SolveDataFlow(Region* DFG)
|
||||
map<LoopGraph*, ArrayAccessingIndexes> FindPrivateArrays(map<string, vector<LoopGraph*>> &loopGraph, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR)
|
||||
{
|
||||
map<LoopGraph*, ArrayAccessingIndexes> result;
|
||||
for (const auto& [loopName, loops] : loopGraph)
|
||||
for (const auto& [fileName, loops] : loopGraph)
|
||||
{
|
||||
SgFile::switchToFile(fileName);
|
||||
for (const auto& loop : loops)
|
||||
{
|
||||
SgStatement* search_func = loop->loop->GetOriginal();
|
||||
|
||||
while (search_func && (!isSgProgHedrStmt(search_func)))
|
||||
search_func = search_func->controlParent();
|
||||
|
||||
for (const auto& [funcInfo, blocks]: FullIR)
|
||||
{
|
||||
if (funcInfo->fileName == fileName && funcInfo->funcPointer->GetOriginal() == search_func)
|
||||
{
|
||||
Region* loopRegion = new Region(loop, blocks);
|
||||
if (loopRegion->getBasickBlocks().size() <= 1)
|
||||
{
|
||||
delete(loopRegion);
|
||||
continue;
|
||||
}
|
||||
SolveDataFlow(loopRegion);
|
||||
result[loop] = loopRegion->array_priv;
|
||||
delete(loopRegion);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
@@ -5,10 +5,8 @@
|
||||
#include <unordered_set>
|
||||
|
||||
#include "range_structures.h"
|
||||
#include "region.h"
|
||||
#include "graph_loops.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
void Collapse(Region* region);
|
||||
std::map<LoopGraph*, ArrayAccessingIndexes> FindPrivateArrays(std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR);
|
||||
std::pair<SAPFOR::BasicBlock*, std::unordered_set<SAPFOR::BasicBlock*>> GetBasicBlocksForLoop(const LoopGraph* loop, const std::vector<SAPFOR::BasicBlock*> blocks);
|
||||
|
||||
@@ -2,8 +2,8 @@
|
||||
#include <map>
|
||||
#include <unordered_set>
|
||||
#include <string>
|
||||
#include <numeric>
|
||||
|
||||
#include "utils.h"
|
||||
#include "range_structures.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
@@ -51,7 +51,7 @@ pair<SAPFOR::BasicBlock*, unordered_set<SAPFOR::BasicBlock*>> GetBasicBlocksForL
|
||||
}
|
||||
|
||||
static void BuildLoopIndex(map<string, LoopGraph*>& loopForIndex, LoopGraph* loop) {
|
||||
string index = loop->loopSymbol;
|
||||
string index = loop->loopSymbol();
|
||||
loopForIndex[index] = loop;
|
||||
|
||||
for (const auto& childLoop : loop->children)
|
||||
@@ -146,7 +146,7 @@ static int GetDefUseArray(SAPFOR::BasicBlock* block, LoopGraph* loop, ArrayAcces
|
||||
{
|
||||
auto var = index_vars.back();
|
||||
int currentVarPos = refPos.back();
|
||||
pair currentCoefs = coefsForDims.back();
|
||||
pair<int, int> currentCoefs = coefsForDims.back();
|
||||
ArrayDimension current_dim;
|
||||
if (var->getType() == SAPFOR::CFG_ARG_TYPE::CONST)
|
||||
current_dim = { stoul(var->getValue()), 1, 1 };
|
||||
|
||||
@@ -6,7 +6,7 @@
|
||||
#include <string>
|
||||
|
||||
#include "graph_loops.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
|
||||
class Region : public SAPFOR::BasicBlock {
|
||||
public:
|
||||
|
||||
@@ -403,7 +403,7 @@ static int convertFile(int argc, char* argv[], const set<string>& filesInProj, c
|
||||
fprintf(stderr, "<<<<< Unparsing %s >>>>>\n", fout_name);
|
||||
|
||||
if (mod_gpu) /*ACC*/
|
||||
UnparseTo_CufAndCu_Files(file, fout_cuf, fout_C_cu, fout_info);
|
||||
UnparseTo_CufAndCu_Files(file, fout_cuf, fout_C_cu, fout_info, fout_name);
|
||||
|
||||
const string fileN = file->filename();
|
||||
set<SgStatement*> toRemove;
|
||||
|
||||
@@ -294,11 +294,8 @@ static vector<string> parseList(vector<FileInfo>& listOfProject,
|
||||
}
|
||||
}
|
||||
|
||||
#ifdef _WIN32
|
||||
sendMessage_2lvl(L" <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> '" + to_wstring(file) + L"'");
|
||||
#else
|
||||
sendMessage_2lvl(L" processing file '" + to_wstring(file) + L"'");
|
||||
#endif
|
||||
sendMessage_2lvl(3, file);
|
||||
|
||||
StdCapture::Init();
|
||||
string errorMessage = "";
|
||||
try
|
||||
@@ -444,20 +441,12 @@ static int dumpErrors(const vector<FileInfo>& listOfProject, const vector<string
|
||||
if (errors[z] == "")
|
||||
{
|
||||
FILE* ferr = fopen(file.errPath.c_str(), "w");
|
||||
if (!ferr)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
if (ferr)
|
||||
fclose(ferr);
|
||||
++z;
|
||||
continue;
|
||||
}
|
||||
|
||||
FILE* ferr = fopen(file.errPath.c_str(), "w");
|
||||
FILE* fout = fopen(file.outPath.c_str(), "w");
|
||||
if (!ferr)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
if (!fout)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
string errS = "", outS = "";
|
||||
vector<string> splited;
|
||||
splitString(errors[z], '\n', splited);
|
||||
@@ -476,13 +465,22 @@ static int dumpErrors(const vector<FileInfo>& listOfProject, const vector<string
|
||||
}
|
||||
}
|
||||
|
||||
fprintf(fout, "%s", outS.c_str());
|
||||
|
||||
FILE* ferr = fopen(file.errPath.c_str(), "w");
|
||||
FILE* fout = fopen(file.outPath.c_str(), "w");
|
||||
if (ferr)
|
||||
{
|
||||
fprintf(ferr, "%s", errS.c_str());
|
||||
fclose(ferr);
|
||||
}
|
||||
|
||||
if (fout)
|
||||
{
|
||||
fprintf(fout, "%s", outS.c_str());
|
||||
fclose(fout);
|
||||
}
|
||||
|
||||
fflush(NULL);
|
||||
|
||||
fclose(fout);
|
||||
fclose(ferr);
|
||||
++z;
|
||||
}
|
||||
|
||||
@@ -577,11 +575,8 @@ static void parseFiles(int& iters, vector<string>& errors, vector<FileInfo>& lis
|
||||
|
||||
do
|
||||
{
|
||||
#ifdef _WIN32
|
||||
sendMessage_1lvl(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " + std::to_wstring((iters + 1)) + L" <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>");
|
||||
#else
|
||||
sendMessage_1lvl(L"running " + std::to_wstring((iters + 1)) + L" iteration of syntax analisys");
|
||||
#endif
|
||||
sendMessage_1lvl(0, iters + 1);
|
||||
|
||||
errors = parseList(listOfProject, iters != 0, parseForInlining, mapModuleDeps, moduleDelc, modDirectOrder, isFromConsole);
|
||||
changed = createMapOfUse(errors, listOfProject, mapModuleDeps);
|
||||
if (iters != 0)
|
||||
@@ -810,6 +805,8 @@ void parseFiles(int argc, char** argv)
|
||||
printf(" run parsing for inlining\n");
|
||||
|
||||
int rethrow = parseFiles(errors, listOfProject, filesCompilationOrder, isInline, true);
|
||||
int errCount = dumpErrors(listOfProject, errors, messages);
|
||||
|
||||
if (rethrow == 0)
|
||||
{
|
||||
for (auto& err : errors)
|
||||
@@ -839,5 +836,7 @@ void parseFiles(int argc, char** argv)
|
||||
}
|
||||
else
|
||||
printf("Parsing was completed with errors, throw code %d, errors count %d\n", rethrow, code);
|
||||
|
||||
dumpMessages(false, messages, VISUALIZER_DATA_PATH);
|
||||
exit(0);
|
||||
}
|
||||
|
||||
@@ -2,16 +2,20 @@
|
||||
|
||||
#include <cstdio>
|
||||
#include <cstring>
|
||||
#include <cstring>
|
||||
#include <fstream>
|
||||
#include <iostream>
|
||||
#include <cstdlib>
|
||||
#include <set>
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include <algorithm>
|
||||
#include <tuple>
|
||||
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "CFGraph/IR.h"
|
||||
#include "Distribution/Array.h"
|
||||
#include "dvm.h"
|
||||
|
||||
#include "errors.h"
|
||||
#include "SgUtils.h"
|
||||
#include "graph_calls.h"
|
||||
@@ -19,15 +23,421 @@
|
||||
|
||||
#include "projectParameters.h"
|
||||
|
||||
using namespace std;
|
||||
using std::set;
|
||||
using std::map;
|
||||
using std::string;
|
||||
using std::vector;
|
||||
using std::tuple;
|
||||
using std::pair;
|
||||
using std::make_tuple;
|
||||
using std::find_if;
|
||||
|
||||
map< pair<string, int>, set<string>>
|
||||
findParameters(const map<string, vector<DefUseList>> &defUseByFunctions,
|
||||
const map<string, CommonBlock*> &commonBlocks,
|
||||
const map<string, vector<FuncInfo*>> &allFuncInfo)
|
||||
static map<FuncInfo*, vector<SAPFOR::Instruction*>> call_sites;
|
||||
|
||||
enum class MODE
|
||||
{
|
||||
map< pair<string, int>, set<string>> foundParameters;
|
||||
BEFORE,
|
||||
AFTER
|
||||
};
|
||||
|
||||
template<typename Iterator>
|
||||
static void extract_vars_from_reg(set<SAPFOR::Argument*>& worklist, SAPFOR::Argument* reg, Iterator instr, Iterator first_instr);
|
||||
|
||||
return foundParameters;
|
||||
static tuple<FuncInfo*, SAPFOR::Instruction*, SAPFOR::BasicBlock*>
|
||||
stmtToIR(const map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& CFGraph, SgStatement* stmt)
|
||||
{
|
||||
SgStatement* cur = stmt;
|
||||
cur->switchToFile();
|
||||
while (cur->variant() != PROC_HEDR && cur->variant() != PROG_HEDR && cur->variant() != FUNC_HEDR)
|
||||
cur = cur->controlParent();
|
||||
|
||||
string funcName = ((SgProcHedrStmt*)cur)->nameWithContains();
|
||||
|
||||
int stmtID = stmt->id();
|
||||
for (const auto& [func, bblocks] : CFGraph)
|
||||
{
|
||||
if (func->funcName != funcName)
|
||||
continue;
|
||||
|
||||
for (auto basicBlock : bblocks)
|
||||
for (auto ins : basicBlock->getInstructions())
|
||||
if (stmtID == ins->getInstruction()->getOperator()->id())
|
||||
return make_tuple(func, ins->getInstruction(), basicBlock);
|
||||
}
|
||||
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return { NULL, NULL, NULL };
|
||||
}
|
||||
|
||||
static tuple<FuncInfo*, SAPFOR::Instruction*, SAPFOR::BasicBlock*>
|
||||
IRByNumber(const map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& CFGraph, int num)
|
||||
{
|
||||
if (num < 0)
|
||||
return { NULL, NULL, NULL };
|
||||
|
||||
for (const auto& [func, bblocks] : CFGraph)
|
||||
for (auto byBB : bblocks)
|
||||
if (byBB->getInstructions().front()->getNumber() <= num && byBB->getInstructions().back()->getNumber() >= num)
|
||||
return make_tuple(func, getInstructionByNumber(byBB->getInstructions(), num), byBB);
|
||||
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return { NULL, NULL, NULL };
|
||||
}
|
||||
|
||||
template<typename Iterator>
|
||||
static void processArgument(set<SAPFOR::Argument*>& worklist,
|
||||
SAPFOR::Argument* arg,
|
||||
Iterator instr, Iterator first_instr)
|
||||
{
|
||||
if (arg == NULL)
|
||||
return;
|
||||
|
||||
if (arg->getType() == SAPFOR::CFG_ARG_TYPE::REG)
|
||||
extract_vars_from_reg(worklist, arg, instr, first_instr);
|
||||
else if (arg->getType() == SAPFOR::CFG_ARG_TYPE::VAR)
|
||||
worklist.insert(arg);
|
||||
}
|
||||
|
||||
template<typename Iterator>
|
||||
static void extract_vars_from_reg(set<SAPFOR::Argument*>& worklist,
|
||||
SAPFOR::Argument* reg,
|
||||
Iterator instr, Iterator first_instr)
|
||||
{
|
||||
for (; instr >= first_instr; instr--)
|
||||
{
|
||||
if ((*instr)->getInstruction()->getResult() == reg)
|
||||
{
|
||||
processArgument(worklist, (*instr)->getInstruction()->getArg1(), instr, first_instr);
|
||||
processArgument(worklist, (*instr)->getInstruction()->getArg2(), instr, first_instr);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void lookup_for_vars(set<tuple<SgStatement*, string, MODE>>& where_to_add,
|
||||
set<SAPFOR::Argument*>& worklist,
|
||||
SAPFOR::Instruction* instr,
|
||||
SAPFOR::BasicBlock* bblock,
|
||||
FuncInfo* cur_func,
|
||||
const map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& fullIR)
|
||||
{
|
||||
while (bblock)
|
||||
{
|
||||
auto first_instr = bblock->getInstructions().begin();
|
||||
auto cur_instr = find_if(first_instr, bblock->getInstructions().end(), [instr](SAPFOR::IR_Block* i) {
|
||||
return i->getInstruction() == instr;
|
||||
});
|
||||
|
||||
for (; cur_instr >= bblock->getInstructions().begin(); --cur_instr)
|
||||
{
|
||||
auto instr = (*cur_instr)->getInstruction();
|
||||
auto result_arg = instr->getResult();
|
||||
auto arg1 = instr->getArg1();
|
||||
auto arg2 = instr->getArg2();
|
||||
|
||||
if (worklist.count(result_arg))
|
||||
{
|
||||
worklist.erase(result_arg);
|
||||
processArgument(worklist, arg1, cur_instr, first_instr);
|
||||
processArgument(worklist, arg2, cur_instr, first_instr);
|
||||
}
|
||||
|
||||
if (instr->getOperation() == SAPFOR::CFG_OP::PARAM && worklist.count(arg1))
|
||||
{
|
||||
// skip to F_CALL
|
||||
auto f_call_instr = cur_instr;
|
||||
while ((*f_call_instr)->getInstruction()->getOperation() != SAPFOR::CFG_OP::F_CALL)
|
||||
f_call_instr++;
|
||||
|
||||
if ((*f_call_instr)->getInstruction()->getArg1()->getValue() == "_READ")
|
||||
{
|
||||
auto stmt_before = (*f_call_instr)->getInstruction()->getOperator();
|
||||
auto filename = stmt_before->fileName();
|
||||
auto line = stmt_before->lineNumber();
|
||||
auto var_name = arg1->getValue().substr(arg1->getValue().find('%') + 1);
|
||||
__spf_print(1, "Please specify value of variable %s on line %d of file %s\n", arg1->getValue().c_str(), line, filename);
|
||||
auto toAdd = make_tuple(stmt_before, var_name, MODE::AFTER);
|
||||
where_to_add.insert(toAdd);
|
||||
worklist.erase(arg1);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
const auto& RD = bblock->getRD_In();
|
||||
map<SAPFOR::BasicBlock*, SAPFOR::Instruction*> group_by_block;
|
||||
|
||||
set<SAPFOR::Argument*> to_erase;
|
||||
for (auto& arg : worklist)
|
||||
{
|
||||
if (RD.count(arg))
|
||||
{
|
||||
if (RD.at(arg).size() == 1 && *RD.at(arg).begin() == SAPFOR::CFG_VAL::UNINIT)
|
||||
__spf_print(1, "variable %s has no definition\n", arg->getValue().c_str());
|
||||
else if (RD.at(arg).size() > 1)
|
||||
{
|
||||
auto stmt_after = (*first_instr)->getInstruction()->getOperator();
|
||||
auto filename = stmt_after->fileName();
|
||||
auto line = stmt_after->lineNumber();
|
||||
auto var_name = arg->getValue().substr(arg->getValue().find('%') + 1);
|
||||
__spf_print(1, "variable %s has multiple reaching definitions, further analysis is impossible\n", arg->getValue().c_str());
|
||||
__spf_print(1, "Please specify value of variable %s on line %d of file %s\n", arg->getValue().c_str(), line, filename);
|
||||
auto toAdd = make_tuple(stmt_after, var_name, MODE::BEFORE);
|
||||
where_to_add.insert(toAdd);
|
||||
to_erase.insert(arg);
|
||||
}
|
||||
else
|
||||
{
|
||||
auto instr_num = *RD.at(arg).begin();
|
||||
auto [func, instr, bblock] = IRByNumber(fullIR, instr_num);
|
||||
if (cur_func == func && (group_by_block[bblock] == NULL || group_by_block[bblock]->getNumber() < instr_num))
|
||||
group_by_block[bblock] = instr;
|
||||
}
|
||||
}
|
||||
}
|
||||
for (const auto& arg : to_erase)
|
||||
worklist.erase(arg);
|
||||
|
||||
while (bblock && group_by_block.find(bblock) == group_by_block.end())
|
||||
bblock = bblock->getDom();
|
||||
|
||||
if (bblock)
|
||||
instr = group_by_block[bblock];
|
||||
}
|
||||
|
||||
// other variables are from global scope
|
||||
const auto& RD = fullIR.at(cur_func).front()->getRD_In();
|
||||
for (auto& arg : worklist)
|
||||
{
|
||||
if (arg->isMemGlobal())
|
||||
{
|
||||
set<int> found_rd;
|
||||
if (RD.count(arg))
|
||||
found_rd = RD.at(arg);
|
||||
|
||||
if (found_rd.size() == 0)
|
||||
{
|
||||
auto call_instr = call_sites[cur_func].size() ? call_sites[cur_func].front() : NULL;
|
||||
while (call_instr && found_rd.size() == 0)
|
||||
{
|
||||
auto [call_func, _, call_bblock] = IRByNumber(fullIR, call_instr->getNumber());
|
||||
if (call_bblock->getRD_Out().count(arg))
|
||||
found_rd = call_bblock->getRD_Out().at(arg);
|
||||
|
||||
|
||||
call_instr = call_sites[call_func].size() ? call_sites[call_func].front() : NULL;
|
||||
}
|
||||
}
|
||||
|
||||
if (found_rd.size() == 1 && *found_rd.begin() == SAPFOR::CFG_VAL::UNINIT)
|
||||
__spf_print(1, "variable %s has no definition\n", arg->getValue().c_str());
|
||||
else if (found_rd.size() > 1)
|
||||
{
|
||||
auto first_instr = fullIR.at(cur_func).front()->getInstructions().begin();
|
||||
auto stmt_after = (*first_instr)->getInstruction()->getOperator();
|
||||
auto filename = stmt_after->fileName();
|
||||
auto line = stmt_after->lineNumber();
|
||||
auto var_name = arg->getValue().substr(arg->getValue().find('%') + 1);
|
||||
__spf_print(1, "variable %s has multiple reaching definitions, further analysis is impossible\n", arg->getValue().c_str());
|
||||
__spf_print(1, "Please specify value of variable %s on line %d of file %s\n", arg->getValue().c_str(), line, filename);
|
||||
auto toAdd = make_tuple(stmt_after, var_name, MODE::BEFORE);
|
||||
where_to_add.insert(toAdd);
|
||||
}
|
||||
else
|
||||
{
|
||||
auto instr_num = *found_rd.begin();
|
||||
auto [func, instr, bblock] = IRByNumber(fullIR, instr_num);
|
||||
set<SAPFOR::Argument*> new_worklist = { arg };
|
||||
|
||||
lookup_for_vars(where_to_add, new_worklist, instr, bblock, func, fullIR);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
for (const auto& call_instr : call_sites[cur_func])
|
||||
{
|
||||
set<SAPFOR::Argument*> new_worklist;
|
||||
auto params_num = cur_func->funcParams.countOfPars;
|
||||
|
||||
auto [call_func, _, call_bblock] = IRByNumber(fullIR, call_instr->getNumber());
|
||||
auto first_instr = call_bblock->getInstructions().begin();
|
||||
auto cur_instr = find_if(first_instr, call_bblock->getInstructions().end(), [call_instr](SAPFOR::IR_Block* i) {
|
||||
return i->getInstruction() == call_instr;
|
||||
});
|
||||
|
||||
for (auto& arg : worklist)
|
||||
{
|
||||
if (arg->getMemType() == SAPFOR::CFG_MEM_TYPE::FUNC_PARAM_)
|
||||
{
|
||||
auto param_num = stoi(arg->getValue().substr(arg->getValue().find('%', arg->getValue().find('%') + 1) + 1));
|
||||
auto param_instr = (cur_instr - (params_num - param_num));
|
||||
auto param_arg = (*param_instr)->getInstruction()->getArg1();
|
||||
processArgument(new_worklist, param_arg, param_instr, first_instr);
|
||||
}
|
||||
}
|
||||
lookup_for_vars(where_to_add, new_worklist, call_instr, call_bblock, call_func, fullIR);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
static void handle_single_allocate(set<tuple<SgStatement*, string, MODE>>& where_to_add,
|
||||
SgStatement* alloc_statement,
|
||||
const map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& fullIR)
|
||||
{
|
||||
auto [func, instr, bblock] = stmtToIR(fullIR, alloc_statement);
|
||||
|
||||
auto first_instr = bblock->getInstructions().begin();
|
||||
auto cur_instr = find_if(first_instr, bblock->getInstructions().end(), [instr](SAPFOR::IR_Block* i) {
|
||||
return i->getInstruction() == instr;
|
||||
});
|
||||
auto alloc_instr = cur_instr;
|
||||
|
||||
// skip to F_CALL _ALLOC n
|
||||
while ((*alloc_instr)->getInstruction()->getOperation() != SAPFOR::CFG_OP::F_CALL ||
|
||||
(*alloc_instr)->getInstruction()->getArg1()->getValue() != "_ALLOC")
|
||||
alloc_instr++;
|
||||
|
||||
auto arrays_num = stoi((*alloc_instr)->getInstruction()->getArg2()->getValue());
|
||||
|
||||
set<SAPFOR::Argument*> worklist;
|
||||
for (int i = 0; i < arrays_num; i++)
|
||||
{
|
||||
auto param_instr = --alloc_instr;
|
||||
auto param_reg = (*param_instr)->getInstruction()->getArg1();
|
||||
|
||||
while ((*param_instr)->getInstruction()->getOperation() != SAPFOR::CFG_OP::LOAD ||
|
||||
(*param_instr)->getInstruction()->getResult() != param_reg)
|
||||
param_instr--;
|
||||
|
||||
|
||||
auto dimensions_num = stoi((*param_instr)->getInstruction()->getArg2()->getValue());
|
||||
|
||||
for (int j = 0; j < dimensions_num; j++)
|
||||
{
|
||||
auto ref_instr = --param_instr;
|
||||
if ((*ref_instr)->getInstruction()->getOperation() == SAPFOR::CFG_OP::RANGE)
|
||||
{
|
||||
vector<SAPFOR::Argument*> range_args = { (*ref_instr)->getInstruction()->getArg1(),
|
||||
(*ref_instr)->getInstruction()->getArg2(),
|
||||
(*ref_instr)->getInstruction()->getResult() };
|
||||
for (auto& arg : range_args)
|
||||
processArgument(worklist, arg, ref_instr, first_instr);
|
||||
|
||||
}
|
||||
else
|
||||
{
|
||||
auto arg = (*ref_instr)->getInstruction()->getArg1();
|
||||
processArgument(worklist, arg, ref_instr, first_instr);
|
||||
}
|
||||
}
|
||||
}
|
||||
lookup_for_vars(where_to_add, worklist, instr, bblock, func, fullIR);
|
||||
}
|
||||
|
||||
|
||||
static void handle_single_loop(set<tuple<SgStatement*, string, MODE>>& where_to_add,
|
||||
SgStatement* loop_stmt,
|
||||
const map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& fullIR)
|
||||
{
|
||||
auto [func, instr, bblock] = stmtToIR(fullIR, loop_stmt);
|
||||
auto cur_instr = bblock->getInstructions().end() - 1;
|
||||
|
||||
set<SAPFOR::Argument*> worklist;
|
||||
extract_vars_from_reg(worklist, (*cur_instr)->getInstruction()->getResult(), cur_instr, bblock->getInstructions().begin());
|
||||
|
||||
lookup_for_vars(where_to_add, worklist, (*cur_instr)->getInstruction(), bblock, func, fullIR);
|
||||
}
|
||||
|
||||
void findParameters(ResultSet& foundParameters,
|
||||
map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& fullIR,
|
||||
const map<tuple<int, string, string>, pair<DIST::Array*, DIST::ArrayAccessInfo*>>& declaredArrays)
|
||||
{
|
||||
set<tuple<SgStatement*, string, MODE>> where_to_add;
|
||||
|
||||
map<string, FuncInfo*> name_to_func;
|
||||
for (const auto& [func, _] : fullIR)
|
||||
name_to_func[func->funcName] = func;
|
||||
|
||||
for (auto& [func, bblocks] : fullIR)
|
||||
{
|
||||
for (const auto& block : bblocks)
|
||||
{
|
||||
for (const auto& ir_block : block->getInstructions())
|
||||
{
|
||||
auto instr = ir_block->getInstruction();
|
||||
if (instr->getOperation() == SAPFOR::CFG_OP::F_CALL)
|
||||
{
|
||||
auto func_name = instr->getArg1()->getValue();
|
||||
auto func_info = name_to_func.find(func_name);
|
||||
|
||||
if (func_info != name_to_func.end())
|
||||
call_sites[func_info->second].push_back(instr);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
set<SgStatement*> alloc_statements;
|
||||
for (const auto& [func, bblocks] : fullIR)
|
||||
{
|
||||
for (const auto& block : bblocks)
|
||||
{
|
||||
for (auto instr = block->getInstructions().begin(); instr != block->getInstructions().end(); ++instr)
|
||||
{
|
||||
auto op = (*instr)->getInstruction()->getOperator();
|
||||
if (op && op->variant() == ALLOCATE_STMT)
|
||||
alloc_statements.insert(op);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
set<SgStatement*> for_statements;
|
||||
// Find all FOR statements in the program
|
||||
for (const auto& [func, bblocks] : fullIR)
|
||||
{
|
||||
for (const auto& block : bblocks)
|
||||
{
|
||||
for (auto instr = block->getInstructions().begin(); instr != block->getInstructions().end(); ++instr)
|
||||
{
|
||||
auto op = (*instr)->getInstruction()->getOperator();
|
||||
if (op && op->variant() == FOR_NODE)
|
||||
for_statements.insert(op);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
for (const auto& alloc_statement : alloc_statements)
|
||||
handle_single_allocate(where_to_add, alloc_statement, fullIR);
|
||||
|
||||
for (const auto& stmt : for_statements)
|
||||
handle_single_loop(where_to_add, stmt, fullIR);
|
||||
|
||||
for (const auto& [stmt_before, var_name, mode] : where_to_add)
|
||||
{
|
||||
stmt_before->switchToFile();
|
||||
|
||||
SgVariableSymb* var_symb = new SgVariableSymb(var_name.c_str());
|
||||
SgVarRefExp* var = new SgVarRefExp(var_symb);
|
||||
SgExprListExp* ex = new SgExprListExp();
|
||||
auto assgn_op = new SgExpression(ASSGN_OP, var, NULL);
|
||||
ex->setLhs(assgn_op);
|
||||
|
||||
SgExpression* parameter_op = new SgExpression(SPF_PARAMETER_OP, ex);
|
||||
auto dir_list = new SgExprListExp();
|
||||
dir_list->setLhs(parameter_op);
|
||||
SgStatement* toAdd = new SgStatement(SPF_ANALYSIS_DIR, NULL, NULL, dir_list, NULL, NULL);
|
||||
|
||||
toAdd->setlineNumber(stmt_before->lineNumber());
|
||||
toAdd->setLocalLineNumber(stmt_before->lineNumber());
|
||||
toAdd->setFileId(stmt_before->getFileId());
|
||||
toAdd->setProject(stmt_before->getProject());
|
||||
|
||||
//NOTE: only for debbuging, results will be transferred to the visualizer
|
||||
/*if (mode == MODE::AFTER)
|
||||
stmt_before->insertStmtAfter(*toAdd, *stmt_before->controlParent());
|
||||
else
|
||||
stmt_before->insertStmtBefore(*toAdd, *stmt_before->controlParent());*/
|
||||
|
||||
foundParameters.insert(make_tuple(stmt_before->fileName(), stmt_before->lineNumber(), var_name));
|
||||
}
|
||||
}
|
||||
@@ -1,3 +1,14 @@
|
||||
#pragma once
|
||||
|
||||
std::map< std::pair<std::string, int>, std::set<std::string>> findParameters(const std::map<std::string, std::vector<DefUseList>> &defUseByFunctions, const std::map<std::string, CommonBlock*> &commonBlocks, const std::map<std::string, std::vector<FuncInfo*>> &allFuncInfo);
|
||||
#include <map>
|
||||
#include <string>
|
||||
#include <set>
|
||||
#include <vector>
|
||||
|
||||
#include "../GraphCall/graph_calls.h"
|
||||
|
||||
using ResultSet = std::set<std::tuple<std::string, int, std::string>>;
|
||||
|
||||
void findParameters(ResultSet& foundParameters,
|
||||
std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& fullIR,
|
||||
const std::map<std::tuple<int, std::string, std::string>, std::pair<DIST::Array*, DIST::ArrayAccessInfo*>>& declaredArrays);
|
||||
|
||||
@@ -398,11 +398,7 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
__spf_print(DEBUG_LVL1, "RUN PASS with name %s\n", passNames[curr_regime]);
|
||||
|
||||
auto toSendStrMessage = string(passNames[curr_regime]);
|
||||
#ifdef _WIN32
|
||||
sendMessage_1lvl(wstring(L"выполняется проход '") + wstring(toSendStrMessage.begin(), toSendStrMessage.end()) + L"'");
|
||||
#else
|
||||
sendMessage_1lvl(wstring(L"running pass '") + wstring(toSendStrMessage.begin(), toSendStrMessage.end()) + L"'");
|
||||
#endif
|
||||
sendMessage_1lvl(1, toSendStrMessage);
|
||||
|
||||
const int n = project.numberOfFiles();
|
||||
bool verifyOK = true;
|
||||
@@ -450,11 +446,7 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
SgFile *file = &(project.file(i));
|
||||
|
||||
toSendStrMessage = file->filename();
|
||||
#ifdef _WIN32
|
||||
sendMessage_2lvl(wstring(L"обработка файла '") + wstring(toSendStrMessage.begin(), toSendStrMessage.end()) + L"'");
|
||||
#else
|
||||
sendMessage_2lvl(wstring(L"processing file '") + wstring(toSendStrMessage.begin(), toSendStrMessage.end()) + L"'");
|
||||
#endif
|
||||
sendMessage_2lvl(3, toSendStrMessage);
|
||||
sendMessage_progress(std::to_wstring((int)(((double)(n - i) / n) * 100)));
|
||||
|
||||
const char *file_name = file->filename();
|
||||
@@ -1027,8 +1019,6 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
if(func->funcPointer->variant() != ENTRY_STAT)
|
||||
countOfTransform += removeDeadCode(func->funcPointer, allFuncInfo, commonBlocks);
|
||||
}
|
||||
else if (curr_regime == FIND_PRIVATE_ARRAYS)
|
||||
FindPrivateArrays(loopGraph, fullIR);
|
||||
else if (curr_regime == TEST_PASS)
|
||||
{
|
||||
//test pass
|
||||
@@ -1057,7 +1047,7 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
throw -11;
|
||||
}
|
||||
|
||||
sendMessage_2lvl(wstring(L""));
|
||||
sendMessage_2lvl(2);
|
||||
// ********************************** ///
|
||||
/// SECOND AGGREGATION STEP ///
|
||||
// ********************************** ///
|
||||
@@ -1289,7 +1279,6 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
detectCopies(allFuncInfo);
|
||||
fillInterfaceBlock(allFuncInfo);
|
||||
intentInsertToInterfaces(allFuncInfo);
|
||||
createInterfacesForAssumedSize(allFuncInfo);
|
||||
|
||||
//this call is only for testing
|
||||
//setPureStatus(allFuncInfo);
|
||||
@@ -1895,7 +1884,7 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
else if (curr_regime == RENAME_SYMBOLS)
|
||||
runRenameSymbols(&project, commonBlocks);
|
||||
else if (curr_regime == FIND_PARAMETERS)
|
||||
parametersOfProject = findParameters(defUseByFunctions, commonBlocks, allFuncInfo);
|
||||
findParameters(parametersOfProject, fullIR, declaredArrays);
|
||||
else if (curr_regime == BUILD_IR)
|
||||
{
|
||||
auto CFG_forFile = buildCFG(commonBlocks, allFuncInfo_IR, SAPFOR::CFG_Settings(0));
|
||||
@@ -1923,12 +1912,16 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
||||
calculateStatsForPredictor(allFuncInfo, gCovInfo);
|
||||
parseDvmDirForPredictor(declaredArrays, commonBlocks, allFuncInfo, gCovInfo);
|
||||
}
|
||||
else if (curr_regime == TRANSFORM_ASSUMED_SIZE_PARAMETERS)
|
||||
transformAssumedSizeParameters(allFuncInfo);
|
||||
else if (curr_regime == FIND_PRIVATE_ARRAYS)
|
||||
auto result = FindPrivateArrays(loopGraph, fullIR);
|
||||
|
||||
const float elapsed = duration_cast<milliseconds>(high_resolution_clock::now() - timeForPass).count() / 1000.;
|
||||
const float elapsedGlobal = duration_cast<milliseconds>(high_resolution_clock::now() - globalTime).count() / 1000.;
|
||||
__spf_print(1, "PROFILE: time for this pass = %f sec (total %f sec)\n", elapsed, elapsedGlobal);
|
||||
|
||||
sendMessage_2lvl(wstring(L""));
|
||||
sendMessage_2lvl(2);
|
||||
if (internalExit != 0)
|
||||
throw -1;
|
||||
|
||||
@@ -2158,6 +2151,8 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
||||
runAnalysis(*project, REMOVE_COPIES, false);
|
||||
runAnalysis(*project, SWAP_LOOPS, false);
|
||||
|
||||
runPass(TRANSFORM_ASSUMED_SIZE_PARAMETERS, proj_name, folderName);
|
||||
|
||||
if (folderName || consoleMode)
|
||||
runAnalysis(*project, UNPARSE_FILE, true, additionalName.c_str(), folderName);
|
||||
}
|
||||
@@ -2640,7 +2635,10 @@ int main(int argc, char **argv)
|
||||
}
|
||||
|
||||
if (curr_regime == INSERT_PARALLEL_DIRS_NODIST)
|
||||
{
|
||||
ignoreArrayDistributeState = true;
|
||||
sharedMemoryParallelization = 1;
|
||||
}
|
||||
|
||||
if (runAsClient)
|
||||
{
|
||||
@@ -2662,35 +2660,12 @@ int main(int argc, char **argv)
|
||||
printStackTrace();
|
||||
printf("exception occurred\n");
|
||||
|
||||
FILE* outF = fopen((string(VISUALIZER_DATA_PATH) + "/error_messages.json").c_str(), "w");
|
||||
if (outF)
|
||||
{
|
||||
json byFileArray = json::array();
|
||||
for (auto& byFile : SPF_messages)
|
||||
{
|
||||
json inFile;
|
||||
inFile["file"] = byFile.first;
|
||||
|
||||
json messages = json::array();
|
||||
for (auto& message : byFile.second)
|
||||
{
|
||||
message.print(byFile.first);
|
||||
messages.push_back(message.toJson());
|
||||
}
|
||||
inFile["messages"] = messages;
|
||||
byFileArray.push_back(inFile);
|
||||
}
|
||||
json allMessages;
|
||||
allMessages["allMessages"] = byFileArray;
|
||||
|
||||
fprintf(outF, "%s", allMessages.dump().c_str());
|
||||
fclose(outF);
|
||||
}
|
||||
dumpMessages(true, SPF_messages, VISUALIZER_DATA_PATH);
|
||||
}
|
||||
dumpMessages(false, SPF_messages, VISUALIZER_DATA_PATH);
|
||||
|
||||
deleteAllAllocatedData(withDel);
|
||||
|
||||
|
||||
#if _WIN32 && _DEBUG
|
||||
if (leakMemDump)
|
||||
{
|
||||
|
||||
@@ -185,6 +185,8 @@ enum passes {
|
||||
|
||||
FIND_PRIVATE_ARRAYS,
|
||||
|
||||
TRANSFORM_ASSUMED_SIZE_PARAMETERS,
|
||||
|
||||
TEST_PASS,
|
||||
EMPTY_PASS
|
||||
};
|
||||
@@ -371,6 +373,8 @@ static void setPassValues()
|
||||
passNames[INSERT_NO_DISTR_FLAGS_FROM_GUI] = "INSERT_NO_DISTR_FLAGS_FROM_GUI";
|
||||
passNames[FIND_PRIVATE_ARRAYS] = "FIND_PRIVATE_ARRAYS";
|
||||
|
||||
passNames[TRANSFORM_ASSUMED_SIZE_PARAMETERS] = "TRANSFORM_ASSUMED_SIZE_PARAMETERS";
|
||||
|
||||
passNames[TEST_PASS] = "TEST_PASS";
|
||||
}
|
||||
|
||||
|
||||
@@ -169,7 +169,7 @@ std::map<int, UserFiles> filesInfo; // information about open,close,write and re
|
||||
//
|
||||
|
||||
//for FIND_PARAMETERS
|
||||
std::map< std::pair<std::string, int>, std::set<std::string>> parametersOfProject; // [file, line] -> set[vars]
|
||||
std::set<std::tuple<std::string, int, std::string>> parametersOfProject; // [file, line, varname]
|
||||
//
|
||||
|
||||
//for GET_MIN_MAX_BLOCK_DIST
|
||||
|
||||
@@ -6,6 +6,8 @@
|
||||
#include <set>
|
||||
#include <algorithm>
|
||||
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
|
||||
using std::map;
|
||||
using std::string;
|
||||
using std::vector;
|
||||
@@ -88,13 +90,13 @@ static void updateUseDefForInstruction(SAPFOR::BasicBlock* block, SAPFOR::Instru
|
||||
instr_operation == SAPFOR::CFG_OP::STORE)
|
||||
last_stack_op_useful = true;
|
||||
|
||||
for (auto e : res)
|
||||
for (auto& e : res)
|
||||
{
|
||||
def.insert(e);
|
||||
use.erase(e);
|
||||
}
|
||||
|
||||
for (auto e : args)
|
||||
for (auto& e : args)
|
||||
{
|
||||
use.insert(e);
|
||||
def.erase(e);
|
||||
@@ -164,7 +166,7 @@ public:
|
||||
{
|
||||
const auto& example = dynamic_cast<DeadCodeAnalysisNode*>(*prev.begin())->next_notempty_out;
|
||||
|
||||
for (auto p : prev)
|
||||
for (auto& p : prev)
|
||||
{
|
||||
DeadCodeAnalysisNode* next = dynamic_cast<DeadCodeAnalysisNode*>(p);
|
||||
|
||||
@@ -188,7 +190,7 @@ public:
|
||||
{
|
||||
set<DeadCodeAnalysisNode*> current = {};
|
||||
|
||||
for (auto nextP : getPrevBlocks())
|
||||
for (auto& nextP : getPrevBlocks())
|
||||
{
|
||||
DeadCodeAnalysisNode* next = dynamic_cast<DeadCodeAnalysisNode*>(nextP);
|
||||
|
||||
@@ -428,49 +430,7 @@ int removeDeadCode(SgStatement* func,
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto& cfg_pair = *(cfg.begin());
|
||||
|
||||
// delete unreachable blocks
|
||||
|
||||
set<SAPFOR::BasicBlock*> reachable;
|
||||
|
||||
for (auto b : cfg_pair.second)
|
||||
if(b->getInstructions().front()->isHeader() ||
|
||||
b->getInstructions().front()->getInstruction()->getOperation() == SAPFOR::CFG_OP::ENTRY)
|
||||
reachable.insert(b);
|
||||
|
||||
set<SAPFOR::BasicBlock*> worklist = reachable;
|
||||
while (worklist.size() != 0)
|
||||
{
|
||||
set<SAPFOR::BasicBlock*> to_insert;
|
||||
|
||||
for(auto b : worklist)
|
||||
for(auto next: b->getNext())
|
||||
if(reachable.insert(next).second)
|
||||
to_insert.insert(next);
|
||||
|
||||
worklist = to_insert;
|
||||
}
|
||||
|
||||
auto remove_unreachable_it = remove_if(cfg_pair.second.begin(), cfg_pair.second.end(),
|
||||
[&reachable](SAPFOR::BasicBlock* b)
|
||||
{
|
||||
if (reachable.find(b) == reachable.end())
|
||||
{
|
||||
for(auto next: b->getNext())
|
||||
if(reachable.find(next) != reachable.end())
|
||||
next->removePrev(b);
|
||||
|
||||
delete b;
|
||||
return true;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
);
|
||||
|
||||
reachable.clear();
|
||||
|
||||
cfg_pair.second.erase(remove_unreachable_it, cfg_pair.second.end());
|
||||
removedUnreachableBlocks(cfg_pair.second);
|
||||
|
||||
#if DEBUG_IR
|
||||
dumpCFG({ cfg_pair }, false);
|
||||
@@ -481,7 +441,7 @@ int removeDeadCode(SgStatement* func,
|
||||
map<string, FuncInfo*> funcByName;
|
||||
|
||||
for (auto& byFile : allFuncs)
|
||||
for (auto byFunc : byFile.second)
|
||||
for (auto& byFunc : byFile.second)
|
||||
funcByName[byFunc->funcName] = byFunc;
|
||||
|
||||
DeadCodeAnalysis analysis_object(func_parameters, funcByName);
|
||||
|
||||
@@ -4,10 +4,10 @@
|
||||
#include<vector>
|
||||
|
||||
#include "SgUtils.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "../CFGraph/live_variable_analysis.h"
|
||||
#include "../CFGraph/DataFlow/data_flow.h"
|
||||
#include "../CFGraph/DataFlow/backward_data_flow.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "CFGraph/live_variable_analysis.h"
|
||||
#include "CFGraph/DataFlow/data_flow.h"
|
||||
#include "CFGraph/DataFlow/backward_data_flow.h"
|
||||
|
||||
int removeDeadCode(SgStatement* func,
|
||||
const std::map<std::string, std::vector<FuncInfo*>>&allFuncs,
|
||||
|
||||
@@ -440,15 +440,18 @@ bool replaceConstantRec(SgExpression *&exp)
|
||||
if (exp->variant() == CONST_REF)
|
||||
{
|
||||
SgExpression *ret = ReplaceParameter_(exp);
|
||||
|
||||
int sign = 1;
|
||||
SgExpression* toCalc = ret;
|
||||
if (ret->variant() == UNARY_ADD_OP)
|
||||
toCalc = ret->lhs();
|
||||
if (ret->variant() == MINUS_OP)
|
||||
if (toCalc->variant() == UNARY_ADD_OP)
|
||||
toCalc = toCalc->lhs();
|
||||
|
||||
if (toCalc->variant() == MINUS_OP)
|
||||
{
|
||||
toCalc = ret->lhs();
|
||||
toCalc = toCalc->lhs();
|
||||
sign = -1;
|
||||
}
|
||||
|
||||
if (toCalc->isInteger())
|
||||
{
|
||||
exp = new SgValueExp(sign * toCalc->valueInteger());
|
||||
|
||||
@@ -1776,11 +1776,8 @@ static bool inliner(const string& fileName_in, const string& funcName, const int
|
||||
point.currCall = func->funcName;
|
||||
|
||||
__spf_print(1, " INLINE %s - ", func->funcName.c_str());
|
||||
#ifdef _WIN32
|
||||
sendMessage_2lvl(wstring(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> '") + wstring(func->funcName.begin(), func->funcName.end()) + L"'");
|
||||
#else
|
||||
sendMessage_2lvl(wstring(L"inlinig of function '") + wstring(func->funcName.begin(), func->funcName.end()) + L"'");
|
||||
#endif
|
||||
sendMessage_2lvl(6, func->funcName);
|
||||
|
||||
//1 level
|
||||
bool isInlined = run_inliner(funcMap, toInsert, SPF_messages, fileName, func, newSymbsToDeclare, point, commonBlocks);
|
||||
__spf_print(1, "%s\n", isInlined ? "done" : "fault");
|
||||
|
||||
@@ -103,7 +103,7 @@ void insertIntrinsicStat(const vector<FuncInfo*>& allFuncInfo)
|
||||
if (line <= 0)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
intr->setlineNumber(line);
|
||||
intr->setlineNumber(getNextNegativeLineNumber());
|
||||
st->insertStmtBefore(*intr, *func->funcPointer);
|
||||
}
|
||||
else
|
||||
@@ -136,33 +136,41 @@ void createInterfacesForOutCalls(FuncInfo* func)
|
||||
}
|
||||
}
|
||||
|
||||
static bool changeIfHasStarRange(SgExpression* arrayDecl, bool doReplace = false)
|
||||
static bool changeIfHasStarRange(SgExpression* arrayDecl, SgStatement* scope, vector<SgSymbol*>& parNames)
|
||||
{
|
||||
SgExpression* list = arrayDecl->lhs();
|
||||
bool has = doReplace;
|
||||
string varN = arrayDecl->symbol()->identifier() + string("_sz");
|
||||
bool has = false;
|
||||
|
||||
SgExpression* allDimsBefore = NULL;
|
||||
while (list)
|
||||
{
|
||||
const int var = list->lhs()->variant();
|
||||
if (var == STAR_RANGE)
|
||||
{
|
||||
has = true;
|
||||
list = list->rhs();
|
||||
|
||||
parNames.push_back(new SgSymbol(VARIABLE_NAME, varN.c_str(), SgTypeInt(), scope));
|
||||
SgExpression* par = allDimsBefore ? &(*new SgVarRefExp(parNames.back()) / *allDimsBefore) : (new SgVarRefExp(parNames.back()));
|
||||
|
||||
list->setLhs(par);
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
if (allDimsBefore == NULL)
|
||||
allDimsBefore = list->lhs();
|
||||
else
|
||||
allDimsBefore = &(*allDimsBefore * *list->lhs()->copyPtr());
|
||||
}
|
||||
|
||||
if (has)
|
||||
{
|
||||
list = arrayDecl->lhs();
|
||||
while (list)
|
||||
{
|
||||
list->setLhs(new SgExpression(DDOT));
|
||||
list = list->rhs();
|
||||
}
|
||||
}
|
||||
|
||||
return has;
|
||||
}
|
||||
|
||||
static void removeExternalStat(SgStatement* func, const set<string>& addedInterfaceFor)
|
||||
/*static void removeExternalStat(SgStatement* func, const set<string>& addedInterfaceFor)
|
||||
{
|
||||
vector<SgStatement*> toRem;
|
||||
for (auto st = func; st != func->lastNodeOfStmt(); st = st->lexNext())
|
||||
@@ -197,7 +205,7 @@ static void removeExternalStat(SgStatement* func, const set<string>& addedInterf
|
||||
|
||||
for (auto& rem : toRem)
|
||||
rem->deleteStmt();
|
||||
}
|
||||
}*/
|
||||
|
||||
template<typename T>
|
||||
static vector<FuncInfo*> sortByName(const T &funcs)
|
||||
@@ -210,9 +218,25 @@ static vector<FuncInfo*> sortByName(const T &funcs)
|
||||
return funcList;
|
||||
}
|
||||
|
||||
void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
static bool hasDvmParallel(SgStatement *func)
|
||||
{
|
||||
set<FuncInfo*> hasAssumedSizeArrays;
|
||||
for (auto st = func; st != func->lastNodeOfStmt(); st = st->lexNext())
|
||||
{
|
||||
const int var = st->variant();
|
||||
if (var == DVM_PARALLEL_ON_DIR || var == ACC_REGION_DIR ||
|
||||
var == ACC_ACTUAL_DIR || var == ACC_GET_ACTUAL_DIR)
|
||||
return true;
|
||||
|
||||
if (st->variant() == CONTAINS_STMT)
|
||||
break;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
void transformAssumedSizeParameters(const map<string, vector<FuncInfo*>>& allFuncInfo)
|
||||
{
|
||||
map<string, vector<int>> assumedSizeArraysByFunc;
|
||||
|
||||
for (auto& funcByFile : allFuncInfo)
|
||||
{
|
||||
@@ -225,6 +249,12 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
|
||||
if (prog == NULL)
|
||||
continue;
|
||||
|
||||
if (!hasDvmParallel(prog))
|
||||
continue;
|
||||
|
||||
vector<SgSymbol*> parNames;
|
||||
SgStatement* scope = prog->getScopeForDeclare();
|
||||
|
||||
vector<SgExpression*> arrayRefs;
|
||||
bool hasRefs = false;
|
||||
for (int z = 0; z < func->funcParams.countOfPars; ++z)
|
||||
@@ -244,13 +274,8 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
|
||||
{
|
||||
if (list->lhs() && list->lhs()->symbol()->identifier() == name)
|
||||
{
|
||||
if (changeIfHasStarRange(list->lhs()))
|
||||
{
|
||||
hasRefs = true;
|
||||
hasAssumedSizeArrays.insert(func);
|
||||
}
|
||||
else
|
||||
arrayRefs.push_back(list->lhs());
|
||||
if (changeIfHasStarRange(list->lhs(), scope, parNames))
|
||||
assumedSizeArraysByFunc[func->funcName].push_back(z);
|
||||
break;
|
||||
}
|
||||
list = list->rhs();
|
||||
@@ -259,13 +284,20 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
|
||||
}
|
||||
}
|
||||
|
||||
if (hasRefs)
|
||||
for (auto& ref : arrayRefs)
|
||||
changeIfHasStarRange(ref, true);
|
||||
if (parNames.size())
|
||||
{
|
||||
SgProcHedrStmt* proc = isSgProcHedrStmt(func->funcPointer->GetOriginal());
|
||||
checkNull(proc, convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
//makeDeclaration(parNames, scope);
|
||||
|
||||
for (auto& newPar : parNames)
|
||||
proc->AddArg(*new SgVarRefExp(newPar));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (hasAssumedSizeArrays.size() == 0)
|
||||
if (assumedSizeArraysByFunc.size() == 0)
|
||||
return;
|
||||
|
||||
for (auto& funcByFile : allFuncInfo)
|
||||
@@ -273,26 +305,60 @@ void createInterfacesForAssumedSize(const map<string, vector<FuncInfo*>>& allFun
|
||||
if (SgFile::switchToFile(funcByFile.first) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
SgSymbol* funcSize = new SgSymbol(FUNCTION_NAME, "size");
|
||||
|
||||
for (auto& func : sortByName(funcByFile.second))
|
||||
{
|
||||
SgProgHedrStmt* prog = isSgProgHedrStmt(func->funcPointer->GetOriginal());
|
||||
if (prog == NULL)
|
||||
continue;
|
||||
|
||||
set<string> addedInterfaceFor;
|
||||
for (auto& elem : sortByName(func->callsFromV))
|
||||
for (auto& detailedCall : func->callsFromDetailed)
|
||||
{
|
||||
auto it = hasAssumedSizeArrays.find(elem);
|
||||
if (it != hasAssumedSizeArrays.end())
|
||||
auto it = assumedSizeArraysByFunc.find(detailedCall.detailCallsFrom.first);
|
||||
if (it != assumedSizeArraysByFunc.end())
|
||||
{
|
||||
auto callFrom = *it;
|
||||
DvmhRegionInserter::createInterfaceBlockForOutCall(func, callFrom);
|
||||
addedInterfaceFor.insert(callFrom->funcName);
|
||||
auto pointer = detailedCall.pointerDetailCallsFrom;
|
||||
|
||||
SgExpression* list = NULL;
|
||||
if (pointer.second == FUNC_CALL)
|
||||
{
|
||||
SgExpression* p = (SgExpression*)pointer.first;
|
||||
list = p->lhs();
|
||||
}
|
||||
else
|
||||
{
|
||||
SgStatement* p = (SgStatement*)pointer.first;
|
||||
list = p->expr(0);
|
||||
}
|
||||
|
||||
if (addedInterfaceFor.size())
|
||||
removeExternalStat(prog, addedInterfaceFor);
|
||||
SgExpression* last = list;
|
||||
vector<SgExpression*> pars;
|
||||
while (list)
|
||||
{
|
||||
last = list;
|
||||
pars.push_back(list->lhs());
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
for (int z = 0; z < it->second.size(); ++z)
|
||||
{
|
||||
int parNum = it->second[z];
|
||||
if (parNum >= pars.size())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
//TODO: need to do it better
|
||||
SgExpression* parArray = pars[parNum]->copyPtr();
|
||||
parArray->setLhs(NULL);
|
||||
parArray->setRhs(NULL);
|
||||
|
||||
SgFunctionCallExp* call = new SgFunctionCallExp(*funcSize, *parArray);
|
||||
|
||||
last->setRhs(new SgExpression(EXPR_LIST, call));
|
||||
last = last->rhs();
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -459,7 +525,7 @@ static void insertIntents(set<string>& identificators, SgStatement* header, cons
|
||||
if (args.size())
|
||||
{
|
||||
SgIntentStmt* intent = new SgIntentStmt(*makeExprList(args), *attr);
|
||||
intent->setlineNumber(lastDecl->lineNumber());
|
||||
intent->setlineNumber(getNextNegativeLineNumber());
|
||||
|
||||
lastDecl->insertStmtAfter(*intent, (header == lastDecl) ? *header : *lastDecl->controlParent());
|
||||
}
|
||||
@@ -1388,6 +1454,37 @@ static string makeName(SgSymbol* var, map<SgSymbol*, set< SgSymbol*>>& modVarsTo
|
||||
return name;
|
||||
}
|
||||
|
||||
static bool filterFromList(SgStatement* st, const set<string>& idents, bool exclude = false)
|
||||
{
|
||||
bool empty = false;
|
||||
SgExpression* list = st->expr(0);
|
||||
vector<SgExpression*> newList;
|
||||
|
||||
int total = 0;
|
||||
while (list)
|
||||
{
|
||||
if (exclude)
|
||||
{
|
||||
if (idents.find(list->lhs()->symbol()->identifier()) == idents.end())
|
||||
newList.push_back(list->lhs());
|
||||
}
|
||||
else
|
||||
{
|
||||
if (idents.find(list->lhs()->symbol()->identifier()) != idents.end())
|
||||
newList.push_back(list->lhs());
|
||||
}
|
||||
total++;
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (newList.size() == 0)
|
||||
empty = true;
|
||||
else if (total != newList.size())
|
||||
st->setExpression(0, makeExprList(newList));
|
||||
|
||||
return empty;
|
||||
}
|
||||
|
||||
static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
|
||||
{
|
||||
string oldFile = current_file->filename();
|
||||
@@ -1395,22 +1492,21 @@ static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto copy = duplicateProcedure(func, NULL, false, false, false, true);
|
||||
|
||||
const set<string> ident(pars.identificators.begin(), pars.identificators.end());
|
||||
const set<string> idents(pars.identificators.begin(), pars.identificators.end());
|
||||
|
||||
//remove all exec
|
||||
SgStatement* st = copy->lexNext();
|
||||
SgStatement* last = copy->lastNodeOfStmt();
|
||||
vector<SgStatement*> toExtract;
|
||||
|
||||
while (st != last)
|
||||
{
|
||||
if (isDVM_stat(st) || isSPF_stat(st))
|
||||
{
|
||||
if (st->variant() != ACC_ROUTINE_DIR)
|
||||
{
|
||||
SgStatement* next = st->lexNext();
|
||||
st->extractStmt();
|
||||
st = next;
|
||||
toExtract.push_back(st);
|
||||
st = st->lexNext();
|
||||
}
|
||||
else
|
||||
st = st->lexNext();
|
||||
@@ -1431,31 +1527,20 @@ static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
|
||||
st = copy->lexNext();
|
||||
while (st != last)
|
||||
{
|
||||
if (st->variant() == VAR_DECL
|
||||
|| st->variant() == VAR_DECL_90
|
||||
|| st->variant() == DIM_STAT
|
||||
|| st->variant() == INTENT_STMT)
|
||||
{
|
||||
SgExpression* list = st->expr(0);
|
||||
vector<SgExpression*> newList;
|
||||
while (list)
|
||||
{
|
||||
if (ident.find(list->lhs()->symbol()->identifier()) != ident.end())
|
||||
newList.push_back(list->lhs());
|
||||
list = list->rhs();
|
||||
}
|
||||
const int var = st->variant();
|
||||
|
||||
if (newList.size() == 0)
|
||||
if (var == VAR_DECL || var == VAR_DECL_90 || var == DIM_STAT ||
|
||||
var == INTENT_STMT || var == EXTERN_STAT)
|
||||
{
|
||||
bool empty = filterFromList(st, idents);
|
||||
if (empty)
|
||||
{
|
||||
SgStatement* next = st->lexNext();
|
||||
toExtract.push_back(st);
|
||||
st = next;
|
||||
st = st->lexNext();
|
||||
continue;
|
||||
}
|
||||
else
|
||||
st->setExpression(0, makeExprList(newList));
|
||||
}
|
||||
else
|
||||
else if (!isDVM_stat(st) && !isSPF_stat(st))
|
||||
toExtract.push_back(st);
|
||||
|
||||
if (st->variant() == CONTAINS_STMT)
|
||||
@@ -1466,16 +1551,56 @@ static string getInterfaceBlock(SgStatement* func, const FuncParam& pars)
|
||||
for (auto& elem : toExtract)
|
||||
elem->extractStmt();
|
||||
|
||||
string retVal = copy->unparse();
|
||||
string codeString = copy->unparse();
|
||||
|
||||
if (SgFile::switchToFile(oldFile) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
//insert tabs
|
||||
const string tab = " ";
|
||||
const int countEnds = std::count(codeString.begin(), codeString.end(), '\n');
|
||||
|
||||
string retVal = " ";
|
||||
retVal.reserve(retVal.size() + codeString.size() + countEnds * tab.size());
|
||||
|
||||
for (int z = 0, ends = 0; z < codeString.size(); ++z)
|
||||
{
|
||||
retVal += codeString[z];
|
||||
if (codeString[z] == '\n')
|
||||
{
|
||||
ends++;
|
||||
if (ends == countEnds)
|
||||
continue;
|
||||
|
||||
int p = z + 1;
|
||||
while (codeString[p] == ' ' && p < codeString.size())
|
||||
++p;
|
||||
|
||||
auto start = p;
|
||||
auto end = string::npos;
|
||||
auto sub = codeString.find("subroutine", p);
|
||||
auto func = codeString.find("function", p);
|
||||
auto end_sub = codeString.find("end subroutine", p);
|
||||
auto end_func = codeString.find("end function", p);
|
||||
|
||||
if (sub != end && sub == start || end_sub != end && end_sub == start ||
|
||||
func != end && func == start || end_func != end && end_func == start)
|
||||
{
|
||||
retVal += " ";
|
||||
}
|
||||
else
|
||||
retVal += tab;
|
||||
}
|
||||
}
|
||||
|
||||
return retVal;
|
||||
}
|
||||
|
||||
static void insertInterface(SgStatement* func, const string& iface)
|
||||
void insertInterface(SgStatement* func, const FuncInfo *callFrom)
|
||||
{
|
||||
const string& iface = getInterfaceBlock(callFrom->funcPointer->GetOriginal(), callFrom->funcParams);
|
||||
const string& fName = callFrom->funcName;
|
||||
|
||||
string oldFile = current_file->filename();
|
||||
if (!func->switchToFile())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
@@ -1484,6 +1609,18 @@ static void insertInterface(SgStatement* func, const string& iface)
|
||||
SgStatement* last = func->lastNodeOfStmt();
|
||||
while (st != last)
|
||||
{
|
||||
if (st->variant() == VAR_DECL || st->variant() == VAR_DECL_90)
|
||||
{
|
||||
bool empty = filterFromList(st, { fName }, true);
|
||||
if (empty)
|
||||
{
|
||||
SgStatement* next = st->lexNext();
|
||||
st->extractStmt();
|
||||
st = next;
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (isSgExecutableStatement(st))
|
||||
break;
|
||||
st = st->lexNext();
|
||||
@@ -1491,7 +1628,7 @@ static void insertInterface(SgStatement* func, const string& iface)
|
||||
SgStatement* ifaceBlock = new SgStatement(INTERFACE_STMT);
|
||||
addControlEndToStmt(ifaceBlock->thebif);
|
||||
|
||||
ifaceBlock->setlineNumber(st->lineNumber());
|
||||
ifaceBlock->setlineNumber(getNextNegativeLineNumber());
|
||||
ifaceBlock->setFileName(st->fileName());
|
||||
st->insertStmtBefore(*ifaceBlock, *st->controlParent());
|
||||
ifaceBlock->lastNodeOfStmt()->addComment(iface.c_str());
|
||||
@@ -1507,7 +1644,7 @@ static void createInterfaceBlockForToCalls(FuncInfo* func)
|
||||
if (callTo->interfaceBlocks.find(func->funcName) == callTo->interfaceBlocks.end())
|
||||
{
|
||||
callTo->interfaceBlocks[func->funcName] = func;
|
||||
insertInterface(callTo->funcPointer, getInterfaceBlock(func->funcPointer->GetOriginal(), func->funcParams));
|
||||
insertInterface(callTo->funcPointer, func);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -6,7 +6,6 @@ bool checkOutCalls(const std::set<std::string>& outCalls);
|
||||
std::map<SgStatement*, std::set<std::string>> fillFromIntent(SgStatement* header);
|
||||
void intentInsert(const std::vector<FuncInfo*>& allFuncInfo);
|
||||
void intentInsertToInterfaces(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
|
||||
void createInterfacesForAssumedSize(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
|
||||
void createInterfacesForOutCalls(FuncInfo* func);
|
||||
void setPureStatus(const std::set<FuncInfo*>& funcInfo);
|
||||
void setPureStatus(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
|
||||
@@ -14,3 +13,7 @@ void setPureStatus(const std::map<std::string, std::vector<FuncInfo*>>& allFuncI
|
||||
void commonTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo, const std::map<std::string, CommonBlock*>& commonBlocks);
|
||||
void saveTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
|
||||
void moduleTransfer(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
|
||||
|
||||
void insertInterface(SgStatement* func, const FuncInfo* callFrom);
|
||||
|
||||
void transformAssumedSizeParameters(const std::map<std::string, std::vector<FuncInfo*>>& allFuncInfo);
|
||||
@@ -4,6 +4,7 @@
|
||||
#include "expr_transform.h"
|
||||
#include "errors.h"
|
||||
#include "SgUtils.h"
|
||||
#include "utils.h"
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include <queue>
|
||||
@@ -17,22 +18,9 @@ using std::make_pair;
|
||||
using std::queue;
|
||||
using std::wstring;
|
||||
|
||||
static int gcd(int a, int b)
|
||||
{
|
||||
while (a != b)
|
||||
{
|
||||
if (a > b)
|
||||
a = a - b;
|
||||
else
|
||||
b = b - a;
|
||||
}
|
||||
|
||||
return a;
|
||||
}
|
||||
|
||||
static SgSymbol* getLoopSymbol(const LoopGraph* loop)
|
||||
{
|
||||
if (!loop || !loop->isFor)
|
||||
if (!loop || !loop->isFor())
|
||||
return NULL;
|
||||
|
||||
SgForStmt* stmt = (SgForStmt*)loop->loop->GetOriginal();
|
||||
@@ -679,12 +667,12 @@ static void renameIterationVariables(LoopGraph* loop, const map<SgSymbol*, SgSym
|
||||
{
|
||||
if (loop)
|
||||
{
|
||||
string& loopName = loop->loopSymbol;
|
||||
for (auto& pair : symbols)
|
||||
const string& loopName = loop->loopSymbol();
|
||||
for (auto& [from, to] : symbols)
|
||||
{
|
||||
if (pair.first->identifier() == loopName)
|
||||
if (from->identifier() == loopName)
|
||||
{
|
||||
loop->loopSymbol = (string)pair.second->identifier();
|
||||
loop->loopSymbols.replaceMainVar(to->identifier());
|
||||
break;
|
||||
}
|
||||
}
|
||||
@@ -703,9 +691,9 @@ static void renameVariablesInLoop(LoopGraph* loop, const map<SgSymbol*, SgSymbol
|
||||
if (st->variant() == FOR_NODE)
|
||||
{
|
||||
SgForStmt* for_st = (SgForStmt*)st;
|
||||
for (auto& pair : symbols)
|
||||
if (isEqSymbols(pair.first, for_st->symbol()))
|
||||
for_st->setDoName(*pair.second);
|
||||
for (auto& [from, to] : symbols)
|
||||
if (isEqSymbols(from, for_st->symbol()))
|
||||
for_st->setDoName(*to);
|
||||
}
|
||||
|
||||
for (int i = 0; i < 3; ++i)
|
||||
@@ -722,12 +710,12 @@ static void renamePrivatesInMap(LoopGraph* loop, const map<SgSymbol*, SgSymbol*>
|
||||
for (auto& priv : privates->second)
|
||||
{
|
||||
bool found = false;
|
||||
for (auto& pair : symbols)
|
||||
for (auto& [from, to] : symbols)
|
||||
{
|
||||
if (isEqSymbols(priv, pair.first))
|
||||
if (isEqSymbols(priv, from))
|
||||
{
|
||||
found = true;
|
||||
newList.insert(pair.second);
|
||||
newList.insert(to);
|
||||
break;
|
||||
}
|
||||
}
|
||||
@@ -1385,7 +1373,6 @@ static int getNewStep(SgForStmt* firstLoopStmt, SgForStmt* loopStmt)
|
||||
step2Val = step2->valueInteger();
|
||||
|
||||
int stepGcd = gcd(std::abs(step1Val), std::abs(step2Val));
|
||||
|
||||
int newStep = stepGcd;
|
||||
|
||||
int startDifference = 0;
|
||||
@@ -1603,7 +1590,7 @@ static bool combine(LoopGraph* firstLoop, const vector<LoopGraph*>& nextLoops, s
|
||||
bool wasCombine = false;
|
||||
for (LoopGraph* loop : nextLoops)
|
||||
{
|
||||
if (!loop->isFor)
|
||||
if (!loop->isFor())
|
||||
return wasCombine;
|
||||
|
||||
int perfectLoop = std::min(firstLoop->perfectLoop, loop->perfectLoop);
|
||||
@@ -1736,7 +1723,7 @@ static bool tryToCombine(vector<LoopGraph*>& loopGraphs, map<LoopGraph*, set<SgS
|
||||
{
|
||||
LoopGraph* loop = loops[z];
|
||||
newloopGraphs.push_back(loop);
|
||||
if (!loop->isFor)
|
||||
if (!loop->isFor())
|
||||
continue;
|
||||
|
||||
vector<LoopGraph*> nextLoops = getNextLoops(loop, loopGraphs, -1);
|
||||
|
||||
@@ -6,7 +6,7 @@
|
||||
#include "../LoopAnalyzer/loop_analyzer.h"
|
||||
#include "expr_transform.h"
|
||||
#include "errors.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "../SageAnalysisTool/OmegaForSage/include/lang-interf.h"
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "../DirectiveProcessing/directive_omp_parser.h"
|
||||
@@ -1035,7 +1035,7 @@ int splitLoops(SgFile *file, vector<LoopGraph*> &loopGraphs, vector<Messages> &m
|
||||
|
||||
for (auto &loopPair : mapLoopGraph)
|
||||
{
|
||||
if (!loopPair.second->isFor)
|
||||
if (!loopPair.second->isFor())
|
||||
continue;
|
||||
|
||||
LoopGraph *loop = loopPair.second;
|
||||
|
||||
@@ -2257,7 +2257,7 @@ void removePrivatesAnalysis(string filename,
|
||||
{
|
||||
for (LoopGraph* loop : loopGraphs)
|
||||
{
|
||||
if (!loop->isFor)
|
||||
if (!loop->isFor())
|
||||
continue;
|
||||
|
||||
SgForStmt* loopStmt = (SgForStmt*)loop->loop->GetOriginal();
|
||||
|
||||
@@ -2,8 +2,8 @@
|
||||
|
||||
#include "dvm.h"
|
||||
#include "../DirectiveProcessing/directive_parser.h"
|
||||
#include "../CFGraph/CFGraph.h"
|
||||
#include "../CFGraph/RD_subst.h"
|
||||
#include "CFGraph/CFGraph.h"
|
||||
#include "CFGraph/RD_subst.h"
|
||||
|
||||
// Regime defines the regime of private removing
|
||||
enum class Regime { DEFLT = 1, REGULAR_INDEXES };
|
||||
|
||||
@@ -74,7 +74,7 @@ static void fillIterationVariables(const LoopGraph* loop, set<string>& vars, int
|
||||
{
|
||||
if (dimensions == -1)
|
||||
{
|
||||
vars.insert(loop->loopSymbol);
|
||||
vars.insert(loop->loopSymbol());
|
||||
for (LoopGraph* child : loop->children)
|
||||
fillIterationVariables(child, vars);
|
||||
}
|
||||
@@ -82,7 +82,7 @@ static void fillIterationVariables(const LoopGraph* loop, set<string>& vars, int
|
||||
{
|
||||
for (int i = 0; i < dimensions; ++i)
|
||||
{
|
||||
vars.insert(loop->loopSymbol);
|
||||
vars.insert(loop->loopSymbol());
|
||||
if (i != dimensions - 1)
|
||||
loop = loop->children[0];
|
||||
}
|
||||
|
||||
@@ -17,6 +17,157 @@ using std::pair;
|
||||
|
||||
#define DEBUG_TRACE 0
|
||||
|
||||
static bool hasArrayRef(SgExpression* ex)
|
||||
{
|
||||
if (ex)
|
||||
return isArrayRef(ex) || hasArrayRef(ex->lhs()) || hasArrayRef(ex->rhs());
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static inline bool isArrayDeclaration(SgStatement* st)
|
||||
{
|
||||
return isSgDeclarationStatement(st) || isSgVarListDeclStmt(st) || isSgNestedVarListDeclStmt(st);
|
||||
}
|
||||
|
||||
static SgExpression* findExprWithVariant(SgExpression* exp, int variant)
|
||||
{
|
||||
if (exp)
|
||||
{
|
||||
if (exp->variant() == variant)
|
||||
return exp;
|
||||
|
||||
auto *l = findExprWithVariant(exp->lhs(), variant);
|
||||
if (l)
|
||||
return l;
|
||||
|
||||
auto *r = findExprWithVariant(exp->rhs(), variant);
|
||||
if (r)
|
||||
return r;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static bool switchToDeclarationFile(DIST::Array* array_p,
|
||||
pair<string, int>& decl_place,
|
||||
const string ¤t_file_name,
|
||||
FuncInfo *current_func)
|
||||
{
|
||||
if (!array_p)
|
||||
return false;
|
||||
|
||||
// try to find declaration from current function
|
||||
for (const auto &p : array_p->GetDeclInfo())
|
||||
{
|
||||
if (p.first == current_file_name &&
|
||||
current_func->linesNum.first <= p.second &&
|
||||
p.second <= current_func->linesNum.second)
|
||||
{
|
||||
decl_place = p;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
for (const auto &p : array_p->GetDeclInfo())
|
||||
{
|
||||
if (SgFile::switchToFile(p.first) != -1)
|
||||
{
|
||||
decl_place = p;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool checkAssumedShape(SgStatement* decl, const string& array_name)
|
||||
{
|
||||
SgExpression* list = decl->expr(0);
|
||||
SgExpression* dim_list = NULL;
|
||||
|
||||
while (list)
|
||||
{
|
||||
auto *arr_ref = list->lhs();
|
||||
|
||||
if (arr_ref &&
|
||||
arr_ref->symbol() &&
|
||||
arr_ref->symbol()->identifier() &&
|
||||
arr_ref->symbol()->identifier() == array_name)
|
||||
{
|
||||
dim_list = arr_ref->lhs();
|
||||
break;
|
||||
}
|
||||
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (!dim_list)
|
||||
{
|
||||
auto *dim_expr = findExprWithVariant(decl->expr(2), DIMENSION_OP);
|
||||
if (dim_expr)
|
||||
dim_list = dim_expr->lhs();
|
||||
}
|
||||
|
||||
while (dim_list)
|
||||
{
|
||||
auto *lhs = dim_list->lhs();
|
||||
|
||||
if (lhs && lhs->variant() == DDOT && (!lhs->lhs() || !lhs->rhs()))
|
||||
return true;
|
||||
|
||||
dim_list = dim_list->rhs();
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool checkAssumedSize(const string &array_name, DIST::Array* array_p, const string ¤t_file_name, FuncInfo *current_func)
|
||||
{
|
||||
if (!array_p)
|
||||
return true; // raise true to prevent array from copying
|
||||
|
||||
bool found = false;
|
||||
|
||||
pair<string, int> decl_place;
|
||||
|
||||
if (!switchToDeclarationFile(array_p, decl_place, current_file_name, current_func))
|
||||
return true;
|
||||
|
||||
auto *st = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
||||
checkNull(st, convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
SgExpression* list = st->expr(0);
|
||||
while (list)
|
||||
{
|
||||
if (list->lhs() &&
|
||||
list->lhs()->symbol() &&
|
||||
list->lhs()->symbol()->identifier() &&
|
||||
list->lhs()->symbol()->identifier() == array_name
|
||||
)
|
||||
{
|
||||
if(findExprWithVariant(list->lhs(), STAR_RANGE))
|
||||
found = true;
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
list = list->rhs();
|
||||
}
|
||||
|
||||
if (!found)
|
||||
{
|
||||
auto *dim_expr = findExprWithVariant(st->expr(2), DIMENSION_OP);
|
||||
if (dim_expr && findExprWithVariant(dim_expr, STAR_RANGE))
|
||||
found = true;
|
||||
}
|
||||
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__); // can't switch back to file with array usage
|
||||
|
||||
return found;
|
||||
}
|
||||
|
||||
static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
|
||||
{
|
||||
if (exp)
|
||||
@@ -29,12 +180,15 @@ static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
|
||||
}
|
||||
}
|
||||
|
||||
static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays, SgStatement* stat)
|
||||
static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays,
|
||||
SgStatement* stat,
|
||||
const string& current_file_name,
|
||||
FuncInfo *current_func)
|
||||
{
|
||||
auto var = stat->variant();
|
||||
|
||||
if (var != READ_STAT && var != PRINT_STAT && var != WRITE_STAT)
|
||||
return;
|
||||
return false;
|
||||
|
||||
// check if such IO allowed in dvm:
|
||||
// list should consist only of single array and format string should be *
|
||||
@@ -44,24 +198,28 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
SgExpression* ioList = stat->expr(0);
|
||||
|
||||
if (!ioList)
|
||||
return;
|
||||
return false;
|
||||
|
||||
if (ioList->variant() != EXPR_LIST)
|
||||
return;
|
||||
return false;
|
||||
|
||||
if (ioList->rhs() == NULL)
|
||||
{
|
||||
SgExpression* arg = ioList->lhs();
|
||||
if (!arg)
|
||||
return;
|
||||
return false;
|
||||
|
||||
if (!isArrayRef(arg))
|
||||
return;
|
||||
|
||||
if (arg->lhs())
|
||||
if (hasArrayRef(arg))
|
||||
{
|
||||
if (isArrayRef(arg) && arg->lhs())
|
||||
need_replace = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
need_replace = true;
|
||||
}
|
||||
@@ -74,37 +232,43 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
{
|
||||
SgExpression* fmt = stat->expr(1);
|
||||
if (!fmt || fmt->variant() != SPEC_PAIR || fmt->lhs()->variant() != KEYWORD_VAL)
|
||||
{
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
|
||||
if (fmt->rhs()->variant() != KEYWORD_VAL || fmt->rhs()->sunparse() != "*")
|
||||
need_replace = true;
|
||||
|
||||
|
||||
break;
|
||||
}
|
||||
case READ_STAT:
|
||||
case WRITE_STAT:
|
||||
{
|
||||
|
||||
SgExpression* spec = stat->expr(1);
|
||||
__spf_print(DEBUG_TRACE, "[%d: %s (%d)]\n", 2000, spec->rhs()->unparse(), spec->rhs()->variant());
|
||||
if (!spec || spec->variant() != EXPR_LIST ||
|
||||
spec->lhs()->variant() != SPEC_PAIR ||
|
||||
!spec->rhs() || !spec->rhs()->lhs() || spec->rhs()->lhs()->variant() != SPEC_PAIR)
|
||||
|
||||
if (spec->variant() == SPEC_PAIR)
|
||||
{
|
||||
if (spec->rhs()->variant() != KEYWORD_VAL || spec->rhs()->sunparse() != "*")
|
||||
{
|
||||
need_replace = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
while (spec)
|
||||
{
|
||||
auto *kv = spec->lhs();
|
||||
if (!kv || kv->variant() != SPEC_PAIR || !kv->rhs())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
|
||||
if (kv->rhs()->variant() != KEYWORD_VAL || kv->rhs()->sunparse() != "*")
|
||||
{
|
||||
need_replace = true;
|
||||
break;
|
||||
}
|
||||
|
||||
SgExpression* unit_val = spec->lhs()->rhs(), * fmt_val = spec->rhs()->lhs()->rhs();
|
||||
|
||||
if (unit_val->variant() != KEYWORD_VAL || unit_val->sunparse() != "*" ||
|
||||
fmt_val->variant() != KEYWORD_VAL || fmt_val->sunparse() != "*")
|
||||
need_replace = true;
|
||||
|
||||
spec = spec->rhs();
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
default:
|
||||
@@ -113,7 +277,9 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
}
|
||||
|
||||
if (!need_replace)
|
||||
return;
|
||||
return false;
|
||||
|
||||
bool ret = false;
|
||||
|
||||
set<SgSymbol*> found_arrays;
|
||||
|
||||
@@ -124,11 +290,21 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
||||
{
|
||||
string array_name = string(by_symb->identifier());
|
||||
DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(by_symb), array_name);
|
||||
if (array_p && array_p->GetDistributeFlagVal() == Distribution::distFlag::IO_PRIV && arrays[by_symb].insert(stat).second)
|
||||
__spf_print(DEBUG_TRACE, "[%d]: add array %s\n", stat->lineNumber(), array_p->GetName().c_str());
|
||||
if (array_p &&
|
||||
array_p->GetDistributeFlagVal() == Distribution::distFlag::IO_PRIV &&
|
||||
!checkAssumedSize(array_name, array_p, current_file_name, current_func))
|
||||
{
|
||||
auto inserted = arrays[by_symb].insert(stat).second;
|
||||
|
||||
if (inserted)
|
||||
__spf_print(DEBUG_TRACE, "[%d]: add array %s %p\n", stat->lineNumber(), array_p->GetName().c_str(), by_symb);
|
||||
|
||||
ret = true;
|
||||
}
|
||||
}
|
||||
|
||||
__spf_print(DEBUG_TRACE, "[replace]\n");
|
||||
return ret;
|
||||
}
|
||||
|
||||
static void replaceArrayRec(SgSymbol* arr, SgSymbol* replace_by, SgExpression* exp, bool& has_read, bool& has_write, bool from_read, bool from_write)
|
||||
@@ -136,7 +312,8 @@ static void replaceArrayRec(SgSymbol* arr, SgSymbol* replace_by, SgExpression* e
|
||||
if (!exp)
|
||||
return;
|
||||
|
||||
if (exp->symbol() && exp->symbol()->identifier() && strcmp(exp->symbol()->identifier(), arr->identifier()) == 0)
|
||||
if (isArrayRef(exp) &&
|
||||
strcmp(exp->symbol()->identifier(), arr->identifier()) == 0)
|
||||
{
|
||||
has_read |= from_read;
|
||||
has_write |= from_write;
|
||||
@@ -197,16 +374,19 @@ static void replaceArrayRec(SgSymbol* arr, SgSymbol* replace_by, SgStatement* st
|
||||
}
|
||||
}
|
||||
|
||||
static void copyArrayBetweenStatements(SgSymbol* replace_symb, SgSymbol* replace_by, SgStatement* start, SgStatement* last, bool start_is_scope)
|
||||
static void copyArrayBetweenStatements(SgSymbol* replace_symb,
|
||||
SgSymbol* replace_by,
|
||||
SgStatement* start,
|
||||
SgStatement* last,
|
||||
bool start_is_scope,
|
||||
FuncInfo *func_info)
|
||||
{
|
||||
while (start->lexNext() && !isSgExecutableStatement(start->lexNext()))
|
||||
start = start->lexNext();
|
||||
|
||||
auto* stop = last->lexNext();
|
||||
|
||||
bool has_read = false, has_write = false;
|
||||
|
||||
for (auto* st = start->lexNext(); st && st != stop->lexPrev(); st = st->lexNext())
|
||||
for (auto* st = start->lexNext(); st && st != last; st = st->lexNext())
|
||||
replaceArrayRec(replace_symb, replace_by, st, has_read, has_write);
|
||||
|
||||
|
||||
@@ -218,10 +398,23 @@ static void copyArrayBetweenStatements(SgSymbol* replace_symb, SgSymbol* replace
|
||||
auto* parent = start_is_scope ? start : start->controlParent();
|
||||
if (parent && parent->lastNodeOfStmt() == start)
|
||||
parent = parent->controlParent();
|
||||
checkNull(parent, convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
start->insertStmtAfter(*assign, *parent);
|
||||
}
|
||||
|
||||
if (has_write)
|
||||
{
|
||||
for (int i = 0; i < func_info->funcParams.identificators.size(); i++)
|
||||
{
|
||||
if (func_info->funcParams.identificators[i] == replace_symb->identifier())
|
||||
{
|
||||
has_write &= func_info->funcParams.isArgOut(i);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (has_write)
|
||||
{
|
||||
// A = A_reg
|
||||
@@ -232,9 +425,14 @@ static void copyArrayBetweenStatements(SgSymbol* replace_symb, SgSymbol* replace
|
||||
}
|
||||
}
|
||||
|
||||
static void replaceArrayInFragment(SgSymbol* replace_symb, const set<SgStatement*> usages, SgSymbol* replace_by, SgStatement* start, SgStatement* last, const string& filename)
|
||||
static void replaceArrayInFragment(SgSymbol* replace_symb,
|
||||
const set<SgStatement*> usages,
|
||||
SgSymbol* replace_by,
|
||||
SgStatement* start,
|
||||
SgStatement* last,
|
||||
FuncInfo *func_info)
|
||||
{
|
||||
while (start->lexNext() && !isSgExecutableStatement(start->lexNext()))
|
||||
while (start->lexNext() && (!isSgExecutableStatement(start->lexNext()) || start->lexNext()->variant() == ALLOCATE_STMT))
|
||||
start = start->lexNext();
|
||||
|
||||
set<SgStatement*> not_opened, not_closed, copied;
|
||||
@@ -301,7 +499,7 @@ static void replaceArrayInFragment(SgSymbol* replace_symb, const set<SgStatement
|
||||
}
|
||||
|
||||
__spf_print(DEBUG_TRACE, "[copy %s] [%d, %d]\n", replace_symb->identifier(), scope_start->lineNumber(), scope_end->lineNumber());
|
||||
copyArrayBetweenStatements(replace_symb, replace_by, scope_start, scope_end, copy_scope == scope_start);
|
||||
copyArrayBetweenStatements(replace_symb, replace_by, scope_start, scope_end, copy_scope == scope_start, func_info);
|
||||
copied.insert(copy_scope);
|
||||
}
|
||||
}
|
||||
@@ -324,12 +522,16 @@ static bool ioReginBorder(SgStatement* stat, SgStatement* last_io_bound)
|
||||
STOP_STAT,
|
||||
STOP_NODE,
|
||||
EXIT_STMT,
|
||||
EXIT_NODE
|
||||
EXIT_NODE,
|
||||
GOTO_NODE
|
||||
};
|
||||
|
||||
if (border_stats.find(var) != border_stats.end())
|
||||
return true;
|
||||
|
||||
if (stat->hasLabel())
|
||||
return true;
|
||||
|
||||
if (last_io_bound && last_io_bound->lastNodeOfStmt() && last_io_bound->lastNodeOfStmt() == stat)
|
||||
return true;
|
||||
|
||||
@@ -353,26 +555,29 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[%s]: enter region\n", region->GetName().c_str());
|
||||
|
||||
for (auto& linesByFile : region->GetAllLinesToModify())
|
||||
for (auto& lines_by_file : region->GetAllLinesToModify())
|
||||
{
|
||||
const auto& filename = linesByFile.first;
|
||||
const auto& current_file_name = lines_by_file.first;
|
||||
|
||||
if (SgFile::switchToFile(filename) < 0)
|
||||
{
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
|
||||
for (auto& lines : linesByFile.second)
|
||||
auto func_info_it = allFuncInfo.find(current_file_name);
|
||||
if (func_info_it == allFuncInfo.end())
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto *lbound_symb = new SgSymbol(FUNCTION_NAME, "lbound");
|
||||
auto *ubound_symb = new SgSymbol(FUNCTION_NAME, "ubound");
|
||||
|
||||
for (auto& lines : lines_by_file.second)
|
||||
{
|
||||
__spf_print(DEBUG_TRACE, "[fragment] %s: %d:%d %d\n", filename.c_str(), lines.lines.first,
|
||||
__spf_print(DEBUG_TRACE, "[fragment] %s: %d:%d %d\n", current_file_name.c_str(), lines.lines.first,
|
||||
lines.lines.second, lines.isImplicit());
|
||||
|
||||
SgStatement* curr_stmt, * end;
|
||||
|
||||
if (lines.isImplicit())
|
||||
{
|
||||
|
||||
curr_stmt = current_file->SgStatementAtLine(lines.lines.first);
|
||||
end = current_file->SgStatementAtLine(lines.lines.second);
|
||||
|
||||
@@ -388,6 +593,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
map<SgSymbol*, set<SgStatement*>> need_replace;
|
||||
SgStatement* last_io_bound = NULL;
|
||||
|
||||
FuncInfo *current_func_info = NULL;
|
||||
|
||||
while (curr_stmt != end)
|
||||
{
|
||||
@@ -396,9 +602,21 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
|
||||
auto var = curr_stmt->variant();
|
||||
|
||||
|
||||
if (var == PROC_HEDR || var == PROG_HEDR || var == FUNC_HEDR)
|
||||
{
|
||||
current_func_info = NULL;
|
||||
for (auto *func_info : func_info_it->second)
|
||||
{
|
||||
if (func_info->funcName == curr_stmt->symbol()->identifier())
|
||||
{
|
||||
current_func_info = func_info;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (!current_func_info)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
curr_stmt = curr_stmt->lexNext();
|
||||
while (curr_stmt && !isSgExecutableStatement(curr_stmt))
|
||||
{
|
||||
@@ -422,77 +640,192 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
string array_name = string(array_to_copy->identifier());
|
||||
DIST::Array* array_p = getArrayFromDeclarated(declaratedInStmt(array_to_copy), array_name);
|
||||
|
||||
bool fromModule = (array_p->GetLocation().first == DIST::l_MODULE);
|
||||
const string locationName = array_p->GetLocation().second;
|
||||
// at this point all considered arrays must have DIST::Array* references
|
||||
if (!array_p)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
// ... and be declared in switchable files (not in headers)
|
||||
pair<string, int> decl_place;
|
||||
if (!switchToDeclarationFile(array_p, decl_place, current_file_name, current_func_info))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto place = *array_p->GetDeclInfo().begin();
|
||||
string fileName = place.first;
|
||||
string suffix = "_io_l";
|
||||
|
||||
if (fromModule)
|
||||
switch (array_p->GetLocation().first)
|
||||
{
|
||||
case DIST::l_MODULE:
|
||||
suffix = "_io_m";
|
||||
|
||||
pair<SgSymbol*, SgSymbol*> copied;
|
||||
copied.first = array_to_copy;
|
||||
|
||||
if (SgFile::switchToFile(fileName) == -1)
|
||||
{
|
||||
auto* func_stmt = curr_stmt->getScopeForDeclare();
|
||||
|
||||
SgStatement* insertPlace = NULL;
|
||||
for (auto iterator = func_stmt->lexNext();
|
||||
!isSgExecutableStatement(iterator) || isSPF_stat(iterator) &&
|
||||
!(iterator->variant() == SPF_PARALLEL_REG_DIR || iterator->variant() == SPF_END_PARALLEL_REG_DIR);
|
||||
iterator = iterator->lexNext())
|
||||
{
|
||||
insertPlace = iterator;
|
||||
break;
|
||||
case DIST::l_COMMON:
|
||||
suffix = "_io_c";
|
||||
break;
|
||||
}
|
||||
|
||||
//NULL - no decl stats in function!
|
||||
if (!insertPlace)
|
||||
insertPlace = func_stmt;
|
||||
auto copied_symbol = copyArray(decl_place,
|
||||
array_p,
|
||||
lines_by_file.second,
|
||||
suffix + to_string(region->GetId()),
|
||||
decl_place.first,
|
||||
newDeclsToInclude,
|
||||
copied_syms);
|
||||
|
||||
auto st = insertPlace->controlParent();
|
||||
if (st->variant() == GLOBAL)
|
||||
st = insertPlace;
|
||||
// original declaration statement
|
||||
auto *decl_stmt = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
||||
|
||||
auto& copied_symb = array_to_copy->copy();
|
||||
copied.second = &copied_symb;
|
||||
if (!decl_stmt || !isArrayDeclaration(decl_stmt))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
auto new_name = string(array_to_copy->identifier()) + "_io_c";
|
||||
copied_symb.changeName(new_name.c_str());
|
||||
auto dynamic_array = checkAssumedShape(decl_stmt, array_name);
|
||||
|
||||
auto stat = array_to_copy->makeVarDeclStmt();
|
||||
auto res = CalculateInteger(stat->expr(0)->copyPtr());
|
||||
res->lhs()->setSymbol(copied_symb);
|
||||
stat->setExpression(0, res);
|
||||
|
||||
insertPlace->insertStmtAfter(*stat, *st);
|
||||
}
|
||||
else
|
||||
while (decl_stmt && !isSgExecutableStatement(decl_stmt))
|
||||
{
|
||||
copied = copyArray(place, array_p, linesByFile.second, suffix + to_string(region->GetId()), fileName, newDeclsToInclude, copied_syms);
|
||||
if (isArrayDeclaration(decl_stmt) &&
|
||||
decl_stmt->expr(0) &&
|
||||
decl_stmt->expr(0)->lhs() &&
|
||||
decl_stmt->expr(0)->lhs()->symbol() == copied_symbol.second)
|
||||
{
|
||||
break;
|
||||
}
|
||||
|
||||
SgStatement* decl = SgStatement::getStatementByFileAndLine(place.first, place.second);
|
||||
decl_stmt = decl_stmt->lexNext();
|
||||
}
|
||||
|
||||
if (decl)
|
||||
decl = decl->lexNext();
|
||||
// created declaration statement
|
||||
if (!decl_stmt || !isArrayDeclaration(decl_stmt))
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
// insert !$SPF ANALYSIS(PROCESS_PRIVATE(array)) directive before declaration statement
|
||||
|
||||
if (decl)
|
||||
{
|
||||
string dir_str;
|
||||
if (decl->comments())
|
||||
if (decl_stmt->comments())
|
||||
{
|
||||
string str_comment = string(decl->comments());
|
||||
auto str_comment = string(decl_stmt->comments());
|
||||
if (str_comment.size() && str_comment.back() != '\n')
|
||||
dir_str += "\n";
|
||||
}
|
||||
|
||||
dir_str += "!$SPF ANALYSIS(PROCESS_PRIVATE(" + string(copied.second->identifier()) + "))\n";
|
||||
decl->addComment(dir_str.c_str());
|
||||
dir_str += "!$SPF ANALYSIS(PROCESS_PRIVATE(" + string(copied_symbol.second->identifier()) + "))\n";
|
||||
decl_stmt->addComment(dir_str.c_str());
|
||||
|
||||
created_copies.insert({ array_to_copy, copied_symbol.second });
|
||||
|
||||
// make array copy allocatable in case of assumed-shape array
|
||||
if(dynamic_array)
|
||||
{
|
||||
// insert allocatable keyword in declaration
|
||||
auto *kword_list = decl_stmt->expr(2);
|
||||
if (!findExprWithVariant(kword_list, ALLOCATABLE_OP))
|
||||
{
|
||||
if (!kword_list)
|
||||
{
|
||||
kword_list = new SgExprListExp();
|
||||
decl_stmt->setExpression(2, *kword_list);
|
||||
}
|
||||
created_copies.insert({ array_to_copy, copied.second });
|
||||
|
||||
while (kword_list->rhs())
|
||||
kword_list = kword_list->rhs();
|
||||
|
||||
if (kword_list->lhs())
|
||||
{
|
||||
kword_list->setRhs(new SgExprListExp());
|
||||
kword_list = kword_list->rhs();
|
||||
}
|
||||
|
||||
kword_list->setLhs(new SgExpression(ALLOCATABLE_OP));
|
||||
}
|
||||
|
||||
// can't switch back to file with array usage
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
|
||||
// insert allocate(a_l(lbound(a, 1):ubound(a,1),...)) statement
|
||||
SgStatement* allocate_stmt_place = NULL;
|
||||
|
||||
auto* func_stmt = curr_stmt->getScopeForDeclare();
|
||||
for (auto iterator = func_stmt->lexNext();
|
||||
iterator && !isSgExecutableStatement(iterator);
|
||||
iterator = iterator->lexNext())
|
||||
{
|
||||
allocate_stmt_place = iterator;
|
||||
}
|
||||
|
||||
//NULL - no decl stats in function!
|
||||
if (!allocate_stmt_place)
|
||||
allocate_stmt_place = func_stmt;
|
||||
|
||||
auto *allocate_stmt_parent = allocate_stmt_place->controlParent();
|
||||
if (allocate_stmt_parent->variant() == GLOBAL)
|
||||
allocate_stmt_parent = allocate_stmt_place;
|
||||
|
||||
auto *created_array_ref = new SgArrayRefExp(*copied_symbol.second);
|
||||
|
||||
auto* dim_list = new SgExprListExp();
|
||||
created_array_ref->setLhs(dim_list);
|
||||
|
||||
int dim_len = array_p->GetSizes().size();
|
||||
for (int i = 1; i <= dim_len; i++)
|
||||
{
|
||||
auto *lcall = new SgFunctionCallExp(*lbound_symb);
|
||||
auto *rcall = new SgFunctionCallExp(*ubound_symb);
|
||||
|
||||
for (auto *call : {lcall, rcall})
|
||||
{
|
||||
call->setLhs(new SgExprListExp());
|
||||
|
||||
call->lhs()->setLhs(new SgArrayRefExp(*array_to_copy));
|
||||
call->lhs()->setRhs(new SgValueExp(i));
|
||||
}
|
||||
|
||||
auto *dot_expr = new SgExpression(DDOT);
|
||||
dot_expr->setLhs(lcall);
|
||||
dot_expr->setRhs(rcall);
|
||||
|
||||
dim_list->setLhs(dot_expr);
|
||||
|
||||
if (i < dim_len)
|
||||
{
|
||||
auto *next = new SgExprListExp();
|
||||
dim_list->setRhs(next);
|
||||
dim_list = next;
|
||||
}
|
||||
}
|
||||
|
||||
auto *allocate_stmt = new SgStatement(ALLOCATE_STMT);
|
||||
allocate_stmt->setExpression(0, created_array_ref);
|
||||
|
||||
allocate_stmt_place->insertStmtAfter(*allocate_stmt, *allocate_stmt_parent);
|
||||
|
||||
// insert deallocate statemens before all returns
|
||||
auto *find_return_stmt = func_stmt;
|
||||
while (find_return_stmt != func_stmt->lastNodeOfStmt())
|
||||
{
|
||||
auto *next = find_return_stmt->lexNext();
|
||||
if (next && (isSgReturnStmt(next) || next == func_stmt->lastNodeOfStmt()))
|
||||
{
|
||||
if (next->hasLabel())
|
||||
{
|
||||
moveLabelBefore(next);
|
||||
find_return_stmt = next->lexPrev();
|
||||
}
|
||||
|
||||
auto *dealloc_stmt = new SgStatement(DEALLOCATE_STMT);
|
||||
|
||||
dealloc_stmt->setExpression(0, new SgExprListExp());
|
||||
dealloc_stmt->expr(0)->setLhs(new SgArrayRefExp(*copied_symbol.second));
|
||||
|
||||
find_return_stmt->insertStmtAfter(*dealloc_stmt, *next->controlParent());
|
||||
|
||||
if (next == curr_stmt)
|
||||
curr_stmt = dealloc_stmt;
|
||||
}
|
||||
|
||||
find_return_stmt = next;
|
||||
}
|
||||
}
|
||||
|
||||
// can't switch back to file with array usage
|
||||
if (SgFile::switchToFile(current_file_name) == -1)
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
}
|
||||
}
|
||||
|
||||
@@ -504,12 +837,9 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
{
|
||||
auto it = created_copies.find(p.first);
|
||||
if (it != created_copies.end())
|
||||
replaceArrayInFragment(p.first, p.second, it->second, last_io_bound, curr_stmt, filename);
|
||||
replaceArrayInFragment(p.first, p.second, it->second, last_io_bound, curr_stmt, current_func_info);
|
||||
else
|
||||
{
|
||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -527,7 +857,17 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
||||
}
|
||||
}
|
||||
|
||||
populateDistributedIoArrays(need_replace, curr_stmt);
|
||||
auto need_fix_io = populateDistributedIoArrays(need_replace, curr_stmt, current_file_name, current_func_info);
|
||||
|
||||
// incorrect IO statement with label
|
||||
// move label to dummy statement and insert copy statements between dummy statement and IO
|
||||
if (need_fix_io && curr_stmt->hasLabel())
|
||||
{
|
||||
moveLabelBefore(curr_stmt);
|
||||
if (last_io_bound == curr_stmt) // always true
|
||||
last_io_bound = curr_stmt->lexPrev();
|
||||
}
|
||||
|
||||
curr_stmt = curr_stmt->lexNext();
|
||||
}
|
||||
}
|
||||
|
||||
@@ -2215,6 +2215,7 @@ void restoreAssignsFromLoop(SgFile* file, const map<DIST::Array*, set<DIST::Arra
|
||||
if (secondConv && notDeletedVectorAssign(move.first))
|
||||
{
|
||||
move.first->setVariant(-abs(move.first->variant()));
|
||||
__spf_print(1, " save assign\n");
|
||||
|
||||
if (needDecl) // declare loops symbol
|
||||
{
|
||||
@@ -2237,8 +2238,10 @@ void restoreAssignsFromLoop(SgFile* file, const map<DIST::Array*, set<DIST::Arra
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
else {
|
||||
move.second->setVariant(-abs(move.second->variant()));
|
||||
__spf_print(1, " restored assign\n");
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -1,5 +1,7 @@
|
||||
#pragma once
|
||||
|
||||
#include "../Distribution/Array.h"
|
||||
|
||||
enum varType { SCALAR, ARRAY, CONST, ANOTHER };
|
||||
|
||||
struct CommonVariableUse
|
||||
|
||||
@@ -257,7 +257,7 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
||||
|
||||
list({ REVERT_SUBST_EXPR_RD, CONVERT_LOOP_TO_ASSIGN }) <= Pass(RESOLVE_PAR_REGIONS);
|
||||
|
||||
list({ REVERT_SUBST_EXPR_RD, CONVERT_LOOP_TO_ASSIGN, FILL_PAR_REGIONS}) <= Pass(REMOVE_DIST_ARRAYS_FROM_IO);
|
||||
list({ FILL_PAR_REGIONS, REVERT_SUBST_EXPR_RD, CONVERT_LOOP_TO_ASSIGN }) <= Pass(REMOVE_DIST_ARRAYS_FROM_IO);
|
||||
|
||||
Pass(REVERT_SUBST_EXPR_RD) <= Pass(EXPAND_EXTRACT_PAR_REGION);
|
||||
|
||||
|
||||
@@ -3219,6 +3219,7 @@ bool isArrayRef(SgExpression* ex)
|
||||
{
|
||||
SgArrayRefExp* arrayRef = isSgArrayRefExp(ex);
|
||||
if (arrayRef)
|
||||
{
|
||||
if (isArrayType(ex->symbol()->type()))
|
||||
{
|
||||
auto type = isSgArrayType(ex->symbol()->type());
|
||||
@@ -3226,6 +3227,7 @@ bool isArrayRef(SgExpression* ex)
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
@@ -14,15 +14,13 @@
|
||||
#include <map>
|
||||
#include <set>
|
||||
#include <utility>
|
||||
#include <string>
|
||||
#include <assert.h>
|
||||
#include <locale>
|
||||
#include <algorithm>
|
||||
#include <thread>
|
||||
#include <cstdint>
|
||||
|
||||
#include "utils.h"
|
||||
#include "errors.h"
|
||||
#include "utils.h"
|
||||
#include "version.h"
|
||||
|
||||
#include "graph_loops.h"
|
||||
@@ -392,31 +390,14 @@ void clearGlobalBuffer() { globalOutputBuffer = ""; }
|
||||
const string& getGlobalBuffer() { return globalOutputBuffer; }
|
||||
|
||||
set<short*> allocated;
|
||||
set<int*> allocatedInt;
|
||||
static void convertGlobalBuffer(short *&result, int *&resultSize)
|
||||
{
|
||||
const unsigned len = (unsigned)globalOutputBuffer.size();
|
||||
result = new short[len + 1];
|
||||
allocated.insert(result);
|
||||
|
||||
result[len] = '\0';
|
||||
for (unsigned i = 0; i < len; ++i)
|
||||
result[i] = globalOutputBuffer[i];
|
||||
|
||||
resultSize = new int[1];
|
||||
resultSize[0] = (int)len;
|
||||
}
|
||||
|
||||
extern map<string, vector<Messages>> SPF_messages; //file ->messages
|
||||
void clearGlobalMessagesBuffer()
|
||||
{
|
||||
//clear allocated memory
|
||||
for (auto& elem : allocated)
|
||||
delete[]elem;
|
||||
for (auto& elem : allocatedInt)
|
||||
delete[]elem;
|
||||
delete []elem;
|
||||
allocated.clear();
|
||||
allocatedInt.clear();
|
||||
|
||||
|
||||
SPF_messages.clear();
|
||||
}
|
||||
@@ -453,7 +434,7 @@ static map<string, vector<Messages>> removeCopies(map<string, vector<Messages>>
|
||||
return out;
|
||||
}
|
||||
|
||||
static void convertGlobalMessagesBuffer(short *&result, int *&resultSize)
|
||||
static string convertGlobalMessagesBuffer()
|
||||
{
|
||||
auto copySPF_messages = removeCopies(SPF_messages);
|
||||
for (auto &byFile : copySPF_messages)
|
||||
@@ -491,21 +472,13 @@ static void convertGlobalMessagesBuffer(short *&result, int *&resultSize)
|
||||
json all;
|
||||
all["allMessages"] = allMessages;
|
||||
|
||||
const string str = all.dump();
|
||||
const unsigned len = (unsigned)str.size();
|
||||
|
||||
copyStringToShort(result, str);
|
||||
allocated.insert(result);
|
||||
|
||||
resultSize = new int[1];
|
||||
resultSize[0] = (int)len;
|
||||
return all.dump();
|
||||
}
|
||||
|
||||
|
||||
void convertBuffers(short*& resultM, int*& resultSizeM, short*& result, int*& resultSize)
|
||||
void convertBuffers(string &resultM, string &result)
|
||||
{
|
||||
convertGlobalMessagesBuffer(resultM, resultSizeM);
|
||||
convertGlobalBuffer(result, resultSize);
|
||||
resultM = convertGlobalMessagesBuffer();
|
||||
result = getGlobalBuffer();
|
||||
}
|
||||
|
||||
bool isSPF_comment(const string &bufStr)
|
||||
@@ -1738,3 +1711,37 @@ void copyStringToShort(short*& result, const string& resVal, bool withEnd)
|
||||
if (withEnd)
|
||||
result[resVal.size()] = (short)'\0';
|
||||
}
|
||||
|
||||
void dumpMessages(bool inCatch, const map<string, vector<Messages>>& messages, const char *vis_path)
|
||||
{
|
||||
json byFileArray = json::array();
|
||||
for (auto& byFile : messages)
|
||||
{
|
||||
json inFile;
|
||||
inFile["file"] = byFile.first;
|
||||
|
||||
json messages = json::array();
|
||||
for (auto& message : byFile.second)
|
||||
{
|
||||
if (inCatch)
|
||||
message.print(byFile.first);
|
||||
messages.push_back(message.toJson());
|
||||
}
|
||||
inFile["messages"] = messages;
|
||||
byFileArray.push_back(inFile);
|
||||
}
|
||||
json allMessages;
|
||||
allMessages["allMessages"] = byFileArray;
|
||||
|
||||
const string dump = allMessages.dump().c_str();
|
||||
|
||||
if (dump.size())
|
||||
{
|
||||
FILE* outF = fopen((string(vis_path) + "/error_messages.json").c_str(), "w");
|
||||
if (outF)
|
||||
{
|
||||
fprintf(outF, "%s", dump.c_str());
|
||||
fclose(outF);
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -5,7 +5,9 @@
|
||||
#include <string>
|
||||
#include <cstdint>
|
||||
|
||||
struct Messages;
|
||||
struct DataDirective;
|
||||
|
||||
namespace Distribution
|
||||
{
|
||||
class Array;
|
||||
@@ -31,7 +33,7 @@ void addToGlobalBufferAndPrint(const std::string &toPrint);
|
||||
void clearGlobalBuffer();
|
||||
const std::string& getGlobalBuffer();
|
||||
std::wstring to_wstring(const std::string);
|
||||
void convertBuffers(short*& resultM, int*& resultSizeM, short*& result, int*& resultSize);
|
||||
void convertBuffers(std::string& resultM, std::string& result);
|
||||
void clearGlobalMessagesBuffer();
|
||||
std::string renameInclude(const std::string& inc);
|
||||
void copyIncludes(const std::set<std::string> &allIncludeFiles, const std::map<std::string, std::map<int, std::set<std::string>>> &commentsToInclude, const std::map<std::string, std::map<int, std::set<std::string>>>& newCopyDeclToIncl, const char *folderName, bool keepSpfDirs, bool isFreeStyle, bool isRename, int removeDirs = 0);
|
||||
@@ -98,3 +100,17 @@ std::set<DIST::Array*> fillDistributedArraysD(const DataDirective& dataDirective
|
||||
std::set<std::string> fillDistributedArrays(const DataDirective& dataDirectives, const std::map<DIST::Array*, std::tuple<int, std::string, std::string>>& tableOfUniqNamesByArray, const std::map<DIST::Array*, std::set<DIST::Array*>>& arrayLinksByFuncCalls, bool onlyCommon = false, bool shortName = false);
|
||||
|
||||
void copyStringToShort(short*& result, const std::string& resVal, bool withEnd = true);
|
||||
void dumpMessages(bool inCatch, const std::map<std::string, std::vector<Messages>>& messages, const char* vis_path);
|
||||
|
||||
template<typename T>
|
||||
inline T gcd(T a, T b)
|
||||
{
|
||||
while (a != b)
|
||||
{
|
||||
if (a > b)
|
||||
a = a - b;
|
||||
else
|
||||
b = b - a;
|
||||
}
|
||||
return a;
|
||||
}
|
||||
|
||||
@@ -1,3 +1,3 @@
|
||||
#pragma once
|
||||
|
||||
#define VERSION_SPF "2423"
|
||||
#define VERSION_SPF "2446"
|
||||
|
||||
@@ -4,6 +4,7 @@
|
||||
#include <iostream>
|
||||
#include <ctime>
|
||||
#include <chrono>
|
||||
#include <cstdarg>
|
||||
|
||||
#include "SendMessage.h"
|
||||
#include "utils.h"
|
||||
@@ -144,10 +145,116 @@ static int decodeMessage(const string& message, vector<string>& pars, int &winH,
|
||||
return 0;
|
||||
}
|
||||
|
||||
void sendMessage_1lvl(const wstring& toSend) { MessageManager::sendFirstLvl (toSend); }
|
||||
void sendMessage_2lvl(const wstring& toSend) { MessageManager::sendSecondLvl(toSend); }
|
||||
static void sendMessage_1lvl(const wstring& toSend) { MessageManager::sendFirstLvl (toSend); }
|
||||
static void sendMessage_2lvl(const wstring& toSend) { MessageManager::sendSecondLvl(toSend); }
|
||||
void sendMessage_progress(const wstring& toSend) { MessageManager::sendProgress (toSend); }
|
||||
|
||||
void sendMessage_1lvl(int kind, ...)
|
||||
{
|
||||
va_list list;
|
||||
va_start(list, kind);
|
||||
|
||||
if (kind == 0)
|
||||
{
|
||||
int iters = va_arg(list, int);
|
||||
#ifdef _WIN32
|
||||
sendMessage_1lvl(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " + std::to_wstring(iters) + L" <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>");
|
||||
#else
|
||||
sendMessage_1lvl(L"running " + std::to_wstring(iters) + L" iteration of syntax analisys");
|
||||
#endif
|
||||
}
|
||||
else if (kind == 1)
|
||||
{
|
||||
string str = va_arg(list, string);
|
||||
#ifdef _WIN32
|
||||
sendMessage_1lvl(wstring(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> '") + wstring(str.begin(), str.end()) + L"'");
|
||||
#else
|
||||
sendMessage_1lvl(wstring(L"running pass '") + wstring(str.begin(), str.end()) + L"'");
|
||||
#endif
|
||||
}
|
||||
|
||||
va_end(list);
|
||||
}
|
||||
|
||||
void sendMessage_2lvl(int kind, ...)
|
||||
{
|
||||
va_list list;
|
||||
va_start(list, kind);
|
||||
|
||||
if (kind == 0)
|
||||
{
|
||||
bool isFunction = va_arg(list, int);
|
||||
string fName = va_arg(list, string);
|
||||
#if _WIN32
|
||||
if (isFunction)
|
||||
sendMessage_2lvl(wstring(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> '") + to_wstring(fName) + L"'");
|
||||
else
|
||||
sendMessage_2lvl(wstring(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> '") + to_wstring(fName) + L"'");
|
||||
#else
|
||||
if (isFunction)
|
||||
sendMessage_2lvl(wstring(L"processing function '") + wstring(fName.begin(), fName.end()) + L"'");
|
||||
else
|
||||
sendMessage_2lvl(wstring(L"processing module '") + wstring(fName.begin(), fName.end()) + L"'");
|
||||
#endif
|
||||
}
|
||||
else if (kind == 1)
|
||||
{
|
||||
int idx = va_arg(list, int);
|
||||
int all = va_arg(list, int);
|
||||
#ifdef _WIN32
|
||||
sendMessage_2lvl(wstring(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> ") + std::to_wstring(idx) + L"/" + std::to_wstring(all));
|
||||
#else
|
||||
sendMessage_2lvl(wstring(L"processing loop ") + std::to_wstring(idx) + L"/" + std::to_wstring(all));
|
||||
#endif
|
||||
}
|
||||
else if (kind == 2)
|
||||
{
|
||||
sendMessage_2lvl(L"");
|
||||
}
|
||||
else if (kind == 3)
|
||||
{
|
||||
string file = va_arg(list, string);
|
||||
#ifdef _WIN32
|
||||
sendMessage_2lvl(L" <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> '" + to_wstring(file) + L"'");
|
||||
#else
|
||||
sendMessage_2lvl(L" processing file '" + to_wstring(file) + L"'");
|
||||
#endif
|
||||
}
|
||||
else if (kind == 4)
|
||||
{
|
||||
int k = va_arg(list, int);
|
||||
int all = va_arg(list, int);
|
||||
#if _WIN32
|
||||
wstring treeM = L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " + std::to_wstring(k + 1) + L"/" + std::to_wstring(all);
|
||||
#else
|
||||
wstring treeM = L"conflict resolution, processing group " + std::to_wstring(k + 1) + L"/" + std::to_wstring(all);
|
||||
#endif
|
||||
sendMessage_2lvl(treeM);
|
||||
}
|
||||
else if (kind == 5)
|
||||
{
|
||||
int z = va_arg(list, int);
|
||||
int all = va_arg(list, int);
|
||||
#ifdef _WIN32
|
||||
wstring treeM = L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> " + std::to_wstring(z + 1) + L"/" + std::to_wstring(all);
|
||||
#else
|
||||
wstring treeM = L"conflict resolution, processing array " + std::to_wstring(z + 1) + L"/" + std::to_wstring(all);
|
||||
#endif
|
||||
sendMessage_2lvl(treeM);
|
||||
}
|
||||
else if (kind == 6)
|
||||
{
|
||||
string funcName = va_arg(list, string);
|
||||
#ifdef _WIN32
|
||||
sendMessage_2lvl(wstring(L"<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> '") + to_wstring(funcName) + L"'");
|
||||
#else
|
||||
sendMessage_2lvl(wstring(L"inlinig of function '") + to_wstring(funcName) + L"'");
|
||||
#endif
|
||||
}
|
||||
|
||||
va_end(list);
|
||||
}
|
||||
|
||||
static string utf8_encode(const wstring& wstr)
|
||||
{
|
||||
if (wstr.empty())
|
||||
|
||||
@@ -32,7 +32,8 @@ public:
|
||||
static int init();
|
||||
};
|
||||
|
||||
void sendMessage_1lvl(const std::wstring& toSend);
|
||||
void sendMessage_2lvl(const std::wstring& toSend);
|
||||
void sendMessage_1lvl(int kind, ...);
|
||||
void sendMessage_2lvl(int kind, ...);
|
||||
void sendMessage_progress(const std::wstring& toSend);
|
||||
|
||||
unsigned int GetPid();
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
52
tests/sapfor/parameter/dynamic_array_maximum.f90
Normal file
52
tests/sapfor/parameter/dynamic_array_maximum.f90
Normal file
@@ -0,0 +1,52 @@
|
||||
program dynamic_array_maximum_3d
|
||||
implicit none
|
||||
integer :: n1, n2, n3, n4 , k, i, j, l, a
|
||||
integer :: sum3
|
||||
real :: max_element
|
||||
real, allocatable :: array(:,:,:), array2(:,:,:), array3(:,:,:)
|
||||
|
||||
write(*, *) "Enter 3 integers"
|
||||
read(*, *) n, m, k
|
||||
m = 100
|
||||
|
||||
if (1 .eq. 1) then
|
||||
a = 3
|
||||
else if (2 .eq. 1) then
|
||||
a = 4
|
||||
endif
|
||||
|
||||
m = m + 1
|
||||
k = m * 1000 + n * 10
|
||||
|
||||
allocate(array(n, m + n, k + m + n), &
|
||||
&array2(k, m + n, k), &
|
||||
&array3(k, m, k + n))
|
||||
|
||||
call random_seed()
|
||||
do i = 1, n1
|
||||
do j = 1, m * n1
|
||||
do l = 1, k * m * n1
|
||||
call random_number(array(i,j,l))
|
||||
array(i,j,l) = int(array(i,j,l) * 100)
|
||||
end do
|
||||
end do
|
||||
end do
|
||||
|
||||
max_element = array(1,1,1)
|
||||
do i = 1, n1
|
||||
do j = 1, m
|
||||
do l = 1, k
|
||||
max_element = MAX(array(i,j,l), max_element)
|
||||
end do
|
||||
end do
|
||||
end do
|
||||
deallocate(array, array2, array3)
|
||||
write(*, *) max_element
|
||||
end program dynamic_array_maximum_3d
|
||||
|
||||
! function sum3(x, y, z)
|
||||
! implicit none
|
||||
! integer :: x, y, z
|
||||
! integer :: sum3
|
||||
! sum3 = x + y + z
|
||||
! end function sum3
|
||||
Reference in New Issue
Block a user