forked from vgvassilev/creduce
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinOpSimplification.cpp
195 lines (151 loc) · 5.04 KB
/
BinOpSimplification.cpp
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
//===----------------------------------------------------------------------===//
//
// Copyright (c) 2012, 2013 The University of Utah
// All rights reserved.
//
// This file is distributed under the University of Illinois Open Source
// License. See the file COPYING for details.
//
//===----------------------------------------------------------------------===//
#if HAVE_CONFIG_H
# include <config.h>
#endif
#include "BinOpSimplification.h"
#include <sstream>
#include "clang/AST/RecursiveASTVisitor.h"
#include "clang/AST/ASTContext.h"
#include "clang/Basic/SourceManager.h"
#include "CommonStatementVisitor.h"
#include "TransformationManager.h"
using namespace clang;
static const char *DescriptionMsg =
"Simplify a complex binary expression to simple ones. \
For example, x = a + (b + c) will be transformed to \
tmp = b + c; x = a + tmp \n";
static RegisterTransformation<BinOpSimplification>
Trans("binop-simplification", DescriptionMsg);
class BSCollectionVisitor : public RecursiveASTVisitor<BSCollectionVisitor> {
public:
explicit BSCollectionVisitor(BinOpSimplification *Instance)
: ConsumerInstance(Instance)
{ }
bool VisitFunctionDecl(FunctionDecl *FD);
private:
BinOpSimplification *ConsumerInstance;
};
class BSStatementVisitor : public CommonStatementVisitor<BSStatementVisitor> {
public:
explicit BSStatementVisitor(BinOpSimplification *Instance)
: ConsumerInstance(Instance)
{ }
bool VisitBinaryOperator(BinaryOperator *BinOp);
private:
void handleSubExpr(Expr *E);
BinOpSimplification *ConsumerInstance;
};
bool BSCollectionVisitor::VisitFunctionDecl(FunctionDecl *FD)
{
if (!FD->isThisDeclarationADefinition())
return true;
ConsumerInstance->StmtVisitor->setCurrentFunctionDecl(FD);
ConsumerInstance->StmtVisitor->TraverseDecl(FD);
ConsumerInstance->StmtVisitor->setCurrentFunctionDecl(NULL);
return true;
}
void BSStatementVisitor::handleSubExpr(Expr *E)
{
BinaryOperator *BinOp = dyn_cast<BinaryOperator>(E->IgnoreParenCasts());
if (!BinOp)
return;
TransAssert(std::find(ConsumerInstance->ValidBinOps.begin(),
ConsumerInstance->ValidBinOps.end(), BinOp)
== ConsumerInstance->ValidBinOps.end());
ConsumerInstance->ValidBinOps.push_back(BinOp);
ConsumerInstance->ValidInstanceNum++;
if (ConsumerInstance->ValidInstanceNum ==
ConsumerInstance->TransformationCounter) {
ConsumerInstance->TheFuncDecl = CurrentFuncDecl;
ConsumerInstance->TheStmt = CurrentStmt;
ConsumerInstance->TheBinOp = BinOp;
ConsumerInstance->NeedParen = NeedParen;
}
TraverseStmt(BinOp);
}
bool BSStatementVisitor::VisitBinaryOperator(BinaryOperator *BinOp)
{
if (BinOp->isAssignmentOp() && !BinOp->isCompoundAssignmentOp()) {
Expr *RHS = BinOp->getRHS();
return TraverseStmt(RHS);
}
Expr *LHS = BinOp->getLHS();
handleSubExpr(LHS);
Expr *RHS = BinOp->getRHS();
handleSubExpr(RHS);
return false;
}
void BinOpSimplification::Initialize(ASTContext &context)
{
Transformation::Initialize(context);
BinOpCollectionVisitor = new BSCollectionVisitor(this);
StmtVisitor = new BSStatementVisitor(this);
NameQueryWrap =
new TransNameQueryWrap(RewriteHelper->getTmpVarNamePrefix());
}
bool BinOpSimplification::HandleTopLevelDecl(DeclGroupRef D)
{
for (DeclGroupRef::iterator I = D.begin(), E = D.end(); I != E; ++I) {
BinOpCollectionVisitor->TraverseDecl(*I);
}
return true;
}
void BinOpSimplification::HandleTranslationUnit(ASTContext &Ctx)
{
if (QueryInstanceOnly)
return;
if (TransformationCounter > ValidInstanceNum) {
TransError = TransMaxInstanceError;
return;
}
Ctx.getDiagnostics().setSuppressAllDiagnostics(false);
TransAssert(TheFuncDecl && "NULL TheFuncDecl!");
TransAssert(TheStmt && "NULL TheStmt!");
TransAssert(TheBinOp && "NULL TheBinOp");
NameQueryWrap->TraverseDecl(Ctx.getTranslationUnitDecl());
addNewTmpVariable();
addNewAssignStmt();
replaceBinOp();
if (Ctx.getDiagnostics().hasErrorOccurred() ||
Ctx.getDiagnostics().hasFatalErrorOccurred())
TransError = TransInternalError;
}
bool BinOpSimplification::addNewTmpVariable(void)
{
QualType QT = TheBinOp->getType();
std::string VarStr;
std::stringstream SS;
unsigned int NamePostfix = NameQueryWrap->getMaxNamePostfix();
SS << RewriteHelper->getTmpVarNamePrefix() << (NamePostfix + 1);
VarStr = SS.str();
setTmpVarName(VarStr);
QT.getAsStringInternal(VarStr,
Context->getPrintingPolicy());
VarStr += ";";
return RewriteHelper->addLocalVarToFunc(VarStr, TheFuncDecl);
}
bool BinOpSimplification::addNewAssignStmt(void)
{
return RewriteHelper->addNewAssignStmtBefore(TheStmt,
getTmpVarName(),
TheBinOp,
NeedParen);
}
bool BinOpSimplification::replaceBinOp(void)
{
return RewriteHelper->replaceExpr(TheBinOp, TmpVarName);
}
BinOpSimplification::~BinOpSimplification(void)
{
delete BinOpCollectionVisitor;
delete StmtVisitor;
delete NameQueryWrap;
}