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);
27 struct boot_info *the_boot_info;
30 struct boot_info *dt_from_source(const char *fname)
35 srcpos_file = dtc_open_file(fname, NULL);
36 yyin = srcpos_file->file;
39 die("Unable to parse input tree\n");
42 die("Syntax error parsing input tree\n");
47 static void write_prefix(FILE *f, int level)
51 for (i = 0; i < level; i++)
59 || strchr("\a\b\t\n\v\f\r", c));
62 static void write_propval_string(FILE *f, struct data val)
64 const char *str = val.val;
67 struct marker *m = val.markers;
69 assert(str[val.len-1] == '\0');
71 for (i = 0; i < (val.len-1); i++) {
75 while (m && (m->offset <= i)) {
76 if (m->type == LABEL) {
77 assert(m->offset == i);
78 fprintf(f, "%s: ", m->ref);
122 fprintf(f, "\\x%02hhx", c);
127 /* Wrap up any labels at the end of the value */
128 for_each_marker_of_type(m, LABEL) {
129 assert (m->offset == val.len);
130 fprintf(f, " %s:", m->ref);
134 static void write_propval_cells(FILE *f, struct data val)
136 void *propend = val.val + val.len;
137 cell_t *cp = (cell_t *)val.val;
138 struct marker *m = val.markers;
142 while (m && (m->offset <= ((char *)cp - val.val))) {
143 if (m->type == LABEL) {
144 assert(m->offset == ((char *)cp - val.val));
145 fprintf(f, "%s: ", m->ref);
150 fprintf(f, "0x%x", fdt32_to_cpu(*cp++));
151 if ((void *)cp >= propend)
156 /* Wrap up any labels at the end of the value */
157 for_each_marker_of_type(m, LABEL) {
158 assert (m->offset == val.len);
159 fprintf(f, " %s:", m->ref);
164 static void write_propval_bytes(FILE *f, struct data val)
166 void *propend = val.val + val.len;
167 const char *bp = val.val;
168 struct marker *m = val.markers;
172 while (m && (m->offset == (bp-val.val))) {
173 if (m->type == LABEL)
174 fprintf(f, "%s: ", m->ref);
178 fprintf(f, "%02hhx", *bp++);
179 if ((const void *)bp >= propend)
184 /* Wrap up any labels at the end of the value */
185 for_each_marker_of_type(m, LABEL) {
186 assert (m->offset == val.len);
187 fprintf(f, " %s:", m->ref);
192 static void write_propval(FILE *f, struct property *prop)
194 int len = prop->val.len;
195 const char *p = prop->val.val;
196 struct marker *m = prop->val.markers;
197 int nnotstring = 0, nnul = 0;
198 int nnotstringlbl = 0, nnotcelllbl = 0;
206 for (i = 0; i < len; i++) {
207 if (! isstring(p[i]))
213 for_each_marker_of_type(m, LABEL) {
214 if ((m->offset > 0) && (prop->val.val[m->offset - 1] != '\0'))
216 if ((m->offset % sizeof(cell_t)) != 0)
221 if ((p[len-1] == '\0') && (nnotstring == 0) && (nnul < (len-nnul))
222 && (nnotstringlbl == 0)) {
223 write_propval_string(f, prop->val);
224 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {
225 write_propval_cells(f, prop->val);
227 write_propval_bytes(f, prop->val);
233 static void write_tree_source_node(FILE *f, struct node *tree, int level)
235 struct property *prop;
238 write_prefix(f, level);
240 fprintf(f, "%s: ", tree->label);
241 if (tree->name && (*tree->name))
242 fprintf(f, "%s {\n", tree->name);
246 for_each_property(tree, prop) {
247 write_prefix(f, level+1);
249 fprintf(f, "%s: ", prop->label);
250 fprintf(f, "%s", prop->name);
251 write_propval(f, prop);
253 for_each_child(tree, child) {
255 write_tree_source_node(f, child, level+1);
257 write_prefix(f, level);
262 void dt_to_source(FILE *f, struct boot_info *bi)
264 struct reserve_info *re;
266 fprintf(f, "/dts-v1/;\n\n");
268 for (re = bi->reservelist; re; re = re->next) {
270 fprintf(f, "%s: ", re->label);
271 fprintf(f, "/memreserve/\t0x%016llx 0x%016llx;\n",
272 (unsigned long long)re->re.address,
273 (unsigned long long)re->re.size);
276 write_tree_source_node(f, bi->dt, 0);