diff options
| author | Tuowen Zhao <ztuowen@gmail.com> | 2016-09-17 19:21:10 -0600 |
|---|---|---|
| committer | Tuowen Zhao <ztuowen@gmail.com> | 2016-09-17 19:21:10 -0600 |
| commit | dffa5374ca560213452039fe569a70ca21b58a85 (patch) | |
| tree | b7ebb146cee60e9973b3f158196d56abd28c0f42 /chill/src | |
| parent | bdaf6dc251d98fc1c93165fa8579378204b395e1 (diff) | |
| download | chill-dffa5374ca560213452039fe569a70ca21b58a85.tar.gz chill-dffa5374ca560213452039fe569a70ca21b58a85.tar.bz2 chill-dffa5374ca560213452039fe569a70ca21b58a85.zip | |
added file doc
Diffstat (limited to 'chill/src')
| -rw-r--r-- | chill/src/chillmodule.cc | 3 | ||||
| -rw-r--r-- | chill/src/ir_rose_utils.cc | 25 |
2 files changed, 2 insertions, 26 deletions
diff --git a/chill/src/chillmodule.cc b/chill/src/chillmodule.cc index b7012cc..024ac33 100644 --- a/chill/src/chillmodule.cc +++ b/chill/src/chillmodule.cc @@ -1,6 +1,3 @@ - -// chill interface to python - #include "chilldebug.h" #include "chill_run_util.hh" diff --git a/chill/src/ir_rose_utils.cc b/chill/src/ir_rose_utils.cc index fbce2f1..64b0891 100644 --- a/chill/src/ir_rose_utils.cc +++ b/chill/src/ir_rose_utils.cc @@ -4,7 +4,7 @@ All Rights Reserved. Purpose: - SUIF interface utilities. + ROSE interface utilities. Notes: @@ -12,27 +12,13 @@ 01/2006 created by Chun Chen *****************************************************************************/ -//#include <suif1.h> -//#include <useful.h> -//#include <vector> -//#include <algorithm> -//#include <code_gen/CG_suifRepr.h> #include "ir_rose_utils.hh" std::vector<SgForStatement *> find_loops(SgNode *tnl) { std::vector<SgForStatement *> result; - - //tree_node_list_iter iter(tnl); - - /*while (!iter.is_empty()) { - tree_node *tn = iter.step(); - if (tn->kind() == TREE_FOR) - result.push_back(static_cast<tree_for *>(tn)); - } - */ - + SgStatementPtrList& blockStatements = isSgBasicBlock(tnl)->get_statements(); for(SgStatementPtrList::const_iterator j = blockStatements.begin(); j != blockStatements.end(); j++) if(isSgForStatement(*j)) @@ -60,13 +46,6 @@ std::vector<SgForStatement *> find_deepest_loops(SgStatementPtrList& tnl) { } - - - - - - - std::vector<SgForStatement *> find_deepest_loops(SgNode *tn) { if (isSgForStatement(tn)) { std::vector<SgForStatement *> loops; |