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