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
|
/*
* Copyright Tobias Waldekranz <tobias@waldekranz.com>
*
* SPDX-License-Identifier: GPL-2.0
*/
#ifndef _PLY_NODE_H
#define _PLY_NODE_H
#include <stdint.h>
#include <stdio.h>
/* symbol information is defined externally */
struct sym;
enum ntype {
N_EXPR,
N_NUM,
N_STRING,
};
/* source location info, this is identical to bison's default YYLTYPE.
* defining it here means we can keep parser dependencies out of the
* rest of the code base. */
struct nloc {
int first_line;
int first_column;
int last_line;
int last_column;
};
struct node {
struct node *next, *prev, *up;
struct sym *sym;
enum ntype ntype;
union {
struct {
char *func;
struct node *args;
unsigned ident:1;
} expr;
struct {
union {
int64_t s64;
uint64_t u64;
};
unsigned unsignd:1;
unsigned size:4;
} num;
struct {
char *data;
unsigned virtual:1;
} string;
};
struct nloc loc;
};
/* debug */
void node_print(struct node *n, FILE *fp);
typedef int (*nwalk_fn)(struct node *, void *);
int node_walk(struct node *n, nwalk_fn pre, nwalk_fn post, void *ctx);
int node_replace(struct node *n, struct node *new);
/* constructors */
struct node *node_string (const struct nloc *loc, char *data);
struct node *__node_num (const struct nloc *loc, size_t size,
int64_t *s64, uint64_t *u64);
struct node *node_num (const struct nloc *loc, const char *numstr);
void node_insert (struct node *prev, struct node *n);
struct node *node_append (struct node *head, struct node *tail);
struct node *node_expr_append(const struct nloc *loc, struct node *n, struct node *arg);
struct node *node_expr (const struct nloc *loc, char *func, ...);
struct node *node_expr_ident (const struct nloc *loc, char *func);
/* helpers */
static inline int node_nargs(struct node *n)
{
struct node *arg;
int nargs = 0;
for (arg = n->expr.args; arg; arg = arg->next, nargs++);
return nargs;
}
int node_is(struct node *n, const char *func);
#define node_expr_foreach(_expr, _arg) \
for ((_arg) = (_expr)->expr.args; (_arg); (_arg) = (_arg)->next)
#endif /* _PLY_NODE_H */
|
