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
|
/*
* Copyright (C) 2015 Andrei Karas
*
* This file is part of AstDumper.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "analysis/statement.h"
#include "command.h"
#include "logger.h"
#include "analysis/analysis.h"
#include "analysis/walkitem.h"
#include "nodes/expr/eq_expr.h"
#include "nodes/expr/modify_expr.h"
#include "nodes/expr/ne_expr.h"
#include "nodes/expr/pointerplus_expr.h"
#include "nodes/ref/indirect_ref.h"
#include "nodes/stmt/if_stmt.h"
#include <set>
#include "localconsts.h"
namespace Analysis
{
void analyseIfStmt(IfStmtNode *node, const WalkItem &wi, WalkItem &wo)
{
// need condition node
if (!node->condition || command == FindArgs)
return;
Node *condNode = skipNop(node->condition);
WalkItem wci = wi;
WalkItem wco = wo;
walkTree(condNode, wci, wco);
Log::dumpWI(node, "wco ", wco);
WalkItem wi2 = wi;
FOR_EACH (std::set<std::string>::const_iterator,
it,
wco.checkedNonNullVars)
{
wi2.checkNullVars.erase(*it);
}
walkTree(node->thenNode, wi2, wo);
wo.removeNullVars.clear();
const bool returned = wo.isReturned;
wo.isReturned = false;
wi2 = wi;
FOR_EACH (std::set<std::string>::const_iterator,
it,
wco.checkedNullVars)
{
wi2.checkNullVars.erase(*it);
}
walkTree(node->elseNode, wi2, wo);
wo.removeNullVars.clear();
// if (returned && wco.cleanExpr && !wco.uselessExpr)
if (returned && !wco.uselessExpr)
{
// add variable for ignore for all parent nodes except special like IF_STMT
FOR_EACH (std::set<std::string>::const_iterator,
it,
wco.checkedNullVars)
{
wo.removeNullVars.insert(*it);
wo.checkNullVars.erase(*it);
}
}
// if (wo.isReturned && wco.cleanExpr && !wco.uselessExpr)
if (wo.isReturned && !wco.uselessExpr)
{
// add variable for ignore for all parent nodes except special like IF_STMT
FOR_EACH (std::set<std::string>::const_iterator,
it,
wco.checkedNonNullVars)
{
wo.removeNullVars.insert(*it);
wo.checkNullVars.erase(*it);
}
}
// special case where all branches is ended.
if (returned && wo.isReturned)
{
FOR_EACH (std::set<std::string>::const_iterator,
it,
wo.checkNullVars)
{
wo.removeNullVars.insert(*it);
}
}
wo.stopWalking = true;
wo.isReturned = false;
}
}
|
