]>
Commit | Line | Data |
---|---|---|
7581c01a SG |
1 | #!/usr/bin/python |
2 | # | |
3 | # Copyright (C) 2017 Google, Inc | |
4 | # Written by Simon Glass <[email protected]> | |
5 | # | |
6 | # SPDX-License-Identifier: GPL-2.0+ | |
7 | # | |
8 | ||
2be282ca SG |
9 | """Device tree to platform data class |
10 | ||
11 | This supports converting device tree data to C structures definitions and | |
12 | static data. | |
13 | """ | |
14 | ||
8fed2eb2 | 15 | import collections |
7581c01a | 16 | import copy |
2be282ca | 17 | import sys |
7581c01a SG |
18 | |
19 | import fdt | |
20 | import fdt_util | |
21 | ||
22 | # When we see these properties we ignore them - i.e. do not create a structure member | |
23 | PROP_IGNORE_LIST = [ | |
24 | '#address-cells', | |
25 | '#gpio-cells', | |
26 | '#size-cells', | |
27 | 'compatible', | |
28 | 'linux,phandle', | |
29 | "status", | |
30 | 'phandle', | |
31 | 'u-boot,dm-pre-reloc', | |
32 | 'u-boot,dm-tpl', | |
33 | 'u-boot,dm-spl', | |
34 | ] | |
35 | ||
36 | # C type declarations for the tyues we support | |
37 | TYPE_NAMES = { | |
38 | fdt.TYPE_INT: 'fdt32_t', | |
39 | fdt.TYPE_BYTE: 'unsigned char', | |
40 | fdt.TYPE_STRING: 'const char *', | |
41 | fdt.TYPE_BOOL: 'bool', | |
fbdfd228 | 42 | fdt.TYPE_INT64: 'fdt64_t', |
2be282ca | 43 | } |
7581c01a SG |
44 | |
45 | STRUCT_PREFIX = 'dtd_' | |
46 | VAL_PREFIX = 'dtv_' | |
47 | ||
8fed2eb2 SG |
48 | # This holds information about a property which includes phandles. |
49 | # | |
50 | # max_args: integer: Maximum number or arguments that any phandle uses (int). | |
51 | # args: Number of args for each phandle in the property. The total number of | |
52 | # phandles is len(args). This is a list of integers. | |
53 | PhandleInfo = collections.namedtuple('PhandleInfo', ['max_args', 'args']) | |
54 | ||
55 | ||
2be282ca | 56 | def conv_name_to_c(name): |
7581c01a SG |
57 | """Convert a device-tree name to a C identifier |
58 | ||
30107b08 SG |
59 | This uses multiple replace() calls instead of re.sub() since it is faster |
60 | (400ms for 1m calls versus 1000ms for the 're' version). | |
61 | ||
7581c01a SG |
62 | Args: |
63 | name: Name to convert | |
64 | Return: | |
65 | String containing the C version of this name | |
66 | """ | |
2be282ca SG |
67 | new = name.replace('@', '_at_') |
68 | new = new.replace('-', '_') | |
69 | new = new.replace(',', '_') | |
70 | new = new.replace('.', '_') | |
2be282ca SG |
71 | return new |
72 | ||
73 | def tab_to(num_tabs, line): | |
74 | """Append tabs to a line of text to reach a tab stop. | |
75 | ||
76 | Args: | |
77 | num_tabs: Tab stop to obtain (0 = column 0, 1 = column 8, etc.) | |
78 | line: Line of text to append to | |
79 | ||
80 | Returns: | |
81 | line with the correct number of tabs appeneded. If the line already | |
82 | extends past that tab stop then a single space is appended. | |
83 | """ | |
84 | if len(line) >= num_tabs * 8: | |
85 | return line + ' ' | |
86 | return line + '\t' * (num_tabs - len(line) // 8) | |
87 | ||
56e0bbe0 SG |
88 | def get_value(ftype, value): |
89 | """Get a value as a C expression | |
90 | ||
91 | For integers this returns a byte-swapped (little-endian) hex string | |
92 | For bytes this returns a hex string, e.g. 0x12 | |
93 | For strings this returns a literal string enclosed in quotes | |
94 | For booleans this return 'true' | |
95 | ||
96 | Args: | |
97 | type: Data type (fdt_util) | |
98 | value: Data value, as a string of bytes | |
99 | """ | |
100 | if ftype == fdt.TYPE_INT: | |
101 | return '%#x' % fdt_util.fdt32_to_cpu(value) | |
102 | elif ftype == fdt.TYPE_BYTE: | |
103 | return '%#x' % ord(value[0]) | |
104 | elif ftype == fdt.TYPE_STRING: | |
105 | return '"%s"' % value | |
106 | elif ftype == fdt.TYPE_BOOL: | |
107 | return 'true' | |
fbdfd228 SG |
108 | elif ftype == fdt.TYPE_INT64: |
109 | return '%#x' % value | |
56e0bbe0 SG |
110 | |
111 | def get_compat_name(node): | |
112 | """Get a node's first compatible string as a C identifier | |
113 | ||
114 | Args: | |
115 | node: Node object to check | |
116 | Return: | |
117 | Tuple: | |
118 | C identifier for the first compatible string | |
119 | List of C identifiers for all the other compatible strings | |
120 | (possibly empty) | |
121 | """ | |
122 | compat = node.props['compatible'].value | |
123 | aliases = [] | |
124 | if isinstance(compat, list): | |
125 | compat, aliases = compat[0], compat[1:] | |
126 | return conv_name_to_c(compat), [conv_name_to_c(a) for a in aliases] | |
127 | ||
56e0bbe0 | 128 | |
2be282ca | 129 | class DtbPlatdata(object): |
7581c01a SG |
130 | """Provide a means to convert device tree binary data to platform data |
131 | ||
132 | The output of this process is C structures which can be used in space- | |
133 | constrained encvironments where the ~3KB code overhead of device tree | |
134 | code is not affordable. | |
135 | ||
136 | Properties: | |
2be282ca | 137 | _fdt: Fdt object, referencing the device tree |
7581c01a SG |
138 | _dtb_fname: Filename of the input device tree binary file |
139 | _valid_nodes: A list of Node object with compatible strings | |
e36024b0 | 140 | _include_disabled: true to include nodes marked status = "disabled" |
7581c01a SG |
141 | _outfile: The current output file (sys.stdout or a real file) |
142 | _lines: Stashed list of output lines for outputting in the future | |
7581c01a | 143 | """ |
e36024b0 | 144 | def __init__(self, dtb_fname, include_disabled): |
2be282ca | 145 | self._fdt = None |
7581c01a SG |
146 | self._dtb_fname = dtb_fname |
147 | self._valid_nodes = None | |
e36024b0 | 148 | self._include_disabled = include_disabled |
7581c01a SG |
149 | self._outfile = None |
150 | self._lines = [] | |
151 | self._aliases = {} | |
152 | ||
2be282ca | 153 | def setup_output(self, fname): |
7581c01a SG |
154 | """Set up the output destination |
155 | ||
2be282ca | 156 | Once this is done, future calls to self.out() will output to this |
7581c01a SG |
157 | file. |
158 | ||
159 | Args: | |
160 | fname: Filename to send output to, or '-' for stdout | |
161 | """ | |
162 | if fname == '-': | |
163 | self._outfile = sys.stdout | |
164 | else: | |
165 | self._outfile = open(fname, 'w') | |
166 | ||
2be282ca | 167 | def out(self, line): |
7581c01a SG |
168 | """Output a string to the output file |
169 | ||
170 | Args: | |
2be282ca | 171 | line: String to output |
7581c01a | 172 | """ |
2be282ca | 173 | self._outfile.write(line) |
7581c01a | 174 | |
2be282ca | 175 | def buf(self, line): |
7581c01a SG |
176 | """Buffer up a string to send later |
177 | ||
178 | Args: | |
2be282ca | 179 | line: String to add to our 'buffer' list |
7581c01a | 180 | """ |
2be282ca | 181 | self._lines.append(line) |
7581c01a | 182 | |
2be282ca | 183 | def get_buf(self): |
7581c01a SG |
184 | """Get the contents of the output buffer, and clear it |
185 | ||
186 | Returns: | |
187 | The output buffer, which is then cleared for future use | |
188 | """ | |
189 | lines = self._lines | |
190 | self._lines = [] | |
191 | return lines | |
192 | ||
8fed2eb2 SG |
193 | def get_phandle_argc(self, prop, node_name): |
194 | """Check if a node contains phandles | |
2925c26b | 195 | |
8fed2eb2 SG |
196 | We have no reliable way of detecting whether a node uses a phandle |
197 | or not. As an interim measure, use a list of known property names. | |
2925c26b | 198 | |
8fed2eb2 SG |
199 | Args: |
200 | prop: Prop object to check | |
201 | Return: | |
202 | Number of argument cells is this is a phandle, else None | |
203 | """ | |
204 | if prop.name in ['clocks']: | |
205 | val = prop.value | |
206 | if not isinstance(val, list): | |
207 | val = [val] | |
208 | i = 0 | |
209 | ||
210 | max_args = 0 | |
211 | args = [] | |
212 | while i < len(val): | |
213 | phandle = fdt_util.fdt32_to_cpu(val[i]) | |
214 | target = self._fdt.phandle_to_node.get(phandle) | |
215 | if not target: | |
216 | raise ValueError("Cannot parse '%s' in node '%s'" % | |
217 | (prop.name, node_name)) | |
218 | prop_name = '#clock-cells' | |
219 | cells = target.props.get(prop_name) | |
220 | if not cells: | |
221 | raise ValueError("Node '%s' has no '%s' property" % | |
222 | (target.name, prop_name)) | |
223 | num_args = fdt_util.fdt32_to_cpu(cells.value) | |
224 | max_args = max(max_args, num_args) | |
225 | args.append(num_args) | |
226 | i += 1 + num_args | |
227 | return PhandleInfo(max_args, args) | |
228 | return None | |
2925c26b | 229 | |
2be282ca | 230 | def scan_dtb(self): |
f1a7ba1d | 231 | """Scan the device tree to obtain a tree of nodes and properties |
7581c01a | 232 | |
2be282ca | 233 | Once this is done, self._fdt.GetRoot() can be called to obtain the |
7581c01a SG |
234 | device tree root node, and progress from there. |
235 | """ | |
2be282ca SG |
236 | self._fdt = fdt.FdtScan(self._dtb_fname) |
237 | ||
238 | def scan_node(self, root): | |
239 | """Scan a node and subnodes to build a tree of node and phandle info | |
240 | ||
72ab7c5e | 241 | This adds each node to self._valid_nodes. |
7581c01a | 242 | |
2be282ca SG |
243 | Args: |
244 | root: Root node for scan | |
245 | """ | |
7581c01a SG |
246 | for node in root.subnodes: |
247 | if 'compatible' in node.props: | |
248 | status = node.props.get('status') | |
e36024b0 | 249 | if (not self._include_disabled and not status or |
2be282ca | 250 | status.value != 'disabled'): |
7581c01a | 251 | self._valid_nodes.append(node) |
7581c01a SG |
252 | |
253 | # recurse to handle any subnodes | |
2be282ca | 254 | self.scan_node(node) |
7581c01a | 255 | |
2be282ca | 256 | def scan_tree(self): |
7581c01a SG |
257 | """Scan the device tree for useful information |
258 | ||
259 | This fills in the following properties: | |
7581c01a SG |
260 | _valid_nodes: A list of nodes we wish to consider include in the |
261 | platform data | |
262 | """ | |
7581c01a | 263 | self._valid_nodes = [] |
2be282ca | 264 | return self.scan_node(self._fdt.GetRoot()) |
7581c01a | 265 | |
c20ee0ed SG |
266 | @staticmethod |
267 | def get_num_cells(node): | |
268 | """Get the number of cells in addresses and sizes for this node | |
269 | ||
270 | Args: | |
271 | node: Node to check | |
272 | ||
273 | Returns: | |
274 | Tuple: | |
275 | Number of address cells for this node | |
276 | Number of size cells for this node | |
277 | """ | |
278 | parent = node.parent | |
279 | na, ns = 2, 2 | |
280 | if parent: | |
281 | na_prop = parent.props.get('#address-cells') | |
282 | ns_prop = parent.props.get('#size-cells') | |
283 | if na_prop: | |
284 | na = fdt_util.fdt32_to_cpu(na_prop.value) | |
285 | if ns_prop: | |
286 | ns = fdt_util.fdt32_to_cpu(ns_prop.value) | |
287 | return na, ns | |
288 | ||
289 | def scan_reg_sizes(self): | |
290 | """Scan for 64-bit 'reg' properties and update the values | |
291 | ||
292 | This finds 'reg' properties with 64-bit data and converts the value to | |
293 | an array of 64-values. This allows it to be output in a way that the | |
294 | C code can read. | |
295 | """ | |
296 | for node in self._valid_nodes: | |
297 | reg = node.props.get('reg') | |
298 | if not reg: | |
299 | continue | |
300 | na, ns = self.get_num_cells(node) | |
301 | total = na + ns | |
302 | ||
303 | if reg.type != fdt.TYPE_INT: | |
304 | raise ValueError("Node '%s' reg property is not an int") | |
305 | if len(reg.value) % total: | |
306 | raise ValueError("Node '%s' reg property has %d cells " | |
307 | 'which is not a multiple of na + ns = %d + %d)' % | |
308 | (node.name, len(reg.value), na, ns)) | |
309 | reg.na = na | |
310 | reg.ns = ns | |
311 | if na != 1 or ns != 1: | |
312 | reg.type = fdt.TYPE_INT64 | |
313 | i = 0 | |
314 | new_value = [] | |
315 | val = reg.value | |
316 | if not isinstance(val, list): | |
317 | val = [val] | |
318 | while i < len(val): | |
319 | addr = fdt_util.fdt_cells_to_cpu(val[i:], reg.na) | |
320 | i += na | |
321 | size = fdt_util.fdt_cells_to_cpu(val[i:], reg.ns) | |
322 | i += ns | |
323 | new_value += [addr, size] | |
324 | reg.value = new_value | |
325 | ||
2be282ca | 326 | def scan_structs(self): |
7581c01a SG |
327 | """Scan the device tree building up the C structures we will use. |
328 | ||
329 | Build a dict keyed by C struct name containing a dict of Prop | |
330 | object for each struct field (keyed by property name). Where the | |
331 | same struct appears multiple times, try to use the 'widest' | |
332 | property, i.e. the one with a type which can express all others. | |
333 | ||
334 | Once the widest property is determined, all other properties are | |
335 | updated to match that width. | |
336 | """ | |
337 | structs = {} | |
338 | for node in self._valid_nodes: | |
56e0bbe0 | 339 | node_name, _ = get_compat_name(node) |
7581c01a SG |
340 | fields = {} |
341 | ||
342 | # Get a list of all the valid properties in this node. | |
343 | for name, prop in node.props.items(): | |
344 | if name not in PROP_IGNORE_LIST and name[0] != '#': | |
345 | fields[name] = copy.deepcopy(prop) | |
346 | ||
347 | # If we've seen this node_name before, update the existing struct. | |
348 | if node_name in structs: | |
349 | struct = structs[node_name] | |
350 | for name, prop in fields.items(): | |
351 | oldprop = struct.get(name) | |
352 | if oldprop: | |
353 | oldprop.Widen(prop) | |
354 | else: | |
355 | struct[name] = prop | |
356 | ||
357 | # Otherwise store this as a new struct. | |
358 | else: | |
359 | structs[node_name] = fields | |
360 | ||
361 | upto = 0 | |
362 | for node in self._valid_nodes: | |
56e0bbe0 | 363 | node_name, _ = get_compat_name(node) |
7581c01a SG |
364 | struct = structs[node_name] |
365 | for name, prop in node.props.items(): | |
366 | if name not in PROP_IGNORE_LIST and name[0] != '#': | |
367 | prop.Widen(struct[name]) | |
368 | upto += 1 | |
369 | ||
56e0bbe0 | 370 | struct_name, aliases = get_compat_name(node) |
7581c01a SG |
371 | for alias in aliases: |
372 | self._aliases[alias] = struct_name | |
373 | ||
374 | return structs | |
375 | ||
2be282ca | 376 | def scan_phandles(self): |
7581c01a SG |
377 | """Figure out what phandles each node uses |
378 | ||
379 | We need to be careful when outputing nodes that use phandles since | |
380 | they must come after the declaration of the phandles in the C file. | |
381 | Otherwise we get a compiler error since the phandle struct is not yet | |
382 | declared. | |
383 | ||
384 | This function adds to each node a list of phandle nodes that the node | |
385 | depends on. This allows us to output things in the right order. | |
386 | """ | |
387 | for node in self._valid_nodes: | |
388 | node.phandles = set() | |
389 | for pname, prop in node.props.items(): | |
390 | if pname in PROP_IGNORE_LIST or pname[0] == '#': | |
391 | continue | |
8fed2eb2 SG |
392 | info = self.get_phandle_argc(prop, node.name) |
393 | if info: | |
394 | if not isinstance(prop.value, list): | |
395 | prop.value = [prop.value] | |
396 | # Process the list as pairs of (phandle, id) | |
634eba4b SG |
397 | pos = 0 |
398 | for args in info.args: | |
399 | phandle_cell = prop.value[pos] | |
8fed2eb2 SG |
400 | phandle = fdt_util.fdt32_to_cpu(phandle_cell) |
401 | target_node = self._fdt.phandle_to_node[phandle] | |
402 | node.phandles.add(target_node) | |
634eba4b | 403 | pos += 1 + args |
7581c01a SG |
404 | |
405 | ||
2be282ca | 406 | def generate_structs(self, structs): |
7581c01a SG |
407 | """Generate struct defintions for the platform data |
408 | ||
409 | This writes out the body of a header file consisting of structure | |
410 | definitions for node in self._valid_nodes. See the documentation in | |
411 | README.of-plat for more information. | |
412 | """ | |
2be282ca SG |
413 | self.out('#include <stdbool.h>\n') |
414 | self.out('#include <libfdt.h>\n') | |
7581c01a SG |
415 | |
416 | # Output the struct definition | |
417 | for name in sorted(structs): | |
2be282ca | 418 | self.out('struct %s%s {\n' % (STRUCT_PREFIX, name)) |
7581c01a SG |
419 | for pname in sorted(structs[name]): |
420 | prop = structs[name][pname] | |
8fed2eb2 SG |
421 | info = self.get_phandle_argc(prop, structs[name]) |
422 | if info: | |
7581c01a | 423 | # For phandles, include a reference to the target |
0d15463c SG |
424 | struct_name = 'struct phandle_%d_arg' % info.max_args |
425 | self.out('\t%s%s[%d]' % (tab_to(2, struct_name), | |
2be282ca | 426 | conv_name_to_c(prop.name), |
634eba4b | 427 | len(info.args))) |
7581c01a SG |
428 | else: |
429 | ptype = TYPE_NAMES[prop.type] | |
2be282ca SG |
430 | self.out('\t%s%s' % (tab_to(2, ptype), |
431 | conv_name_to_c(prop.name))) | |
432 | if isinstance(prop.value, list): | |
433 | self.out('[%d]' % len(prop.value)) | |
434 | self.out(';\n') | |
435 | self.out('};\n') | |
7581c01a SG |
436 | |
437 | for alias, struct_name in self._aliases.iteritems(): | |
2be282ca | 438 | self.out('#define %s%s %s%s\n'% (STRUCT_PREFIX, alias, |
7581c01a SG |
439 | STRUCT_PREFIX, struct_name)) |
440 | ||
2be282ca | 441 | def output_node(self, node): |
7581c01a SG |
442 | """Output the C code for a node |
443 | ||
444 | Args: | |
445 | node: node to output | |
446 | """ | |
56e0bbe0 | 447 | struct_name, _ = get_compat_name(node) |
2be282ca SG |
448 | var_name = conv_name_to_c(node.name) |
449 | self.buf('static struct %s%s %s%s = {\n' % | |
450 | (STRUCT_PREFIX, struct_name, VAL_PREFIX, var_name)) | |
7581c01a SG |
451 | for pname, prop in node.props.items(): |
452 | if pname in PROP_IGNORE_LIST or pname[0] == '#': | |
453 | continue | |
2be282ca SG |
454 | member_name = conv_name_to_c(prop.name) |
455 | self.buf('\t%s= ' % tab_to(3, '.' + member_name)) | |
7581c01a SG |
456 | |
457 | # Special handling for lists | |
2be282ca SG |
458 | if isinstance(prop.value, list): |
459 | self.buf('{') | |
7581c01a SG |
460 | vals = [] |
461 | # For phandles, output a reference to the platform data | |
462 | # of the target node. | |
8fed2eb2 SG |
463 | info = self.get_phandle_argc(prop, node.name) |
464 | if info: | |
7581c01a | 465 | # Process the list as pairs of (phandle, id) |
634eba4b SG |
466 | pos = 0 |
467 | for args in info.args: | |
468 | phandle_cell = prop.value[pos] | |
7581c01a | 469 | phandle = fdt_util.fdt32_to_cpu(phandle_cell) |
72ab7c5e | 470 | target_node = self._fdt.phandle_to_node[phandle] |
2be282ca | 471 | name = conv_name_to_c(target_node.name) |
634eba4b SG |
472 | arg_values = [] |
473 | for i in range(args): | |
474 | arg_values.append(str(fdt_util.fdt32_to_cpu(prop.value[pos + 1 + i]))) | |
475 | pos += 1 + args | |
476 | vals.append('\t{&%s%s, {%s}}' % (VAL_PREFIX, name, | |
477 | ', '.join(arg_values))) | |
35d50370 SG |
478 | for val in vals: |
479 | self.buf('\n\t\t%s,' % val) | |
7581c01a SG |
480 | else: |
481 | for val in prop.value: | |
56e0bbe0 | 482 | vals.append(get_value(prop.type, val)) |
21d54ac3 | 483 | |
35d50370 SG |
484 | # Put 8 values per line to avoid very long lines. |
485 | for i in xrange(0, len(vals), 8): | |
486 | if i: | |
487 | self.buf(',\n\t\t') | |
488 | self.buf(', '.join(vals[i:i + 8])) | |
2be282ca | 489 | self.buf('}') |
7581c01a | 490 | else: |
56e0bbe0 | 491 | self.buf(get_value(prop.type, prop.value)) |
2be282ca SG |
492 | self.buf(',\n') |
493 | self.buf('};\n') | |
7581c01a SG |
494 | |
495 | # Add a device declaration | |
2be282ca SG |
496 | self.buf('U_BOOT_DEVICE(%s) = {\n' % var_name) |
497 | self.buf('\t.name\t\t= "%s",\n' % struct_name) | |
498 | self.buf('\t.platdata\t= &%s%s,\n' % (VAL_PREFIX, var_name)) | |
499 | self.buf('\t.platdata_size\t= sizeof(%s%s),\n' % (VAL_PREFIX, var_name)) | |
500 | self.buf('};\n') | |
501 | self.buf('\n') | |
7581c01a | 502 | |
2be282ca | 503 | self.out(''.join(self.get_buf())) |
7581c01a | 504 | |
2be282ca | 505 | def generate_tables(self): |
7581c01a SG |
506 | """Generate device defintions for the platform data |
507 | ||
508 | This writes out C platform data initialisation data and | |
509 | U_BOOT_DEVICE() declarations for each valid node. Where a node has | |
510 | multiple compatible strings, a #define is used to make them equivalent. | |
511 | ||
512 | See the documentation in doc/driver-model/of-plat.txt for more | |
513 | information. | |
514 | """ | |
2be282ca SG |
515 | self.out('#include <common.h>\n') |
516 | self.out('#include <dm.h>\n') | |
517 | self.out('#include <dt-structs.h>\n') | |
518 | self.out('\n') | |
7581c01a SG |
519 | nodes_to_output = list(self._valid_nodes) |
520 | ||
521 | # Keep outputing nodes until there is none left | |
522 | while nodes_to_output: | |
523 | node = nodes_to_output[0] | |
524 | # Output all the node's dependencies first | |
525 | for req_node in node.phandles: | |
526 | if req_node in nodes_to_output: | |
2be282ca | 527 | self.output_node(req_node) |
7581c01a | 528 | nodes_to_output.remove(req_node) |
2be282ca | 529 | self.output_node(node) |
7581c01a | 530 | nodes_to_output.remove(node) |
fa0ea5b0 SG |
531 | |
532 | ||
533 | def run_steps(args, dtb_file, include_disabled, output): | |
534 | """Run all the steps of the dtoc tool | |
535 | ||
536 | Args: | |
537 | args: List of non-option arguments provided to the problem | |
538 | dtb_file: Filename of dtb file to process | |
539 | include_disabled: True to include disabled nodes | |
540 | output: Name of output file | |
541 | """ | |
542 | if not args: | |
543 | raise ValueError('Please specify a command: struct, platdata') | |
544 | ||
545 | plat = DtbPlatdata(dtb_file, include_disabled) | |
546 | plat.scan_dtb() | |
547 | plat.scan_tree() | |
c20ee0ed | 548 | plat.scan_reg_sizes() |
fa0ea5b0 SG |
549 | plat.setup_output(output) |
550 | structs = plat.scan_structs() | |
551 | plat.scan_phandles() | |
552 | ||
553 | for cmd in args[0].split(','): | |
554 | if cmd == 'struct': | |
555 | plat.generate_structs(structs) | |
556 | elif cmd == 'platdata': | |
557 | plat.generate_tables() | |
558 | else: | |
559 | raise ValueError("Unknown command '%s': (use: struct, platdata)" % | |
560 | cmd) |