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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
/*
* Copyright (C) 2015 Andrei Karas
*
* This file is part of Paranoid null checker.
*
* 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 "parsers/generic.h"
#include "command.h"
#include "nodesmap.h"
#include "includes/nodeincludes.h"
#include "includes/parserincludes.h"
#include "includes/parserdefines.inc"
#include "localconsts.h"
int allocations = 0;
namespace Generic
{
Node *createParseNode(Node *parent,
tree gccNode,
const std::string& tag,
int parseChilds)
{
return createParseNode(parent,
gccNode,
ERROR_MARK,
tag,
parseChilds);
}
Node *createParseNode(Node *parent,
tree gccNode,
tree_code wantType,
std::string tag,
int parseChilds)
{
if (gccNode == NULL_TREE)
{
return nullptr;
}
if (allocations > 5000000)
{
fatal_error(0, "Plugin error. Infinite loop detected 1");
return nullptr;
}
if (parent && parent->indent > 30000)
{
fatal_error(0, "Plugin error. Infinite loop detected 2");
return nullptr;
}
Node *node = nullptr;
switch (TREE_CODE(gccNode))
{
#define handleNodeType(code, type) \
case code: \
node = new type##Node; \
break;
#include "includes/nodeshandling.inc"
default:
if (checkCommand(DumpUnsupported))
{
Log::error("Unsupported node type: %s",
get_tree_code_name(TREE_CODE(gccNode)));
}
else
{
Log::dump(parent,
1,
"Unsupported node type: %s - %s",
get_tree_code_name(TREE_CODE(gccNode)),
tag.c_str());
}
break;
}
if (node)
{
node->parent = parent;
node->gccNode = gccNode;
if (!parent || parseChilds < parent->parseChilds - 1)
node->parseChilds = parseChilds;
else
node->parseChilds = parent->parseChilds - 1;
if (node->parseChilds < 0)
node->parseChilds = 0;
if (wantType != ERROR_MARK &&
TREE_CODE(node->gccNode) != wantType)
{
if (tag.empty())
{
Log::dump(node,
"Wrong node type. Want %s but get %s",
get_tree_code_name(wantType),
get_tree_code_name(TREE_CODE(node->gccNode)));
}
else
{
Log::dump(node,
"Wrong node type. Want %s but get %s - %s",
get_tree_code_name(wantType),
get_tree_code_name(TREE_CODE(node->gccNode)),
tag.c_str());
}
delete node;
return nullptr;
}
if (parent)
{
node->indent = parent->indent + 1;
if (tag.empty())
node->tag = parent->tag;
else
node->tag = tag;
parent->childs.push_back(node);
}
else
{
node->tag = tag;
}
switch (TREE_CODE(node->gccNode))
{
#undef handleNodeType
#define handleNodeType(code, type) \
case code: \
parse##type##Node(static_cast<type##Node*>(node)); \
break;
#include "includes/nodeshandling.inc"
default:
break;
}
}
return node;
}
Node *parseNodes(tree gccNode)
{
return createParseNode(nullptr, gccNode, FUNCTION_DECL);
}
void parseVarDeclNode(VarDeclNode *node1, VarDeclNode *node2);
void updateNodes()
{
FOR_EACH(it, updateNodesMap)
{
Node *node1 = it.first;
Node *node2 = it.second;
if (node1 == VAR_DECL)
{
parseVarDeclNode(static_cast<VarDeclNode*>(node1),
static_cast<VarDeclNode*>(node2));
}
}
}
void cleanAllNodes(Node *node)
{
foundNodesMap.clear();
updateNodesMap.clear();
if (checkCommand(MemoryUsage))
Log::error("Allocations before cleanup: %d", allocations);
cleanNodes(node);
if (checkCommand(MemoryUsage))
Log::error("Allocations after cleanup: %d", allocations);
}
void cleanNodes(Node *node)
{
FOR_EACH (it, node->childs)
{
cleanNodes(it);
}
delete node;
}
void fillType(Node *node)
{
if (!node || node->gccNode == NULL_TREE)
{
return;
}
node->treeNumber = static_cast<int>(TREE_CODE(node->gccNode));
node->nodeType = TREE_CODE(node->gccNode);
node->nodeTypeName = get_tree_code_name(TREE_CODE(node->gccNode));
// Log::dump(node);
}
void fillLocation(Node *node)
{
if (!node || node->gccNode == NULL_TREE)
{
return;
}
location_t loc = DECL_SOURCE_LOCATION(node->gccNode);
if (loc)
{
node->location = loc;
node->file = LOCATION_FILE(loc);
node->line = LOCATION_LINE(loc);
node->column = LOCATION_COLUMN(loc);
}
}
}
|
