Compare commits
17 Commits
06aabdbee6
...
master
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
a0cea2df91 | ||
|
|
4b7df86b8a | ||
| 836894fef1 | |||
| 9ac15eec79 | |||
| 03f565f50b | |||
| 47e2b961e2 | |||
|
|
b95b336372 | ||
| f35d7cb4bd | |||
| 54615e34d4 | |||
| 8752f4a139 | |||
| 453105d273 | |||
| cad0a0b217 | |||
| 9c0fd40e7b | |||
| c7a31c8bbb | |||
|
|
9900929349 | ||
|
|
e1ba299159 | ||
|
|
8de18d1788 |
@@ -487,7 +487,7 @@ source_group (Predictor\\Library FILES ${LIBPREDICTOR})
|
|||||||
source_group (Parser FILES ${PARSER})
|
source_group (Parser FILES ${PARSER})
|
||||||
source_group (PPPA\\PPPA FILES ${PPPA})
|
source_group (PPPA\\PPPA FILES ${PPPA})
|
||||||
source_group (PPPA\\ZLib FILES ${ZLIB})
|
source_group (PPPA\\ZLib FILES ${ZLIB})
|
||||||
|
|
||||||
if (MSVC_IDE)
|
if (MSVC_IDE)
|
||||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /MP /Zc:__cplusplus")
|
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /MP /Zc:__cplusplus")
|
||||||
else()
|
else()
|
||||||
@@ -496,7 +496,9 @@ else()
|
|||||||
else()
|
else()
|
||||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
|
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
|
||||||
endif()
|
endif()
|
||||||
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O2")
|
if(NOT CMAKE_BUILD_TYPE)
|
||||||
|
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O3")
|
||||||
|
endif()
|
||||||
endif()
|
endif()
|
||||||
|
|
||||||
add_subdirectory(projects/Fdvm)
|
add_subdirectory(projects/Fdvm)
|
||||||
|
|||||||
Submodule projects/dvm updated: 4b7ef11871...4d4041a081
@@ -15,7 +15,7 @@
|
|||||||
#include "SgUtils.h"
|
#include "SgUtils.h"
|
||||||
#include "expr_transform.h"
|
#include "expr_transform.h"
|
||||||
|
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
|
|
||||||
#include "shadow.h"
|
#include "shadow.h"
|
||||||
#include "dvm.h"
|
#include "dvm.h"
|
||||||
|
|||||||
@@ -14,7 +14,7 @@
|
|||||||
#include "dvm.h"
|
#include "dvm.h"
|
||||||
#include "graph_calls_func.h"
|
#include "graph_calls_func.h"
|
||||||
|
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
#include "graph_loops_func.h"
|
#include "graph_loops_func.h"
|
||||||
#include "../DirectiveProcessing/directive_parser.h"
|
#include "../DirectiveProcessing/directive_parser.h"
|
||||||
#include "SgUtils.h"
|
#include "SgUtils.h"
|
||||||
|
|||||||
@@ -22,7 +22,7 @@
|
|||||||
#include "graph_loops_func.h"
|
#include "graph_loops_func.h"
|
||||||
#include "expr_transform.h"
|
#include "expr_transform.h"
|
||||||
#include "../LoopAnalyzer/loop_analyzer.h"
|
#include "../LoopAnalyzer/loop_analyzer.h"
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
|
|
||||||
#include "json.hpp"
|
#include "json.hpp"
|
||||||
|
|
||||||
|
|||||||
@@ -12,7 +12,7 @@
|
|||||||
#include "graph_calls.h"
|
#include "graph_calls.h"
|
||||||
#include "private_analyzer.h"
|
#include "private_analyzer.h"
|
||||||
#include "dvm.h"
|
#include "dvm.h"
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
|
|
||||||
using std::vector;
|
using std::vector;
|
||||||
|
|
||||||
|
|||||||
@@ -11,11 +11,11 @@
|
|||||||
#include "region.h"
|
#include "region.h"
|
||||||
#include "SgUtils.h"
|
#include "SgUtils.h"
|
||||||
#include "graph_loops.h"
|
#include "graph_loops.h"
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
|
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
void Collapse(Region* region)
|
static void Collapse(Region* region)
|
||||||
{
|
{
|
||||||
if (region->getBasickBlocks().empty())
|
if (region->getBasickBlocks().empty())
|
||||||
return;
|
return;
|
||||||
@@ -124,16 +124,30 @@ static void SolveDataFlow(Region* DFG)
|
|||||||
map<LoopGraph*, ArrayAccessingIndexes> FindPrivateArrays(map<string, vector<LoopGraph*>> &loopGraph, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR)
|
map<LoopGraph*, ArrayAccessingIndexes> FindPrivateArrays(map<string, vector<LoopGraph*>> &loopGraph, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR)
|
||||||
{
|
{
|
||||||
map<LoopGraph*, ArrayAccessingIndexes> result;
|
map<LoopGraph*, ArrayAccessingIndexes> result;
|
||||||
for (const auto& [loopName, loops] : loopGraph)
|
for (const auto& [fileName, loops] : loopGraph)
|
||||||
{
|
{
|
||||||
|
SgFile::switchToFile(fileName);
|
||||||
for (const auto& loop : loops)
|
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)
|
for (const auto& [funcInfo, blocks]: FullIR)
|
||||||
{
|
{
|
||||||
Region* loopRegion = new Region(loop, blocks);
|
if (funcInfo->fileName == fileName && funcInfo->funcPointer->GetOriginal() == search_func)
|
||||||
SolveDataFlow(loopRegion);
|
{
|
||||||
result[loop] = loopRegion->array_priv;
|
Region* loopRegion = new Region(loop, blocks);
|
||||||
delete(loopRegion);
|
if (loopRegion->getBasickBlocks().size() <= 1)
|
||||||
|
{
|
||||||
|
delete(loopRegion);
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
SolveDataFlow(loopRegion);
|
||||||
|
result[loop] = loopRegion->array_priv;
|
||||||
|
delete(loopRegion);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -5,10 +5,8 @@
|
|||||||
#include <unordered_set>
|
#include <unordered_set>
|
||||||
|
|
||||||
#include "range_structures.h"
|
#include "range_structures.h"
|
||||||
#include "region.h"
|
|
||||||
#include "graph_loops.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::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);
|
std::pair<SAPFOR::BasicBlock*, std::unordered_set<SAPFOR::BasicBlock*>> GetBasicBlocksForLoop(const LoopGraph* loop, const std::vector<SAPFOR::BasicBlock*> blocks);
|
||||||
|
|||||||
@@ -6,7 +6,7 @@
|
|||||||
#include <string>
|
#include <string>
|
||||||
|
|
||||||
#include "graph_loops.h"
|
#include "graph_loops.h"
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
|
|
||||||
class Region : public SAPFOR::BasicBlock {
|
class Region : public SAPFOR::BasicBlock {
|
||||||
public:
|
public:
|
||||||
|
|||||||
@@ -1019,8 +1019,6 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
if(func->funcPointer->variant() != ENTRY_STAT)
|
if(func->funcPointer->variant() != ENTRY_STAT)
|
||||||
countOfTransform += removeDeadCode(func->funcPointer, allFuncInfo, commonBlocks);
|
countOfTransform += removeDeadCode(func->funcPointer, allFuncInfo, commonBlocks);
|
||||||
}
|
}
|
||||||
else if (curr_regime == FIND_PRIVATE_ARRAYS)
|
|
||||||
FindPrivateArrays(loopGraph, fullIR);
|
|
||||||
else if (curr_regime == TEST_PASS)
|
else if (curr_regime == TEST_PASS)
|
||||||
{
|
{
|
||||||
//test pass
|
//test pass
|
||||||
@@ -1916,6 +1914,8 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
}
|
}
|
||||||
else if (curr_regime == TRANSFORM_ASSUMED_SIZE_PARAMETERS)
|
else if (curr_regime == TRANSFORM_ASSUMED_SIZE_PARAMETERS)
|
||||||
transformAssumedSizeParameters(allFuncInfo);
|
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 elapsed = duration_cast<milliseconds>(high_resolution_clock::now() - timeForPass).count() / 1000.;
|
||||||
const float elapsedGlobal = duration_cast<milliseconds>(high_resolution_clock::now() - globalTime).count() / 1000.;
|
const float elapsedGlobal = duration_cast<milliseconds>(high_resolution_clock::now() - globalTime).count() / 1000.;
|
||||||
|
|||||||
@@ -6,7 +6,7 @@
|
|||||||
#include <set>
|
#include <set>
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
|
|
||||||
#include "../../CFGraph/CFGraph.h"
|
#include "../CFGraph/CFGraph.h"
|
||||||
|
|
||||||
using std::map;
|
using std::map;
|
||||||
using std::string;
|
using std::string;
|
||||||
|
|||||||
@@ -4,10 +4,10 @@
|
|||||||
#include<vector>
|
#include<vector>
|
||||||
|
|
||||||
#include "SgUtils.h"
|
#include "SgUtils.h"
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
#include "../CFGraph/live_variable_analysis.h"
|
#include "CFGraph/live_variable_analysis.h"
|
||||||
#include "../CFGraph/DataFlow/data_flow.h"
|
#include "CFGraph/DataFlow/data_flow.h"
|
||||||
#include "../CFGraph/DataFlow/backward_data_flow.h"
|
#include "CFGraph/DataFlow/backward_data_flow.h"
|
||||||
|
|
||||||
int removeDeadCode(SgStatement* func,
|
int removeDeadCode(SgStatement* func,
|
||||||
const std::map<std::string, std::vector<FuncInfo*>>&allFuncs,
|
const std::map<std::string, std::vector<FuncInfo*>>&allFuncs,
|
||||||
|
|||||||
@@ -6,7 +6,7 @@
|
|||||||
#include "../LoopAnalyzer/loop_analyzer.h"
|
#include "../LoopAnalyzer/loop_analyzer.h"
|
||||||
#include "expr_transform.h"
|
#include "expr_transform.h"
|
||||||
#include "errors.h"
|
#include "errors.h"
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
#include "../SageAnalysisTool/OmegaForSage/include/lang-interf.h"
|
#include "../SageAnalysisTool/OmegaForSage/include/lang-interf.h"
|
||||||
#include "../DirectiveProcessing/directive_parser.h"
|
#include "../DirectiveProcessing/directive_parser.h"
|
||||||
#include "../DirectiveProcessing/directive_omp_parser.h"
|
#include "../DirectiveProcessing/directive_omp_parser.h"
|
||||||
|
|||||||
@@ -2,8 +2,8 @@
|
|||||||
|
|
||||||
#include "dvm.h"
|
#include "dvm.h"
|
||||||
#include "../DirectiveProcessing/directive_parser.h"
|
#include "../DirectiveProcessing/directive_parser.h"
|
||||||
#include "../CFGraph/CFGraph.h"
|
#include "CFGraph/CFGraph.h"
|
||||||
#include "../CFGraph/RD_subst.h"
|
#include "CFGraph/RD_subst.h"
|
||||||
|
|
||||||
// Regime defines the regime of private removing
|
// Regime defines the regime of private removing
|
||||||
enum class Regime { DEFLT = 1, REGULAR_INDEXES };
|
enum class Regime { DEFLT = 1, REGULAR_INDEXES };
|
||||||
|
|||||||
@@ -17,6 +17,19 @@ using std::pair;
|
|||||||
|
|
||||||
#define DEBUG_TRACE 0
|
#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)
|
static SgExpression* findExprWithVariant(SgExpression* exp, int variant)
|
||||||
{
|
{
|
||||||
if (exp)
|
if (exp)
|
||||||
@@ -167,7 +180,7 @@ static void findArrays(SgExpression* exp, set<SgSymbol*>& arrays)
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays,
|
static bool populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& arrays,
|
||||||
SgStatement* stat,
|
SgStatement* stat,
|
||||||
const string& current_file_name,
|
const string& current_file_name,
|
||||||
FuncInfo *current_func)
|
FuncInfo *current_func)
|
||||||
@@ -175,7 +188,7 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
|||||||
auto var = stat->variant();
|
auto var = stat->variant();
|
||||||
|
|
||||||
if (var != READ_STAT && var != PRINT_STAT && var != WRITE_STAT)
|
if (var != READ_STAT && var != PRINT_STAT && var != WRITE_STAT)
|
||||||
return;
|
return false;
|
||||||
|
|
||||||
// check if such IO allowed in dvm:
|
// check if such IO allowed in dvm:
|
||||||
// list should consist only of single array and format string should be *
|
// list should consist only of single array and format string should be *
|
||||||
@@ -185,22 +198,26 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
|||||||
SgExpression* ioList = stat->expr(0);
|
SgExpression* ioList = stat->expr(0);
|
||||||
|
|
||||||
if (!ioList)
|
if (!ioList)
|
||||||
return;
|
return false;
|
||||||
|
|
||||||
if (ioList->variant() != EXPR_LIST)
|
if (ioList->variant() != EXPR_LIST)
|
||||||
return;
|
return false;
|
||||||
|
|
||||||
if (ioList->rhs() == NULL)
|
if (ioList->rhs() == NULL)
|
||||||
{
|
{
|
||||||
SgExpression* arg = ioList->lhs();
|
SgExpression* arg = ioList->lhs();
|
||||||
if (!arg)
|
if (!arg)
|
||||||
return;
|
return false;
|
||||||
|
|
||||||
if (!isArrayRef(arg))
|
if (hasArrayRef(arg))
|
||||||
return;
|
{
|
||||||
|
if (isArrayRef(arg) && arg->lhs())
|
||||||
if (arg->lhs())
|
need_replace = true;
|
||||||
need_replace = true;
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
@@ -220,7 +237,6 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
|||||||
if (fmt->rhs()->variant() != KEYWORD_VAL || fmt->rhs()->sunparse() != "*")
|
if (fmt->rhs()->variant() != KEYWORD_VAL || fmt->rhs()->sunparse() != "*")
|
||||||
need_replace = true;
|
need_replace = true;
|
||||||
|
|
||||||
|
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case READ_STAT:
|
case READ_STAT:
|
||||||
@@ -261,7 +277,9 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
|||||||
}
|
}
|
||||||
|
|
||||||
if (!need_replace)
|
if (!need_replace)
|
||||||
return;
|
return false;
|
||||||
|
|
||||||
|
bool ret = false;
|
||||||
|
|
||||||
set<SgSymbol*> found_arrays;
|
set<SgSymbol*> found_arrays;
|
||||||
|
|
||||||
@@ -280,10 +298,13 @@ static void populateDistributedIoArrays(map<SgSymbol*, set<SgStatement*>>& array
|
|||||||
|
|
||||||
if (inserted)
|
if (inserted)
|
||||||
__spf_print(DEBUG_TRACE, "[%d]: add array %s %p\n", stat->lineNumber(), array_p->GetName().c_str(), by_symb);
|
__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");
|
__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)
|
static void replaceArrayRec(SgSymbol* arr, SgSymbol* replace_by, SgExpression* exp, bool& has_read, bool& has_write, bool from_read, bool from_write)
|
||||||
@@ -501,12 +522,16 @@ static bool ioReginBorder(SgStatement* stat, SgStatement* last_io_bound)
|
|||||||
STOP_STAT,
|
STOP_STAT,
|
||||||
STOP_NODE,
|
STOP_NODE,
|
||||||
EXIT_STMT,
|
EXIT_STMT,
|
||||||
EXIT_NODE
|
EXIT_NODE,
|
||||||
|
GOTO_NODE
|
||||||
};
|
};
|
||||||
|
|
||||||
if (border_stats.find(var) != border_stats.end())
|
if (border_stats.find(var) != border_stats.end())
|
||||||
return true;
|
return true;
|
||||||
|
|
||||||
|
if (stat->hasLabel())
|
||||||
|
return true;
|
||||||
|
|
||||||
if (last_io_bound && last_io_bound->lastNodeOfStmt() && last_io_bound->lastNodeOfStmt() == stat)
|
if (last_io_bound && last_io_bound->lastNodeOfStmt() && last_io_bound->lastNodeOfStmt() == stat)
|
||||||
return true;
|
return true;
|
||||||
|
|
||||||
@@ -644,18 +669,17 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
|||||||
newDeclsToInclude,
|
newDeclsToInclude,
|
||||||
copied_syms);
|
copied_syms);
|
||||||
|
|
||||||
|
|
||||||
// original declaration statement
|
// original declaration statement
|
||||||
auto *decl_stmt = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
auto *decl_stmt = SgStatement::getStatementByFileAndLine(decl_place.first, decl_place.second);
|
||||||
|
|
||||||
if (!decl_stmt || !isSgDeclarationStatement(decl_stmt))
|
if (!decl_stmt || !isArrayDeclaration(decl_stmt))
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
auto dynamic_array = checkAssumedShape(decl_stmt, array_name);
|
auto dynamic_array = checkAssumedShape(decl_stmt, array_name);
|
||||||
|
|
||||||
while (decl_stmt && !isSgExecutableStatement(decl_stmt))
|
while (decl_stmt && !isSgExecutableStatement(decl_stmt))
|
||||||
{
|
{
|
||||||
if (isSgDeclarationStatement(decl_stmt) &&
|
if (isArrayDeclaration(decl_stmt) &&
|
||||||
decl_stmt->expr(0) &&
|
decl_stmt->expr(0) &&
|
||||||
decl_stmt->expr(0)->lhs() &&
|
decl_stmt->expr(0)->lhs() &&
|
||||||
decl_stmt->expr(0)->lhs()->symbol() == copied_symbol.second)
|
decl_stmt->expr(0)->lhs()->symbol() == copied_symbol.second)
|
||||||
@@ -667,7 +691,7 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
|||||||
}
|
}
|
||||||
|
|
||||||
// created declaration statement
|
// created declaration statement
|
||||||
if (!decl_stmt || !isSgDeclarationStatement(decl_stmt))
|
if (!decl_stmt || !isArrayDeclaration(decl_stmt))
|
||||||
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
|
||||||
|
|
||||||
// insert !$SPF ANALYSIS(PROCESS_PRIVATE(array)) directive before declaration statement
|
// insert !$SPF ANALYSIS(PROCESS_PRIVATE(array)) directive before declaration statement
|
||||||
@@ -833,7 +857,17 @@ void replaceDistributedArraysInIO(vector<ParallelRegion*>& regions,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
populateDistributedIoArrays(need_replace, curr_stmt, current_file_name, current_func_info);
|
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();
|
curr_stmt = curr_stmt->lexNext();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -390,32 +390,15 @@ void clearGlobalBuffer() { globalOutputBuffer = ""; }
|
|||||||
const string& getGlobalBuffer() { return globalOutputBuffer; }
|
const string& getGlobalBuffer() { return globalOutputBuffer; }
|
||||||
|
|
||||||
set<short*> allocated;
|
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
|
extern map<string, vector<Messages>> SPF_messages; //file ->messages
|
||||||
void clearGlobalMessagesBuffer()
|
void clearGlobalMessagesBuffer()
|
||||||
{
|
{
|
||||||
//clear allocated memory
|
//clear allocated memory
|
||||||
for (auto& elem : allocated)
|
for (auto& elem : allocated)
|
||||||
delete[]elem;
|
delete []elem;
|
||||||
for (auto& elem : allocatedInt)
|
|
||||||
delete[]elem;
|
|
||||||
allocated.clear();
|
allocated.clear();
|
||||||
allocatedInt.clear();
|
|
||||||
|
|
||||||
SPF_messages.clear();
|
SPF_messages.clear();
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -451,7 +434,7 @@ static map<string, vector<Messages>> removeCopies(map<string, vector<Messages>>
|
|||||||
return out;
|
return out;
|
||||||
}
|
}
|
||||||
|
|
||||||
static void convertGlobalMessagesBuffer(short *&result, int *&resultSize)
|
static string convertGlobalMessagesBuffer()
|
||||||
{
|
{
|
||||||
auto copySPF_messages = removeCopies(SPF_messages);
|
auto copySPF_messages = removeCopies(SPF_messages);
|
||||||
for (auto &byFile : copySPF_messages)
|
for (auto &byFile : copySPF_messages)
|
||||||
@@ -489,21 +472,13 @@ static void convertGlobalMessagesBuffer(short *&result, int *&resultSize)
|
|||||||
json all;
|
json all;
|
||||||
all["allMessages"] = allMessages;
|
all["allMessages"] = allMessages;
|
||||||
|
|
||||||
const string str = all.dump();
|
return all.dump();
|
||||||
const unsigned len = (unsigned)str.size();
|
|
||||||
|
|
||||||
copyStringToShort(result, str);
|
|
||||||
allocated.insert(result);
|
|
||||||
|
|
||||||
resultSize = new int[1];
|
|
||||||
resultSize[0] = (int)len;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void convertBuffers(string &resultM, string &result)
|
||||||
void convertBuffers(short*& resultM, int*& resultSizeM, short*& result, int*& resultSize)
|
|
||||||
{
|
{
|
||||||
convertGlobalMessagesBuffer(resultM, resultSizeM);
|
resultM = convertGlobalMessagesBuffer();
|
||||||
convertGlobalBuffer(result, resultSize);
|
result = getGlobalBuffer();
|
||||||
}
|
}
|
||||||
|
|
||||||
bool isSPF_comment(const string &bufStr)
|
bool isSPF_comment(const string &bufStr)
|
||||||
|
|||||||
@@ -33,7 +33,7 @@ void addToGlobalBufferAndPrint(const std::string &toPrint);
|
|||||||
void clearGlobalBuffer();
|
void clearGlobalBuffer();
|
||||||
const std::string& getGlobalBuffer();
|
const std::string& getGlobalBuffer();
|
||||||
std::wstring to_wstring(const std::string);
|
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();
|
void clearGlobalMessagesBuffer();
|
||||||
std::string renameInclude(const std::string& inc);
|
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);
|
void copyIncludes(const std::set<std::string> &allIncludeFiles, const std::map<std::string, std::map<int, std::set<std::string>>> &commentsToInclude, const std::map<std::string, std::map<int, std::set<std::string>>>& newCopyDeclToIncl, const char *folderName, bool keepSpfDirs, bool isFreeStyle, bool isRename, int removeDirs = 0);
|
||||||
|
|||||||
@@ -1,3 +1,3 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#define VERSION_SPF "2444"
|
#define VERSION_SPF "2447"
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user