Loading...
1/*
2 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
3 *
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation; either version 2 of the
8 * License, or (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
18 * USA
19 */
20%{
21#include <stdio.h>
22
23#include "dtc.h"
24#include "srcpos.h"
25
26extern int yylex(void);
27extern void yyerror(char const *s);
28#define ERROR(loc, ...) \
29 do { \
30 srcpos_error((loc), "Error", __VA_ARGS__); \
31 treesource_error = true; \
32 } while (0)
33
34extern struct boot_info *the_boot_info;
35extern bool treesource_error;
36%}
37
38%union {
39 char *propnodename;
40 char *labelref;
41 uint8_t byte;
42 struct data data;
43
44 struct {
45 struct data data;
46 int bits;
47 } array;
48
49 struct property *prop;
50 struct property *proplist;
51 struct node *node;
52 struct node *nodelist;
53 struct reserve_info *re;
54 uint64_t integer;
55}
56
57%token DT_V1
58%token DT_MEMRESERVE
59%token DT_LSHIFT DT_RSHIFT DT_LE DT_GE DT_EQ DT_NE DT_AND DT_OR
60%token DT_BITS
61%token DT_DEL_PROP
62%token DT_DEL_NODE
63%token <propnodename> DT_PROPNODENAME
64%token <integer> DT_LITERAL
65%token <integer> DT_CHAR_LITERAL
66%token <byte> DT_BYTE
67%token <data> DT_STRING
68%token <labelref> DT_LABEL
69%token <labelref> DT_REF
70%token DT_INCBIN
71
72%type <data> propdata
73%type <data> propdataprefix
74%type <re> memreserve
75%type <re> memreserves
76%type <array> arrayprefix
77%type <data> bytestring
78%type <prop> propdef
79%type <proplist> proplist
80
81%type <node> devicetree
82%type <node> nodedef
83%type <node> subnode
84%type <nodelist> subnodes
85
86%type <integer> integer_prim
87%type <integer> integer_unary
88%type <integer> integer_mul
89%type <integer> integer_add
90%type <integer> integer_shift
91%type <integer> integer_rela
92%type <integer> integer_eq
93%type <integer> integer_bitand
94%type <integer> integer_bitxor
95%type <integer> integer_bitor
96%type <integer> integer_and
97%type <integer> integer_or
98%type <integer> integer_trinary
99%type <integer> integer_expr
100
101%%
102
103sourcefile:
104 DT_V1 ';' memreserves devicetree
105 {
106 the_boot_info = build_boot_info($3, $4,
107 guess_boot_cpuid($4));
108 }
109 ;
110
111memreserves:
112 /* empty */
113 {
114 $$ = NULL;
115 }
116 | memreserve memreserves
117 {
118 $$ = chain_reserve_entry($1, $2);
119 }
120 ;
121
122memreserve:
123 DT_MEMRESERVE integer_prim integer_prim ';'
124 {
125 $$ = build_reserve_entry($2, $3);
126 }
127 | DT_LABEL memreserve
128 {
129 add_label(&$2->labels, $1);
130 $$ = $2;
131 }
132 ;
133
134devicetree:
135 '/' nodedef
136 {
137 $$ = name_node($2, "");
138 }
139 | devicetree '/' nodedef
140 {
141 $$ = merge_nodes($1, $3);
142 }
143
144 | devicetree DT_LABEL DT_REF nodedef
145 {
146 struct node *target = get_node_by_ref($1, $3);
147
148 add_label(&target->labels, $2);
149 if (target)
150 merge_nodes(target, $4);
151 else
152 ERROR(&@3, "Label or path %s not found", $3);
153 $$ = $1;
154 }
155 | devicetree DT_REF nodedef
156 {
157 struct node *target = get_node_by_ref($1, $2);
158
159 if (target)
160 merge_nodes(target, $3);
161 else
162 ERROR(&@2, "Label or path %s not found", $2);
163 $$ = $1;
164 }
165 | devicetree DT_DEL_NODE DT_REF ';'
166 {
167 struct node *target = get_node_by_ref($1, $3);
168
169 if (target)
170 delete_node(target);
171 else
172 ERROR(&@3, "Label or path %s not found", $3);
173
174
175 $$ = $1;
176 }
177 ;
178
179nodedef:
180 '{' proplist subnodes '}' ';'
181 {
182 $$ = build_node($2, $3);
183 }
184 ;
185
186proplist:
187 /* empty */
188 {
189 $$ = NULL;
190 }
191 | proplist propdef
192 {
193 $$ = chain_property($2, $1);
194 }
195 ;
196
197propdef:
198 DT_PROPNODENAME '=' propdata ';'
199 {
200 $$ = build_property($1, $3);
201 }
202 | DT_PROPNODENAME ';'
203 {
204 $$ = build_property($1, empty_data);
205 }
206 | DT_DEL_PROP DT_PROPNODENAME ';'
207 {
208 $$ = build_property_delete($2);
209 }
210 | DT_LABEL propdef
211 {
212 add_label(&$2->labels, $1);
213 $$ = $2;
214 }
215 ;
216
217propdata:
218 propdataprefix DT_STRING
219 {
220 $$ = data_merge($1, $2);
221 }
222 | propdataprefix arrayprefix '>'
223 {
224 $$ = data_merge($1, $2.data);
225 }
226 | propdataprefix '[' bytestring ']'
227 {
228 $$ = data_merge($1, $3);
229 }
230 | propdataprefix DT_REF
231 {
232 $$ = data_add_marker($1, REF_PATH, $2);
233 }
234 | propdataprefix DT_INCBIN '(' DT_STRING ',' integer_prim ',' integer_prim ')'
235 {
236 FILE *f = srcfile_relative_open($4.val, NULL);
237 struct data d;
238
239 if ($6 != 0)
240 if (fseek(f, $6, SEEK_SET) != 0)
241 die("Couldn't seek to offset %llu in \"%s\": %s",
242 (unsigned long long)$6, $4.val,
243 strerror(errno));
244
245 d = data_copy_file(f, $8);
246
247 $$ = data_merge($1, d);
248 fclose(f);
249 }
250 | propdataprefix DT_INCBIN '(' DT_STRING ')'
251 {
252 FILE *f = srcfile_relative_open($4.val, NULL);
253 struct data d = empty_data;
254
255 d = data_copy_file(f, -1);
256
257 $$ = data_merge($1, d);
258 fclose(f);
259 }
260 | propdata DT_LABEL
261 {
262 $$ = data_add_marker($1, LABEL, $2);
263 }
264 ;
265
266propdataprefix:
267 /* empty */
268 {
269 $$ = empty_data;
270 }
271 | propdata ','
272 {
273 $$ = $1;
274 }
275 | propdataprefix DT_LABEL
276 {
277 $$ = data_add_marker($1, LABEL, $2);
278 }
279 ;
280
281arrayprefix:
282 DT_BITS DT_LITERAL '<'
283 {
284 unsigned long long bits;
285
286 bits = $2;
287
288 if ((bits != 8) && (bits != 16) &&
289 (bits != 32) && (bits != 64)) {
290 ERROR(&@2, "Array elements must be"
291 " 8, 16, 32 or 64-bits");
292 bits = 32;
293 }
294
295 $$.data = empty_data;
296 $$.bits = bits;
297 }
298 | '<'
299 {
300 $$.data = empty_data;
301 $$.bits = 32;
302 }
303 | arrayprefix integer_prim
304 {
305 if ($1.bits < 64) {
306 uint64_t mask = (1ULL << $1.bits) - 1;
307 /*
308 * Bits above mask must either be all zero
309 * (positive within range of mask) or all one
310 * (negative and sign-extended). The second
311 * condition is true if when we set all bits
312 * within the mask to one (i.e. | in the
313 * mask), all bits are one.
314 */
315 if (($2 > mask) && (($2 | mask) != -1ULL))
316 ERROR(&@2, "Value out of range for"
317 " %d-bit array element", $1.bits);
318 }
319
320 $$.data = data_append_integer($1.data, $2, $1.bits);
321 }
322 | arrayprefix DT_REF
323 {
324 uint64_t val = ~0ULL >> (64 - $1.bits);
325
326 if ($1.bits == 32)
327 $1.data = data_add_marker($1.data,
328 REF_PHANDLE,
329 $2);
330 else
331 ERROR(&@2, "References are only allowed in "
332 "arrays with 32-bit elements.");
333
334 $$.data = data_append_integer($1.data, val, $1.bits);
335 }
336 | arrayprefix DT_LABEL
337 {
338 $$.data = data_add_marker($1.data, LABEL, $2);
339 }
340 ;
341
342integer_prim:
343 DT_LITERAL
344 | DT_CHAR_LITERAL
345 | '(' integer_expr ')'
346 {
347 $$ = $2;
348 }
349 ;
350
351integer_expr:
352 integer_trinary
353 ;
354
355integer_trinary:
356 integer_or
357 | integer_or '?' integer_expr ':' integer_trinary { $$ = $1 ? $3 : $5; }
358 ;
359
360integer_or:
361 integer_and
362 | integer_or DT_OR integer_and { $$ = $1 || $3; }
363 ;
364
365integer_and:
366 integer_bitor
367 | integer_and DT_AND integer_bitor { $$ = $1 && $3; }
368 ;
369
370integer_bitor:
371 integer_bitxor
372 | integer_bitor '|' integer_bitxor { $$ = $1 | $3; }
373 ;
374
375integer_bitxor:
376 integer_bitand
377 | integer_bitxor '^' integer_bitand { $$ = $1 ^ $3; }
378 ;
379
380integer_bitand:
381 integer_eq
382 | integer_bitand '&' integer_eq { $$ = $1 & $3; }
383 ;
384
385integer_eq:
386 integer_rela
387 | integer_eq DT_EQ integer_rela { $$ = $1 == $3; }
388 | integer_eq DT_NE integer_rela { $$ = $1 != $3; }
389 ;
390
391integer_rela:
392 integer_shift
393 | integer_rela '<' integer_shift { $$ = $1 < $3; }
394 | integer_rela '>' integer_shift { $$ = $1 > $3; }
395 | integer_rela DT_LE integer_shift { $$ = $1 <= $3; }
396 | integer_rela DT_GE integer_shift { $$ = $1 >= $3; }
397 ;
398
399integer_shift:
400 integer_shift DT_LSHIFT integer_add { $$ = $1 << $3; }
401 | integer_shift DT_RSHIFT integer_add { $$ = $1 >> $3; }
402 | integer_add
403 ;
404
405integer_add:
406 integer_add '+' integer_mul { $$ = $1 + $3; }
407 | integer_add '-' integer_mul { $$ = $1 - $3; }
408 | integer_mul
409 ;
410
411integer_mul:
412 integer_mul '*' integer_unary { $$ = $1 * $3; }
413 | integer_mul '/' integer_unary
414 {
415 if ($3 != 0) {
416 $$ = $1 / $3;
417 } else {
418 ERROR(&@$, "Division by zero");
419 $$ = 0;
420 }
421 }
422 | integer_mul '%' integer_unary
423 {
424 if ($3 != 0) {
425 $$ = $1 % $3;
426 } else {
427 ERROR(&@$, "Division by zero");
428 $$ = 0;
429 }
430 }
431 | integer_unary
432 ;
433
434integer_unary:
435 integer_prim
436 | '-' integer_unary { $$ = -$2; }
437 | '~' integer_unary { $$ = ~$2; }
438 | '!' integer_unary { $$ = !$2; }
439 ;
440
441bytestring:
442 /* empty */
443 {
444 $$ = empty_data;
445 }
446 | bytestring DT_BYTE
447 {
448 $$ = data_append_byte($1, $2);
449 }
450 | bytestring DT_LABEL
451 {
452 $$ = data_add_marker($1, LABEL, $2);
453 }
454 ;
455
456subnodes:
457 /* empty */
458 {
459 $$ = NULL;
460 }
461 | subnode subnodes
462 {
463 $$ = chain_node($1, $2);
464 }
465 | subnode propdef
466 {
467 ERROR(&@2, "Properties must precede subnodes");
468 YYERROR;
469 }
470 ;
471
472subnode:
473 DT_PROPNODENAME nodedef
474 {
475 $$ = name_node($2, $1);
476 }
477 | DT_DEL_NODE DT_PROPNODENAME ';'
478 {
479 $$ = name_node(build_node_delete(), $2);
480 }
481 | DT_LABEL subnode
482 {
483 add_label(&$2->labels, $1);
484 $$ = $2;
485 }
486 ;
487
488%%
489
490void yyerror(char const *s)
491{
492 ERROR(&yylloc, "%s", s);
493}
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
4 */
5%locations
6
7%{
8#include <stdio.h>
9#include <inttypes.h>
10
11#include "dtc.h"
12#include "srcpos.h"
13
14extern int yylex(void);
15extern void yyerror(char const *s);
16#define ERROR(loc, ...) \
17 do { \
18 srcpos_error((loc), "Error", __VA_ARGS__); \
19 treesource_error = true; \
20 } while (0)
21
22#define YYERROR_CALL(msg) yyerror(msg)
23
24extern struct dt_info *parser_output;
25extern bool treesource_error;
26%}
27
28%union {
29 char *propnodename;
30 char *labelref;
31 uint8_t byte;
32 struct data data;
33
34 struct {
35 struct data data;
36 int bits;
37 } array;
38
39 struct property *prop;
40 struct property *proplist;
41 struct node *node;
42 struct node *nodelist;
43 struct reserve_info *re;
44 uint64_t integer;
45 unsigned int flags;
46}
47
48%token DT_V1
49%token DT_PLUGIN
50%token DT_MEMRESERVE
51%token DT_LSHIFT DT_RSHIFT DT_LE DT_GE DT_EQ DT_NE DT_AND DT_OR
52%token DT_BITS
53%token DT_DEL_PROP
54%token DT_DEL_NODE
55%token DT_OMIT_NO_REF
56%token <propnodename> DT_PROPNODENAME
57%token <integer> DT_LITERAL
58%token <integer> DT_CHAR_LITERAL
59%token <byte> DT_BYTE
60%token <data> DT_STRING
61%token <labelref> DT_LABEL
62%token <labelref> DT_LABEL_REF
63%token <labelref> DT_PATH_REF
64%token DT_INCBIN
65
66%type <data> propdata
67%type <data> propdataprefix
68%type <flags> header
69%type <flags> headers
70%type <re> memreserve
71%type <re> memreserves
72%type <array> arrayprefix
73%type <data> bytestring
74%type <prop> propdef
75%type <proplist> proplist
76%type <labelref> dt_ref
77
78%type <node> devicetree
79%type <node> nodedef
80%type <node> subnode
81%type <nodelist> subnodes
82
83%type <integer> integer_prim
84%type <integer> integer_unary
85%type <integer> integer_mul
86%type <integer> integer_add
87%type <integer> integer_shift
88%type <integer> integer_rela
89%type <integer> integer_eq
90%type <integer> integer_bitand
91%type <integer> integer_bitxor
92%type <integer> integer_bitor
93%type <integer> integer_and
94%type <integer> integer_or
95%type <integer> integer_trinary
96%type <integer> integer_expr
97
98%%
99
100sourcefile:
101 headers memreserves devicetree
102 {
103 parser_output = build_dt_info($1, $2, $3,
104 guess_boot_cpuid($3));
105 }
106 ;
107
108header:
109 DT_V1 ';'
110 {
111 $$ = DTSF_V1;
112 }
113 | DT_V1 ';' DT_PLUGIN ';'
114 {
115 $$ = DTSF_V1 | DTSF_PLUGIN;
116 }
117 ;
118
119headers:
120 header
121 | header headers
122 {
123 if ($2 != $1)
124 ERROR(&@2, "Header flags don't match earlier ones");
125 $$ = $1;
126 }
127 ;
128
129memreserves:
130 /* empty */
131 {
132 $$ = NULL;
133 }
134 | memreserve memreserves
135 {
136 $$ = chain_reserve_entry($1, $2);
137 }
138 ;
139
140memreserve:
141 DT_MEMRESERVE integer_prim integer_prim ';'
142 {
143 $$ = build_reserve_entry($2, $3);
144 }
145 | DT_LABEL memreserve
146 {
147 add_label(&$2->labels, $1);
148 $$ = $2;
149 }
150 ;
151
152dt_ref: DT_LABEL_REF | DT_PATH_REF;
153
154devicetree:
155 '/' nodedef
156 {
157 $$ = name_node($2, "");
158 }
159 | devicetree '/' nodedef
160 {
161 $$ = merge_nodes($1, $3);
162 }
163 | dt_ref nodedef
164 {
165 /*
166 * We rely on the rule being always:
167 * versioninfo plugindecl memreserves devicetree
168 * so $-1 is what we want (plugindecl)
169 */
170 if (!($<flags>-1 & DTSF_PLUGIN))
171 ERROR(&@2, "Label or path %s not found", $1);
172 $$ = add_orphan_node(
173 name_node(build_node(NULL, NULL, NULL),
174 ""),
175 $2, $1);
176 }
177 | devicetree DT_LABEL dt_ref nodedef
178 {
179 struct node *target = get_node_by_ref($1, $3);
180
181 if (target) {
182 add_label(&target->labels, $2);
183 merge_nodes(target, $4);
184 } else
185 ERROR(&@3, "Label or path %s not found", $3);
186 $$ = $1;
187 }
188 | devicetree DT_PATH_REF nodedef
189 {
190 /*
191 * We rely on the rule being always:
192 * versioninfo plugindecl memreserves devicetree
193 * so $-1 is what we want (plugindecl)
194 */
195 if ($<flags>-1 & DTSF_PLUGIN) {
196 add_orphan_node($1, $3, $2);
197 } else {
198 struct node *target = get_node_by_ref($1, $2);
199
200 if (target)
201 merge_nodes(target, $3);
202 else
203 ERROR(&@2, "Label or path %s not found", $2);
204 }
205 $$ = $1;
206 }
207 | devicetree DT_LABEL_REF nodedef
208 {
209 struct node *target = get_node_by_ref($1, $2);
210
211 if (target) {
212 merge_nodes(target, $3);
213 } else {
214 /*
215 * We rely on the rule being always:
216 * versioninfo plugindecl memreserves devicetree
217 * so $-1 is what we want (plugindecl)
218 */
219 if ($<flags>-1 & DTSF_PLUGIN)
220 add_orphan_node($1, $3, $2);
221 else
222 ERROR(&@2, "Label or path %s not found", $2);
223 }
224 $$ = $1;
225 }
226 | devicetree DT_DEL_NODE dt_ref ';'
227 {
228 struct node *target = get_node_by_ref($1, $3);
229
230 if (target)
231 delete_node(target);
232 else
233 ERROR(&@3, "Label or path %s not found", $3);
234
235
236 $$ = $1;
237 }
238 | devicetree DT_OMIT_NO_REF dt_ref ';'
239 {
240 struct node *target = get_node_by_ref($1, $3);
241
242 if (target)
243 omit_node_if_unused(target);
244 else
245 ERROR(&@3, "Label or path %s not found", $3);
246
247
248 $$ = $1;
249 }
250 ;
251
252nodedef:
253 '{' proplist subnodes '}' ';'
254 {
255 $$ = build_node($2, $3, &@$);
256 }
257 ;
258
259proplist:
260 /* empty */
261 {
262 $$ = NULL;
263 }
264 | proplist propdef
265 {
266 $$ = chain_property($2, $1);
267 }
268 ;
269
270propdef:
271 DT_PROPNODENAME '=' propdata ';'
272 {
273 $$ = build_property($1, $3, &@$);
274 }
275 | DT_PROPNODENAME ';'
276 {
277 $$ = build_property($1, empty_data, &@$);
278 }
279 | DT_DEL_PROP DT_PROPNODENAME ';'
280 {
281 $$ = build_property_delete($2);
282 }
283 | DT_LABEL propdef
284 {
285 add_label(&$2->labels, $1);
286 $$ = $2;
287 }
288 ;
289
290propdata:
291 propdataprefix DT_STRING
292 {
293 $$ = data_merge($1, $2);
294 }
295 | propdataprefix arrayprefix '>'
296 {
297 $$ = data_merge($1, $2.data);
298 }
299 | propdataprefix '[' bytestring ']'
300 {
301 $$ = data_merge($1, $3);
302 }
303 | propdataprefix dt_ref
304 {
305 $1 = data_add_marker($1, TYPE_STRING, $2);
306 $$ = data_add_marker($1, REF_PATH, $2);
307 }
308 | propdataprefix DT_INCBIN '(' DT_STRING ',' integer_prim ',' integer_prim ')'
309 {
310 FILE *f = srcfile_relative_open($4.val, NULL);
311 struct data d;
312
313 if ($6 != 0)
314 if (fseek(f, $6, SEEK_SET) != 0)
315 die("Couldn't seek to offset %llu in \"%s\": %s",
316 (unsigned long long)$6, $4.val,
317 strerror(errno));
318
319 d = data_copy_file(f, $8);
320
321 $$ = data_merge($1, d);
322 fclose(f);
323 }
324 | propdataprefix DT_INCBIN '(' DT_STRING ')'
325 {
326 FILE *f = srcfile_relative_open($4.val, NULL);
327 struct data d = empty_data;
328
329 d = data_copy_file(f, -1);
330
331 $$ = data_merge($1, d);
332 fclose(f);
333 }
334 | propdata DT_LABEL
335 {
336 $$ = data_add_marker($1, LABEL, $2);
337 }
338 ;
339
340propdataprefix:
341 /* empty */
342 {
343 $$ = empty_data;
344 }
345 | propdata ','
346 {
347 $$ = $1;
348 }
349 | propdataprefix DT_LABEL
350 {
351 $$ = data_add_marker($1, LABEL, $2);
352 }
353 ;
354
355arrayprefix:
356 DT_BITS DT_LITERAL '<'
357 {
358 unsigned long long bits;
359 enum markertype type = TYPE_UINT32;
360
361 bits = $2;
362
363 switch (bits) {
364 case 8: type = TYPE_UINT8; break;
365 case 16: type = TYPE_UINT16; break;
366 case 32: type = TYPE_UINT32; break;
367 case 64: type = TYPE_UINT64; break;
368 default:
369 ERROR(&@2, "Array elements must be"
370 " 8, 16, 32 or 64-bits");
371 bits = 32;
372 }
373
374 $$.data = data_add_marker(empty_data, type, NULL);
375 $$.bits = bits;
376 }
377 | '<'
378 {
379 $$.data = data_add_marker(empty_data, TYPE_UINT32, NULL);
380 $$.bits = 32;
381 }
382 | arrayprefix integer_prim
383 {
384 if ($1.bits < 64) {
385 uint64_t mask = (1ULL << $1.bits) - 1;
386 /*
387 * Bits above mask must either be all zero
388 * (positive within range of mask) or all one
389 * (negative and sign-extended). The second
390 * condition is true if when we set all bits
391 * within the mask to one (i.e. | in the
392 * mask), all bits are one.
393 */
394 if (($2 > mask) && (($2 | mask) != -1ULL))
395 ERROR(&@2, "Value out of range for"
396 " %d-bit array element", $1.bits);
397 }
398
399 $$.data = data_append_integer($1.data, $2, $1.bits);
400 }
401 | arrayprefix dt_ref
402 {
403 uint64_t val = ~0ULL >> (64 - $1.bits);
404
405 if ($1.bits == 32)
406 $1.data = data_add_marker($1.data,
407 REF_PHANDLE,
408 $2);
409 else
410 ERROR(&@2, "References are only allowed in "
411 "arrays with 32-bit elements.");
412
413 $$.data = data_append_integer($1.data, val, $1.bits);
414 }
415 | arrayprefix DT_LABEL
416 {
417 $$.data = data_add_marker($1.data, LABEL, $2);
418 }
419 ;
420
421integer_prim:
422 DT_LITERAL
423 | DT_CHAR_LITERAL
424 | '(' integer_expr ')'
425 {
426 $$ = $2;
427 }
428 ;
429
430integer_expr:
431 integer_trinary
432 ;
433
434integer_trinary:
435 integer_or
436 | integer_or '?' integer_expr ':' integer_trinary { $$ = $1 ? $3 : $5; }
437 ;
438
439integer_or:
440 integer_and
441 | integer_or DT_OR integer_and { $$ = $1 || $3; }
442 ;
443
444integer_and:
445 integer_bitor
446 | integer_and DT_AND integer_bitor { $$ = $1 && $3; }
447 ;
448
449integer_bitor:
450 integer_bitxor
451 | integer_bitor '|' integer_bitxor { $$ = $1 | $3; }
452 ;
453
454integer_bitxor:
455 integer_bitand
456 | integer_bitxor '^' integer_bitand { $$ = $1 ^ $3; }
457 ;
458
459integer_bitand:
460 integer_eq
461 | integer_bitand '&' integer_eq { $$ = $1 & $3; }
462 ;
463
464integer_eq:
465 integer_rela
466 | integer_eq DT_EQ integer_rela { $$ = $1 == $3; }
467 | integer_eq DT_NE integer_rela { $$ = $1 != $3; }
468 ;
469
470integer_rela:
471 integer_shift
472 | integer_rela '<' integer_shift { $$ = $1 < $3; }
473 | integer_rela '>' integer_shift { $$ = $1 > $3; }
474 | integer_rela DT_LE integer_shift { $$ = $1 <= $3; }
475 | integer_rela DT_GE integer_shift { $$ = $1 >= $3; }
476 ;
477
478integer_shift:
479 integer_shift DT_LSHIFT integer_add { $$ = ($3 < 64) ? ($1 << $3) : 0; }
480 | integer_shift DT_RSHIFT integer_add { $$ = ($3 < 64) ? ($1 >> $3) : 0; }
481 | integer_add
482 ;
483
484integer_add:
485 integer_add '+' integer_mul { $$ = $1 + $3; }
486 | integer_add '-' integer_mul { $$ = $1 - $3; }
487 | integer_mul
488 ;
489
490integer_mul:
491 integer_mul '*' integer_unary { $$ = $1 * $3; }
492 | integer_mul '/' integer_unary
493 {
494 if ($3 != 0) {
495 $$ = $1 / $3;
496 } else {
497 ERROR(&@$, "Division by zero");
498 $$ = 0;
499 }
500 }
501 | integer_mul '%' integer_unary
502 {
503 if ($3 != 0) {
504 $$ = $1 % $3;
505 } else {
506 ERROR(&@$, "Division by zero");
507 $$ = 0;
508 }
509 }
510 | integer_unary
511 ;
512
513integer_unary:
514 integer_prim
515 | '-' integer_unary { $$ = -$2; }
516 | '~' integer_unary { $$ = ~$2; }
517 | '!' integer_unary { $$ = !$2; }
518 ;
519
520bytestring:
521 /* empty */
522 {
523 $$ = data_add_marker(empty_data, TYPE_UINT8, NULL);
524 }
525 | bytestring DT_BYTE
526 {
527 $$ = data_append_byte($1, $2);
528 }
529 | bytestring DT_LABEL
530 {
531 $$ = data_add_marker($1, LABEL, $2);
532 }
533 ;
534
535subnodes:
536 /* empty */
537 {
538 $$ = NULL;
539 }
540 | subnode subnodes
541 {
542 $$ = chain_node($1, $2);
543 }
544 | subnode propdef
545 {
546 ERROR(&@2, "Properties must precede subnodes");
547 YYERROR;
548 }
549 ;
550
551subnode:
552 DT_PROPNODENAME nodedef
553 {
554 $$ = name_node($2, $1);
555 }
556 | DT_DEL_NODE DT_PROPNODENAME ';'
557 {
558 $$ = name_node(build_node_delete(&@$), $2);
559 }
560 | DT_OMIT_NO_REF subnode
561 {
562 $$ = omit_node_if_unused($2);
563 }
564 | DT_LABEL subnode
565 {
566 add_label(&$2->labels, $1);
567 $$ = $2;
568 }
569 ;
570
571%%
572
573void yyerror(char const *s)
574{
575 ERROR(&yylloc, "%s", s);
576}