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
27
extern int yylex(void);
28
extern void yyerror(char const *s);
29
#define ERROR(loc, ...) \
31
srcpos_error((loc), "Error", __VA_ARGS__); \
32
treesource_error = true; \
35
extern struct dt_info *parser_output;
36
extern bool treesource_error;
50
struct property *prop;
51
struct property *proplist;
53
struct node *nodelist;
54
struct reserve_info *re;
62
%token DT_LSHIFT DT_RSHIFT DT_LE DT_GE DT_EQ DT_NE DT_AND DT_OR
66
%token <propnodename> DT_PROPNODENAME
67
%token <integer> DT_LITERAL
68
%token <integer> DT_CHAR_LITERAL
70
%token <data> DT_STRING
71
%token <labelref> DT_LABEL
72
%token <labelref> DT_REF
76
%type <data> propdataprefix
80
%type <re> memreserves
81
%type <array> arrayprefix
82
%type <data> bytestring
84
%type <proplist> proplist
86
%type <node> devicetree
89
%type <nodelist> subnodes
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
109
headers memreserves devicetree
111
parser_output = build_dt_info($1, $2, $3,
112
guess_boot_cpuid($3));
121
| DT_V1 ';' DT_PLUGIN ';'
123
$$ = DTSF_V1 | DTSF_PLUGIN;
132
ERROR(&@2, "Header flags don't match earlier ones");
142
| memreserve memreserves
144
$$ = chain_reserve_entry($1, $2);
149
DT_MEMRESERVE integer_prim integer_prim ';'
151
$$ = build_reserve_entry($2, $3);
153
| DT_LABEL memreserve
155
add_label(&$2->labels, $1);
163
$$ = name_node($2, "");
165
| devicetree '/' nodedef
167
$$ = merge_nodes($1, $3);
170
| devicetree DT_LABEL DT_REF nodedef
172
struct node *target = get_node_by_ref($1, $3);
175
add_label(&target->labels, $2);
176
merge_nodes(target, $4);
178
ERROR(&@3, "Label or path %s not found", $3);
181
| devicetree DT_REF nodedef
183
struct node *target = get_node_by_ref($1, $2);
186
merge_nodes(target, $3);
188
ERROR(&@2, "Label or path %s not found", $2);
191
| devicetree DT_DEL_NODE DT_REF ';'
193
struct node *target = get_node_by_ref($1, $3);
198
ERROR(&@3, "Label or path %s not found", $3);
206
'{' proplist subnodes '}' ';'
208
$$ = build_node($2, $3);
219
$$ = chain_property($2, $1);
224
DT_PROPNODENAME '=' propdata ';'
226
$$ = build_property($1, $3);
228
| DT_PROPNODENAME ';'
230
$$ = build_property($1, empty_data);
232
| DT_DEL_PROP DT_PROPNODENAME ';'
234
$$ = build_property_delete($2);
238
add_label(&$2->labels, $1);
244
propdataprefix DT_STRING
246
$$ = data_merge($1, $2);
248
| propdataprefix arrayprefix '>'
250
$$ = data_merge($1, $2.data);
252
| propdataprefix '[' bytestring ']'
254
$$ = data_merge($1, $3);
256
| propdataprefix DT_REF
258
$$ = data_add_marker($1, REF_PATH, $2);
260
| propdataprefix DT_INCBIN '(' DT_STRING ',' integer_prim ',' integer_prim ')'
262
FILE *f = srcfile_relative_open($4.val, NULL);
266
if (fseek(f, $6, SEEK_SET) != 0)
267
die("Couldn't seek to offset %llu in \"%s\": %s",
268
(unsigned long long)$6, $4.val,
271
d = data_copy_file(f, $8);
273
$$ = data_merge($1, d);
276
| propdataprefix DT_INCBIN '(' DT_STRING ')'
278
FILE *f = srcfile_relative_open($4.val, NULL);
279
struct data d = empty_data;
281
d = data_copy_file(f, -1);
283
$$ = data_merge($1, d);
288
$$ = data_add_marker($1, LABEL, $2);
301
| propdataprefix DT_LABEL
303
$$ = data_add_marker($1, LABEL, $2);
308
DT_BITS DT_LITERAL '<'
310
unsigned long long bits;
314
if ((bits != 8) && (bits != 16) &&
315
(bits != 32) && (bits != 64)) {
316
ERROR(&@2, "Array elements must be"
317
" 8, 16, 32 or 64-bits");
321
$$.data = empty_data;
326
$$.data = empty_data;
329
| arrayprefix integer_prim
332
uint64_t mask = (1ULL << $1.bits) - 1;
334
* Bits above mask must either be all zero
335
* (positive within range of mask) or all one
336
* (negative and sign-extended). The second
337
* condition is true if when we set all bits
338
* within the mask to one (i.e. | in the
339
* mask), all bits are one.
341
if (($2 > mask) && (($2 | mask) != -1ULL))
342
ERROR(&@2, "Value out of range for"
343
" %d-bit array element", $1.bits);
346
$$.data = data_append_integer($1.data, $2, $1.bits);
350
uint64_t val = ~0ULL >> (64 - $1.bits);
353
$1.data = data_add_marker($1.data,
357
ERROR(&@2, "References are only allowed in "
358
"arrays with 32-bit elements.");
360
$$.data = data_append_integer($1.data, val, $1.bits);
362
| arrayprefix DT_LABEL
364
$$.data = data_add_marker($1.data, LABEL, $2);
371
| '(' integer_expr ')'
383
| integer_or '?' integer_expr ':' integer_trinary { $$ = $1 ? $3 : $5; }
388
| integer_or DT_OR integer_and { $$ = $1 || $3; }
393
| integer_and DT_AND integer_bitor { $$ = $1 && $3; }
398
| integer_bitor '|' integer_bitxor { $$ = $1 | $3; }
403
| integer_bitxor '^' integer_bitand { $$ = $1 ^ $3; }
408
| integer_bitand '&' integer_eq { $$ = $1 & $3; }
413
| integer_eq DT_EQ integer_rela { $$ = $1 == $3; }
414
| integer_eq DT_NE integer_rela { $$ = $1 != $3; }
419
| integer_rela '<' integer_shift { $$ = $1 < $3; }
420
| integer_rela '>' integer_shift { $$ = $1 > $3; }
421
| integer_rela DT_LE integer_shift { $$ = $1 <= $3; }
422
| integer_rela DT_GE integer_shift { $$ = $1 >= $3; }
426
integer_shift DT_LSHIFT integer_add { $$ = $1 << $3; }
427
| integer_shift DT_RSHIFT integer_add { $$ = $1 >> $3; }
432
integer_add '+' integer_mul { $$ = $1 + $3; }
433
| integer_add '-' integer_mul { $$ = $1 - $3; }
438
integer_mul '*' integer_unary { $$ = $1 * $3; }
439
| integer_mul '/' integer_unary
444
ERROR(&@$, "Division by zero");
448
| integer_mul '%' integer_unary
453
ERROR(&@$, "Division by zero");
462
| '-' integer_unary { $$ = -$2; }
463
| '~' integer_unary { $$ = ~$2; }
464
| '!' integer_unary { $$ = !$2; }
474
$$ = data_append_byte($1, $2);
476
| bytestring DT_LABEL
478
$$ = data_add_marker($1, LABEL, $2);
489
$$ = chain_node($1, $2);
493
ERROR(&@2, "Properties must precede subnodes");
499
DT_PROPNODENAME nodedef
501
$$ = name_node($2, $1);
503
| DT_DEL_NODE DT_PROPNODENAME ';'
505
$$ = name_node(build_node_delete(), $2);
509
add_label(&$2->labels, $1);
516
void yyerror(char const *s)
518
ERROR(&yylloc, "%s", s);