-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathffi2code.h
141 lines (118 loc) · 3.33 KB
/
ffi2code.h
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
/*
Authored 2013-2016. Phillip Stanley-Marbell
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above
copyright notice, this list of conditions and the following
disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials
provided with the distribution.
* Neither the name of the author nor the names of its
contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
typedef enum
{
P_LANGUAGE = 0,
P_FFSTMT = 1,
P_FIRSTSETSTMT = 2,
P_FOLLOWSETSTMT = 3,
P_FIRSTSETOP = 4,
P_FIRSTSET = 5,
P_FOLLOWSETOP = 6,
P_FOLLOWSET = 7,
T_IDENTIFIER = 8,
T_TOKEN = 9,
T_PRODUCTION = 10,
T_FIRSTSET = 11,
T_FOLLOWSET = 12,
ASTnode_TREERESIDENT = 13,
/* */
/* The following tokens are seen in parsing, but */
/* don't go into the AST. */
/* */
T_COLON = 14,
T_EQUALS = 15,
T_COMMA = 16,
T_LBRACE = 17,
T_RBRACE = 18,
T_LPAREN = 19,
T_RPAREN = 20,
T_NEWLINE = 21,
T_EPSILON = 22,
/* */
/* Used for chaining items in the AST */
/* */
X_SEQ = 23,
/* */
/* Code depends on this bringing up the rear */
/* */
ASTnode_MAX = 24,
} ASTnodeType;
typedef struct
{
/* */
/* Used to get error status from FlexLib routines */
/* */
FlexErrState *Fe;
/* */
/* Parsed input stream */
/* */
FlexIstream *Fi;
/* */
/* State for the portable/monitoring allocator (FlexM) */
/* */
FlexMstate *Fm;
/* */
/* State for portable/buffering print routines (FlexP) */
/* We have one buffer for informational messages, and */
/* another for errors and warnings. */
/* */
FlexPrintBuf *Fperr;
FlexPrintBuf *Fpinfo;
uint64_t mode;
uint64_t verbose;
} FFIstate;
typedef struct ASTnode ASTnode;
struct ASTnode
{
ASTnodeType type;
char *tokenstring;
ASTnode *l;
ASTnode *r;
int color;
};
typedef enum
{
kFFI_MAXBUFLEN = 1024,
kFFI_MAXERRORTOKS = 32,
kFFI_STREAMCHKWIDTH = 32,
kFFI_MODEVERBOSE = (1 << 0),
kFFI_MAXPRINTBUF = 8192,
kFFI_CHUNK_PREDPRINTBUF_MULTIPLIER = 8192,
kFFI_VERBOSE_CALLTRACE = (1 << 0),
kFFI_VERBOSE_ACTIONTRACE = (1 << 1),
kFFI_MAX_TOKEN_CHARS = 32
} FFIconstants;
typedef struct
{
ASTnodeType type;
char *string;
} Pair;