blob: 13290312af69ac74b32a798dd759bb9f492de7be (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
/*****************************************************************************
Copyright (C) 2008 University of Southern California
Copyright (C) 2009 University of Utah
All Rights Reserved.
Purpose:
ROSE interface utilities.
Notes:
Update history:
01/2006 created by Chun Chen
*****************************************************************************/
#include "ir_rose_utils.hh"
std::vector<SgForStatement *> find_loops(SgNode *tnl) {
std::vector<SgForStatement *> result;
SgStatementPtrList& blockStatements = isSgBasicBlock(tnl)->get_statements();
for(SgStatementPtrList::const_iterator j = blockStatements.begin(); j != blockStatements.end(); j++)
if(isSgForStatement(*j))
result.push_back(isSgForStatement(*j));
return result;
}
std::vector<SgForStatement *> find_deepest_loops(SgStatementPtrList& tnl) {
std::vector<SgForStatement *> loops;
for(SgStatementPtrList::const_iterator j = tnl.begin(); j != tnl.end(); j++)
{
std::vector<SgForStatement *> t = find_deepest_loops(isSgNode(*j));
if (t.size() > loops.size())
loops = t;
}
return loops;
}
std::vector<SgForStatement *> find_deepest_loops(SgNode *tn) {
if (isSgForStatement(tn)) {
std::vector<SgForStatement *> loops;
SgForStatement *tnf = static_cast<SgForStatement*>(tn);
loops.insert(loops.end(), tnf);
std::vector<SgForStatement*> t = find_deepest_loops(isSgNode(tnf->get_loop_body()));
std::copy(t.begin(), t.end(), std::back_inserter(loops));
return loops;
}
else if (isSgBasicBlock(tn)) {
SgBasicBlock *tnb = static_cast<SgBasicBlock*>(tn);
return find_deepest_loops(tnb->get_statements());
}
else
return std::vector<SgForStatement *>();
}
|
