2 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
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.
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.
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
29 extern int yylex(void);
30 extern void print_error(char const *fmt, ...);
31 extern void yyerror(char const *s);
33 extern struct boot_info *the_boot_info;
34 extern bool treesource_error;
49 struct property *prop;
50 struct property *proplist;
52 struct node *nodelist;
53 struct reserve_info *re;
59 %token DT_LSHIFT DT_RSHIFT DT_LE DT_GE DT_EQ DT_NE DT_AND DT_OR
63 %token <propnodename> DT_PROPNODENAME
64 %token <integer> DT_LITERAL
65 %token <integer> DT_CHAR_LITERAL
66 %token <cbase> DT_BASE
68 %token <data> DT_STRING
69 %token <labelref> DT_LABEL
70 %token <labelref> DT_REF
74 %type <data> propdataprefix
76 %type <re> memreserves
77 %type <array> arrayprefix
78 %type <data> bytestring
80 %type <proplist> proplist
82 %type <node> devicetree
85 %type <nodelist> subnodes
87 %type <integer> integer_prim
88 %type <integer> integer_unary
89 %type <integer> integer_mul
90 %type <integer> integer_add
91 %type <integer> integer_shift
92 %type <integer> integer_rela
93 %type <integer> integer_eq
94 %type <integer> integer_bitand
95 %type <integer> integer_bitxor
96 %type <integer> integer_bitor
97 %type <integer> integer_and
98 %type <integer> integer_or
99 %type <integer> integer_trinary
100 %type <integer> integer_expr
105 DT_V1 ';' memreserves devicetree
107 the_boot_info = build_boot_info($3, $4,
108 guess_boot_cpuid($4));
117 | memreserve memreserves
119 $$ = chain_reserve_entry($1, $2);
124 DT_MEMRESERVE integer_prim integer_prim ';'
126 $$ = build_reserve_entry($2, $3);
128 | DT_LABEL memreserve
130 add_label(&$2->labels, $1);
138 $$ = name_node($2, "");
140 | devicetree '/' nodedef
142 $$ = merge_nodes($1, $3);
144 | devicetree DT_REF nodedef
146 struct node *target = get_node_by_ref($1, $2);
149 merge_nodes(target, $3);
151 print_error("label or path, '%s', not found", $2);
154 | devicetree DT_DEL_NODE DT_REF ';'
156 struct node *target = get_node_by_ref($1, $3);
159 print_error("label or path, '%s', not found", $3);
168 '{' proplist subnodes '}' ';'
170 $$ = build_node($2, $3);
181 $$ = chain_property($2, $1);
186 DT_PROPNODENAME '=' propdata ';'
188 $$ = build_property($1, $3);
190 | DT_PROPNODENAME ';'
192 $$ = build_property($1, empty_data);
194 | DT_DEL_PROP DT_PROPNODENAME ';'
196 $$ = build_property_delete($2);
200 add_label(&$2->labels, $1);
206 propdataprefix DT_STRING
208 $$ = data_merge($1, $2);
210 | propdataprefix arrayprefix '>'
212 $$ = data_merge($1, $2.data);
214 | propdataprefix '[' bytestring ']'
216 $$ = data_merge($1, $3);
218 | propdataprefix DT_REF
220 $$ = data_add_marker($1, REF_PATH, $2);
222 | propdataprefix DT_INCBIN '(' DT_STRING ',' integer_prim ',' integer_prim ')'
224 FILE *f = srcfile_relative_open($4.val, NULL);
228 if (fseek(f, $6, SEEK_SET) != 0)
229 die("Couldn't seek to offset %llu in \"%s\": %s",
230 (unsigned long long)$6, $4.val,
233 d = data_copy_file(f, $8);
235 $$ = data_merge($1, d);
238 | propdataprefix DT_INCBIN '(' DT_STRING ')'
240 FILE *f = srcfile_relative_open($4.val, NULL);
241 struct data d = empty_data;
243 d = data_copy_file(f, -1);
245 $$ = data_merge($1, d);
250 $$ = data_add_marker($1, LABEL, $2);
263 | propdataprefix DT_LABEL
265 $$ = data_add_marker($1, LABEL, $2);
270 DT_BITS DT_LITERAL '<'
272 unsigned long long bits;
276 if ((bits != 8) && (bits != 16) &&
277 (bits != 32) && (bits != 64))
279 print_error("Only 8, 16, 32 and 64-bit elements"
280 " are currently supported");
284 $$.data = empty_data;
289 $$.data = empty_data;
292 | arrayprefix integer_prim
295 uint64_t mask = (1ULL << $1.bits) - 1;
297 * Bits above mask must either be all zero
298 * (positive within range of mask) or all one
299 * (negative and sign-extended). The second
300 * condition is true if when we set all bits
301 * within the mask to one (i.e. | in the
302 * mask), all bits are one.
304 if (($2 > mask) && (($2 | mask) != -1ULL))
306 "integer value out of range "
307 "%016lx (%d bits)", $1.bits);
310 $$.data = data_append_integer($1.data, $2, $1.bits);
314 uint64_t val = ~0ULL >> (64 - $1.bits);
317 $1.data = data_add_marker($1.data,
321 print_error("References are only allowed in "
322 "arrays with 32-bit elements.");
324 $$.data = data_append_integer($1.data, val, $1.bits);
326 | arrayprefix DT_LABEL
328 $$.data = data_add_marker($1.data, LABEL, $2);
335 | '(' integer_expr ')'
347 | integer_or '?' integer_expr ':' integer_trinary { $$ = $1 ? $3 : $5; }
352 | integer_or DT_OR integer_and { $$ = $1 || $3; }
357 | integer_and DT_AND integer_bitor { $$ = $1 && $3; }
362 | integer_bitor '|' integer_bitxor { $$ = $1 | $3; }
367 | integer_bitxor '^' integer_bitand { $$ = $1 ^ $3; }
372 | integer_bitand '&' integer_eq { $$ = $1 & $3; }
377 | integer_eq DT_EQ integer_rela { $$ = $1 == $3; }
378 | integer_eq DT_NE integer_rela { $$ = $1 != $3; }
383 | integer_rela '<' integer_shift { $$ = $1 < $3; }
384 | integer_rela '>' integer_shift { $$ = $1 > $3; }
385 | integer_rela DT_LE integer_shift { $$ = $1 <= $3; }
386 | integer_rela DT_GE integer_shift { $$ = $1 >= $3; }
390 integer_shift DT_LSHIFT integer_add { $$ = $1 << $3; }
391 | integer_shift DT_RSHIFT integer_add { $$ = $1 >> $3; }
396 integer_add '+' integer_mul { $$ = $1 + $3; }
397 | integer_add '-' integer_mul { $$ = $1 - $3; }
402 integer_mul '*' integer_unary { $$ = $1 * $3; }
403 | integer_mul '/' integer_unary { $$ = $1 / $3; }
404 | integer_mul '%' integer_unary { $$ = $1 % $3; }
410 | '-' integer_unary { $$ = -$2; }
411 | '~' integer_unary { $$ = ~$2; }
412 | '!' integer_unary { $$ = !$2; }
422 $$ = data_append_byte($1, $2);
424 | bytestring DT_LABEL
426 $$ = data_add_marker($1, LABEL, $2);
437 $$ = chain_node($1, $2);
441 print_error("syntax error: properties must precede subnodes");
447 DT_PROPNODENAME nodedef
449 $$ = name_node($2, $1);
451 | DT_DEL_NODE DT_PROPNODENAME ';'
453 $$ = name_node(build_node_delete(), $2);
457 add_label(&$2->labels, $1);
464 void print_error(char const *fmt, ...)
469 srcpos_verror(&yylloc, "Error", fmt, va);
472 treesource_error = true;
475 void yyerror(char const *s) {
476 print_error("%s", s);