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 void yyerror(char const *);
28 struct boot_info *the_boot_info;
30 struct boot_info *dt_from_source(const char *fname)
34 push_input_file(fname);
39 fill_fullpaths(the_boot_info->dt, "");
44 static void write_prefix(FILE *f, int level)
48 for (i = 0; i < level; i++)
56 || strchr("\a\b\t\n\v\f\r", c));
59 static void write_propval_string(FILE *f, struct data val)
61 const char *str = val.val;
64 struct marker *m = val.markers;
66 assert(str[val.len-1] == '\0');
68 for (i = 0; i < (val.len-1); i++) {
72 while (m && (m->offset <= i)) {
73 if (m->type == LABEL) {
74 assert(m->offset == i);
75 fprintf(f, "%s: ", m->ref);
119 fprintf(f, "\\x%02hhx", c);
124 /* Wrap up any labels at the end of the value */
125 for_each_marker_of_type(m, LABEL) {
126 assert (m->offset == val.len);
127 fprintf(f, " %s:", m->ref);
131 static void write_propval_cells(FILE *f, struct data val)
133 void *propend = val.val + val.len;
134 cell_t *cp = (cell_t *)val.val;
135 struct marker *m = val.markers;
139 while (m && (m->offset <= ((char *)cp - val.val))) {
140 if (m->type == LABEL) {
141 assert(m->offset == ((char *)cp - val.val));
142 fprintf(f, "%s: ", m->ref);
147 fprintf(f, "0x%x", be32_to_cpu(*cp++));
148 if ((void *)cp >= propend)
153 /* Wrap up any labels at the end of the value */
154 for_each_marker_of_type(m, LABEL) {
155 assert (m->offset == val.len);
156 fprintf(f, " %s:", m->ref);
161 static void write_propval_bytes(FILE *f, struct data val)
163 void *propend = val.val + val.len;
164 const char *bp = val.val;
165 struct marker *m = val.markers;
169 while (m && (m->offset == (bp-val.val))) {
170 if (m->type == LABEL)
171 fprintf(f, "%s: ", m->ref);
175 fprintf(f, "%02hhx", *bp++);
176 if ((void *)bp >= propend)
181 /* Wrap up any labels at the end of the value */
182 for_each_marker_of_type(m, LABEL) {
183 assert (m->offset == val.len);
184 fprintf(f, " %s:", m->ref);
189 static void write_propval(FILE *f, struct property *prop)
191 int len = prop->val.len;
192 const char *p = prop->val.val;
193 struct marker *m = prop->val.markers;
194 int nnotstring = 0, nnul = 0;
195 int nnotstringlbl = 0, nnotcelllbl = 0;
203 for (i = 0; i < len; i++) {
204 if (! isstring(p[i]))
210 for_each_marker_of_type(m, LABEL) {
211 if ((m->offset > 0) && (prop->val.val[m->offset - 1] != '\0'))
213 if ((m->offset % sizeof(cell_t)) != 0)
218 if ((p[len-1] == '\0') && (nnotstring == 0) && (nnul < (len-nnul))
219 && (nnotstringlbl == 0)) {
220 write_propval_string(f, prop->val);
221 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {
222 write_propval_cells(f, prop->val);
224 write_propval_bytes(f, prop->val);
230 static void write_tree_source_node(FILE *f, struct node *tree, int level)
232 struct property *prop;
235 write_prefix(f, level);
237 fprintf(f, "%s: ", tree->label);
238 if (tree->name && (*tree->name))
239 fprintf(f, "%s {\n", tree->name);
243 for_each_property(tree, prop) {
244 write_prefix(f, level+1);
246 fprintf(f, "%s: ", prop->label);
247 fprintf(f, "%s", prop->name);
248 write_propval(f, prop);
250 for_each_child(tree, child) {
252 write_tree_source_node(f, child, level+1);
254 write_prefix(f, level);
259 void dt_to_source(FILE *f, struct boot_info *bi)
261 struct reserve_info *re;
263 fprintf(f, "/dts-v1/;\n\n");
265 for (re = bi->reservelist; re; re = re->next) {
267 fprintf(f, "%s: ", re->label);
268 fprintf(f, "/memreserve/\t0x%016llx 0x%016llx;\n",
269 (unsigned long long)re->re.address,
270 (unsigned long long)re->re.size);
273 write_tree_source_node(f, bi->dt, 0);