Loading...
1/*
2 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
3 *
4 *
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.
9 *
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.
14 *
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
18 * USA
19 */
20
21#include "dtc.h"
22#include "srcpos.h"
23
24extern FILE *yyin;
25extern int yyparse(void);
26extern YYLTYPE yylloc;
27
28struct boot_info *the_boot_info;
29bool treesource_error;
30
31struct boot_info *dt_from_source(const char *fname)
32{
33 the_boot_info = NULL;
34 treesource_error = false;
35
36 srcfile_push(fname);
37 yyin = current_srcfile->f;
38 yylloc.file = current_srcfile;
39
40 if (yyparse() != 0)
41 die("Unable to parse input tree\n");
42
43 if (treesource_error)
44 die("Syntax error parsing input tree\n");
45
46 return the_boot_info;
47}
48
49static void write_prefix(FILE *f, int level)
50{
51 int i;
52
53 for (i = 0; i < level; i++)
54 fputc('\t', f);
55}
56
57static bool isstring(char c)
58{
59 return (isprint((unsigned char)c)
60 || (c == '\0')
61 || strchr("\a\b\t\n\v\f\r", c));
62}
63
64static void write_propval_string(FILE *f, struct data val)
65{
66 const char *str = val.val;
67 int i;
68 struct marker *m = val.markers;
69
70 assert(str[val.len-1] == '\0');
71
72 while (m && (m->offset == 0)) {
73 if (m->type == LABEL)
74 fprintf(f, "%s: ", m->ref);
75 m = m->next;
76 }
77 fprintf(f, "\"");
78
79 for (i = 0; i < (val.len-1); i++) {
80 char c = str[i];
81
82 switch (c) {
83 case '\a':
84 fprintf(f, "\\a");
85 break;
86 case '\b':
87 fprintf(f, "\\b");
88 break;
89 case '\t':
90 fprintf(f, "\\t");
91 break;
92 case '\n':
93 fprintf(f, "\\n");
94 break;
95 case '\v':
96 fprintf(f, "\\v");
97 break;
98 case '\f':
99 fprintf(f, "\\f");
100 break;
101 case '\r':
102 fprintf(f, "\\r");
103 break;
104 case '\\':
105 fprintf(f, "\\\\");
106 break;
107 case '\"':
108 fprintf(f, "\\\"");
109 break;
110 case '\0':
111 fprintf(f, "\", ");
112 while (m && (m->offset <= (i + 1))) {
113 if (m->type == LABEL) {
114 assert(m->offset == (i+1));
115 fprintf(f, "%s: ", m->ref);
116 }
117 m = m->next;
118 }
119 fprintf(f, "\"");
120 break;
121 default:
122 if (isprint((unsigned char)c))
123 fprintf(f, "%c", c);
124 else
125 fprintf(f, "\\x%02hhx", c);
126 }
127 }
128 fprintf(f, "\"");
129
130 /* Wrap up any labels at the end of the value */
131 for_each_marker_of_type(m, LABEL) {
132 assert (m->offset == val.len);
133 fprintf(f, " %s:", m->ref);
134 }
135}
136
137static void write_propval_cells(FILE *f, struct data val)
138{
139 void *propend = val.val + val.len;
140 cell_t *cp = (cell_t *)val.val;
141 struct marker *m = val.markers;
142
143 fprintf(f, "<");
144 for (;;) {
145 while (m && (m->offset <= ((char *)cp - val.val))) {
146 if (m->type == LABEL) {
147 assert(m->offset == ((char *)cp - val.val));
148 fprintf(f, "%s: ", m->ref);
149 }
150 m = m->next;
151 }
152
153 fprintf(f, "0x%x", fdt32_to_cpu(*cp++));
154 if ((void *)cp >= propend)
155 break;
156 fprintf(f, " ");
157 }
158
159 /* Wrap up any labels at the end of the value */
160 for_each_marker_of_type(m, LABEL) {
161 assert (m->offset == val.len);
162 fprintf(f, " %s:", m->ref);
163 }
164 fprintf(f, ">");
165}
166
167static void write_propval_bytes(FILE *f, struct data val)
168{
169 void *propend = val.val + val.len;
170 const char *bp = val.val;
171 struct marker *m = val.markers;
172
173 fprintf(f, "[");
174 for (;;) {
175 while (m && (m->offset == (bp-val.val))) {
176 if (m->type == LABEL)
177 fprintf(f, "%s: ", m->ref);
178 m = m->next;
179 }
180
181 fprintf(f, "%02hhx", (unsigned char)(*bp++));
182 if ((const void *)bp >= propend)
183 break;
184 fprintf(f, " ");
185 }
186
187 /* Wrap up any labels at the end of the value */
188 for_each_marker_of_type(m, LABEL) {
189 assert (m->offset == val.len);
190 fprintf(f, " %s:", m->ref);
191 }
192 fprintf(f, "]");
193}
194
195static void write_propval(FILE *f, struct property *prop)
196{
197 int len = prop->val.len;
198 const char *p = prop->val.val;
199 struct marker *m = prop->val.markers;
200 int nnotstring = 0, nnul = 0;
201 int nnotstringlbl = 0, nnotcelllbl = 0;
202 int i;
203
204 if (len == 0) {
205 fprintf(f, ";\n");
206 return;
207 }
208
209 for (i = 0; i < len; i++) {
210 if (! isstring(p[i]))
211 nnotstring++;
212 if (p[i] == '\0')
213 nnul++;
214 }
215
216 for_each_marker_of_type(m, LABEL) {
217 if ((m->offset > 0) && (prop->val.val[m->offset - 1] != '\0'))
218 nnotstringlbl++;
219 if ((m->offset % sizeof(cell_t)) != 0)
220 nnotcelllbl++;
221 }
222
223 fprintf(f, " = ");
224 if ((p[len-1] == '\0') && (nnotstring == 0) && (nnul < (len-nnul))
225 && (nnotstringlbl == 0)) {
226 write_propval_string(f, prop->val);
227 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {
228 write_propval_cells(f, prop->val);
229 } else {
230 write_propval_bytes(f, prop->val);
231 }
232
233 fprintf(f, ";\n");
234}
235
236static void write_tree_source_node(FILE *f, struct node *tree, int level)
237{
238 struct property *prop;
239 struct node *child;
240 struct label *l;
241
242 write_prefix(f, level);
243 for_each_label(tree->labels, l)
244 fprintf(f, "%s: ", l->label);
245 if (tree->name && (*tree->name))
246 fprintf(f, "%s {\n", tree->name);
247 else
248 fprintf(f, "/ {\n");
249
250 for_each_property(tree, prop) {
251 write_prefix(f, level+1);
252 for_each_label(prop->labels, l)
253 fprintf(f, "%s: ", l->label);
254 fprintf(f, "%s", prop->name);
255 write_propval(f, prop);
256 }
257 for_each_child(tree, child) {
258 fprintf(f, "\n");
259 write_tree_source_node(f, child, level+1);
260 }
261 write_prefix(f, level);
262 fprintf(f, "};\n");
263}
264
265
266void dt_to_source(FILE *f, struct boot_info *bi)
267{
268 struct reserve_info *re;
269
270 fprintf(f, "/dts-v1/;\n\n");
271
272 for (re = bi->reservelist; re; re = re->next) {
273 struct label *l;
274
275 for_each_label(re->labels, l)
276 fprintf(f, "%s: ", l->label);
277 fprintf(f, "/memreserve/\t0x%016llx 0x%016llx;\n",
278 (unsigned long long)re->re.address,
279 (unsigned long long)re->re.size);
280 }
281
282 write_tree_source_node(f, bi->dt, 0);
283}
284
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
4 */
5
6#include "dtc.h"
7#include "srcpos.h"
8
9extern FILE *yyin;
10extern int yyparse(void);
11extern YYLTYPE yylloc;
12
13struct dt_info *parser_output;
14bool treesource_error;
15
16struct dt_info *dt_from_source(const char *fname)
17{
18 parser_output = NULL;
19 treesource_error = false;
20
21 srcfile_push(fname);
22 yyin = current_srcfile->f;
23 yylloc.file = current_srcfile;
24
25 if (yyparse() != 0)
26 die("Unable to parse input tree\n");
27
28 if (treesource_error)
29 die("Syntax error parsing input tree\n");
30
31 return parser_output;
32}
33
34static void write_prefix(FILE *f, int level)
35{
36 int i;
37
38 for (i = 0; i < level; i++)
39 fputc('\t', f);
40}
41
42static bool isstring(char c)
43{
44 return (isprint((unsigned char)c)
45 || (c == '\0')
46 || strchr("\a\b\t\n\v\f\r", c));
47}
48
49static void write_propval_string(FILE *f, const char *s, size_t len)
50{
51 const char *end = s + len - 1;
52
53 if (!len)
54 return;
55
56 assert(*end == '\0');
57
58 fprintf(f, "\"");
59 while (s < end) {
60 char c = *s++;
61 switch (c) {
62 case '\a':
63 fprintf(f, "\\a");
64 break;
65 case '\b':
66 fprintf(f, "\\b");
67 break;
68 case '\t':
69 fprintf(f, "\\t");
70 break;
71 case '\n':
72 fprintf(f, "\\n");
73 break;
74 case '\v':
75 fprintf(f, "\\v");
76 break;
77 case '\f':
78 fprintf(f, "\\f");
79 break;
80 case '\r':
81 fprintf(f, "\\r");
82 break;
83 case '\\':
84 fprintf(f, "\\\\");
85 break;
86 case '\"':
87 fprintf(f, "\\\"");
88 break;
89 case '\0':
90 fprintf(f, "\\0");
91 break;
92 default:
93 if (isprint((unsigned char)c))
94 fprintf(f, "%c", c);
95 else
96 fprintf(f, "\\x%02"PRIx8, c);
97 }
98 }
99 fprintf(f, "\"");
100}
101
102static void write_propval_int(FILE *f, const char *p, size_t len, size_t width)
103{
104 const char *end = p + len;
105 assert(len % width == 0);
106
107 for (; p < end; p += width) {
108 switch (width) {
109 case 1:
110 fprintf(f, "%02"PRIx8, *(const uint8_t*)p);
111 break;
112 case 2:
113 fprintf(f, "0x%02"PRIx16, dtb_ld16(p));
114 break;
115 case 4:
116 fprintf(f, "0x%02"PRIx32, dtb_ld32(p));
117 break;
118 case 8:
119 fprintf(f, "0x%02"PRIx64, dtb_ld64(p));
120 break;
121 }
122 if (p + width < end)
123 fputc(' ', f);
124 }
125}
126
127static const char *delim_start[] = {
128 [TYPE_UINT8] = "[",
129 [TYPE_UINT16] = "/bits/ 16 <",
130 [TYPE_UINT32] = "<",
131 [TYPE_UINT64] = "/bits/ 64 <",
132 [TYPE_STRING] = "",
133};
134static const char *delim_end[] = {
135 [TYPE_UINT8] = "]",
136 [TYPE_UINT16] = ">",
137 [TYPE_UINT32] = ">",
138 [TYPE_UINT64] = ">",
139 [TYPE_STRING] = "",
140};
141
142static enum markertype guess_value_type(struct property *prop)
143{
144 int len = prop->val.len;
145 const char *p = prop->val.val;
146 struct marker *m = prop->val.markers;
147 int nnotstring = 0, nnul = 0;
148 int nnotstringlbl = 0, nnotcelllbl = 0;
149 int i;
150
151 for (i = 0; i < len; i++) {
152 if (! isstring(p[i]))
153 nnotstring++;
154 if (p[i] == '\0')
155 nnul++;
156 }
157
158 for_each_marker_of_type(m, LABEL) {
159 if ((m->offset > 0) && (prop->val.val[m->offset - 1] != '\0'))
160 nnotstringlbl++;
161 if ((m->offset % sizeof(cell_t)) != 0)
162 nnotcelllbl++;
163 }
164
165 if ((p[len-1] == '\0') && (nnotstring == 0) && (nnul <= (len-nnul))
166 && (nnotstringlbl == 0)) {
167 return TYPE_STRING;
168 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {
169 return TYPE_UINT32;
170 }
171
172 return TYPE_UINT8;
173}
174
175static void write_propval(FILE *f, struct property *prop)
176{
177 size_t len = prop->val.len;
178 struct marker *m = prop->val.markers;
179 struct marker dummy_marker;
180 enum markertype emit_type = TYPE_NONE;
181 char *srcstr;
182
183 if (len == 0) {
184 fprintf(f, ";");
185 if (annotate) {
186 srcstr = srcpos_string_first(prop->srcpos, annotate);
187 if (srcstr) {
188 fprintf(f, " /* %s */", srcstr);
189 free(srcstr);
190 }
191 }
192 fprintf(f, "\n");
193 return;
194 }
195
196 fprintf(f, " =");
197
198 if (!next_type_marker(m)) {
199 /* data type information missing, need to guess */
200 dummy_marker.type = guess_value_type(prop);
201 dummy_marker.next = prop->val.markers;
202 dummy_marker.offset = 0;
203 dummy_marker.ref = NULL;
204 m = &dummy_marker;
205 }
206
207 for_each_marker(m) {
208 size_t chunk_len = (m->next ? m->next->offset : len) - m->offset;
209 size_t data_len = type_marker_length(m) ? : len - m->offset;
210 const char *p = &prop->val.val[m->offset];
211 struct marker *m_phandle;
212
213 if (is_type_marker(m->type)) {
214 emit_type = m->type;
215 fprintf(f, " %s", delim_start[emit_type]);
216 } else if (m->type == LABEL)
217 fprintf(f, " %s:", m->ref);
218
219 if (emit_type == TYPE_NONE || chunk_len == 0)
220 continue;
221
222 switch(emit_type) {
223 case TYPE_UINT16:
224 write_propval_int(f, p, chunk_len, 2);
225 break;
226 case TYPE_UINT32:
227 m_phandle = prop->val.markers;
228 for_each_marker_of_type(m_phandle, REF_PHANDLE)
229 if (m->offset == m_phandle->offset)
230 break;
231
232 if (m_phandle) {
233 if (m_phandle->ref[0] == '/')
234 fprintf(f, "&{%s}", m_phandle->ref);
235 else
236 fprintf(f, "&%s", m_phandle->ref);
237 if (chunk_len > 4) {
238 fputc(' ', f);
239 write_propval_int(f, p + 4, chunk_len - 4, 4);
240 }
241 } else {
242 write_propval_int(f, p, chunk_len, 4);
243 }
244 break;
245 case TYPE_UINT64:
246 write_propval_int(f, p, chunk_len, 8);
247 break;
248 case TYPE_STRING:
249 write_propval_string(f, p, chunk_len);
250 break;
251 default:
252 write_propval_int(f, p, chunk_len, 1);
253 }
254
255 if (chunk_len == data_len) {
256 size_t pos = m->offset + chunk_len;
257 fprintf(f, pos == len ? "%s" : "%s,",
258 delim_end[emit_type] ? : "");
259 emit_type = TYPE_NONE;
260 }
261 }
262 fprintf(f, ";");
263 if (annotate) {
264 srcstr = srcpos_string_first(prop->srcpos, annotate);
265 if (srcstr) {
266 fprintf(f, " /* %s */", srcstr);
267 free(srcstr);
268 }
269 }
270 fprintf(f, "\n");
271}
272
273static void write_tree_source_node(FILE *f, struct node *tree, int level)
274{
275 struct property *prop;
276 struct node *child;
277 struct label *l;
278 char *srcstr;
279
280 write_prefix(f, level);
281 for_each_label(tree->labels, l)
282 fprintf(f, "%s: ", l->label);
283 if (tree->name && (*tree->name))
284 fprintf(f, "%s {", tree->name);
285 else
286 fprintf(f, "/ {");
287
288 if (annotate) {
289 srcstr = srcpos_string_first(tree->srcpos, annotate);
290 if (srcstr) {
291 fprintf(f, " /* %s */", srcstr);
292 free(srcstr);
293 }
294 }
295 fprintf(f, "\n");
296
297 for_each_property(tree, prop) {
298 write_prefix(f, level+1);
299 for_each_label(prop->labels, l)
300 fprintf(f, "%s: ", l->label);
301 fprintf(f, "%s", prop->name);
302 write_propval(f, prop);
303 }
304 for_each_child(tree, child) {
305 fprintf(f, "\n");
306 write_tree_source_node(f, child, level+1);
307 }
308 write_prefix(f, level);
309 fprintf(f, "};");
310 if (annotate) {
311 srcstr = srcpos_string_last(tree->srcpos, annotate);
312 if (srcstr) {
313 fprintf(f, " /* %s */", srcstr);
314 free(srcstr);
315 }
316 }
317 fprintf(f, "\n");
318}
319
320void dt_to_source(FILE *f, struct dt_info *dti)
321{
322 struct reserve_info *re;
323
324 fprintf(f, "/dts-v1/;\n\n");
325
326 for (re = dti->reservelist; re; re = re->next) {
327 struct label *l;
328
329 for_each_label(re->labels, l)
330 fprintf(f, "%s: ", l->label);
331 fprintf(f, "/memreserve/\t0x%016llx 0x%016llx;\n",
332 (unsigned long long)re->address,
333 (unsigned long long)re->size);
334 }
335
336 write_tree_source_node(f, dti->dt, 0);
337}