Lines Matching +full:no +full:- +full:bar +full:- +full:match +full:- +full:nbits
1 // SPDX-License-Identifier: GPL-2.0+
6 * Copyright (C) 1996-2005 Paul Mackerras.
66 node_name = kbasename(np->full_name); in of_node_name_eq()
67 len = strchrnul(node_name, '@') - node_name; in of_node_name_eq()
78 return strncmp(kbasename(np->full_name), prefix, strlen(prefix)) == 0; in of_node_name_prefix()
84 const char *match = __of_get_property(np, "device_type", NULL); in __of_node_is_type() local
86 return np && match && type && !strcmp(match, type); in __of_node_is_type()
93 for (; np; np = np->parent) in of_bus_n_addr_cells()
94 if (!of_property_read_u32(np, "#address-cells", &cells)) in of_bus_n_addr_cells()
97 /* No #address-cells property for the root node */ in of_bus_n_addr_cells()
103 if (np->parent) in of_n_addr_cells()
104 np = np->parent; in of_n_addr_cells()
114 for (; np; np = np->parent) in of_bus_n_size_cells()
115 if (!of_property_read_u32(np, "#size-cells", &cells)) in of_bus_n_size_cells()
118 /* No #size-cells property for the root node */ in of_bus_n_size_cells()
124 if (np->parent) in of_n_size_cells()
125 np = np->parent; in of_n_size_cells()
162 if (np && handle == np->phandle) in __of_phandle_cache_inv_entry()
181 if (np->phandle && !phandle_cache[of_phandle_cache_hash(np->phandle)]) in of_core_init()
182 phandle_cache[of_phandle_cache_hash(np->phandle)] = np; in of_core_init()
188 proc_symlink("device-tree", NULL, "/sys/firmware/devicetree/base"); in of_core_init()
199 for (pp = np->properties; pp; pp = pp->next) { in __of_find_property()
200 if (of_prop_cmp(pp->name, name) == 0) { in __of_find_property()
202 *lenp = pp->length; in __of_find_property()
230 } else if (prev->child) { in __of_find_all_nodes()
231 np = prev->child; in __of_find_all_nodes()
235 while (np->parent && !np->sibling) in __of_find_all_nodes()
236 np = np->parent; in __of_find_all_nodes()
237 np = np->sibling; /* Might be null at the end of the tree */ in __of_find_all_nodes()
243 * of_find_all_nodes - Get next node in global list
273 return pp ? pp->value : NULL; in __of_get_property()
285 return pp ? pp->value : NULL; in of_get_property()
290 * arch_match_cpu_phys_id - Match the given logical CPU and physical id
296 * However this __weak function provides a default match of physical
298 * from the device tree which must match the hardware internal registers.
340 * arch_find_n_match_cpu_physical_id - See if the given device node is
342 * else false. If 'thread' is non-NULL, the local thread number within the
348 /* Check for non-standard "ibm,ppc-interrupt-server#s" property in arch_find_n_match_cpu_physical_id()
354 "ibm,ppc-interrupt-server#s", in arch_find_n_match_cpu_physical_id()
362 * of_get_cpu_node - Get device node associated with the given logical CPU
398 * Returns -ENODEV if the CPU is not found.
414 return -ENODEV; in of_cpu_node_to_id()
419 * of_get_cpu_state_node - Get CPU's idle state node at the given index
425 * a flattened description through the "cpu-idle-states" binding or via the
426 * hierarchical layout, using the "power-domains" and the "domain-idle-states"
439 err = of_parse_phandle_with_args(cpu_node, "power-domains", in of_get_cpu_state_node()
440 "#power-domain-cells", 0, &args); in of_get_cpu_state_node()
443 of_parse_phandle(args.np, "domain-idle-states", index); in of_get_cpu_state_node()
450 return of_parse_phandle(cpu_node, "cpu-idle-states", index); in of_get_cpu_state_node()
455 * __of_device_is_compatible() - Check if the node matches given constraints
457 * @compat: required compatible string, NULL or "" for any match
458 * @type: required device_type value, NULL or "" for any match
459 * @name: required node name, NULL or "" for any match
461 * Checks if the given @compat, @type and @name strings match the
465 * Returns 0 for no match, and a positive integer on match. The return
491 /* Compatible match has highest priority */ in __of_device_is_compatible()
497 score = INT_MAX/2 - (index << 2); in __of_device_is_compatible()
539 * a NULL terminated array of strings. Returns the best match
561 * of_machine_is_compatible - Test root of device tree for a given compatible value
582 * __of_device_is_available - check if a device is available for use
610 * of_device_is_available - check if a device is available for use
631 * of_device_is_big_endian - check if a device has BE registers
635 * Returns true if the device has a "big-endian" property, or if the kernel
636 * was compiled for BE *and* the device has a "native-endian" property.
644 if (of_property_read_bool(device, "big-endian")) in of_device_is_big_endian()
647 of_property_read_bool(device, "native-endian")) in of_device_is_big_endian()
654 * of_get_parent - Get a node's parent if any
669 np = of_node_get(node->parent); in of_get_parent()
676 * of_get_next_parent - Iterate to a node's parent
695 parent = of_node_get(node->parent); in of_get_next_parent()
710 next = prev ? prev->sibling : node->child; in __of_get_next_child()
711 for (; next; next = next->sibling) in __of_get_next_child()
722 * of_get_next_child - Iterate a node childs
744 * of_get_next_available_child - Find the next available child node
761 next = prev ? prev->sibling : node->child; in of_get_next_available_child()
762 for (; next; next = next->sibling) { in of_get_next_available_child()
775 * of_get_next_cpu_node - Iterate on cpu nodes
793 next = prev->sibling; in of_get_next_cpu_node()
795 next = node->child; in of_get_next_cpu_node()
798 for (; next; next = next->sibling) { in of_get_next_cpu_node()
812 * of_get_compatible_child - Find compatible child node
837 * of_get_child_by_name - Find the child node by name for a given parent
870 const char *name = kbasename(child->full_name); in __of_find_node_by_path()
896 * of_find_node_opts_by_path - Find a node matching a full OF path
897 * @path: Either the full path to match, or if the path does not
906 * /foo/bar Full path
908 * foo/bar Valid alias + relative path
933 len = p - path; in of_find_node_opts_by_path()
940 if (strlen(pp->name) == len && !strncmp(pp->name, path, len)) { in of_find_node_opts_by_path()
941 np = of_find_node_by_path(pp->value); in of_find_node_opts_by_path()
961 * of_find_node_by_name - Find a node by its "name" property
966 * @name: The name string to match against
988 * of_find_node_by_type - Find a node by its "device_type" property
994 * @type: The type string to match against
1016 * of_find_compatible_node - Find a node based on type and one of the
1022 * @type: The type string to match "device_type" or NULL to ignore
1023 * @compatible: The string to match to one of the tokens in the device
1047 * of_find_node_with_property - Find a node which has a property with
1067 for (pp = np->properties; pp; pp = pp->next) { in of_find_node_with_property()
1068 if (of_prop_cmp(pp->name, prop_name) == 0) { in of_find_node_with_property()
1091 for (; matches->name[0] || matches->type[0] || matches->compatible[0]; matches++) { in __of_match_node()
1092 score = __of_device_is_compatible(node, matches->compatible, in __of_match_node()
1093 matches->type, matches->name); in __of_match_node()
1104 * of_match_node - Tell if a device_node has a matching of_match structure
1105 * @matches: array of of device match structures to search in
1106 * @node: the of device structure to match against
1113 const struct of_device_id *match; in of_match_node() local
1117 match = __of_match_node(matches, node); in of_match_node()
1119 return match; in of_match_node()
1124 * of_find_matching_node_and_match - Find a node based on an of_device_id
1125 * match table.
1130 * @matches: array of of device match structures to search in
1131 * @match Updated to point at the matches entry which matched
1138 const struct of_device_id **match) in of_find_matching_node_and_match() argument
1144 if (match) in of_find_matching_node_and_match()
1145 *match = NULL; in of_find_matching_node_and_match()
1151 if (match) in of_find_matching_node_and_match()
1152 *match = m; in of_find_matching_node_and_match()
1163 * of_modalias_node - Lookup appropriate modalias for a device node
1182 return -ENODEV; in of_modalias_node()
1190 * of_find_node_by_phandle - Find a node given a phandle
1210 handle == phandle_cache[handle_hash]->phandle) in of_find_node_by_phandle()
1215 if (np->phandle == handle && in of_find_node_by_phandle()
1231 printk("%s %pOF", msg, args->np); in of_print_phandle_args()
1232 for (i = 0; i < args->args_count; i++) { in of_print_phandle_args()
1235 pr_cont("%c%08x", delim, args->args[i]); in of_print_phandle_args()
1256 return -EINVAL; in of_phandle_iterator_init()
1260 return -ENOENT; in of_phandle_iterator_init()
1262 it->cells_name = cells_name; in of_phandle_iterator_init()
1263 it->cell_count = cell_count; in of_phandle_iterator_init()
1264 it->parent = np; in of_phandle_iterator_init()
1265 it->list_end = list + size / sizeof(*list); in of_phandle_iterator_init()
1266 it->phandle_end = list; in of_phandle_iterator_init()
1267 it->cur = list; in of_phandle_iterator_init()
1277 if (it->node) { in of_phandle_iterator_next()
1278 of_node_put(it->node); in of_phandle_iterator_next()
1279 it->node = NULL; in of_phandle_iterator_next()
1282 if (!it->cur || it->phandle_end >= it->list_end) in of_phandle_iterator_next()
1283 return -ENOENT; in of_phandle_iterator_next()
1285 it->cur = it->phandle_end; in of_phandle_iterator_next()
1287 /* If phandle is 0, then it is an empty entry with no arguments. */ in of_phandle_iterator_next()
1288 it->phandle = be32_to_cpup(it->cur++); in of_phandle_iterator_next()
1290 if (it->phandle) { in of_phandle_iterator_next()
1293 * Find the provider node and parse the #*-cells property to in of_phandle_iterator_next()
1296 it->node = of_find_node_by_phandle(it->phandle); in of_phandle_iterator_next()
1298 if (it->cells_name) { in of_phandle_iterator_next()
1299 if (!it->node) { in of_phandle_iterator_next()
1301 it->parent); in of_phandle_iterator_next()
1305 if (of_property_read_u32(it->node, it->cells_name, in of_phandle_iterator_next()
1312 if (it->cell_count >= 0) { in of_phandle_iterator_next()
1313 count = it->cell_count; in of_phandle_iterator_next()
1316 it->parent, in of_phandle_iterator_next()
1317 it->cells_name, in of_phandle_iterator_next()
1318 it->node); in of_phandle_iterator_next()
1323 count = it->cell_count; in of_phandle_iterator_next()
1330 if (it->cur + count > it->list_end) { in of_phandle_iterator_next()
1332 it->parent, it->cells_name, in of_phandle_iterator_next()
1333 count, it->cell_count); 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()
1385 * or return -ENOENT for an empty entry. in __of_parse_phandle_with_args()
1387 rc = -ENOENT; in __of_parse_phandle_with_args()
1396 out_args->args, in __of_parse_phandle_with_args()
1398 out_args->np = it.node; in __of_parse_phandle_with_args()
1399 out_args->args_count = c; in __of_parse_phandle_with_args()
1413 * -ENOENT : index is for empty phandle in __of_parse_phandle_with_args()
1414 * -EINVAL : parsing error on data in __of_parse_phandle_with_args()
1423 * of_parse_phandle - Resolve a phandle property to a device_node pointer
1449 * of_parse_phandle_with_args() - Find a node pointed by phandle in a list
1460 * Caller is responsible to call of_node_put() on the returned out_args->np
1466 * #list-cells = <2>;
1470 * #list-cells = <1>;
1478 * of_parse_phandle_with_args(node3, "list", "#list-cells", 1, &args);
1484 int cell_count = -1; in of_parse_phandle_with_args()
1487 return -EINVAL; in of_parse_phandle_with_args()
1499 * of_parse_phandle_with_args_map() - Find a node pointed by phandle in a list and remap it
1510 * a <@stem_name>-map property.
1512 * Caller is responsible to call of_node_put() on the returned out_args->np
1518 * #list-cells = <2>;
1522 * #list-cells = <1>;
1526 * #list-cells = <1>;
1527 * list-map = <0 &phandle2 3>,
1530 * list-map-mask = <0x3>;
1553 int i, ret, map_len, match; in of_parse_phandle_with_args_map() local
1557 return -EINVAL; in of_parse_phandle_with_args_map()
1559 cells_name = kasprintf(GFP_KERNEL, "#%s-cells", stem_name); in of_parse_phandle_with_args_map()
1561 return -ENOMEM; in of_parse_phandle_with_args_map()
1563 ret = -ENOMEM; in of_parse_phandle_with_args_map()
1564 map_name = kasprintf(GFP_KERNEL, "%s-map", stem_name); in of_parse_phandle_with_args_map()
1568 mask_name = kasprintf(GFP_KERNEL, "%s-map-mask", stem_name); in of_parse_phandle_with_args_map()
1572 pass_name = kasprintf(GFP_KERNEL, "%s-map-pass-thru", stem_name); in of_parse_phandle_with_args_map()
1576 ret = __of_parse_phandle_with_args(np, list_name, cells_name, -1, index, in of_parse_phandle_with_args_map()
1581 /* Get the #<list>-cells property */ in of_parse_phandle_with_args_map()
1582 cur = out_args->np; in of_parse_phandle_with_args_map()
1587 /* Precalculate the match array - this simplifies match loop */ in of_parse_phandle_with_args_map()
1589 initial_match_array[i] = cpu_to_be32(out_args->args[i]); in of_parse_phandle_with_args_map()
1591 ret = -EINVAL; in of_parse_phandle_with_args_map()
1593 /* Get the <list>-map property */ in of_parse_phandle_with_args_map()
1601 /* Get the <list>-map-mask property (optional) */ in of_parse_phandle_with_args_map()
1605 /* Iterate through <list>-map property */ in of_parse_phandle_with_args_map()
1606 match = 0; in of_parse_phandle_with_args_map()
1607 while (map_len > (list_size + 1) && !match) { in of_parse_phandle_with_args_map()
1609 match = 1; in of_parse_phandle_with_args_map()
1610 for (i = 0; i < list_size; i++, map_len--) in of_parse_phandle_with_args_map()
1611 match &= !((match_array[i] ^ *map++) & mask[i]); in of_parse_phandle_with_args_map()
1616 map_len--; in of_parse_phandle_with_args_map()
1623 match = 0; in of_parse_phandle_with_args_map()
1635 /* Move forward by new node's #<list>-cells amount */ in of_parse_phandle_with_args_map()
1637 map_len -= new_size; in of_parse_phandle_with_args_map()
1639 if (!match) in of_parse_phandle_with_args_map()
1642 /* Get the <list>-map-pass-thru property (optional) */ in of_parse_phandle_with_args_map()
1648 * Successfully parsed a <list>-map translation; copy new in of_parse_phandle_with_args_map()
1650 * bits specified in <list>-map-pass-thru. in of_parse_phandle_with_args_map()
1652 match_array = map - new_size; in of_parse_phandle_with_args_map()
1654 __be32 val = *(map - new_size + i); in of_parse_phandle_with_args_map()
1658 val |= cpu_to_be32(out_args->args[i]) & pass[i]; in of_parse_phandle_with_args_map()
1661 out_args->args[i] = be32_to_cpu(val); in of_parse_phandle_with_args_map()
1663 out_args->args_count = list_size = new_size; in of_parse_phandle_with_args_map()
1665 out_args->np = new; in of_parse_phandle_with_args_map()
1683 * of_parse_phandle_with_fixed_args() - Find a node pointed by phandle in a list
1694 * Caller is responsible to call of_node_put() on the returned out_args->np
1717 return -EINVAL; in of_parse_phandle_with_fixed_args()
1724 * of_count_phandle_with_args() - Find the number of phandles references in a property
1732 * by a property in the phandle-target node. For example, a gpios
1735 * determined by the #gpio-cells property in the node pointed to by the
1747 * phandle and no arguments are to consider. So we don't iterate through in of_count_phandle_with_args()
1756 return -ENOENT; in of_count_phandle_with_args()
1761 rc = of_phandle_iterator_init(&it, np, list_name, cells_name, -1); in of_count_phandle_with_args()
1768 if (rc != -ENOENT) in of_count_phandle_with_args()
1776 * __of_add_property - Add a property to a node without lock operations
1782 prop->next = NULL; in __of_add_property()
1783 next = &np->properties; in __of_add_property()
1785 if (strcmp(prop->name, (*next)->name) == 0) in __of_add_property()
1787 return -EEXIST; in __of_add_property()
1789 next = &(*next)->next; in __of_add_property()
1797 * of_add_property - Add a property to a node
1825 for (next = &np->properties; *next; next = &(*next)->next) { in __of_remove_property()
1830 return -ENODEV; in __of_remove_property()
1833 *next = prop->next; in __of_remove_property()
1834 prop->next = np->deadprops; in __of_remove_property()
1835 np->deadprops = prop; in __of_remove_property()
1841 * of_remove_property - Remove a property from a node.
1844 * who-knows-how-many pointers to the data using get-property.
1854 return -ENODEV; in of_remove_property()
1879 for (next = &np->properties; *next; next = &(*next)->next) { in __of_update_property()
1880 if (of_prop_cmp((*next)->name, newprop->name) == 0) in __of_update_property()
1887 newprop->next = oldprop->next; in __of_update_property()
1889 oldprop->next = np->deadprops; in __of_update_property()
1890 np->deadprops = oldprop; in __of_update_property()
1893 newprop->next = NULL; in __of_update_property()
1901 * of_update_property - Update a property in a node, if the property does
1905 * who-knows-how-many pointers to the data using get-property.
1915 if (!newprop->name) in of_update_property()
1916 return -EINVAL; in of_update_property()
1938 ap->np = np; in of_alias_add()
1939 ap->id = id; in of_alias_add()
1940 strncpy(ap->stem, stem, stem_len); in of_alias_add()
1941 ap->stem[stem_len] = 0; in of_alias_add()
1942 list_add_tail(&ap->link, &aliases_lookup); in of_alias_add()
1944 ap->alias, ap->stem, ap->id, np); in of_alias_add()
1948 * of_alias_scan - Scan all properties of the 'aliases' node
1967 /* linux,stdout-path and /aliases/stdout are for legacy compatibility */ in of_alias_scan()
1970 if (of_property_read_string(of_chosen, "stdout-path", &name)) in of_alias_scan()
1971 of_property_read_string(of_chosen, "linux,stdout-path", in of_alias_scan()
1983 const char *start = pp->name; in of_alias_scan()
1990 if (!strcmp(pp->name, "name") || in of_alias_scan()
1991 !strcmp(pp->name, "phandle") || in of_alias_scan()
1992 !strcmp(pp->name, "linux,phandle")) in of_alias_scan()
1995 np = of_find_node_by_path(pp->value); in of_alias_scan()
2001 while (isdigit(*(end-1)) && end > start) in of_alias_scan()
2002 end--; in of_alias_scan()
2003 len = end - start; in of_alias_scan()
2013 ap->alias = start; in of_alias_scan()
2019 * of_alias_get_id - Get alias id for the given device_node
2029 int id = -ENODEV; in of_alias_get_id()
2033 if (strcmp(app->stem, stem) != 0) in of_alias_get_id()
2036 if (np == app->np) { in of_alias_get_id()
2037 id = app->id; in of_alias_get_id()
2048 * of_alias_get_alias_list - Get alias list for the given device driver
2049 * @matches: Array of OF device match structures to search in
2052 * @nbits: Maximum number of alias IDs which can be recorded in bitmap
2055 * device match structures and alias stem.
2057 * Return: 0 or -ENOSYS when !CONFIG_OF or
2058 * -EOVERFLOW if alias ID is greater then allocated nbits
2062 unsigned int nbits) in of_alias_get_alias_list() argument
2068 bitmap_zero(bitmap, nbits); in of_alias_get_alias_list()
2074 __func__, app->stem, app->id); in of_alias_get_alias_list()
2076 if (strcmp(app->stem, stem) != 0) { in of_alias_get_alias_list()
2078 __func__, app->stem); in of_alias_get_alias_list()
2082 if (of_match_node(matches, app->np)) { in of_alias_get_alias_list()
2083 pr_debug("%s: Allocated ID %d\n", __func__, app->id); in of_alias_get_alias_list()
2085 if (app->id >= nbits) { in of_alias_get_alias_list()
2087 __func__, app->id, nbits); in of_alias_get_alias_list()
2088 ret = -EOVERFLOW; in of_alias_get_alias_list()
2090 set_bit(app->id, bitmap); in of_alias_get_alias_list()
2101 * of_alias_get_highest_id - Get highest alias id for the given stem
2110 int id = -ENODEV; in of_alias_get_highest_id()
2114 if (strcmp(app->stem, stem) != 0) in of_alias_get_highest_id()
2117 if (app->id > id) in of_alias_get_highest_id()
2118 id = app->id; in of_alias_get_highest_id()
2127 * of_console_check() - Test and setup console for DT setup
2128 * @dn - Pointer to device node
2129 * @name - Name to use for preferred console without index. ex. "ttyS"
2130 * @index - Index to use for preferred console.
2132 * Check if the given device node matches the stdout-path property in the
2150 * of_find_next_cache_node - Find a node's subsidiary cache
2161 cache_node = of_parse_phandle(np, "l2-cache", 0); in of_find_next_cache_node()
2163 cache_node = of_parse_phandle(np, "next-level-cache", 0); in of_find_next_cache_node()
2168 /* OF on pmac has nodes instead of properties named "l2-cache" in of_find_next_cache_node()
2180 * of_find_last_cache_level - Find the level at which the last cache is
2199 of_property_read_u32(prev, "cache-level", &cache_level); in of_find_last_cache_level()
2205 * of_map_id - Translate an ID through a downstream mapping.
2213 * Given a device ID, look up the appropriate implementation-defined
2215 * ID, as per the "iommu-map" and "msi-map" bindings. Either of @target or
2217 * a non-NULL device node pointer, only entries targeting that node will be
2232 return -EINVAL; in of_map_id()
2237 return -ENODEV; in of_map_id()
2238 /* Otherwise, no map implies no translation */ in of_map_id()
2246 return -EINVAL; in of_map_id()
2253 * Can be overridden by "{iommu,msi}-map-mask" property. in of_map_id()
2260 for ( ; map_len > 0; map_len -= 4 * sizeof(*map), map += 4) { in of_map_id()
2268 pr_err("%pOF: Invalid %s translation - %s-mask (0x%x) ignores id-base (0x%x)\n", in of_map_id()
2271 return -EFAULT; in of_map_id()
2279 return -ENODEV; in of_map_id()
2292 *id_out = masked_id - id_base + out_base; in of_map_id()
2294 …pr_debug("%pOF: %s, using mask %08x, id-base: %08x, out-base: %08x, length: %08x, id: %08x -> %08x… in of_map_id()
2296 id_len, id, masked_id - id_base + out_base); in of_map_id()
2300 pr_info("%pOF: no %s translation for id 0x%x on %pOF\n", np, map_name, in of_map_id()