Commit | Line | Data |
---|---|---|
97e873e5 SR |
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 | * | |
e91edcf5 GL |
12 | * Reconsolidated from arch/x/kernel/prom.c by Stephen Rothwell and |
13 | * Grant Likely. | |
97e873e5 SR |
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 | */ | |
3482f2c5 | 20 | #include <linux/console.h> |
611cad72 | 21 | #include <linux/ctype.h> |
183912d3 | 22 | #include <linux/cpu.h> |
97e873e5 SR |
23 | #include <linux/module.h> |
24 | #include <linux/of.h> | |
fd9fdb78 | 25 | #include <linux/of_graph.h> |
581b605a | 26 | #include <linux/spinlock.h> |
5a0e3ad6 | 27 | #include <linux/slab.h> |
75b57ecf | 28 | #include <linux/string.h> |
a9f2f63a | 29 | #include <linux/proc_fs.h> |
581b605a | 30 | |
ced4eec9 | 31 | #include "of_private.h" |
611cad72 | 32 | |
ced4eec9 | 33 | LIST_HEAD(aliases_lookup); |
611cad72 | 34 | |
5063e25a GL |
35 | struct device_node *of_root; |
36 | EXPORT_SYMBOL(of_root); | |
fc0bdae4 | 37 | struct device_node *of_chosen; |
611cad72 | 38 | struct device_node *of_aliases; |
a752ee56 | 39 | struct device_node *of_stdout; |
7914a7c5 | 40 | static const char *of_stdout_options; |
611cad72 | 41 | |
8a2b22a2 | 42 | struct kset *of_kset; |
75b57ecf GL |
43 | |
44 | /* | |
8a2b22a2 GL |
45 | * Used to protect the of_aliases, to hold off addition of nodes to sysfs. |
46 | * This mutex must be held whenever modifications are being made to the | |
47 | * device tree. The of_{attach,detach}_node() and | |
48 | * of_{add,remove,update}_property() helpers make sure this happens. | |
75b57ecf | 49 | */ |
c05aba2b | 50 | DEFINE_MUTEX(of_mutex); |
1ef4d424 | 51 | |
5063e25a | 52 | /* use when traversing tree through the child, sibling, |
581b605a SR |
53 | * or parent members of struct device_node. |
54 | */ | |
d6d3c4e6 | 55 | DEFINE_RAW_SPINLOCK(devtree_lock); |
97e873e5 SR |
56 | |
57 | int of_n_addr_cells(struct device_node *np) | |
58 | { | |
a9fadeef | 59 | const __be32 *ip; |
97e873e5 SR |
60 | |
61 | do { | |
62 | if (np->parent) | |
63 | np = np->parent; | |
64 | ip = of_get_property(np, "#address-cells", NULL); | |
65 | if (ip) | |
33714881 | 66 | return be32_to_cpup(ip); |
97e873e5 SR |
67 | } while (np->parent); |
68 | /* No #address-cells property for the root node */ | |
69 | return OF_ROOT_NODE_ADDR_CELLS_DEFAULT; | |
70 | } | |
71 | EXPORT_SYMBOL(of_n_addr_cells); | |
72 | ||
73 | int of_n_size_cells(struct device_node *np) | |
74 | { | |
a9fadeef | 75 | const __be32 *ip; |
97e873e5 SR |
76 | |
77 | do { | |
78 | if (np->parent) | |
79 | np = np->parent; | |
80 | ip = of_get_property(np, "#size-cells", NULL); | |
81 | if (ip) | |
33714881 | 82 | return be32_to_cpup(ip); |
97e873e5 SR |
83 | } while (np->parent); |
84 | /* No #size-cells property for the root node */ | |
85 | return OF_ROOT_NODE_SIZE_CELLS_DEFAULT; | |
86 | } | |
87 | EXPORT_SYMBOL(of_n_size_cells); | |
88 | ||
0c3f061c RH |
89 | #ifdef CONFIG_NUMA |
90 | int __weak of_node_to_nid(struct device_node *np) | |
91 | { | |
c8fff7bc | 92 | return NUMA_NO_NODE; |
0c3f061c RH |
93 | } |
94 | #endif | |
95 | ||
6afc0dc3 | 96 | #ifndef CONFIG_OF_DYNAMIC |
75b57ecf GL |
97 | static void of_node_release(struct kobject *kobj) |
98 | { | |
99 | /* Without CONFIG_OF_DYNAMIC, no nodes gets freed */ | |
100 | } | |
0f22dd39 | 101 | #endif /* CONFIG_OF_DYNAMIC */ |
923f7e30 | 102 | |
75b57ecf GL |
103 | struct kobj_type of_node_ktype = { |
104 | .release = of_node_release, | |
105 | }; | |
106 | ||
107 | static ssize_t of_node_property_read(struct file *filp, struct kobject *kobj, | |
108 | struct bin_attribute *bin_attr, char *buf, | |
109 | loff_t offset, size_t count) | |
110 | { | |
111 | struct property *pp = container_of(bin_attr, struct property, attr); | |
112 | return memory_read_from_buffer(buf, count, &offset, pp->value, pp->length); | |
113 | } | |
114 | ||
115 | static const char *safe_name(struct kobject *kobj, const char *orig_name) | |
116 | { | |
117 | const char *name = orig_name; | |
118 | struct kernfs_node *kn; | |
119 | int i = 0; | |
120 | ||
121 | /* don't be a hero. After 16 tries give up */ | |
122 | while (i < 16 && (kn = sysfs_get_dirent(kobj->sd, name))) { | |
123 | sysfs_put(kn); | |
124 | if (name != orig_name) | |
125 | kfree(name); | |
126 | name = kasprintf(GFP_KERNEL, "%s#%i", orig_name, ++i); | |
127 | } | |
128 | ||
129 | if (name != orig_name) | |
130 | pr_warn("device-tree: Duplicate name in %s, renamed to \"%s\"\n", | |
131 | kobject_name(kobj), name); | |
132 | return name; | |
133 | } | |
134 | ||
8a2b22a2 | 135 | int __of_add_property_sysfs(struct device_node *np, struct property *pp) |
75b57ecf GL |
136 | { |
137 | int rc; | |
138 | ||
139 | /* Important: Don't leak passwords */ | |
140 | bool secure = strncmp(pp->name, "security-", 9) == 0; | |
141 | ||
ef69d740 GM |
142 | if (!IS_ENABLED(CONFIG_SYSFS)) |
143 | return 0; | |
144 | ||
8a2b22a2 GL |
145 | if (!of_kset || !of_node_is_attached(np)) |
146 | return 0; | |
147 | ||
75b57ecf GL |
148 | sysfs_bin_attr_init(&pp->attr); |
149 | pp->attr.attr.name = safe_name(&np->kobj, pp->name); | |
150 | pp->attr.attr.mode = secure ? S_IRUSR : S_IRUGO; | |
151 | pp->attr.size = secure ? 0 : pp->length; | |
152 | pp->attr.read = of_node_property_read; | |
153 | ||
154 | rc = sysfs_create_bin_file(&np->kobj, &pp->attr); | |
155 | WARN(rc, "error adding attribute %s to node %s\n", pp->name, np->full_name); | |
156 | return rc; | |
157 | } | |
158 | ||
8a2b22a2 | 159 | int __of_attach_node_sysfs(struct device_node *np) |
75b57ecf GL |
160 | { |
161 | const char *name; | |
162 | struct property *pp; | |
163 | int rc; | |
164 | ||
ef69d740 GM |
165 | if (!IS_ENABLED(CONFIG_SYSFS)) |
166 | return 0; | |
167 | ||
8a2b22a2 GL |
168 | if (!of_kset) |
169 | return 0; | |
170 | ||
75b57ecf GL |
171 | np->kobj.kset = of_kset; |
172 | if (!np->parent) { | |
173 | /* Nodes without parents are new top level trees */ | |
28d3ee40 KC |
174 | rc = kobject_add(&np->kobj, NULL, "%s", |
175 | safe_name(&of_kset->kobj, "base")); | |
75b57ecf GL |
176 | } else { |
177 | name = safe_name(&np->parent->kobj, kbasename(np->full_name)); | |
178 | if (!name || !name[0]) | |
179 | return -EINVAL; | |
180 | ||
181 | rc = kobject_add(&np->kobj, &np->parent->kobj, "%s", name); | |
182 | } | |
183 | if (rc) | |
184 | return rc; | |
185 | ||
186 | for_each_property_of_node(np, pp) | |
187 | __of_add_property_sysfs(np, pp); | |
188 | ||
189 | return 0; | |
190 | } | |
191 | ||
194ec936 | 192 | void __init of_core_init(void) |
75b57ecf GL |
193 | { |
194 | struct device_node *np; | |
195 | ||
196 | /* Create the kset, and register existing nodes */ | |
c05aba2b | 197 | mutex_lock(&of_mutex); |
75b57ecf GL |
198 | of_kset = kset_create_and_add("devicetree", NULL, firmware_kobj); |
199 | if (!of_kset) { | |
c05aba2b | 200 | mutex_unlock(&of_mutex); |
194ec936 SH |
201 | pr_err("devicetree: failed to register existing nodes\n"); |
202 | return; | |
75b57ecf GL |
203 | } |
204 | for_each_of_allnodes(np) | |
8a2b22a2 | 205 | __of_attach_node_sysfs(np); |
c05aba2b | 206 | mutex_unlock(&of_mutex); |
75b57ecf | 207 | |
8357041a | 208 | /* Symlink in /proc as required by userspace ABI */ |
5063e25a | 209 | if (of_root) |
75b57ecf | 210 | proc_symlink("device-tree", NULL, "/sys/firmware/devicetree/base"); |
75b57ecf | 211 | } |
75b57ecf | 212 | |
28d0e36b TG |
213 | static struct property *__of_find_property(const struct device_node *np, |
214 | const char *name, int *lenp) | |
581b605a SR |
215 | { |
216 | struct property *pp; | |
217 | ||
64e4566f TT |
218 | if (!np) |
219 | return NULL; | |
220 | ||
a3a7cab1 | 221 | for (pp = np->properties; pp; pp = pp->next) { |
581b605a | 222 | if (of_prop_cmp(pp->name, name) == 0) { |
a3a7cab1 | 223 | if (lenp) |
581b605a SR |
224 | *lenp = pp->length; |
225 | break; | |
226 | } | |
227 | } | |
28d0e36b TG |
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; | |
d6d3c4e6 | 237 | unsigned long flags; |
28d0e36b | 238 | |
d6d3c4e6 | 239 | raw_spin_lock_irqsave(&devtree_lock, flags); |
28d0e36b | 240 | pp = __of_find_property(np, name, lenp); |
d6d3c4e6 | 241 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
581b605a SR |
242 | |
243 | return pp; | |
244 | } | |
245 | EXPORT_SYMBOL(of_find_property); | |
246 | ||
5063e25a GL |
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 | ||
e91edcf5 GL |
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; | |
d25d8694 | 275 | unsigned long flags; |
e91edcf5 | 276 | |
d25d8694 | 277 | raw_spin_lock_irqsave(&devtree_lock, flags); |
5063e25a GL |
278 | np = __of_find_all_nodes(prev); |
279 | of_node_get(np); | |
e91edcf5 | 280 | of_node_put(prev); |
d25d8694 | 281 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
e91edcf5 GL |
282 | return np; |
283 | } | |
284 | EXPORT_SYMBOL(of_find_all_nodes); | |
285 | ||
28d0e36b TG |
286 | /* |
287 | * Find a property with a given name for a given node | |
288 | * and return the value. | |
289 | */ | |
a25095d4 GL |
290 | const void *__of_get_property(const struct device_node *np, |
291 | const char *name, int *lenp) | |
28d0e36b TG |
292 | { |
293 | struct property *pp = __of_find_property(np, name, lenp); | |
294 | ||
295 | return pp ? pp->value : NULL; | |
296 | } | |
297 | ||
97e873e5 SR |
298 | /* |
299 | * Find a property with a given name for a given node | |
300 | * and return the value. | |
301 | */ | |
302 | const void *of_get_property(const struct device_node *np, const char *name, | |
28d0e36b | 303 | int *lenp) |
97e873e5 SR |
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); | |
0081cbc3 | 310 | |
183912d3 SK |
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); | |
f3cea45a | 344 | if (!cell || !ac) |
183912d3 | 345 | return false; |
f3cea45a | 346 | prop_len /= sizeof(*cell) * ac; |
183912d3 SK |
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 | ||
d1cb9d1a DM |
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 | ||
378 | if (__of_find_n_match_cpu_property(cpun, "reg", cpu, thread)) | |
379 | return true; | |
380 | ||
381 | return false; | |
382 | } | |
383 | ||
183912d3 SK |
384 | /** |
385 | * of_get_cpu_node - Get device node associated with the given logical CPU | |
386 | * | |
387 | * @cpu: CPU number(logical index) for which device node is required | |
388 | * @thread: if not NULL, local thread number within the physical core is | |
389 | * returned | |
390 | * | |
391 | * The main purpose of this function is to retrieve the device node for the | |
392 | * given logical CPU index. It should be used to initialize the of_node in | |
393 | * cpu device. Once of_node in cpu device is populated, all the further | |
394 | * references can use that instead. | |
395 | * | |
396 | * CPU logical to physical index mapping is architecture specific and is built | |
397 | * before booting secondary cores. This function uses arch_match_cpu_phys_id | |
398 | * which can be overridden by architecture specific implementation. | |
399 | * | |
400 | * Returns a node pointer for the logical cpu if found, else NULL. | |
401 | */ | |
402 | struct device_node *of_get_cpu_node(int cpu, unsigned int *thread) | |
403 | { | |
d1cb9d1a | 404 | struct device_node *cpun; |
183912d3 | 405 | |
d1cb9d1a DM |
406 | for_each_node_by_type(cpun, "cpu") { |
407 | if (arch_find_n_match_cpu_physical_id(cpun, cpu, thread)) | |
183912d3 SK |
408 | return cpun; |
409 | } | |
410 | return NULL; | |
411 | } | |
412 | EXPORT_SYMBOL(of_get_cpu_node); | |
413 | ||
215a14cf KH |
414 | /** |
415 | * __of_device_is_compatible() - Check if the node matches given constraints | |
416 | * @device: pointer to node | |
417 | * @compat: required compatible string, NULL or "" for any match | |
418 | * @type: required device_type value, NULL or "" for any match | |
419 | * @name: required node name, NULL or "" for any match | |
420 | * | |
421 | * Checks if the given @compat, @type and @name strings match the | |
422 | * properties of the given @device. A constraints can be skipped by | |
423 | * passing NULL or an empty string as the constraint. | |
424 | * | |
425 | * Returns 0 for no match, and a positive integer on match. The return | |
426 | * value is a relative score with larger values indicating better | |
427 | * matches. The score is weighted for the most specific compatible value | |
428 | * to get the highest score. Matching type is next, followed by matching | |
429 | * name. Practically speaking, this results in the following priority | |
430 | * order for matches: | |
431 | * | |
432 | * 1. specific compatible && type && name | |
433 | * 2. specific compatible && type | |
434 | * 3. specific compatible && name | |
435 | * 4. specific compatible | |
436 | * 5. general compatible && type && name | |
437 | * 6. general compatible && type | |
438 | * 7. general compatible && name | |
439 | * 8. general compatible | |
440 | * 9. type && name | |
441 | * 10. type | |
442 | * 11. name | |
0081cbc3 | 443 | */ |
28d0e36b | 444 | static int __of_device_is_compatible(const struct device_node *device, |
215a14cf KH |
445 | const char *compat, const char *type, const char *name) |
446 | { | |
447 | struct property *prop; | |
448 | const char *cp; | |
449 | int index = 0, score = 0; | |
450 | ||
451 | /* Compatible match has highest priority */ | |
452 | if (compat && compat[0]) { | |
453 | prop = __of_find_property(device, "compatible", NULL); | |
454 | for (cp = of_prop_next_string(prop, NULL); cp; | |
455 | cp = of_prop_next_string(prop, cp), index++) { | |
456 | if (of_compat_cmp(cp, compat, strlen(compat)) == 0) { | |
457 | score = INT_MAX/2 - (index << 2); | |
458 | break; | |
459 | } | |
460 | } | |
461 | if (!score) | |
462 | return 0; | |
463 | } | |
0081cbc3 | 464 | |
215a14cf KH |
465 | /* Matching type is better than matching name */ |
466 | if (type && type[0]) { | |
467 | if (!device->type || of_node_cmp(type, device->type)) | |
468 | return 0; | |
469 | score += 2; | |
0081cbc3 SR |
470 | } |
471 | ||
215a14cf KH |
472 | /* Matching name is a bit better than not */ |
473 | if (name && name[0]) { | |
474 | if (!device->name || of_node_cmp(name, device->name)) | |
475 | return 0; | |
476 | score++; | |
477 | } | |
478 | ||
479 | return score; | |
0081cbc3 | 480 | } |
28d0e36b TG |
481 | |
482 | /** Checks if the given "compat" string matches one of the strings in | |
483 | * the device's "compatible" property | |
484 | */ | |
485 | int of_device_is_compatible(const struct device_node *device, | |
486 | const char *compat) | |
487 | { | |
d6d3c4e6 | 488 | unsigned long flags; |
28d0e36b TG |
489 | int res; |
490 | ||
d6d3c4e6 | 491 | raw_spin_lock_irqsave(&devtree_lock, flags); |
215a14cf | 492 | res = __of_device_is_compatible(device, compat, NULL, NULL); |
d6d3c4e6 | 493 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
28d0e36b TG |
494 | return res; |
495 | } | |
0081cbc3 | 496 | EXPORT_SYMBOL(of_device_is_compatible); |
e679c5f4 | 497 | |
1f43cfb9 | 498 | /** |
71a157e8 | 499 | * of_machine_is_compatible - Test root of device tree for a given compatible value |
1f43cfb9 GL |
500 | * @compat: compatible string to look for in root node's compatible property. |
501 | * | |
25c7a1de | 502 | * Returns a positive integer if the root node has the given value in its |
1f43cfb9 GL |
503 | * compatible property. |
504 | */ | |
71a157e8 | 505 | int of_machine_is_compatible(const char *compat) |
1f43cfb9 GL |
506 | { |
507 | struct device_node *root; | |
508 | int rc = 0; | |
509 | ||
510 | root = of_find_node_by_path("/"); | |
511 | if (root) { | |
512 | rc = of_device_is_compatible(root, compat); | |
513 | of_node_put(root); | |
514 | } | |
515 | return rc; | |
516 | } | |
71a157e8 | 517 | EXPORT_SYMBOL(of_machine_is_compatible); |
1f43cfb9 | 518 | |
834d97d4 | 519 | /** |
c31a0c05 | 520 | * __of_device_is_available - check if a device is available for use |
834d97d4 | 521 | * |
c31a0c05 | 522 | * @device: Node to check for availability, with locks already held |
834d97d4 | 523 | * |
53a4ab96 KC |
524 | * Returns true if the status property is absent or set to "okay" or "ok", |
525 | * false otherwise | |
834d97d4 | 526 | */ |
53a4ab96 | 527 | static bool __of_device_is_available(const struct device_node *device) |
834d97d4 JB |
528 | { |
529 | const char *status; | |
530 | int statlen; | |
531 | ||
42ccd781 | 532 | if (!device) |
53a4ab96 | 533 | return false; |
42ccd781 | 534 | |
c31a0c05 | 535 | status = __of_get_property(device, "status", &statlen); |
834d97d4 | 536 | if (status == NULL) |
53a4ab96 | 537 | return true; |
834d97d4 JB |
538 | |
539 | if (statlen > 0) { | |
540 | if (!strcmp(status, "okay") || !strcmp(status, "ok")) | |
53a4ab96 | 541 | return true; |
834d97d4 JB |
542 | } |
543 | ||
53a4ab96 | 544 | return false; |
834d97d4 | 545 | } |
c31a0c05 SW |
546 | |
547 | /** | |
548 | * of_device_is_available - check if a device is available for use | |
549 | * | |
550 | * @device: Node to check for availability | |
551 | * | |
53a4ab96 KC |
552 | * Returns true if the status property is absent or set to "okay" or "ok", |
553 | * false otherwise | |
c31a0c05 | 554 | */ |
53a4ab96 | 555 | bool of_device_is_available(const struct device_node *device) |
c31a0c05 SW |
556 | { |
557 | unsigned long flags; | |
53a4ab96 | 558 | bool res; |
c31a0c05 SW |
559 | |
560 | raw_spin_lock_irqsave(&devtree_lock, flags); | |
561 | res = __of_device_is_available(device); | |
562 | raw_spin_unlock_irqrestore(&devtree_lock, flags); | |
563 | return res; | |
564 | ||
565 | } | |
834d97d4 JB |
566 | EXPORT_SYMBOL(of_device_is_available); |
567 | ||
37786c7f KC |
568 | /** |
569 | * of_device_is_big_endian - check if a device has BE registers | |
570 | * | |
571 | * @device: Node to check for endianness | |
572 | * | |
573 | * Returns true if the device has a "big-endian" property, or if the kernel | |
574 | * was compiled for BE *and* the device has a "native-endian" property. | |
575 | * Returns false otherwise. | |
576 | * | |
577 | * Callers would nominally use ioread32be/iowrite32be if | |
578 | * of_device_is_big_endian() == true, or readl/writel otherwise. | |
579 | */ | |
580 | bool of_device_is_big_endian(const struct device_node *device) | |
581 | { | |
582 | if (of_property_read_bool(device, "big-endian")) | |
583 | return true; | |
584 | if (IS_ENABLED(CONFIG_CPU_BIG_ENDIAN) && | |
585 | of_property_read_bool(device, "native-endian")) | |
586 | return true; | |
587 | return false; | |
588 | } | |
589 | EXPORT_SYMBOL(of_device_is_big_endian); | |
590 | ||
e679c5f4 SR |
591 | /** |
592 | * of_get_parent - Get a node's parent if any | |
593 | * @node: Node to get parent | |
594 | * | |
595 | * Returns a node pointer with refcount incremented, use | |
596 | * of_node_put() on it when done. | |
597 | */ | |
598 | struct device_node *of_get_parent(const struct device_node *node) | |
599 | { | |
600 | struct device_node *np; | |
d6d3c4e6 | 601 | unsigned long flags; |
e679c5f4 SR |
602 | |
603 | if (!node) | |
604 | return NULL; | |
605 | ||
d6d3c4e6 | 606 | raw_spin_lock_irqsave(&devtree_lock, flags); |
e679c5f4 | 607 | np = of_node_get(node->parent); |
d6d3c4e6 | 608 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
e679c5f4 SR |
609 | return np; |
610 | } | |
611 | EXPORT_SYMBOL(of_get_parent); | |
d1cd355a | 612 | |
f4eb0107 ME |
613 | /** |
614 | * of_get_next_parent - Iterate to a node's parent | |
615 | * @node: Node to get parent of | |
616 | * | |
c0e848d8 GU |
617 | * This is like of_get_parent() except that it drops the |
618 | * refcount on the passed node, making it suitable for iterating | |
619 | * through a node's parents. | |
f4eb0107 ME |
620 | * |
621 | * Returns a node pointer with refcount incremented, use | |
622 | * of_node_put() on it when done. | |
623 | */ | |
624 | struct device_node *of_get_next_parent(struct device_node *node) | |
625 | { | |
626 | struct device_node *parent; | |
d6d3c4e6 | 627 | unsigned long flags; |
f4eb0107 ME |
628 | |
629 | if (!node) | |
630 | return NULL; | |
631 | ||
d6d3c4e6 | 632 | raw_spin_lock_irqsave(&devtree_lock, flags); |
f4eb0107 ME |
633 | parent = of_node_get(node->parent); |
634 | of_node_put(node); | |
d6d3c4e6 | 635 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
f4eb0107 ME |
636 | return parent; |
637 | } | |
6695be68 | 638 | EXPORT_SYMBOL(of_get_next_parent); |
f4eb0107 | 639 | |
0d0e02d6 GL |
640 | static struct device_node *__of_get_next_child(const struct device_node *node, |
641 | struct device_node *prev) | |
642 | { | |
643 | struct device_node *next; | |
644 | ||
43cb4367 FF |
645 | if (!node) |
646 | return NULL; | |
647 | ||
0d0e02d6 GL |
648 | next = prev ? prev->sibling : node->child; |
649 | for (; next; next = next->sibling) | |
650 | if (of_node_get(next)) | |
651 | break; | |
652 | of_node_put(prev); | |
653 | return next; | |
654 | } | |
655 | #define __for_each_child_of_node(parent, child) \ | |
656 | for (child = __of_get_next_child(parent, NULL); child != NULL; \ | |
657 | child = __of_get_next_child(parent, child)) | |
658 | ||
d1cd355a SR |
659 | /** |
660 | * of_get_next_child - Iterate a node childs | |
661 | * @node: parent node | |
662 | * @prev: previous child of the parent node, or NULL to get first | |
663 | * | |
64808273 BS |
664 | * Returns a node pointer with refcount incremented, use of_node_put() on |
665 | * it when done. Returns NULL when prev is the last child. Decrements the | |
666 | * refcount of prev. | |
d1cd355a SR |
667 | */ |
668 | struct device_node *of_get_next_child(const struct device_node *node, | |
669 | struct device_node *prev) | |
670 | { | |
671 | struct device_node *next; | |
d6d3c4e6 | 672 | unsigned long flags; |
d1cd355a | 673 | |
d6d3c4e6 | 674 | raw_spin_lock_irqsave(&devtree_lock, flags); |
0d0e02d6 | 675 | next = __of_get_next_child(node, prev); |
d6d3c4e6 | 676 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
d1cd355a SR |
677 | return next; |
678 | } | |
679 | EXPORT_SYMBOL(of_get_next_child); | |
1ef4d424 | 680 | |
3296193d TT |
681 | /** |
682 | * of_get_next_available_child - Find the next available child node | |
683 | * @node: parent node | |
684 | * @prev: previous child of the parent node, or NULL to get first | |
685 | * | |
686 | * This function is like of_get_next_child(), except that it | |
687 | * automatically skips any disabled nodes (i.e. status = "disabled"). | |
688 | */ | |
689 | struct device_node *of_get_next_available_child(const struct device_node *node, | |
690 | struct device_node *prev) | |
691 | { | |
692 | struct device_node *next; | |
d25d8694 | 693 | unsigned long flags; |
3296193d | 694 | |
43cb4367 FF |
695 | if (!node) |
696 | return NULL; | |
697 | ||
d25d8694 | 698 | raw_spin_lock_irqsave(&devtree_lock, flags); |
3296193d TT |
699 | next = prev ? prev->sibling : node->child; |
700 | for (; next; next = next->sibling) { | |
c31a0c05 | 701 | if (!__of_device_is_available(next)) |
3296193d TT |
702 | continue; |
703 | if (of_node_get(next)) | |
704 | break; | |
705 | } | |
706 | of_node_put(prev); | |
d25d8694 | 707 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
3296193d TT |
708 | return next; |
709 | } | |
710 | EXPORT_SYMBOL(of_get_next_available_child); | |
711 | ||
9c19761a SK |
712 | /** |
713 | * of_get_child_by_name - Find the child node by name for a given parent | |
714 | * @node: parent node | |
715 | * @name: child name to look for. | |
716 | * | |
717 | * This function looks for child node for given matching name | |
718 | * | |
719 | * Returns a node pointer if found, with refcount incremented, use | |
720 | * of_node_put() on it when done. | |
721 | * Returns NULL if node is not found. | |
722 | */ | |
723 | struct device_node *of_get_child_by_name(const struct device_node *node, | |
724 | const char *name) | |
725 | { | |
726 | struct device_node *child; | |
727 | ||
728 | for_each_child_of_node(node, child) | |
729 | if (child->name && (of_node_cmp(child->name, name) == 0)) | |
730 | break; | |
731 | return child; | |
732 | } | |
733 | EXPORT_SYMBOL(of_get_child_by_name); | |
734 | ||
c22e650e GL |
735 | static struct device_node *__of_find_node_by_path(struct device_node *parent, |
736 | const char *path) | |
737 | { | |
738 | struct device_node *child; | |
106937e8 | 739 | int len; |
c22e650e | 740 | |
721a09e9 | 741 | len = strcspn(path, "/:"); |
c22e650e GL |
742 | if (!len) |
743 | return NULL; | |
744 | ||
745 | __for_each_child_of_node(parent, child) { | |
746 | const char *name = strrchr(child->full_name, '/'); | |
747 | if (WARN(!name, "malformed device_node %s\n", child->full_name)) | |
748 | continue; | |
749 | name++; | |
750 | if (strncmp(path, name, len) == 0 && (strlen(name) == len)) | |
751 | return child; | |
752 | } | |
753 | return NULL; | |
754 | } | |
755 | ||
1ef4d424 | 756 | /** |
75c28c09 | 757 | * of_find_node_opts_by_path - Find a node matching a full OF path |
c22e650e GL |
758 | * @path: Either the full path to match, or if the path does not |
759 | * start with '/', the name of a property of the /aliases | |
760 | * node (an alias). In the case of an alias, the node | |
761 | * matching the alias' value will be returned. | |
75c28c09 LL |
762 | * @opts: Address of a pointer into which to store the start of |
763 | * an options string appended to the end of the path with | |
764 | * a ':' separator. | |
c22e650e GL |
765 | * |
766 | * Valid paths: | |
767 | * /foo/bar Full path | |
768 | * foo Valid alias | |
769 | * foo/bar Valid alias + relative path | |
1ef4d424 SR |
770 | * |
771 | * Returns a node pointer with refcount incremented, use | |
772 | * of_node_put() on it when done. | |
773 | */ | |
75c28c09 | 774 | struct device_node *of_find_node_opts_by_path(const char *path, const char **opts) |
1ef4d424 | 775 | { |
c22e650e GL |
776 | struct device_node *np = NULL; |
777 | struct property *pp; | |
d6d3c4e6 | 778 | unsigned long flags; |
75c28c09 LL |
779 | const char *separator = strchr(path, ':'); |
780 | ||
781 | if (opts) | |
782 | *opts = separator ? separator + 1 : NULL; | |
1ef4d424 | 783 | |
c22e650e | 784 | if (strcmp(path, "/") == 0) |
5063e25a | 785 | return of_node_get(of_root); |
c22e650e GL |
786 | |
787 | /* The path could begin with an alias */ | |
788 | if (*path != '/') { | |
106937e8 LL |
789 | int len; |
790 | const char *p = separator; | |
791 | ||
792 | if (!p) | |
793 | p = strchrnul(path, '/'); | |
794 | len = p - path; | |
c22e650e GL |
795 | |
796 | /* of_aliases must not be NULL */ | |
797 | if (!of_aliases) | |
798 | return NULL; | |
799 | ||
800 | for_each_property_of_node(of_aliases, pp) { | |
801 | if (strlen(pp->name) == len && !strncmp(pp->name, path, len)) { | |
802 | np = of_find_node_by_path(pp->value); | |
803 | break; | |
804 | } | |
805 | } | |
806 | if (!np) | |
807 | return NULL; | |
808 | path = p; | |
809 | } | |
810 | ||
811 | /* Step down the tree matching path components */ | |
d6d3c4e6 | 812 | raw_spin_lock_irqsave(&devtree_lock, flags); |
c22e650e | 813 | if (!np) |
5063e25a | 814 | np = of_node_get(of_root); |
c22e650e GL |
815 | while (np && *path == '/') { |
816 | path++; /* Increment past '/' delimiter */ | |
817 | np = __of_find_node_by_path(np, path); | |
818 | path = strchrnul(path, '/'); | |
106937e8 LL |
819 | if (separator && separator < path) |
820 | break; | |
1ef4d424 | 821 | } |
d6d3c4e6 | 822 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
1ef4d424 SR |
823 | return np; |
824 | } | |
75c28c09 | 825 | EXPORT_SYMBOL(of_find_node_opts_by_path); |
1ef4d424 SR |
826 | |
827 | /** | |
828 | * of_find_node_by_name - Find a node by its "name" property | |
829 | * @from: The node to start searching from or NULL, the node | |
830 | * you pass will not be searched, only the next one | |
831 | * will; typically, you pass what the previous call | |
832 | * returned. of_node_put() will be called on it | |
833 | * @name: The name string to match against | |
834 | * | |
835 | * Returns a node pointer with refcount incremented, use | |
836 | * of_node_put() on it when done. | |
837 | */ | |
838 | struct device_node *of_find_node_by_name(struct device_node *from, | |
839 | const char *name) | |
840 | { | |
841 | struct device_node *np; | |
d6d3c4e6 | 842 | unsigned long flags; |
1ef4d424 | 843 | |
d6d3c4e6 | 844 | raw_spin_lock_irqsave(&devtree_lock, flags); |
5063e25a | 845 | for_each_of_allnodes_from(from, np) |
1ef4d424 SR |
846 | if (np->name && (of_node_cmp(np->name, name) == 0) |
847 | && of_node_get(np)) | |
848 | break; | |
849 | of_node_put(from); | |
d6d3c4e6 | 850 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
1ef4d424 SR |
851 | return np; |
852 | } | |
853 | EXPORT_SYMBOL(of_find_node_by_name); | |
854 | ||
855 | /** | |
856 | * of_find_node_by_type - Find a node by its "device_type" property | |
857 | * @from: The node to start searching from, or NULL to start searching | |
858 | * the entire device tree. The node you pass will not be | |
859 | * searched, only the next one will; typically, you pass | |
860 | * what the previous call returned. of_node_put() will be | |
861 | * called on from for you. | |
862 | * @type: The type string to match against | |
863 | * | |
864 | * Returns a node pointer with refcount incremented, use | |
865 | * of_node_put() on it when done. | |
866 | */ | |
867 | struct device_node *of_find_node_by_type(struct device_node *from, | |
868 | const char *type) | |
869 | { | |
870 | struct device_node *np; | |
d6d3c4e6 | 871 | unsigned long flags; |
1ef4d424 | 872 | |
d6d3c4e6 | 873 | raw_spin_lock_irqsave(&devtree_lock, flags); |
5063e25a | 874 | for_each_of_allnodes_from(from, np) |
1ef4d424 SR |
875 | if (np->type && (of_node_cmp(np->type, type) == 0) |
876 | && of_node_get(np)) | |
877 | break; | |
878 | of_node_put(from); | |
d6d3c4e6 | 879 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
1ef4d424 SR |
880 | return np; |
881 | } | |
882 | EXPORT_SYMBOL(of_find_node_by_type); | |
883 | ||
884 | /** | |
885 | * of_find_compatible_node - Find a node based on type and one of the | |
886 | * tokens in its "compatible" property | |
887 | * @from: The node to start searching from or NULL, the node | |
888 | * you pass will not be searched, only the next one | |
889 | * will; typically, you pass what the previous call | |
890 | * returned. of_node_put() will be called on it | |
891 | * @type: The type string to match "device_type" or NULL to ignore | |
892 | * @compatible: The string to match to one of the tokens in the device | |
893 | * "compatible" list. | |
894 | * | |
895 | * Returns a node pointer with refcount incremented, use | |
896 | * of_node_put() on it when done. | |
897 | */ | |
898 | struct device_node *of_find_compatible_node(struct device_node *from, | |
899 | const char *type, const char *compatible) | |
900 | { | |
901 | struct device_node *np; | |
d6d3c4e6 | 902 | unsigned long flags; |
1ef4d424 | 903 | |
d6d3c4e6 | 904 | raw_spin_lock_irqsave(&devtree_lock, flags); |
5063e25a | 905 | for_each_of_allnodes_from(from, np) |
215a14cf | 906 | if (__of_device_is_compatible(np, compatible, type, NULL) && |
28d0e36b | 907 | of_node_get(np)) |
1ef4d424 | 908 | break; |
1ef4d424 | 909 | of_node_put(from); |
d6d3c4e6 | 910 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
1ef4d424 SR |
911 | return np; |
912 | } | |
913 | EXPORT_SYMBOL(of_find_compatible_node); | |
283029d1 | 914 | |
1e291b14 ME |
915 | /** |
916 | * of_find_node_with_property - Find a node which has a property with | |
917 | * the given name. | |
918 | * @from: The node to start searching from or NULL, the node | |
919 | * you pass will not be searched, only the next one | |
920 | * will; typically, you pass what the previous call | |
921 | * returned. of_node_put() will be called on it | |
922 | * @prop_name: The name of the property to look for. | |
923 | * | |
924 | * Returns a node pointer with refcount incremented, use | |
925 | * of_node_put() on it when done. | |
926 | */ | |
927 | struct device_node *of_find_node_with_property(struct device_node *from, | |
928 | const char *prop_name) | |
929 | { | |
930 | struct device_node *np; | |
931 | struct property *pp; | |
d6d3c4e6 | 932 | unsigned long flags; |
1e291b14 | 933 | |
d6d3c4e6 | 934 | raw_spin_lock_irqsave(&devtree_lock, flags); |
5063e25a | 935 | for_each_of_allnodes_from(from, np) { |
a3a7cab1 | 936 | for (pp = np->properties; pp; pp = pp->next) { |
1e291b14 ME |
937 | if (of_prop_cmp(pp->name, prop_name) == 0) { |
938 | of_node_get(np); | |
939 | goto out; | |
940 | } | |
941 | } | |
942 | } | |
943 | out: | |
944 | of_node_put(from); | |
d6d3c4e6 | 945 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
1e291b14 ME |
946 | return np; |
947 | } | |
948 | EXPORT_SYMBOL(of_find_node_with_property); | |
949 | ||
28d0e36b TG |
950 | static |
951 | const struct of_device_id *__of_match_node(const struct of_device_id *matches, | |
952 | const struct device_node *node) | |
283029d1 | 953 | { |
215a14cf KH |
954 | const struct of_device_id *best_match = NULL; |
955 | int score, best_score = 0; | |
956 | ||
a52f07ec GL |
957 | if (!matches) |
958 | return NULL; | |
959 | ||
215a14cf KH |
960 | for (; matches->name[0] || matches->type[0] || matches->compatible[0]; matches++) { |
961 | score = __of_device_is_compatible(node, matches->compatible, | |
962 | matches->type, matches->name); | |
963 | if (score > best_score) { | |
964 | best_match = matches; | |
965 | best_score = score; | |
966 | } | |
4e8ca6ee | 967 | } |
215a14cf KH |
968 | |
969 | return best_match; | |
283029d1 | 970 | } |
28d0e36b TG |
971 | |
972 | /** | |
c50949d3 | 973 | * of_match_node - Tell if a device_node has a matching of_match structure |
28d0e36b TG |
974 | * @matches: array of of device match structures to search in |
975 | * @node: the of device structure to match against | |
976 | * | |
71c5498e | 977 | * Low level utility function used by device matching. |
28d0e36b TG |
978 | */ |
979 | const struct of_device_id *of_match_node(const struct of_device_id *matches, | |
980 | const struct device_node *node) | |
981 | { | |
982 | const struct of_device_id *match; | |
d6d3c4e6 | 983 | unsigned long flags; |
28d0e36b | 984 | |
d6d3c4e6 | 985 | raw_spin_lock_irqsave(&devtree_lock, flags); |
28d0e36b | 986 | match = __of_match_node(matches, node); |
d6d3c4e6 | 987 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
28d0e36b TG |
988 | return match; |
989 | } | |
283029d1 GL |
990 | EXPORT_SYMBOL(of_match_node); |
991 | ||
992 | /** | |
50c8af4c SW |
993 | * of_find_matching_node_and_match - Find a node based on an of_device_id |
994 | * match table. | |
283029d1 GL |
995 | * @from: The node to start searching from or NULL, the node |
996 | * you pass will not be searched, only the next one | |
997 | * will; typically, you pass what the previous call | |
998 | * returned. of_node_put() will be called on it | |
999 | * @matches: array of of device match structures to search in | |
50c8af4c | 1000 | * @match Updated to point at the matches entry which matched |
283029d1 GL |
1001 | * |
1002 | * Returns a node pointer with refcount incremented, use | |
1003 | * of_node_put() on it when done. | |
1004 | */ | |
50c8af4c SW |
1005 | struct device_node *of_find_matching_node_and_match(struct device_node *from, |
1006 | const struct of_device_id *matches, | |
1007 | const struct of_device_id **match) | |
283029d1 GL |
1008 | { |
1009 | struct device_node *np; | |
dc71bcf1 | 1010 | const struct of_device_id *m; |
d6d3c4e6 | 1011 | unsigned long flags; |
283029d1 | 1012 | |
50c8af4c SW |
1013 | if (match) |
1014 | *match = NULL; | |
1015 | ||
d6d3c4e6 | 1016 | raw_spin_lock_irqsave(&devtree_lock, flags); |
5063e25a | 1017 | for_each_of_allnodes_from(from, np) { |
28d0e36b | 1018 | m = __of_match_node(matches, np); |
dc71bcf1 | 1019 | if (m && of_node_get(np)) { |
50c8af4c | 1020 | if (match) |
dc71bcf1 | 1021 | *match = m; |
283029d1 | 1022 | break; |
50c8af4c | 1023 | } |
283029d1 GL |
1024 | } |
1025 | of_node_put(from); | |
d6d3c4e6 | 1026 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
283029d1 GL |
1027 | return np; |
1028 | } | |
80c2022e | 1029 | EXPORT_SYMBOL(of_find_matching_node_and_match); |
3f07af49 | 1030 | |
3f07af49 GL |
1031 | /** |
1032 | * of_modalias_node - Lookup appropriate modalias for a device node | |
1033 | * @node: pointer to a device tree node | |
1034 | * @modalias: Pointer to buffer that modalias value will be copied into | |
1035 | * @len: Length of modalias value | |
1036 | * | |
2ffe8c5f GL |
1037 | * Based on the value of the compatible property, this routine will attempt |
1038 | * to choose an appropriate modalias value for a particular device tree node. | |
1039 | * It does this by stripping the manufacturer prefix (as delimited by a ',') | |
1040 | * from the first entry in the compatible list property. | |
3f07af49 | 1041 | * |
2ffe8c5f | 1042 | * This routine returns 0 on success, <0 on failure. |
3f07af49 GL |
1043 | */ |
1044 | int of_modalias_node(struct device_node *node, char *modalias, int len) | |
1045 | { | |
2ffe8c5f GL |
1046 | const char *compatible, *p; |
1047 | int cplen; | |
3f07af49 GL |
1048 | |
1049 | compatible = of_get_property(node, "compatible", &cplen); | |
2ffe8c5f | 1050 | if (!compatible || strlen(compatible) > cplen) |
3f07af49 | 1051 | return -ENODEV; |
3f07af49 | 1052 | p = strchr(compatible, ','); |
2ffe8c5f | 1053 | strlcpy(modalias, p ? p + 1 : compatible, len); |
3f07af49 GL |
1054 | return 0; |
1055 | } | |
1056 | EXPORT_SYMBOL_GPL(of_modalias_node); | |
1057 | ||
89751a7c JK |
1058 | /** |
1059 | * of_find_node_by_phandle - Find a node given a phandle | |
1060 | * @handle: phandle of the node to find | |
1061 | * | |
1062 | * Returns a node pointer with refcount incremented, use | |
1063 | * of_node_put() on it when done. | |
1064 | */ | |
1065 | struct device_node *of_find_node_by_phandle(phandle handle) | |
1066 | { | |
1067 | struct device_node *np; | |
d25d8694 | 1068 | unsigned long flags; |
89751a7c | 1069 | |
fc59b447 GL |
1070 | if (!handle) |
1071 | return NULL; | |
1072 | ||
d25d8694 | 1073 | raw_spin_lock_irqsave(&devtree_lock, flags); |
5063e25a | 1074 | for_each_of_allnodes(np) |
89751a7c JK |
1075 | if (np->phandle == handle) |
1076 | break; | |
1077 | of_node_get(np); | |
d25d8694 | 1078 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
89751a7c JK |
1079 | return np; |
1080 | } | |
1081 | EXPORT_SYMBOL(of_find_node_by_phandle); | |
1082 | ||
ad54a0cf HS |
1083 | /** |
1084 | * of_property_count_elems_of_size - Count the number of elements in a property | |
1085 | * | |
1086 | * @np: device node from which the property value is to be read. | |
1087 | * @propname: name of the property to be searched. | |
1088 | * @elem_size: size of the individual element | |
1089 | * | |
1090 | * Search for a property in a device node and count the number of elements of | |
1091 | * size elem_size in it. Returns number of elements on sucess, -EINVAL if the | |
1092 | * property does not exist or its length does not match a multiple of elem_size | |
1093 | * and -ENODATA if the property does not have a value. | |
1094 | */ | |
1095 | int of_property_count_elems_of_size(const struct device_node *np, | |
1096 | const char *propname, int elem_size) | |
1097 | { | |
1098 | struct property *prop = of_find_property(np, propname, NULL); | |
1099 | ||
1100 | if (!prop) | |
1101 | return -EINVAL; | |
1102 | if (!prop->value) | |
1103 | return -ENODATA; | |
1104 | ||
1105 | if (prop->length % elem_size != 0) { | |
1106 | pr_err("size of %s in node %s is not a multiple of %d\n", | |
1107 | propname, np->full_name, elem_size); | |
1108 | return -EINVAL; | |
1109 | } | |
1110 | ||
1111 | return prop->length / elem_size; | |
1112 | } | |
1113 | EXPORT_SYMBOL_GPL(of_property_count_elems_of_size); | |
1114 | ||
daeec1f0 TP |
1115 | /** |
1116 | * of_find_property_value_of_size | |
1117 | * | |
1118 | * @np: device node from which the property value is to be read. | |
1119 | * @propname: name of the property to be searched. | |
1120 | * @len: requested length of property value | |
1121 | * | |
1122 | * Search for a property in a device node and valid the requested size. | |
1123 | * Returns the property value on success, -EINVAL if the property does not | |
1124 | * exist, -ENODATA if property does not have a value, and -EOVERFLOW if the | |
1125 | * property data isn't large enough. | |
1126 | * | |
1127 | */ | |
1128 | static void *of_find_property_value_of_size(const struct device_node *np, | |
1129 | const char *propname, u32 len) | |
1130 | { | |
1131 | struct property *prop = of_find_property(np, propname, NULL); | |
1132 | ||
1133 | if (!prop) | |
1134 | return ERR_PTR(-EINVAL); | |
1135 | if (!prop->value) | |
1136 | return ERR_PTR(-ENODATA); | |
1137 | if (len > prop->length) | |
1138 | return ERR_PTR(-EOVERFLOW); | |
1139 | ||
1140 | return prop->value; | |
1141 | } | |
1142 | ||
3daf3726 TP |
1143 | /** |
1144 | * of_property_read_u32_index - Find and read a u32 from a multi-value property. | |
1145 | * | |
1146 | * @np: device node from which the property value is to be read. | |
1147 | * @propname: name of the property to be searched. | |
1148 | * @index: index of the u32 in the list of values | |
1149 | * @out_value: pointer to return value, modified only if no error. | |
1150 | * | |
1151 | * Search for a property in a device node and read nth 32-bit value from | |
1152 | * it. Returns 0 on success, -EINVAL if the property does not exist, | |
1153 | * -ENODATA if property does not have a value, and -EOVERFLOW if the | |
1154 | * property data isn't large enough. | |
1155 | * | |
1156 | * The out_value is modified only if a valid u32 value can be decoded. | |
1157 | */ | |
1158 | int of_property_read_u32_index(const struct device_node *np, | |
1159 | const char *propname, | |
1160 | u32 index, u32 *out_value) | |
1161 | { | |
daeec1f0 TP |
1162 | const u32 *val = of_find_property_value_of_size(np, propname, |
1163 | ((index + 1) * sizeof(*out_value))); | |
3daf3726 | 1164 | |
daeec1f0 TP |
1165 | if (IS_ERR(val)) |
1166 | return PTR_ERR(val); | |
3daf3726 | 1167 | |
daeec1f0 | 1168 | *out_value = be32_to_cpup(((__be32 *)val) + index); |
3daf3726 TP |
1169 | return 0; |
1170 | } | |
1171 | EXPORT_SYMBOL_GPL(of_property_read_u32_index); | |
1172 | ||
be193249 VK |
1173 | /** |
1174 | * of_property_read_u8_array - Find and read an array of u8 from a property. | |
1175 | * | |
1176 | * @np: device node from which the property value is to be read. | |
1177 | * @propname: name of the property to be searched. | |
792efb84 | 1178 | * @out_values: pointer to return value, modified only if return value is 0. |
be193249 VK |
1179 | * @sz: number of array elements to read |
1180 | * | |
1181 | * Search for a property in a device node and read 8-bit value(s) from | |
1182 | * it. Returns 0 on success, -EINVAL if the property does not exist, | |
1183 | * -ENODATA if property does not have a value, and -EOVERFLOW if the | |
1184 | * property data isn't large enough. | |
1185 | * | |
1186 | * dts entry of array should be like: | |
1187 | * property = /bits/ 8 <0x50 0x60 0x70>; | |
1188 | * | |
792efb84 | 1189 | * The out_values is modified only if a valid u8 value can be decoded. |
be193249 VK |
1190 | */ |
1191 | int of_property_read_u8_array(const struct device_node *np, | |
1192 | const char *propname, u8 *out_values, size_t sz) | |
1193 | { | |
daeec1f0 TP |
1194 | const u8 *val = of_find_property_value_of_size(np, propname, |
1195 | (sz * sizeof(*out_values))); | |
be193249 | 1196 | |
daeec1f0 TP |
1197 | if (IS_ERR(val)) |
1198 | return PTR_ERR(val); | |
be193249 | 1199 | |
be193249 VK |
1200 | while (sz--) |
1201 | *out_values++ = *val++; | |
1202 | return 0; | |
1203 | } | |
1204 | EXPORT_SYMBOL_GPL(of_property_read_u8_array); | |
1205 | ||
1206 | /** | |
1207 | * of_property_read_u16_array - Find and read an array of u16 from a property. | |
1208 | * | |
1209 | * @np: device node from which the property value is to be read. | |
1210 | * @propname: name of the property to be searched. | |
792efb84 | 1211 | * @out_values: pointer to return value, modified only if return value is 0. |
be193249 VK |
1212 | * @sz: number of array elements to read |
1213 | * | |
1214 | * Search for a property in a device node and read 16-bit value(s) from | |
1215 | * it. Returns 0 on success, -EINVAL if the property does not exist, | |
1216 | * -ENODATA if property does not have a value, and -EOVERFLOW if the | |
1217 | * property data isn't large enough. | |
1218 | * | |
1219 | * dts entry of array should be like: | |
1220 | * property = /bits/ 16 <0x5000 0x6000 0x7000>; | |
1221 | * | |
792efb84 | 1222 | * The out_values is modified only if a valid u16 value can be decoded. |
be193249 VK |
1223 | */ |
1224 | int of_property_read_u16_array(const struct device_node *np, | |
1225 | const char *propname, u16 *out_values, size_t sz) | |
1226 | { | |
daeec1f0 TP |
1227 | const __be16 *val = of_find_property_value_of_size(np, propname, |
1228 | (sz * sizeof(*out_values))); | |
be193249 | 1229 | |
daeec1f0 TP |
1230 | if (IS_ERR(val)) |
1231 | return PTR_ERR(val); | |
be193249 | 1232 | |
be193249 VK |
1233 | while (sz--) |
1234 | *out_values++ = be16_to_cpup(val++); | |
1235 | return 0; | |
1236 | } | |
1237 | EXPORT_SYMBOL_GPL(of_property_read_u16_array); | |
1238 | ||
a3b85363 | 1239 | /** |
0e373639 RH |
1240 | * of_property_read_u32_array - Find and read an array of 32 bit integers |
1241 | * from a property. | |
1242 | * | |
a3b85363 TA |
1243 | * @np: device node from which the property value is to be read. |
1244 | * @propname: name of the property to be searched. | |
792efb84 | 1245 | * @out_values: pointer to return value, modified only if return value is 0. |
be193249 | 1246 | * @sz: number of array elements to read |
a3b85363 | 1247 | * |
0e373639 | 1248 | * Search for a property in a device node and read 32-bit value(s) from |
a3b85363 TA |
1249 | * it. Returns 0 on success, -EINVAL if the property does not exist, |
1250 | * -ENODATA if property does not have a value, and -EOVERFLOW if the | |
1251 | * property data isn't large enough. | |
1252 | * | |
792efb84 | 1253 | * The out_values is modified only if a valid u32 value can be decoded. |
a3b85363 | 1254 | */ |
aac285c6 JI |
1255 | int of_property_read_u32_array(const struct device_node *np, |
1256 | const char *propname, u32 *out_values, | |
1257 | size_t sz) | |
a3b85363 | 1258 | { |
daeec1f0 TP |
1259 | const __be32 *val = of_find_property_value_of_size(np, propname, |
1260 | (sz * sizeof(*out_values))); | |
a3b85363 | 1261 | |
daeec1f0 TP |
1262 | if (IS_ERR(val)) |
1263 | return PTR_ERR(val); | |
0e373639 | 1264 | |
0e373639 RH |
1265 | while (sz--) |
1266 | *out_values++ = be32_to_cpup(val++); | |
a3b85363 TA |
1267 | return 0; |
1268 | } | |
0e373639 | 1269 | EXPORT_SYMBOL_GPL(of_property_read_u32_array); |
a3b85363 | 1270 | |
4cd7f7a3 JI |
1271 | /** |
1272 | * of_property_read_u64 - Find and read a 64 bit integer from a property | |
1273 | * @np: device node from which the property value is to be read. | |
1274 | * @propname: name of the property to be searched. | |
1275 | * @out_value: pointer to return value, modified only if return value is 0. | |
1276 | * | |
1277 | * Search for a property in a device node and read a 64-bit value from | |
1278 | * it. Returns 0 on success, -EINVAL if the property does not exist, | |
1279 | * -ENODATA if property does not have a value, and -EOVERFLOW if the | |
1280 | * property data isn't large enough. | |
1281 | * | |
1282 | * The out_value is modified only if a valid u64 value can be decoded. | |
1283 | */ | |
1284 | int of_property_read_u64(const struct device_node *np, const char *propname, | |
1285 | u64 *out_value) | |
1286 | { | |
daeec1f0 TP |
1287 | const __be32 *val = of_find_property_value_of_size(np, propname, |
1288 | sizeof(*out_value)); | |
4cd7f7a3 | 1289 | |
daeec1f0 TP |
1290 | if (IS_ERR(val)) |
1291 | return PTR_ERR(val); | |
1292 | ||
1293 | *out_value = of_read_number(val, 2); | |
4cd7f7a3 JI |
1294 | return 0; |
1295 | } | |
1296 | EXPORT_SYMBOL_GPL(of_property_read_u64); | |
1297 | ||
b31384fa RW |
1298 | /** |
1299 | * of_property_read_u64_array - Find and read an array of 64 bit integers | |
1300 | * from a property. | |
1301 | * | |
1302 | * @np: device node from which the property value is to be read. | |
1303 | * @propname: name of the property to be searched. | |
1304 | * @out_values: pointer to return value, modified only if return value is 0. | |
1305 | * @sz: number of array elements to read | |
1306 | * | |
1307 | * Search for a property in a device node and read 64-bit value(s) from | |
1308 | * it. Returns 0 on success, -EINVAL if the property does not exist, | |
1309 | * -ENODATA if property does not have a value, and -EOVERFLOW if the | |
1310 | * property data isn't large enough. | |
1311 | * | |
1312 | * The out_values is modified only if a valid u64 value can be decoded. | |
1313 | */ | |
1314 | int of_property_read_u64_array(const struct device_node *np, | |
1315 | const char *propname, u64 *out_values, | |
1316 | size_t sz) | |
1317 | { | |
1318 | const __be32 *val = of_find_property_value_of_size(np, propname, | |
1319 | (sz * sizeof(*out_values))); | |
1320 | ||
1321 | if (IS_ERR(val)) | |
1322 | return PTR_ERR(val); | |
1323 | ||
1324 | while (sz--) { | |
1325 | *out_values++ = of_read_number(val, 2); | |
1326 | val += 2; | |
1327 | } | |
1328 | return 0; | |
1329 | } | |
2d4c0aef | 1330 | EXPORT_SYMBOL_GPL(of_property_read_u64_array); |
b31384fa | 1331 | |
a3b85363 TA |
1332 | /** |
1333 | * of_property_read_string - Find and read a string from a property | |
1334 | * @np: device node from which the property value is to be read. | |
1335 | * @propname: name of the property to be searched. | |
1336 | * @out_string: pointer to null terminated return string, modified only if | |
1337 | * return value is 0. | |
1338 | * | |
1339 | * Search for a property in a device tree node and retrieve a null | |
1340 | * terminated string value (pointer to data, not a copy). Returns 0 on | |
1341 | * success, -EINVAL if the property does not exist, -ENODATA if property | |
1342 | * does not have a value, and -EILSEQ if the string is not null-terminated | |
1343 | * within the length of the property data. | |
1344 | * | |
1345 | * The out_string pointer is modified only if a valid string can be decoded. | |
1346 | */ | |
aac285c6 | 1347 | int of_property_read_string(struct device_node *np, const char *propname, |
f09bc831 | 1348 | const char **out_string) |
a3b85363 TA |
1349 | { |
1350 | struct property *prop = of_find_property(np, propname, NULL); | |
1351 | if (!prop) | |
1352 | return -EINVAL; | |
1353 | if (!prop->value) | |
1354 | return -ENODATA; | |
1355 | if (strnlen(prop->value, prop->length) >= prop->length) | |
1356 | return -EILSEQ; | |
1357 | *out_string = prop->value; | |
1358 | return 0; | |
1359 | } | |
1360 | EXPORT_SYMBOL_GPL(of_property_read_string); | |
1361 | ||
7aff0fe3 GL |
1362 | /** |
1363 | * of_property_match_string() - Find string in a list and return index | |
1364 | * @np: pointer to node containing string list property | |
1365 | * @propname: string list property name | |
1366 | * @string: pointer to string to search for in string list | |
1367 | * | |
1368 | * This function searches a string list property and returns the index | |
1369 | * of a specific string value. | |
1370 | */ | |
1371 | int of_property_match_string(struct device_node *np, const char *propname, | |
1372 | const char *string) | |
1373 | { | |
1374 | struct property *prop = of_find_property(np, propname, NULL); | |
1375 | size_t l; | |
1376 | int i; | |
1377 | const char *p, *end; | |
1378 | ||
1379 | if (!prop) | |
1380 | return -EINVAL; | |
1381 | if (!prop->value) | |
1382 | return -ENODATA; | |
1383 | ||
1384 | p = prop->value; | |
1385 | end = p + prop->length; | |
1386 | ||
1387 | for (i = 0; p < end; i++, p += l) { | |
a87fa1d8 | 1388 | l = strnlen(p, end - p) + 1; |
7aff0fe3 GL |
1389 | if (p + l > end) |
1390 | return -EILSEQ; | |
1391 | pr_debug("comparing %s with %s\n", string, p); | |
1392 | if (strcmp(string, p) == 0) | |
1393 | return i; /* Found it; return index */ | |
1394 | } | |
1395 | return -ENODATA; | |
1396 | } | |
1397 | EXPORT_SYMBOL_GPL(of_property_match_string); | |
4fcd15a0 BC |
1398 | |
1399 | /** | |
e99010ed | 1400 | * of_property_read_string_helper() - Utility helper for parsing string properties |
4fcd15a0 BC |
1401 | * @np: device node from which the property value is to be read. |
1402 | * @propname: name of the property to be searched. | |
a87fa1d8 GL |
1403 | * @out_strs: output array of string pointers. |
1404 | * @sz: number of array elements to read. | |
1405 | * @skip: Number of strings to skip over at beginning of list. | |
4fcd15a0 | 1406 | * |
a87fa1d8 GL |
1407 | * Don't call this function directly. It is a utility helper for the |
1408 | * of_property_read_string*() family of functions. | |
4fcd15a0 | 1409 | */ |
a87fa1d8 GL |
1410 | int of_property_read_string_helper(struct device_node *np, const char *propname, |
1411 | const char **out_strs, size_t sz, int skip) | |
4fcd15a0 BC |
1412 | { |
1413 | struct property *prop = of_find_property(np, propname, NULL); | |
a87fa1d8 GL |
1414 | int l = 0, i = 0; |
1415 | const char *p, *end; | |
4fcd15a0 BC |
1416 | |
1417 | if (!prop) | |
1418 | return -EINVAL; | |
1419 | if (!prop->value) | |
1420 | return -ENODATA; | |
4fcd15a0 | 1421 | p = prop->value; |
a87fa1d8 | 1422 | end = p + prop->length; |
4fcd15a0 | 1423 | |
a87fa1d8 GL |
1424 | for (i = 0; p < end && (!out_strs || i < skip + sz); i++, p += l) { |
1425 | l = strnlen(p, end - p) + 1; | |
1426 | if (p + l > end) | |
1427 | return -EILSEQ; | |
1428 | if (out_strs && i >= skip) | |
1429 | *out_strs++ = p; | |
1430 | } | |
1431 | i -= skip; | |
1432 | return i <= 0 ? -ENODATA : i; | |
4fcd15a0 | 1433 | } |
a87fa1d8 | 1434 | EXPORT_SYMBOL_GPL(of_property_read_string_helper); |
4fcd15a0 | 1435 | |
624cfca5 GL |
1436 | void of_print_phandle_args(const char *msg, const struct of_phandle_args *args) |
1437 | { | |
1438 | int i; | |
1439 | printk("%s %s", msg, of_node_full_name(args->np)); | |
1440 | for (i = 0; i < args->args_count; i++) | |
1441 | printk(i ? ",%08x" : ":%08x", args->args[i]); | |
1442 | printk("\n"); | |
1443 | } | |
1444 | ||
bd69f73f GL |
1445 | static int __of_parse_phandle_with_args(const struct device_node *np, |
1446 | const char *list_name, | |
035fd948 SW |
1447 | const char *cells_name, |
1448 | int cell_count, int index, | |
bd69f73f | 1449 | struct of_phandle_args *out_args) |
64b60e09 | 1450 | { |
15c9a0ac | 1451 | const __be32 *list, *list_end; |
23ce04c0 | 1452 | int rc = 0, size, cur_index = 0; |
15c9a0ac | 1453 | uint32_t count = 0; |
64b60e09 | 1454 | struct device_node *node = NULL; |
15c9a0ac | 1455 | phandle phandle; |
64b60e09 | 1456 | |
15c9a0ac | 1457 | /* Retrieve the phandle list property */ |
64b60e09 | 1458 | list = of_get_property(np, list_name, &size); |
15c9a0ac | 1459 | if (!list) |
1af4c7f1 | 1460 | return -ENOENT; |
64b60e09 AV |
1461 | list_end = list + size / sizeof(*list); |
1462 | ||
15c9a0ac | 1463 | /* Loop over the phandles until all the requested entry is found */ |
64b60e09 | 1464 | while (list < list_end) { |
23ce04c0 | 1465 | rc = -EINVAL; |
15c9a0ac | 1466 | count = 0; |
64b60e09 | 1467 | |
15c9a0ac GL |
1468 | /* |
1469 | * If phandle is 0, then it is an empty entry with no | |
1470 | * arguments. Skip forward to the next entry. | |
1471 | */ | |
9a6b2e58 | 1472 | phandle = be32_to_cpup(list++); |
15c9a0ac GL |
1473 | if (phandle) { |
1474 | /* | |
1475 | * Find the provider node and parse the #*-cells | |
91d9942c SW |
1476 | * property to determine the argument length. |
1477 | * | |
1478 | * This is not needed if the cell count is hard-coded | |
1479 | * (i.e. cells_name not set, but cell_count is set), | |
1480 | * except when we're going to return the found node | |
1481 | * below. | |
15c9a0ac | 1482 | */ |
91d9942c SW |
1483 | if (cells_name || cur_index == index) { |
1484 | node = of_find_node_by_phandle(phandle); | |
1485 | if (!node) { | |
1486 | pr_err("%s: could not find phandle\n", | |
1487 | np->full_name); | |
1488 | goto err; | |
1489 | } | |
15c9a0ac | 1490 | } |
035fd948 SW |
1491 | |
1492 | if (cells_name) { | |
1493 | if (of_property_read_u32(node, cells_name, | |
1494 | &count)) { | |
1495 | pr_err("%s: could not get %s for %s\n", | |
1496 | np->full_name, cells_name, | |
1497 | node->full_name); | |
1498 | goto err; | |
1499 | } | |
1500 | } else { | |
1501 | count = cell_count; | |
15c9a0ac | 1502 | } |
64b60e09 | 1503 | |
15c9a0ac GL |
1504 | /* |
1505 | * Make sure that the arguments actually fit in the | |
1506 | * remaining property data length | |
1507 | */ | |
1508 | if (list + count > list_end) { | |
1509 | pr_err("%s: arguments longer than property\n", | |
1510 | np->full_name); | |
23ce04c0 | 1511 | goto err; |
15c9a0ac | 1512 | } |
64b60e09 AV |
1513 | } |
1514 | ||
15c9a0ac GL |
1515 | /* |
1516 | * All of the error cases above bail out of the loop, so at | |
1517 | * this point, the parsing is successful. If the requested | |
1518 | * index matches, then fill the out_args structure and return, | |
1519 | * or return -ENOENT for an empty entry. | |
1520 | */ | |
23ce04c0 | 1521 | rc = -ENOENT; |
15c9a0ac GL |
1522 | if (cur_index == index) { |
1523 | if (!phandle) | |
23ce04c0 | 1524 | goto err; |
15c9a0ac GL |
1525 | |
1526 | if (out_args) { | |
1527 | int i; | |
1528 | if (WARN_ON(count > MAX_PHANDLE_ARGS)) | |
1529 | count = MAX_PHANDLE_ARGS; | |
1530 | out_args->np = node; | |
1531 | out_args->args_count = count; | |
1532 | for (i = 0; i < count; i++) | |
1533 | out_args->args[i] = be32_to_cpup(list++); | |
b855f16b TY |
1534 | } else { |
1535 | of_node_put(node); | |
15c9a0ac | 1536 | } |
23ce04c0 GL |
1537 | |
1538 | /* Found it! return success */ | |
15c9a0ac | 1539 | return 0; |
64b60e09 | 1540 | } |
64b60e09 AV |
1541 | |
1542 | of_node_put(node); | |
1543 | node = NULL; | |
15c9a0ac | 1544 | list += count; |
64b60e09 AV |
1545 | cur_index++; |
1546 | } | |
1547 | ||
23ce04c0 GL |
1548 | /* |
1549 | * Unlock node before returning result; will be one of: | |
1550 | * -ENOENT : index is for empty phandle | |
1551 | * -EINVAL : parsing error on data | |
bd69f73f | 1552 | * [1..n] : Number of phandle (count mode; when index = -1) |
23ce04c0 | 1553 | */ |
bd69f73f | 1554 | rc = index < 0 ? cur_index : -ENOENT; |
23ce04c0 | 1555 | err: |
15c9a0ac GL |
1556 | if (node) |
1557 | of_node_put(node); | |
23ce04c0 | 1558 | return rc; |
64b60e09 | 1559 | } |
bd69f73f | 1560 | |
5fba49e3 SW |
1561 | /** |
1562 | * of_parse_phandle - Resolve a phandle property to a device_node pointer | |
1563 | * @np: Pointer to device node holding phandle property | |
1564 | * @phandle_name: Name of property holding a phandle value | |
1565 | * @index: For properties holding a table of phandles, this is the index into | |
1566 | * the table | |
1567 | * | |
1568 | * Returns the device_node pointer with refcount incremented. Use | |
1569 | * of_node_put() on it when done. | |
1570 | */ | |
1571 | struct device_node *of_parse_phandle(const struct device_node *np, | |
1572 | const char *phandle_name, int index) | |
1573 | { | |
91d9942c SW |
1574 | struct of_phandle_args args; |
1575 | ||
1576 | if (index < 0) | |
1577 | return NULL; | |
5fba49e3 | 1578 | |
91d9942c SW |
1579 | if (__of_parse_phandle_with_args(np, phandle_name, NULL, 0, |
1580 | index, &args)) | |
5fba49e3 SW |
1581 | return NULL; |
1582 | ||
91d9942c | 1583 | return args.np; |
5fba49e3 SW |
1584 | } |
1585 | EXPORT_SYMBOL(of_parse_phandle); | |
1586 | ||
eded9dd4 SW |
1587 | /** |
1588 | * of_parse_phandle_with_args() - Find a node pointed by phandle in a list | |
1589 | * @np: pointer to a device tree node containing a list | |
1590 | * @list_name: property name that contains a list | |
1591 | * @cells_name: property name that specifies phandles' arguments count | |
1592 | * @index: index of a phandle to parse out | |
1593 | * @out_args: optional pointer to output arguments structure (will be filled) | |
1594 | * | |
1595 | * This function is useful to parse lists of phandles and their arguments. | |
1596 | * Returns 0 on success and fills out_args, on error returns appropriate | |
1597 | * errno value. | |
1598 | * | |
d94a75c1 | 1599 | * Caller is responsible to call of_node_put() on the returned out_args->np |
eded9dd4 SW |
1600 | * pointer. |
1601 | * | |
1602 | * Example: | |
1603 | * | |
1604 | * phandle1: node1 { | |
c0e848d8 | 1605 | * #list-cells = <2>; |
eded9dd4 SW |
1606 | * } |
1607 | * | |
1608 | * phandle2: node2 { | |
c0e848d8 | 1609 | * #list-cells = <1>; |
eded9dd4 SW |
1610 | * } |
1611 | * | |
1612 | * node3 { | |
c0e848d8 | 1613 | * list = <&phandle1 1 2 &phandle2 3>; |
eded9dd4 SW |
1614 | * } |
1615 | * | |
1616 | * To get a device_node of the `node2' node you may call this: | |
1617 | * of_parse_phandle_with_args(node3, "list", "#list-cells", 1, &args); | |
1618 | */ | |
bd69f73f GL |
1619 | int of_parse_phandle_with_args(const struct device_node *np, const char *list_name, |
1620 | const char *cells_name, int index, | |
1621 | struct of_phandle_args *out_args) | |
1622 | { | |
1623 | if (index < 0) | |
1624 | return -EINVAL; | |
035fd948 SW |
1625 | return __of_parse_phandle_with_args(np, list_name, cells_name, 0, |
1626 | index, out_args); | |
bd69f73f | 1627 | } |
15c9a0ac | 1628 | EXPORT_SYMBOL(of_parse_phandle_with_args); |
02af11b0 | 1629 | |
035fd948 SW |
1630 | /** |
1631 | * of_parse_phandle_with_fixed_args() - Find a node pointed by phandle in a list | |
1632 | * @np: pointer to a device tree node containing a list | |
1633 | * @list_name: property name that contains a list | |
1634 | * @cell_count: number of argument cells following the phandle | |
1635 | * @index: index of a phandle to parse out | |
1636 | * @out_args: optional pointer to output arguments structure (will be filled) | |
1637 | * | |
1638 | * This function is useful to parse lists of phandles and their arguments. | |
1639 | * Returns 0 on success and fills out_args, on error returns appropriate | |
1640 | * errno value. | |
1641 | * | |
d94a75c1 | 1642 | * Caller is responsible to call of_node_put() on the returned out_args->np |
035fd948 SW |
1643 | * pointer. |
1644 | * | |
1645 | * Example: | |
1646 | * | |
1647 | * phandle1: node1 { | |
1648 | * } | |
1649 | * | |
1650 | * phandle2: node2 { | |
1651 | * } | |
1652 | * | |
1653 | * node3 { | |
c0e848d8 | 1654 | * list = <&phandle1 0 2 &phandle2 2 3>; |
035fd948 SW |
1655 | * } |
1656 | * | |
1657 | * To get a device_node of the `node2' node you may call this: | |
1658 | * of_parse_phandle_with_fixed_args(node3, "list", 2, 1, &args); | |
1659 | */ | |
1660 | int of_parse_phandle_with_fixed_args(const struct device_node *np, | |
1661 | const char *list_name, int cell_count, | |
1662 | int index, struct of_phandle_args *out_args) | |
1663 | { | |
1664 | if (index < 0) | |
1665 | return -EINVAL; | |
1666 | return __of_parse_phandle_with_args(np, list_name, NULL, cell_count, | |
1667 | index, out_args); | |
1668 | } | |
1669 | EXPORT_SYMBOL(of_parse_phandle_with_fixed_args); | |
1670 | ||
bd69f73f GL |
1671 | /** |
1672 | * of_count_phandle_with_args() - Find the number of phandles references in a property | |
1673 | * @np: pointer to a device tree node containing a list | |
1674 | * @list_name: property name that contains a list | |
1675 | * @cells_name: property name that specifies phandles' arguments count | |
1676 | * | |
1677 | * Returns the number of phandle + argument tuples within a property. It | |
1678 | * is a typical pattern to encode a list of phandle and variable | |
1679 | * arguments into a single property. The number of arguments is encoded | |
1680 | * by a property in the phandle-target node. For example, a gpios | |
1681 | * property would contain a list of GPIO specifies consisting of a | |
1682 | * phandle and 1 or more arguments. The number of arguments are | |
1683 | * determined by the #gpio-cells property in the node pointed to by the | |
1684 | * phandle. | |
1685 | */ | |
1686 | int of_count_phandle_with_args(const struct device_node *np, const char *list_name, | |
1687 | const char *cells_name) | |
1688 | { | |
035fd948 SW |
1689 | return __of_parse_phandle_with_args(np, list_name, cells_name, 0, -1, |
1690 | NULL); | |
bd69f73f GL |
1691 | } |
1692 | EXPORT_SYMBOL(of_count_phandle_with_args); | |
1693 | ||
62664f67 XL |
1694 | /** |
1695 | * __of_add_property - Add a property to a node without lock operations | |
1696 | */ | |
d8c50088 | 1697 | int __of_add_property(struct device_node *np, struct property *prop) |
62664f67 XL |
1698 | { |
1699 | struct property **next; | |
1700 | ||
1701 | prop->next = NULL; | |
1702 | next = &np->properties; | |
1703 | while (*next) { | |
1704 | if (strcmp(prop->name, (*next)->name) == 0) | |
1705 | /* duplicate ! don't insert it */ | |
1706 | return -EEXIST; | |
1707 | ||
1708 | next = &(*next)->next; | |
1709 | } | |
1710 | *next = prop; | |
1711 | ||
1712 | return 0; | |
1713 | } | |
1714 | ||
02af11b0 | 1715 | /** |
79d1c712 | 1716 | * of_add_property - Add a property to a node |
02af11b0 | 1717 | */ |
79d1c712 | 1718 | int of_add_property(struct device_node *np, struct property *prop) |
02af11b0 | 1719 | { |
02af11b0 | 1720 | unsigned long flags; |
1cf3d8b3 NF |
1721 | int rc; |
1722 | ||
8a2b22a2 | 1723 | mutex_lock(&of_mutex); |
02af11b0 | 1724 | |
d6d3c4e6 | 1725 | raw_spin_lock_irqsave(&devtree_lock, flags); |
62664f67 | 1726 | rc = __of_add_property(np, prop); |
d6d3c4e6 | 1727 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
02af11b0 | 1728 | |
8a2b22a2 | 1729 | if (!rc) |
0829f6d1 | 1730 | __of_add_property_sysfs(np, prop); |
02af11b0 | 1731 | |
8a2b22a2 GL |
1732 | mutex_unlock(&of_mutex); |
1733 | ||
259092a3 GL |
1734 | if (!rc) |
1735 | of_property_notify(OF_RECONFIG_ADD_PROPERTY, np, prop, NULL); | |
1736 | ||
62664f67 | 1737 | return rc; |
02af11b0 GL |
1738 | } |
1739 | ||
d8c50088 PA |
1740 | int __of_remove_property(struct device_node *np, struct property *prop) |
1741 | { | |
1742 | struct property **next; | |
1743 | ||
1744 | for (next = &np->properties; *next; next = &(*next)->next) { | |
1745 | if (*next == prop) | |
1746 | break; | |
1747 | } | |
1748 | if (*next == NULL) | |
1749 | return -ENODEV; | |
1750 | ||
1751 | /* found the node */ | |
1752 | *next = prop->next; | |
1753 | prop->next = np->deadprops; | |
1754 | np->deadprops = prop; | |
1755 | ||
1756 | return 0; | |
1757 | } | |
1758 | ||
8a2b22a2 GL |
1759 | void __of_remove_property_sysfs(struct device_node *np, struct property *prop) |
1760 | { | |
ef69d740 GM |
1761 | if (!IS_ENABLED(CONFIG_SYSFS)) |
1762 | return; | |
1763 | ||
8a2b22a2 GL |
1764 | /* at early boot, bail here and defer setup to of_init() */ |
1765 | if (of_kset && of_node_is_attached(np)) | |
1766 | sysfs_remove_bin_file(&np->kobj, &prop->attr); | |
1767 | } | |
1768 | ||
02af11b0 | 1769 | /** |
79d1c712 | 1770 | * of_remove_property - Remove a property from a node. |
02af11b0 GL |
1771 | * |
1772 | * Note that we don't actually remove it, since we have given out | |
1773 | * who-knows-how-many pointers to the data using get-property. | |
1774 | * Instead we just move the property to the "dead properties" | |
1775 | * list, so it won't be found any more. | |
1776 | */ | |
79d1c712 | 1777 | int of_remove_property(struct device_node *np, struct property *prop) |
02af11b0 | 1778 | { |
02af11b0 | 1779 | unsigned long flags; |
1cf3d8b3 NF |
1780 | int rc; |
1781 | ||
8a2b22a2 | 1782 | mutex_lock(&of_mutex); |
02af11b0 | 1783 | |
d6d3c4e6 | 1784 | raw_spin_lock_irqsave(&devtree_lock, flags); |
d8c50088 | 1785 | rc = __of_remove_property(np, prop); |
d6d3c4e6 | 1786 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
02af11b0 | 1787 | |
8a2b22a2 GL |
1788 | if (!rc) |
1789 | __of_remove_property_sysfs(np, prop); | |
02af11b0 | 1790 | |
8a2b22a2 | 1791 | mutex_unlock(&of_mutex); |
75b57ecf | 1792 | |
259092a3 GL |
1793 | if (!rc) |
1794 | of_property_notify(OF_RECONFIG_REMOVE_PROPERTY, np, prop, NULL); | |
02af11b0 | 1795 | |
8a2b22a2 | 1796 | return rc; |
02af11b0 GL |
1797 | } |
1798 | ||
d8c50088 PA |
1799 | int __of_update_property(struct device_node *np, struct property *newprop, |
1800 | struct property **oldpropp) | |
02af11b0 | 1801 | { |
475d0094 | 1802 | struct property **next, *oldprop; |
02af11b0 | 1803 | |
d8c50088 PA |
1804 | for (next = &np->properties; *next; next = &(*next)->next) { |
1805 | if (of_prop_cmp((*next)->name, newprop->name) == 0) | |
1806 | break; | |
1807 | } | |
1808 | *oldpropp = oldprop = *next; | |
475d0094 | 1809 | |
d8c50088 | 1810 | if (oldprop) { |
947fdaad | 1811 | /* replace the node */ |
d8c50088 PA |
1812 | newprop->next = oldprop->next; |
1813 | *next = newprop; | |
1814 | oldprop->next = np->deadprops; | |
1815 | np->deadprops = oldprop; | |
1816 | } else { | |
1817 | /* new node */ | |
1818 | newprop->next = NULL; | |
1819 | *next = newprop; | |
02af11b0 | 1820 | } |
75b57ecf | 1821 | |
d8c50088 PA |
1822 | return 0; |
1823 | } | |
1824 | ||
8a2b22a2 GL |
1825 | void __of_update_property_sysfs(struct device_node *np, struct property *newprop, |
1826 | struct property *oldprop) | |
1827 | { | |
ef69d740 GM |
1828 | if (!IS_ENABLED(CONFIG_SYSFS)) |
1829 | return; | |
1830 | ||
582da652 TP |
1831 | /* At early boot, bail out and defer setup to of_init() */ |
1832 | if (!of_kset) | |
8a2b22a2 | 1833 | return; |
582da652 | 1834 | |
947fdaad XL |
1835 | if (oldprop) |
1836 | sysfs_remove_bin_file(&np->kobj, &oldprop->attr); | |
75b57ecf | 1837 | __of_add_property_sysfs(np, newprop); |
02af11b0 | 1838 | } |
fcdeb7fe | 1839 | |
fcdeb7fe | 1840 | /* |
79d1c712 | 1841 | * of_update_property - Update a property in a node, if the property does |
475d0094 | 1842 | * not exist, add it. |
fcdeb7fe | 1843 | * |
02af11b0 GL |
1844 | * Note that we don't actually remove it, since we have given out |
1845 | * who-knows-how-many pointers to the data using get-property. | |
1846 | * Instead we just move the property to the "dead properties" list, | |
1847 | * and add the new property to the property list | |
fcdeb7fe | 1848 | */ |
79d1c712 | 1849 | int of_update_property(struct device_node *np, struct property *newprop) |
fcdeb7fe | 1850 | { |
d8c50088 | 1851 | struct property *oldprop; |
fcdeb7fe | 1852 | unsigned long flags; |
1cf3d8b3 NF |
1853 | int rc; |
1854 | ||
d8c50088 PA |
1855 | if (!newprop->name) |
1856 | return -EINVAL; | |
1cf3d8b3 | 1857 | |
8a2b22a2 | 1858 | mutex_lock(&of_mutex); |
fcdeb7fe | 1859 | |
d6d3c4e6 | 1860 | raw_spin_lock_irqsave(&devtree_lock, flags); |
d8c50088 | 1861 | rc = __of_update_property(np, newprop, &oldprop); |
d6d3c4e6 | 1862 | raw_spin_unlock_irqrestore(&devtree_lock, flags); |
fcdeb7fe | 1863 | |
8a2b22a2 GL |
1864 | if (!rc) |
1865 | __of_update_property_sysfs(np, newprop, oldprop); | |
fcdeb7fe | 1866 | |
8a2b22a2 | 1867 | mutex_unlock(&of_mutex); |
fcdeb7fe | 1868 | |
259092a3 GL |
1869 | if (!rc) |
1870 | of_property_notify(OF_RECONFIG_UPDATE_PROPERTY, np, newprop, oldprop); | |
e81b3295 | 1871 | |
1cf3d8b3 | 1872 | return rc; |
fcdeb7fe | 1873 | } |
fcdeb7fe | 1874 | |
611cad72 SG |
1875 | static void of_alias_add(struct alias_prop *ap, struct device_node *np, |
1876 | int id, const char *stem, int stem_len) | |
1877 | { | |
1878 | ap->np = np; | |
1879 | ap->id = id; | |
1880 | strncpy(ap->stem, stem, stem_len); | |
1881 | ap->stem[stem_len] = 0; | |
1882 | list_add_tail(&ap->link, &aliases_lookup); | |
1883 | pr_debug("adding DT alias:%s: stem=%s id=%i node=%s\n", | |
74a7f084 | 1884 | ap->alias, ap->stem, ap->id, of_node_full_name(np)); |
611cad72 SG |
1885 | } |
1886 | ||
1887 | /** | |
1821dda4 | 1888 | * of_alias_scan - Scan all properties of the 'aliases' node |
611cad72 | 1889 | * |
1821dda4 GU |
1890 | * The function scans all the properties of the 'aliases' node and populates |
1891 | * the global lookup table with the properties. It returns the | |
1892 | * number of alias properties found, or an error code in case of failure. | |
611cad72 SG |
1893 | * |
1894 | * @dt_alloc: An allocator that provides a virtual address to memory | |
1821dda4 | 1895 | * for storing the resulting tree |
611cad72 SG |
1896 | */ |
1897 | void of_alias_scan(void * (*dt_alloc)(u64 size, u64 align)) | |
1898 | { | |
1899 | struct property *pp; | |
1900 | ||
7dbe5849 | 1901 | of_aliases = of_find_node_by_path("/aliases"); |
611cad72 SG |
1902 | of_chosen = of_find_node_by_path("/chosen"); |
1903 | if (of_chosen == NULL) | |
1904 | of_chosen = of_find_node_by_path("/chosen@0"); | |
5c19e952 SH |
1905 | |
1906 | if (of_chosen) { | |
a752ee56 | 1907 | /* linux,stdout-path and /aliases/stdout are for legacy compatibility */ |
676e1b2f GL |
1908 | const char *name = of_get_property(of_chosen, "stdout-path", NULL); |
1909 | if (!name) | |
1910 | name = of_get_property(of_chosen, "linux,stdout-path", NULL); | |
a752ee56 GL |
1911 | if (IS_ENABLED(CONFIG_PPC) && !name) |
1912 | name = of_get_property(of_aliases, "stdout", NULL); | |
f64255b5 | 1913 | if (name) |
7914a7c5 | 1914 | of_stdout = of_find_node_opts_by_path(name, &of_stdout_options); |
5c19e952 SH |
1915 | } |
1916 | ||
611cad72 SG |
1917 | if (!of_aliases) |
1918 | return; | |
1919 | ||
8af0da93 | 1920 | for_each_property_of_node(of_aliases, pp) { |
611cad72 SG |
1921 | const char *start = pp->name; |
1922 | const char *end = start + strlen(start); | |
1923 | struct device_node *np; | |
1924 | struct alias_prop *ap; | |
1925 | int id, len; | |
1926 | ||
1927 | /* Skip those we do not want to proceed */ | |
1928 | if (!strcmp(pp->name, "name") || | |
1929 | !strcmp(pp->name, "phandle") || | |
1930 | !strcmp(pp->name, "linux,phandle")) | |
1931 | continue; | |
1932 | ||
1933 | np = of_find_node_by_path(pp->value); | |
1934 | if (!np) | |
1935 | continue; | |
1936 | ||
1937 | /* walk the alias backwards to extract the id and work out | |
1938 | * the 'stem' string */ | |
1939 | while (isdigit(*(end-1)) && end > start) | |
1940 | end--; | |
1941 | len = end - start; | |
1942 | ||
1943 | if (kstrtoint(end, 10, &id) < 0) | |
1944 | continue; | |
1945 | ||
1946 | /* Allocate an alias_prop with enough space for the stem */ | |
1947 | ap = dt_alloc(sizeof(*ap) + len + 1, 4); | |
1948 | if (!ap) | |
1949 | continue; | |
0640332e | 1950 | memset(ap, 0, sizeof(*ap) + len + 1); |
611cad72 SG |
1951 | ap->alias = start; |
1952 | of_alias_add(ap, np, id, start, len); | |
1953 | } | |
1954 | } | |
1955 | ||
1956 | /** | |
1957 | * of_alias_get_id - Get alias id for the given device_node | |
1958 | * @np: Pointer to the given device_node | |
1959 | * @stem: Alias stem of the given device_node | |
1960 | * | |
5a53a07f GU |
1961 | * The function travels the lookup table to get the alias id for the given |
1962 | * device_node and alias stem. It returns the alias id if found. | |
611cad72 SG |
1963 | */ |
1964 | int of_alias_get_id(struct device_node *np, const char *stem) | |
1965 | { | |
1966 | struct alias_prop *app; | |
1967 | int id = -ENODEV; | |
1968 | ||
c05aba2b | 1969 | mutex_lock(&of_mutex); |
611cad72 SG |
1970 | list_for_each_entry(app, &aliases_lookup, link) { |
1971 | if (strcmp(app->stem, stem) != 0) | |
1972 | continue; | |
1973 | ||
1974 | if (np == app->np) { | |
1975 | id = app->id; | |
1976 | break; | |
1977 | } | |
1978 | } | |
c05aba2b | 1979 | mutex_unlock(&of_mutex); |
611cad72 SG |
1980 | |
1981 | return id; | |
1982 | } | |
1983 | EXPORT_SYMBOL_GPL(of_alias_get_id); | |
c541adc6 | 1984 | |
351d224f WS |
1985 | /** |
1986 | * of_alias_get_highest_id - Get highest alias id for the given stem | |
1987 | * @stem: Alias stem to be examined | |
1988 | * | |
1989 | * The function travels the lookup table to get the highest alias id for the | |
1990 | * given alias stem. It returns the alias id if found. | |
1991 | */ | |
1992 | int of_alias_get_highest_id(const char *stem) | |
1993 | { | |
1994 | struct alias_prop *app; | |
1995 | int id = -ENODEV; | |
1996 | ||
1997 | mutex_lock(&of_mutex); | |
1998 | list_for_each_entry(app, &aliases_lookup, link) { | |
1999 | if (strcmp(app->stem, stem) != 0) | |
2000 | continue; | |
2001 | ||
2002 | if (app->id > id) | |
2003 | id = app->id; | |
2004 | } | |
2005 | mutex_unlock(&of_mutex); | |
2006 | ||
2007 | return id; | |
2008 | } | |
2009 | EXPORT_SYMBOL_GPL(of_alias_get_highest_id); | |
2010 | ||
c541adc6 SW |
2011 | const __be32 *of_prop_next_u32(struct property *prop, const __be32 *cur, |
2012 | u32 *pu) | |
2013 | { | |
2014 | const void *curv = cur; | |
2015 | ||
2016 | if (!prop) | |
2017 | return NULL; | |
2018 | ||
2019 | if (!cur) { | |
2020 | curv = prop->value; | |
2021 | goto out_val; | |
2022 | } | |
2023 | ||
2024 | curv += sizeof(*cur); | |
2025 | if (curv >= prop->value + prop->length) | |
2026 | return NULL; | |
2027 | ||
2028 | out_val: | |
2029 | *pu = be32_to_cpup(curv); | |
2030 | return curv; | |
2031 | } | |
2032 | EXPORT_SYMBOL_GPL(of_prop_next_u32); | |
2033 | ||
2034 | const char *of_prop_next_string(struct property *prop, const char *cur) | |
2035 | { | |
2036 | const void *curv = cur; | |
2037 | ||
2038 | if (!prop) | |
2039 | return NULL; | |
2040 | ||
2041 | if (!cur) | |
2042 | return prop->value; | |
2043 | ||
2044 | curv += strlen(cur) + 1; | |
2045 | if (curv >= prop->value + prop->length) | |
2046 | return NULL; | |
2047 | ||
2048 | return curv; | |
2049 | } | |
2050 | EXPORT_SYMBOL_GPL(of_prop_next_string); | |
5c19e952 SH |
2051 | |
2052 | /** | |
3482f2c5 GL |
2053 | * of_console_check() - Test and setup console for DT setup |
2054 | * @dn - Pointer to device node | |
2055 | * @name - Name to use for preferred console without index. ex. "ttyS" | |
2056 | * @index - Index to use for preferred console. | |
2057 | * | |
2058 | * Check if the given device node matches the stdout-path property in the | |
2059 | * /chosen node. If it does then register it as the preferred console and return | |
2060 | * TRUE. Otherwise return FALSE. | |
5c19e952 | 2061 | */ |
3482f2c5 | 2062 | bool of_console_check(struct device_node *dn, char *name, int index) |
5c19e952 | 2063 | { |
3482f2c5 | 2064 | if (!dn || dn != of_stdout || console_set_on_cmdline) |
5c19e952 | 2065 | return false; |
7914a7c5 LL |
2066 | return !add_preferred_console(name, index, |
2067 | kstrdup(of_stdout_options, GFP_KERNEL)); | |
5c19e952 | 2068 | } |
3482f2c5 | 2069 | EXPORT_SYMBOL_GPL(of_console_check); |
a3e31b45 SK |
2070 | |
2071 | /** | |
2072 | * of_find_next_cache_node - Find a node's subsidiary cache | |
2073 | * @np: node of type "cpu" or "cache" | |
2074 | * | |
2075 | * Returns a node pointer with refcount incremented, use | |
2076 | * of_node_put() on it when done. Caller should hold a reference | |
2077 | * to np. | |
2078 | */ | |
2079 | struct device_node *of_find_next_cache_node(const struct device_node *np) | |
2080 | { | |
2081 | struct device_node *child; | |
2082 | const phandle *handle; | |
2083 | ||
2084 | handle = of_get_property(np, "l2-cache", NULL); | |
2085 | if (!handle) | |
2086 | handle = of_get_property(np, "next-level-cache", NULL); | |
2087 | ||
2088 | if (handle) | |
2089 | return of_find_node_by_phandle(be32_to_cpup(handle)); | |
2090 | ||
2091 | /* OF on pmac has nodes instead of properties named "l2-cache" | |
2092 | * beneath CPU nodes. | |
2093 | */ | |
2094 | if (!strcmp(np->type, "cpu")) | |
2095 | for_each_child_of_node(np, child) | |
2096 | if (!strcmp(child->type, "cache")) | |
2097 | return child; | |
2098 | ||
2099 | return NULL; | |
2100 | } | |
fd9fdb78 | 2101 | |
f2a575f6 PZ |
2102 | /** |
2103 | * of_graph_parse_endpoint() - parse common endpoint node properties | |
2104 | * @node: pointer to endpoint device_node | |
2105 | * @endpoint: pointer to the OF endpoint data structure | |
2106 | * | |
2107 | * The caller should hold a reference to @node. | |
2108 | */ | |
2109 | int of_graph_parse_endpoint(const struct device_node *node, | |
2110 | struct of_endpoint *endpoint) | |
2111 | { | |
2112 | struct device_node *port_node = of_get_parent(node); | |
2113 | ||
d484700a PZ |
2114 | WARN_ONCE(!port_node, "%s(): endpoint %s has no parent node\n", |
2115 | __func__, node->full_name); | |
2116 | ||
f2a575f6 PZ |
2117 | memset(endpoint, 0, sizeof(*endpoint)); |
2118 | ||
2119 | endpoint->local_node = node; | |
2120 | /* | |
2121 | * It doesn't matter whether the two calls below succeed. | |
2122 | * If they don't then the default value 0 is used. | |
2123 | */ | |
2124 | of_property_read_u32(port_node, "reg", &endpoint->port); | |
2125 | of_property_read_u32(node, "reg", &endpoint->id); | |
2126 | ||
2127 | of_node_put(port_node); | |
2128 | ||
2129 | return 0; | |
2130 | } | |
2131 | EXPORT_SYMBOL(of_graph_parse_endpoint); | |
2132 | ||
bfe446e3 PZ |
2133 | /** |
2134 | * of_graph_get_port_by_id() - get the port matching a given id | |
2135 | * @parent: pointer to the parent device node | |
2136 | * @id: id of the port | |
2137 | * | |
2138 | * Return: A 'port' node pointer with refcount incremented. The caller | |
2139 | * has to use of_node_put() on it when done. | |
2140 | */ | |
2141 | struct device_node *of_graph_get_port_by_id(struct device_node *parent, u32 id) | |
2142 | { | |
2143 | struct device_node *node, *port; | |
2144 | ||
2145 | node = of_get_child_by_name(parent, "ports"); | |
2146 | if (node) | |
2147 | parent = node; | |
2148 | ||
2149 | for_each_child_of_node(parent, port) { | |
2150 | u32 port_id = 0; | |
2151 | ||
2152 | if (of_node_cmp(port->name, "port") != 0) | |
2153 | continue; | |
2154 | of_property_read_u32(port, "reg", &port_id); | |
2155 | if (id == port_id) | |
2156 | break; | |
2157 | } | |
2158 | ||
2159 | of_node_put(node); | |
2160 | ||
2161 | return port; | |
2162 | } | |
2163 | EXPORT_SYMBOL(of_graph_get_port_by_id); | |
2164 | ||
fd9fdb78 PZ |
2165 | /** |
2166 | * of_graph_get_next_endpoint() - get next endpoint node | |
2167 | * @parent: pointer to the parent device node | |
2168 | * @prev: previous endpoint node, or NULL to get first | |
2169 | * | |
2170 | * Return: An 'endpoint' node pointer with refcount incremented. Refcount | |
f033c0bc | 2171 | * of the passed @prev node is decremented. |
fd9fdb78 PZ |
2172 | */ |
2173 | struct device_node *of_graph_get_next_endpoint(const struct device_node *parent, | |
2174 | struct device_node *prev) | |
2175 | { | |
2176 | struct device_node *endpoint; | |
3c83e61e | 2177 | struct device_node *port; |
fd9fdb78 PZ |
2178 | |
2179 | if (!parent) | |
2180 | return NULL; | |
2181 | ||
3c83e61e LT |
2182 | /* |
2183 | * Start by locating the port node. If no previous endpoint is specified | |
2184 | * search for the first port node, otherwise get the previous endpoint | |
2185 | * parent port node. | |
2186 | */ | |
fd9fdb78 PZ |
2187 | if (!prev) { |
2188 | struct device_node *node; | |
3c83e61e | 2189 | |
fd9fdb78 PZ |
2190 | node = of_get_child_by_name(parent, "ports"); |
2191 | if (node) | |
2192 | parent = node; | |
2193 | ||
2194 | port = of_get_child_by_name(parent, "port"); | |
fd9fdb78 | 2195 | of_node_put(node); |
fd9fdb78 | 2196 | |
3c83e61e LT |
2197 | if (!port) { |
2198 | pr_err("%s(): no port node found in %s\n", | |
2199 | __func__, parent->full_name); | |
2200 | return NULL; | |
2201 | } | |
2202 | } else { | |
2203 | port = of_get_parent(prev); | |
2204 | if (WARN_ONCE(!port, "%s(): endpoint %s has no parent node\n", | |
2205 | __func__, prev->full_name)) | |
2206 | return NULL; | |
fd9fdb78 PZ |
2207 | } |
2208 | ||
3c83e61e LT |
2209 | while (1) { |
2210 | /* | |
2211 | * Now that we have a port node, get the next endpoint by | |
2212 | * getting the next child. If the previous endpoint is NULL this | |
2213 | * will return the first child. | |
2214 | */ | |
2215 | endpoint = of_get_next_child(port, prev); | |
2216 | if (endpoint) { | |
2217 | of_node_put(port); | |
2218 | return endpoint; | |
2219 | } | |
4329b93b | 2220 | |
3c83e61e LT |
2221 | /* No more endpoints under this port, try the next one. */ |
2222 | prev = NULL; | |
4329b93b | 2223 | |
3c83e61e LT |
2224 | do { |
2225 | port = of_get_next_child(parent, port); | |
2226 | if (!port) | |
2227 | return NULL; | |
2228 | } while (of_node_cmp(port->name, "port")); | |
2229 | } | |
fd9fdb78 PZ |
2230 | } |
2231 | EXPORT_SYMBOL(of_graph_get_next_endpoint); | |
2232 | ||
8ccd0d0c HH |
2233 | /** |
2234 | * of_graph_get_endpoint_by_regs() - get endpoint node of specific identifiers | |
2235 | * @parent: pointer to the parent device node | |
2236 | * @port_reg: identifier (value of reg property) of the parent port node | |
2237 | * @reg: identifier (value of reg property) of the endpoint node | |
2238 | * | |
2239 | * Return: An 'endpoint' node pointer which is identified by reg and at the same | |
2240 | * is the child of a port node identified by port_reg. reg and port_reg are | |
2241 | * ignored when they are -1. | |
2242 | */ | |
2243 | struct device_node *of_graph_get_endpoint_by_regs( | |
2244 | const struct device_node *parent, int port_reg, int reg) | |
2245 | { | |
2246 | struct of_endpoint endpoint; | |
2247 | struct device_node *node, *prev_node = NULL; | |
2248 | ||
2249 | while (1) { | |
2250 | node = of_graph_get_next_endpoint(parent, prev_node); | |
2251 | of_node_put(prev_node); | |
2252 | if (!node) | |
2253 | break; | |
2254 | ||
2255 | of_graph_parse_endpoint(node, &endpoint); | |
2256 | if (((port_reg == -1) || (endpoint.port == port_reg)) && | |
2257 | ((reg == -1) || (endpoint.id == reg))) | |
2258 | return node; | |
2259 | ||
2260 | prev_node = node; | |
2261 | } | |
2262 | ||
2263 | return NULL; | |
2264 | } | |
8ffaa903 | 2265 | EXPORT_SYMBOL(of_graph_get_endpoint_by_regs); |
8ccd0d0c | 2266 | |
fd9fdb78 PZ |
2267 | /** |
2268 | * of_graph_get_remote_port_parent() - get remote port's parent node | |
2269 | * @node: pointer to a local endpoint device_node | |
2270 | * | |
2271 | * Return: Remote device node associated with remote endpoint node linked | |
2272 | * to @node. Use of_node_put() on it when done. | |
2273 | */ | |
2274 | struct device_node *of_graph_get_remote_port_parent( | |
2275 | const struct device_node *node) | |
2276 | { | |
2277 | struct device_node *np; | |
2278 | unsigned int depth; | |
2279 | ||
2280 | /* Get remote endpoint node. */ | |
2281 | np = of_parse_phandle(node, "remote-endpoint", 0); | |
2282 | ||
2283 | /* Walk 3 levels up only if there is 'ports' node. */ | |
2284 | for (depth = 3; depth && np; depth--) { | |
2285 | np = of_get_next_parent(np); | |
2286 | if (depth == 2 && of_node_cmp(np->name, "ports")) | |
2287 | break; | |
2288 | } | |
2289 | return np; | |
2290 | } | |
2291 | EXPORT_SYMBOL(of_graph_get_remote_port_parent); | |
2292 | ||
2293 | /** | |
2294 | * of_graph_get_remote_port() - get remote port node | |
2295 | * @node: pointer to a local endpoint device_node | |
2296 | * | |
2297 | * Return: Remote port node associated with remote endpoint node linked | |
2298 | * to @node. Use of_node_put() on it when done. | |
2299 | */ | |
2300 | struct device_node *of_graph_get_remote_port(const struct device_node *node) | |
2301 | { | |
2302 | struct device_node *np; | |
2303 | ||
2304 | /* Get remote endpoint node. */ | |
2305 | np = of_parse_phandle(node, "remote-endpoint", 0); | |
2306 | if (!np) | |
2307 | return NULL; | |
2308 | return of_get_next_parent(np); | |
2309 | } | |
2310 | EXPORT_SYMBOL(of_graph_get_remote_port); |