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 int treesource_error;
36 static unsigned long long eval_literal(const char *s, int base, int bits);
37 static unsigned char eval_char_literal(const char *s);
53 struct property *prop;
54 struct property *proplist;
56 struct node *nodelist;
57 struct reserve_info *re;
63 %token DT_LSHIFT DT_RSHIFT DT_LE DT_GE DT_EQ DT_NE DT_AND DT_OR
65 %token <propnodename> DT_PROPNODENAME
66 %token <literal> DT_LITERAL
67 %token <literal> DT_CHAR_LITERAL
68 %token <cbase> DT_BASE
70 %token <data> DT_STRING
71 %token <labelref> DT_LABEL
72 %token <labelref> DT_REF
76 %type <data> propdataprefix
78 %type <re> memreserves
79 %type <array> arrayprefix
80 %type <data> bytestring
82 %type <proplist> proplist
84 %type <node> devicetree
87 %type <nodelist> subnodes
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
107 DT_V1 ';' memreserves devicetree
109 the_boot_info = build_boot_info($3, $4,
110 guess_boot_cpuid($4));
119 | memreserve memreserves
121 $$ = chain_reserve_entry($1, $2);
126 DT_MEMRESERVE integer_prim integer_prim ';'
128 $$ = build_reserve_entry($2, $3);
130 | DT_LABEL memreserve
132 add_label(&$2->labels, $1);
140 $$ = name_node($2, "");
142 | devicetree '/' nodedef
144 $$ = merge_nodes($1, $3);
146 | devicetree DT_REF nodedef
148 struct node *target = get_node_by_ref($1, $2);
151 merge_nodes(target, $3);
153 print_error("label or path, '%s', not found", $2);
159 '{' proplist subnodes '}' ';'
161 $$ = build_node($2, $3);
172 $$ = chain_property($2, $1);
177 DT_PROPNODENAME '=' propdata ';'
179 $$ = build_property($1, $3);
181 | DT_PROPNODENAME ';'
183 $$ = build_property($1, empty_data);
187 add_label(&$2->labels, $1);
193 propdataprefix DT_STRING
195 $$ = data_merge($1, $2);
197 | propdataprefix arrayprefix '>'
199 $$ = data_merge($1, $2.data);
201 | propdataprefix '[' bytestring ']'
203 $$ = data_merge($1, $3);
205 | propdataprefix DT_REF
207 $$ = data_add_marker($1, REF_PATH, $2);
209 | propdataprefix DT_INCBIN '(' DT_STRING ',' integer_prim ',' integer_prim ')'
211 FILE *f = srcfile_relative_open($4.val, NULL);
215 if (fseek(f, $6, SEEK_SET) != 0)
216 print_error("Couldn't seek to offset %llu in \"%s\": %s",
217 (unsigned long long)$6,
221 d = data_copy_file(f, $8);
223 $$ = data_merge($1, d);
226 | propdataprefix DT_INCBIN '(' DT_STRING ')'
228 FILE *f = srcfile_relative_open($4.val, NULL);
229 struct data d = empty_data;
231 d = data_copy_file(f, -1);
233 $$ = data_merge($1, d);
238 $$ = data_add_marker($1, LABEL, $2);
251 | propdataprefix DT_LABEL
253 $$ = data_add_marker($1, LABEL, $2);
258 DT_BITS DT_LITERAL '<'
260 $$.data = empty_data;
261 $$.bits = eval_literal($2, 0, 7);
263 if (($$.bits != 8) &&
268 print_error("Only 8, 16, 32 and 64-bit elements"
269 " are currently supported");
275 $$.data = empty_data;
278 | arrayprefix integer_prim
281 uint64_t mask = (1ULL << $1.bits) - 1;
283 * Bits above mask must either be all zero
284 * (positive within range of mask) or all one
285 * (negative and sign-extended). The second
286 * condition is true if when we set all bits
287 * within the mask to one (i.e. | in the
288 * mask), all bits are one.
290 if (($2 > mask) && (($2 | mask) != -1ULL))
292 "integer value out of range "
293 "%016lx (%d bits)", $1.bits);
296 $$.data = data_append_integer($1.data, $2, $1.bits);
300 uint64_t val = ~0ULL >> (64 - $1.bits);
303 $1.data = data_add_marker($1.data,
307 print_error("References are only allowed in "
308 "arrays with 32-bit elements.");
310 $$.data = data_append_integer($1.data, val, $1.bits);
312 | arrayprefix DT_LABEL
314 $$.data = data_add_marker($1.data, LABEL, $2);
321 $$ = eval_literal($1, 0, 64);
325 $$ = eval_char_literal($1);
327 | '(' integer_expr ')'
339 | integer_or '?' integer_expr ':' integer_trinary { $$ = $1 ? $3 : $5; }
344 | integer_or DT_OR integer_and { $$ = $1 || $3; }
349 | integer_and DT_AND integer_bitor { $$ = $1 && $3; }
354 | integer_bitor '|' integer_bitxor { $$ = $1 | $3; }
359 | integer_bitxor '^' integer_bitand { $$ = $1 ^ $3; }
364 | integer_bitand '&' integer_eq { $$ = $1 & $3; }
369 | integer_eq DT_EQ integer_rela { $$ = $1 == $3; }
370 | integer_eq DT_NE integer_rela { $$ = $1 != $3; }
375 | integer_rela '<' integer_shift { $$ = $1 < $3; }
376 | integer_rela '>' integer_shift { $$ = $1 > $3; }
377 | integer_rela DT_LE integer_shift { $$ = $1 <= $3; }
378 | integer_rela DT_GE integer_shift { $$ = $1 >= $3; }
382 integer_shift DT_LSHIFT integer_add { $$ = $1 << $3; }
383 | integer_shift DT_RSHIFT integer_add { $$ = $1 >> $3; }
388 integer_add '+' integer_mul { $$ = $1 + $3; }
389 | integer_add '-' integer_mul { $$ = $1 - $3; }
394 integer_mul '*' integer_unary { $$ = $1 * $3; }
395 | integer_mul '/' integer_unary { $$ = $1 / $3; }
396 | integer_mul '%' integer_unary { $$ = $1 % $3; }
402 | '-' integer_unary { $$ = -$2; }
403 | '~' integer_unary { $$ = ~$2; }
404 | '!' integer_unary { $$ = !$2; }
414 $$ = data_append_byte($1, $2);
416 | bytestring DT_LABEL
418 $$ = data_add_marker($1, LABEL, $2);
429 $$ = chain_node($1, $2);
433 print_error("syntax error: properties must precede subnodes");
439 DT_PROPNODENAME nodedef
441 $$ = name_node($2, $1);
445 add_label(&$2->labels, $1);
452 void print_error(char const *fmt, ...)
457 srcpos_verror(&yylloc, fmt, va);
460 treesource_error = 1;
463 void yyerror(char const *s) {
464 print_error("%s", s);
467 static unsigned long long eval_literal(const char *s, int base, int bits)
469 unsigned long long val;
473 val = strtoull(s, &e, base);
475 size_t uls = strspn(e, "UL");
477 print_error("bad characters in literal");
479 if ((errno == ERANGE)
480 || ((bits < 64) && (val >= (1ULL << bits))))
481 print_error("literal out of range");
483 print_error("bad literal");
487 static unsigned char eval_char_literal(const char *s)
494 print_error("empty character literal");
499 * If the first character in the character literal is a \ then process
500 * the remaining characters as an escape encoding. If the first
501 * character is neither an escape or a terminator it should be the only
502 * character in the literal and will be returned.
505 c = get_escape_char(s, &i);
508 print_error("malformed character literal");