Compare commits
4 Commits
d6503e5174
...
877c5a0922
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
877c5a0922 | ||
|
|
cc0b188521 | ||
|
|
04355ed1f8 | ||
|
|
550c56c57f |
Binary file not shown.
Binary file not shown.
@@ -2324,7 +2324,7 @@ static void findFunctionsToInclude(bool needToAddErrors)
|
|||||||
|
|
||||||
static bool dvmInited = false;
|
static bool dvmInited = false;
|
||||||
|
|
||||||
void runPass(const int curr_regime, const char *proj_name, const char *folderName)
|
void runPass(const int curr_regime, const char *proj_name, const char *folderName, bool root_call)
|
||||||
{
|
{
|
||||||
// create full dependency graph
|
// create full dependency graph
|
||||||
switch (curr_regime)
|
switch (curr_regime)
|
||||||
@@ -2336,11 +2336,14 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
|||||||
}
|
}
|
||||||
|
|
||||||
// init math functions of FORTRAN
|
// init math functions of FORTRAN
|
||||||
|
if(root_call)
|
||||||
|
{
|
||||||
initIntrinsicFunctionNames();
|
initIntrinsicFunctionNames();
|
||||||
initTags();
|
initTags();
|
||||||
InitPassesDependencies(passesDependencies, passesIgnoreStateDone);
|
InitPassesDependencies(passesDependencies, passesIgnoreStateDone);
|
||||||
removalsFromPassesDependencies(passesDependencies);
|
removalsFromPassesDependencies(passesDependencies, curr_regime);
|
||||||
setPassValues();
|
setPassValues();
|
||||||
|
}
|
||||||
|
|
||||||
if (dvmInited == false)
|
if (dvmInited == false)
|
||||||
{
|
{
|
||||||
@@ -2403,6 +2406,8 @@ void runPass(const int curr_regime, const char *proj_name, const char *folderNam
|
|||||||
|
|
||||||
runPass(SELECT_ARRAY_DIM_CONF, proj_name, folderName);
|
runPass(SELECT_ARRAY_DIM_CONF, proj_name, folderName);
|
||||||
|
|
||||||
|
runPass(REVERT_SUBST_EXPR_RD, proj_name, folderName);
|
||||||
|
|
||||||
runAnalysis(*project, INSERT_PARALLEL_DIRS, false, consoleMode ? additionalName.c_str() : NULL, folderName);
|
runAnalysis(*project, INSERT_PARALLEL_DIRS, false, consoleMode ? additionalName.c_str() : NULL, folderName);
|
||||||
|
|
||||||
runPass(RESTORE_LOOP_FROM_ASSIGN, proj_name, folderName);
|
runPass(RESTORE_LOOP_FROM_ASSIGN, proj_name, folderName);
|
||||||
@@ -2933,9 +2938,9 @@ int main(int argc, char **argv)
|
|||||||
if (curr_regime == EMPTY_PASS)
|
if (curr_regime == EMPTY_PASS)
|
||||||
printHelp(passNames, printPasses ? EMPTY_PASS : -1);
|
printHelp(passNames, printPasses ? EMPTY_PASS : -1);
|
||||||
|
|
||||||
runPass(curr_regime, proj_name, folderName);
|
runPass(curr_regime, proj_name, folderName, true);
|
||||||
if (printText)
|
if (printText)
|
||||||
runPass(UNPARSE_FILE, proj_name, folderName);
|
runPass(UNPARSE_FILE, proj_name, folderName, true);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
catch (...)
|
catch (...)
|
||||||
|
|||||||
@@ -350,4 +350,4 @@ static int getPassCode(const std::string& passName)
|
|||||||
return z;
|
return z;
|
||||||
return -1;
|
return -1;
|
||||||
}
|
}
|
||||||
void runPass(const int curr_regime, const char *proj_name = "dvm.proj", const char *folderName = NULL);
|
void runPass(const int curr_regime, const char *proj_name = "dvm.proj", const char *folderName = NULL, bool root_call = false);
|
||||||
|
|||||||
@@ -12,6 +12,7 @@ using std::set;
|
|||||||
#define list vector<Pass>
|
#define list vector<Pass>
|
||||||
|
|
||||||
static map<passes, vector<passes>> *passDeps;
|
static map<passes, vector<passes>> *passDeps;
|
||||||
|
static map<passes, set<passes>> passRemovals;
|
||||||
|
|
||||||
class Pass
|
class Pass
|
||||||
{
|
{
|
||||||
@@ -56,7 +57,7 @@ public:
|
|||||||
return right;
|
return right;
|
||||||
}
|
}
|
||||||
|
|
||||||
friend const list& operator<<(const list &left_vec, const list &right_vec)
|
friend const list& operator<=(const list &left_vec, const list &right_vec)
|
||||||
{
|
{
|
||||||
for (int k = 0; k < right_vec.size(); ++k)
|
for (int k = 0; k < right_vec.size(); ++k)
|
||||||
{
|
{
|
||||||
@@ -72,40 +73,13 @@ public:
|
|||||||
friend void operator-=(const list& left_vec, const list& right_vec)
|
friend void operator-=(const list& left_vec, const list& right_vec)
|
||||||
{
|
{
|
||||||
/* erase each pass in right_vec from dependency tree for each pass in left_vec */
|
/* erase each pass in right_vec from dependency tree for each pass in left_vec */
|
||||||
set<passes> to_erase;
|
|
||||||
|
|
||||||
for(const auto& remove_pass : right_vec)
|
for(const auto& left : left_vec)
|
||||||
to_erase.insert(remove_pass.name);
|
{
|
||||||
|
auto& eraseFrom = passRemovals[left.name];
|
||||||
|
|
||||||
set<passes> to_process, processed;
|
for(const auto& right : right_vec)
|
||||||
|
eraseFrom.insert(right.name);
|
||||||
for (const auto& process_pass : left_vec)
|
|
||||||
to_process.insert(process_pass.name);
|
|
||||||
|
|
||||||
while (!to_process.empty()) {
|
|
||||||
set<passes> next_to_process;
|
|
||||||
|
|
||||||
for (const auto& pass_name : to_process) {
|
|
||||||
processed.insert(pass_name);
|
|
||||||
auto pass_deps = (*passDeps).find(pass_name);
|
|
||||||
if (pass_deps != (*passDeps).end()) {
|
|
||||||
for (auto dep = pass_deps->second.begin(); dep != pass_deps->second.end();) {
|
|
||||||
if (to_erase.find(*dep) != to_erase.end()) {
|
|
||||||
dep = pass_deps->second.erase(dep);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
if (processed.find(*dep) == processed.end())
|
|
||||||
next_to_process.insert(*dep);
|
|
||||||
dep++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if(pass_deps->second.empty())
|
|
||||||
pass_deps = (*passDeps).erase(pass_deps);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
to_process = next_to_process;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -124,6 +98,35 @@ public:
|
|||||||
list({ *this }) -= list({ right });
|
list({ *this }) -= list({ right });
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void applyRemovals() {
|
||||||
|
set<passes> to_process = { name }, processed;
|
||||||
|
|
||||||
|
while (!to_process.empty())
|
||||||
|
{
|
||||||
|
set<passes> to_process_next;
|
||||||
|
|
||||||
|
for (const auto& pass : to_process) {
|
||||||
|
if (processed.insert(pass).second) {
|
||||||
|
auto removals_it = passRemovals.find(pass);
|
||||||
|
auto deps_it = passDeps->find(pass);
|
||||||
|
|
||||||
|
if (removals_it != passRemovals.end() && deps_it != passDeps->end()) {
|
||||||
|
auto& removals = removals_it->second;
|
||||||
|
auto& deps = deps_it->second;
|
||||||
|
for (auto dep_it = deps.begin(); dep_it != deps.end();) {
|
||||||
|
if (removals.find(*dep_it) == removals.end())
|
||||||
|
to_process_next.insert(*(dep_it++));
|
||||||
|
else
|
||||||
|
dep_it = deps.erase(dep_it);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
to_process = to_process_next;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
Pass(passes name) : name(name) { }
|
Pass(passes name) : name(name) { }
|
||||||
};
|
};
|
||||||
|
|
||||||
@@ -148,20 +151,19 @@ static void depsToGraphViz(const map<passes, vector<passes>> &passDepsIn)
|
|||||||
|
|
||||||
void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes> &passesIgnoreStateDone, bool printTree = false)
|
void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes> &passesIgnoreStateDone, bool printTree = false)
|
||||||
{
|
{
|
||||||
if (passDepsIn.size() != 0)
|
passDepsIn.clear();
|
||||||
return;
|
|
||||||
|
|
||||||
passDeps = &passDepsIn;
|
passDeps = &passDepsIn;
|
||||||
|
|
||||||
Pass(PREPROC_SPF) <= Pass(CREATE_INTER_TREE);
|
Pass(PREPROC_SPF) <= Pass(CREATE_INTER_TREE);
|
||||||
|
|
||||||
list({ CREATE_INTER_TREE, CORRECT_VAR_DECL }) << list({ GCOV_PARSER, PREDICT_SCHEME, INSERT_INTER_TREE });
|
list({ CREATE_INTER_TREE, CORRECT_VAR_DECL }) <= list({ GCOV_PARSER, PREDICT_SCHEME, INSERT_INTER_TREE });
|
||||||
|
|
||||||
list({ FILE_LINE_INFO, BUILD_INCLUDE_DEPENDENCIES }) <= Pass(CORRECT_VAR_DECL);
|
list({ FILE_LINE_INFO, BUILD_INCLUDE_DEPENDENCIES }) <= Pass(CORRECT_VAR_DECL);
|
||||||
|
|
||||||
Pass(DEF_USE_STAGE1) <= Pass(DEF_USE_STAGE2);
|
Pass(DEF_USE_STAGE1) <= Pass(DEF_USE_STAGE2);
|
||||||
|
|
||||||
list({ VERIFY_DVM_DIRS, PRIVATE_CALL_GRAPH_STAGE1, PRIVATE_CALL_GRAPH_STAGE2, MACRO_EXPANSION, CONVERT_ASSIGN_TO_LOOP, DEF_USE_STAGE1, DEF_USE_STAGE2, FILL_PARALLEL_REG_IR, VERIFY_COMMON, FILL_COMMON_BLOCKS, CALL_GRAPH_IR }) << list({ SUBST_EXPR, SUBST_EXPR_RD, BUILD_IR });
|
list({ VERIFY_DVM_DIRS, PRIVATE_CALL_GRAPH_STAGE1, PRIVATE_CALL_GRAPH_STAGE2, MACRO_EXPANSION, CONVERT_ASSIGN_TO_LOOP, DEF_USE_STAGE1, DEF_USE_STAGE2, FILL_PARALLEL_REG_IR, VERIFY_COMMON, FILL_COMMON_BLOCKS, CALL_GRAPH_IR }) <= list({ SUBST_EXPR, SUBST_EXPR_RD, BUILD_IR });
|
||||||
|
|
||||||
Pass(BUILD_IR) <= Pass(SUBST_EXPR) <= Pass(SUBST_EXPR_AND_UNPARSE);
|
Pass(BUILD_IR) <= Pass(SUBST_EXPR) <= Pass(SUBST_EXPR_AND_UNPARSE);
|
||||||
|
|
||||||
@@ -173,19 +175,19 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
Pass(GET_ALL_ARRAY_DECL) <= Pass(CALL_GRAPH_IR);
|
Pass(GET_ALL_ARRAY_DECL) <= Pass(CALL_GRAPH_IR);
|
||||||
|
|
||||||
Pass(LOOP_GRAPH) <= Pass(PRIVATE_CALL_GRAPH_STAGE3) <= list(FIND_FUNC_TO_INCLUDE, PRIVATE_ANALYSIS_IR) << list({ LOOP_ANALYZER_DATA_DIST_S0, LOOP_ANALYZER_DATA_DIST_S1, ONLY_ARRAY_GRAPH, LOOP_ANALYZER_ALIGNS });
|
Pass(LOOP_GRAPH) <= Pass(PRIVATE_CALL_GRAPH_STAGE3) <= list(FIND_FUNC_TO_INCLUDE, PRIVATE_ANALYSIS_IR) <= list({ LOOP_ANALYZER_DATA_DIST_S0, LOOP_ANALYZER_DATA_DIST_S1, ONLY_ARRAY_GRAPH, LOOP_ANALYZER_ALIGNS });
|
||||||
|
|
||||||
Pass(PRIVATE_ANALYSIS_IR) <= Pass(LOOP_ANALYZER_NODIST);
|
Pass(PRIVATE_ANALYSIS_IR) <= Pass(LOOP_ANALYZER_NODIST);
|
||||||
|
|
||||||
Pass(CORRECT_VAR_DECL) <= list({ VERIFY_DVM_DIRS, PREPROC_SPF, VERIFY_ENDDO, VERIFY_INCLUDE, PREPROC_ALLOCATES, CHECK_FUNC_TO_INCLUDE, FILL_PAR_REGIONS_LINES, CONVERT_ASSIGN_TO_LOOP, VERIFY_COMMON, VERIFY_EQUIVALENCE, PRINT_PAR_REGIONS_ERRORS, VERIFY_OPERATORS, VERIFY_FORMAT }) <= Pass(CODE_CHECKER_PASSES);
|
Pass(CORRECT_VAR_DECL) <= list({ VERIFY_DVM_DIRS, PREPROC_SPF, VERIFY_ENDDO, VERIFY_INCLUDE, PREPROC_ALLOCATES, CHECK_FUNC_TO_INCLUDE, FILL_PAR_REGIONS_LINES, CONVERT_ASSIGN_TO_LOOP, VERIFY_COMMON, VERIFY_EQUIVALENCE, PRINT_PAR_REGIONS_ERRORS, VERIFY_OPERATORS, VERIFY_FORMAT }) <= Pass(CODE_CHECKER_PASSES);
|
||||||
|
|
||||||
list({ VERIFY_ENDDO, VERIFY_INCLUDE, PREPROC_SPF, PREPROC_ALLOCATES, GET_ALL_ARRAY_DECL, GCOV_PARSER }) << list({ CALL_GRAPH, MACRO_EXPANSION, DEF_USE_STAGE1 });
|
list({ VERIFY_ENDDO, VERIFY_INCLUDE, PREPROC_SPF, PREPROC_ALLOCATES, GET_ALL_ARRAY_DECL, GCOV_PARSER }) <= list({ CALL_GRAPH, MACRO_EXPANSION, DEF_USE_STAGE1 });
|
||||||
|
|
||||||
list({ VERIFY_ENDDO, VERIFY_INCLUDE, PREPROC_ALLOCATES, FILL_PARALLEL_REG_IR }) << list({ GET_ALL_ARRAY_DECL, FILL_COMMON_BLOCKS }) <= Pass(PREPROC_SPF);
|
list({ VERIFY_ENDDO, VERIFY_INCLUDE, PREPROC_ALLOCATES, FILL_PARALLEL_REG_IR }) <= list({ GET_ALL_ARRAY_DECL, FILL_COMMON_BLOCKS }) <= Pass(PREPROC_SPF);
|
||||||
|
|
||||||
Pass(CHECK_PAR_REG_DIR) <= Pass(FILL_PARALLEL_REG_IR);
|
Pass(CHECK_PAR_REG_DIR) <= Pass(FILL_PARALLEL_REG_IR);
|
||||||
|
|
||||||
list({ GET_ALL_ARRAY_DECL, CALL_GRAPH2, CODE_CHECKER_PASSES, SUBST_EXPR_RD, ARRAY_ACCESS_ANALYSIS_FOR_CORNER }) << list({ LOOP_ANALYZER_NODIST, LOOP_ANALYZER_DATA_DIST_S0, LOOP_ANALYZER_DATA_DIST_S1, ONLY_ARRAY_GRAPH });
|
list({ GET_ALL_ARRAY_DECL, CALL_GRAPH2, CODE_CHECKER_PASSES, SUBST_EXPR_RD, ARRAY_ACCESS_ANALYSIS_FOR_CORNER }) <= list({ LOOP_ANALYZER_NODIST, LOOP_ANALYZER_DATA_DIST_S0, LOOP_ANALYZER_DATA_DIST_S1, ONLY_ARRAY_GRAPH });
|
||||||
|
|
||||||
Pass(LOOP_ANALYZER_NODIST) <= Pass(INSERT_PARALLEL_DIRS_NODIST);
|
Pass(LOOP_ANALYZER_NODIST) <= Pass(INSERT_PARALLEL_DIRS_NODIST);
|
||||||
|
|
||||||
@@ -203,7 +205,7 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
Pass(LOOP_ANALYZER_DATA_DIST_S2) <= Pass(CREATE_NESTED_LOOPS);
|
Pass(LOOP_ANALYZER_DATA_DIST_S2) <= Pass(CREATE_NESTED_LOOPS);
|
||||||
|
|
||||||
list({ CORRECT_VAR_DECL, PREPROC_SPF }) << list({ LOOP_GRAPH, CALL_GRAPH, CALL_GRAPH2 });
|
list({ CORRECT_VAR_DECL, PREPROC_SPF }) <= list({ LOOP_GRAPH, CALL_GRAPH, CALL_GRAPH2 });
|
||||||
|
|
||||||
list({ PREPROC_SPF, CALL_GRAPH2 }) <= Pass(FILL_PAR_REGIONS_LINES) <= list({ EXPAND_EXTRACT_PAR_REGION, CHECK_FUNC_TO_INCLUDE, FIND_FUNC_TO_INCLUDE, CHECK_ARGS_DECL, SELECT_ARRAY_DIM_CONF});
|
list({ PREPROC_SPF, CALL_GRAPH2 }) <= Pass(FILL_PAR_REGIONS_LINES) <= list({ EXPAND_EXTRACT_PAR_REGION, CHECK_FUNC_TO_INCLUDE, FIND_FUNC_TO_INCLUDE, CHECK_ARGS_DECL, SELECT_ARRAY_DIM_CONF});
|
||||||
|
|
||||||
@@ -223,29 +225,29 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
|
|
||||||
Pass(CALL_GRAPH2) <= list({ PURE_SAVE_TO_PARAMS, PURE_MODULE_TO_PARAMS, PURE_COMMON_TO_PARAMS, PURE_INTENT_INSERT });
|
Pass(CALL_GRAPH2) <= list({ PURE_SAVE_TO_PARAMS, PURE_MODULE_TO_PARAMS, PURE_COMMON_TO_PARAMS, PURE_INTENT_INSERT });
|
||||||
|
|
||||||
list({ REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) << list({ PURE_SAVE_TO_PARAMS, PURE_MODULE_TO_PARAMS, PURE_COMMON_TO_PARAMS, PURE_INTENT_INSERT });
|
list({ REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) <= list({ PURE_SAVE_TO_PARAMS, PURE_MODULE_TO_PARAMS, PURE_COMMON_TO_PARAMS, PURE_INTENT_INSERT });
|
||||||
|
|
||||||
list({ CORRECT_VAR_DECL, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD, VERIFY_INCLUDE }) << list({ CONVERT_TO_ENDDO, CORRECT_CODE_STYLE, REMOVE_DVM_DIRS, REMOVE_DVM_DIRS_TO_COMMENTS, REMOVE_DVM_INTERVALS });
|
list({ CORRECT_VAR_DECL, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD, VERIFY_INCLUDE }) <= list({ CONVERT_TO_ENDDO, CORRECT_CODE_STYLE, REMOVE_DVM_DIRS, REMOVE_DVM_DIRS_TO_COMMENTS, REMOVE_DVM_INTERVALS });
|
||||||
|
|
||||||
list({ CALL_GRAPH2, CONVERT_LOOP_TO_ASSIGN, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD, RESTORE_LOOP_FROM_ASSIGN }) <= Pass(INLINE_PROCEDURES);
|
list({ CALL_GRAPH2, CONVERT_LOOP_TO_ASSIGN, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD, RESTORE_LOOP_FROM_ASSIGN }) <= Pass(INLINE_PROCEDURES);
|
||||||
|
|
||||||
list({ CONVERT_LOOP_TO_ASSIGN, CORRECT_FORMAT_PLACE }) << list({ CONVERT_TO_ENDDO, CORRECT_CODE_STYLE, INSERT_INCLUDES, REMOVE_DVM_DIRS, REMOVE_DVM_DIRS_TO_COMMENTS, REMOVE_DVM_INTERVALS });
|
list({ CONVERT_LOOP_TO_ASSIGN, CORRECT_FORMAT_PLACE }) <= list({ CONVERT_TO_ENDDO, CORRECT_CODE_STYLE, INSERT_INCLUDES, REMOVE_DVM_DIRS, REMOVE_DVM_DIRS_TO_COMMENTS, REMOVE_DVM_INTERVALS });
|
||||||
|
|
||||||
list({ CORRECT_VAR_DECL, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) << list({ INSERT_INCLUDES, UNPARSE_FILE, SET_TO_ALL_DECL_INIT_ZERO });
|
list({ CORRECT_VAR_DECL, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) <= list({ INSERT_INCLUDES, UNPARSE_FILE, SET_TO_ALL_DECL_INIT_ZERO });
|
||||||
|
|
||||||
Pass(CALL_GRAPH2) <= Pass(PRIVATE_ARRAYS_SHRINKING_ANALYSIS) <= Pass(PRIVATE_ARRAYS_SHRINKING);
|
Pass(CALL_GRAPH2) <= Pass(PRIVATE_ARRAYS_SHRINKING_ANALYSIS) <= Pass(PRIVATE_ARRAYS_SHRINKING);
|
||||||
|
|
||||||
list({ CALL_GRAPH2, LOOP_ANALYZER_ALIGNS, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) << list({ PRIVATE_ARRAYS_EXPANSION, PRIVATE_ARRAYS_SHRINKING });
|
list({ CALL_GRAPH2, LOOP_ANALYZER_ALIGNS, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) <= list({ PRIVATE_ARRAYS_EXPANSION, PRIVATE_ARRAYS_SHRINKING });
|
||||||
|
|
||||||
list({ GCOV_PARSER, CREATE_INTER_TREE, CALL_GRAPH, CALL_GRAPH2 }) <= Pass(CREATE_PARALLEL_REGIONS);
|
list({ GCOV_PARSER, CREATE_INTER_TREE, CALL_GRAPH, CALL_GRAPH2 }) <= Pass(CREATE_PARALLEL_REGIONS);
|
||||||
|
|
||||||
list({ PRIVATE_CALL_GRAPH_STAGE1, PRIVATE_CALL_GRAPH_STAGE2, MACRO_EXPANSION, CONVERT_ASSIGN_TO_LOOP, DEF_USE_STAGE1, DEF_USE_STAGE2, LOOP_GRAPH, CALL_GRAPH, PRIVATE_ANALYSIS_IR, FIND_FUNC_TO_INCLUDE }) <= Pass(INSERT_REGIONS);
|
list({ PRIVATE_CALL_GRAPH_STAGE1, PRIVATE_CALL_GRAPH_STAGE2, MACRO_EXPANSION, CONVERT_ASSIGN_TO_LOOP, DEF_USE_STAGE1, DEF_USE_STAGE2, LOOP_GRAPH, CALL_GRAPH, PRIVATE_ANALYSIS_IR, FIND_FUNC_TO_INCLUDE }) <= Pass(INSERT_REGIONS);
|
||||||
|
|
||||||
list({ LOOP_ANALYZER_DATA_DIST_S1, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) << list({ LOOPS_SPLITTER, LOOPS_COMBINER, UNROLL_LOOPS, INSERT_REGIONS });
|
list({ LOOP_ANALYZER_DATA_DIST_S1, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD }) <= list({ LOOPS_SPLITTER, LOOPS_COMBINER, UNROLL_LOOPS, INSERT_REGIONS });
|
||||||
|
|
||||||
list({ CALL_GRAPH2, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD, CONVERT_LOOP_TO_ASSIGN, RESTORE_LOOP_FROM_ASSIGN }) << list({ DUPLICATE_FUNCTIONS, REMOVE_UNUSED_FUNCTIONS });
|
list({ CALL_GRAPH2, REVERT_SUBST_EXPR, REVERT_SUBST_EXPR_RD, CONVERT_LOOP_TO_ASSIGN, RESTORE_LOOP_FROM_ASSIGN }) <= list({ DUPLICATE_FUNCTIONS, REMOVE_UNUSED_FUNCTIONS });
|
||||||
|
|
||||||
list({ CONVERT_LOOP_TO_ASSIGN, RESTORE_LOOP_FROM_ASSIGN }) << list({ LOOPS_SPLITTER, LOOPS_COMBINER, PRIVATE_ARRAYS_EXPANSION, PRIVATE_ARRAYS_SHRINKING, CREATE_PARALLEL_REGIONS, PURE_SAVE_TO_PARAMS, PURE_MODULE_TO_PARAMS, PURE_COMMON_TO_PARAMS, PURE_INTENT_INSERT });
|
list({ CONVERT_LOOP_TO_ASSIGN, RESTORE_LOOP_FROM_ASSIGN }) <= list({ LOOPS_SPLITTER, LOOPS_COMBINER, PRIVATE_ARRAYS_EXPANSION, PRIVATE_ARRAYS_SHRINKING, CREATE_PARALLEL_REGIONS, PURE_SAVE_TO_PARAMS, PURE_MODULE_TO_PARAMS, PURE_COMMON_TO_PARAMS, PURE_INTENT_INSERT });
|
||||||
|
|
||||||
list({ GET_ALL_ARRAY_DECL, FILL_PARALLEL_REG_IR }) <= Pass(CONVERT_ASSIGN_TO_LOOP);
|
list({ GET_ALL_ARRAY_DECL, FILL_PARALLEL_REG_IR }) <= Pass(CONVERT_ASSIGN_TO_LOOP);
|
||||||
|
|
||||||
@@ -272,8 +274,10 @@ void InitPassesDependencies(map<passes, vector<passes>> &passDepsIn, set<passes>
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void removalsFromPassesDependencies(map<passes, vector<passes>>& passDepsIn)
|
void removalsFromPassesDependencies(map<passes, vector<passes>>& passDepsIn, const int curr_regime)
|
||||||
{
|
{
|
||||||
Pass(INSERT_PARALLEL_DIRS_NODIST) -= list({ FIND_FUNC_TO_INCLUDE, CHECK_FUNC_TO_INCLUDE });
|
Pass(INSERT_PARALLEL_DIRS_NODIST) -= list({ FIND_FUNC_TO_INCLUDE, CHECK_FUNC_TO_INCLUDE });
|
||||||
|
|
||||||
|
Pass(passes(curr_regime)).applyRemovals();
|
||||||
}
|
}
|
||||||
#undef list
|
#undef list
|
||||||
|
|||||||
Reference in New Issue
Block a user