2 * Procedures for creating, accessing and interpreting the device tree.
4 * Paul Mackerras August 1996.
5 * Copyright (C) 1996-2005 Paul Mackerras.
7 * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner.
8 * {engebret|bergner}@us.ibm.com
10 * Adapted for sparc and sparc64 by David S. Miller davem@davemloft.net
12 * Reconsolidated from arch/x/kernel/prom.c by Stephen Rothwell and
15 * This program is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU General Public License
17 * as published by the Free Software Foundation; either version
18 * 2 of the License, or (at your option) any later version.
20 #include <linux/ctype.h>
21 #include <linux/cpu.h>
22 #include <linux/module.h>
24 #include <linux/spinlock.h>
25 #include <linux/slab.h>
26 #include <linux/proc_fs.h>
28 #include "of_private.h"
30 LIST_HEAD(aliases_lookup);
32 struct device_node *of_allnodes;
33 EXPORT_SYMBOL(of_allnodes);
34 struct device_node *of_chosen;
35 struct device_node *of_aliases;
36 static struct device_node *of_stdout;
38 DEFINE_MUTEX(of_aliases_mutex);
40 /* use when traversing tree through the allnext, child, sibling,
41 * or parent members of struct device_node.
43 DEFINE_RAW_SPINLOCK(devtree_lock);
45 int of_n_addr_cells(struct device_node *np)
52 ip = of_get_property(np, "#address-cells", NULL);
54 return be32_to_cpup(ip);
56 /* No #address-cells property for the root node */
57 return OF_ROOT_NODE_ADDR_CELLS_DEFAULT;
59 EXPORT_SYMBOL(of_n_addr_cells);
61 int of_n_size_cells(struct device_node *np)
68 ip = of_get_property(np, "#size-cells", NULL);
70 return be32_to_cpup(ip);
72 /* No #size-cells property for the root node */
73 return OF_ROOT_NODE_SIZE_CELLS_DEFAULT;
75 EXPORT_SYMBOL(of_n_size_cells);
78 int __weak of_node_to_nid(struct device_node *np)
80 return numa_node_id();
84 #if defined(CONFIG_OF_DYNAMIC)
86 * of_node_get - Increment refcount of a node
87 * @node: Node to inc refcount, NULL is supported to
88 * simplify writing of callers
92 struct device_node *of_node_get(struct device_node *node)
95 kref_get(&node->kref);
98 EXPORT_SYMBOL(of_node_get);
100 static inline struct device_node *kref_to_device_node(struct kref *kref)
102 return container_of(kref, struct device_node, kref);
106 * of_node_release - release a dynamically allocated node
107 * @kref: kref element of the node to be released
109 * In of_node_put() this function is passed to kref_put()
112 static void of_node_release(struct kref *kref)
114 struct device_node *node = kref_to_device_node(kref);
115 struct property *prop = node->properties;
117 /* We should never be releasing nodes that haven't been detached. */
118 if (!of_node_check_flag(node, OF_DETACHED)) {
119 pr_err("ERROR: Bad of_node_put() on %s\n", node->full_name);
121 kref_init(&node->kref);
125 if (!of_node_check_flag(node, OF_DYNAMIC))
129 struct property *next = prop->next;
136 prop = node->deadprops;
137 node->deadprops = NULL;
140 kfree(node->full_name);
146 * of_node_put - Decrement refcount of a node
147 * @node: Node to dec refcount, NULL is supported to
148 * simplify writing of callers
151 void of_node_put(struct device_node *node)
154 kref_put(&node->kref, of_node_release);
156 EXPORT_SYMBOL(of_node_put);
157 #endif /* CONFIG_OF_DYNAMIC */
159 static struct property *__of_find_property(const struct device_node *np,
160 const char *name, int *lenp)
167 for (pp = np->properties; pp; pp = pp->next) {
168 if (of_prop_cmp(pp->name, name) == 0) {
178 struct property *of_find_property(const struct device_node *np,
185 raw_spin_lock_irqsave(&devtree_lock, flags);
186 pp = __of_find_property(np, name, lenp);
187 raw_spin_unlock_irqrestore(&devtree_lock, flags);
191 EXPORT_SYMBOL(of_find_property);
194 * of_find_all_nodes - Get next node in global list
195 * @prev: Previous node or NULL to start iteration
196 * of_node_put() will be called on it
198 * Returns a node pointer with refcount incremented, use
199 * of_node_put() on it when done.
201 struct device_node *of_find_all_nodes(struct device_node *prev)
203 struct device_node *np;
206 raw_spin_lock_irqsave(&devtree_lock, flags);
207 np = prev ? prev->allnext : of_allnodes;
208 for (; np != NULL; np = np->allnext)
212 raw_spin_unlock_irqrestore(&devtree_lock, flags);
215 EXPORT_SYMBOL(of_find_all_nodes);
218 * Find a property with a given name for a given node
219 * and return the value.
221 static const void *__of_get_property(const struct device_node *np,
222 const char *name, int *lenp)
224 struct property *pp = __of_find_property(np, name, lenp);
226 return pp ? pp->value : NULL;
230 * Find a property with a given name for a given node
231 * and return the value.
233 const void *of_get_property(const struct device_node *np, const char *name,
236 struct property *pp = of_find_property(np, name, lenp);
238 return pp ? pp->value : NULL;
240 EXPORT_SYMBOL(of_get_property);
243 * arch_match_cpu_phys_id - Match the given logical CPU and physical id
245 * @cpu: logical cpu index of a core/thread
246 * @phys_id: physical identifier of a core/thread
248 * CPU logical to physical index mapping is architecture specific.
249 * However this __weak function provides a default match of physical
250 * id to logical cpu index. phys_id provided here is usually values read
251 * from the device tree which must match the hardware internal registers.
253 * Returns true if the physical identifier and the logical cpu index
254 * correspond to the same core/thread, false otherwise.
256 bool __weak arch_match_cpu_phys_id(int cpu, u64 phys_id)
258 return (u32)phys_id == cpu;
262 * Checks if the given "prop_name" property holds the physical id of the
263 * core/thread corresponding to the logical cpu 'cpu'. If 'thread' is not
264 * NULL, local thread number within the core is returned in it.
266 static bool __of_find_n_match_cpu_property(struct device_node *cpun,
267 const char *prop_name, int cpu, unsigned int *thread)
270 int ac, prop_len, tid;
273 ac = of_n_addr_cells(cpun);
274 cell = of_get_property(cpun, prop_name, &prop_len);
277 prop_len /= sizeof(*cell) * ac;
278 for (tid = 0; tid < prop_len; tid++) {
279 hwid = of_read_number(cell, ac);
280 if (arch_match_cpu_phys_id(cpu, hwid)) {
291 * arch_find_n_match_cpu_physical_id - See if the given device node is
292 * for the cpu corresponding to logical cpu 'cpu'. Return true if so,
293 * else false. If 'thread' is non-NULL, the local thread number within the
294 * core is returned in it.
296 bool __weak arch_find_n_match_cpu_physical_id(struct device_node *cpun,
297 int cpu, unsigned int *thread)
299 /* Check for non-standard "ibm,ppc-interrupt-server#s" property
300 * for thread ids on PowerPC. If it doesn't exist fallback to
301 * standard "reg" property.
303 if (IS_ENABLED(CONFIG_PPC) &&
304 __of_find_n_match_cpu_property(cpun,
305 "ibm,ppc-interrupt-server#s",
309 if (__of_find_n_match_cpu_property(cpun, "reg", cpu, thread))
316 * of_get_cpu_node - Get device node associated with the given logical CPU
318 * @cpu: CPU number(logical index) for which device node is required
319 * @thread: if not NULL, local thread number within the physical core is
322 * The main purpose of this function is to retrieve the device node for the
323 * given logical CPU index. It should be used to initialize the of_node in
324 * cpu device. Once of_node in cpu device is populated, all the further
325 * references can use that instead.
327 * CPU logical to physical index mapping is architecture specific and is built
328 * before booting secondary cores. This function uses arch_match_cpu_phys_id
329 * which can be overridden by architecture specific implementation.
331 * Returns a node pointer for the logical cpu if found, else NULL.
333 struct device_node *of_get_cpu_node(int cpu, unsigned int *thread)
335 struct device_node *cpun;
337 for_each_node_by_type(cpun, "cpu") {
338 if (arch_find_n_match_cpu_physical_id(cpun, cpu, thread))
343 EXPORT_SYMBOL(of_get_cpu_node);
345 /** Checks if the given "compat" string matches one of the strings in
346 * the device's "compatible" property
348 static int __of_device_is_compatible(const struct device_node *device,
354 cp = __of_get_property(device, "compatible", &cplen);
358 if (of_compat_cmp(cp, compat, strlen(compat)) == 0)
368 /** Checks if the given "compat" string matches one of the strings in
369 * the device's "compatible" property
371 int of_device_is_compatible(const struct device_node *device,
377 raw_spin_lock_irqsave(&devtree_lock, flags);
378 res = __of_device_is_compatible(device, compat);
379 raw_spin_unlock_irqrestore(&devtree_lock, flags);
382 EXPORT_SYMBOL(of_device_is_compatible);
385 * of_machine_is_compatible - Test root of device tree for a given compatible value
386 * @compat: compatible string to look for in root node's compatible property.
388 * Returns true if the root node has the given value in its
389 * compatible property.
391 int of_machine_is_compatible(const char *compat)
393 struct device_node *root;
396 root = of_find_node_by_path("/");
398 rc = of_device_is_compatible(root, compat);
403 EXPORT_SYMBOL(of_machine_is_compatible);
406 * __of_device_is_available - check if a device is available for use
408 * @device: Node to check for availability, with locks already held
410 * Returns 1 if the status property is absent or set to "okay" or "ok",
413 static int __of_device_is_available(const struct device_node *device)
421 status = __of_get_property(device, "status", &statlen);
426 if (!strcmp(status, "okay") || !strcmp(status, "ok"))
434 * of_device_is_available - check if a device is available for use
436 * @device: Node to check for availability
438 * Returns 1 if the status property is absent or set to "okay" or "ok",
441 int of_device_is_available(const struct device_node *device)
446 raw_spin_lock_irqsave(&devtree_lock, flags);
447 res = __of_device_is_available(device);
448 raw_spin_unlock_irqrestore(&devtree_lock, flags);
452 EXPORT_SYMBOL(of_device_is_available);
455 * of_get_parent - Get a node's parent if any
456 * @node: Node to get parent
458 * Returns a node pointer with refcount incremented, use
459 * of_node_put() on it when done.
461 struct device_node *of_get_parent(const struct device_node *node)
463 struct device_node *np;
469 raw_spin_lock_irqsave(&devtree_lock, flags);
470 np = of_node_get(node->parent);
471 raw_spin_unlock_irqrestore(&devtree_lock, flags);
474 EXPORT_SYMBOL(of_get_parent);
477 * of_get_next_parent - Iterate to a node's parent
478 * @node: Node to get parent of
480 * This is like of_get_parent() except that it drops the
481 * refcount on the passed node, making it suitable for iterating
482 * through a node's parents.
484 * Returns a node pointer with refcount incremented, use
485 * of_node_put() on it when done.
487 struct device_node *of_get_next_parent(struct device_node *node)
489 struct device_node *parent;
495 raw_spin_lock_irqsave(&devtree_lock, flags);
496 parent = of_node_get(node->parent);
498 raw_spin_unlock_irqrestore(&devtree_lock, flags);
501 EXPORT_SYMBOL(of_get_next_parent);
504 * of_get_next_child - Iterate a node childs
506 * @prev: previous child of the parent node, or NULL to get first
508 * Returns a node pointer with refcount incremented, use
509 * of_node_put() on it when done.
511 struct device_node *of_get_next_child(const struct device_node *node,
512 struct device_node *prev)
514 struct device_node *next;
517 raw_spin_lock_irqsave(&devtree_lock, flags);
518 next = prev ? prev->sibling : node->child;
519 for (; next; next = next->sibling)
520 if (of_node_get(next))
523 raw_spin_unlock_irqrestore(&devtree_lock, flags);
526 EXPORT_SYMBOL(of_get_next_child);
529 * of_get_next_available_child - Find the next available child node
531 * @prev: previous child of the parent node, or NULL to get first
533 * This function is like of_get_next_child(), except that it
534 * automatically skips any disabled nodes (i.e. status = "disabled").
536 struct device_node *of_get_next_available_child(const struct device_node *node,
537 struct device_node *prev)
539 struct device_node *next;
542 raw_spin_lock_irqsave(&devtree_lock, flags);
543 next = prev ? prev->sibling : node->child;
544 for (; next; next = next->sibling) {
545 if (!__of_device_is_available(next))
547 if (of_node_get(next))
551 raw_spin_unlock_irqrestore(&devtree_lock, flags);
554 EXPORT_SYMBOL(of_get_next_available_child);
557 * of_get_child_by_name - Find the child node by name for a given parent
559 * @name: child name to look for.
561 * This function looks for child node for given matching name
563 * Returns a node pointer if found, with refcount incremented, use
564 * of_node_put() on it when done.
565 * Returns NULL if node is not found.
567 struct device_node *of_get_child_by_name(const struct device_node *node,
570 struct device_node *child;
572 for_each_child_of_node(node, child)
573 if (child->name && (of_node_cmp(child->name, name) == 0))
577 EXPORT_SYMBOL(of_get_child_by_name);
580 * of_find_node_by_path - Find a node matching a full OF path
581 * @path: The full path to match
583 * Returns a node pointer with refcount incremented, use
584 * of_node_put() on it when done.
586 struct device_node *of_find_node_by_path(const char *path)
588 struct device_node *np = of_allnodes;
591 raw_spin_lock_irqsave(&devtree_lock, flags);
592 for (; np; np = np->allnext) {
593 if (np->full_name && (of_node_cmp(np->full_name, path) == 0)
597 raw_spin_unlock_irqrestore(&devtree_lock, flags);
600 EXPORT_SYMBOL(of_find_node_by_path);
603 * of_find_node_by_name - Find a node by its "name" property
604 * @from: The node to start searching from or NULL, the node
605 * you pass will not be searched, only the next one
606 * will; typically, you pass what the previous call
607 * returned. of_node_put() will be called on it
608 * @name: The name string to match against
610 * Returns a node pointer with refcount incremented, use
611 * of_node_put() on it when done.
613 struct device_node *of_find_node_by_name(struct device_node *from,
616 struct device_node *np;
619 raw_spin_lock_irqsave(&devtree_lock, flags);
620 np = from ? from->allnext : of_allnodes;
621 for (; np; np = np->allnext)
622 if (np->name && (of_node_cmp(np->name, name) == 0)
626 raw_spin_unlock_irqrestore(&devtree_lock, flags);
629 EXPORT_SYMBOL(of_find_node_by_name);
632 * of_find_node_by_type - Find a node by its "device_type" property
633 * @from: The node to start searching from, or NULL to start searching
634 * the entire device tree. The node you pass will not be
635 * searched, only the next one will; typically, you pass
636 * what the previous call returned. of_node_put() will be
637 * called on from for you.
638 * @type: The type string to match against
640 * Returns a node pointer with refcount incremented, use
641 * of_node_put() on it when done.
643 struct device_node *of_find_node_by_type(struct device_node *from,
646 struct device_node *np;
649 raw_spin_lock_irqsave(&devtree_lock, flags);
650 np = from ? from->allnext : of_allnodes;
651 for (; np; np = np->allnext)
652 if (np->type && (of_node_cmp(np->type, type) == 0)
656 raw_spin_unlock_irqrestore(&devtree_lock, flags);
659 EXPORT_SYMBOL(of_find_node_by_type);
662 * of_find_compatible_node - Find a node based on type and one of the
663 * tokens in its "compatible" property
664 * @from: The node to start searching from or NULL, the node
665 * you pass will not be searched, only the next one
666 * will; typically, you pass what the previous call
667 * returned. of_node_put() will be called on it
668 * @type: The type string to match "device_type" or NULL to ignore
669 * @compatible: The string to match to one of the tokens in the device
672 * Returns a node pointer with refcount incremented, use
673 * of_node_put() on it when done.
675 struct device_node *of_find_compatible_node(struct device_node *from,
676 const char *type, const char *compatible)
678 struct device_node *np;
681 raw_spin_lock_irqsave(&devtree_lock, flags);
682 np = from ? from->allnext : of_allnodes;
683 for (; np; np = np->allnext) {
685 && !(np->type && (of_node_cmp(np->type, type) == 0)))
687 if (__of_device_is_compatible(np, compatible) &&
692 raw_spin_unlock_irqrestore(&devtree_lock, flags);
695 EXPORT_SYMBOL(of_find_compatible_node);
698 * of_find_node_with_property - Find a node which has a property with
700 * @from: The node to start searching from or NULL, the node
701 * you pass will not be searched, only the next one
702 * will; typically, you pass what the previous call
703 * returned. of_node_put() will be called on it
704 * @prop_name: The name of the property to look for.
706 * Returns a node pointer with refcount incremented, use
707 * of_node_put() on it when done.
709 struct device_node *of_find_node_with_property(struct device_node *from,
710 const char *prop_name)
712 struct device_node *np;
716 raw_spin_lock_irqsave(&devtree_lock, flags);
717 np = from ? from->allnext : of_allnodes;
718 for (; np; np = np->allnext) {
719 for (pp = np->properties; pp; pp = pp->next) {
720 if (of_prop_cmp(pp->name, prop_name) == 0) {
728 raw_spin_unlock_irqrestore(&devtree_lock, flags);
731 EXPORT_SYMBOL(of_find_node_with_property);
734 const struct of_device_id *__of_match_node(const struct of_device_id *matches,
735 const struct device_node *node)
743 cp = __of_get_property(node, "compatible", &cplen);
745 const struct of_device_id *m = matches;
747 /* Check against matches with current compatible string */
748 while (m->name[0] || m->type[0] || m->compatible[0]) {
752 && !strcmp(m->name, node->name);
755 && !strcmp(m->type, node->type);
756 if (m->compatible[0])
758 && !of_compat_cmp(m->compatible, cp,
759 strlen(m->compatible));
765 /* Get node's next compatible string */
771 } while (cp && (cplen > 0));
777 * of_match_node - Tell if an device_node has a matching of_match structure
778 * @matches: array of of device match structures to search in
779 * @node: the of device structure to match against
781 * Low level utility function used by device matching. Matching order
782 * is to compare each of the node's compatibles with all given matches
783 * first. This implies node's compatible is sorted from specific to
784 * generic while matches can be in any order.
786 const struct of_device_id *of_match_node(const struct of_device_id *matches,
787 const struct device_node *node)
789 const struct of_device_id *match;
792 raw_spin_lock_irqsave(&devtree_lock, flags);
793 match = __of_match_node(matches, node);
794 raw_spin_unlock_irqrestore(&devtree_lock, flags);
797 EXPORT_SYMBOL(of_match_node);
800 * of_find_matching_node_and_match - Find a node based on an of_device_id
802 * @from: The node to start searching from or NULL, the node
803 * you pass will not be searched, only the next one
804 * will; typically, you pass what the previous call
805 * returned. of_node_put() will be called on it
806 * @matches: array of of device match structures to search in
807 * @match Updated to point at the matches entry which matched
809 * Returns a node pointer with refcount incremented, use
810 * of_node_put() on it when done.
812 struct device_node *of_find_matching_node_and_match(struct device_node *from,
813 const struct of_device_id *matches,
814 const struct of_device_id **match)
816 struct device_node *np;
817 const struct of_device_id *m;
823 raw_spin_lock_irqsave(&devtree_lock, flags);
824 np = from ? from->allnext : of_allnodes;
825 for (; np; np = np->allnext) {
826 m = __of_match_node(matches, np);
827 if (m && of_node_get(np)) {
834 raw_spin_unlock_irqrestore(&devtree_lock, flags);
837 EXPORT_SYMBOL(of_find_matching_node_and_match);
840 * of_modalias_node - Lookup appropriate modalias for a device node
841 * @node: pointer to a device tree node
842 * @modalias: Pointer to buffer that modalias value will be copied into
843 * @len: Length of modalias value
845 * Based on the value of the compatible property, this routine will attempt
846 * to choose an appropriate modalias value for a particular device tree node.
847 * It does this by stripping the manufacturer prefix (as delimited by a ',')
848 * from the first entry in the compatible list property.
850 * This routine returns 0 on success, <0 on failure.
852 int of_modalias_node(struct device_node *node, char *modalias, int len)
854 const char *compatible, *p;
857 compatible = of_get_property(node, "compatible", &cplen);
858 if (!compatible || strlen(compatible) > cplen)
860 p = strchr(compatible, ',');
861 strlcpy(modalias, p ? p + 1 : compatible, len);
864 EXPORT_SYMBOL_GPL(of_modalias_node);
867 * of_find_node_by_phandle - Find a node given a phandle
868 * @handle: phandle of the node to find
870 * Returns a node pointer with refcount incremented, use
871 * of_node_put() on it when done.
873 struct device_node *of_find_node_by_phandle(phandle handle)
875 struct device_node *np;
878 raw_spin_lock_irqsave(&devtree_lock, flags);
879 for (np = of_allnodes; np; np = np->allnext)
880 if (np->phandle == handle)
883 raw_spin_unlock_irqrestore(&devtree_lock, flags);
886 EXPORT_SYMBOL(of_find_node_by_phandle);
889 * of_property_count_elems_of_size - Count the number of elements in a property
891 * @np: device node from which the property value is to be read.
892 * @propname: name of the property to be searched.
893 * @elem_size: size of the individual element
895 * Search for a property in a device node and count the number of elements of
896 * size elem_size in it. Returns number of elements on sucess, -EINVAL if the
897 * property does not exist or its length does not match a multiple of elem_size
898 * and -ENODATA if the property does not have a value.
900 int of_property_count_elems_of_size(const struct device_node *np,
901 const char *propname, int elem_size)
903 struct property *prop = of_find_property(np, propname, NULL);
910 if (prop->length % elem_size != 0) {
911 pr_err("size of %s in node %s is not a multiple of %d\n",
912 propname, np->full_name, elem_size);
916 return prop->length / elem_size;
918 EXPORT_SYMBOL_GPL(of_property_count_elems_of_size);
921 * of_find_property_value_of_size
923 * @np: device node from which the property value is to be read.
924 * @propname: name of the property to be searched.
925 * @len: requested length of property value
927 * Search for a property in a device node and valid the requested size.
928 * Returns the property value on success, -EINVAL if the property does not
929 * exist, -ENODATA if property does not have a value, and -EOVERFLOW if the
930 * property data isn't large enough.
933 static void *of_find_property_value_of_size(const struct device_node *np,
934 const char *propname, u32 len)
936 struct property *prop = of_find_property(np, propname, NULL);
939 return ERR_PTR(-EINVAL);
941 return ERR_PTR(-ENODATA);
942 if (len > prop->length)
943 return ERR_PTR(-EOVERFLOW);
949 * of_property_read_u32_index - Find and read a u32 from a multi-value property.
951 * @np: device node from which the property value is to be read.
952 * @propname: name of the property to be searched.
953 * @index: index of the u32 in the list of values
954 * @out_value: pointer to return value, modified only if no error.
956 * Search for a property in a device node and read nth 32-bit value from
957 * it. Returns 0 on success, -EINVAL if the property does not exist,
958 * -ENODATA if property does not have a value, and -EOVERFLOW if the
959 * property data isn't large enough.
961 * The out_value is modified only if a valid u32 value can be decoded.
963 int of_property_read_u32_index(const struct device_node *np,
964 const char *propname,
965 u32 index, u32 *out_value)
967 const u32 *val = of_find_property_value_of_size(np, propname,
968 ((index + 1) * sizeof(*out_value)));
973 *out_value = be32_to_cpup(((__be32 *)val) + index);
976 EXPORT_SYMBOL_GPL(of_property_read_u32_index);
979 * of_property_read_u8_array - Find and read an array of u8 from a property.
981 * @np: device node from which the property value is to be read.
982 * @propname: name of the property to be searched.
983 * @out_values: pointer to return value, modified only if return value is 0.
984 * @sz: number of array elements to read
986 * Search for a property in a device node and read 8-bit value(s) from
987 * it. Returns 0 on success, -EINVAL if the property does not exist,
988 * -ENODATA if property does not have a value, and -EOVERFLOW if the
989 * property data isn't large enough.
991 * dts entry of array should be like:
992 * property = /bits/ 8 <0x50 0x60 0x70>;
994 * The out_values is modified only if a valid u8 value can be decoded.
996 int of_property_read_u8_array(const struct device_node *np,
997 const char *propname, u8 *out_values, size_t sz)
999 const u8 *val = of_find_property_value_of_size(np, propname,
1000 (sz * sizeof(*out_values)));
1003 return PTR_ERR(val);
1006 *out_values++ = *val++;
1009 EXPORT_SYMBOL_GPL(of_property_read_u8_array);
1012 * of_property_read_u16_array - Find and read an array of u16 from a property.
1014 * @np: device node from which the property value is to be read.
1015 * @propname: name of the property to be searched.
1016 * @out_values: pointer to return value, modified only if return value is 0.
1017 * @sz: number of array elements to read
1019 * Search for a property in a device node and read 16-bit value(s) from
1020 * it. Returns 0 on success, -EINVAL if the property does not exist,
1021 * -ENODATA if property does not have a value, and -EOVERFLOW if the
1022 * property data isn't large enough.
1024 * dts entry of array should be like:
1025 * property = /bits/ 16 <0x5000 0x6000 0x7000>;
1027 * The out_values is modified only if a valid u16 value can be decoded.
1029 int of_property_read_u16_array(const struct device_node *np,
1030 const char *propname, u16 *out_values, size_t sz)
1032 const __be16 *val = of_find_property_value_of_size(np, propname,
1033 (sz * sizeof(*out_values)));
1036 return PTR_ERR(val);
1039 *out_values++ = be16_to_cpup(val++);
1042 EXPORT_SYMBOL_GPL(of_property_read_u16_array);
1045 * of_property_read_u32_array - Find and read an array of 32 bit integers
1048 * @np: device node from which the property value is to be read.
1049 * @propname: name of the property to be searched.
1050 * @out_values: pointer to return value, modified only if return value is 0.
1051 * @sz: number of array elements to read
1053 * Search for a property in a device node and read 32-bit value(s) from
1054 * it. Returns 0 on success, -EINVAL if the property does not exist,
1055 * -ENODATA if property does not have a value, and -EOVERFLOW if the
1056 * property data isn't large enough.
1058 * The out_values is modified only if a valid u32 value can be decoded.
1060 int of_property_read_u32_array(const struct device_node *np,
1061 const char *propname, u32 *out_values,
1064 const __be32 *val = of_find_property_value_of_size(np, propname,
1065 (sz * sizeof(*out_values)));
1068 return PTR_ERR(val);
1071 *out_values++ = be32_to_cpup(val++);
1074 EXPORT_SYMBOL_GPL(of_property_read_u32_array);
1077 * of_property_read_u64 - Find and read a 64 bit integer from a property
1078 * @np: device node from which the property value is to be read.
1079 * @propname: name of the property to be searched.
1080 * @out_value: pointer to return value, modified only if return value is 0.
1082 * Search for a property in a device node and read a 64-bit value from
1083 * it. Returns 0 on success, -EINVAL if the property does not exist,
1084 * -ENODATA if property does not have a value, and -EOVERFLOW if the
1085 * property data isn't large enough.
1087 * The out_value is modified only if a valid u64 value can be decoded.
1089 int of_property_read_u64(const struct device_node *np, const char *propname,
1092 const __be32 *val = of_find_property_value_of_size(np, propname,
1093 sizeof(*out_value));
1096 return PTR_ERR(val);
1098 *out_value = of_read_number(val, 2);
1101 EXPORT_SYMBOL_GPL(of_property_read_u64);
1104 * of_property_read_string - Find and read a string from a property
1105 * @np: device node from which the property value is to be read.
1106 * @propname: name of the property to be searched.
1107 * @out_string: pointer to null terminated return string, modified only if
1108 * return value is 0.
1110 * Search for a property in a device tree node and retrieve a null
1111 * terminated string value (pointer to data, not a copy). Returns 0 on
1112 * success, -EINVAL if the property does not exist, -ENODATA if property
1113 * does not have a value, and -EILSEQ if the string is not null-terminated
1114 * within the length of the property data.
1116 * The out_string pointer is modified only if a valid string can be decoded.
1118 int of_property_read_string(struct device_node *np, const char *propname,
1119 const char **out_string)
1121 struct property *prop = of_find_property(np, propname, NULL);
1126 if (strnlen(prop->value, prop->length) >= prop->length)
1128 *out_string = prop->value;
1131 EXPORT_SYMBOL_GPL(of_property_read_string);
1134 * of_property_read_string_index - Find and read a string from a multiple
1136 * @np: device node from which the property value is to be read.
1137 * @propname: name of the property to be searched.
1138 * @index: index of the string in the list of strings
1139 * @out_string: pointer to null terminated return string, modified only if
1140 * return value is 0.
1142 * Search for a property in a device tree node and retrieve a null
1143 * terminated string value (pointer to data, not a copy) in the list of strings
1144 * contained in that property.
1145 * Returns 0 on success, -EINVAL if the property does not exist, -ENODATA if
1146 * property does not have a value, and -EILSEQ if the string is not
1147 * null-terminated within the length of the property data.
1149 * The out_string pointer is modified only if a valid string can be decoded.
1151 int of_property_read_string_index(struct device_node *np, const char *propname,
1152 int index, const char **output)
1154 struct property *prop = of_find_property(np, propname, NULL);
1156 size_t l = 0, total = 0;
1163 if (strnlen(prop->value, prop->length) >= prop->length)
1168 for (i = 0; total < prop->length; total += l, p += l) {
1177 EXPORT_SYMBOL_GPL(of_property_read_string_index);
1180 * of_property_match_string() - Find string in a list and return index
1181 * @np: pointer to node containing string list property
1182 * @propname: string list property name
1183 * @string: pointer to string to search for in string list
1185 * This function searches a string list property and returns the index
1186 * of a specific string value.
1188 int of_property_match_string(struct device_node *np, const char *propname,
1191 struct property *prop = of_find_property(np, propname, NULL);
1194 const char *p, *end;
1202 end = p + prop->length;
1204 for (i = 0; p < end; i++, p += l) {
1208 pr_debug("comparing %s with %s\n", string, p);
1209 if (strcmp(string, p) == 0)
1210 return i; /* Found it; return index */
1214 EXPORT_SYMBOL_GPL(of_property_match_string);
1217 * of_property_count_strings - Find and return the number of strings from a
1218 * multiple strings property.
1219 * @np: device node from which the property value is to be read.
1220 * @propname: name of the property to be searched.
1222 * Search for a property in a device tree node and retrieve the number of null
1223 * terminated string contain in it. Returns the number of strings on
1224 * success, -EINVAL if the property does not exist, -ENODATA if property
1225 * does not have a value, and -EILSEQ if the string is not null-terminated
1226 * within the length of the property data.
1228 int of_property_count_strings(struct device_node *np, const char *propname)
1230 struct property *prop = of_find_property(np, propname, NULL);
1232 size_t l = 0, total = 0;
1239 if (strnlen(prop->value, prop->length) >= prop->length)
1244 for (i = 0; total < prop->length; total += l, p += l, i++)
1249 EXPORT_SYMBOL_GPL(of_property_count_strings);
1251 void of_print_phandle_args(const char *msg, const struct of_phandle_args *args)
1254 printk("%s %s", msg, of_node_full_name(args->np));
1255 for (i = 0; i < args->args_count; i++)
1256 printk(i ? ",%08x" : ":%08x", args->args[i]);
1260 static int __of_parse_phandle_with_args(const struct device_node *np,
1261 const char *list_name,
1262 const char *cells_name,
1263 int cell_count, int index,
1264 struct of_phandle_args *out_args)
1266 const __be32 *list, *list_end;
1267 int rc = 0, size, cur_index = 0;
1269 struct device_node *node = NULL;
1272 /* Retrieve the phandle list property */
1273 list = of_get_property(np, list_name, &size);
1276 list_end = list + size / sizeof(*list);
1278 /* Loop over the phandles until all the requested entry is found */
1279 while (list < list_end) {
1284 * If phandle is 0, then it is an empty entry with no
1285 * arguments. Skip forward to the next entry.
1287 phandle = be32_to_cpup(list++);
1290 * Find the provider node and parse the #*-cells
1291 * property to determine the argument length.
1293 * This is not needed if the cell count is hard-coded
1294 * (i.e. cells_name not set, but cell_count is set),
1295 * except when we're going to return the found node
1298 if (cells_name || cur_index == index) {
1299 node = of_find_node_by_phandle(phandle);
1301 pr_err("%s: could not find phandle\n",
1308 if (of_property_read_u32(node, cells_name,
1310 pr_err("%s: could not get %s for %s\n",
1311 np->full_name, cells_name,
1320 * Make sure that the arguments actually fit in the
1321 * remaining property data length
1323 if (list + count > list_end) {
1324 pr_err("%s: arguments longer than property\n",
1331 * All of the error cases above bail out of the loop, so at
1332 * this point, the parsing is successful. If the requested
1333 * index matches, then fill the out_args structure and return,
1334 * or return -ENOENT for an empty entry.
1337 if (cur_index == index) {
1343 if (WARN_ON(count > MAX_PHANDLE_ARGS))
1344 count = MAX_PHANDLE_ARGS;
1345 out_args->np = node;
1346 out_args->args_count = count;
1347 for (i = 0; i < count; i++)
1348 out_args->args[i] = be32_to_cpup(list++);
1353 /* Found it! return success */
1364 * Unlock node before returning result; will be one of:
1365 * -ENOENT : index is for empty phandle
1366 * -EINVAL : parsing error on data
1367 * [1..n] : Number of phandle (count mode; when index = -1)
1369 rc = index < 0 ? cur_index : -ENOENT;
1377 * of_parse_phandle - Resolve a phandle property to a device_node pointer
1378 * @np: Pointer to device node holding phandle property
1379 * @phandle_name: Name of property holding a phandle value
1380 * @index: For properties holding a table of phandles, this is the index into
1383 * Returns the device_node pointer with refcount incremented. Use
1384 * of_node_put() on it when done.
1386 struct device_node *of_parse_phandle(const struct device_node *np,
1387 const char *phandle_name, int index)
1389 struct of_phandle_args args;
1394 if (__of_parse_phandle_with_args(np, phandle_name, NULL, 0,
1400 EXPORT_SYMBOL(of_parse_phandle);
1403 * of_parse_phandle_with_args() - Find a node pointed by phandle in a list
1404 * @np: pointer to a device tree node containing a list
1405 * @list_name: property name that contains a list
1406 * @cells_name: property name that specifies phandles' arguments count
1407 * @index: index of a phandle to parse out
1408 * @out_args: optional pointer to output arguments structure (will be filled)
1410 * This function is useful to parse lists of phandles and their arguments.
1411 * Returns 0 on success and fills out_args, on error returns appropriate
1414 * Caller is responsible to call of_node_put() on the returned out_args->node
1420 * #list-cells = <2>;
1424 * #list-cells = <1>;
1428 * list = <&phandle1 1 2 &phandle2 3>;
1431 * To get a device_node of the `node2' node you may call this:
1432 * of_parse_phandle_with_args(node3, "list", "#list-cells", 1, &args);
1434 int of_parse_phandle_with_args(const struct device_node *np, const char *list_name,
1435 const char *cells_name, int index,
1436 struct of_phandle_args *out_args)
1440 return __of_parse_phandle_with_args(np, list_name, cells_name, 0,
1443 EXPORT_SYMBOL(of_parse_phandle_with_args);
1446 * of_parse_phandle_with_fixed_args() - Find a node pointed by phandle in a list
1447 * @np: pointer to a device tree node containing a list
1448 * @list_name: property name that contains a list
1449 * @cell_count: number of argument cells following the phandle
1450 * @index: index of a phandle to parse out
1451 * @out_args: optional pointer to output arguments structure (will be filled)
1453 * This function is useful to parse lists of phandles and their arguments.
1454 * Returns 0 on success and fills out_args, on error returns appropriate
1457 * Caller is responsible to call of_node_put() on the returned out_args->node
1469 * list = <&phandle1 0 2 &phandle2 2 3>;
1472 * To get a device_node of the `node2' node you may call this:
1473 * of_parse_phandle_with_fixed_args(node3, "list", 2, 1, &args);
1475 int of_parse_phandle_with_fixed_args(const struct device_node *np,
1476 const char *list_name, int cell_count,
1477 int index, struct of_phandle_args *out_args)
1481 return __of_parse_phandle_with_args(np, list_name, NULL, cell_count,
1484 EXPORT_SYMBOL(of_parse_phandle_with_fixed_args);
1487 * of_count_phandle_with_args() - Find the number of phandles references in a property
1488 * @np: pointer to a device tree node containing a list
1489 * @list_name: property name that contains a list
1490 * @cells_name: property name that specifies phandles' arguments count
1492 * Returns the number of phandle + argument tuples within a property. It
1493 * is a typical pattern to encode a list of phandle and variable
1494 * arguments into a single property. The number of arguments is encoded
1495 * by a property in the phandle-target node. For example, a gpios
1496 * property would contain a list of GPIO specifies consisting of a
1497 * phandle and 1 or more arguments. The number of arguments are
1498 * determined by the #gpio-cells property in the node pointed to by the
1501 int of_count_phandle_with_args(const struct device_node *np, const char *list_name,
1502 const char *cells_name)
1504 return __of_parse_phandle_with_args(np, list_name, cells_name, 0, -1,
1507 EXPORT_SYMBOL(of_count_phandle_with_args);
1509 #if defined(CONFIG_OF_DYNAMIC)
1510 static int of_property_notify(int action, struct device_node *np,
1511 struct property *prop)
1513 struct of_prop_reconfig pr;
1517 return of_reconfig_notify(action, &pr);
1520 static int of_property_notify(int action, struct device_node *np,
1521 struct property *prop)
1528 * of_add_property - Add a property to a node
1530 int of_add_property(struct device_node *np, struct property *prop)
1532 struct property **next;
1533 unsigned long flags;
1536 rc = of_property_notify(OF_RECONFIG_ADD_PROPERTY, np, prop);
1541 raw_spin_lock_irqsave(&devtree_lock, flags);
1542 next = &np->properties;
1544 if (strcmp(prop->name, (*next)->name) == 0) {
1545 /* duplicate ! don't insert it */
1546 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1549 next = &(*next)->next;
1552 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1554 #ifdef CONFIG_PROC_DEVICETREE
1555 /* try to add to proc as well if it was initialized */
1557 proc_device_tree_add_prop(np->pde, prop);
1558 #endif /* CONFIG_PROC_DEVICETREE */
1564 * of_remove_property - Remove a property from a node.
1566 * Note that we don't actually remove it, since we have given out
1567 * who-knows-how-many pointers to the data using get-property.
1568 * Instead we just move the property to the "dead properties"
1569 * list, so it won't be found any more.
1571 int of_remove_property(struct device_node *np, struct property *prop)
1573 struct property **next;
1574 unsigned long flags;
1578 rc = of_property_notify(OF_RECONFIG_REMOVE_PROPERTY, np, prop);
1582 raw_spin_lock_irqsave(&devtree_lock, flags);
1583 next = &np->properties;
1585 if (*next == prop) {
1586 /* found the node */
1588 prop->next = np->deadprops;
1589 np->deadprops = prop;
1593 next = &(*next)->next;
1595 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1600 #ifdef CONFIG_PROC_DEVICETREE
1601 /* try to remove the proc node as well */
1603 proc_device_tree_remove_prop(np->pde, prop);
1604 #endif /* CONFIG_PROC_DEVICETREE */
1610 * of_update_property - Update a property in a node, if the property does
1611 * not exist, add it.
1613 * Note that we don't actually remove it, since we have given out
1614 * who-knows-how-many pointers to the data using get-property.
1615 * Instead we just move the property to the "dead properties" list,
1616 * and add the new property to the property list
1618 int of_update_property(struct device_node *np, struct property *newprop)
1620 struct property **next, *oldprop;
1621 unsigned long flags;
1624 rc = of_property_notify(OF_RECONFIG_UPDATE_PROPERTY, np, newprop);
1631 oldprop = of_find_property(np, newprop->name, NULL);
1633 return of_add_property(np, newprop);
1635 raw_spin_lock_irqsave(&devtree_lock, flags);
1636 next = &np->properties;
1638 if (*next == oldprop) {
1639 /* found the node */
1640 newprop->next = oldprop->next;
1642 oldprop->next = np->deadprops;
1643 np->deadprops = oldprop;
1647 next = &(*next)->next;
1649 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1654 #ifdef CONFIG_PROC_DEVICETREE
1655 /* try to add to proc as well if it was initialized */
1657 proc_device_tree_update_prop(np->pde, newprop, oldprop);
1658 #endif /* CONFIG_PROC_DEVICETREE */
1663 #if defined(CONFIG_OF_DYNAMIC)
1665 * Support for dynamic device trees.
1667 * On some platforms, the device tree can be manipulated at runtime.
1668 * The routines in this section support adding, removing and changing
1669 * device tree nodes.
1672 static BLOCKING_NOTIFIER_HEAD(of_reconfig_chain);
1674 int of_reconfig_notifier_register(struct notifier_block *nb)
1676 return blocking_notifier_chain_register(&of_reconfig_chain, nb);
1678 EXPORT_SYMBOL_GPL(of_reconfig_notifier_register);
1680 int of_reconfig_notifier_unregister(struct notifier_block *nb)
1682 return blocking_notifier_chain_unregister(&of_reconfig_chain, nb);
1684 EXPORT_SYMBOL_GPL(of_reconfig_notifier_unregister);
1686 int of_reconfig_notify(unsigned long action, void *p)
1690 rc = blocking_notifier_call_chain(&of_reconfig_chain, action, p);
1691 return notifier_to_errno(rc);
1694 #ifdef CONFIG_PROC_DEVICETREE
1695 static void of_add_proc_dt_entry(struct device_node *dn)
1697 struct proc_dir_entry *ent;
1699 ent = proc_mkdir(strrchr(dn->full_name, '/') + 1, dn->parent->pde);
1701 proc_device_tree_add_node(dn, ent);
1704 static void of_add_proc_dt_entry(struct device_node *dn)
1711 * of_attach_node - Plug a device node into the tree and global list.
1713 int of_attach_node(struct device_node *np)
1715 unsigned long flags;
1718 rc = of_reconfig_notify(OF_RECONFIG_ATTACH_NODE, np);
1722 raw_spin_lock_irqsave(&devtree_lock, flags);
1723 np->sibling = np->parent->child;
1724 np->allnext = of_allnodes;
1725 np->parent->child = np;
1727 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1729 of_add_proc_dt_entry(np);
1733 #ifdef CONFIG_PROC_DEVICETREE
1734 static void of_remove_proc_dt_entry(struct device_node *dn)
1736 proc_remove(dn->pde);
1739 static void of_remove_proc_dt_entry(struct device_node *dn)
1746 * of_detach_node - "Unplug" a node from the device tree.
1748 * The caller must hold a reference to the node. The memory associated with
1749 * the node is not freed until its refcount goes to zero.
1751 int of_detach_node(struct device_node *np)
1753 struct device_node *parent;
1754 unsigned long flags;
1757 rc = of_reconfig_notify(OF_RECONFIG_DETACH_NODE, np);
1761 raw_spin_lock_irqsave(&devtree_lock, flags);
1763 if (of_node_check_flag(np, OF_DETACHED)) {
1764 /* someone already detached it */
1765 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1769 parent = np->parent;
1771 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1775 if (of_allnodes == np)
1776 of_allnodes = np->allnext;
1778 struct device_node *prev;
1779 for (prev = of_allnodes;
1780 prev->allnext != np;
1781 prev = prev->allnext)
1783 prev->allnext = np->allnext;
1786 if (parent->child == np)
1787 parent->child = np->sibling;
1789 struct device_node *prevsib;
1790 for (prevsib = np->parent->child;
1791 prevsib->sibling != np;
1792 prevsib = prevsib->sibling)
1794 prevsib->sibling = np->sibling;
1797 of_node_set_flag(np, OF_DETACHED);
1798 raw_spin_unlock_irqrestore(&devtree_lock, flags);
1800 of_remove_proc_dt_entry(np);
1803 #endif /* defined(CONFIG_OF_DYNAMIC) */
1805 static void of_alias_add(struct alias_prop *ap, struct device_node *np,
1806 int id, const char *stem, int stem_len)
1810 strncpy(ap->stem, stem, stem_len);
1811 ap->stem[stem_len] = 0;
1812 list_add_tail(&ap->link, &aliases_lookup);
1813 pr_debug("adding DT alias:%s: stem=%s id=%i node=%s\n",
1814 ap->alias, ap->stem, ap->id, of_node_full_name(np));
1818 * of_alias_scan - Scan all properties of 'aliases' node
1820 * The function scans all the properties of 'aliases' node and populate
1821 * the the global lookup table with the properties. It returns the
1822 * number of alias_prop found, or error code in error case.
1824 * @dt_alloc: An allocator that provides a virtual address to memory
1825 * for the resulting tree
1827 void of_alias_scan(void * (*dt_alloc)(u64 size, u64 align))
1829 struct property *pp;
1831 of_chosen = of_find_node_by_path("/chosen");
1832 if (of_chosen == NULL)
1833 of_chosen = of_find_node_by_path("/chosen@0");
1838 name = of_get_property(of_chosen, "linux,stdout-path", NULL);
1840 of_stdout = of_find_node_by_path(name);
1843 of_aliases = of_find_node_by_path("/aliases");
1847 for_each_property_of_node(of_aliases, pp) {
1848 const char *start = pp->name;
1849 const char *end = start + strlen(start);
1850 struct device_node *np;
1851 struct alias_prop *ap;
1854 /* Skip those we do not want to proceed */
1855 if (!strcmp(pp->name, "name") ||
1856 !strcmp(pp->name, "phandle") ||
1857 !strcmp(pp->name, "linux,phandle"))
1860 np = of_find_node_by_path(pp->value);
1864 /* walk the alias backwards to extract the id and work out
1865 * the 'stem' string */
1866 while (isdigit(*(end-1)) && end > start)
1870 if (kstrtoint(end, 10, &id) < 0)
1873 /* Allocate an alias_prop with enough space for the stem */
1874 ap = dt_alloc(sizeof(*ap) + len + 1, 4);
1877 memset(ap, 0, sizeof(*ap) + len + 1);
1879 of_alias_add(ap, np, id, start, len);
1884 * of_alias_get_id - Get alias id for the given device_node
1885 * @np: Pointer to the given device_node
1886 * @stem: Alias stem of the given device_node
1888 * The function travels the lookup table to get alias id for the given
1889 * device_node and alias stem. It returns the alias id if find it.
1891 int of_alias_get_id(struct device_node *np, const char *stem)
1893 struct alias_prop *app;
1896 mutex_lock(&of_aliases_mutex);
1897 list_for_each_entry(app, &aliases_lookup, link) {
1898 if (strcmp(app->stem, stem) != 0)
1901 if (np == app->np) {
1906 mutex_unlock(&of_aliases_mutex);
1910 EXPORT_SYMBOL_GPL(of_alias_get_id);
1912 const __be32 *of_prop_next_u32(struct property *prop, const __be32 *cur,
1915 const void *curv = cur;
1925 curv += sizeof(*cur);
1926 if (curv >= prop->value + prop->length)
1930 *pu = be32_to_cpup(curv);
1933 EXPORT_SYMBOL_GPL(of_prop_next_u32);
1935 const char *of_prop_next_string(struct property *prop, const char *cur)
1937 const void *curv = cur;
1945 curv += strlen(cur) + 1;
1946 if (curv >= prop->value + prop->length)
1951 EXPORT_SYMBOL_GPL(of_prop_next_string);
1954 * of_device_is_stdout_path - check if a device node matches the
1955 * linux,stdout-path property
1957 * Check if this device node matches the linux,stdout-path property
1958 * in the chosen node. return true if yes, false otherwise.
1960 int of_device_is_stdout_path(struct device_node *dn)
1965 return of_stdout == dn;
1967 EXPORT_SYMBOL_GPL(of_device_is_stdout_path);
1970 * of_find_next_cache_node - Find a node's subsidiary cache
1971 * @np: node of type "cpu" or "cache"
1973 * Returns a node pointer with refcount incremented, use
1974 * of_node_put() on it when done. Caller should hold a reference
1977 struct device_node *of_find_next_cache_node(const struct device_node *np)
1979 struct device_node *child;
1980 const phandle *handle;
1982 handle = of_get_property(np, "l2-cache", NULL);
1984 handle = of_get_property(np, "next-level-cache", NULL);
1987 return of_find_node_by_phandle(be32_to_cpup(handle));
1989 /* OF on pmac has nodes instead of properties named "l2-cache"
1990 * beneath CPU nodes.
1992 if (!strcmp(np->type, "cpu"))
1993 for_each_child_of_node(np, child)
1994 if (!strcmp(child->type, "cache"))