Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 1 | /* |
| 2 | * Procedures for creating, accessing and interpreting the device tree. |
| 3 | * |
| 4 | * Paul Mackerras August 1996. |
| 5 | * Copyright (C) 1996-2005 Paul Mackerras. |
| 6 | * |
| 7 | * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner. |
| 8 | * {engebret|bergner}@us.ibm.com |
| 9 | * |
| 10 | * Adapted for sparc and sparc64 by David S. Miller davem@davemloft.net |
| 11 | * |
Grant Likely | e91edcf | 2009-10-15 10:58:09 -0600 | [diff] [blame] | 12 | * Reconsolidated from arch/x/kernel/prom.c by Stephen Rothwell and |
| 13 | * Grant Likely. |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 14 | * |
| 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. |
| 19 | */ |
Rob Herring | 606ad42 | 2016-06-15 08:32:18 -0500 | [diff] [blame] | 20 | |
| 21 | #define pr_fmt(fmt) "OF: " fmt |
| 22 | |
Frank Rowand | e80f6cf | 2018-02-23 14:31:39 +0530 | [diff] [blame] | 23 | #include <linux/bootmem.h> |
Grant Likely | 3482f2c | 2014-03-27 17:18:55 -0700 | [diff] [blame] | 24 | #include <linux/console.h> |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 25 | #include <linux/ctype.h> |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 26 | #include <linux/cpu.h> |
Frank Rowand | e80f6cf | 2018-02-23 14:31:39 +0530 | [diff] [blame] | 27 | #include <linux/memblock.h> |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 28 | #include <linux/module.h> |
| 29 | #include <linux/of.h> |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 30 | #include <linux/of_graph.h> |
Stephen Rothwell | 581b605 | 2007-04-24 16:46:53 +1000 | [diff] [blame] | 31 | #include <linux/spinlock.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 32 | #include <linux/slab.h> |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 33 | #include <linux/string.h> |
Jeremy Kerr | a9f2f63 | 2010-02-01 21:34:14 -0700 | [diff] [blame] | 34 | #include <linux/proc_fs.h> |
Stephen Rothwell | 581b605 | 2007-04-24 16:46:53 +1000 | [diff] [blame] | 35 | |
Stepan Moskovchenko | ced4eec | 2012-12-06 14:55:41 -0800 | [diff] [blame] | 36 | #include "of_private.h" |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 37 | |
Stepan Moskovchenko | ced4eec | 2012-12-06 14:55:41 -0800 | [diff] [blame] | 38 | LIST_HEAD(aliases_lookup); |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 39 | |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 40 | struct device_node *of_root; |
| 41 | EXPORT_SYMBOL(of_root); |
Grant Likely | fc0bdae | 2010-02-14 07:13:55 -0700 | [diff] [blame] | 42 | struct device_node *of_chosen; |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 43 | struct device_node *of_aliases; |
Grant Likely | a752ee5 | 2014-03-28 08:12:18 -0700 | [diff] [blame] | 44 | struct device_node *of_stdout; |
Leif Lindholm | 7914a7c | 2014-11-27 17:56:07 +0000 | [diff] [blame] | 45 | static const char *of_stdout_options; |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 46 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 47 | struct kset *of_kset; |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 48 | |
| 49 | /* |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 50 | * Used to protect the of_aliases, to hold off addition of nodes to sysfs. |
| 51 | * This mutex must be held whenever modifications are being made to the |
| 52 | * device tree. The of_{attach,detach}_node() and |
| 53 | * of_{add,remove,update}_property() helpers make sure this happens. |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 54 | */ |
Pantelis Antoniou | c05aba2 | 2014-07-04 19:58:03 +0300 | [diff] [blame] | 55 | DEFINE_MUTEX(of_mutex); |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 56 | |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 57 | /* use when traversing tree through the child, sibling, |
Stephen Rothwell | 581b605 | 2007-04-24 16:46:53 +1000 | [diff] [blame] | 58 | * or parent members of struct device_node. |
| 59 | */ |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 60 | DEFINE_RAW_SPINLOCK(devtree_lock); |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 61 | |
| 62 | int of_n_addr_cells(struct device_node *np) |
| 63 | { |
Jeremy Kerr | a9fadee | 2010-10-10 21:24:10 -0600 | [diff] [blame] | 64 | const __be32 *ip; |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 65 | |
| 66 | do { |
| 67 | if (np->parent) |
| 68 | np = np->parent; |
| 69 | ip = of_get_property(np, "#address-cells", NULL); |
| 70 | if (ip) |
Jeremy Kerr | 3371488 | 2010-01-30 01:45:26 -0700 | [diff] [blame] | 71 | return be32_to_cpup(ip); |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 72 | } while (np->parent); |
| 73 | /* No #address-cells property for the root node */ |
| 74 | return OF_ROOT_NODE_ADDR_CELLS_DEFAULT; |
| 75 | } |
| 76 | EXPORT_SYMBOL(of_n_addr_cells); |
| 77 | |
| 78 | int of_n_size_cells(struct device_node *np) |
| 79 | { |
Jeremy Kerr | a9fadee | 2010-10-10 21:24:10 -0600 | [diff] [blame] | 80 | const __be32 *ip; |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 81 | |
| 82 | do { |
| 83 | if (np->parent) |
| 84 | np = np->parent; |
| 85 | ip = of_get_property(np, "#size-cells", NULL); |
| 86 | if (ip) |
Jeremy Kerr | 3371488 | 2010-01-30 01:45:26 -0700 | [diff] [blame] | 87 | return be32_to_cpup(ip); |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 88 | } while (np->parent); |
| 89 | /* No #size-cells property for the root node */ |
| 90 | return OF_ROOT_NODE_SIZE_CELLS_DEFAULT; |
| 91 | } |
| 92 | EXPORT_SYMBOL(of_n_size_cells); |
| 93 | |
Rob Herring | 0c3f061 | 2013-09-17 10:42:50 -0500 | [diff] [blame] | 94 | #ifdef CONFIG_NUMA |
| 95 | int __weak of_node_to_nid(struct device_node *np) |
| 96 | { |
Konstantin Khlebnikov | c8fff7b | 2015-04-08 19:59:20 +0300 | [diff] [blame] | 97 | return NUMA_NO_NODE; |
Rob Herring | 0c3f061 | 2013-09-17 10:42:50 -0500 | [diff] [blame] | 98 | } |
| 99 | #endif |
| 100 | |
Frank Rowand | f64054b | 2018-02-23 14:23:10 +0530 | [diff] [blame] | 101 | static struct device_node **phandle_cache; |
| 102 | static u32 phandle_cache_mask; |
| 103 | |
| 104 | /* |
| 105 | * Assumptions behind phandle_cache implementation: |
| 106 | * - phandle property values are in a contiguous range of 1..n |
| 107 | * |
| 108 | * If the assumptions do not hold, then |
| 109 | * - the phandle lookup overhead reduction provided by the cache |
| 110 | * will likely be less |
| 111 | */ |
| 112 | static void of_populate_phandle_cache(void) |
| 113 | { |
| 114 | unsigned long flags; |
| 115 | u32 cache_entries; |
| 116 | struct device_node *np; |
| 117 | u32 phandles = 0; |
| 118 | |
| 119 | raw_spin_lock_irqsave(&devtree_lock, flags); |
| 120 | |
| 121 | kfree(phandle_cache); |
| 122 | phandle_cache = NULL; |
| 123 | |
| 124 | for_each_of_allnodes(np) |
| 125 | if (np->phandle && np->phandle != OF_PHANDLE_ILLEGAL) |
| 126 | phandles++; |
| 127 | |
| 128 | cache_entries = roundup_pow_of_two(phandles); |
| 129 | phandle_cache_mask = cache_entries - 1; |
| 130 | |
| 131 | phandle_cache = kcalloc(cache_entries, sizeof(*phandle_cache), |
| 132 | GFP_ATOMIC); |
| 133 | |
| 134 | if (phandle_cache) |
| 135 | for_each_of_allnodes(np) |
| 136 | if (np->phandle && np->phandle != OF_PHANDLE_ILLEGAL) |
| 137 | phandle_cache[np->phandle & phandle_cache_mask] = np; |
| 138 | |
| 139 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
| 140 | } |
| 141 | |
Frank Rowand | e80f6cf | 2018-02-23 14:31:39 +0530 | [diff] [blame] | 142 | void __init of_populate_phandle_cache_early(void) |
| 143 | { |
| 144 | u32 cache_entries; |
| 145 | struct device_node *np; |
| 146 | u32 phandles = 0; |
| 147 | size_t size; |
| 148 | |
| 149 | for_each_of_allnodes(np) |
| 150 | if (np->phandle && np->phandle != OF_PHANDLE_ILLEGAL) |
| 151 | phandles++; |
| 152 | |
| 153 | cache_entries = roundup_pow_of_two(phandles); |
| 154 | phandle_cache_mask = cache_entries - 1; |
| 155 | |
| 156 | size = cache_entries * sizeof(*phandle_cache); |
| 157 | phandle_cache = memblock_virt_alloc(size, 4); |
| 158 | memset(phandle_cache, 0, size); |
| 159 | |
| 160 | for_each_of_allnodes(np) |
| 161 | if (np->phandle && np->phandle != OF_PHANDLE_ILLEGAL) |
| 162 | phandle_cache[np->phandle & phandle_cache_mask] = np; |
| 163 | } |
| 164 | |
Frank Rowand | f64054b | 2018-02-23 14:23:10 +0530 | [diff] [blame] | 165 | #ifndef CONFIG_MODULES |
| 166 | static int __init of_free_phandle_cache(void) |
| 167 | { |
| 168 | unsigned long flags; |
| 169 | |
| 170 | raw_spin_lock_irqsave(&devtree_lock, flags); |
| 171 | |
| 172 | kfree(phandle_cache); |
| 173 | phandle_cache = NULL; |
| 174 | |
| 175 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
| 176 | |
| 177 | return 0; |
| 178 | } |
| 179 | late_initcall_sync(of_free_phandle_cache); |
| 180 | #endif |
| 181 | |
Sudeep Holla | 194ec93 | 2015-05-14 15:28:24 +0100 | [diff] [blame] | 182 | void __init of_core_init(void) |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 183 | { |
Frank Rowand | e80f6cf | 2018-02-23 14:31:39 +0530 | [diff] [blame] | 184 | unsigned long flags; |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 185 | struct device_node *np; |
Frank Rowand | e80f6cf | 2018-02-23 14:31:39 +0530 | [diff] [blame] | 186 | phys_addr_t size; |
| 187 | |
| 188 | raw_spin_lock_irqsave(&devtree_lock, flags); |
| 189 | size = (phandle_cache_mask + 1) * sizeof(*phandle_cache); |
| 190 | memblock_free(__pa(phandle_cache), size); |
| 191 | phandle_cache = NULL; |
| 192 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 193 | |
Frank Rowand | f64054b | 2018-02-23 14:23:10 +0530 | [diff] [blame] | 194 | of_populate_phandle_cache(); |
| 195 | |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 196 | /* Create the kset, and register existing nodes */ |
Pantelis Antoniou | c05aba2 | 2014-07-04 19:58:03 +0300 | [diff] [blame] | 197 | mutex_lock(&of_mutex); |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 198 | of_kset = kset_create_and_add("devicetree", NULL, firmware_kobj); |
| 199 | if (!of_kset) { |
Pantelis Antoniou | c05aba2 | 2014-07-04 19:58:03 +0300 | [diff] [blame] | 200 | mutex_unlock(&of_mutex); |
Rob Herring | 606ad42 | 2016-06-15 08:32:18 -0500 | [diff] [blame] | 201 | pr_err("failed to register existing nodes\n"); |
Sudeep Holla | 194ec93 | 2015-05-14 15:28:24 +0100 | [diff] [blame] | 202 | return; |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 203 | } |
| 204 | for_each_of_allnodes(np) |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 205 | __of_attach_node_sysfs(np); |
Pantelis Antoniou | c05aba2 | 2014-07-04 19:58:03 +0300 | [diff] [blame] | 206 | mutex_unlock(&of_mutex); |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 207 | |
Grant Likely | 8357041 | 2012-11-06 21:03:27 +0000 | [diff] [blame] | 208 | /* Symlink in /proc as required by userspace ABI */ |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 209 | if (of_root) |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 210 | proc_symlink("device-tree", NULL, "/sys/firmware/devicetree/base"); |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 211 | } |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 212 | |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 213 | static struct property *__of_find_property(const struct device_node *np, |
| 214 | const char *name, int *lenp) |
Stephen Rothwell | 581b605 | 2007-04-24 16:46:53 +1000 | [diff] [blame] | 215 | { |
| 216 | struct property *pp; |
| 217 | |
Timur Tabi | 64e4566 | 2008-05-08 05:19:59 +1000 | [diff] [blame] | 218 | if (!np) |
| 219 | return NULL; |
| 220 | |
Sachin Kamat | a3a7cab | 2012-06-27 09:44:45 +0530 | [diff] [blame] | 221 | for (pp = np->properties; pp; pp = pp->next) { |
Stephen Rothwell | 581b605 | 2007-04-24 16:46:53 +1000 | [diff] [blame] | 222 | if (of_prop_cmp(pp->name, name) == 0) { |
Sachin Kamat | a3a7cab | 2012-06-27 09:44:45 +0530 | [diff] [blame] | 223 | if (lenp) |
Stephen Rothwell | 581b605 | 2007-04-24 16:46:53 +1000 | [diff] [blame] | 224 | *lenp = pp->length; |
| 225 | break; |
| 226 | } |
| 227 | } |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 228 | |
| 229 | return pp; |
| 230 | } |
| 231 | |
| 232 | struct property *of_find_property(const struct device_node *np, |
| 233 | const char *name, |
| 234 | int *lenp) |
| 235 | { |
| 236 | struct property *pp; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 237 | unsigned long flags; |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 238 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 239 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 240 | pp = __of_find_property(np, name, lenp); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 241 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Stephen Rothwell | 581b605 | 2007-04-24 16:46:53 +1000 | [diff] [blame] | 242 | |
| 243 | return pp; |
| 244 | } |
| 245 | EXPORT_SYMBOL(of_find_property); |
| 246 | |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 247 | struct device_node *__of_find_all_nodes(struct device_node *prev) |
| 248 | { |
| 249 | struct device_node *np; |
| 250 | if (!prev) { |
| 251 | np = of_root; |
| 252 | } else if (prev->child) { |
| 253 | np = prev->child; |
| 254 | } else { |
| 255 | /* Walk back up looking for a sibling, or the end of the structure */ |
| 256 | np = prev; |
| 257 | while (np->parent && !np->sibling) |
| 258 | np = np->parent; |
| 259 | np = np->sibling; /* Might be null at the end of the tree */ |
| 260 | } |
| 261 | return np; |
| 262 | } |
| 263 | |
Grant Likely | e91edcf | 2009-10-15 10:58:09 -0600 | [diff] [blame] | 264 | /** |
| 265 | * of_find_all_nodes - Get next node in global list |
| 266 | * @prev: Previous node or NULL to start iteration |
| 267 | * of_node_put() will be called on it |
| 268 | * |
| 269 | * Returns a node pointer with refcount incremented, use |
| 270 | * of_node_put() on it when done. |
| 271 | */ |
| 272 | struct device_node *of_find_all_nodes(struct device_node *prev) |
| 273 | { |
| 274 | struct device_node *np; |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 275 | unsigned long flags; |
Grant Likely | e91edcf | 2009-10-15 10:58:09 -0600 | [diff] [blame] | 276 | |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 277 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 278 | np = __of_find_all_nodes(prev); |
| 279 | of_node_get(np); |
Grant Likely | e91edcf | 2009-10-15 10:58:09 -0600 | [diff] [blame] | 280 | of_node_put(prev); |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 281 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Grant Likely | e91edcf | 2009-10-15 10:58:09 -0600 | [diff] [blame] | 282 | return np; |
| 283 | } |
| 284 | EXPORT_SYMBOL(of_find_all_nodes); |
| 285 | |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 286 | /* |
| 287 | * Find a property with a given name for a given node |
| 288 | * and return the value. |
| 289 | */ |
Grant Likely | a25095d | 2014-07-15 23:25:43 -0600 | [diff] [blame] | 290 | const void *__of_get_property(const struct device_node *np, |
| 291 | const char *name, int *lenp) |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 292 | { |
| 293 | struct property *pp = __of_find_property(np, name, lenp); |
| 294 | |
| 295 | return pp ? pp->value : NULL; |
| 296 | } |
| 297 | |
| 298 | /* |
| 299 | * Find a property with a given name for a given node |
| 300 | * and return the value. |
| 301 | */ |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 302 | const void *of_get_property(const struct device_node *np, const char *name, |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 303 | int *lenp) |
Stephen Rothwell | 97e873e | 2007-05-01 16:26:07 +1000 | [diff] [blame] | 304 | { |
| 305 | struct property *pp = of_find_property(np, name, lenp); |
| 306 | |
| 307 | return pp ? pp->value : NULL; |
| 308 | } |
| 309 | EXPORT_SYMBOL(of_get_property); |
Stephen Rothwell | 0081cbc | 2007-05-01 16:29:19 +1000 | [diff] [blame] | 310 | |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 311 | /* |
| 312 | * arch_match_cpu_phys_id - Match the given logical CPU and physical id |
| 313 | * |
| 314 | * @cpu: logical cpu index of a core/thread |
| 315 | * @phys_id: physical identifier of a core/thread |
| 316 | * |
| 317 | * CPU logical to physical index mapping is architecture specific. |
| 318 | * However this __weak function provides a default match of physical |
| 319 | * id to logical cpu index. phys_id provided here is usually values read |
| 320 | * from the device tree which must match the hardware internal registers. |
| 321 | * |
| 322 | * Returns true if the physical identifier and the logical cpu index |
| 323 | * correspond to the same core/thread, false otherwise. |
| 324 | */ |
| 325 | bool __weak arch_match_cpu_phys_id(int cpu, u64 phys_id) |
| 326 | { |
| 327 | return (u32)phys_id == cpu; |
| 328 | } |
| 329 | |
| 330 | /** |
| 331 | * Checks if the given "prop_name" property holds the physical id of the |
| 332 | * core/thread corresponding to the logical cpu 'cpu'. If 'thread' is not |
| 333 | * NULL, local thread number within the core is returned in it. |
| 334 | */ |
| 335 | static bool __of_find_n_match_cpu_property(struct device_node *cpun, |
| 336 | const char *prop_name, int cpu, unsigned int *thread) |
| 337 | { |
| 338 | const __be32 *cell; |
| 339 | int ac, prop_len, tid; |
| 340 | u64 hwid; |
| 341 | |
| 342 | ac = of_n_addr_cells(cpun); |
| 343 | cell = of_get_property(cpun, prop_name, &prop_len); |
Grant Likely | f3cea45 | 2013-10-04 17:24:26 +0100 | [diff] [blame] | 344 | if (!cell || !ac) |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 345 | return false; |
Grant Likely | f3cea45 | 2013-10-04 17:24:26 +0100 | [diff] [blame] | 346 | prop_len /= sizeof(*cell) * ac; |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 347 | for (tid = 0; tid < prop_len; tid++) { |
| 348 | hwid = of_read_number(cell, ac); |
| 349 | if (arch_match_cpu_phys_id(cpu, hwid)) { |
| 350 | if (thread) |
| 351 | *thread = tid; |
| 352 | return true; |
| 353 | } |
| 354 | cell += ac; |
| 355 | } |
| 356 | return false; |
| 357 | } |
| 358 | |
David Miller | d1cb9d1 | 2013-10-03 17:24:51 -0400 | [diff] [blame] | 359 | /* |
| 360 | * arch_find_n_match_cpu_physical_id - See if the given device node is |
| 361 | * for the cpu corresponding to logical cpu 'cpu'. Return true if so, |
| 362 | * else false. If 'thread' is non-NULL, the local thread number within the |
| 363 | * core is returned in it. |
| 364 | */ |
| 365 | bool __weak arch_find_n_match_cpu_physical_id(struct device_node *cpun, |
| 366 | int cpu, unsigned int *thread) |
| 367 | { |
| 368 | /* Check for non-standard "ibm,ppc-interrupt-server#s" property |
| 369 | * for thread ids on PowerPC. If it doesn't exist fallback to |
| 370 | * standard "reg" property. |
| 371 | */ |
| 372 | if (IS_ENABLED(CONFIG_PPC) && |
| 373 | __of_find_n_match_cpu_property(cpun, |
| 374 | "ibm,ppc-interrupt-server#s", |
| 375 | cpu, thread)) |
| 376 | return true; |
| 377 | |
Masahiro Yamada | 510bd06 | 2015-10-28 12:05:27 +0900 | [diff] [blame] | 378 | return __of_find_n_match_cpu_property(cpun, "reg", cpu, thread); |
David Miller | d1cb9d1 | 2013-10-03 17:24:51 -0400 | [diff] [blame] | 379 | } |
| 380 | |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 381 | /** |
| 382 | * of_get_cpu_node - Get device node associated with the given logical CPU |
| 383 | * |
| 384 | * @cpu: CPU number(logical index) for which device node is required |
| 385 | * @thread: if not NULL, local thread number within the physical core is |
| 386 | * returned |
| 387 | * |
| 388 | * The main purpose of this function is to retrieve the device node for the |
| 389 | * given logical CPU index. It should be used to initialize the of_node in |
| 390 | * cpu device. Once of_node in cpu device is populated, all the further |
| 391 | * references can use that instead. |
| 392 | * |
| 393 | * CPU logical to physical index mapping is architecture specific and is built |
| 394 | * before booting secondary cores. This function uses arch_match_cpu_phys_id |
| 395 | * which can be overridden by architecture specific implementation. |
| 396 | * |
Masahiro Yamada | 1c986e3 | 2016-04-20 10:18:46 +0900 | [diff] [blame] | 397 | * Returns a node pointer for the logical cpu with refcount incremented, use |
| 398 | * of_node_put() on it when done. Returns NULL if not found. |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 399 | */ |
| 400 | struct device_node *of_get_cpu_node(int cpu, unsigned int *thread) |
| 401 | { |
David Miller | d1cb9d1 | 2013-10-03 17:24:51 -0400 | [diff] [blame] | 402 | struct device_node *cpun; |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 403 | |
David Miller | d1cb9d1 | 2013-10-03 17:24:51 -0400 | [diff] [blame] | 404 | for_each_node_by_type(cpun, "cpu") { |
| 405 | if (arch_find_n_match_cpu_physical_id(cpun, cpu, thread)) |
Sudeep KarkadaNagesha | 183912d | 2013-08-15 14:01:40 +0100 | [diff] [blame] | 406 | return cpun; |
| 407 | } |
| 408 | return NULL; |
| 409 | } |
| 410 | EXPORT_SYMBOL(of_get_cpu_node); |
| 411 | |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 412 | /** |
| 413 | * __of_device_is_compatible() - Check if the node matches given constraints |
| 414 | * @device: pointer to node |
| 415 | * @compat: required compatible string, NULL or "" for any match |
| 416 | * @type: required device_type value, NULL or "" for any match |
| 417 | * @name: required node name, NULL or "" for any match |
| 418 | * |
| 419 | * Checks if the given @compat, @type and @name strings match the |
| 420 | * properties of the given @device. A constraints can be skipped by |
| 421 | * passing NULL or an empty string as the constraint. |
| 422 | * |
| 423 | * Returns 0 for no match, and a positive integer on match. The return |
| 424 | * value is a relative score with larger values indicating better |
| 425 | * matches. The score is weighted for the most specific compatible value |
| 426 | * to get the highest score. Matching type is next, followed by matching |
| 427 | * name. Practically speaking, this results in the following priority |
| 428 | * order for matches: |
| 429 | * |
| 430 | * 1. specific compatible && type && name |
| 431 | * 2. specific compatible && type |
| 432 | * 3. specific compatible && name |
| 433 | * 4. specific compatible |
| 434 | * 5. general compatible && type && name |
| 435 | * 6. general compatible && type |
| 436 | * 7. general compatible && name |
| 437 | * 8. general compatible |
| 438 | * 9. type && name |
| 439 | * 10. type |
| 440 | * 11. name |
Stephen Rothwell | 0081cbc | 2007-05-01 16:29:19 +1000 | [diff] [blame] | 441 | */ |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 442 | static int __of_device_is_compatible(const struct device_node *device, |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 443 | const char *compat, const char *type, const char *name) |
Stephen Rothwell | 0081cbc | 2007-05-01 16:29:19 +1000 | [diff] [blame] | 444 | { |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 445 | struct property *prop; |
| 446 | const char *cp; |
| 447 | int index = 0, score = 0; |
Stephen Rothwell | 0081cbc | 2007-05-01 16:29:19 +1000 | [diff] [blame] | 448 | |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 449 | /* Compatible match has highest priority */ |
| 450 | if (compat && compat[0]) { |
| 451 | prop = __of_find_property(device, "compatible", NULL); |
| 452 | for (cp = of_prop_next_string(prop, NULL); cp; |
| 453 | cp = of_prop_next_string(prop, cp), index++) { |
| 454 | if (of_compat_cmp(cp, compat, strlen(compat)) == 0) { |
| 455 | score = INT_MAX/2 - (index << 2); |
| 456 | break; |
| 457 | } |
| 458 | } |
| 459 | if (!score) |
| 460 | return 0; |
Stephen Rothwell | 0081cbc | 2007-05-01 16:29:19 +1000 | [diff] [blame] | 461 | } |
| 462 | |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 463 | /* Matching type is better than matching name */ |
| 464 | if (type && type[0]) { |
| 465 | if (!device->type || of_node_cmp(type, device->type)) |
| 466 | return 0; |
| 467 | score += 2; |
| 468 | } |
| 469 | |
| 470 | /* Matching name is a bit better than not */ |
| 471 | if (name && name[0]) { |
| 472 | if (!device->name || of_node_cmp(name, device->name)) |
| 473 | return 0; |
| 474 | score++; |
| 475 | } |
| 476 | |
| 477 | return score; |
Stephen Rothwell | 0081cbc | 2007-05-01 16:29:19 +1000 | [diff] [blame] | 478 | } |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 479 | |
| 480 | /** Checks if the given "compat" string matches one of the strings in |
| 481 | * the device's "compatible" property |
| 482 | */ |
| 483 | int of_device_is_compatible(const struct device_node *device, |
| 484 | const char *compat) |
| 485 | { |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 486 | unsigned long flags; |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 487 | int res; |
| 488 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 489 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 490 | res = __of_device_is_compatible(device, compat, NULL, NULL); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 491 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 492 | return res; |
| 493 | } |
Stephen Rothwell | 0081cbc | 2007-05-01 16:29:19 +1000 | [diff] [blame] | 494 | EXPORT_SYMBOL(of_device_is_compatible); |
Stephen Rothwell | e679c5f | 2007-04-24 17:16:16 +1000 | [diff] [blame] | 495 | |
Benjamin Herrenschmidt | b9c13fe | 2016-07-08 08:35:59 +1000 | [diff] [blame] | 496 | /** Checks if the device is compatible with any of the entries in |
| 497 | * a NULL terminated array of strings. Returns the best match |
| 498 | * score or 0. |
| 499 | */ |
| 500 | int of_device_compatible_match(struct device_node *device, |
| 501 | const char *const *compat) |
| 502 | { |
| 503 | unsigned int tmp, score = 0; |
| 504 | |
| 505 | if (!compat) |
| 506 | return 0; |
| 507 | |
| 508 | while (*compat) { |
| 509 | tmp = of_device_is_compatible(device, *compat); |
| 510 | if (tmp > score) |
| 511 | score = tmp; |
| 512 | compat++; |
| 513 | } |
| 514 | |
| 515 | return score; |
| 516 | } |
| 517 | |
Stephen Rothwell | e679c5f | 2007-04-24 17:16:16 +1000 | [diff] [blame] | 518 | /** |
Grant Likely | 71a157e | 2010-02-01 21:34:14 -0700 | [diff] [blame] | 519 | * of_machine_is_compatible - Test root of device tree for a given compatible value |
Grant Likely | 1f43cfb | 2010-01-28 13:47:25 -0700 | [diff] [blame] | 520 | * @compat: compatible string to look for in root node's compatible property. |
| 521 | * |
Kevin Cernekee | 25c7a1d | 2014-11-12 12:54:00 -0800 | [diff] [blame] | 522 | * Returns a positive integer if the root node has the given value in its |
Grant Likely | 1f43cfb | 2010-01-28 13:47:25 -0700 | [diff] [blame] | 523 | * compatible property. |
| 524 | */ |
Grant Likely | 71a157e | 2010-02-01 21:34:14 -0700 | [diff] [blame] | 525 | int of_machine_is_compatible(const char *compat) |
Grant Likely | 1f43cfb | 2010-01-28 13:47:25 -0700 | [diff] [blame] | 526 | { |
| 527 | struct device_node *root; |
| 528 | int rc = 0; |
| 529 | |
| 530 | root = of_find_node_by_path("/"); |
| 531 | if (root) { |
| 532 | rc = of_device_is_compatible(root, compat); |
| 533 | of_node_put(root); |
| 534 | } |
| 535 | return rc; |
| 536 | } |
Grant Likely | 71a157e | 2010-02-01 21:34:14 -0700 | [diff] [blame] | 537 | EXPORT_SYMBOL(of_machine_is_compatible); |
Grant Likely | 1f43cfb | 2010-01-28 13:47:25 -0700 | [diff] [blame] | 538 | |
| 539 | /** |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 540 | * __of_device_is_available - check if a device is available for use |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 541 | * |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 542 | * @device: Node to check for availability, with locks already held |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 543 | * |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 544 | * Returns true if the status property is absent or set to "okay" or "ok", |
| 545 | * false otherwise |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 546 | */ |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 547 | static bool __of_device_is_available(const struct device_node *device) |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 548 | { |
| 549 | const char *status; |
| 550 | int statlen; |
| 551 | |
Xiubo Li | 42ccd78 | 2014-01-13 11:07:28 +0800 | [diff] [blame] | 552 | if (!device) |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 553 | return false; |
Xiubo Li | 42ccd78 | 2014-01-13 11:07:28 +0800 | [diff] [blame] | 554 | |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 555 | status = __of_get_property(device, "status", &statlen); |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 556 | if (status == NULL) |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 557 | return true; |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 558 | |
| 559 | if (statlen > 0) { |
| 560 | if (!strcmp(status, "okay") || !strcmp(status, "ok")) |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 561 | return true; |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 562 | } |
| 563 | |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 564 | return false; |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 565 | } |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 566 | |
| 567 | /** |
| 568 | * of_device_is_available - check if a device is available for use |
| 569 | * |
| 570 | * @device: Node to check for availability |
| 571 | * |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 572 | * Returns true if the status property is absent or set to "okay" or "ok", |
| 573 | * false otherwise |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 574 | */ |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 575 | bool of_device_is_available(const struct device_node *device) |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 576 | { |
| 577 | unsigned long flags; |
Kevin Cernekee | 53a4ab9 | 2014-11-12 12:54:01 -0800 | [diff] [blame] | 578 | bool res; |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 579 | |
| 580 | raw_spin_lock_irqsave(&devtree_lock, flags); |
| 581 | res = __of_device_is_available(device); |
| 582 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
| 583 | return res; |
| 584 | |
| 585 | } |
Josh Boyer | 834d97d | 2008-03-27 00:33:14 +1100 | [diff] [blame] | 586 | EXPORT_SYMBOL(of_device_is_available); |
| 587 | |
| 588 | /** |
Kevin Cernekee | 37786c7 | 2015-04-09 13:05:14 -0700 | [diff] [blame] | 589 | * of_device_is_big_endian - check if a device has BE registers |
| 590 | * |
| 591 | * @device: Node to check for endianness |
| 592 | * |
| 593 | * Returns true if the device has a "big-endian" property, or if the kernel |
| 594 | * was compiled for BE *and* the device has a "native-endian" property. |
| 595 | * Returns false otherwise. |
| 596 | * |
| 597 | * Callers would nominally use ioread32be/iowrite32be if |
| 598 | * of_device_is_big_endian() == true, or readl/writel otherwise. |
| 599 | */ |
| 600 | bool of_device_is_big_endian(const struct device_node *device) |
| 601 | { |
| 602 | if (of_property_read_bool(device, "big-endian")) |
| 603 | return true; |
| 604 | if (IS_ENABLED(CONFIG_CPU_BIG_ENDIAN) && |
| 605 | of_property_read_bool(device, "native-endian")) |
| 606 | return true; |
| 607 | return false; |
| 608 | } |
| 609 | EXPORT_SYMBOL(of_device_is_big_endian); |
| 610 | |
| 611 | /** |
Stephen Rothwell | e679c5f | 2007-04-24 17:16:16 +1000 | [diff] [blame] | 612 | * of_get_parent - Get a node's parent if any |
| 613 | * @node: Node to get parent |
| 614 | * |
| 615 | * Returns a node pointer with refcount incremented, use |
| 616 | * of_node_put() on it when done. |
| 617 | */ |
| 618 | struct device_node *of_get_parent(const struct device_node *node) |
| 619 | { |
| 620 | struct device_node *np; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 621 | unsigned long flags; |
Stephen Rothwell | e679c5f | 2007-04-24 17:16:16 +1000 | [diff] [blame] | 622 | |
| 623 | if (!node) |
| 624 | return NULL; |
| 625 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 626 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Stephen Rothwell | e679c5f | 2007-04-24 17:16:16 +1000 | [diff] [blame] | 627 | np = of_node_get(node->parent); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 628 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Stephen Rothwell | e679c5f | 2007-04-24 17:16:16 +1000 | [diff] [blame] | 629 | return np; |
| 630 | } |
| 631 | EXPORT_SYMBOL(of_get_parent); |
Stephen Rothwell | d1cd355 | 2007-04-24 17:21:29 +1000 | [diff] [blame] | 632 | |
| 633 | /** |
Michael Ellerman | f4eb010 | 2007-10-26 16:54:31 +1000 | [diff] [blame] | 634 | * of_get_next_parent - Iterate to a node's parent |
| 635 | * @node: Node to get parent of |
| 636 | * |
Geert Uytterhoeven | c0e848d | 2014-10-22 11:44:55 +0200 | [diff] [blame] | 637 | * This is like of_get_parent() except that it drops the |
| 638 | * refcount on the passed node, making it suitable for iterating |
| 639 | * through a node's parents. |
Michael Ellerman | f4eb010 | 2007-10-26 16:54:31 +1000 | [diff] [blame] | 640 | * |
| 641 | * Returns a node pointer with refcount incremented, use |
| 642 | * of_node_put() on it when done. |
| 643 | */ |
| 644 | struct device_node *of_get_next_parent(struct device_node *node) |
| 645 | { |
| 646 | struct device_node *parent; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 647 | unsigned long flags; |
Michael Ellerman | f4eb010 | 2007-10-26 16:54:31 +1000 | [diff] [blame] | 648 | |
| 649 | if (!node) |
| 650 | return NULL; |
| 651 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 652 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Michael Ellerman | f4eb010 | 2007-10-26 16:54:31 +1000 | [diff] [blame] | 653 | parent = of_node_get(node->parent); |
| 654 | of_node_put(node); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 655 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Michael Ellerman | f4eb010 | 2007-10-26 16:54:31 +1000 | [diff] [blame] | 656 | return parent; |
| 657 | } |
Guennadi Liakhovetski | 6695be6 | 2013-04-02 12:28:11 -0300 | [diff] [blame] | 658 | EXPORT_SYMBOL(of_get_next_parent); |
Michael Ellerman | f4eb010 | 2007-10-26 16:54:31 +1000 | [diff] [blame] | 659 | |
Grant Likely | 0d0e02d | 2014-05-22 01:04:17 +0900 | [diff] [blame] | 660 | static struct device_node *__of_get_next_child(const struct device_node *node, |
| 661 | struct device_node *prev) |
| 662 | { |
| 663 | struct device_node *next; |
| 664 | |
Florian Fainelli | 43cb436 | 2014-05-28 10:39:02 -0700 | [diff] [blame] | 665 | if (!node) |
| 666 | return NULL; |
| 667 | |
Grant Likely | 0d0e02d | 2014-05-22 01:04:17 +0900 | [diff] [blame] | 668 | next = prev ? prev->sibling : node->child; |
| 669 | for (; next; next = next->sibling) |
| 670 | if (of_node_get(next)) |
| 671 | break; |
| 672 | of_node_put(prev); |
| 673 | return next; |
| 674 | } |
| 675 | #define __for_each_child_of_node(parent, child) \ |
| 676 | for (child = __of_get_next_child(parent, NULL); child != NULL; \ |
| 677 | child = __of_get_next_child(parent, child)) |
| 678 | |
Michael Ellerman | f4eb010 | 2007-10-26 16:54:31 +1000 | [diff] [blame] | 679 | /** |
Stephen Rothwell | d1cd355 | 2007-04-24 17:21:29 +1000 | [diff] [blame] | 680 | * of_get_next_child - Iterate a node childs |
| 681 | * @node: parent node |
| 682 | * @prev: previous child of the parent node, or NULL to get first |
| 683 | * |
Baruch Siach | 6480827 | 2015-03-19 14:03:41 +0200 | [diff] [blame] | 684 | * Returns a node pointer with refcount incremented, use of_node_put() on |
| 685 | * it when done. Returns NULL when prev is the last child. Decrements the |
| 686 | * refcount of prev. |
Stephen Rothwell | d1cd355 | 2007-04-24 17:21:29 +1000 | [diff] [blame] | 687 | */ |
| 688 | struct device_node *of_get_next_child(const struct device_node *node, |
| 689 | struct device_node *prev) |
| 690 | { |
| 691 | struct device_node *next; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 692 | unsigned long flags; |
Stephen Rothwell | d1cd355 | 2007-04-24 17:21:29 +1000 | [diff] [blame] | 693 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 694 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | 0d0e02d | 2014-05-22 01:04:17 +0900 | [diff] [blame] | 695 | next = __of_get_next_child(node, prev); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 696 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Stephen Rothwell | d1cd355 | 2007-04-24 17:21:29 +1000 | [diff] [blame] | 697 | return next; |
| 698 | } |
| 699 | EXPORT_SYMBOL(of_get_next_child); |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 700 | |
| 701 | /** |
Timur Tabi | 3296193 | 2012-08-14 13:20:23 +0000 | [diff] [blame] | 702 | * of_get_next_available_child - Find the next available child node |
| 703 | * @node: parent node |
| 704 | * @prev: previous child of the parent node, or NULL to get first |
| 705 | * |
| 706 | * This function is like of_get_next_child(), except that it |
| 707 | * automatically skips any disabled nodes (i.e. status = "disabled"). |
| 708 | */ |
| 709 | struct device_node *of_get_next_available_child(const struct device_node *node, |
| 710 | struct device_node *prev) |
| 711 | { |
| 712 | struct device_node *next; |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 713 | unsigned long flags; |
Timur Tabi | 3296193 | 2012-08-14 13:20:23 +0000 | [diff] [blame] | 714 | |
Florian Fainelli | 43cb436 | 2014-05-28 10:39:02 -0700 | [diff] [blame] | 715 | if (!node) |
| 716 | return NULL; |
| 717 | |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 718 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Timur Tabi | 3296193 | 2012-08-14 13:20:23 +0000 | [diff] [blame] | 719 | next = prev ? prev->sibling : node->child; |
| 720 | for (; next; next = next->sibling) { |
Stephen Warren | c31a0c0 | 2013-02-11 14:15:32 -0700 | [diff] [blame] | 721 | if (!__of_device_is_available(next)) |
Timur Tabi | 3296193 | 2012-08-14 13:20:23 +0000 | [diff] [blame] | 722 | continue; |
| 723 | if (of_node_get(next)) |
| 724 | break; |
| 725 | } |
| 726 | of_node_put(prev); |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 727 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Timur Tabi | 3296193 | 2012-08-14 13:20:23 +0000 | [diff] [blame] | 728 | return next; |
| 729 | } |
| 730 | EXPORT_SYMBOL(of_get_next_available_child); |
| 731 | |
| 732 | /** |
Johan Hovold | 95cd1aa | 2018-08-27 10:21:45 +0200 | [diff] [blame] | 733 | * of_get_compatible_child - Find compatible child node |
| 734 | * @parent: parent node |
| 735 | * @compatible: compatible string |
| 736 | * |
| 737 | * Lookup child node whose compatible property contains the given compatible |
| 738 | * string. |
| 739 | * |
| 740 | * Returns a node pointer with refcount incremented, use of_node_put() on it |
| 741 | * when done; or NULL if not found. |
| 742 | */ |
| 743 | struct device_node *of_get_compatible_child(const struct device_node *parent, |
| 744 | const char *compatible) |
| 745 | { |
| 746 | struct device_node *child; |
| 747 | |
| 748 | for_each_child_of_node(parent, child) { |
| 749 | if (of_device_is_compatible(child, compatible)) |
| 750 | break; |
| 751 | } |
| 752 | |
| 753 | return child; |
| 754 | } |
| 755 | EXPORT_SYMBOL(of_get_compatible_child); |
| 756 | |
| 757 | /** |
Srinivas Kandagatla | 9c19761 | 2012-09-18 08:10:28 +0100 | [diff] [blame] | 758 | * of_get_child_by_name - Find the child node by name for a given parent |
| 759 | * @node: parent node |
| 760 | * @name: child name to look for. |
| 761 | * |
| 762 | * This function looks for child node for given matching name |
| 763 | * |
| 764 | * Returns a node pointer if found, with refcount incremented, use |
| 765 | * of_node_put() on it when done. |
| 766 | * Returns NULL if node is not found. |
| 767 | */ |
| 768 | struct device_node *of_get_child_by_name(const struct device_node *node, |
| 769 | const char *name) |
| 770 | { |
| 771 | struct device_node *child; |
| 772 | |
| 773 | for_each_child_of_node(node, child) |
| 774 | if (child->name && (of_node_cmp(child->name, name) == 0)) |
| 775 | break; |
| 776 | return child; |
| 777 | } |
| 778 | EXPORT_SYMBOL(of_get_child_by_name); |
| 779 | |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 780 | static struct device_node *__of_find_node_by_path(struct device_node *parent, |
| 781 | const char *path) |
| 782 | { |
| 783 | struct device_node *child; |
Leif Lindholm | 106937e | 2015-03-06 16:52:53 +0000 | [diff] [blame] | 784 | int len; |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 785 | |
Brian Norris | 721a09e | 2015-03-17 12:30:31 -0700 | [diff] [blame] | 786 | len = strcspn(path, "/:"); |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 787 | if (!len) |
| 788 | return NULL; |
| 789 | |
| 790 | __for_each_child_of_node(parent, child) { |
| 791 | const char *name = strrchr(child->full_name, '/'); |
| 792 | if (WARN(!name, "malformed device_node %s\n", child->full_name)) |
| 793 | continue; |
| 794 | name++; |
| 795 | if (strncmp(path, name, len) == 0 && (strlen(name) == len)) |
| 796 | return child; |
| 797 | } |
| 798 | return NULL; |
| 799 | } |
| 800 | |
Srinivas Kandagatla | 9c19761 | 2012-09-18 08:10:28 +0100 | [diff] [blame] | 801 | /** |
Leif Lindholm | 75c28c0 | 2014-11-28 11:34:28 +0000 | [diff] [blame] | 802 | * of_find_node_opts_by_path - Find a node matching a full OF path |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 803 | * @path: Either the full path to match, or if the path does not |
| 804 | * start with '/', the name of a property of the /aliases |
| 805 | * node (an alias). In the case of an alias, the node |
| 806 | * matching the alias' value will be returned. |
Leif Lindholm | 75c28c0 | 2014-11-28 11:34:28 +0000 | [diff] [blame] | 807 | * @opts: Address of a pointer into which to store the start of |
| 808 | * an options string appended to the end of the path with |
| 809 | * a ':' separator. |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 810 | * |
| 811 | * Valid paths: |
| 812 | * /foo/bar Full path |
| 813 | * foo Valid alias |
| 814 | * foo/bar Valid alias + relative path |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 815 | * |
| 816 | * Returns a node pointer with refcount incremented, use |
| 817 | * of_node_put() on it when done. |
| 818 | */ |
Leif Lindholm | 75c28c0 | 2014-11-28 11:34:28 +0000 | [diff] [blame] | 819 | struct device_node *of_find_node_opts_by_path(const char *path, const char **opts) |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 820 | { |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 821 | struct device_node *np = NULL; |
| 822 | struct property *pp; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 823 | unsigned long flags; |
Leif Lindholm | 75c28c0 | 2014-11-28 11:34:28 +0000 | [diff] [blame] | 824 | const char *separator = strchr(path, ':'); |
| 825 | |
| 826 | if (opts) |
| 827 | *opts = separator ? separator + 1 : NULL; |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 828 | |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 829 | if (strcmp(path, "/") == 0) |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 830 | return of_node_get(of_root); |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 831 | |
| 832 | /* The path could begin with an alias */ |
| 833 | if (*path != '/') { |
Leif Lindholm | 106937e | 2015-03-06 16:52:53 +0000 | [diff] [blame] | 834 | int len; |
| 835 | const char *p = separator; |
| 836 | |
| 837 | if (!p) |
| 838 | p = strchrnul(path, '/'); |
| 839 | len = p - path; |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 840 | |
| 841 | /* of_aliases must not be NULL */ |
| 842 | if (!of_aliases) |
| 843 | return NULL; |
| 844 | |
| 845 | for_each_property_of_node(of_aliases, pp) { |
| 846 | if (strlen(pp->name) == len && !strncmp(pp->name, path, len)) { |
| 847 | np = of_find_node_by_path(pp->value); |
| 848 | break; |
| 849 | } |
| 850 | } |
| 851 | if (!np) |
| 852 | return NULL; |
| 853 | path = p; |
| 854 | } |
| 855 | |
| 856 | /* Step down the tree matching path components */ |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 857 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 858 | if (!np) |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 859 | np = of_node_get(of_root); |
Grant Likely | c22e650 | 2014-03-14 17:07:12 +0000 | [diff] [blame] | 860 | while (np && *path == '/') { |
| 861 | path++; /* Increment past '/' delimiter */ |
| 862 | np = __of_find_node_by_path(np, path); |
| 863 | path = strchrnul(path, '/'); |
Leif Lindholm | 106937e | 2015-03-06 16:52:53 +0000 | [diff] [blame] | 864 | if (separator && separator < path) |
| 865 | break; |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 866 | } |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 867 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 868 | return np; |
| 869 | } |
Leif Lindholm | 75c28c0 | 2014-11-28 11:34:28 +0000 | [diff] [blame] | 870 | EXPORT_SYMBOL(of_find_node_opts_by_path); |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 871 | |
| 872 | /** |
| 873 | * of_find_node_by_name - Find a node by its "name" property |
| 874 | * @from: The node to start searching from or NULL, the node |
| 875 | * you pass will not be searched, only the next one |
| 876 | * will; typically, you pass what the previous call |
| 877 | * returned. of_node_put() will be called on it |
| 878 | * @name: The name string to match against |
| 879 | * |
| 880 | * Returns a node pointer with refcount incremented, use |
| 881 | * of_node_put() on it when done. |
| 882 | */ |
| 883 | struct device_node *of_find_node_by_name(struct device_node *from, |
| 884 | const char *name) |
| 885 | { |
| 886 | struct device_node *np; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 887 | unsigned long flags; |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 888 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 889 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 890 | for_each_of_allnodes_from(from, np) |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 891 | if (np->name && (of_node_cmp(np->name, name) == 0) |
| 892 | && of_node_get(np)) |
| 893 | break; |
| 894 | of_node_put(from); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 895 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 896 | return np; |
| 897 | } |
| 898 | EXPORT_SYMBOL(of_find_node_by_name); |
| 899 | |
| 900 | /** |
| 901 | * of_find_node_by_type - Find a node by its "device_type" property |
| 902 | * @from: The node to start searching from, or NULL to start searching |
| 903 | * the entire device tree. The node you pass will not be |
| 904 | * searched, only the next one will; typically, you pass |
| 905 | * what the previous call returned. of_node_put() will be |
| 906 | * called on from for you. |
| 907 | * @type: The type string to match against |
| 908 | * |
| 909 | * Returns a node pointer with refcount incremented, use |
| 910 | * of_node_put() on it when done. |
| 911 | */ |
| 912 | struct device_node *of_find_node_by_type(struct device_node *from, |
| 913 | const char *type) |
| 914 | { |
| 915 | struct device_node *np; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 916 | unsigned long flags; |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 917 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 918 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 919 | for_each_of_allnodes_from(from, np) |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 920 | if (np->type && (of_node_cmp(np->type, type) == 0) |
| 921 | && of_node_get(np)) |
| 922 | break; |
| 923 | of_node_put(from); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 924 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 925 | return np; |
| 926 | } |
| 927 | EXPORT_SYMBOL(of_find_node_by_type); |
| 928 | |
| 929 | /** |
| 930 | * of_find_compatible_node - Find a node based on type and one of the |
| 931 | * tokens in its "compatible" property |
| 932 | * @from: The node to start searching from or NULL, the node |
| 933 | * you pass will not be searched, only the next one |
| 934 | * will; typically, you pass what the previous call |
| 935 | * returned. of_node_put() will be called on it |
| 936 | * @type: The type string to match "device_type" or NULL to ignore |
| 937 | * @compatible: The string to match to one of the tokens in the device |
| 938 | * "compatible" list. |
| 939 | * |
| 940 | * Returns a node pointer with refcount incremented, use |
| 941 | * of_node_put() on it when done. |
| 942 | */ |
| 943 | struct device_node *of_find_compatible_node(struct device_node *from, |
| 944 | const char *type, const char *compatible) |
| 945 | { |
| 946 | struct device_node *np; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 947 | unsigned long flags; |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 948 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 949 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 950 | for_each_of_allnodes_from(from, np) |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 951 | if (__of_device_is_compatible(np, compatible, type, NULL) && |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 952 | of_node_get(np)) |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 953 | break; |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 954 | of_node_put(from); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 955 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Stephen Rothwell | 1ef4d42 | 2007-04-24 17:57:33 +1000 | [diff] [blame] | 956 | return np; |
| 957 | } |
| 958 | EXPORT_SYMBOL(of_find_compatible_node); |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 959 | |
| 960 | /** |
Michael Ellerman | 1e291b1 | 2008-11-12 18:54:42 +0000 | [diff] [blame] | 961 | * of_find_node_with_property - Find a node which has a property with |
| 962 | * the given name. |
| 963 | * @from: The node to start searching from or NULL, the node |
| 964 | * you pass will not be searched, only the next one |
| 965 | * will; typically, you pass what the previous call |
| 966 | * returned. of_node_put() will be called on it |
| 967 | * @prop_name: The name of the property to look for. |
| 968 | * |
| 969 | * Returns a node pointer with refcount incremented, use |
| 970 | * of_node_put() on it when done. |
| 971 | */ |
| 972 | struct device_node *of_find_node_with_property(struct device_node *from, |
| 973 | const char *prop_name) |
| 974 | { |
| 975 | struct device_node *np; |
| 976 | struct property *pp; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 977 | unsigned long flags; |
Michael Ellerman | 1e291b1 | 2008-11-12 18:54:42 +0000 | [diff] [blame] | 978 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 979 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 980 | for_each_of_allnodes_from(from, np) { |
Sachin Kamat | a3a7cab | 2012-06-27 09:44:45 +0530 | [diff] [blame] | 981 | for (pp = np->properties; pp; pp = pp->next) { |
Michael Ellerman | 1e291b1 | 2008-11-12 18:54:42 +0000 | [diff] [blame] | 982 | if (of_prop_cmp(pp->name, prop_name) == 0) { |
| 983 | of_node_get(np); |
| 984 | goto out; |
| 985 | } |
| 986 | } |
| 987 | } |
| 988 | out: |
| 989 | of_node_put(from); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 990 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Michael Ellerman | 1e291b1 | 2008-11-12 18:54:42 +0000 | [diff] [blame] | 991 | return np; |
| 992 | } |
| 993 | EXPORT_SYMBOL(of_find_node_with_property); |
| 994 | |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 995 | static |
| 996 | const struct of_device_id *__of_match_node(const struct of_device_id *matches, |
| 997 | const struct device_node *node) |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 998 | { |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 999 | const struct of_device_id *best_match = NULL; |
| 1000 | int score, best_score = 0; |
| 1001 | |
Grant Likely | a52f07e | 2011-03-18 10:21:29 -0600 | [diff] [blame] | 1002 | if (!matches) |
| 1003 | return NULL; |
| 1004 | |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 1005 | for (; matches->name[0] || matches->type[0] || matches->compatible[0]; matches++) { |
| 1006 | score = __of_device_is_compatible(node, matches->compatible, |
| 1007 | matches->type, matches->name); |
| 1008 | if (score > best_score) { |
| 1009 | best_match = matches; |
| 1010 | best_score = score; |
| 1011 | } |
Kevin Hao | 4e8ca6e | 2014-02-14 13:22:45 +0800 | [diff] [blame] | 1012 | } |
Kevin Hao | 215a14c | 2014-02-19 16:15:45 +0800 | [diff] [blame] | 1013 | |
| 1014 | return best_match; |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1015 | } |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 1016 | |
| 1017 | /** |
Geert Uytterhoeven | c50949d | 2014-10-22 11:44:54 +0200 | [diff] [blame] | 1018 | * of_match_node - Tell if a device_node has a matching of_match structure |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 1019 | * @matches: array of of device match structures to search in |
| 1020 | * @node: the of device structure to match against |
| 1021 | * |
Kevin Hao | 71c5498 | 2014-02-18 15:57:29 +0800 | [diff] [blame] | 1022 | * Low level utility function used by device matching. |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 1023 | */ |
| 1024 | const struct of_device_id *of_match_node(const struct of_device_id *matches, |
| 1025 | const struct device_node *node) |
| 1026 | { |
| 1027 | const struct of_device_id *match; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1028 | unsigned long flags; |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 1029 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1030 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 1031 | match = __of_match_node(matches, node); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1032 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 1033 | return match; |
| 1034 | } |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1035 | EXPORT_SYMBOL(of_match_node); |
| 1036 | |
| 1037 | /** |
Stephen Warren | 50c8af4 | 2012-11-20 16:12:20 -0700 | [diff] [blame] | 1038 | * of_find_matching_node_and_match - Find a node based on an of_device_id |
| 1039 | * match table. |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1040 | * @from: The node to start searching from or NULL, the node |
| 1041 | * you pass will not be searched, only the next one |
| 1042 | * will; typically, you pass what the previous call |
| 1043 | * returned. of_node_put() will be called on it |
| 1044 | * @matches: array of of device match structures to search in |
Stephen Warren | 50c8af4 | 2012-11-20 16:12:20 -0700 | [diff] [blame] | 1045 | * @match Updated to point at the matches entry which matched |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1046 | * |
| 1047 | * Returns a node pointer with refcount incremented, use |
| 1048 | * of_node_put() on it when done. |
| 1049 | */ |
Stephen Warren | 50c8af4 | 2012-11-20 16:12:20 -0700 | [diff] [blame] | 1050 | struct device_node *of_find_matching_node_and_match(struct device_node *from, |
| 1051 | const struct of_device_id *matches, |
| 1052 | const struct of_device_id **match) |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1053 | { |
| 1054 | struct device_node *np; |
Thomas Abraham | dc71bcf | 2013-01-19 10:20:42 -0800 | [diff] [blame] | 1055 | const struct of_device_id *m; |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1056 | unsigned long flags; |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1057 | |
Stephen Warren | 50c8af4 | 2012-11-20 16:12:20 -0700 | [diff] [blame] | 1058 | if (match) |
| 1059 | *match = NULL; |
| 1060 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1061 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Grant Likely | 5063e25 | 2014-10-03 16:28:27 +0100 | [diff] [blame] | 1062 | for_each_of_allnodes_from(from, np) { |
Thomas Gleixner | 28d0e36 | 2013-01-25 13:21:47 -0500 | [diff] [blame] | 1063 | m = __of_match_node(matches, np); |
Thomas Abraham | dc71bcf | 2013-01-19 10:20:42 -0800 | [diff] [blame] | 1064 | if (m && of_node_get(np)) { |
Stephen Warren | 50c8af4 | 2012-11-20 16:12:20 -0700 | [diff] [blame] | 1065 | if (match) |
Thomas Abraham | dc71bcf | 2013-01-19 10:20:42 -0800 | [diff] [blame] | 1066 | *match = m; |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1067 | break; |
Stephen Warren | 50c8af4 | 2012-11-20 16:12:20 -0700 | [diff] [blame] | 1068 | } |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1069 | } |
| 1070 | of_node_put(from); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1071 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Grant Likely | 283029d | 2008-01-09 06:20:40 +1100 | [diff] [blame] | 1072 | return np; |
| 1073 | } |
Grant Likely | 80c2022 | 2012-12-19 10:45:36 +0000 | [diff] [blame] | 1074 | EXPORT_SYMBOL(of_find_matching_node_and_match); |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1075 | |
| 1076 | /** |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1077 | * of_modalias_node - Lookup appropriate modalias for a device node |
| 1078 | * @node: pointer to a device tree node |
| 1079 | * @modalias: Pointer to buffer that modalias value will be copied into |
| 1080 | * @len: Length of modalias value |
| 1081 | * |
Grant Likely | 2ffe8c5 | 2010-06-08 07:48:19 -0600 | [diff] [blame] | 1082 | * Based on the value of the compatible property, this routine will attempt |
| 1083 | * to choose an appropriate modalias value for a particular device tree node. |
| 1084 | * It does this by stripping the manufacturer prefix (as delimited by a ',') |
| 1085 | * from the first entry in the compatible list property. |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1086 | * |
Grant Likely | 2ffe8c5 | 2010-06-08 07:48:19 -0600 | [diff] [blame] | 1087 | * This routine returns 0 on success, <0 on failure. |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1088 | */ |
| 1089 | int of_modalias_node(struct device_node *node, char *modalias, int len) |
| 1090 | { |
Grant Likely | 2ffe8c5 | 2010-06-08 07:48:19 -0600 | [diff] [blame] | 1091 | const char *compatible, *p; |
| 1092 | int cplen; |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1093 | |
| 1094 | compatible = of_get_property(node, "compatible", &cplen); |
Grant Likely | 2ffe8c5 | 2010-06-08 07:48:19 -0600 | [diff] [blame] | 1095 | if (!compatible || strlen(compatible) > cplen) |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1096 | return -ENODEV; |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1097 | p = strchr(compatible, ','); |
Grant Likely | 2ffe8c5 | 2010-06-08 07:48:19 -0600 | [diff] [blame] | 1098 | strlcpy(modalias, p ? p + 1 : compatible, len); |
Grant Likely | 3f07af4 | 2008-07-25 22:25:13 -0400 | [diff] [blame] | 1099 | return 0; |
| 1100 | } |
| 1101 | EXPORT_SYMBOL_GPL(of_modalias_node); |
| 1102 | |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1103 | /** |
Jeremy Kerr | 89751a7 | 2010-02-01 21:34:11 -0700 | [diff] [blame] | 1104 | * of_find_node_by_phandle - Find a node given a phandle |
| 1105 | * @handle: phandle of the node to find |
| 1106 | * |
| 1107 | * Returns a node pointer with refcount incremented, use |
| 1108 | * of_node_put() on it when done. |
| 1109 | */ |
| 1110 | struct device_node *of_find_node_by_phandle(phandle handle) |
| 1111 | { |
Frank Rowand | f64054b | 2018-02-23 14:23:10 +0530 | [diff] [blame] | 1112 | struct device_node *np = NULL; |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 1113 | unsigned long flags; |
Frank Rowand | f64054b | 2018-02-23 14:23:10 +0530 | [diff] [blame] | 1114 | phandle masked_handle; |
Jeremy Kerr | 89751a7 | 2010-02-01 21:34:11 -0700 | [diff] [blame] | 1115 | |
Grant Likely | fc59b44 | 2014-10-02 13:08:02 +0100 | [diff] [blame] | 1116 | if (!handle) |
| 1117 | return NULL; |
| 1118 | |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 1119 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Frank Rowand | f64054b | 2018-02-23 14:23:10 +0530 | [diff] [blame] | 1120 | |
| 1121 | masked_handle = handle & phandle_cache_mask; |
| 1122 | |
| 1123 | if (phandle_cache) { |
| 1124 | if (phandle_cache[masked_handle] && |
| 1125 | handle == phandle_cache[masked_handle]->phandle) |
| 1126 | np = phandle_cache[masked_handle]; |
| 1127 | } |
| 1128 | |
| 1129 | if (!np) { |
| 1130 | for_each_of_allnodes(np) |
| 1131 | if (np->phandle == handle) { |
| 1132 | if (phandle_cache) |
| 1133 | phandle_cache[masked_handle] = np; |
| 1134 | break; |
| 1135 | } |
| 1136 | } |
| 1137 | |
Jeremy Kerr | 89751a7 | 2010-02-01 21:34:11 -0700 | [diff] [blame] | 1138 | of_node_get(np); |
Benjamin Herrenschmidt | d25d869 | 2013-06-12 15:39:04 +1000 | [diff] [blame] | 1139 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Jeremy Kerr | 89751a7 | 2010-02-01 21:34:11 -0700 | [diff] [blame] | 1140 | return np; |
| 1141 | } |
| 1142 | EXPORT_SYMBOL(of_find_node_by_phandle); |
| 1143 | |
| 1144 | /** |
Heiko Stuebner | ad54a0c | 2014-02-12 01:00:34 +0100 | [diff] [blame] | 1145 | * of_property_count_elems_of_size - Count the number of elements in a property |
| 1146 | * |
| 1147 | * @np: device node from which the property value is to be read. |
| 1148 | * @propname: name of the property to be searched. |
| 1149 | * @elem_size: size of the individual element |
| 1150 | * |
| 1151 | * Search for a property in a device node and count the number of elements of |
| 1152 | * size elem_size in it. Returns number of elements on sucess, -EINVAL if the |
| 1153 | * property does not exist or its length does not match a multiple of elem_size |
| 1154 | * and -ENODATA if the property does not have a value. |
| 1155 | */ |
| 1156 | int of_property_count_elems_of_size(const struct device_node *np, |
| 1157 | const char *propname, int elem_size) |
| 1158 | { |
| 1159 | struct property *prop = of_find_property(np, propname, NULL); |
| 1160 | |
| 1161 | if (!prop) |
| 1162 | return -EINVAL; |
| 1163 | if (!prop->value) |
| 1164 | return -ENODATA; |
| 1165 | |
| 1166 | if (prop->length % elem_size != 0) { |
| 1167 | pr_err("size of %s in node %s is not a multiple of %d\n", |
| 1168 | propname, np->full_name, elem_size); |
| 1169 | return -EINVAL; |
| 1170 | } |
| 1171 | |
| 1172 | return prop->length / elem_size; |
| 1173 | } |
| 1174 | EXPORT_SYMBOL_GPL(of_property_count_elems_of_size); |
| 1175 | |
| 1176 | /** |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1177 | * of_find_property_value_of_size |
| 1178 | * |
| 1179 | * @np: device node from which the property value is to be read. |
| 1180 | * @propname: name of the property to be searched. |
Richard Fitzgerald | 79ac5d3 | 2016-09-12 14:01:28 +0100 | [diff] [blame] | 1181 | * @min: minimum allowed length of property value |
| 1182 | * @max: maximum allowed length of property value (0 means unlimited) |
| 1183 | * @len: if !=NULL, actual length is written to here |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1184 | * |
| 1185 | * Search for a property in a device node and valid the requested size. |
| 1186 | * Returns the property value on success, -EINVAL if the property does not |
| 1187 | * exist, -ENODATA if property does not have a value, and -EOVERFLOW if the |
Richard Fitzgerald | 79ac5d3 | 2016-09-12 14:01:28 +0100 | [diff] [blame] | 1188 | * property data is too small or too large. |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1189 | * |
| 1190 | */ |
| 1191 | static void *of_find_property_value_of_size(const struct device_node *np, |
Richard Fitzgerald | 79ac5d3 | 2016-09-12 14:01:28 +0100 | [diff] [blame] | 1192 | const char *propname, u32 min, u32 max, size_t *len) |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1193 | { |
| 1194 | struct property *prop = of_find_property(np, propname, NULL); |
| 1195 | |
| 1196 | if (!prop) |
| 1197 | return ERR_PTR(-EINVAL); |
| 1198 | if (!prop->value) |
| 1199 | return ERR_PTR(-ENODATA); |
Richard Fitzgerald | 79ac5d3 | 2016-09-12 14:01:28 +0100 | [diff] [blame] | 1200 | if (prop->length < min) |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1201 | return ERR_PTR(-EOVERFLOW); |
Richard Fitzgerald | 79ac5d3 | 2016-09-12 14:01:28 +0100 | [diff] [blame] | 1202 | if (max && prop->length > max) |
| 1203 | return ERR_PTR(-EOVERFLOW); |
| 1204 | |
| 1205 | if (len) |
| 1206 | *len = prop->length; |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1207 | |
| 1208 | return prop->value; |
| 1209 | } |
| 1210 | |
| 1211 | /** |
Tony Prisk | 3daf372 | 2013-03-23 17:02:15 +1300 | [diff] [blame] | 1212 | * of_property_read_u32_index - Find and read a u32 from a multi-value property. |
| 1213 | * |
| 1214 | * @np: device node from which the property value is to be read. |
| 1215 | * @propname: name of the property to be searched. |
| 1216 | * @index: index of the u32 in the list of values |
| 1217 | * @out_value: pointer to return value, modified only if no error. |
| 1218 | * |
| 1219 | * Search for a property in a device node and read nth 32-bit value from |
| 1220 | * it. Returns 0 on success, -EINVAL if the property does not exist, |
| 1221 | * -ENODATA if property does not have a value, and -EOVERFLOW if the |
| 1222 | * property data isn't large enough. |
| 1223 | * |
| 1224 | * The out_value is modified only if a valid u32 value can be decoded. |
| 1225 | */ |
| 1226 | int of_property_read_u32_index(const struct device_node *np, |
| 1227 | const char *propname, |
| 1228 | u32 index, u32 *out_value) |
| 1229 | { |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1230 | const u32 *val = of_find_property_value_of_size(np, propname, |
Richard Fitzgerald | 79ac5d3 | 2016-09-12 14:01:28 +0100 | [diff] [blame] | 1231 | ((index + 1) * sizeof(*out_value)), |
| 1232 | 0, |
| 1233 | NULL); |
Tony Prisk | 3daf372 | 2013-03-23 17:02:15 +1300 | [diff] [blame] | 1234 | |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1235 | if (IS_ERR(val)) |
| 1236 | return PTR_ERR(val); |
Tony Prisk | 3daf372 | 2013-03-23 17:02:15 +1300 | [diff] [blame] | 1237 | |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1238 | *out_value = be32_to_cpup(((__be32 *)val) + index); |
Tony Prisk | 3daf372 | 2013-03-23 17:02:15 +1300 | [diff] [blame] | 1239 | return 0; |
| 1240 | } |
| 1241 | EXPORT_SYMBOL_GPL(of_property_read_u32_index); |
| 1242 | |
| 1243 | /** |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1244 | * of_property_read_variable_u8_array - Find and read an array of u8 from a |
| 1245 | * property, with bounds on the minimum and maximum array size. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1246 | * |
| 1247 | * @np: device node from which the property value is to be read. |
| 1248 | * @propname: name of the property to be searched. |
Lad, Prabhakar | 792efb8 | 2013-05-07 11:34:11 +0530 | [diff] [blame] | 1249 | * @out_values: pointer to return value, modified only if return value is 0. |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1250 | * @sz_min: minimum number of array elements to read |
| 1251 | * @sz_max: maximum number of array elements to read, if zero there is no |
| 1252 | * upper limit on the number of elements in the dts entry but only |
| 1253 | * sz_min will be read. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1254 | * |
| 1255 | * Search for a property in a device node and read 8-bit value(s) from |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1256 | * it. Returns number of elements read on success, -EINVAL if the property |
| 1257 | * does not exist, -ENODATA if property does not have a value, and -EOVERFLOW |
| 1258 | * if the property data is smaller than sz_min or longer than sz_max. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1259 | * |
| 1260 | * dts entry of array should be like: |
| 1261 | * property = /bits/ 8 <0x50 0x60 0x70>; |
| 1262 | * |
Lad, Prabhakar | 792efb8 | 2013-05-07 11:34:11 +0530 | [diff] [blame] | 1263 | * The out_values is modified only if a valid u8 value can be decoded. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1264 | */ |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1265 | int of_property_read_variable_u8_array(const struct device_node *np, |
| 1266 | const char *propname, u8 *out_values, |
| 1267 | size_t sz_min, size_t sz_max) |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1268 | { |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1269 | size_t sz, count; |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1270 | const u8 *val = of_find_property_value_of_size(np, propname, |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1271 | (sz_min * sizeof(*out_values)), |
| 1272 | (sz_max * sizeof(*out_values)), |
| 1273 | &sz); |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1274 | |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1275 | if (IS_ERR(val)) |
| 1276 | return PTR_ERR(val); |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1277 | |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1278 | if (!sz_max) |
| 1279 | sz = sz_min; |
| 1280 | else |
| 1281 | sz /= sizeof(*out_values); |
| 1282 | |
| 1283 | count = sz; |
| 1284 | while (count--) |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1285 | *out_values++ = *val++; |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1286 | |
| 1287 | return sz; |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1288 | } |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1289 | EXPORT_SYMBOL_GPL(of_property_read_variable_u8_array); |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1290 | |
| 1291 | /** |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1292 | * of_property_read_variable_u16_array - Find and read an array of u16 from a |
| 1293 | * property, with bounds on the minimum and maximum array size. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1294 | * |
| 1295 | * @np: device node from which the property value is to be read. |
| 1296 | * @propname: name of the property to be searched. |
Lad, Prabhakar | 792efb8 | 2013-05-07 11:34:11 +0530 | [diff] [blame] | 1297 | * @out_values: pointer to return value, modified only if return value is 0. |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1298 | * @sz_min: minimum number of array elements to read |
| 1299 | * @sz_max: maximum number of array elements to read, if zero there is no |
| 1300 | * upper limit on the number of elements in the dts entry but only |
| 1301 | * sz_min will be read. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1302 | * |
| 1303 | * Search for a property in a device node and read 16-bit value(s) from |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1304 | * it. Returns number of elements read on success, -EINVAL if the property |
| 1305 | * does not exist, -ENODATA if property does not have a value, and -EOVERFLOW |
| 1306 | * if the property data is smaller than sz_min or longer than sz_max. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1307 | * |
| 1308 | * dts entry of array should be like: |
| 1309 | * property = /bits/ 16 <0x5000 0x6000 0x7000>; |
| 1310 | * |
Lad, Prabhakar | 792efb8 | 2013-05-07 11:34:11 +0530 | [diff] [blame] | 1311 | * The out_values is modified only if a valid u16 value can be decoded. |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1312 | */ |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1313 | int of_property_read_variable_u16_array(const struct device_node *np, |
| 1314 | const char *propname, u16 *out_values, |
| 1315 | size_t sz_min, size_t sz_max) |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1316 | { |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1317 | size_t sz, count; |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1318 | const __be16 *val = of_find_property_value_of_size(np, propname, |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1319 | (sz_min * sizeof(*out_values)), |
| 1320 | (sz_max * sizeof(*out_values)), |
| 1321 | &sz); |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1322 | |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1323 | if (IS_ERR(val)) |
| 1324 | return PTR_ERR(val); |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1325 | |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1326 | if (!sz_max) |
| 1327 | sz = sz_min; |
| 1328 | else |
| 1329 | sz /= sizeof(*out_values); |
| 1330 | |
| 1331 | count = sz; |
| 1332 | while (count--) |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1333 | *out_values++ = be16_to_cpup(val++); |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1334 | |
| 1335 | return sz; |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1336 | } |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1337 | EXPORT_SYMBOL_GPL(of_property_read_variable_u16_array); |
Viresh Kumar | be19324 | 2012-11-20 10:15:19 +0530 | [diff] [blame] | 1338 | |
| 1339 | /** |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1340 | * of_property_read_variable_u32_array - Find and read an array of 32 bit |
| 1341 | * integers from a property, with bounds on the minimum and maximum array size. |
Rob Herring | 0e37363 | 2011-07-06 15:42:58 -0500 | [diff] [blame] | 1342 | * |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1343 | * @np: device node from which the property value is to be read. |
| 1344 | * @propname: name of the property to be searched. |
Lad, Prabhakar | 792efb8 | 2013-05-07 11:34:11 +0530 | [diff] [blame] | 1345 | * @out_values: pointer to return value, modified only if return value is 0. |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1346 | * @sz_min: minimum number of array elements to read |
| 1347 | * @sz_max: maximum number of array elements to read, if zero there is no |
| 1348 | * upper limit on the number of elements in the dts entry but only |
| 1349 | * sz_min will be read. |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1350 | * |
Rob Herring | 0e37363 | 2011-07-06 15:42:58 -0500 | [diff] [blame] | 1351 | * Search for a property in a device node and read 32-bit value(s) from |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1352 | * it. Returns number of elements read on success, -EINVAL if the property |
| 1353 | * does not exist, -ENODATA if property does not have a value, and -EOVERFLOW |
| 1354 | * if the property data is smaller than sz_min or longer than sz_max. |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1355 | * |
Lad, Prabhakar | 792efb8 | 2013-05-07 11:34:11 +0530 | [diff] [blame] | 1356 | * The out_values is modified only if a valid u32 value can be decoded. |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1357 | */ |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1358 | int of_property_read_variable_u32_array(const struct device_node *np, |
Jamie Iles | aac285c | 2011-08-02 15:45:07 +0100 | [diff] [blame] | 1359 | const char *propname, u32 *out_values, |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1360 | size_t sz_min, size_t sz_max) |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1361 | { |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1362 | size_t sz, count; |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1363 | const __be32 *val = of_find_property_value_of_size(np, propname, |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1364 | (sz_min * sizeof(*out_values)), |
| 1365 | (sz_max * sizeof(*out_values)), |
| 1366 | &sz); |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1367 | |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1368 | if (IS_ERR(val)) |
| 1369 | return PTR_ERR(val); |
Rob Herring | 0e37363 | 2011-07-06 15:42:58 -0500 | [diff] [blame] | 1370 | |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1371 | if (!sz_max) |
| 1372 | sz = sz_min; |
| 1373 | else |
| 1374 | sz /= sizeof(*out_values); |
| 1375 | |
| 1376 | count = sz; |
| 1377 | while (count--) |
Rob Herring | 0e37363 | 2011-07-06 15:42:58 -0500 | [diff] [blame] | 1378 | *out_values++ = be32_to_cpup(val++); |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1379 | |
| 1380 | return sz; |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1381 | } |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1382 | EXPORT_SYMBOL_GPL(of_property_read_variable_u32_array); |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1383 | |
| 1384 | /** |
Jamie Iles | 4cd7f7a | 2011-09-14 20:49:59 +0100 | [diff] [blame] | 1385 | * of_property_read_u64 - Find and read a 64 bit integer from a property |
| 1386 | * @np: device node from which the property value is to be read. |
| 1387 | * @propname: name of the property to be searched. |
| 1388 | * @out_value: pointer to return value, modified only if return value is 0. |
| 1389 | * |
| 1390 | * Search for a property in a device node and read a 64-bit value from |
| 1391 | * it. Returns 0 on success, -EINVAL if the property does not exist, |
| 1392 | * -ENODATA if property does not have a value, and -EOVERFLOW if the |
| 1393 | * property data isn't large enough. |
| 1394 | * |
| 1395 | * The out_value is modified only if a valid u64 value can be decoded. |
| 1396 | */ |
| 1397 | int of_property_read_u64(const struct device_node *np, const char *propname, |
| 1398 | u64 *out_value) |
| 1399 | { |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1400 | const __be32 *val = of_find_property_value_of_size(np, propname, |
Richard Fitzgerald | 79ac5d3 | 2016-09-12 14:01:28 +0100 | [diff] [blame] | 1401 | sizeof(*out_value), |
| 1402 | 0, |
| 1403 | NULL); |
Jamie Iles | 4cd7f7a | 2011-09-14 20:49:59 +0100 | [diff] [blame] | 1404 | |
Tony Prisk | daeec1f | 2013-04-03 17:57:11 +1300 | [diff] [blame] | 1405 | if (IS_ERR(val)) |
| 1406 | return PTR_ERR(val); |
| 1407 | |
| 1408 | *out_value = of_read_number(val, 2); |
Jamie Iles | 4cd7f7a | 2011-09-14 20:49:59 +0100 | [diff] [blame] | 1409 | return 0; |
| 1410 | } |
| 1411 | EXPORT_SYMBOL_GPL(of_property_read_u64); |
| 1412 | |
| 1413 | /** |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1414 | * of_property_read_variable_u64_array - Find and read an array of 64 bit |
| 1415 | * integers from a property, with bounds on the minimum and maximum array size. |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1416 | * |
| 1417 | * @np: device node from which the property value is to be read. |
| 1418 | * @propname: name of the property to be searched. |
| 1419 | * @out_values: pointer to return value, modified only if return value is 0. |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1420 | * @sz_min: minimum number of array elements to read |
| 1421 | * @sz_max: maximum number of array elements to read, if zero there is no |
| 1422 | * upper limit on the number of elements in the dts entry but only |
| 1423 | * sz_min will be read. |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1424 | * |
| 1425 | * Search for a property in a device node and read 64-bit value(s) from |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1426 | * it. Returns number of elements read on success, -EINVAL if the property |
| 1427 | * does not exist, -ENODATA if property does not have a value, and -EOVERFLOW |
| 1428 | * if the property data is smaller than sz_min or longer than sz_max. |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1429 | * |
| 1430 | * The out_values is modified only if a valid u64 value can be decoded. |
| 1431 | */ |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1432 | int of_property_read_variable_u64_array(const struct device_node *np, |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1433 | const char *propname, u64 *out_values, |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1434 | size_t sz_min, size_t sz_max) |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1435 | { |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1436 | size_t sz, count; |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1437 | const __be32 *val = of_find_property_value_of_size(np, propname, |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1438 | (sz_min * sizeof(*out_values)), |
| 1439 | (sz_max * sizeof(*out_values)), |
| 1440 | &sz); |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1441 | |
| 1442 | if (IS_ERR(val)) |
| 1443 | return PTR_ERR(val); |
| 1444 | |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1445 | if (!sz_max) |
| 1446 | sz = sz_min; |
| 1447 | else |
| 1448 | sz /= sizeof(*out_values); |
| 1449 | |
| 1450 | count = sz; |
| 1451 | while (count--) { |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1452 | *out_values++ = of_read_number(val, 2); |
| 1453 | val += 2; |
| 1454 | } |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1455 | |
| 1456 | return sz; |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1457 | } |
Richard Fitzgerald | a67e947 | 2016-09-12 14:01:29 +0100 | [diff] [blame] | 1458 | EXPORT_SYMBOL_GPL(of_property_read_variable_u64_array); |
Rafael J. Wysocki | b31384f | 2014-11-04 01:28:56 +0100 | [diff] [blame] | 1459 | |
| 1460 | /** |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1461 | * of_property_read_string - Find and read a string from a property |
| 1462 | * @np: device node from which the property value is to be read. |
| 1463 | * @propname: name of the property to be searched. |
| 1464 | * @out_string: pointer to null terminated return string, modified only if |
| 1465 | * return value is 0. |
| 1466 | * |
| 1467 | * Search for a property in a device tree node and retrieve a null |
| 1468 | * terminated string value (pointer to data, not a copy). Returns 0 on |
| 1469 | * success, -EINVAL if the property does not exist, -ENODATA if property |
| 1470 | * does not have a value, and -EILSEQ if the string is not null-terminated |
| 1471 | * within the length of the property data. |
| 1472 | * |
| 1473 | * The out_string pointer is modified only if a valid string can be decoded. |
| 1474 | */ |
David Rivshin | fe99c70 | 2016-03-02 16:35:51 -0500 | [diff] [blame] | 1475 | int of_property_read_string(const struct device_node *np, const char *propname, |
Shawn Guo | f09bc83 | 2011-07-04 09:01:18 +0800 | [diff] [blame] | 1476 | const char **out_string) |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1477 | { |
David Rivshin | fe99c70 | 2016-03-02 16:35:51 -0500 | [diff] [blame] | 1478 | const struct property *prop = of_find_property(np, propname, NULL); |
Thomas Abraham | a3b8536 | 2011-06-30 21:26:10 +0530 | [diff] [blame] | 1479 | if (!prop) |
| 1480 | return -EINVAL; |
| 1481 | if (!prop->value) |
| 1482 | return -ENODATA; |
| 1483 | if (strnlen(prop->value, prop->length) >= prop->length) |
| 1484 | return -EILSEQ; |
| 1485 | *out_string = prop->value; |
| 1486 | return 0; |
| 1487 | } |
| 1488 | EXPORT_SYMBOL_GPL(of_property_read_string); |
| 1489 | |
| 1490 | /** |
Grant Likely | 7aff0fe | 2011-12-12 09:25:58 -0700 | [diff] [blame] | 1491 | * of_property_match_string() - Find string in a list and return index |
| 1492 | * @np: pointer to node containing string list property |
| 1493 | * @propname: string list property name |
| 1494 | * @string: pointer to string to search for in string list |
| 1495 | * |
| 1496 | * This function searches a string list property and returns the index |
| 1497 | * of a specific string value. |
| 1498 | */ |
David Rivshin | fe99c70 | 2016-03-02 16:35:51 -0500 | [diff] [blame] | 1499 | int of_property_match_string(const struct device_node *np, const char *propname, |
Grant Likely | 7aff0fe | 2011-12-12 09:25:58 -0700 | [diff] [blame] | 1500 | const char *string) |
| 1501 | { |
David Rivshin | fe99c70 | 2016-03-02 16:35:51 -0500 | [diff] [blame] | 1502 | const struct property *prop = of_find_property(np, propname, NULL); |
Grant Likely | 7aff0fe | 2011-12-12 09:25:58 -0700 | [diff] [blame] | 1503 | size_t l; |
| 1504 | int i; |
| 1505 | const char *p, *end; |
| 1506 | |
| 1507 | if (!prop) |
| 1508 | return -EINVAL; |
| 1509 | if (!prop->value) |
| 1510 | return -ENODATA; |
| 1511 | |
| 1512 | p = prop->value; |
| 1513 | end = p + prop->length; |
| 1514 | |
| 1515 | for (i = 0; p < end; i++, p += l) { |
Grant Likely | a87fa1d | 2014-11-03 15:15:35 +0000 | [diff] [blame] | 1516 | l = strnlen(p, end - p) + 1; |
Grant Likely | 7aff0fe | 2011-12-12 09:25:58 -0700 | [diff] [blame] | 1517 | if (p + l > end) |
| 1518 | return -EILSEQ; |
| 1519 | pr_debug("comparing %s with %s\n", string, p); |
| 1520 | if (strcmp(string, p) == 0) |
| 1521 | return i; /* Found it; return index */ |
| 1522 | } |
| 1523 | return -ENODATA; |
| 1524 | } |
| 1525 | EXPORT_SYMBOL_GPL(of_property_match_string); |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1526 | |
| 1527 | /** |
Jiri Slaby | e99010e | 2014-11-21 13:23:09 +0100 | [diff] [blame] | 1528 | * of_property_read_string_helper() - Utility helper for parsing string properties |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1529 | * @np: device node from which the property value is to be read. |
| 1530 | * @propname: name of the property to be searched. |
Grant Likely | a87fa1d | 2014-11-03 15:15:35 +0000 | [diff] [blame] | 1531 | * @out_strs: output array of string pointers. |
| 1532 | * @sz: number of array elements to read. |
| 1533 | * @skip: Number of strings to skip over at beginning of list. |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1534 | * |
Grant Likely | a87fa1d | 2014-11-03 15:15:35 +0000 | [diff] [blame] | 1535 | * Don't call this function directly. It is a utility helper for the |
| 1536 | * of_property_read_string*() family of functions. |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1537 | */ |
David Rivshin | fe99c70 | 2016-03-02 16:35:51 -0500 | [diff] [blame] | 1538 | int of_property_read_string_helper(const struct device_node *np, |
| 1539 | const char *propname, const char **out_strs, |
| 1540 | size_t sz, int skip) |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1541 | { |
David Rivshin | fe99c70 | 2016-03-02 16:35:51 -0500 | [diff] [blame] | 1542 | const struct property *prop = of_find_property(np, propname, NULL); |
Grant Likely | a87fa1d | 2014-11-03 15:15:35 +0000 | [diff] [blame] | 1543 | int l = 0, i = 0; |
| 1544 | const char *p, *end; |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1545 | |
| 1546 | if (!prop) |
| 1547 | return -EINVAL; |
| 1548 | if (!prop->value) |
| 1549 | return -ENODATA; |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1550 | p = prop->value; |
Grant Likely | a87fa1d | 2014-11-03 15:15:35 +0000 | [diff] [blame] | 1551 | end = p + prop->length; |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1552 | |
Grant Likely | a87fa1d | 2014-11-03 15:15:35 +0000 | [diff] [blame] | 1553 | for (i = 0; p < end && (!out_strs || i < skip + sz); i++, p += l) { |
| 1554 | l = strnlen(p, end - p) + 1; |
| 1555 | if (p + l > end) |
| 1556 | return -EILSEQ; |
| 1557 | if (out_strs && i >= skip) |
| 1558 | *out_strs++ = p; |
| 1559 | } |
| 1560 | i -= skip; |
| 1561 | return i <= 0 ? -ENODATA : i; |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1562 | } |
Grant Likely | a87fa1d | 2014-11-03 15:15:35 +0000 | [diff] [blame] | 1563 | EXPORT_SYMBOL_GPL(of_property_read_string_helper); |
Benoit Cousson | 4fcd15a | 2011-09-27 17:45:43 +0200 | [diff] [blame] | 1564 | |
Grant Likely | 624cfca | 2013-10-11 22:05:10 +0100 | [diff] [blame] | 1565 | void of_print_phandle_args(const char *msg, const struct of_phandle_args *args) |
| 1566 | { |
| 1567 | int i; |
| 1568 | printk("%s %s", msg, of_node_full_name(args->np)); |
| 1569 | for (i = 0; i < args->args_count; i++) |
| 1570 | printk(i ? ",%08x" : ":%08x", args->args[i]); |
| 1571 | printk("\n"); |
| 1572 | } |
| 1573 | |
Joerg Roedel | 74e1fbb | 2016-04-04 17:49:17 +0200 | [diff] [blame] | 1574 | int of_phandle_iterator_init(struct of_phandle_iterator *it, |
| 1575 | const struct device_node *np, |
| 1576 | const char *list_name, |
| 1577 | const char *cells_name, |
| 1578 | int cell_count) |
| 1579 | { |
| 1580 | const __be32 *list; |
| 1581 | int size; |
| 1582 | |
| 1583 | memset(it, 0, sizeof(*it)); |
| 1584 | |
| 1585 | list = of_get_property(np, list_name, &size); |
| 1586 | if (!list) |
| 1587 | return -ENOENT; |
| 1588 | |
| 1589 | it->cells_name = cells_name; |
| 1590 | it->cell_count = cell_count; |
| 1591 | it->parent = np; |
| 1592 | it->list_end = list + size / sizeof(*list); |
| 1593 | it->phandle_end = list; |
| 1594 | it->cur = list; |
| 1595 | |
| 1596 | return 0; |
| 1597 | } |
| 1598 | |
Joerg Roedel | cd209b4 | 2016-04-04 17:49:18 +0200 | [diff] [blame] | 1599 | int of_phandle_iterator_next(struct of_phandle_iterator *it) |
| 1600 | { |
| 1601 | uint32_t count = 0; |
| 1602 | |
| 1603 | if (it->node) { |
| 1604 | of_node_put(it->node); |
| 1605 | it->node = NULL; |
| 1606 | } |
| 1607 | |
| 1608 | if (!it->cur || it->phandle_end >= it->list_end) |
| 1609 | return -ENOENT; |
| 1610 | |
| 1611 | it->cur = it->phandle_end; |
| 1612 | |
| 1613 | /* If phandle is 0, then it is an empty entry with no arguments. */ |
| 1614 | it->phandle = be32_to_cpup(it->cur++); |
| 1615 | |
| 1616 | if (it->phandle) { |
| 1617 | |
| 1618 | /* |
| 1619 | * Find the provider node and parse the #*-cells property to |
| 1620 | * determine the argument length. |
| 1621 | */ |
| 1622 | it->node = of_find_node_by_phandle(it->phandle); |
| 1623 | |
| 1624 | if (it->cells_name) { |
| 1625 | if (!it->node) { |
| 1626 | pr_err("%s: could not find phandle\n", |
| 1627 | it->parent->full_name); |
| 1628 | goto err; |
| 1629 | } |
| 1630 | |
| 1631 | if (of_property_read_u32(it->node, it->cells_name, |
| 1632 | &count)) { |
| 1633 | pr_err("%s: could not get %s for %s\n", |
| 1634 | it->parent->full_name, |
| 1635 | it->cells_name, |
| 1636 | it->node->full_name); |
| 1637 | goto err; |
| 1638 | } |
| 1639 | } else { |
| 1640 | count = it->cell_count; |
| 1641 | } |
| 1642 | |
| 1643 | /* |
| 1644 | * Make sure that the arguments actually fit in the remaining |
| 1645 | * property data length |
| 1646 | */ |
| 1647 | if (it->cur + count > it->list_end) { |
| 1648 | pr_err("%s: arguments longer than property\n", |
| 1649 | it->parent->full_name); |
| 1650 | goto err; |
| 1651 | } |
| 1652 | } |
| 1653 | |
| 1654 | it->phandle_end = it->cur + count; |
| 1655 | it->cur_count = count; |
| 1656 | |
| 1657 | return 0; |
| 1658 | |
| 1659 | err: |
| 1660 | if (it->node) { |
| 1661 | of_node_put(it->node); |
| 1662 | it->node = NULL; |
| 1663 | } |
| 1664 | |
| 1665 | return -EINVAL; |
| 1666 | } |
| 1667 | |
Joerg Roedel | abdaa77 | 2016-04-04 17:49:21 +0200 | [diff] [blame] | 1668 | int of_phandle_iterator_args(struct of_phandle_iterator *it, |
| 1669 | uint32_t *args, |
| 1670 | int size) |
| 1671 | { |
| 1672 | int i, count; |
| 1673 | |
| 1674 | count = it->cur_count; |
| 1675 | |
| 1676 | if (WARN_ON(size < count)) |
| 1677 | count = size; |
| 1678 | |
| 1679 | for (i = 0; i < count; i++) |
| 1680 | args[i] = be32_to_cpup(it->cur++); |
| 1681 | |
| 1682 | return count; |
| 1683 | } |
| 1684 | |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1685 | static int __of_parse_phandle_with_args(const struct device_node *np, |
| 1686 | const char *list_name, |
Stephen Warren | 035fd94 | 2013-08-14 15:27:10 -0600 | [diff] [blame] | 1687 | const char *cells_name, |
| 1688 | int cell_count, int index, |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1689 | struct of_phandle_args *out_args) |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1690 | { |
Joerg Roedel | 74e1fbb | 2016-04-04 17:49:17 +0200 | [diff] [blame] | 1691 | struct of_phandle_iterator it; |
| 1692 | int rc, cur_index = 0; |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1693 | |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1694 | /* Loop over the phandles until all the requested entry is found */ |
Joerg Roedel | f623ce9 | 2016-04-04 17:49:20 +0200 | [diff] [blame] | 1695 | of_for_each_phandle(&it, rc, np, list_name, cells_name, cell_count) { |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1696 | /* |
Joerg Roedel | cd209b4 | 2016-04-04 17:49:18 +0200 | [diff] [blame] | 1697 | * All of the error cases bail out of the loop, so at |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1698 | * this point, the parsing is successful. If the requested |
| 1699 | * index matches, then fill the out_args structure and return, |
| 1700 | * or return -ENOENT for an empty entry. |
| 1701 | */ |
Grant Likely | 23ce04c | 2013-02-12 21:21:49 +0000 | [diff] [blame] | 1702 | rc = -ENOENT; |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1703 | if (cur_index == index) { |
Joerg Roedel | 74e1fbb | 2016-04-04 17:49:17 +0200 | [diff] [blame] | 1704 | if (!it.phandle) |
Grant Likely | 23ce04c | 2013-02-12 21:21:49 +0000 | [diff] [blame] | 1705 | goto err; |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1706 | |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1707 | if (out_args) { |
Joerg Roedel | abdaa77 | 2016-04-04 17:49:21 +0200 | [diff] [blame] | 1708 | int c; |
| 1709 | |
| 1710 | c = of_phandle_iterator_args(&it, |
| 1711 | out_args->args, |
| 1712 | MAX_PHANDLE_ARGS); |
Joerg Roedel | 74e1fbb | 2016-04-04 17:49:17 +0200 | [diff] [blame] | 1713 | out_args->np = it.node; |
Joerg Roedel | abdaa77 | 2016-04-04 17:49:21 +0200 | [diff] [blame] | 1714 | out_args->args_count = c; |
Tang Yuantian | b855f16 | 2013-04-10 11:36:39 +0800 | [diff] [blame] | 1715 | } else { |
Joerg Roedel | 74e1fbb | 2016-04-04 17:49:17 +0200 | [diff] [blame] | 1716 | of_node_put(it.node); |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1717 | } |
Grant Likely | 23ce04c | 2013-02-12 21:21:49 +0000 | [diff] [blame] | 1718 | |
| 1719 | /* Found it! return success */ |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1720 | return 0; |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1721 | } |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1722 | |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1723 | cur_index++; |
| 1724 | } |
| 1725 | |
Grant Likely | 23ce04c | 2013-02-12 21:21:49 +0000 | [diff] [blame] | 1726 | /* |
| 1727 | * Unlock node before returning result; will be one of: |
| 1728 | * -ENOENT : index is for empty phandle |
| 1729 | * -EINVAL : parsing error on data |
| 1730 | */ |
Joerg Roedel | cd209b4 | 2016-04-04 17:49:18 +0200 | [diff] [blame] | 1731 | |
Grant Likely | 23ce04c | 2013-02-12 21:21:49 +0000 | [diff] [blame] | 1732 | err: |
Markus Elfring | beab47d | 2016-07-19 22:42:22 +0200 | [diff] [blame] | 1733 | of_node_put(it.node); |
Grant Likely | 23ce04c | 2013-02-12 21:21:49 +0000 | [diff] [blame] | 1734 | return rc; |
Anton Vorontsov | 64b60e0 | 2008-10-10 04:43:17 +0000 | [diff] [blame] | 1735 | } |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1736 | |
Stephen Warren | eded9dd | 2013-08-14 15:27:08 -0600 | [diff] [blame] | 1737 | /** |
Stephen Warren | 5fba49e | 2013-08-14 15:27:09 -0600 | [diff] [blame] | 1738 | * of_parse_phandle - Resolve a phandle property to a device_node pointer |
| 1739 | * @np: Pointer to device node holding phandle property |
| 1740 | * @phandle_name: Name of property holding a phandle value |
| 1741 | * @index: For properties holding a table of phandles, this is the index into |
| 1742 | * the table |
| 1743 | * |
| 1744 | * Returns the device_node pointer with refcount incremented. Use |
| 1745 | * of_node_put() on it when done. |
| 1746 | */ |
| 1747 | struct device_node *of_parse_phandle(const struct device_node *np, |
| 1748 | const char *phandle_name, int index) |
| 1749 | { |
Stephen Warren | 91d9942 | 2013-08-14 15:27:11 -0600 | [diff] [blame] | 1750 | struct of_phandle_args args; |
Stephen Warren | 5fba49e | 2013-08-14 15:27:09 -0600 | [diff] [blame] | 1751 | |
Stephen Warren | 91d9942 | 2013-08-14 15:27:11 -0600 | [diff] [blame] | 1752 | if (index < 0) |
Stephen Warren | 5fba49e | 2013-08-14 15:27:09 -0600 | [diff] [blame] | 1753 | return NULL; |
| 1754 | |
Stephen Warren | 91d9942 | 2013-08-14 15:27:11 -0600 | [diff] [blame] | 1755 | if (__of_parse_phandle_with_args(np, phandle_name, NULL, 0, |
| 1756 | index, &args)) |
| 1757 | return NULL; |
| 1758 | |
| 1759 | return args.np; |
Stephen Warren | 5fba49e | 2013-08-14 15:27:09 -0600 | [diff] [blame] | 1760 | } |
| 1761 | EXPORT_SYMBOL(of_parse_phandle); |
| 1762 | |
| 1763 | /** |
Stephen Warren | eded9dd | 2013-08-14 15:27:08 -0600 | [diff] [blame] | 1764 | * of_parse_phandle_with_args() - Find a node pointed by phandle in a list |
| 1765 | * @np: pointer to a device tree node containing a list |
| 1766 | * @list_name: property name that contains a list |
| 1767 | * @cells_name: property name that specifies phandles' arguments count |
| 1768 | * @index: index of a phandle to parse out |
| 1769 | * @out_args: optional pointer to output arguments structure (will be filled) |
| 1770 | * |
| 1771 | * This function is useful to parse lists of phandles and their arguments. |
| 1772 | * Returns 0 on success and fills out_args, on error returns appropriate |
| 1773 | * errno value. |
| 1774 | * |
Geert Uytterhoeven | d94a75c | 2014-10-22 11:44:52 +0200 | [diff] [blame] | 1775 | * Caller is responsible to call of_node_put() on the returned out_args->np |
Stephen Warren | eded9dd | 2013-08-14 15:27:08 -0600 | [diff] [blame] | 1776 | * pointer. |
| 1777 | * |
| 1778 | * Example: |
| 1779 | * |
| 1780 | * phandle1: node1 { |
Geert Uytterhoeven | c0e848d | 2014-10-22 11:44:55 +0200 | [diff] [blame] | 1781 | * #list-cells = <2>; |
Stephen Warren | eded9dd | 2013-08-14 15:27:08 -0600 | [diff] [blame] | 1782 | * } |
| 1783 | * |
| 1784 | * phandle2: node2 { |
Geert Uytterhoeven | c0e848d | 2014-10-22 11:44:55 +0200 | [diff] [blame] | 1785 | * #list-cells = <1>; |
Stephen Warren | eded9dd | 2013-08-14 15:27:08 -0600 | [diff] [blame] | 1786 | * } |
| 1787 | * |
| 1788 | * node3 { |
Geert Uytterhoeven | c0e848d | 2014-10-22 11:44:55 +0200 | [diff] [blame] | 1789 | * list = <&phandle1 1 2 &phandle2 3>; |
Stephen Warren | eded9dd | 2013-08-14 15:27:08 -0600 | [diff] [blame] | 1790 | * } |
| 1791 | * |
| 1792 | * To get a device_node of the `node2' node you may call this: |
| 1793 | * of_parse_phandle_with_args(node3, "list", "#list-cells", 1, &args); |
| 1794 | */ |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1795 | int of_parse_phandle_with_args(const struct device_node *np, const char *list_name, |
| 1796 | const char *cells_name, int index, |
| 1797 | struct of_phandle_args *out_args) |
| 1798 | { |
| 1799 | if (index < 0) |
| 1800 | return -EINVAL; |
Stephen Warren | 035fd94 | 2013-08-14 15:27:10 -0600 | [diff] [blame] | 1801 | return __of_parse_phandle_with_args(np, list_name, cells_name, 0, |
| 1802 | index, out_args); |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1803 | } |
Grant Likely | 15c9a0a | 2011-12-12 09:25:57 -0700 | [diff] [blame] | 1804 | EXPORT_SYMBOL(of_parse_phandle_with_args); |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1805 | |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1806 | /** |
Stephen Warren | 035fd94 | 2013-08-14 15:27:10 -0600 | [diff] [blame] | 1807 | * of_parse_phandle_with_fixed_args() - Find a node pointed by phandle in a list |
| 1808 | * @np: pointer to a device tree node containing a list |
| 1809 | * @list_name: property name that contains a list |
| 1810 | * @cell_count: number of argument cells following the phandle |
| 1811 | * @index: index of a phandle to parse out |
| 1812 | * @out_args: optional pointer to output arguments structure (will be filled) |
| 1813 | * |
| 1814 | * This function is useful to parse lists of phandles and their arguments. |
| 1815 | * Returns 0 on success and fills out_args, on error returns appropriate |
| 1816 | * errno value. |
| 1817 | * |
Geert Uytterhoeven | d94a75c | 2014-10-22 11:44:52 +0200 | [diff] [blame] | 1818 | * Caller is responsible to call of_node_put() on the returned out_args->np |
Stephen Warren | 035fd94 | 2013-08-14 15:27:10 -0600 | [diff] [blame] | 1819 | * pointer. |
| 1820 | * |
| 1821 | * Example: |
| 1822 | * |
| 1823 | * phandle1: node1 { |
| 1824 | * } |
| 1825 | * |
| 1826 | * phandle2: node2 { |
| 1827 | * } |
| 1828 | * |
| 1829 | * node3 { |
Geert Uytterhoeven | c0e848d | 2014-10-22 11:44:55 +0200 | [diff] [blame] | 1830 | * list = <&phandle1 0 2 &phandle2 2 3>; |
Stephen Warren | 035fd94 | 2013-08-14 15:27:10 -0600 | [diff] [blame] | 1831 | * } |
| 1832 | * |
| 1833 | * To get a device_node of the `node2' node you may call this: |
| 1834 | * of_parse_phandle_with_fixed_args(node3, "list", 2, 1, &args); |
| 1835 | */ |
| 1836 | int of_parse_phandle_with_fixed_args(const struct device_node *np, |
| 1837 | const char *list_name, int cell_count, |
| 1838 | int index, struct of_phandle_args *out_args) |
| 1839 | { |
| 1840 | if (index < 0) |
| 1841 | return -EINVAL; |
| 1842 | return __of_parse_phandle_with_args(np, list_name, NULL, cell_count, |
| 1843 | index, out_args); |
| 1844 | } |
| 1845 | EXPORT_SYMBOL(of_parse_phandle_with_fixed_args); |
| 1846 | |
| 1847 | /** |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1848 | * of_count_phandle_with_args() - Find the number of phandles references in a property |
| 1849 | * @np: pointer to a device tree node containing a list |
| 1850 | * @list_name: property name that contains a list |
| 1851 | * @cells_name: property name that specifies phandles' arguments count |
| 1852 | * |
| 1853 | * Returns the number of phandle + argument tuples within a property. It |
| 1854 | * is a typical pattern to encode a list of phandle and variable |
| 1855 | * arguments into a single property. The number of arguments is encoded |
| 1856 | * by a property in the phandle-target node. For example, a gpios |
| 1857 | * property would contain a list of GPIO specifies consisting of a |
| 1858 | * phandle and 1 or more arguments. The number of arguments are |
| 1859 | * determined by the #gpio-cells property in the node pointed to by the |
| 1860 | * phandle. |
| 1861 | */ |
| 1862 | int of_count_phandle_with_args(const struct device_node *np, const char *list_name, |
| 1863 | const char *cells_name) |
| 1864 | { |
Joerg Roedel | 2021bd0 | 2016-04-04 17:49:19 +0200 | [diff] [blame] | 1865 | struct of_phandle_iterator it; |
| 1866 | int rc, cur_index = 0; |
| 1867 | |
| 1868 | rc = of_phandle_iterator_init(&it, np, list_name, cells_name, 0); |
| 1869 | if (rc) |
| 1870 | return rc; |
| 1871 | |
| 1872 | while ((rc = of_phandle_iterator_next(&it)) == 0) |
| 1873 | cur_index += 1; |
| 1874 | |
| 1875 | if (rc != -ENOENT) |
| 1876 | return rc; |
| 1877 | |
| 1878 | return cur_index; |
Grant Likely | bd69f73 | 2013-02-10 22:57:21 +0000 | [diff] [blame] | 1879 | } |
| 1880 | EXPORT_SYMBOL(of_count_phandle_with_args); |
| 1881 | |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1882 | /** |
Xiubo Li | 62664f6 | 2014-01-22 13:57:39 +0800 | [diff] [blame] | 1883 | * __of_add_property - Add a property to a node without lock operations |
| 1884 | */ |
Pantelis Antoniou | d8c5008 | 2014-07-04 19:58:46 +0300 | [diff] [blame] | 1885 | int __of_add_property(struct device_node *np, struct property *prop) |
Xiubo Li | 62664f6 | 2014-01-22 13:57:39 +0800 | [diff] [blame] | 1886 | { |
| 1887 | struct property **next; |
| 1888 | |
| 1889 | prop->next = NULL; |
| 1890 | next = &np->properties; |
| 1891 | while (*next) { |
| 1892 | if (strcmp(prop->name, (*next)->name) == 0) |
| 1893 | /* duplicate ! don't insert it */ |
| 1894 | return -EEXIST; |
| 1895 | |
| 1896 | next = &(*next)->next; |
| 1897 | } |
| 1898 | *next = prop; |
| 1899 | |
| 1900 | return 0; |
| 1901 | } |
| 1902 | |
| 1903 | /** |
Nathan Fontenot | 79d1c71 | 2012-10-02 16:58:46 +0000 | [diff] [blame] | 1904 | * of_add_property - Add a property to a node |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1905 | */ |
Nathan Fontenot | 79d1c71 | 2012-10-02 16:58:46 +0000 | [diff] [blame] | 1906 | int of_add_property(struct device_node *np, struct property *prop) |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1907 | { |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1908 | unsigned long flags; |
Nathan Fontenot | 1cf3d8b | 2012-10-02 16:57:57 +0000 | [diff] [blame] | 1909 | int rc; |
| 1910 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 1911 | mutex_lock(&of_mutex); |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1912 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1913 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Xiubo Li | 62664f6 | 2014-01-22 13:57:39 +0800 | [diff] [blame] | 1914 | rc = __of_add_property(np, prop); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1915 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1916 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 1917 | if (!rc) |
Pantelis Antoniou | 0829f6d | 2013-12-13 20:08:59 +0200 | [diff] [blame] | 1918 | __of_add_property_sysfs(np, prop); |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1919 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 1920 | mutex_unlock(&of_mutex); |
| 1921 | |
Grant Likely | 259092a | 2014-07-16 12:48:23 -0600 | [diff] [blame] | 1922 | if (!rc) |
| 1923 | of_property_notify(OF_RECONFIG_ADD_PROPERTY, np, prop, NULL); |
| 1924 | |
Xiubo Li | 62664f6 | 2014-01-22 13:57:39 +0800 | [diff] [blame] | 1925 | return rc; |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1926 | } |
| 1927 | |
Pantelis Antoniou | d8c5008 | 2014-07-04 19:58:46 +0300 | [diff] [blame] | 1928 | int __of_remove_property(struct device_node *np, struct property *prop) |
| 1929 | { |
| 1930 | struct property **next; |
| 1931 | |
| 1932 | for (next = &np->properties; *next; next = &(*next)->next) { |
| 1933 | if (*next == prop) |
| 1934 | break; |
| 1935 | } |
| 1936 | if (*next == NULL) |
| 1937 | return -ENODEV; |
| 1938 | |
| 1939 | /* found the node */ |
| 1940 | *next = prop->next; |
| 1941 | prop->next = np->deadprops; |
| 1942 | np->deadprops = prop; |
| 1943 | |
| 1944 | return 0; |
| 1945 | } |
| 1946 | |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1947 | /** |
Nathan Fontenot | 79d1c71 | 2012-10-02 16:58:46 +0000 | [diff] [blame] | 1948 | * of_remove_property - Remove a property from a node. |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1949 | * |
| 1950 | * Note that we don't actually remove it, since we have given out |
| 1951 | * who-knows-how-many pointers to the data using get-property. |
| 1952 | * Instead we just move the property to the "dead properties" |
| 1953 | * list, so it won't be found any more. |
| 1954 | */ |
Nathan Fontenot | 79d1c71 | 2012-10-02 16:58:46 +0000 | [diff] [blame] | 1955 | int of_remove_property(struct device_node *np, struct property *prop) |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1956 | { |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1957 | unsigned long flags; |
Nathan Fontenot | 1cf3d8b | 2012-10-02 16:57:57 +0000 | [diff] [blame] | 1958 | int rc; |
| 1959 | |
Suraj Jitindar Singh | 201b3fe | 2016-04-28 15:34:54 +1000 | [diff] [blame] | 1960 | if (!prop) |
| 1961 | return -ENODEV; |
| 1962 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 1963 | mutex_lock(&of_mutex); |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1964 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1965 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Pantelis Antoniou | d8c5008 | 2014-07-04 19:58:46 +0300 | [diff] [blame] | 1966 | rc = __of_remove_property(np, prop); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 1967 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1968 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 1969 | if (!rc) |
| 1970 | __of_remove_property_sysfs(np, prop); |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1971 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 1972 | mutex_unlock(&of_mutex); |
Grant Likely | 75b57ec | 2014-02-20 18:02:11 +0000 | [diff] [blame] | 1973 | |
Grant Likely | 259092a | 2014-07-16 12:48:23 -0600 | [diff] [blame] | 1974 | if (!rc) |
| 1975 | of_property_notify(OF_RECONFIG_REMOVE_PROPERTY, np, prop, NULL); |
| 1976 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 1977 | return rc; |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 1978 | } |
| 1979 | |
Pantelis Antoniou | d8c5008 | 2014-07-04 19:58:46 +0300 | [diff] [blame] | 1980 | int __of_update_property(struct device_node *np, struct property *newprop, |
| 1981 | struct property **oldpropp) |
| 1982 | { |
| 1983 | struct property **next, *oldprop; |
| 1984 | |
| 1985 | for (next = &np->properties; *next; next = &(*next)->next) { |
| 1986 | if (of_prop_cmp((*next)->name, newprop->name) == 0) |
| 1987 | break; |
| 1988 | } |
| 1989 | *oldpropp = oldprop = *next; |
| 1990 | |
| 1991 | if (oldprop) { |
| 1992 | /* replace the node */ |
| 1993 | newprop->next = oldprop->next; |
| 1994 | *next = newprop; |
| 1995 | oldprop->next = np->deadprops; |
| 1996 | np->deadprops = oldprop; |
| 1997 | } else { |
| 1998 | /* new node */ |
| 1999 | newprop->next = NULL; |
| 2000 | *next = newprop; |
| 2001 | } |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 2002 | |
| 2003 | return 0; |
| 2004 | } |
| 2005 | |
| 2006 | /* |
Nathan Fontenot | 79d1c71 | 2012-10-02 16:58:46 +0000 | [diff] [blame] | 2007 | * of_update_property - Update a property in a node, if the property does |
Dong Aisheng | 475d009 | 2012-07-11 15:16:37 +1000 | [diff] [blame] | 2008 | * not exist, add it. |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 2009 | * |
| 2010 | * Note that we don't actually remove it, since we have given out |
| 2011 | * who-knows-how-many pointers to the data using get-property. |
| 2012 | * Instead we just move the property to the "dead properties" list, |
| 2013 | * and add the new property to the property list |
| 2014 | */ |
Nathan Fontenot | 79d1c71 | 2012-10-02 16:58:46 +0000 | [diff] [blame] | 2015 | int of_update_property(struct device_node *np, struct property *newprop) |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 2016 | { |
Pantelis Antoniou | d8c5008 | 2014-07-04 19:58:46 +0300 | [diff] [blame] | 2017 | struct property *oldprop; |
Grant Likely | 02af11b | 2009-11-23 20:16:45 -0700 | [diff] [blame] | 2018 | unsigned long flags; |
Xiubo Li | 947fdaad0 | 2014-04-17 15:48:29 +0800 | [diff] [blame] | 2019 | int rc; |
Nathan Fontenot | 1cf3d8b | 2012-10-02 16:57:57 +0000 | [diff] [blame] | 2020 | |
Dong Aisheng | 475d009 | 2012-07-11 15:16:37 +1000 | [diff] [blame] | 2021 | if (!newprop->name) |
| 2022 | return -EINVAL; |
| 2023 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 2024 | mutex_lock(&of_mutex); |
Grant Likely | fcdeb7f | 2010-01-29 05:04:33 -0700 | [diff] [blame] | 2025 | |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 2026 | raw_spin_lock_irqsave(&devtree_lock, flags); |
Pantelis Antoniou | d8c5008 | 2014-07-04 19:58:46 +0300 | [diff] [blame] | 2027 | rc = __of_update_property(np, newprop, &oldprop); |
Thomas Gleixner | d6d3c4e | 2013-02-06 15:30:56 -0500 | [diff] [blame] | 2028 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
Nathan Fontenot | e81b329 | 2012-10-02 16:55:01 +0000 | [diff] [blame] | 2029 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 2030 | if (!rc) |
| 2031 | __of_update_property_sysfs(np, newprop, oldprop); |
Grant Likely | fcdeb7f | 2010-01-29 05:04:33 -0700 | [diff] [blame] | 2032 | |
Grant Likely | 8a2b22a | 2014-07-23 17:05:06 -0600 | [diff] [blame] | 2033 | mutex_unlock(&of_mutex); |
Nathan Fontenot | 1cf3d8b | 2012-10-02 16:57:57 +0000 | [diff] [blame] | 2034 | |
Grant Likely | 259092a | 2014-07-16 12:48:23 -0600 | [diff] [blame] | 2035 | if (!rc) |
| 2036 | of_property_notify(OF_RECONFIG_UPDATE_PROPERTY, np, newprop, oldprop); |
Grant Likely | fcdeb7f | 2010-01-29 05:04:33 -0700 | [diff] [blame] | 2037 | |
Nathan Fontenot | 1cf3d8b | 2012-10-02 16:57:57 +0000 | [diff] [blame] | 2038 | return rc; |
Grant Likely | fcdeb7f | 2010-01-29 05:04:33 -0700 | [diff] [blame] | 2039 | } |
Grant Likely | fcdeb7f | 2010-01-29 05:04:33 -0700 | [diff] [blame] | 2040 | |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2041 | static void of_alias_add(struct alias_prop *ap, struct device_node *np, |
| 2042 | int id, const char *stem, int stem_len) |
| 2043 | { |
| 2044 | ap->np = np; |
| 2045 | ap->id = id; |
| 2046 | strncpy(ap->stem, stem, stem_len); |
| 2047 | ap->stem[stem_len] = 0; |
| 2048 | list_add_tail(&ap->link, &aliases_lookup); |
| 2049 | pr_debug("adding DT alias:%s: stem=%s id=%i node=%s\n", |
Grant Likely | 74a7f08 | 2012-06-15 11:50:25 -0600 | [diff] [blame] | 2050 | ap->alias, ap->stem, ap->id, of_node_full_name(np)); |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2051 | } |
| 2052 | |
| 2053 | /** |
Geert Uytterhoeven | 1821dda | 2014-10-22 11:44:53 +0200 | [diff] [blame] | 2054 | * of_alias_scan - Scan all properties of the 'aliases' node |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2055 | * |
Geert Uytterhoeven | 1821dda | 2014-10-22 11:44:53 +0200 | [diff] [blame] | 2056 | * The function scans all the properties of the 'aliases' node and populates |
| 2057 | * the global lookup table with the properties. It returns the |
| 2058 | * number of alias properties found, or an error code in case of failure. |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2059 | * |
| 2060 | * @dt_alloc: An allocator that provides a virtual address to memory |
Geert Uytterhoeven | 1821dda | 2014-10-22 11:44:53 +0200 | [diff] [blame] | 2061 | * for storing the resulting tree |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2062 | */ |
| 2063 | void of_alias_scan(void * (*dt_alloc)(u64 size, u64 align)) |
| 2064 | { |
| 2065 | struct property *pp; |
| 2066 | |
Laurentiu Tudor | 7dbe584 | 2014-08-27 17:09:39 +0300 | [diff] [blame] | 2067 | of_aliases = of_find_node_by_path("/aliases"); |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2068 | of_chosen = of_find_node_by_path("/chosen"); |
| 2069 | if (of_chosen == NULL) |
| 2070 | of_chosen = of_find_node_by_path("/chosen@0"); |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2071 | |
| 2072 | if (of_chosen) { |
Grant Likely | a752ee5 | 2014-03-28 08:12:18 -0700 | [diff] [blame] | 2073 | /* linux,stdout-path and /aliases/stdout are for legacy compatibility */ |
Grant Likely | 676e1b2 | 2014-03-27 17:11:23 -0700 | [diff] [blame] | 2074 | const char *name = of_get_property(of_chosen, "stdout-path", NULL); |
| 2075 | if (!name) |
| 2076 | name = of_get_property(of_chosen, "linux,stdout-path", NULL); |
Grant Likely | a752ee5 | 2014-03-28 08:12:18 -0700 | [diff] [blame] | 2077 | if (IS_ENABLED(CONFIG_PPC) && !name) |
| 2078 | name = of_get_property(of_aliases, "stdout", NULL); |
Peter Hurley | f64255b | 2015-03-17 16:46:33 -0400 | [diff] [blame] | 2079 | if (name) |
Leif Lindholm | 7914a7c | 2014-11-27 17:56:07 +0000 | [diff] [blame] | 2080 | of_stdout = of_find_node_opts_by_path(name, &of_stdout_options); |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2081 | } |
| 2082 | |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2083 | if (!of_aliases) |
| 2084 | return; |
| 2085 | |
Dong Aisheng | 8af0da9 | 2011-12-22 20:19:24 +0800 | [diff] [blame] | 2086 | for_each_property_of_node(of_aliases, pp) { |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2087 | const char *start = pp->name; |
| 2088 | const char *end = start + strlen(start); |
| 2089 | struct device_node *np; |
| 2090 | struct alias_prop *ap; |
| 2091 | int id, len; |
| 2092 | |
| 2093 | /* Skip those we do not want to proceed */ |
| 2094 | if (!strcmp(pp->name, "name") || |
| 2095 | !strcmp(pp->name, "phandle") || |
| 2096 | !strcmp(pp->name, "linux,phandle")) |
| 2097 | continue; |
| 2098 | |
| 2099 | np = of_find_node_by_path(pp->value); |
| 2100 | if (!np) |
| 2101 | continue; |
| 2102 | |
| 2103 | /* walk the alias backwards to extract the id and work out |
| 2104 | * the 'stem' string */ |
| 2105 | while (isdigit(*(end-1)) && end > start) |
| 2106 | end--; |
| 2107 | len = end - start; |
| 2108 | |
| 2109 | if (kstrtoint(end, 10, &id) < 0) |
| 2110 | continue; |
| 2111 | |
| 2112 | /* Allocate an alias_prop with enough space for the stem */ |
Paul Burton | faf6fd7 | 2016-09-23 16:38:27 +0100 | [diff] [blame] | 2113 | ap = dt_alloc(sizeof(*ap) + len + 1, __alignof__(*ap)); |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2114 | if (!ap) |
| 2115 | continue; |
Grant Likely | 0640332e | 2013-08-28 21:24:17 +0100 | [diff] [blame] | 2116 | memset(ap, 0, sizeof(*ap) + len + 1); |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2117 | ap->alias = start; |
| 2118 | of_alias_add(ap, np, id, start, len); |
| 2119 | } |
| 2120 | } |
| 2121 | |
| 2122 | /** |
| 2123 | * of_alias_get_id - Get alias id for the given device_node |
| 2124 | * @np: Pointer to the given device_node |
| 2125 | * @stem: Alias stem of the given device_node |
| 2126 | * |
Geert Uytterhoeven | 5a53a07 | 2014-03-11 11:23:38 +0100 | [diff] [blame] | 2127 | * The function travels the lookup table to get the alias id for the given |
| 2128 | * device_node and alias stem. It returns the alias id if found. |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2129 | */ |
| 2130 | int of_alias_get_id(struct device_node *np, const char *stem) |
| 2131 | { |
| 2132 | struct alias_prop *app; |
| 2133 | int id = -ENODEV; |
| 2134 | |
Pantelis Antoniou | c05aba2 | 2014-07-04 19:58:03 +0300 | [diff] [blame] | 2135 | mutex_lock(&of_mutex); |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2136 | list_for_each_entry(app, &aliases_lookup, link) { |
| 2137 | if (strcmp(app->stem, stem) != 0) |
| 2138 | continue; |
| 2139 | |
| 2140 | if (np == app->np) { |
| 2141 | id = app->id; |
| 2142 | break; |
| 2143 | } |
| 2144 | } |
Pantelis Antoniou | c05aba2 | 2014-07-04 19:58:03 +0300 | [diff] [blame] | 2145 | mutex_unlock(&of_mutex); |
Shawn Guo | 611cad7 | 2011-08-15 15:28:14 +0800 | [diff] [blame] | 2146 | |
| 2147 | return id; |
| 2148 | } |
| 2149 | EXPORT_SYMBOL_GPL(of_alias_get_id); |
Stephen Warren | c541adc | 2012-04-04 09:27:46 -0600 | [diff] [blame] | 2150 | |
Wolfram Sang | 351d224 | 2015-03-12 17:17:58 +0100 | [diff] [blame] | 2151 | /** |
| 2152 | * of_alias_get_highest_id - Get highest alias id for the given stem |
| 2153 | * @stem: Alias stem to be examined |
| 2154 | * |
| 2155 | * The function travels the lookup table to get the highest alias id for the |
| 2156 | * given alias stem. It returns the alias id if found. |
| 2157 | */ |
| 2158 | int of_alias_get_highest_id(const char *stem) |
| 2159 | { |
| 2160 | struct alias_prop *app; |
| 2161 | int id = -ENODEV; |
| 2162 | |
| 2163 | mutex_lock(&of_mutex); |
| 2164 | list_for_each_entry(app, &aliases_lookup, link) { |
| 2165 | if (strcmp(app->stem, stem) != 0) |
| 2166 | continue; |
| 2167 | |
| 2168 | if (app->id > id) |
| 2169 | id = app->id; |
| 2170 | } |
| 2171 | mutex_unlock(&of_mutex); |
| 2172 | |
| 2173 | return id; |
| 2174 | } |
| 2175 | EXPORT_SYMBOL_GPL(of_alias_get_highest_id); |
| 2176 | |
Stephen Warren | c541adc | 2012-04-04 09:27:46 -0600 | [diff] [blame] | 2177 | const __be32 *of_prop_next_u32(struct property *prop, const __be32 *cur, |
| 2178 | u32 *pu) |
| 2179 | { |
| 2180 | const void *curv = cur; |
| 2181 | |
| 2182 | if (!prop) |
| 2183 | return NULL; |
| 2184 | |
| 2185 | if (!cur) { |
| 2186 | curv = prop->value; |
| 2187 | goto out_val; |
| 2188 | } |
| 2189 | |
| 2190 | curv += sizeof(*cur); |
| 2191 | if (curv >= prop->value + prop->length) |
| 2192 | return NULL; |
| 2193 | |
| 2194 | out_val: |
| 2195 | *pu = be32_to_cpup(curv); |
| 2196 | return curv; |
| 2197 | } |
| 2198 | EXPORT_SYMBOL_GPL(of_prop_next_u32); |
| 2199 | |
| 2200 | const char *of_prop_next_string(struct property *prop, const char *cur) |
| 2201 | { |
| 2202 | const void *curv = cur; |
| 2203 | |
| 2204 | if (!prop) |
| 2205 | return NULL; |
| 2206 | |
| 2207 | if (!cur) |
| 2208 | return prop->value; |
| 2209 | |
| 2210 | curv += strlen(cur) + 1; |
| 2211 | if (curv >= prop->value + prop->length) |
| 2212 | return NULL; |
| 2213 | |
| 2214 | return curv; |
| 2215 | } |
| 2216 | EXPORT_SYMBOL_GPL(of_prop_next_string); |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2217 | |
| 2218 | /** |
Grant Likely | 3482f2c | 2014-03-27 17:18:55 -0700 | [diff] [blame] | 2219 | * of_console_check() - Test and setup console for DT setup |
| 2220 | * @dn - Pointer to device node |
| 2221 | * @name - Name to use for preferred console without index. ex. "ttyS" |
| 2222 | * @index - Index to use for preferred console. |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2223 | * |
Grant Likely | 3482f2c | 2014-03-27 17:18:55 -0700 | [diff] [blame] | 2224 | * Check if the given device node matches the stdout-path property in the |
| 2225 | * /chosen node. If it does then register it as the preferred console and return |
| 2226 | * TRUE. Otherwise return FALSE. |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2227 | */ |
Grant Likely | 3482f2c | 2014-03-27 17:18:55 -0700 | [diff] [blame] | 2228 | bool of_console_check(struct device_node *dn, char *name, int index) |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2229 | { |
Grant Likely | 3482f2c | 2014-03-27 17:18:55 -0700 | [diff] [blame] | 2230 | if (!dn || dn != of_stdout || console_set_on_cmdline) |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2231 | return false; |
Leif Lindholm | 7914a7c | 2014-11-27 17:56:07 +0000 | [diff] [blame] | 2232 | return !add_preferred_console(name, index, |
| 2233 | kstrdup(of_stdout_options, GFP_KERNEL)); |
Sascha Hauer | 5c19e95 | 2013-08-05 14:40:44 +0200 | [diff] [blame] | 2234 | } |
Grant Likely | 3482f2c | 2014-03-27 17:18:55 -0700 | [diff] [blame] | 2235 | EXPORT_SYMBOL_GPL(of_console_check); |
Sudeep KarkadaNagesha | a3e31b4 | 2013-09-18 11:53:05 +0100 | [diff] [blame] | 2236 | |
| 2237 | /** |
| 2238 | * of_find_next_cache_node - Find a node's subsidiary cache |
| 2239 | * @np: node of type "cpu" or "cache" |
| 2240 | * |
| 2241 | * Returns a node pointer with refcount incremented, use |
| 2242 | * of_node_put() on it when done. Caller should hold a reference |
| 2243 | * to np. |
| 2244 | */ |
| 2245 | struct device_node *of_find_next_cache_node(const struct device_node *np) |
| 2246 | { |
| 2247 | struct device_node *child; |
| 2248 | const phandle *handle; |
| 2249 | |
| 2250 | handle = of_get_property(np, "l2-cache", NULL); |
| 2251 | if (!handle) |
| 2252 | handle = of_get_property(np, "next-level-cache", NULL); |
| 2253 | |
| 2254 | if (handle) |
| 2255 | return of_find_node_by_phandle(be32_to_cpup(handle)); |
| 2256 | |
| 2257 | /* OF on pmac has nodes instead of properties named "l2-cache" |
| 2258 | * beneath CPU nodes. |
| 2259 | */ |
Rob Herring | 30efd0c | 2018-08-27 09:50:09 -0500 | [diff] [blame] | 2260 | if (IS_ENABLED(CONFIG_PPC_PMAC) && !strcmp(np->type, "cpu")) |
Sudeep KarkadaNagesha | a3e31b4 | 2013-09-18 11:53:05 +0100 | [diff] [blame] | 2261 | for_each_child_of_node(np, child) |
| 2262 | if (!strcmp(child->type, "cache")) |
| 2263 | return child; |
| 2264 | |
| 2265 | return NULL; |
| 2266 | } |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2267 | |
| 2268 | /** |
Philipp Zabel | f2a575f | 2014-02-14 11:53:56 +0100 | [diff] [blame] | 2269 | * of_graph_parse_endpoint() - parse common endpoint node properties |
| 2270 | * @node: pointer to endpoint device_node |
| 2271 | * @endpoint: pointer to the OF endpoint data structure |
| 2272 | * |
| 2273 | * The caller should hold a reference to @node. |
| 2274 | */ |
| 2275 | int of_graph_parse_endpoint(const struct device_node *node, |
| 2276 | struct of_endpoint *endpoint) |
| 2277 | { |
| 2278 | struct device_node *port_node = of_get_parent(node); |
| 2279 | |
Philipp Zabel | d484700 | 2014-03-04 12:31:24 +0100 | [diff] [blame] | 2280 | WARN_ONCE(!port_node, "%s(): endpoint %s has no parent node\n", |
| 2281 | __func__, node->full_name); |
| 2282 | |
Philipp Zabel | f2a575f | 2014-02-14 11:53:56 +0100 | [diff] [blame] | 2283 | memset(endpoint, 0, sizeof(*endpoint)); |
| 2284 | |
| 2285 | endpoint->local_node = node; |
| 2286 | /* |
| 2287 | * It doesn't matter whether the two calls below succeed. |
| 2288 | * If they don't then the default value 0 is used. |
| 2289 | */ |
| 2290 | of_property_read_u32(port_node, "reg", &endpoint->port); |
| 2291 | of_property_read_u32(node, "reg", &endpoint->id); |
| 2292 | |
| 2293 | of_node_put(port_node); |
| 2294 | |
| 2295 | return 0; |
| 2296 | } |
| 2297 | EXPORT_SYMBOL(of_graph_parse_endpoint); |
| 2298 | |
| 2299 | /** |
Philipp Zabel | bfe446e | 2014-03-11 11:21:11 +0100 | [diff] [blame] | 2300 | * of_graph_get_port_by_id() - get the port matching a given id |
| 2301 | * @parent: pointer to the parent device node |
| 2302 | * @id: id of the port |
| 2303 | * |
| 2304 | * Return: A 'port' node pointer with refcount incremented. The caller |
| 2305 | * has to use of_node_put() on it when done. |
| 2306 | */ |
| 2307 | struct device_node *of_graph_get_port_by_id(struct device_node *parent, u32 id) |
| 2308 | { |
| 2309 | struct device_node *node, *port; |
| 2310 | |
| 2311 | node = of_get_child_by_name(parent, "ports"); |
| 2312 | if (node) |
| 2313 | parent = node; |
| 2314 | |
| 2315 | for_each_child_of_node(parent, port) { |
| 2316 | u32 port_id = 0; |
| 2317 | |
| 2318 | if (of_node_cmp(port->name, "port") != 0) |
| 2319 | continue; |
| 2320 | of_property_read_u32(port, "reg", &port_id); |
| 2321 | if (id == port_id) |
| 2322 | break; |
| 2323 | } |
| 2324 | |
| 2325 | of_node_put(node); |
| 2326 | |
| 2327 | return port; |
| 2328 | } |
| 2329 | EXPORT_SYMBOL(of_graph_get_port_by_id); |
| 2330 | |
| 2331 | /** |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2332 | * of_graph_get_next_endpoint() - get next endpoint node |
| 2333 | * @parent: pointer to the parent device node |
| 2334 | * @prev: previous endpoint node, or NULL to get first |
| 2335 | * |
| 2336 | * Return: An 'endpoint' node pointer with refcount incremented. Refcount |
Philipp Zabel | f033c0b | 2014-12-01 13:32:32 +0100 | [diff] [blame] | 2337 | * of the passed @prev node is decremented. |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2338 | */ |
| 2339 | struct device_node *of_graph_get_next_endpoint(const struct device_node *parent, |
| 2340 | struct device_node *prev) |
| 2341 | { |
| 2342 | struct device_node *endpoint; |
Linus Torvalds | 3c83e61 | 2014-04-04 09:50:07 -0700 | [diff] [blame] | 2343 | struct device_node *port; |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2344 | |
| 2345 | if (!parent) |
| 2346 | return NULL; |
| 2347 | |
Linus Torvalds | 3c83e61 | 2014-04-04 09:50:07 -0700 | [diff] [blame] | 2348 | /* |
| 2349 | * Start by locating the port node. If no previous endpoint is specified |
| 2350 | * search for the first port node, otherwise get the previous endpoint |
| 2351 | * parent port node. |
| 2352 | */ |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2353 | if (!prev) { |
| 2354 | struct device_node *node; |
Linus Torvalds | 3c83e61 | 2014-04-04 09:50:07 -0700 | [diff] [blame] | 2355 | |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2356 | node = of_get_child_by_name(parent, "ports"); |
| 2357 | if (node) |
| 2358 | parent = node; |
| 2359 | |
| 2360 | port = of_get_child_by_name(parent, "port"); |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2361 | of_node_put(node); |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2362 | |
Linus Torvalds | 3c83e61 | 2014-04-04 09:50:07 -0700 | [diff] [blame] | 2363 | if (!port) { |
Rob Herring | 606ad42 | 2016-06-15 08:32:18 -0500 | [diff] [blame] | 2364 | pr_err("graph: no port node found in %s\n", |
| 2365 | parent->full_name); |
Philipp Zabel | 4329b93 | 2014-02-26 20:43:42 +0100 | [diff] [blame] | 2366 | return NULL; |
Linus Torvalds | 3c83e61 | 2014-04-04 09:50:07 -0700 | [diff] [blame] | 2367 | } |
| 2368 | } else { |
| 2369 | port = of_get_parent(prev); |
| 2370 | if (WARN_ONCE(!port, "%s(): endpoint %s has no parent node\n", |
| 2371 | __func__, prev->full_name)) |
| 2372 | return NULL; |
Linus Torvalds | 3c83e61 | 2014-04-04 09:50:07 -0700 | [diff] [blame] | 2373 | } |
Philipp Zabel | 4329b93 | 2014-02-26 20:43:42 +0100 | [diff] [blame] | 2374 | |
Linus Torvalds | 3c83e61 | 2014-04-04 09:50:07 -0700 | [diff] [blame] | 2375 | while (1) { |
| 2376 | /* |
| 2377 | * Now that we have a port node, get the next endpoint by |
| 2378 | * getting the next child. If the previous endpoint is NULL this |
| 2379 | * will return the first child. |
| 2380 | */ |
| 2381 | endpoint = of_get_next_child(port, prev); |
| 2382 | if (endpoint) { |
| 2383 | of_node_put(port); |
| 2384 | return endpoint; |
| 2385 | } |
| 2386 | |
| 2387 | /* No more endpoints under this port, try the next one. */ |
| 2388 | prev = NULL; |
| 2389 | |
| 2390 | do { |
| 2391 | port = of_get_next_child(parent, port); |
| 2392 | if (!port) |
| 2393 | return NULL; |
| 2394 | } while (of_node_cmp(port->name, "port")); |
| 2395 | } |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2396 | } |
| 2397 | EXPORT_SYMBOL(of_graph_get_next_endpoint); |
| 2398 | |
| 2399 | /** |
Hyungwon Hwang | 8ccd0d0 | 2015-06-12 21:59:01 +0900 | [diff] [blame] | 2400 | * of_graph_get_endpoint_by_regs() - get endpoint node of specific identifiers |
| 2401 | * @parent: pointer to the parent device node |
| 2402 | * @port_reg: identifier (value of reg property) of the parent port node |
| 2403 | * @reg: identifier (value of reg property) of the endpoint node |
| 2404 | * |
| 2405 | * Return: An 'endpoint' node pointer which is identified by reg and at the same |
| 2406 | * is the child of a port node identified by port_reg. reg and port_reg are |
| 2407 | * ignored when they are -1. |
| 2408 | */ |
| 2409 | struct device_node *of_graph_get_endpoint_by_regs( |
| 2410 | const struct device_node *parent, int port_reg, int reg) |
| 2411 | { |
| 2412 | struct of_endpoint endpoint; |
Lucas Stach | 34276bb | 2016-08-15 14:58:43 +0200 | [diff] [blame] | 2413 | struct device_node *node = NULL; |
Hyungwon Hwang | 8ccd0d0 | 2015-06-12 21:59:01 +0900 | [diff] [blame] | 2414 | |
Lucas Stach | 34276bb | 2016-08-15 14:58:43 +0200 | [diff] [blame] | 2415 | for_each_endpoint_of_node(parent, node) { |
Hyungwon Hwang | 8ccd0d0 | 2015-06-12 21:59:01 +0900 | [diff] [blame] | 2416 | of_graph_parse_endpoint(node, &endpoint); |
| 2417 | if (((port_reg == -1) || (endpoint.port == port_reg)) && |
| 2418 | ((reg == -1) || (endpoint.id == reg))) |
| 2419 | return node; |
Hyungwon Hwang | 8ccd0d0 | 2015-06-12 21:59:01 +0900 | [diff] [blame] | 2420 | } |
| 2421 | |
| 2422 | return NULL; |
| 2423 | } |
Dave Airlie | 8ffaa90 | 2015-06-23 10:19:10 +1000 | [diff] [blame] | 2424 | EXPORT_SYMBOL(of_graph_get_endpoint_by_regs); |
Hyungwon Hwang | 8ccd0d0 | 2015-06-12 21:59:01 +0900 | [diff] [blame] | 2425 | |
| 2426 | /** |
Philipp Zabel | fd9fdb7 | 2014-02-10 22:01:48 +0100 | [diff] [blame] | 2427 | * of_graph_get_remote_port_parent() - get remote port's parent node |
| 2428 | * @node: pointer to a local endpoint device_node |
| 2429 | * |
| 2430 | * Return: Remote device node associated with remote endpoint node linked |
| 2431 | * to @node. Use of_node_put() on it when done. |
| 2432 | */ |
| 2433 | struct device_node *of_graph_get_remote_port_parent( |
| 2434 | const struct device_node *node) |
| 2435 | { |
| 2436 | struct device_node *np; |
| 2437 | unsigned int depth; |
| 2438 | |
| 2439 | /* Get remote endpoint node. */ |
| 2440 | np = of_parse_phandle(node, "remote-endpoint", 0); |
| 2441 | |
| 2442 | /* Walk 3 levels up only if there is 'ports' node. */ |
| 2443 | for (depth = 3; depth && np; depth--) { |
| 2444 | np = of_get_next_parent(np); |
| 2445 | if (depth == 2 && of_node_cmp(np->name, "ports")) |
| 2446 | break; |
| 2447 | } |
| 2448 | return np; |
| 2449 | } |
| 2450 | EXPORT_SYMBOL(of_graph_get_remote_port_parent); |
| 2451 | |
| 2452 | /** |
| 2453 | * of_graph_get_remote_port() - get remote port node |
| 2454 | * @node: pointer to a local endpoint device_node |
| 2455 | * |
| 2456 | * Return: Remote port node associated with remote endpoint node linked |
| 2457 | * to @node. Use of_node_put() on it when done. |
| 2458 | */ |
| 2459 | struct device_node *of_graph_get_remote_port(const struct device_node *node) |
| 2460 | { |
| 2461 | struct device_node *np; |
| 2462 | |
| 2463 | /* Get remote endpoint node. */ |
| 2464 | np = of_parse_phandle(node, "remote-endpoint", 0); |
| 2465 | if (!np) |
| 2466 | return NULL; |
| 2467 | return of_get_next_parent(np); |
| 2468 | } |
| 2469 | EXPORT_SYMBOL(of_graph_get_remote_port); |