blob: 9889a412933517cfee0bb2ced96d71fa4c30fa3a (
plain) (
blame)
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
|
/*
* 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 "parsers/base/expr.h"
#include "includes.h"
#include "nodes/base/expr.h"
#include "parsers/generic.h"
#include "localconsts.h"
namespace Generic
{
void fillExprLocation(Node *node)
{
if (!node || node->gccNode == NULL_TREE)
{
return;
}
if (EXPR_HAS_LOCATION(node->gccNode))
{
location_t loc = EXPR_LOCATION(node->gccNode);
node->location = loc;
node->file = LOCATION_FILE(loc);
node->line = LOCATION_LINE(loc);
node->column = LOCATION_COLUMN(loc);
}
}
void fillExprOperands(ExprNode *node)
{
if (!node || node->gccNode == NULL_TREE)
{
return;
}
const int sz = TREE_OPERAND_LENGTH(node->gccNode);
for (int f = 0;f < sz; f ++)
{
node->args.push_back(createParseNode(
node,
TREE_OPERAND (node->gccNode, f),
"operand"));
}
}
Node *getExprOperand(ExprNode *node,
const int pos,
const std::string &tag)
{
if (!node || node->gccNode == NULL_TREE)
return nullptr;
const int sz = TREE_OPERAND_LENGTH(node->gccNode);
if (sz >= pos)
return nullptr;
return createParseNode(
node,
TREE_OPERAND (node->gccNode, pos),
tag);
}
}
|
