blob: 8eecce59d1059a4f78564d216f0c2da91bc25537 [file] [log] [blame]
Simon Glass4984de22017-05-17 17:18:10 -06001/*
2 * Copyright (c) 2017 Google, Inc
3 * Written by Simon Glass <sjg@chromium.org>
4 *
5 * SPDX-License-Identifier: GPL-2.0+
6 */
7
8#ifndef _DM_OFNODE_H
9#define _DM_OFNODE_H
10
Simon Glass9e512042017-05-18 20:08:58 -060011/* TODO(sjg@chromium.org): Drop fdtdec.h include */
12#include <fdtdec.h>
13#include <dm/of.h>
14
15/* Enable checks to protect against invalid calls */
16#undef OF_CHECKS
17
Simon Glass4984de22017-05-17 17:18:10 -060018/**
19 * ofnode - reference to a device tree node
20 *
21 * This union can hold either a straightforward pointer to a struct device_node
22 * in the live device tree, or an offset within the flat device tree. In the
23 * latter case, the pointer value is just the integer offset within the flat DT.
24 *
25 * Thus we can reference nodes in both the live tree (once available) and the
26 * flat tree (until then). Functions are available to translate between an
27 * ofnode and either an offset or a struct device_node *.
28 *
29 * The reference can also hold a null offset, in which case the pointer value
Simon Glass9e512042017-05-18 20:08:58 -060030 * here is NULL. This corresponds to a struct device_node * value of
Simon Glass4984de22017-05-17 17:18:10 -060031 * NULL, or an offset of -1.
32 *
33 * There is no ambiguity as to whether ofnode holds an offset or a node
34 * pointer: when the live tree is active it holds a node pointer, otherwise it
35 * holds an offset. The value itself does not need to be unique and in theory
36 * the same value could point to a valid device node or a valid offset. We
37 * could arrange for a unique value to be used (e.g. by making the pointer
38 * point to an offset within the flat device tree in the case of an offset) but
39 * this increases code size slightly due to the subtraction. Since it offers no
40 * real benefit, the approach described here seems best.
41 *
42 * For now these points use constant types, since we don't allow writing
43 * the DT.
44 *
45 * @np: Pointer to device node, used for live tree
46 * @flat_ptr: Pointer into flat device tree, used for flat tree. Note that this
47 * is not a really a pointer to a node: it is an offset value. See above.
48 */
49typedef union ofnode_union {
50 const struct device_node *np; /* will be used for future live tree */
51 long of_offset;
52} ofnode;
53
Simon Glass9e512042017-05-18 20:08:58 -060054struct ofnode_phandle_args {
55 ofnode node;
56 int args_count;
57 uint32_t args[OF_MAX_PHANDLE_ARGS];
58};
59
60/**
61 * _ofnode_to_np() - convert an ofnode to a live DT node pointer
62 *
63 * This cannot be called if the reference contains an offset.
64 *
65 * @node: Reference containing struct device_node * (possibly invalid)
66 * @return pointer to device node (can be NULL)
67 */
68static inline const struct device_node *ofnode_to_np(ofnode node)
69{
70#ifdef OF_CHECKS
71 if (!of_live_active())
72 return NULL;
73#endif
74 return node.np;
75}
76
Simon Glass4984de22017-05-17 17:18:10 -060077/**
78 * ofnode_to_offset() - convert an ofnode to a flat DT offset
79 *
80 * This cannot be called if the reference contains a node pointer.
81 *
82 * @node: Reference containing offset (possibly invalid)
83 * @return DT offset (can be -1)
84 */
85static inline int ofnode_to_offset(ofnode node)
86{
Simon Glass9e512042017-05-18 20:08:58 -060087#ifdef OF_CHECKS
88 if (of_live_active())
89 return -1;
90#endif
Simon Glass4984de22017-05-17 17:18:10 -060091 return node.of_offset;
92}
93
94/**
95 * ofnode_valid() - check if an ofnode is valid
96 *
97 * @return true if the reference contains a valid ofnode, false if it is NULL
98 */
99static inline bool ofnode_valid(ofnode node)
100{
Simon Glass9e512042017-05-18 20:08:58 -0600101 if (of_live_active())
102 return node.np != NULL;
103 else
104 return node.of_offset != -1;
Simon Glass4984de22017-05-17 17:18:10 -0600105}
106
107/**
108 * offset_to_ofnode() - convert a DT offset to an ofnode
109 *
110 * @of_offset: DT offset (either valid, or -1)
111 * @return reference to the associated DT offset
112 */
113static inline ofnode offset_to_ofnode(int of_offset)
114{
115 ofnode node;
116
Simon Glass9e512042017-05-18 20:08:58 -0600117 if (of_live_active())
118 node.np = NULL;
119 else
120 node.of_offset = of_offset;
Simon Glass4984de22017-05-17 17:18:10 -0600121
122 return node;
123}
124
125/**
Simon Glass9e512042017-05-18 20:08:58 -0600126 * np_to_ofnode() - convert a node pointer to an ofnode
127 *
128 * @np: Live node pointer (can be NULL)
129 * @return reference to the associated node pointer
130 */
131static inline ofnode np_to_ofnode(const struct device_node *np)
132{
133 ofnode node;
134
135 node.np = np;
136
137 return node;
138}
139
140/**
141 * ofnode_is_np() - check if a reference is a node pointer
142 *
143 * This function associated that if there is a valid live tree then all
144 * references will use it. This is because using the flat DT when the live tree
145 * is valid is not permitted.
146 *
147 * @node: reference to check (possibly invalid)
148 * @return true if the reference is a live node pointer, false if it is a DT
149 * offset
150 */
151static inline bool ofnode_is_np(ofnode node)
152{
153#ifdef OF_CHECKS
154 /*
155 * Check our assumption that flat tree offsets are not used when a
156 * live tree is in use.
157 */
158 assert(!ofnode_valid(node) ||
159 (of_live_active() ? _ofnode_to_np(node)
160 : _ofnode_to_np(node)));
161#endif
162 return of_live_active() && ofnode_valid(node);
163}
164
165/**
Simon Glass4984de22017-05-17 17:18:10 -0600166 * ofnode_equal() - check if two references are equal
167 *
168 * @return true if equal, else false
169 */
170static inline bool ofnode_equal(ofnode ref1, ofnode ref2)
171{
172 /* We only need to compare the contents */
173 return ref1.of_offset == ref2.of_offset;
174}
175
Simon Glass9e512042017-05-18 20:08:58 -0600176/**
177 * ofnode_null() - Obtain a null ofnode
178 *
179 * This returns an ofnode which points to no node. It works both with the flat
180 * tree and livetree.
181 */
182static inline ofnode ofnode_null(void)
183{
184 ofnode node;
185
186 if (of_live_active())
187 node.np = NULL;
188 else
189 node.of_offset = -1;
190
191 return node;
192}
193
194/**
195 * ofnode_read_u32() - Read a 32-bit integer from a property
196 *
197 * @ref: valid node reference to read property from
198 * @propname: name of the property to read from
199 * @outp: place to put value (if found)
200 * @return 0 if OK, -ve on error
201 */
202int ofnode_read_u32(ofnode node, const char *propname, u32 *outp);
203
204/**
205 * ofnode_read_s32() - Read a 32-bit integer from a property
206 *
207 * @ref: valid node reference to read property from
208 * @propname: name of the property to read from
209 * @outp: place to put value (if found)
210 * @return 0 if OK, -ve on error
211 */
212static inline int ofnode_read_s32(ofnode node, const char *propname,
213 s32 *out_value)
214{
215 return ofnode_read_u32(node, propname, (u32 *)out_value);
216}
217
218/**
219 * ofnode_read_u32_default() - Read a 32-bit integer from a property
220 *
221 * @ref: valid node reference to read property from
222 * @propname: name of the property to read from
223 * @def: default value to return if the property has no value
224 * @return property value, or @def if not found
225 */
226int ofnode_read_u32_default(ofnode ref, const char *propname, u32 def);
227
228/**
229 * ofnode_read_s32_default() - Read a 32-bit integer from a property
230 *
231 * @ref: valid node reference to read property from
232 * @propname: name of the property to read from
233 * @def: default value to return if the property has no value
234 * @return property value, or @def if not found
235 */
236int ofnode_read_s32_default(ofnode node, const char *propname, s32 def);
237
238/**
239 * ofnode_read_string() - Read a string from a property
240 *
241 * @ref: valid node reference to read property from
242 * @propname: name of the property to read
243 * @return string from property value, or NULL if there is no such property
244 */
245const char *ofnode_read_string(ofnode node, const char *propname);
246
247/**
Simon Glassbed77492017-05-18 20:09:01 -0600248 * ofnode_read_u32_array() - Find and read an array of 32 bit integers
Simon Glass9e512042017-05-18 20:08:58 -0600249 *
250 * @node: valid node reference to read property from
251 * @propname: name of the property to read
252 * @out_values: pointer to return value, modified only if return value is 0
253 * @sz: number of array elements to read
254 *
255 * Search for a property in a device node and read 32-bit value(s) from
256 * it. Returns 0 on success, -EINVAL if the property does not exist,
257 * -ENODATA if property does not have a value, and -EOVERFLOW if the
258 * property data isn't large enough.
259 *
260 * The out_values is modified only if a valid u32 value can be decoded.
261 */
262int ofnode_read_u32_array(ofnode node, const char *propname,
263 u32 *out_values, size_t sz);
264
265/**
266 * ofnode_read_bool() - read a boolean value from a property
267 *
268 * @node: valid node reference to read property from
269 * @propname: name of property to read
270 * @return true if property is present (meaning true), false if not present
271 */
272bool ofnode_read_bool(ofnode node, const char *propname);
273
274/**
275 * ofnode_find_subnode() - find a named subnode of a parent node
276 *
277 * @node: valid reference to parent node
278 * @subnode_name: name of subnode to find
279 * @return reference to subnode (which can be invalid if there is no such
280 * subnode)
281 */
282ofnode ofnode_find_subnode(ofnode node, const char *subnode_name);
283
284/**
285 * ofnode_first_subnode() - find the first subnode of a parent node
286 *
287 * @node: valid reference to a valid parent node
288 * @return reference to the first subnode (which can be invalid if the parent
289 * node has no subnodes)
290 */
291ofnode ofnode_first_subnode(ofnode node);
292
293/**
294 * ofnode_next_subnode() - find the next sibling of a subnode
295 *
296 * @node: valid reference to previous node (sibling)
297 * @return reference to the next subnode (which can be invalid if the node
298 * has no more siblings)
299 */
300ofnode ofnode_next_subnode(ofnode node);
301
302/**
303 * ofnode_get_name() - get the name of a node
304 *
305 * @node: valid node to look up
306 * @return name or node
307 */
308const char *ofnode_get_name(ofnode node);
309
310/**
311 * ofnode_read_size() - read the size of a property
312 *
313 * @node: node to check
314 * @propname: property to check
315 * @return size of property if present, or -EINVAL if not
316 */
317int ofnode_read_size(ofnode node, const char *propname);
318
319/**
Simon Glassbed77492017-05-18 20:09:01 -0600320 * ofnode_get_addr_index() - get an address from a node
321 *
322 * This reads the register address from a node
323 *
324 * @node: node to read from
325 * @index: Index of address to read (0 for first)
326 * @return address, or FDT_ADDR_T_NONE if not present or invalid
327 */
328phys_addr_t ofnode_get_addr_index(ofnode node, int index);
329
330/**
331 * ofnode_get_addr() - get an address from a node
332 *
333 * This reads the register address from a node
334 *
335 * @node: node to read from
336 * @return address, or FDT_ADDR_T_NONE if not present or invalid
337 */
338phys_addr_t ofnode_get_addr(ofnode node);
339
340/**
Simon Glass9e512042017-05-18 20:08:58 -0600341 * ofnode_stringlist_search() - find a string in a string list and return index
342 *
343 * Note that it is possible for this function to succeed on property values
344 * that are not NUL-terminated. That's because the function will stop after
345 * finding the first occurrence of @string. This can for example happen with
346 * small-valued cell properties, such as #address-cells, when searching for
347 * the empty string.
348 *
349 * @node: node to check
350 * @propname: name of the property containing the string list
351 * @string: string to look up in the string list
352 *
353 * @return:
354 * the index of the string in the list of strings
355 * -ENODATA if the property is not found
356 * -EINVAL on some other error
357 */
358int ofnode_stringlist_search(ofnode node, const char *propname,
359 const char *string);
360
361/**
Simon Glass8c293d62017-06-12 06:21:28 -0600362 * ofnode_read_string_index() - obtain an indexed string from a string list
Simon Glass9e512042017-05-18 20:08:58 -0600363 *
364 * Note that this will successfully extract strings from properties with
365 * non-NUL-terminated values. For example on small-valued cell properties
366 * this function will return the empty string.
367 *
368 * If non-NULL, the length of the string (on success) or a negative error-code
369 * (on failure) will be stored in the integer pointer to by lenp.
370 *
371 * @node: node to check
372 * @propname: name of the property containing the string list
373 * @index: index of the string to return
374 * @lenp: return location for the string length or an error code on failure
375 *
376 * @return:
377 * length of string, if found or -ve error value if not found
378 */
379int ofnode_read_string_index(ofnode node, const char *propname, int index,
380 const char **outp);
381
382/**
Simon Glass8c293d62017-06-12 06:21:28 -0600383 * ofnode_read_string_count() - find the number of strings in a string list
384 *
385 * @node: node to check
386 * @propname: name of the property containing the string list
387 * @return:
388 * number of strings in the list, or -ve error value if not found
389 */
390int ofnode_read_string_count(ofnode node, const char *property);
391
392/**
Simon Glass9e512042017-05-18 20:08:58 -0600393 * ofnode_parse_phandle_with_args() - Find a node pointed by phandle in a list
394 *
395 * This function is useful to parse lists of phandles and their arguments.
396 * Returns 0 on success and fills out_args, on error returns appropriate
397 * errno value.
398 *
399 * Caller is responsible to call of_node_put() on the returned out_args->np
400 * pointer.
401 *
402 * Example:
403 *
404 * phandle1: node1 {
405 * #list-cells = <2>;
406 * }
407 *
408 * phandle2: node2 {
409 * #list-cells = <1>;
410 * }
411 *
412 * node3 {
413 * list = <&phandle1 1 2 &phandle2 3>;
414 * }
415 *
416 * To get a device_node of the `node2' node you may call this:
417 * ofnode_parse_phandle_with_args(node3, "list", "#list-cells", 0, 1, &args);
418 *
419 * @node: device tree node containing a list
420 * @list_name: property name that contains a list
421 * @cells_name: property name that specifies phandles' arguments count
422 * @cells_count: Cell count to use if @cells_name is NULL
423 * @index: index of a phandle to parse out
424 * @out_args: optional pointer to output arguments structure (will be filled)
425 * @return 0 on success (with @out_args filled out if not NULL), -ENOENT if
426 * @list_name does not exist, -EINVAL if a phandle was not found,
427 * @cells_name could not be found, the arguments were truncated or there
428 * were too many arguments.
429 */
430int ofnode_parse_phandle_with_args(ofnode node, const char *list_name,
431 const char *cells_name, int cell_count,
432 int index,
433 struct ofnode_phandle_args *out_args);
434
435/**
Patrice Chotard642346a2017-07-18 11:57:08 +0200436 * ofnode_count_phandle_with_args() - Count number of phandle in a list
437 *
438 * This function is useful to count phandles into a list.
439 * Returns number of phandle on success, on error returns appropriate
440 * errno value.
441 *
442 * @node: device tree node containing a list
443 * @list_name: property name that contains a list
444 * @cells_name: property name that specifies phandles' arguments count
445 * @return number of phandle on success, -ENOENT if @list_name does not
446 * exist, -EINVAL if a phandle was not found, @cells_name could not
447 * be found.
448 */
449int ofnode_count_phandle_with_args(ofnode node, const char *list_name,
450 const char *cells_name);
451
452/**
Simon Glass9e512042017-05-18 20:08:58 -0600453 * ofnode_path() - find a node by full path
454 *
455 * @path: Full path to node, e.g. "/bus/spi@1"
456 * @return reference to the node found. Use ofnode_valid() to check if it exists
457 */
458ofnode ofnode_path(const char *path);
459
460/**
461 * ofnode_get_chosen_prop() - get the value of a chosen property
462 *
463 * This looks for a property within the /chosen node and returns its value
464 *
465 * @propname: Property name to look for
466 */
467const char *ofnode_get_chosen_prop(const char *propname);
468
469/**
470 * ofnode_get_chosen_node() - get the chosen node
471 *
472 * @return the chosen node if present, else ofnode_null()
473 */
474ofnode ofnode_get_chosen_node(const char *name);
475
476struct display_timing;
477/**
478 * ofnode_decode_display_timing() - decode display timings
479 *
480 * Decode display timings from the supplied 'display-timings' node.
481 * See doc/device-tree-bindings/video/display-timing.txt for binding
482 * information.
483 *
484 * @node 'display-timing' node containing the timing subnodes
485 * @index Index number to read (0=first timing subnode)
486 * @config Place to put timings
487 * @return 0 if OK, -FDT_ERR_NOTFOUND if not found
488 */
489int ofnode_decode_display_timing(ofnode node, int index,
490 struct display_timing *config);
491
492/**
Masahiro Yamada61e51ba2017-06-22 16:54:05 +0900493 * ofnode_get_property()- - get a pointer to the value of a node property
Simon Glass9e512042017-05-18 20:08:58 -0600494 *
495 * @node: node to read
496 * @propname: property to read
497 * @lenp: place to put length on success
498 * @return pointer to property, or NULL if not found
499 */
Masahiro Yamada61e51ba2017-06-22 16:54:05 +0900500const void *ofnode_get_property(ofnode node, const char *propname, int *lenp);
Simon Glass9e512042017-05-18 20:08:58 -0600501
502/**
503 * ofnode_is_available() - check if a node is marked available
504 *
505 * @node: node to check
506 * @return true if node's 'status' property is "okay" (or is missing)
507 */
508bool ofnode_is_available(ofnode node);
509
510/**
511 * ofnode_get_addr_size() - get address and size from a property
512 *
513 * This does no address translation. It simply reads an property that contains
514 * an address and a size value, one after the other.
515 *
516 * @node: node to read from
517 * @propname: property to read
518 * @sizep: place to put size value (on success)
519 * @return address value, or FDT_ADDR_T_NONE on error
520 */
521phys_addr_t ofnode_get_addr_size(ofnode node, const char *propname,
522 phys_size_t *sizep);
523
524/**
525 * ofnode_read_u8_array_ptr() - find an 8-bit array
526 *
527 * Look up a property in a node and return a pointer to its contents as a
528 * byte array of given length. The property must have at least enough data
529 * for the array (count bytes). It may have more, but this will be ignored.
530 * The data is not copied.
531 *
532 * @node node to examine
533 * @propname name of property to find
534 * @sz number of array elements
535 * @return pointer to byte array if found, or NULL if the property is not
536 * found or there is not enough data
537 */
538const uint8_t *ofnode_read_u8_array_ptr(ofnode node, const char *propname,
539 size_t sz);
540
541/**
542 * ofnode_read_pci_addr() - look up a PCI address
543 *
544 * Look at an address property in a node and return the PCI address which
545 * corresponds to the given type in the form of fdt_pci_addr.
546 * The property must hold one fdt_pci_addr with a lengh.
547 *
548 * @node node to examine
549 * @type pci address type (FDT_PCI_SPACE_xxx)
550 * @propname name of property to find
551 * @addr returns pci address in the form of fdt_pci_addr
552 * @return 0 if ok, -ENOENT if the property did not exist, -EINVAL if the
553 * format of the property was invalid, -ENXIO if the requested
554 * address type was not found
555 */
556int ofnode_read_pci_addr(ofnode node, enum fdt_pci_space type,
557 const char *propname, struct fdt_pci_addr *addr);
558
559/**
560 * ofnode_read_addr_cells() - Get the number of address cells for a node
561 *
562 * This walks back up the tree to find the closest #address-cells property
563 * which controls the given node.
564 *
565 * @node: Node to check
566 * @return number of address cells this node uses
567 */
568int ofnode_read_addr_cells(ofnode node);
569
570/**
571 * ofnode_read_size_cells() - Get the number of size cells for a node
572 *
573 * This walks back up the tree to find the closest #size-cells property
574 * which controls the given node.
575 *
576 * @node: Node to check
577 * @return number of size cells this node uses
578 */
579int ofnode_read_size_cells(ofnode node);
580
581/**
Simon Glass878d68c2017-06-12 06:21:31 -0600582 * ofnode_read_simple_addr_cells() - Get the address cells property in a node
583 *
584 * This function matches fdt_address_cells().
585 *
586 * @np: Node pointer to check
587 * @return value of #address-cells property in this node, or 2 if none
588 */
589int ofnode_read_simple_addr_cells(ofnode node);
590
591/**
592 * ofnode_read_simple_size_cells() - Get the size cells property in a node
593 *
594 * This function matches fdt_size_cells().
595 *
596 * @np: Node pointer to check
597 * @return value of #size-cells property in this node, or 2 if none
598 */
599int ofnode_read_simple_size_cells(ofnode node);
600
601/**
Simon Glass9e512042017-05-18 20:08:58 -0600602 * ofnode_pre_reloc() - check if a node should be bound before relocation
603 *
604 * Device tree nodes can be marked as needing-to-be-bound in the loader stages
605 * via special device tree properties.
606 *
607 * Before relocation this function can be used to check if nodes are required
608 * in either SPL or TPL stages.
609 *
610 * After relocation and jumping into the real U-Boot binary it is possible to
611 * determine if a node was bound in one of SPL/TPL stages.
612 *
613 * There are 3 settings currently in use
614 * -
615 * - u-boot,dm-pre-reloc: legacy and indicates any of TPL or SPL
616 * Existing platforms only use it to indicate nodes needed in
617 * SPL. Should probably be replaced by u-boot,dm-spl for
618 * new platforms.
619 *
620 * @node: node to check
621 * @eturns true if node is needed in SPL/TL, false otherwise
622 */
623bool ofnode_pre_reloc(ofnode node);
624
Simon Glass4984de22017-05-17 17:18:10 -0600625#endif