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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
%{
/*-
* Copyright (c) 2011 James Gritton
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <err.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include "jailp.h"
#include "y.tab.h"
extern int yynerrs;
static ssize_t text2lval(size_t triml, size_t trimr, int tovar);
static int instr;
static int lineno = 1;
#define YY_DECL int yylex(void)
%}
%option noinput
%option nounput
%start _ DQ
%%
/* Whitespace or equivalent */
<_>[ \t]+ instr = 0;
<_>#.* ;
<_>\/\/.* ;
<_>\/\*([^*]|(\*+([^*\/])))*\*+\/ {
const char *s;
for (s = yytext; s < yytext + yyleng; s++)
if (*s == '\n')
lineno++;
instr = 0;
}
<_>\n {
lineno++;
instr = 0;
}
/* Reserved tokens */
<_>\+= {
instr = 0;
return PLEQ;
}
<_>[,;={}] {
instr = 0;
return yytext[0];
}
/* Atomic (unquoted) strings */
<_,DQ>[A-Za-z0-9_!%&()\-.:<>?@\[\]^`|~]+ |
<_,DQ>\\(.|\n|[0-7]{1,3}|x[0-9A-Fa-f]{1,2}) |
<_,DQ>[$*+/\\] {
(void)text2lval(0, 0, 0);
return instr ? STR1 : (instr = 1, STR);
}
/* Single and double quoted strings */
<_>'([^\'\\]|\\(.|\n))*' {
(void)text2lval(1, 1, 0);
return instr ? STR1 : (instr = 1, STR);
}
<_>\"([^"\\]|\\(.|\n))*\" |
<DQ>[^\"$\\]([^"\\]|\\(.|\n))*\" {
size_t skip;
ssize_t atvar;
skip = yytext[0] == '"' ? 1 : 0;
atvar = text2lval(skip, 1, 1);
if (atvar < 0)
BEGIN _;
else {
/*
* The string has a variable inside it.
* Go into DQ mode to get the variable
* and then the rest of the string.
*/
BEGIN DQ;
yyless(atvar);
}
return instr ? STR1 : (instr = 1, STR);
}
<DQ>\" BEGIN _;
/* Variables, single-word or bracketed */
<_,DQ>$[A-Za-z_][A-Za-z_0-9]* {
(void)text2lval(1, 0, 0);
return instr ? VAR1 : (instr = 1, VAR);
}
<_>$\{([^\n{}]|\\(.|\n))*\} |
<DQ>$\{([^\n\"{}]|\\(.|\n))*\} {
(void)text2lval(2, 1, 0);
return instr ? VAR1 : (instr = 1, VAR);
}
/* Partially formed bits worth complaining about */
<_>\/\*([^*]|(\*+([^*\/])))*\** {
warnx("%s line %d: unterminated comment",
cfname, lineno);
yynerrs++;
}
<_>'([^\n'\\]|\\.)* |
<_>\"([^\n\"\\]|\\.)* {
warnx("%s line %d: unterminated string",
cfname, lineno);
yynerrs++;
}
<_>$\{([^\n{}]|\\.)* |
<DQ>$\{([^\n\"{}]|\\.)* {
warnx("%s line %d: unterminated variable",
cfname, lineno);
yynerrs++;
}
/* A hack because "<0>" rules aren't allowed */
<_>. return yytext[0];
.|\n {
BEGIN _;
yyless(0);
}
%%
void
yyerror(const char *s)
{
if (!yytext)
warnx("%s line %d: %s", cfname, lineno, s);
else if (!yytext[0])
warnx("%s: unexpected EOF", cfname);
else
warnx("%s line %d: %s: %s", cfname, lineno, yytext, s);
}
/*
* Copy string from yytext to yylval, handling backslash escapes,
* and optionally stopping at the beginning of a variable.
*/
static ssize_t
text2lval(size_t triml, size_t trimr, int tovar)
{
char *d;
const char *s, *se;
yylval.cs = d = emalloc(yyleng - trimr - triml + 1);
se = yytext + (yyleng - trimr);
for (s = yytext + triml; s < se; s++, d++) {
if (*s != '\\') {
if (tovar && *s == '$') {
*d = '\0';
return s - yytext;
}
if (*s == '\n')
lineno++;
*d = *s;
continue;
}
s++;
if (*s >= '0' && *s <= '7') {
*d = *s - '0';
if (s + 1 < se && s[1] >= '0' && s[1] <= '7') {
*d = 010 * *d + (*++s - '0');
if (s + 1 < se && s[1] >= '0' && s[1] <= '7')
*d = 010 * *d + (*++s - '0');
}
continue;
}
switch (*s) {
case 'a': *d = '\a'; break;
case 'b': *d = '\b'; break;
case 'f': *d = '\f'; break;
case 'n': *d = '\n'; break;
case 'r': *d = '\r'; break;
case 't': *d = '\t'; break;
case 'v': *d = '\v'; break;
case '\n': d--; lineno++; break;
default: *d = *s; break;
case 'x':
*d = 0;
if (s + 1 >= se)
break;
if (s[1] >= '0' && s[1] <= '9')
*d = *++s - '0';
else if (s[1] >= 'A' && s[1] <= 'F')
*d = *++s + (0xA - 'A');
else if (s[1] >= 'a' && s[1] <= 'a')
*d = *++s + (0xa - 'a');
else
break;
if (s + 1 >= se)
break;
if (s[1] >= '0' && s[1] <= '9')
*d = *d * 0x10 + (*++s - '0');
else if (s[1] >= 'A' && s[1] <= 'F')
*d = *d * 0x10 + (*++s + (0xA - 'A'));
else if (s[1] >= 'a' && s[1] <= 'a')
*d = *d * 0x10 + (*++s + (0xa - 'a'));
}
}
*d = '\0';
return -1;
}
|
