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
|
/* Oort
* Copyright 2007, Soren Sandmann Pedersen
*
* 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 2 of the License, or
* (at your option) 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "ast.h"
static void
do_levels (ast_t *ast, int level)
{
GList *list;
if (ast_is (ast, AST_DEFINITION, AST_FUNCTION_DEFINITION))
{
ast_function_definition_t *function = &ast->definition.function;
function->level = level++;
}
else if (ast_is (ast, AST_DEFINITION, AST_CLASS_DEFINITION))
{
ast_class_definition_t *class = &ast->definition.class;
class->level = level++;
}
else if (ast_is (ast, AST_DEFINITION, AST_LABEL_DEFINITION))
{
ast_label_definition_t *label = &ast->definition.label;
label->level = level;
}
else if (ast_is (ast, AST_DEFINITION, AST_VARIABLE_DEFINITION))
{
ast_variable_definition_t *variable = &ast->definition.variable;
variable->level = level;
}
else if (ast->common.type == AST_EXPRESSION)
{
ast_expression_t *expr = &ast->expression;
expr->common.level = level;
}
for (list = ast->common.children->head; list; list = list->next)
do_levels (list->data, level);
}
gboolean
levels (ast_t *ast)
{
do_levels (ast, 0);
return TRUE;
}
|
