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 yyerror(char const *s);
31 #define ERROR(loc, ...) \
33 srcpos_error((loc), "Error", __VA_ARGS__); \
34 treesource_error = true; \
37 extern struct dt_info *parser_output;
38 extern bool treesource_error;
52 struct property *prop;
53 struct property *proplist;
55 struct node *nodelist;
56 struct reserve_info *re;
64 %token DT_LSHIFT DT_RSHIFT DT_LE DT_GE DT_EQ DT_NE DT_AND DT_OR
68 %token <propnodename> DT_PROPNODENAME
69 %token <integer> DT_LITERAL
70 %token <integer> DT_CHAR_LITERAL
72 %token <data> DT_STRING
73 %token <labelref> DT_LABEL
74 %token <labelref> DT_REF
78 %type <data> propdataprefix
82 %type <re> memreserves
83 %type <array> arrayprefix
84 %type <data> bytestring
86 %type <proplist> proplist
88 %type <node> devicetree
91 %type <nodelist> subnodes
93 %type <integer> integer_prim
94 %type <integer> integer_unary
95 %type <integer> integer_mul
96 %type <integer> integer_add
97 %type <integer> integer_shift
98 %type <integer> integer_rela
99 %type <integer> integer_eq
100 %type <integer> integer_bitand
101 %type <integer> integer_bitxor
102 %type <integer> integer_bitor
103 %type <integer> integer_and
104 %type <integer> integer_or
105 %type <integer> integer_trinary
106 %type <integer> integer_expr
111 headers memreserves devicetree
113 parser_output = build_dt_info($1, $2, $3,
114 guess_boot_cpuid($3));
123 | DT_V1 ';' DT_PLUGIN ';'
125 $$ = DTSF_V1 | DTSF_PLUGIN;
134 ERROR(&yylloc, "Header flags don't match earlier ones");
144 | memreserve memreserves
146 $$ = chain_reserve_entry($1, $2);
151 DT_MEMRESERVE integer_prim integer_prim ';'
153 $$ = build_reserve_entry($2, $3);
155 | DT_LABEL memreserve
157 add_label(&$2->labels, $1);
165 $$ = name_node($2, "");
167 | devicetree '/' nodedef
169 $$ = merge_nodes($1, $3);
172 | devicetree DT_LABEL DT_REF nodedef
174 struct node *target = get_node_by_ref($1, $3);
177 add_label(&target->labels, $2);
178 merge_nodes(target, $4);
180 ERROR(&yylloc, "Label or path %s not found", $3);
183 | devicetree DT_REF nodedef
185 struct node *target = get_node_by_ref($1, $2);
188 merge_nodes(target, $3);
190 ERROR(&yylloc, "Label or path %s not found", $2);
193 | devicetree DT_DEL_NODE DT_REF ';'
195 struct node *target = get_node_by_ref($1, $3);
200 ERROR(&yylloc, "Label or path %s not found", $3);
208 '{' proplist subnodes '}' ';'
210 $$ = build_node($2, $3);
221 $$ = chain_property($2, $1);
226 DT_PROPNODENAME '=' propdata ';'
228 $$ = build_property($1, $3);
230 | DT_PROPNODENAME ';'
232 $$ = build_property($1, empty_data);
234 | DT_DEL_PROP DT_PROPNODENAME ';'
236 $$ = build_property_delete($2);
240 add_label(&$2->labels, $1);
246 propdataprefix DT_STRING
248 $$ = data_merge($1, $2);
250 | propdataprefix arrayprefix '>'
252 $$ = data_merge($1, $2.data);
254 | propdataprefix '[' bytestring ']'
256 $$ = data_merge($1, $3);
258 | propdataprefix DT_REF
260 $$ = data_add_marker($1, REF_PATH, $2);
262 | propdataprefix DT_INCBIN '(' DT_STRING ',' integer_prim ',' integer_prim ')'
264 FILE *f = srcfile_relative_open($4.val, NULL);
268 if (fseek(f, $6, SEEK_SET) != 0)
269 die("Couldn't seek to offset %llu in \"%s\": %s",
270 (unsigned long long)$6, $4.val,
273 d = data_copy_file(f, $8);
275 $$ = data_merge($1, d);
278 | propdataprefix DT_INCBIN '(' DT_STRING ')'
280 FILE *f = srcfile_relative_open($4.val, NULL);
281 struct data d = empty_data;
283 d = data_copy_file(f, -1);
285 $$ = data_merge($1, d);
290 $$ = data_add_marker($1, LABEL, $2);
303 | propdataprefix DT_LABEL
305 $$ = data_add_marker($1, LABEL, $2);
310 DT_BITS DT_LITERAL '<'
312 unsigned long long bits;
316 if ((bits != 8) && (bits != 16) &&
317 (bits != 32) && (bits != 64)) {
318 ERROR(&yylloc, "Array elements must be"
319 " 8, 16, 32 or 64-bits");
323 $$.data = empty_data;
328 $$.data = empty_data;
331 | arrayprefix integer_prim
334 uint64_t mask = (1ULL << $1.bits) - 1;
336 * Bits above mask must either be all zero
337 * (positive within range of mask) or all one
338 * (negative and sign-extended). The second
339 * condition is true if when we set all bits
340 * within the mask to one (i.e. | in the
341 * mask), all bits are one.
343 if (($2 > mask) && (($2 | mask) != -1ULL))
344 ERROR(&yylloc, "Value out of range for"
345 " %d-bit array element", $1.bits);
348 $$.data = data_append_integer($1.data, $2, $1.bits);
352 uint64_t val = ~0ULL >> (64 - $1.bits);
355 $1.data = data_add_marker($1.data,
359 ERROR(&yylloc, "References are only allowed in "
360 "arrays with 32-bit elements.");
362 $$.data = data_append_integer($1.data, val, $1.bits);
364 | arrayprefix DT_LABEL
366 $$.data = data_add_marker($1.data, LABEL, $2);
373 | '(' integer_expr ')'
385 | integer_or '?' integer_expr ':' integer_trinary { $$ = $1 ? $3 : $5; }
390 | integer_or DT_OR integer_and { $$ = $1 || $3; }
395 | integer_and DT_AND integer_bitor { $$ = $1 && $3; }
400 | integer_bitor '|' integer_bitxor { $$ = $1 | $3; }
405 | integer_bitxor '^' integer_bitand { $$ = $1 ^ $3; }
410 | integer_bitand '&' integer_eq { $$ = $1 & $3; }
415 | integer_eq DT_EQ integer_rela { $$ = $1 == $3; }
416 | integer_eq DT_NE integer_rela { $$ = $1 != $3; }
421 | integer_rela '<' integer_shift { $$ = $1 < $3; }
422 | integer_rela '>' integer_shift { $$ = $1 > $3; }
423 | integer_rela DT_LE integer_shift { $$ = $1 <= $3; }
424 | integer_rela DT_GE integer_shift { $$ = $1 >= $3; }
428 integer_shift DT_LSHIFT integer_add { $$ = $1 << $3; }
429 | integer_shift DT_RSHIFT integer_add { $$ = $1 >> $3; }
434 integer_add '+' integer_mul { $$ = $1 + $3; }
435 | integer_add '-' integer_mul { $$ = $1 - $3; }
440 integer_mul '*' integer_unary { $$ = $1 * $3; }
441 | integer_mul '/' integer_unary
446 ERROR(&yylloc, "Division by zero");
450 | integer_mul '%' integer_unary
455 ERROR(&yylloc, "Division by zero");
464 | '-' integer_unary { $$ = -$2; }
465 | '~' integer_unary { $$ = ~$2; }
466 | '!' integer_unary { $$ = !$2; }
476 $$ = data_append_byte($1, $2);
478 | bytestring DT_LABEL
480 $$ = data_add_marker($1, LABEL, $2);
491 $$ = chain_node($1, $2);
495 ERROR(&yylloc, "Properties must precede subnodes");
501 DT_PROPNODENAME nodedef
503 $$ = name_node($2, $1);
505 | DT_DEL_NODE DT_PROPNODENAME ';'
507 $$ = name_node(build_node_delete(), $2);
511 add_label(&$2->labels, $1);
518 void yyerror(char const *s)
520 ERROR(&yylloc, "%s", s);