2007-12-18 07:06:42 +03:00
/*
* (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
*
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*/
%{
2008-08-07 06:24:17 +04:00
#include <stdio.h>
2007-12-18 07:06:42 +03:00
#include "dtc.h"
#include "srcpos.h"
2010-11-18 02:28:20 +03:00
YYLTYPE yylloc;
2008-08-07 06:24:17 +04:00
extern int yylex(void);
2010-11-18 02:28:20 +03:00
extern void print_error(char const *fmt, ...);
extern void yyerror(char const *s);
2007-12-18 07:06:42 +03:00
extern struct boot_info *the_boot_info;
2008-08-07 06:24:17 +04:00
extern int treesource_error;
2007-12-18 07:06:42 +03:00
2008-08-07 06:24:17 +04:00
static unsigned long long eval_literal(const char *s, int base, int bits);
2007-12-18 07:06:42 +03:00
%}
%union {
char *propnodename;
char *literal;
char *labelref;
unsigned int cbase;
2008-08-07 06:24:17 +04:00
uint8_t byte;
2007-12-18 07:06:42 +03:00
struct data data;
2008-08-07 06:24:17 +04:00
uint64_t addr;
2007-12-18 07:06:42 +03:00
cell_t cell;
struct property *prop;
struct property *proplist;
struct node *node;
struct node *nodelist;
struct reserve_info *re;
}
%token DT_V1
%token DT_MEMRESERVE
%token <propnodename> DT_PROPNODENAME
%token <literal> DT_LITERAL
%token <cbase> DT_BASE
%token <byte> DT_BYTE
%token <data> DT_STRING
%token <labelref> DT_LABEL
%token <labelref> DT_REF
2008-08-07 06:24:17 +04:00
%token DT_INCBIN
2007-12-18 07:06:42 +03:00
%type <data> propdata
%type <data> propdataprefix
%type <re> memreserve
%type <re> memreserves
%type <addr> addr
%type <data> celllist
%type <cell> cellval
%type <data> bytestring
%type <prop> propdef
%type <proplist> proplist
%type <node> devicetree
%type <node> nodedef
%type <node> subnode
%type <nodelist> subnodes
%%
sourcefile:
DT_V1 ';' memreserves devicetree
{
2010-11-18 02:28:20 +03:00
the_boot_info = build_boot_info($3, $4,
guess_boot_cpuid($4));
2007-12-18 07:06:42 +03:00
}
;
memreserves:
/* empty */
{
$$ = NULL;
}
| memreserve memreserves
{
$$ = chain_reserve_entry($1, $2);
}
;
memreserve:
2010-11-18 02:28:20 +03:00
DT_MEMRESERVE addr addr ';'
2007-12-18 07:06:42 +03:00
{
2010-11-18 02:28:20 +03:00
$$ = build_reserve_entry($2, $3);
2007-12-18 07:06:42 +03:00
}
2010-11-18 02:28:20 +03:00
| DT_LABEL memreserve
2007-12-18 07:06:42 +03:00
{
2010-11-18 02:28:20 +03:00
add_label(&$2->labels, $1);
$$ = $2;
2007-12-18 07:06:42 +03:00
}
;
addr:
DT_LITERAL
{
$$ = eval_literal($1, 0, 64);
}
;
devicetree:
'/' nodedef
{
2010-11-18 02:28:20 +03:00
$$ = name_node($2, "");
}
| devicetree '/' nodedef
{
$$ = merge_nodes($1, $3);
}
| devicetree DT_REF nodedef
{
struct node *target = get_node_by_ref($1, $2);
if (target)
merge_nodes(target, $3);
else
print_error("label or path, '%s', not found", $2);
$$ = $1;
2007-12-18 07:06:42 +03:00
}
;
nodedef:
'{' proplist subnodes '}' ';'
{
$$ = build_node($2, $3);
}
;
proplist:
/* empty */
{
$$ = NULL;
}
| proplist propdef
{
$$ = chain_property($2, $1);
}
;
propdef:
2010-11-18 02:28:20 +03:00
DT_PROPNODENAME '=' propdata ';'
{
$$ = build_property($1, $3);
}
| DT_PROPNODENAME ';'
2007-12-18 07:06:42 +03:00
{
2010-11-18 02:28:20 +03:00
$$ = build_property($1, empty_data);
2007-12-18 07:06:42 +03:00
}
2010-11-18 02:28:20 +03:00
| DT_LABEL propdef
2007-12-18 07:06:42 +03:00
{
2010-11-18 02:28:20 +03:00
add_label(&$2->labels, $1);
$$ = $2;
2007-12-18 07:06:42 +03:00
}
;
propdata:
propdataprefix DT_STRING
{
$$ = data_merge($1, $2);
}
| propdataprefix '<' celllist '>'
{
$$ = data_merge($1, $3);
}
| propdataprefix '[' bytestring ']'
{
$$ = data_merge($1, $3);
}
| propdataprefix DT_REF
{
$$ = data_add_marker($1, REF_PATH, $2);
}
2008-08-07 06:24:17 +04:00
| propdataprefix DT_INCBIN '(' DT_STRING ',' addr ',' addr ')'
{
2010-11-18 02:28:20 +03:00
FILE *f = srcfile_relative_open($4.val, NULL);
struct data d;
2008-08-07 06:24:17 +04:00
if ($6 != 0)
2010-11-18 02:28:20 +03:00
if (fseek(f, $6, SEEK_SET) != 0)
print_error("Couldn't seek to offset %llu in \"%s\": %s",
(unsigned long long)$6,
$4.val,
strerror(errno));
2008-08-07 06:24:17 +04:00
2010-11-18 02:28:20 +03:00
d = data_copy_file(f, $8);
2008-08-07 06:24:17 +04:00
$$ = data_merge($1, d);
2010-11-18 02:28:20 +03:00
fclose(f);
2008-08-07 06:24:17 +04:00
}
| propdataprefix DT_INCBIN '(' DT_STRING ')'
{
2010-11-18 02:28:20 +03:00
FILE *f = srcfile_relative_open($4.val, NULL);
2008-08-07 06:24:17 +04:00
struct data d = empty_data;
2010-11-18 02:28:20 +03:00
d = data_copy_file(f, -1);
2008-08-07 06:24:17 +04:00
$$ = data_merge($1, d);
2010-11-18 02:28:20 +03:00
fclose(f);
2008-08-07 06:24:17 +04:00
}
2007-12-18 07:06:42 +03:00
| propdata DT_LABEL
{
$$ = data_add_marker($1, LABEL, $2);
}
;
propdataprefix:
/* empty */
{
$$ = empty_data;
}
| propdata ','
{
$$ = $1;
}
| propdataprefix DT_LABEL
{
$$ = data_add_marker($1, LABEL, $2);
}
;
celllist:
/* empty */
{
$$ = empty_data;
}
| celllist cellval
{
$$ = data_append_cell($1, $2);
}
| celllist DT_REF
{
$$ = data_append_cell(data_add_marker($1, REF_PHANDLE,
$2), -1);
}
| celllist DT_LABEL
{
$$ = data_add_marker($1, LABEL, $2);
}
;
cellval:
DT_LITERAL
{
$$ = eval_literal($1, 0, 32);
}
;
bytestring:
/* empty */
{
$$ = empty_data;
}
| bytestring DT_BYTE
{
$$ = data_append_byte($1, $2);
}
| bytestring DT_LABEL
{
$$ = data_add_marker($1, LABEL, $2);
}
;
subnodes:
/* empty */
{
$$ = NULL;
}
2010-11-18 02:28:20 +03:00
| subnode subnodes
2007-12-18 07:06:42 +03:00
{
$$ = chain_node($1, $2);
}
| subnode propdef
{
2010-11-18 02:28:20 +03:00
print_error("syntax error: properties must precede subnodes");
2007-12-18 07:06:42 +03:00
YYERROR;
}
;
subnode:
2010-11-18 02:28:20 +03:00
DT_PROPNODENAME nodedef
2007-12-18 07:06:42 +03:00
{
2010-11-18 02:28:20 +03:00
$$ = name_node($2, $1);
2007-12-18 07:06:42 +03:00
}
2010-11-18 02:28:20 +03:00
| DT_LABEL subnode
2007-12-18 07:06:42 +03:00
{
2010-11-18 02:28:20 +03:00
add_label(&$2->labels, $1);
$$ = $2;
2007-12-18 07:06:42 +03:00
}
;
%%
2010-11-18 02:28:20 +03:00
void print_error(char const *fmt, ...)
2007-12-18 07:06:42 +03:00
{
2008-08-07 06:24:17 +04:00
va_list va;
2007-12-18 07:06:42 +03:00
2010-11-18 02:28:20 +03:00
va_start(va, fmt);
srcpos_verror(&yylloc, fmt, va);
va_end(va);
2008-08-07 06:24:17 +04:00
treesource_error = 1;
}
2010-11-18 02:28:20 +03:00
void yyerror(char const *s) {
print_error("%s", s);
2007-12-18 07:06:42 +03:00
}
2008-08-07 06:24:17 +04:00
static unsigned long long eval_literal(const char *s, int base, int bits)
2007-12-18 07:06:42 +03:00
{
unsigned long long val;
char *e;
errno = 0;
val = strtoull(s, &e, base);
if (*e)
2010-11-18 02:28:20 +03:00
print_error("bad characters in literal");
2007-12-18 07:06:42 +03:00
else if ((errno == ERANGE)
|| ((bits < 64) && (val >= (1ULL << bits))))
2010-11-18 02:28:20 +03:00
print_error("literal out of range");
2007-12-18 07:06:42 +03:00
else if (errno != 0)
2010-11-18 02:28:20 +03:00
print_error("bad literal");
2007-12-18 07:06:42 +03:00
return val;
}