Lines Matching +full:child +full:- +full:node
1 // SPDX-License-Identifier: GPL-2.0+
6 * Copyright (C) 1996-2005 Paul Mackerras.
54 /* use when traversing tree through the child, sibling,
67 node_name = kbasename(np->full_name); in of_node_name_eq()
68 len = strchrnul(node_name, '@') - node_name; in of_node_name_eq()
79 return strncmp(kbasename(np->full_name), prefix, strlen(prefix)) == 0; in of_node_name_prefix()
99 for (; np; np = np->parent) { in of_bus_n_addr_cells()
100 if (!of_property_read_u32(np, "#address-cells", &cells)) in of_bus_n_addr_cells()
103 * Default root value and walking parent nodes for "#address-cells" in of_bus_n_addr_cells()
108 "Missing '#address-cells' in %pOF\n", np); in of_bus_n_addr_cells()
115 if (np->parent) in of_n_addr_cells()
116 np = np->parent; in of_n_addr_cells()
126 for (; np; np = np->parent) { in of_bus_n_size_cells()
127 if (!of_property_read_u32(np, "#size-cells", &cells)) in of_bus_n_size_cells()
130 * Default root value and walking parent nodes for "#size-cells" in of_bus_n_size_cells()
135 "Missing '#size-cells' in %pOF\n", np); in of_bus_n_size_cells()
142 if (np->parent) in of_n_size_cells()
143 np = np->parent; in of_n_size_cells()
180 if (np && handle == np->phandle) in __of_phandle_cache_inv_entry()
200 if (np->phandle && !phandle_cache[of_phandle_cache_hash(np->phandle)]) in of_core_init()
201 phandle_cache[of_phandle_cache_hash(np->phandle)] = np; in of_core_init()
207 proc_symlink("device-tree", NULL, "/sys/firmware/devicetree/base"); in of_core_init()
218 for (pp = np->properties; pp; pp = pp->next) { in __of_find_property()
219 if (of_prop_cmp(pp->name, name) == 0) { in __of_find_property()
221 *lenp = pp->length; in __of_find_property()
249 } else if (prev->child) { in __of_find_all_nodes()
250 np = prev->child; in __of_find_all_nodes()
254 while (np->parent && !np->sibling) in __of_find_all_nodes()
255 np = np->parent; in __of_find_all_nodes()
256 np = np->sibling; /* Might be null at the end of the tree */ in __of_find_all_nodes()
262 * of_find_all_nodes - Get next node in global list
263 * @prev: Previous node or NULL to start iteration
266 * Return: A node pointer with refcount incremented, use
284 * Find a property with a given name for a given node
292 return pp ? pp->value : NULL; in __of_get_property()
296 * Find a property with a given name for a given node
304 return pp ? pp->value : NULL; in of_get_property()
309 * __of_device_is_compatible() - Check if the node matches given constraints
310 * @device: pointer to node
313 * @name: required node name, NULL or "" for any match
351 score = INT_MAX/2 - (index << 2); in __of_device_is_compatible()
416 * of_machine_compatible_match - Test root of device tree against a compatible array
417 …* @compats: NULL terminated array of compatible strings to look for in root node's compatible prop…
419 * Returns true if the root node has any of the given compatible values in its
454 if ((*strings)[len - 1] == '-') { in __of_device_is_status()
469 * __of_device_is_available - check if a device is available for use
471 * @device: Node to check for availability, with locks already held
488 * __of_device_is_reserved - check if a device is reserved
490 * @device: Node to check for availability, with locks already held
502 * of_device_is_available - check if a device is available for use
504 * @device: Node to check for availability
523 * __of_device_is_fail - check if a device has status "fail" or "fail-..."
525 * @device: Node to check status for, with locks already held
527 * Return: True if the status property is set to "fail" or "fail-..." (for any
532 static const char * const fail[] = {"fail", "fail-", NULL}; in __of_device_is_fail()
538 * of_device_is_big_endian - check if a device has BE registers
540 * @device: Node to check for endianness
542 * Return: True if the device has a "big-endian" property, or if the kernel
543 * was compiled for BE *and* the device has a "native-endian" property.
551 if (of_property_read_bool(device, "big-endian")) in of_device_is_big_endian()
554 of_property_read_bool(device, "native-endian")) in of_device_is_big_endian()
561 * of_get_parent - Get a node's parent if any
562 * @node: Node to get parent
564 * Return: A node pointer with refcount incremented, use
567 struct device_node *of_get_parent(const struct device_node *node) in of_get_parent() argument
572 if (!node) in of_get_parent()
576 np = of_node_get(node->parent); in of_get_parent()
583 * of_get_next_parent - Iterate to a node's parent
584 * @node: Node to get parent of
587 * refcount on the passed node, making it suitable for iterating
588 * through a node's parents.
590 * Return: A node pointer with refcount incremented, use
593 struct device_node *of_get_next_parent(struct device_node *node) in of_get_next_parent() argument
598 if (!node) in of_get_next_parent()
602 parent = of_node_get(node->parent); in of_get_next_parent()
603 of_node_put(node); in of_get_next_parent()
609 static struct device_node *__of_get_next_child(const struct device_node *node, in __of_get_next_child() argument
614 if (!node) in __of_get_next_child()
617 next = prev ? prev->sibling : node->child; in __of_get_next_child()
622 #define __for_each_child_of_node(parent, child) \ argument
623 for (child = __of_get_next_child(parent, NULL); child != NULL; \
624 child = __of_get_next_child(parent, child))
627 * of_get_next_child - Iterate a node childs
628 * @node: parent node
629 * @prev: previous child of the parent node, or NULL to get first
631 * Return: A node pointer with refcount incremented, use of_node_put() on
632 * it when done. Returns NULL when prev is the last child. Decrements the
635 struct device_node *of_get_next_child(const struct device_node *node, in of_get_next_child() argument
642 next = __of_get_next_child(node, prev); in of_get_next_child()
649 * of_get_next_child_with_prefix - Find the next child node with prefix
650 * @node: parent node
651 * @prev: previous child of the parent node, or NULL to get first
652 * @prefix: prefix that the node name should have
657 * Return: A node pointer with refcount incremented, use
660 struct device_node *of_get_next_child_with_prefix(const struct device_node *node, in of_get_next_child_with_prefix() argument
667 if (!node) in of_get_next_child_with_prefix()
671 next = prev ? prev->sibling : node->child; in of_get_next_child_with_prefix()
672 for (; next; next = next->sibling) { in of_get_next_child_with_prefix()
684 static struct device_node *of_get_next_status_child(const struct device_node *node, in of_get_next_status_child() argument
691 if (!node) in of_get_next_status_child()
695 next = prev ? prev->sibling : node->child; in of_get_next_status_child()
696 for (; next; next = next->sibling) { in of_get_next_status_child()
708 * of_get_next_available_child - Find the next available child node
709 * @node: parent node
710 * @prev: previous child of the parent node, or NULL to get first
715 struct device_node *of_get_next_available_child(const struct device_node *node, in of_get_next_available_child() argument
718 return of_get_next_status_child(node, prev, __of_device_is_available); in of_get_next_available_child()
723 * of_get_next_reserved_child - Find the next reserved child node
724 * @node: parent node
725 * @prev: previous child of the parent node, or NULL to get first
730 struct device_node *of_get_next_reserved_child(const struct device_node *node, in of_get_next_reserved_child() argument
733 return of_get_next_status_child(node, prev, __of_device_is_reserved); in of_get_next_reserved_child()
738 * of_get_next_cpu_node - Iterate on cpu nodes
739 * @prev: previous child of the /cpus node, or NULL to get first
741 * Unusable CPUs (those with the status property set to "fail" or "fail-...")
744 * Return: A cpu node pointer with refcount incremented, use of_node_put()
745 * on it when done. Returns NULL when prev is the last child. Decrements
752 struct device_node *node; in of_get_next_cpu_node() local
755 node = of_find_node_by_path("/cpus"); in of_get_next_cpu_node()
759 next = prev->sibling; in of_get_next_cpu_node()
760 else if (node) { in of_get_next_cpu_node()
761 next = node->child; in of_get_next_cpu_node()
762 of_node_put(node); in of_get_next_cpu_node()
764 for (; next; next = next->sibling) { in of_get_next_cpu_node()
780 * of_get_compatible_child - Find compatible child node
781 * @parent: parent node
784 * Lookup child node whose compatible property contains the given compatible
787 * Return: a node pointer with refcount incremented, use of_node_put() on it
793 struct device_node *child; in of_get_compatible_child() local
795 for_each_child_of_node(parent, child) { in of_get_compatible_child()
796 if (of_device_is_compatible(child, compatible)) in of_get_compatible_child()
800 return child; in of_get_compatible_child()
805 * of_get_child_by_name - Find the child node by name for a given parent
806 * @node: parent node
807 * @name: child name to look for.
809 * This function looks for child node for given matching name
811 * Return: A node pointer if found, with refcount incremented, use
813 * Returns NULL if node is not found.
815 struct device_node *of_get_child_by_name(const struct device_node *node, in of_get_child_by_name() argument
818 struct device_node *child; in of_get_child_by_name() local
820 for_each_child_of_node(node, child) in of_get_child_by_name()
821 if (of_node_name_eq(child, name)) in of_get_child_by_name()
823 return child; in of_get_child_by_name()
828 * of_get_available_child_by_name - Find the available child node by name for a given parent
829 * @node: parent node
830 * @name: child name to look for.
832 * This function looks for child node for given matching name and checks the
835 * Return: A node pointer if found, with refcount incremented, use
837 * Returns NULL if node is not found.
839 struct device_node *of_get_available_child_by_name(const struct device_node *node, in of_get_available_child_by_name() argument
842 struct device_node *child; in of_get_available_child_by_name() local
844 child = of_get_child_by_name(node, name); in of_get_available_child_by_name()
845 if (child && !of_device_is_available(child)) { in of_get_available_child_by_name()
846 of_node_put(child); in of_get_available_child_by_name()
850 return child; in of_get_available_child_by_name()
857 struct device_node *child; in __of_find_node_by_path() local
864 __for_each_child_of_node(parent, child) { in __of_find_node_by_path()
865 const char *name = kbasename(child->full_name); in __of_find_node_by_path()
867 return child; in __of_find_node_by_path()
872 struct device_node *__of_find_node_by_full_path(struct device_node *node, in __of_find_node_by_full_path() argument
877 while (node && *path == '/') { in __of_find_node_by_full_path()
878 struct device_node *tmp = node; in __of_find_node_by_full_path()
881 node = __of_find_node_by_path(node, path); in __of_find_node_by_full_path()
887 return node; in __of_find_node_by_full_path()
891 * of_find_node_opts_by_path - Find a node matching a full OF path
894 * node (an alias). In the case of an alias, the node
905 * Return: A node pointer with refcount incremented, use
928 len = p - path; in of_find_node_opts_by_path()
935 if (strlen(pp->name) == len && !strncmp(pp->name, path, len)) { in of_find_node_opts_by_path()
936 np = of_find_node_by_path(pp->value); in of_find_node_opts_by_path()
956 * of_find_node_by_name - Find a node by its "name" property
957 * @from: The node to start searching from or NULL; the node
963 * Return: A node pointer with refcount incremented, use
983 * of_find_node_by_type - Find a node by its "device_type" property
984 * @from: The node to start searching from, or NULL to start searching
985 * the entire device tree. The node you pass will not be
991 * Return: A node pointer with refcount incremented, use
1011 * of_find_compatible_node - Find a node based on type and one of the
1013 * @from: The node to start searching from or NULL, the node
1021 * Return: A node pointer with refcount incremented, use
1042 * of_find_node_with_property - Find a node which has a property with
1044 * @from: The node to start searching from or NULL, the node
1050 * Return: A node pointer with refcount incremented, use
1074 const struct device_node *node) in __of_match_node() argument
1082 for (; matches->name[0] || matches->type[0] || matches->compatible[0]; matches++) { in __of_match_node()
1083 score = __of_device_is_compatible(node, matches->compatible, in __of_match_node()
1084 matches->type, matches->name); in __of_match_node()
1095 * of_match_node - Tell if a device_node has a matching of_match structure
1097 * @node: the of device structure to match against
1102 const struct device_node *node) in of_match_node() argument
1108 match = __of_match_node(matches, node); in of_match_node()
1115 * of_find_matching_node_and_match - Find a node based on an of_device_id
1117 * @from: The node to start searching from or NULL, the node
1124 * Return: A node pointer with refcount incremented, use
1154 * of_alias_from_compatible - Lookup appropriate alias for a device node
1156 * @node: pointer to a device tree node
1161 * to choose an appropriate alias value for a particular device tree node.
1170 int of_alias_from_compatible(const struct device_node *node, char *alias, int len) in of_alias_from_compatible() argument
1175 compatible = of_get_property(node, "compatible", &cplen); in of_alias_from_compatible()
1177 return -ENODEV; in of_alias_from_compatible()
1185 * of_find_node_by_phandle - Find a node given a phandle
1186 * @handle: phandle of the node to find
1188 * Return: A node pointer with refcount incremented, use
1205 handle == phandle_cache[handle_hash]->phandle) in of_find_node_by_phandle()
1210 if (np->phandle == handle && in of_find_node_by_phandle()
1226 printk("%s %pOF", msg, args->np); in of_print_phandle_args()
1227 for (i = 0; i < args->args_count; i++) { in of_print_phandle_args()
1230 pr_cont("%c%08x", delim, args->args[i]); in of_print_phandle_args()
1251 return -EINVAL; in of_phandle_iterator_init()
1255 return -ENOENT; in of_phandle_iterator_init()
1257 it->cells_name = cells_name; in of_phandle_iterator_init()
1258 it->cell_count = cell_count; in of_phandle_iterator_init()
1259 it->parent = np; in of_phandle_iterator_init()
1260 it->list_end = list + size / sizeof(*list); in of_phandle_iterator_init()
1261 it->phandle_end = list; in of_phandle_iterator_init()
1262 it->cur = list; in of_phandle_iterator_init()
1272 if (it->node) { in of_phandle_iterator_next()
1273 of_node_put(it->node); in of_phandle_iterator_next()
1274 it->node = NULL; in of_phandle_iterator_next()
1277 if (!it->cur || it->phandle_end >= it->list_end) in of_phandle_iterator_next()
1278 return -ENOENT; in of_phandle_iterator_next()
1280 it->cur = it->phandle_end; in of_phandle_iterator_next()
1283 it->phandle = be32_to_cpup(it->cur++); in of_phandle_iterator_next()
1285 if (it->phandle) { in of_phandle_iterator_next()
1288 * Find the provider node and parse the #*-cells property to in of_phandle_iterator_next()
1291 it->node = of_find_node_by_phandle(it->phandle); in of_phandle_iterator_next()
1293 if (it->cells_name) { in of_phandle_iterator_next()
1294 if (!it->node) { in of_phandle_iterator_next()
1296 it->parent, it->phandle); in of_phandle_iterator_next()
1300 if (of_property_read_u32(it->node, it->cells_name, in of_phandle_iterator_next()
1307 if (it->cell_count >= 0) { in of_phandle_iterator_next()
1308 count = it->cell_count; in of_phandle_iterator_next()
1311 it->parent, in of_phandle_iterator_next()
1312 it->cells_name, in of_phandle_iterator_next()
1313 it->node); in of_phandle_iterator_next()
1318 count = it->cell_count; in of_phandle_iterator_next()
1325 if (it->cur + count > it->list_end) { in of_phandle_iterator_next()
1326 if (it->cells_name) in of_phandle_iterator_next()
1328 it->parent, it->cells_name, in of_phandle_iterator_next()
1329 count, it->list_end - it->cur); in of_phandle_iterator_next()
1332 it->parent, of_node_full_name(it->node), in of_phandle_iterator_next()
1333 count, it->list_end - it->cur); in of_phandle_iterator_next()
1338 it->phandle_end = it->cur + count; in of_phandle_iterator_next()
1339 it->cur_count = count; in of_phandle_iterator_next()
1344 if (it->node) { in of_phandle_iterator_next()
1345 of_node_put(it->node); in of_phandle_iterator_next()
1346 it->node = NULL; in of_phandle_iterator_next()
1349 return -EINVAL; in of_phandle_iterator_next()
1359 count = it->cur_count; in of_phandle_iterator_args()
1365 args[i] = be32_to_cpup(it->cur++); in of_phandle_iterator_args()
1380 return -EINVAL; in __of_parse_phandle_with_args()
1388 * or return -ENOENT for an empty entry. in __of_parse_phandle_with_args()
1390 rc = -ENOENT; in __of_parse_phandle_with_args()
1399 out_args->args, in __of_parse_phandle_with_args()
1401 out_args->np = it.node; in __of_parse_phandle_with_args()
1402 out_args->args_count = c; in __of_parse_phandle_with_args()
1404 of_node_put(it.node); in __of_parse_phandle_with_args()
1415 * Unlock node before returning result; will be one of: in __of_parse_phandle_with_args()
1416 * -ENOENT : index is for empty phandle in __of_parse_phandle_with_args()
1417 * -EINVAL : parsing error on data in __of_parse_phandle_with_args()
1421 of_node_put(it.node); in __of_parse_phandle_with_args()
1427 * of_parse_phandle_with_args_map() - Find a node pointed by phandle in a list and remap it
1428 * @np: pointer to a device tree node containing a list
1437 * is that this API remaps a phandle if the node the phandle points to has
1438 * a <@stem_name>-map property.
1440 * Caller is responsible to call of_node_put() on the returned out_args->np
1446 * #list-cells = <2>;
1450 * #list-cells = <1>;
1454 * #list-cells = <1>;
1455 * list-map = <0 &phandle2 3>,
1458 * list-map-mask = <0x3>;
1465 * To get a device_node of the ``node2`` node you may call this:
1473 char *cells_name __free(kfree) = kasprintf(GFP_KERNEL, "#%s-cells", stem_name); in of_parse_phandle_with_args_map()
1474 char *map_name __free(kfree) = kasprintf(GFP_KERNEL, "%s-map", stem_name); in of_parse_phandle_with_args_map()
1475 char *mask_name __free(kfree) = kasprintf(GFP_KERNEL, "%s-map-mask", stem_name); in of_parse_phandle_with_args_map()
1476 char *pass_name __free(kfree) = kasprintf(GFP_KERNEL, "%s-map-pass-thru", stem_name); in of_parse_phandle_with_args_map()
1479 static const __be32 dummy_mask[] = { [0 ... (MAX_PHANDLE_ARGS - 1)] = cpu_to_be32(~0) }; in of_parse_phandle_with_args_map()
1480 static const __be32 dummy_pass[] = { [0 ... (MAX_PHANDLE_ARGS - 1)] = cpu_to_be32(0) }; in of_parse_phandle_with_args_map()
1487 return -EINVAL; in of_parse_phandle_with_args_map()
1490 return -ENOMEM; in of_parse_phandle_with_args_map()
1492 ret = __of_parse_phandle_with_args(np, list_name, cells_name, -1, index, in of_parse_phandle_with_args_map()
1497 /* Get the #<list>-cells property */ in of_parse_phandle_with_args_map()
1498 cur = out_args->np; in of_parse_phandle_with_args_map()
1503 /* Precalculate the match array - this simplifies match loop */ in of_parse_phandle_with_args_map()
1505 initial_match_array[i] = cpu_to_be32(out_args->args[i]); in of_parse_phandle_with_args_map()
1507 ret = -EINVAL; in of_parse_phandle_with_args_map()
1509 /* Get the <list>-map property */ in of_parse_phandle_with_args_map()
1516 /* Get the <list>-map-mask property (optional) */ in of_parse_phandle_with_args_map()
1520 /* Iterate through <list>-map property */ in of_parse_phandle_with_args_map()
1525 for (i = 0; i < list_size; i++, map_len--) in of_parse_phandle_with_args_map()
1531 map_len--; in of_parse_phandle_with_args_map()
1535 ret = -EINVAL; in of_parse_phandle_with_args_map()
1549 ret = -EINVAL; in of_parse_phandle_with_args_map()
1553 /* Move forward by new node's #<list>-cells amount */ in of_parse_phandle_with_args_map()
1555 map_len -= new_size; in of_parse_phandle_with_args_map()
1558 ret = -ENOENT; in of_parse_phandle_with_args_map()
1562 /* Get the <list>-map-pass-thru property (optional) */ in of_parse_phandle_with_args_map()
1568 * Successfully parsed a <list>-map translation; copy new in of_parse_phandle_with_args_map()
1570 * bits specified in <list>-map-pass-thru. in of_parse_phandle_with_args_map()
1573 __be32 val = *(map - new_size + i); in of_parse_phandle_with_args_map()
1577 val |= cpu_to_be32(out_args->args[i]) & pass[i]; in of_parse_phandle_with_args_map()
1581 out_args->args[i] = be32_to_cpu(val); in of_parse_phandle_with_args_map()
1583 out_args->args_count = list_size = new_size; in of_parse_phandle_with_args_map()
1585 out_args->np = new; in of_parse_phandle_with_args_map()
1598 * of_count_phandle_with_args() - Find the number of phandles references in a property
1599 * @np: pointer to a device tree node containing a list
1606 * by a property in the phandle-target node. For example, a gpios
1609 * determined by the #gpio-cells property in the node pointed to by the
1630 return -ENOENT; in of_count_phandle_with_args()
1635 rc = of_phandle_iterator_init(&it, np, list_name, cells_name, -1); in of_count_phandle_with_args()
1642 if (rc != -ENOENT) in of_count_phandle_with_args()
1653 for (next = list; *next; next = &(*next)->next) { in __of_remove_property_from_list()
1655 *next = prop->next; in __of_remove_property_from_list()
1656 prop->next = NULL; in __of_remove_property_from_list()
1664 * __of_add_property - Add a property to a node without lock operations
1665 * @np: Caller's Device Node
1676 __of_remove_property_from_list(&np->deadprops, prop); in __of_add_property()
1678 prop->next = NULL; in __of_add_property()
1679 next = &np->properties; in __of_add_property()
1681 if (of_prop_cmp(prop->name, (*next)->name) == 0) { in __of_add_property()
1683 rc = -EEXIST; in __of_add_property()
1686 next = &(*next)->next; in __of_add_property()
1700 * of_add_property - Add a property to a node
1701 * @np: Caller's Device Node
1722 int rc = -ENODEV; in __of_remove_property()
1726 if (__of_remove_property_from_list(&np->properties, prop)) { in __of_remove_property()
1728 prop->next = np->deadprops; in __of_remove_property()
1729 np->deadprops = prop; in __of_remove_property()
1742 * of_remove_property - Remove a property from a node.
1743 * @np: Caller's Device Node
1747 * who-knows-how-many pointers to the data using get-property.
1756 return -ENODEV; in of_remove_property()
1777 __of_remove_property_from_list(&np->deadprops, newprop); in __of_update_property()
1779 for (next = &np->properties; *next; next = &(*next)->next) { in __of_update_property()
1780 if (of_prop_cmp((*next)->name, newprop->name) == 0) in __of_update_property()
1786 /* replace the node */ in __of_update_property()
1787 newprop->next = oldprop->next; in __of_update_property()
1789 oldprop->next = np->deadprops; in __of_update_property()
1790 np->deadprops = oldprop; in __of_update_property()
1792 /* new node */ in __of_update_property()
1793 newprop->next = NULL; in __of_update_property()
1805 * of_update_property - Update a property in a node, if the property does
1809 * who-knows-how-many pointers to the data using get-property.
1818 if (!newprop->name) in of_update_property()
1819 return -EINVAL; in of_update_property()
1834 ap->np = np; in of_alias_add()
1835 ap->id = id; in of_alias_add()
1836 strscpy(ap->stem, stem, stem_len + 1); in of_alias_add()
1837 list_add_tail(&ap->link, &aliases_lookup); in of_alias_add()
1838 pr_debug("adding DT alias:%s: stem=%s id=%i node=%pOF\n", in of_alias_add()
1839 ap->alias, ap->stem, ap->id, np); in of_alias_add()
1843 * of_alias_scan - Scan all properties of the 'aliases' node
1847 * The function scans all the properties of the 'aliases' node and populates
1860 /* linux,stdout-path and /aliases/stdout are for legacy compatibility */ in of_alias_scan()
1863 if (of_property_read_string(of_chosen, "stdout-path", &name)) in of_alias_scan()
1864 of_property_read_string(of_chosen, "linux,stdout-path", in of_alias_scan()
1871 of_stdout->fwnode.flags |= FWNODE_FLAG_BEST_EFFORT; in of_alias_scan()
1878 const char *start = pp->name; in of_alias_scan()
1885 if (is_pseudo_property(pp->name)) in of_alias_scan()
1888 np = of_find_node_by_path(pp->value); in of_alias_scan()
1894 while (isdigit(*(end-1)) && end > start) in of_alias_scan()
1895 end--; in of_alias_scan()
1896 len = end - start; in of_alias_scan()
1906 ap->alias = start; in of_alias_scan()
1912 * of_alias_get_id - Get alias id for the given device_node
1924 int id = -ENODEV; in of_alias_get_id()
1928 if (strcmp(app->stem, stem) != 0) in of_alias_get_id()
1931 if (np == app->np) { in of_alias_get_id()
1932 id = app->id; in of_alias_get_id()
1943 * of_alias_get_highest_id - Get highest alias id for the given stem
1952 int id = -ENODEV; in of_alias_get_highest_id()
1956 if (strcmp(app->stem, stem) != 0) in of_alias_get_highest_id()
1959 if (app->id > id) in of_alias_get_highest_id()
1960 id = app->id; in of_alias_get_highest_id()
1969 * of_console_check() - Test and setup console for DT setup
1970 * @dn: Pointer to device node
1974 * Check if the given device node matches the stdout-path property in the
1975 * /chosen node. If it does then register it as the preferred console.
1993 * of_find_next_cache_node - Find a node's subsidiary cache
1994 * @np: node of type "cpu" or "cache"
1996 * Return: A node pointer with refcount incremented, use
2002 struct device_node *child, *cache_node; in of_find_next_cache_node() local
2004 cache_node = of_parse_phandle(np, "l2-cache", 0); in of_find_next_cache_node()
2006 cache_node = of_parse_phandle(np, "next-level-cache", 0); in of_find_next_cache_node()
2011 /* OF on pmac has nodes instead of properties named "l2-cache" in of_find_next_cache_node()
2015 for_each_child_of_node(np, child) in of_find_next_cache_node()
2016 if (of_node_is_type(child, "cache")) in of_find_next_cache_node()
2017 return child; in of_find_next_cache_node()
2023 * of_find_last_cache_level - Find the level at which the last cache is
2042 of_property_read_u32(prev, "cache-level", &cache_level); in of_find_last_cache_level()
2049 * of_map_id - Translate an ID through a downstream mapping.
2050 * @np: root complex device node.
2054 * @target: optional pointer to a target device node.
2057 * Given a device ID, look up the appropriate implementation-defined
2059 * ID, as per the "iommu-map" and "msi-map" bindings. Either of @target or
2061 * a non-NULL device node pointer, only entries targeting that node will be
2062 * matched; if it points to a NULL value, it will receive the device node of
2076 return -EINVAL; in of_map_id()
2081 return -ENODEV; in of_map_id()
2090 return -EINVAL; in of_map_id()
2097 * Can be overridden by "{iommu,msi}-map-mask" property. in of_map_id()
2104 for ( ; map_len > 0; map_len -= 4 * sizeof(*map), map += 4) { in of_map_id()
2112 pr_err("%pOF: Invalid %s translation - %s-mask (0x%x) ignores id-base (0x%x)\n", in of_map_id()
2115 return -EFAULT; in of_map_id()
2123 return -ENODEV; in of_map_id()
2136 *id_out = masked_id - id_base + out_base; in of_map_id()
2138 …pr_debug("%pOF: %s, using mask %08x, id-base: %08x, out-base: %08x, length: %08x, id: %08x -> %08x… in of_map_id()
2140 id_len, id, masked_id - id_base + out_base); in of_map_id()