Compare commits
25 Commits
06aabdbee6
...
egormayoro
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
e9d5a2ee70 | ||
|
|
2746d072d4 | ||
| f7005a2735 | |||
|
|
a86a76705e | ||
|
|
7fed8f13c3 | ||
|
|
2aba5e07bf | ||
|
|
601c6b6e88 | ||
|
|
97689d999b | ||
|
|
a85cf28965 | ||
|
|
3c6f5a7a56 | ||
|
|
e7661998fe | ||
|
|
01d769f38b | ||
|
|
63e6d22d49 | ||
| 47e2b961e2 | |||
|
|
b95b336372 | ||
| f35d7cb4bd | |||
| 54615e34d4 | |||
| 8752f4a139 | |||
| 453105d273 | |||
| cad0a0b217 | |||
| 9c0fd40e7b | |||
| c7a31c8bbb | |||
|
|
9900929349 | ||
|
|
e1ba299159 | ||
|
|
8de18d1788 |
1
.gitignore
vendored
1
.gitignore
vendored
@@ -78,3 +78,4 @@ Sapfor/Sapc++/x64/
|
|||||||
|
|
||||||
Sapfor/out/
|
Sapfor/out/
|
||||||
Sapfor/_bin/*
|
Sapfor/_bin/*
|
||||||
|
_bin/*
|
||||||
|
|||||||
@@ -204,6 +204,8 @@ set(TR_INLINER src/Transformations/FunctionInlining/inliner.cpp
|
|||||||
src/Transformations/FunctionInlining/inliner.h)
|
src/Transformations/FunctionInlining/inliner.h)
|
||||||
set(TR_RENAME_SYMBOLS src/Transformations/RenameSymbols/rename_symbols.cpp
|
set(TR_RENAME_SYMBOLS src/Transformations/RenameSymbols/rename_symbols.cpp
|
||||||
src/Transformations/RenameSymbols/rename_symbols.h)
|
src/Transformations/RenameSymbols/rename_symbols.h)
|
||||||
|
SET(TR_SWAP_OPERATORS src/Transformations/SwapOperators/swap_operators.cpp
|
||||||
|
src/Transformations/SwapOperators/swap_operators.h)
|
||||||
|
|
||||||
set(TRANSFORMS
|
set(TRANSFORMS
|
||||||
${TR_DEAD_CODE}
|
${TR_DEAD_CODE}
|
||||||
@@ -226,7 +228,8 @@ set(TRANSFORMS
|
|||||||
${TR_REPLACE_ARRAYS_IN_IO}
|
${TR_REPLACE_ARRAYS_IN_IO}
|
||||||
${TR_EXPR_TRANSFORM}
|
${TR_EXPR_TRANSFORM}
|
||||||
${TR_INLINER}
|
${TR_INLINER}
|
||||||
${TR_RENAME_SYMBOLS})
|
${TR_RENAME_SYMBOLS}
|
||||||
|
${TR_SWAP_OPERATORS})
|
||||||
|
|
||||||
set(CFG src/CFGraph/IR.cpp
|
set(CFG src/CFGraph/IR.cpp
|
||||||
src/CFGraph/IR.h
|
src/CFGraph/IR.h
|
||||||
@@ -459,6 +462,7 @@ source_group (Transformations\\GlobalVariables FILES ${TR_GV})
|
|||||||
source_group (Transformations\\ConvertToC FILES ${TR_CONV})
|
source_group (Transformations\\ConvertToC FILES ${TR_CONV})
|
||||||
source_group (Transformations\\SetImplicitNone FILES ${TR_IMPLICIT_NONE})
|
source_group (Transformations\\SetImplicitNone FILES ${TR_IMPLICIT_NONE})
|
||||||
source_group (Transformations\\ReplaceArraysInIO FILES ${TR_REPLACE_ARRAYS_IN_IO})
|
source_group (Transformations\\ReplaceArraysInIO FILES ${TR_REPLACE_ARRAYS_IN_IO})
|
||||||
|
source_group (Transformations\\SwapOperators FILES ${TR_SWAP_OPERATORS})
|
||||||
|
|
||||||
|
|
||||||
source_group (CreateIntervals FILES ${CREATE_INTER_T})
|
source_group (CreateIntervals FILES ${CREATE_INTER_T})
|
||||||
@@ -496,7 +500,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)
|
||||||
|
|||||||
@@ -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;
|
||||||
|
|||||||
@@ -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:
|
||||||
|
|||||||
@@ -89,6 +89,7 @@
|
|||||||
#include "Transformations/DeadCodeRemoving/dead_code.h"
|
#include "Transformations/DeadCodeRemoving/dead_code.h"
|
||||||
#include "Transformations/RenameSymbols/rename_symbols.h"
|
#include "Transformations/RenameSymbols/rename_symbols.h"
|
||||||
#include "Transformations/FunctionInlining/inliner.h"
|
#include "Transformations/FunctionInlining/inliner.h"
|
||||||
|
#include "Transformations/SwapOperators/swap_operators.h"
|
||||||
|
|
||||||
#include "ProjectParameters/projectParameters.h"
|
#include "ProjectParameters/projectParameters.h"
|
||||||
|
|
||||||
@@ -939,6 +940,8 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
internalExit = err;
|
internalExit = err;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
else if (curr_regime == SWAP_OPERATORS)
|
||||||
|
runSwapOperators(file, loopGraph, fullIR, countOfTransform);
|
||||||
else if (curr_regime == PRIVATE_REMOVING_ANALYSIS)
|
else if (curr_regime == PRIVATE_REMOVING_ANALYSIS)
|
||||||
{
|
{
|
||||||
auto itFound = loopGraph.find(file->filename());
|
auto itFound = loopGraph.find(file->filename());
|
||||||
@@ -1037,7 +1040,8 @@ static bool runAnalysis(SgProject &project, const int curr_regime, const bool ne
|
|||||||
PRIVATE_REMOVING,
|
PRIVATE_REMOVING,
|
||||||
PRIVATE_ARRAYS_EXPANSION,
|
PRIVATE_ARRAYS_EXPANSION,
|
||||||
PRIVATE_ARRAYS_SHRINKING,
|
PRIVATE_ARRAYS_SHRINKING,
|
||||||
REMOVE_DEAD_CODE };
|
REMOVE_DEAD_CODE,
|
||||||
|
SWAP_OPERATORS };
|
||||||
|
|
||||||
if ((countOfTransform == 0 || internalExit > 0) && applyFor.find(curr_regime) != applyFor.end())
|
if ((countOfTransform == 0 || internalExit > 0) && applyFor.find(curr_regime) != applyFor.end())
|
||||||
{
|
{
|
||||||
@@ -2334,6 +2338,7 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
|||||||
case INSERT_NO_DISTR_FLAGS_FROM_GUI:
|
case INSERT_NO_DISTR_FLAGS_FROM_GUI:
|
||||||
case PRIVATE_REMOVING:
|
case PRIVATE_REMOVING:
|
||||||
case RENAME_INLCUDES:
|
case RENAME_INLCUDES:
|
||||||
|
case SWAP_OPERATORS:
|
||||||
runAnalysis(*project, curr_regime, true, "", folderName);
|
runAnalysis(*project, curr_regime, true, "", folderName);
|
||||||
break;
|
break;
|
||||||
case INLINE_PROCEDURES:
|
case INLINE_PROCEDURES:
|
||||||
|
|||||||
@@ -122,6 +122,8 @@ enum passes {
|
|||||||
CREATE_INTER_TREE,
|
CREATE_INTER_TREE,
|
||||||
INSERT_INTER_TREE,
|
INSERT_INTER_TREE,
|
||||||
|
|
||||||
|
SWAP_OPERATORS,
|
||||||
|
|
||||||
SHADOW_GROUPING,
|
SHADOW_GROUPING,
|
||||||
INLINE_PROCEDURES,
|
INLINE_PROCEDURES,
|
||||||
FILL_PARALLEL_REG_IR,
|
FILL_PARALLEL_REG_IR,
|
||||||
@@ -319,6 +321,7 @@ static void setPassValues()
|
|||||||
passNames[CHECK_PAR_REG_DIR] = "CHECK_PAR_REG_DIR";
|
passNames[CHECK_PAR_REG_DIR] = "CHECK_PAR_REG_DIR";
|
||||||
passNames[CREATE_INTER_TREE] = "CREATE_INTER_TREE";
|
passNames[CREATE_INTER_TREE] = "CREATE_INTER_TREE";
|
||||||
passNames[INSERT_INTER_TREE] = "INSERT_INTER_TREE";
|
passNames[INSERT_INTER_TREE] = "INSERT_INTER_TREE";
|
||||||
|
passNames[SWAP_OPERATORS] = "SWAP_OPERATORS";
|
||||||
passNames[CREATE_PARALLEL_REGIONS] = "CREATE_PARALLEL_REGIONS";
|
passNames[CREATE_PARALLEL_REGIONS] = "CREATE_PARALLEL_REGIONS";
|
||||||
passNames[PRIVATE_REMOVING_ANALYSIS] = "PRIVATE_REMOVING_ANALYSIS";
|
passNames[PRIVATE_REMOVING_ANALYSIS] = "PRIVATE_REMOVING_ANALYSIS";
|
||||||
passNames[PRIVATE_REMOVING] = "PRIVATE_REMOVING";
|
passNames[PRIVATE_REMOVING] = "PRIVATE_REMOVING";
|
||||||
|
|||||||
@@ -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,24 +198,28 @@ 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
|
else
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
{
|
{
|
||||||
need_replace = true;
|
need_replace = true;
|
||||||
}
|
}
|
||||||
@@ -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();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
299
src/Transformations/SwapOperators/swap_operators.cpp
Normal file
299
src/Transformations/SwapOperators/swap_operators.cpp
Normal file
@@ -0,0 +1,299 @@
|
|||||||
|
#include <map>
|
||||||
|
#include <unordered_set>
|
||||||
|
#include <vector>
|
||||||
|
#include <queue>
|
||||||
|
#include <iostream>
|
||||||
|
#include <algorithm>
|
||||||
|
|
||||||
|
#include "../../Utils/errors.h"
|
||||||
|
#include "../../Utils/SgUtils.h"
|
||||||
|
#include "../../GraphCall/graph_calls.h"
|
||||||
|
#include "../../GraphCall/graph_calls_func.h"
|
||||||
|
#include "../../CFGraph/CFGraph.h"
|
||||||
|
#include "../../CFGraph/IR.h"
|
||||||
|
#include "../../GraphLoop/graph_loops.h"
|
||||||
|
#include "swap_operators.h"
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
string getNameByArg(SAPFOR::Argument* arg);
|
||||||
|
SgSymbol* getSybolByArg(SAPFOR::Argument* arg);
|
||||||
|
|
||||||
|
static vector<SAPFOR::IR_Block*> findInstructionsFromOperator(SgStatement* st, vector<SAPFOR::BasicBlock*> Blocks) {
|
||||||
|
vector<SAPFOR::IR_Block*> result;
|
||||||
|
string filename = st->fileName();
|
||||||
|
|
||||||
|
for (auto& block: Blocks) {
|
||||||
|
vector<SAPFOR::IR_Block*> instructionsInBlock = block->getInstructions();
|
||||||
|
for (auto& instruction: instructionsInBlock) {
|
||||||
|
SgStatement* curOperator = instruction->getInstruction()->getOperator();
|
||||||
|
// Match by line number to find corresponding IR instruction
|
||||||
|
if (curOperator->lineNumber() == st->lineNumber()) {
|
||||||
|
result.push_back(instruction);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
unordered_set<int> loop_tags = {FOR_NODE};
|
||||||
|
unordered_set<int> control_tags = {IF_NODE, ELSEIF_NODE, DO_WHILE_NODE, WHILE_NODE};
|
||||||
|
unordered_set<int> control_end_tags = {CONTROL_END};
|
||||||
|
|
||||||
|
struct OperatorInfo {
|
||||||
|
SgStatement* stmt;
|
||||||
|
set<string> usedVars;
|
||||||
|
set<string> definedVars;
|
||||||
|
int lineNumber;
|
||||||
|
bool isMovable;
|
||||||
|
OperatorInfo(SgStatement* s) : stmt(s), lineNumber(s->lineNumber()), isMovable(true) {}
|
||||||
|
};
|
||||||
|
|
||||||
|
static vector<OperatorInfo> analyzeOperatorsInLoop(SgForStmt* loop, vector<SAPFOR::BasicBlock*> blocks, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR) {
|
||||||
|
vector<OperatorInfo> operators;
|
||||||
|
SgStatement* loopStart = loop->lexNext();
|
||||||
|
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
||||||
|
|
||||||
|
SgStatement* current = loopStart;
|
||||||
|
while (current && current != loopEnd) {
|
||||||
|
if (isSgExecutableStatement(current)) {
|
||||||
|
OperatorInfo opInfo(current);
|
||||||
|
|
||||||
|
vector<SAPFOR::IR_Block*> irBlocks = findInstructionsFromOperator(current, blocks);
|
||||||
|
for (auto irBlock : irBlocks) {
|
||||||
|
SAPFOR::Instruction* instr = irBlock->getInstruction();
|
||||||
|
|
||||||
|
if (instr->getArg1()) {
|
||||||
|
string varName = getNameByArg(instr->getArg1());
|
||||||
|
if (!varName.empty()) {
|
||||||
|
opInfo.usedVars.insert(varName);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (instr->getArg2()) {
|
||||||
|
string varName = getNameByArg(instr->getArg2());
|
||||||
|
if (!varName.empty()) {
|
||||||
|
opInfo.usedVars.insert(varName);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (instr->getResult()) {
|
||||||
|
string varName = getNameByArg(instr->getResult());
|
||||||
|
if (!varName.empty()) {
|
||||||
|
opInfo.definedVars.insert(varName);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (control_tags.find(current->variant()) != control_tags.end()) {
|
||||||
|
opInfo.isMovable = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
operators.push_back(opInfo);
|
||||||
|
}
|
||||||
|
current = current->lexNext();
|
||||||
|
}
|
||||||
|
|
||||||
|
return operators;
|
||||||
|
}
|
||||||
|
|
||||||
|
static map<string, vector<SgStatement*>> findVariableDefinitions(SgForStmt* loop, vector<OperatorInfo>& operators) {
|
||||||
|
map<string, vector<SgStatement*>> varDefinitions;
|
||||||
|
|
||||||
|
for (auto& op : operators) {
|
||||||
|
for (const string& var : op.definedVars) {
|
||||||
|
varDefinitions[var].push_back(op.stmt);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return varDefinitions;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int calculateDistance(SgStatement* from, SgStatement* to) {
|
||||||
|
if (!from || !to) return INT_MAX;
|
||||||
|
return abs(to->lineNumber() - from->lineNumber());
|
||||||
|
}
|
||||||
|
|
||||||
|
static SgStatement* findBestPosition(SgStatement* operatorStmt, vector<OperatorInfo>& operators, map<string, vector<SgStatement*>>& varDefinitions) {
|
||||||
|
OperatorInfo* opInfo = nullptr;
|
||||||
|
for (auto& op : operators) {
|
||||||
|
if (op.stmt == operatorStmt) {
|
||||||
|
opInfo = &op;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!opInfo || !opInfo->isMovable) return nullptr;
|
||||||
|
|
||||||
|
SgStatement* bestPos = nullptr;
|
||||||
|
int minDistance = INT_MAX;
|
||||||
|
|
||||||
|
for (const string& usedVar : opInfo->usedVars) {
|
||||||
|
if (varDefinitions.find(usedVar) != varDefinitions.end()) {
|
||||||
|
for (SgStatement* defStmt : varDefinitions[usedVar]) {
|
||||||
|
int distance = calculateDistance(operatorStmt, defStmt);
|
||||||
|
if (distance < minDistance) {
|
||||||
|
minDistance = distance;
|
||||||
|
bestPos = defStmt;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return bestPos;
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool canMoveTo(SgStatement* from, SgStatement* to, SgForStmt* loop) {
|
||||||
|
if (!from || !to || from == to) return false;
|
||||||
|
|
||||||
|
SgStatement* loopStart = loop->lexNext();
|
||||||
|
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
||||||
|
|
||||||
|
if (to->lineNumber() < loopStart->lineNumber() || to->lineNumber() > loopEnd->lineNumber()) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
SgStatement* current = from;
|
||||||
|
while (current && current != loopEnd) {
|
||||||
|
if (control_tags.find(current->variant()) != control_tags.end()) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
if (current == to) break;
|
||||||
|
current = current->lexNext();
|
||||||
|
}
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
static vector<SgStatement*> optimizeOperatorOrder(SgForStmt* loop, vector<OperatorInfo>& operators, map<string, vector<SgStatement*>>& varDefinitions) {
|
||||||
|
vector<SgStatement*> newOrder;
|
||||||
|
vector<bool> moved(operators.size(), false);
|
||||||
|
|
||||||
|
for (size_t i = 0; i < operators.size(); i++) {
|
||||||
|
if (moved[i] || !operators[i].isMovable) {
|
||||||
|
newOrder.push_back(operators[i].stmt);
|
||||||
|
moved[i] = true;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
SgStatement* bestPos = findBestPosition(operators[i].stmt, operators, varDefinitions);
|
||||||
|
|
||||||
|
if (bestPos && canMoveTo(operators[i].stmt, bestPos, loop)) {
|
||||||
|
bool inserted = false;
|
||||||
|
for (size_t j = 0; j < newOrder.size(); j++) {
|
||||||
|
if (newOrder[j] == bestPos) {
|
||||||
|
newOrder.insert(newOrder.begin() + j + 1, operators[i].stmt);
|
||||||
|
inserted = true;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (!inserted) {
|
||||||
|
newOrder.push_back(operators[i].stmt);
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
newOrder.push_back(operators[i].stmt);
|
||||||
|
}
|
||||||
|
moved[i] = true;
|
||||||
|
}
|
||||||
|
|
||||||
|
return newOrder;
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool applyOperatorReordering(SgForStmt* loop, vector<SgStatement*>& newOrder) {
|
||||||
|
if (!loop || newOrder.empty()) return false;
|
||||||
|
|
||||||
|
SgStatement* loopStart = loop->lexNext();
|
||||||
|
SgStatement* loopEnd = loop->lastNodeOfStmt();
|
||||||
|
|
||||||
|
vector<SgStatement*> extractedStatements;
|
||||||
|
vector<char*> savedComments;
|
||||||
|
|
||||||
|
for (SgStatement* stmt : newOrder) {
|
||||||
|
if (stmt && stmt != loop && stmt != loopEnd) {
|
||||||
|
savedComments.push_back(stmt->comments() ? strdup(stmt->comments()) : nullptr);
|
||||||
|
SgStatement* extracted = stmt->extractStmt();
|
||||||
|
if (extracted) {
|
||||||
|
extractedStatements.push_back(extracted);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
SgStatement* currentPos = loop;
|
||||||
|
int lineCounter = loop->lineNumber() + 1;
|
||||||
|
|
||||||
|
for (size_t i = 0; i < extractedStatements.size(); i++) {
|
||||||
|
SgStatement* stmt = extractedStatements[i];
|
||||||
|
if (stmt) {
|
||||||
|
if (i < savedComments.size() && savedComments[i]) {
|
||||||
|
stmt->setComments(savedComments[i]);
|
||||||
|
}
|
||||||
|
stmt->setlineNumber(lineCounter++);
|
||||||
|
currentPos->insertStmtAfter(*stmt, *loop);
|
||||||
|
currentPos = stmt;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
for (char* comment : savedComments) {
|
||||||
|
if (comment) {
|
||||||
|
free(comment);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (currentPos && currentPos->lexNext() != loopEnd) {
|
||||||
|
currentPos->setLexNext(*loopEnd);
|
||||||
|
}
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
vector<SAPFOR::BasicBlock*> findFuncBlocksByFuncStatement(SgStatement *st, map<FuncInfo*, vector<SAPFOR::BasicBlock*>>& FullIR) {
|
||||||
|
vector<SAPFOR::BasicBlock*> result;
|
||||||
|
Statement* forSt = (Statement*)st;
|
||||||
|
for (auto& func: FullIR) {
|
||||||
|
if (func.first -> funcPointer -> getCurrProcessFile() == forSt -> getCurrProcessFile()
|
||||||
|
&& func.first -> funcPointer -> lineNumber() == forSt -> lineNumber())
|
||||||
|
result = func.second;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> findAndAnalyzeLoops(SgStatement *st, vector<SAPFOR::BasicBlock*> blocks) {
|
||||||
|
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> result;
|
||||||
|
SgStatement *lastNode = st->lastNodeOfStmt();
|
||||||
|
while (st && st != lastNode) {
|
||||||
|
if (loop_tags.find(st -> variant()) != loop_tags.end()) {
|
||||||
|
SgForStmt *forSt = (SgForStmt*)st;
|
||||||
|
SgStatement *loopBody = forSt -> body();
|
||||||
|
SgStatement *lastLoopNode = st->lastNodeOfStmt();
|
||||||
|
unordered_set<int> blocks_nums;
|
||||||
|
while (loopBody && loopBody != lastLoopNode) {
|
||||||
|
SAPFOR::IR_Block* IR = findInstructionsFromOperator(loopBody, blocks).front();
|
||||||
|
if (blocks_nums.find(IR -> getBasicBlock() -> getNumber()) == blocks_nums.end()) {
|
||||||
|
result[forSt].push_back(IR -> getBasicBlock());
|
||||||
|
blocks_nums.insert(IR -> getBasicBlock() -> getNumber());
|
||||||
|
}
|
||||||
|
loopBody = loopBody -> lexNext();
|
||||||
|
}
|
||||||
|
std::sort(result[forSt].begin(), result[forSt].end());
|
||||||
|
}
|
||||||
|
st = st -> lexNext();
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
void runSwapOperators(SgFile *file, std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR, int& countOfTransform) {
|
||||||
|
countOfTransform += 1;
|
||||||
|
|
||||||
|
const int funcNum = file -> numberOfFunctions();
|
||||||
|
for (int i = 0; i < funcNum; ++i) {
|
||||||
|
SgStatement *st = file -> functions(i);
|
||||||
|
vector<SAPFOR::BasicBlock*> blocks = findFuncBlocksByFuncStatement(st, FullIR);
|
||||||
|
map<SgForStmt*, vector<SAPFOR::BasicBlock*>> loopsMapping = findAndAnalyzeLoops(st, blocks);
|
||||||
|
|
||||||
|
for (pair<SgForStmt*, vector<SAPFOR::BasicBlock*>> loopForAnalyze: loopsMapping) {
|
||||||
|
vector<OperatorInfo> operators = analyzeOperatorsInLoop(loopForAnalyze.first, loopForAnalyze.second, FullIR);
|
||||||
|
map<string, vector<SgStatement*>> varDefinitions = findVariableDefinitions(loopForAnalyze.first, operators);
|
||||||
|
|
||||||
|
vector<SgStatement*> newOrder = optimizeOperatorOrder(loopForAnalyze.first, operators, varDefinitions);
|
||||||
|
applyOperatorReordering(loopForAnalyze.first, newOrder);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
6
src/Transformations/SwapOperators/swap_operators.h
Normal file
6
src/Transformations/SwapOperators/swap_operators.h
Normal file
@@ -0,0 +1,6 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "../../GraphLoop/graph_loops.h"
|
||||||
|
#include "../../CFGraph/CFGraph.h"
|
||||||
|
|
||||||
|
void runSwapOperators(SgFile *file, std::map<std::string, std::vector<LoopGraph*>>& loopGraph, std::map<FuncInfo*, std::vector<SAPFOR::BasicBlock*>>& FullIR, int& countOfTransform);
|
||||||
@@ -212,6 +212,8 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
Pass(BUILD_IR) <= Pass(SUBST_EXPR_RD) <= Pass(SUBST_EXPR_RD_AND_UNPARSE);
|
Pass(BUILD_IR) <= Pass(SUBST_EXPR_RD) <= Pass(SUBST_EXPR_RD_AND_UNPARSE);
|
||||||
|
|
||||||
|
list({BUILD_IR, CALL_GRAPH2}) <= Pass(SWAP_OPERATORS);
|
||||||
|
|
||||||
list({ LOOP_ANALYZER_DATA_DIST_S1, SUBST_EXPR_RD } ) <= Pass(PRIVATE_REMOVING_ANALYSIS);
|
list({ LOOP_ANALYZER_DATA_DIST_S1, SUBST_EXPR_RD } ) <= Pass(PRIVATE_REMOVING_ANALYSIS);
|
||||||
list({ PRIVATE_REMOVING_ANALYSIS, REVERT_SUBST_EXPR_RD }) <= Pass(PRIVATE_REMOVING);
|
list({ PRIVATE_REMOVING_ANALYSIS, REVERT_SUBST_EXPR_RD }) <= Pass(PRIVATE_REMOVING);
|
||||||
|
|
||||||
|
|||||||
@@ -390,31 +390,14 @@ 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 "2446"
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user