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
25 extern int yyparse(void);
26 extern YYLTYPE yylloc;
28 struct dt_info *parser_output;
29 bool treesource_error;
31 struct dt_info *dt_from_source(const char *fname)
34 treesource_error = false;
37 yyin = current_srcfile->f;
38 yylloc.file = current_srcfile;
41 die("Unable to parse input tree\n");
44 die("Syntax error parsing input tree\n");
49 static void write_prefix(FILE *f, int level)
53 for (i = 0; i < level; i++)
57 static bool isstring(char c)
59 return (isprint((unsigned char)c)
61 || strchr("\a\b\t\n\v\f\r", c));
64 static void write_propval_string(FILE *f, const char *s, size_t len)
66 const char *end = s + len - 1;
104 if (isprint((unsigned char)c))
107 fprintf(f, "\\x%02"PRIx8, c);
113 static void write_propval_int(FILE *f, const char *p, size_t len, size_t width)
115 const char *end = p + len;
116 assert(len % width == 0);
118 for (; p < end; p += width) {
121 fprintf(f, " %02"PRIx8, *(const uint8_t*)p);
124 fprintf(f, " 0x%02"PRIx16, fdt16_to_cpu(*(const fdt16_t*)p));
127 fprintf(f, " 0x%02"PRIx32, fdt32_to_cpu(*(const fdt32_t*)p));
130 fprintf(f, " 0x%02"PRIx64, fdt64_to_cpu(*(const fdt64_t*)p));
136 static bool has_data_type_information(struct marker *m)
138 return m->type >= TYPE_UINT8;
141 static struct marker *next_type_marker(struct marker *m)
143 while (m && !has_data_type_information(m))
148 size_t type_marker_length(struct marker *m)
150 struct marker *next = next_type_marker(m->next);
153 return next->offset - m->offset;
157 static const char *delim_start[] = {
159 [TYPE_UINT16] = "/bits/ 16 <",
161 [TYPE_UINT64] = "/bits/ 64 <",
164 static const char *delim_end[] = {
166 [TYPE_UINT16] = " >",
167 [TYPE_UINT32] = " >",
168 [TYPE_UINT64] = " >",
172 static enum markertype guess_value_type(struct property *prop)
174 int len = prop->val.len;
175 const char *p = prop->val.val;
176 struct marker *m = prop->val.markers;
177 int nnotstring = 0, nnul = 0;
178 int nnotstringlbl = 0, nnotcelllbl = 0;
181 for (i = 0; i < len; i++) {
182 if (! isstring(p[i]))
188 for_each_marker_of_type(m, LABEL) {
189 if ((m->offset > 0) && (prop->val.val[m->offset - 1] != '\0'))
191 if ((m->offset % sizeof(cell_t)) != 0)
195 if ((p[len-1] == '\0') && (nnotstring == 0) && (nnul < (len-nnul))
196 && (nnotstringlbl == 0)) {
198 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {
205 static void write_propval(FILE *f, struct property *prop)
207 size_t len = prop->val.len;
208 struct marker *m = prop->val.markers;
209 struct marker dummy_marker;
210 enum markertype emit_type = TYPE_NONE;
219 if (!next_type_marker(m)) {
220 /* data type information missing, need to guess */
221 dummy_marker.type = guess_value_type(prop);
222 dummy_marker.next = prop->val.markers;
223 dummy_marker.offset = 0;
224 dummy_marker.ref = NULL;
228 struct marker *m_label = prop->val.markers;
231 const char *p = &prop->val.val[m->offset];
233 if (!has_data_type_information(m))
236 chunk_len = type_marker_length(m);
238 chunk_len = len - m->offset;
240 if (emit_type != TYPE_NONE)
241 fprintf(f, "%s, ", delim_end[emit_type]);
244 for_each_marker_of_type(m_label, LABEL) {
245 if (m_label->offset > m->offset)
247 fprintf(f, "%s: ", m_label->ref);
250 fprintf(f, "%s", delim_start[emit_type]);
257 write_propval_int(f, p, chunk_len, 2);
260 write_propval_int(f, p, chunk_len, 4);
263 write_propval_int(f, p, chunk_len, 8);
266 write_propval_string(f, p, chunk_len);
269 write_propval_int(f, p, chunk_len, 1);
273 /* Wrap up any labels at the end of the value */
274 for_each_marker_of_type(m_label, LABEL) {
275 assert (m_label->offset == len);
276 fprintf(f, " %s:", m_label->ref);
279 fprintf(f, "%s;\n", delim_end[emit_type] ? : "");
282 static void write_tree_source_node(FILE *f, struct node *tree, int level)
284 struct property *prop;
288 write_prefix(f, level);
289 for_each_label(tree->labels, l)
290 fprintf(f, "%s: ", l->label);
291 if (tree->name && (*tree->name))
292 fprintf(f, "%s {\n", tree->name);
296 for_each_property(tree, prop) {
297 write_prefix(f, level+1);
298 for_each_label(prop->labels, l)
299 fprintf(f, "%s: ", l->label);
300 fprintf(f, "%s", prop->name);
301 write_propval(f, prop);
303 for_each_child(tree, child) {
305 write_tree_source_node(f, child, level+1);
307 write_prefix(f, level);
312 void dt_to_source(FILE *f, struct dt_info *dti)
314 struct reserve_info *re;
316 fprintf(f, "/dts-v1/;\n\n");
318 for (re = dti->reservelist; re; re = re->next) {
321 for_each_label(re->labels, l)
322 fprintf(f, "%s: ", l->label);
323 fprintf(f, "/memreserve/\t0x%016llx 0x%016llx;\n",
324 (unsigned long long)re->address,
325 (unsigned long long)re->size);
328 write_tree_source_node(f, dti->dt, 0);