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