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
|
/*
* 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/>.
*/
#ifndef NODES_BASE_NODE_H
#define NODES_BASE_NODE_H
#include "includes.h"
#include <string>
extern int allocations;
struct Node
{
Node() :
parent(nullptr),
nodeTypeName(),
label(),
file(),
tag(),
childs(),
gccNode(nullptr),
nodeType(ERROR_MARK),
location(0),
line(-1),
column(-1),
treeNumber(0),
indent(0),
parseChilds(true),
noLabel(false),
complete(false)
{
allocations ++;
}
~Node()
{
allocations --;
}
std::string getIndent() const
{
std::string str;
for (int f = 0; f < indent; f ++)
str.append(" ");
return str;
}
Node *parent;
std::string nodeTypeName;
std::string label;
std::string file;
std::string tag;
std::vector<Node*> childs;
tree gccNode;
tree_code nodeType;
location_t location;
int line;
int column;
int treeNumber;
int indent;
bool parseChilds;
bool noLabel;
bool complete;
};
#endif // NODES_BASE_NODE_H
|
