Blame view
drivers/of/base.c
31.9 KB
97e873e5c Start split out o... |
1 2 3 4 5 6 7 8 9 10 11 |
/* * Procedures for creating, accessing and interpreting the device tree. * * Paul Mackerras August 1996. * Copyright (C) 1996-2005 Paul Mackerras. * * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner. * {engebret|bergner}@us.ibm.com * * Adapted for sparc and sparc64 by David S. Miller davem@davemloft.net * |
e91edcf5a of: merge of_find... |
12 13 |
* Reconsolidated from arch/x/kernel/prom.c by Stephen Rothwell and * Grant Likely. |
97e873e5c Start split out o... |
14 15 16 17 18 19 |
* * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version * 2 of the License, or (at your option) any later version. */ |
611cad720 dt: add of_alias_... |
20 |
#include <linux/ctype.h> |
97e873e5c Start split out o... |
21 22 |
#include <linux/module.h> #include <linux/of.h> |
581b605a8 Consolidate of_fi... |
23 |
#include <linux/spinlock.h> |
5a0e3ad6a include cleanup: ... |
24 |
#include <linux/slab.h> |
a9f2f63a6 of: include linux... |
25 |
#include <linux/proc_fs.h> |
581b605a8 Consolidate of_fi... |
26 |
|
611cad720 dt: add of_alias_... |
27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 |
/** * struct alias_prop - Alias property in 'aliases' node * @link: List node to link the structure in aliases_lookup list * @alias: Alias property name * @np: Pointer to device_node that the alias stands for * @id: Index value from end of alias name * @stem: Alias string without the index * * The structure represents one alias property of 'aliases' node as * an entry in aliases_lookup list. */ struct alias_prop { struct list_head link; const char *alias; struct device_node *np; int id; char stem[0]; }; static LIST_HEAD(aliases_lookup); |
1ef4d4242 Consolidate of_fi... |
47 |
struct device_node *allnodes; |
fc0bdae49 of: move definiti... |
48 |
struct device_node *of_chosen; |
611cad720 dt: add of_alias_... |
49 50 51 |
struct device_node *of_aliases; static DEFINE_MUTEX(of_aliases_mutex); |
1ef4d4242 Consolidate of_fi... |
52 |
|
581b605a8 Consolidate of_fi... |
53 54 55 56 |
/* use when traversing tree through the allnext, child, sibling, * or parent members of struct device_node. */ DEFINE_RWLOCK(devtree_lock); |
97e873e5c Start split out o... |
57 58 59 |
int of_n_addr_cells(struct device_node *np) { |
a9fadeefd of: use __be32 ty... |
60 |
const __be32 *ip; |
97e873e5c Start split out o... |
61 62 63 64 65 66 |
do { if (np->parent) np = np->parent; ip = of_get_property(np, "#address-cells", NULL); if (ip) |
337148812 of: assume big-en... |
67 |
return be32_to_cpup(ip); |
97e873e5c Start split out o... |
68 69 70 71 72 73 74 75 |
} while (np->parent); /* No #address-cells property for the root node */ return OF_ROOT_NODE_ADDR_CELLS_DEFAULT; } EXPORT_SYMBOL(of_n_addr_cells); int of_n_size_cells(struct device_node *np) { |
a9fadeefd of: use __be32 ty... |
76 |
const __be32 *ip; |
97e873e5c Start split out o... |
77 78 79 80 81 82 |
do { if (np->parent) np = np->parent; ip = of_get_property(np, "#size-cells", NULL); if (ip) |
337148812 of: assume big-en... |
83 |
return be32_to_cpup(ip); |
97e873e5c Start split out o... |
84 85 86 87 88 |
} while (np->parent); /* No #size-cells property for the root node */ return OF_ROOT_NODE_SIZE_CELLS_DEFAULT; } EXPORT_SYMBOL(of_n_size_cells); |
923f7e30b of: Merge of_node... |
89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 |
#if !defined(CONFIG_SPARC) /* SPARC doesn't do ref counting (yet) */ /** * of_node_get - Increment refcount of a node * @node: Node to inc refcount, NULL is supported to * simplify writing of callers * * Returns node. */ struct device_node *of_node_get(struct device_node *node) { if (node) kref_get(&node->kref); return node; } EXPORT_SYMBOL(of_node_get); static inline struct device_node *kref_to_device_node(struct kref *kref) { return container_of(kref, struct device_node, kref); } /** * of_node_release - release a dynamically allocated node * @kref: kref element of the node to be released * * In of_node_put() this function is passed to kref_put() * as the destructor. */ static void of_node_release(struct kref *kref) { struct device_node *node = kref_to_device_node(kref); struct property *prop = node->properties; /* We should never be releasing nodes that haven't been detached. */ if (!of_node_check_flag(node, OF_DETACHED)) { pr_err("ERROR: Bad of_node_put() on %s ", node->full_name); dump_stack(); kref_init(&node->kref); return; } if (!of_node_check_flag(node, OF_DYNAMIC)) return; while (prop) { struct property *next = prop->next; kfree(prop->name); kfree(prop->value); kfree(prop); prop = next; if (!prop) { prop = node->deadprops; node->deadprops = NULL; } } kfree(node->full_name); kfree(node->data); kfree(node); } /** * of_node_put - Decrement refcount of a node * @node: Node to dec refcount, NULL is supported to * simplify writing of callers * */ void of_node_put(struct device_node *node) { if (node) kref_put(&node->kref, of_node_release); } EXPORT_SYMBOL(of_node_put); #endif /* !CONFIG_SPARC */ |
581b605a8 Consolidate of_fi... |
164 165 166 167 168 |
struct property *of_find_property(const struct device_node *np, const char *name, int *lenp) { struct property *pp; |
64e4566f6 [POWERPC] Add nul... |
169 170 |
if (!np) return NULL; |
581b605a8 Consolidate of_fi... |
171 172 173 174 175 176 177 178 179 180 181 182 183 |
read_lock(&devtree_lock); for (pp = np->properties; pp != 0; pp = pp->next) { if (of_prop_cmp(pp->name, name) == 0) { if (lenp != 0) *lenp = pp->length; break; } } read_unlock(&devtree_lock); return pp; } EXPORT_SYMBOL(of_find_property); |
e91edcf5a of: merge of_find... |
184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 |
/** * of_find_all_nodes - Get next node in global list * @prev: Previous node or NULL to start iteration * of_node_put() will be called on it * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_all_nodes(struct device_node *prev) { struct device_node *np; read_lock(&devtree_lock); np = prev ? prev->allnext : allnodes; for (; np != NULL; np = np->allnext) if (of_node_get(np)) break; of_node_put(prev); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_all_nodes); |
97e873e5c Start split out o... |
206 207 208 209 210 211 212 213 214 215 216 217 |
/* * Find a property with a given name for a given node * and return the value. */ const void *of_get_property(const struct device_node *np, const char *name, int *lenp) { struct property *pp = of_find_property(np, name, lenp); return pp ? pp->value : NULL; } EXPORT_SYMBOL(of_get_property); |
0081cbc37 Consolidate of_de... |
218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 |
/** Checks if the given "compat" string matches one of the strings in * the device's "compatible" property */ int of_device_is_compatible(const struct device_node *device, const char *compat) { const char* cp; int cplen, l; cp = of_get_property(device, "compatible", &cplen); if (cp == NULL) return 0; while (cplen > 0) { if (of_compat_cmp(cp, compat, strlen(compat)) == 0) return 1; l = strlen(cp) + 1; cp += l; cplen -= l; } return 0; } EXPORT_SYMBOL(of_device_is_compatible); |
e679c5f44 Consolidate of_ge... |
242 243 |
/** |
71a157e8e of: add 'of_' pre... |
244 |
* of_machine_is_compatible - Test root of device tree for a given compatible value |
1f43cfb94 of: merge machine... |
245 246 247 248 249 |
* @compat: compatible string to look for in root node's compatible property. * * Returns true if the root node has the given value in its * compatible property. */ |
71a157e8e of: add 'of_' pre... |
250 |
int of_machine_is_compatible(const char *compat) |
1f43cfb94 of: merge machine... |
251 252 253 254 255 256 257 258 259 260 261 |
{ struct device_node *root; int rc = 0; root = of_find_node_by_path("/"); if (root) { rc = of_device_is_compatible(root, compat); of_node_put(root); } return rc; } |
71a157e8e of: add 'of_' pre... |
262 |
EXPORT_SYMBOL(of_machine_is_compatible); |
1f43cfb94 of: merge machine... |
263 264 |
/** |
834d97d45 [POWERPC] Add of_... |
265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 |
* of_device_is_available - check if a device is available for use * * @device: Node to check for availability * * Returns 1 if the status property is absent or set to "okay" or "ok", * 0 otherwise */ int of_device_is_available(const struct device_node *device) { const char *status; int statlen; status = of_get_property(device, "status", &statlen); if (status == NULL) return 1; if (statlen > 0) { if (!strcmp(status, "okay") || !strcmp(status, "ok")) return 1; } return 0; } EXPORT_SYMBOL(of_device_is_available); /** |
e679c5f44 Consolidate of_ge... |
291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 |
* of_get_parent - Get a node's parent if any * @node: Node to get parent * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_get_parent(const struct device_node *node) { struct device_node *np; if (!node) return NULL; read_lock(&devtree_lock); np = of_node_get(node->parent); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_get_parent); |
d1cd355a5 Consolidate of_ge... |
310 311 |
/** |
f4eb01070 [POWERPC] Add of_... |
312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 |
* of_get_next_parent - Iterate to a node's parent * @node: Node to get parent of * * This is like of_get_parent() except that it drops the * refcount on the passed node, making it suitable for iterating * through a node's parents. * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_get_next_parent(struct device_node *node) { struct device_node *parent; if (!node) return NULL; read_lock(&devtree_lock); parent = of_node_get(node->parent); of_node_put(node); read_unlock(&devtree_lock); return parent; } /** |
d1cd355a5 Consolidate of_ge... |
337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 |
* of_get_next_child - Iterate a node childs * @node: parent node * @prev: previous child of the parent node, or NULL to get first * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_get_next_child(const struct device_node *node, struct device_node *prev) { struct device_node *next; read_lock(&devtree_lock); next = prev ? prev->sibling : node->child; for (; next; next = next->sibling) if (of_node_get(next)) break; of_node_put(prev); read_unlock(&devtree_lock); return next; } EXPORT_SYMBOL(of_get_next_child); |
1ef4d4242 Consolidate of_fi... |
359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 |
/** * of_find_node_by_path - Find a node matching a full OF path * @path: The full path to match * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_node_by_path(const char *path) { struct device_node *np = allnodes; read_lock(&devtree_lock); for (; np; np = np->allnext) { if (np->full_name && (of_node_cmp(np->full_name, path) == 0) && of_node_get(np)) break; } read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_node_by_path); /** * of_find_node_by_name - Find a node by its "name" property * @from: The node to start searching from or NULL, the node * you pass will not be searched, only the next one * will; typically, you pass what the previous call * returned. of_node_put() will be called on it * @name: The name string to match against * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_node_by_name(struct device_node *from, const char *name) { struct device_node *np; read_lock(&devtree_lock); np = from ? from->allnext : allnodes; for (; np; np = np->allnext) if (np->name && (of_node_cmp(np->name, name) == 0) && of_node_get(np)) break; of_node_put(from); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_node_by_name); /** * of_find_node_by_type - Find a node by its "device_type" property * @from: The node to start searching from, or NULL to start searching * the entire device tree. The node you pass will not be * searched, only the next one will; typically, you pass * what the previous call returned. of_node_put() will be * called on from for you. * @type: The type string to match against * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_node_by_type(struct device_node *from, const char *type) { struct device_node *np; read_lock(&devtree_lock); np = from ? from->allnext : allnodes; for (; np; np = np->allnext) if (np->type && (of_node_cmp(np->type, type) == 0) && of_node_get(np)) break; of_node_put(from); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_node_by_type); /** * of_find_compatible_node - Find a node based on type and one of the * tokens in its "compatible" property * @from: The node to start searching from or NULL, the node * you pass will not be searched, only the next one * will; typically, you pass what the previous call * returned. of_node_put() will be called on it * @type: The type string to match "device_type" or NULL to ignore * @compatible: The string to match to one of the tokens in the device * "compatible" list. * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_compatible_node(struct device_node *from, const char *type, const char *compatible) { struct device_node *np; read_lock(&devtree_lock); np = from ? from->allnext : allnodes; for (; np; np = np->allnext) { if (type && !(np->type && (of_node_cmp(np->type, type) == 0))) continue; if (of_device_is_compatible(np, compatible) && of_node_get(np)) break; } of_node_put(from); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_compatible_node); |
283029d16 [POWERPC] Add of_... |
472 473 |
/** |
1e291b14c of: Add helpers f... |
474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 |
* of_find_node_with_property - Find a node which has a property with * the given name. * @from: The node to start searching from or NULL, the node * you pass will not be searched, only the next one * will; typically, you pass what the previous call * returned. of_node_put() will be called on it * @prop_name: The name of the property to look for. * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_node_with_property(struct device_node *from, const char *prop_name) { struct device_node *np; struct property *pp; read_lock(&devtree_lock); np = from ? from->allnext : allnodes; for (; np; np = np->allnext) { for (pp = np->properties; pp != 0; pp = pp->next) { if (of_prop_cmp(pp->name, prop_name) == 0) { of_node_get(np); goto out; } } } out: of_node_put(from); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_node_with_property); /** |
283029d16 [POWERPC] Add of_... |
509 510 511 512 513 514 515 516 517 |
* of_match_node - Tell if an device_node has a matching of_match structure * @matches: array of of device match structures to search in * @node: the of device structure to match against * * Low level utility function used by device matching. */ const struct of_device_id *of_match_node(const struct of_device_id *matches, const struct device_node *node) { |
a52f07ecd dt: protect again... |
518 519 |
if (!matches) return NULL; |
283029d16 [POWERPC] Add of_... |
520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 |
while (matches->name[0] || matches->type[0] || matches->compatible[0]) { int match = 1; if (matches->name[0]) match &= node->name && !strcmp(matches->name, node->name); if (matches->type[0]) match &= node->type && !strcmp(matches->type, node->type); if (matches->compatible[0]) match &= of_device_is_compatible(node, matches->compatible); if (match) return matches; matches++; } return NULL; } EXPORT_SYMBOL(of_match_node); /** * of_find_matching_node - Find a node based on an of_device_id match * table. * @from: The node to start searching from or NULL, the node * you pass will not be searched, only the next one * will; typically, you pass what the previous call * returned. of_node_put() will be called on it * @matches: array of of device match structures to search in * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_matching_node(struct device_node *from, const struct of_device_id *matches) { struct device_node *np; read_lock(&devtree_lock); np = from ? from->allnext : allnodes; for (; np; np = np->allnext) { if (of_match_node(matches, np) && of_node_get(np)) break; } of_node_put(from); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_matching_node); |
3f07af494 of: adapt of_find... |
567 568 |
/** |
3f07af494 of: adapt of_find... |
569 570 571 572 573 |
* of_modalias_node - Lookup appropriate modalias for a device node * @node: pointer to a device tree node * @modalias: Pointer to buffer that modalias value will be copied into * @len: Length of modalias value * |
2ffe8c5f3 of: refactor of_m... |
574 575 576 577 |
* Based on the value of the compatible property, this routine will attempt * to choose an appropriate modalias value for a particular device tree node. * It does this by stripping the manufacturer prefix (as delimited by a ',') * from the first entry in the compatible list property. |
3f07af494 of: adapt of_find... |
578 |
* |
2ffe8c5f3 of: refactor of_m... |
579 |
* This routine returns 0 on success, <0 on failure. |
3f07af494 of: adapt of_find... |
580 581 582 |
*/ int of_modalias_node(struct device_node *node, char *modalias, int len) { |
2ffe8c5f3 of: refactor of_m... |
583 584 |
const char *compatible, *p; int cplen; |
3f07af494 of: adapt of_find... |
585 586 |
compatible = of_get_property(node, "compatible", &cplen); |
2ffe8c5f3 of: refactor of_m... |
587 |
if (!compatible || strlen(compatible) > cplen) |
3f07af494 of: adapt of_find... |
588 |
return -ENODEV; |
3f07af494 of: adapt of_find... |
589 |
p = strchr(compatible, ','); |
2ffe8c5f3 of: refactor of_m... |
590 |
strlcpy(modalias, p ? p + 1 : compatible, len); |
3f07af494 of: adapt of_find... |
591 592 593 |
return 0; } EXPORT_SYMBOL_GPL(of_modalias_node); |
64b60e096 of: Add new helpe... |
594 |
/** |
89751a7cb of: merge of_find... |
595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 |
* of_find_node_by_phandle - Find a node given a phandle * @handle: phandle of the node to find * * Returns a node pointer with refcount incremented, use * of_node_put() on it when done. */ struct device_node *of_find_node_by_phandle(phandle handle) { struct device_node *np; read_lock(&devtree_lock); for (np = allnodes; np; np = np->allnext) if (np->phandle == handle) break; of_node_get(np); read_unlock(&devtree_lock); return np; } EXPORT_SYMBOL(of_find_node_by_phandle); /** |
0e373639a dt: add helper fu... |
616 617 618 |
* of_property_read_u32_array - Find and read an array of 32 bit integers * from a property. * |
a3b853633 dt: add helper fu... |
619 620 621 622 |
* @np: device node from which the property value is to be read. * @propname: name of the property to be searched. * @out_value: pointer to return value, modified only if return value is 0. * |
0e373639a dt: add helper fu... |
623 |
* Search for a property in a device node and read 32-bit value(s) from |
a3b853633 dt: add helper fu... |
624 625 626 627 628 629 |
* it. Returns 0 on success, -EINVAL if the property does not exist, * -ENODATA if property does not have a value, and -EOVERFLOW if the * property data isn't large enough. * * The out_value is modified only if a valid u32 value can be decoded. */ |
aac285c6c of: constify prop... |
630 631 632 |
int of_property_read_u32_array(const struct device_node *np, const char *propname, u32 *out_values, size_t sz) |
a3b853633 dt: add helper fu... |
633 634 |
{ struct property *prop = of_find_property(np, propname, NULL); |
0e373639a dt: add helper fu... |
635 |
const __be32 *val; |
a3b853633 dt: add helper fu... |
636 637 638 639 640 |
if (!prop) return -EINVAL; if (!prop->value) return -ENODATA; |
0e373639a dt: add helper fu... |
641 |
if ((sz * sizeof(*out_values)) > prop->length) |
a3b853633 dt: add helper fu... |
642 |
return -EOVERFLOW; |
0e373639a dt: add helper fu... |
643 644 645 646 |
val = prop->value; while (sz--) *out_values++ = be32_to_cpup(val++); |
a3b853633 dt: add helper fu... |
647 648 |
return 0; } |
0e373639a dt: add helper fu... |
649 |
EXPORT_SYMBOL_GPL(of_property_read_u32_array); |
a3b853633 dt: add helper fu... |
650 651 |
/** |
4cd7f7a31 dt: add helper to... |
652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 |
* of_property_read_u64 - Find and read a 64 bit integer from a property * @np: device node from which the property value is to be read. * @propname: name of the property to be searched. * @out_value: pointer to return value, modified only if return value is 0. * * Search for a property in a device node and read a 64-bit value from * it. Returns 0 on success, -EINVAL if the property does not exist, * -ENODATA if property does not have a value, and -EOVERFLOW if the * property data isn't large enough. * * The out_value is modified only if a valid u64 value can be decoded. */ int of_property_read_u64(const struct device_node *np, const char *propname, u64 *out_value) { struct property *prop = of_find_property(np, propname, NULL); if (!prop) return -EINVAL; if (!prop->value) return -ENODATA; if (sizeof(*out_value) > prop->length) return -EOVERFLOW; *out_value = of_read_number(prop->value, 2); return 0; } EXPORT_SYMBOL_GPL(of_property_read_u64); /** |
a3b853633 dt: add helper fu... |
681 682 683 684 685 686 687 688 689 690 691 692 693 694 |
* of_property_read_string - Find and read a string from a property * @np: device node from which the property value is to be read. * @propname: name of the property to be searched. * @out_string: pointer to null terminated return string, modified only if * return value is 0. * * Search for a property in a device tree node and retrieve a null * terminated string value (pointer to data, not a copy). Returns 0 on * success, -EINVAL if the property does not exist, -ENODATA if property * does not have a value, and -EILSEQ if the string is not null-terminated * within the length of the property data. * * The out_string pointer is modified only if a valid string can be decoded. */ |
aac285c6c of: constify prop... |
695 |
int of_property_read_string(struct device_node *np, const char *propname, |
f09bc831b dt: add 'const' f... |
696 |
const char **out_string) |
a3b853633 dt: add helper fu... |
697 698 699 700 701 702 703 704 705 706 707 708 709 710 |
{ struct property *prop = of_find_property(np, propname, NULL); if (!prop) return -EINVAL; if (!prop->value) return -ENODATA; if (strnlen(prop->value, prop->length) >= prop->length) return -EILSEQ; *out_string = prop->value; return 0; } EXPORT_SYMBOL_GPL(of_property_read_string); /** |
4fcd15a03 of: Add helpers t... |
711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 |
* of_property_read_string_index - Find and read a string from a multiple * strings property. * @np: device node from which the property value is to be read. * @propname: name of the property to be searched. * @index: index of the string in the list of strings * @out_string: pointer to null terminated return string, modified only if * return value is 0. * * Search for a property in a device tree node and retrieve a null * terminated string value (pointer to data, not a copy) in the list of strings * contained in that property. * Returns 0 on success, -EINVAL if the property does not exist, -ENODATA if * property does not have a value, and -EILSEQ if the string is not * null-terminated within the length of the property data. * * The out_string pointer is modified only if a valid string can be decoded. */ int of_property_read_string_index(struct device_node *np, const char *propname, int index, const char **output) { struct property *prop = of_find_property(np, propname, NULL); int i = 0; size_t l = 0, total = 0; const char *p; if (!prop) return -EINVAL; if (!prop->value) return -ENODATA; if (strnlen(prop->value, prop->length) >= prop->length) return -EILSEQ; p = prop->value; for (i = 0; total < prop->length; total += l, p += l) { l = strlen(p) + 1; |
88af7f58c of/base: Take NUL... |
747 |
if (i++ == index) { |
4fcd15a03 of: Add helpers t... |
748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 |
*output = p; return 0; } } return -ENODATA; } EXPORT_SYMBOL_GPL(of_property_read_string_index); /** * of_property_count_strings - Find and return the number of strings from a * multiple strings property. * @np: device node from which the property value is to be read. * @propname: name of the property to be searched. * * Search for a property in a device tree node and retrieve the number of null * terminated string contain in it. Returns the number of strings on * success, -EINVAL if the property does not exist, -ENODATA if property * does not have a value, and -EILSEQ if the string is not null-terminated * within the length of the property data. */ int of_property_count_strings(struct device_node *np, const char *propname) { struct property *prop = of_find_property(np, propname, NULL); int i = 0; size_t l = 0, total = 0; const char *p; if (!prop) return -EINVAL; if (!prop->value) return -ENODATA; if (strnlen(prop->value, prop->length) >= prop->length) return -EILSEQ; p = prop->value; |
88af7f58c of/base: Take NUL... |
784 |
for (i = 0; total < prop->length; total += l, p += l, i++) |
4fcd15a03 of: Add helpers t... |
785 |
l = strlen(p) + 1; |
88af7f58c of/base: Take NUL... |
786 |
|
4fcd15a03 of: Add helpers t... |
787 788 789 790 791 |
return i; } EXPORT_SYMBOL_GPL(of_property_count_strings); /** |
739649c53 of: add of_parse_... |
792 793 794 795 796 797 798 799 800 801 802 803 |
* of_parse_phandle - Resolve a phandle property to a device_node pointer * @np: Pointer to device node holding phandle property * @phandle_name: Name of property holding a phandle value * @index: For properties holding a table of phandles, this is the index into * the table * * Returns the device_node pointer with refcount incremented. Use * of_node_put() on it when done. */ struct device_node * of_parse_phandle(struct device_node *np, const char *phandle_name, int index) { |
9a6b2e588 of: Fix phandle e... |
804 |
const __be32 *phandle; |
739649c53 of: add of_parse_... |
805 806 807 808 809 |
int size; phandle = of_get_property(np, phandle_name, &size); if ((!phandle) || (size < sizeof(*phandle) * (index + 1))) return NULL; |
9a6b2e588 of: Fix phandle e... |
810 |
return of_find_node_by_phandle(be32_to_cpup(phandle + index)); |
739649c53 of: add of_parse_... |
811 812 813 814 |
} EXPORT_SYMBOL(of_parse_phandle); /** |
15c9a0acc of: create of_pha... |
815 |
* of_parse_phandle_with_args() - Find a node pointed by phandle in a list |
64b60e096 of: Add new helpe... |
816 817 818 819 |
* @np: pointer to a device tree node containing a list * @list_name: property name that contains a list * @cells_name: property name that specifies phandles' arguments count * @index: index of a phandle to parse out |
15c9a0acc of: create of_pha... |
820 |
* @out_args: optional pointer to output arguments structure (will be filled) |
64b60e096 of: Add new helpe... |
821 822 |
* * This function is useful to parse lists of phandles and their arguments. |
15c9a0acc of: create of_pha... |
823 824 825 826 827 |
* Returns 0 on success and fills out_args, on error returns appropriate * errno value. * * Caller is responsible to call of_node_put() on the returned out_args->node * pointer. |
64b60e096 of: Add new helpe... |
828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 |
* * Example: * * phandle1: node1 { * #list-cells = <2>; * } * * phandle2: node2 { * #list-cells = <1>; * } * * node3 { * list = <&phandle1 1 2 &phandle2 3>; * } * * To get a device_node of the `node2' node you may call this: |
15c9a0acc of: create of_pha... |
844 |
* of_parse_phandle_with_args(node3, "list", "#list-cells", 1, &args); |
64b60e096 of: Add new helpe... |
845 |
*/ |
15c9a0acc of: create of_pha... |
846 |
int of_parse_phandle_with_args(struct device_node *np, const char *list_name, |
64b60e096 of: Add new helpe... |
847 |
const char *cells_name, int index, |
15c9a0acc of: create of_pha... |
848 |
struct of_phandle_args *out_args) |
64b60e096 of: Add new helpe... |
849 |
{ |
15c9a0acc of: create of_pha... |
850 851 852 |
const __be32 *list, *list_end; int size, cur_index = 0; uint32_t count = 0; |
64b60e096 of: Add new helpe... |
853 |
struct device_node *node = NULL; |
15c9a0acc of: create of_pha... |
854 |
phandle phandle; |
64b60e096 of: Add new helpe... |
855 |
|
15c9a0acc of: create of_pha... |
856 |
/* Retrieve the phandle list property */ |
64b60e096 of: Add new helpe... |
857 |
list = of_get_property(np, list_name, &size); |
15c9a0acc of: create of_pha... |
858 859 |
if (!list) return -EINVAL; |
64b60e096 of: Add new helpe... |
860 |
list_end = list + size / sizeof(*list); |
15c9a0acc of: create of_pha... |
861 |
/* Loop over the phandles until all the requested entry is found */ |
64b60e096 of: Add new helpe... |
862 |
while (list < list_end) { |
15c9a0acc of: create of_pha... |
863 |
count = 0; |
64b60e096 of: Add new helpe... |
864 |
|
15c9a0acc of: create of_pha... |
865 866 867 868 |
/* * If phandle is 0, then it is an empty entry with no * arguments. Skip forward to the next entry. */ |
9a6b2e588 of: Fix phandle e... |
869 |
phandle = be32_to_cpup(list++); |
15c9a0acc of: create of_pha... |
870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 |
if (phandle) { /* * Find the provider node and parse the #*-cells * property to determine the argument length */ node = of_find_node_by_phandle(phandle); if (!node) { pr_err("%s: could not find phandle ", np->full_name); break; } if (of_property_read_u32(node, cells_name, &count)) { pr_err("%s: could not get %s for %s ", np->full_name, cells_name, node->full_name); break; } |
64b60e096 of: Add new helpe... |
889 |
|
15c9a0acc of: create of_pha... |
890 891 892 893 894 895 896 897 898 899 |
/* * Make sure that the arguments actually fit in the * remaining property data length */ if (list + count > list_end) { pr_err("%s: arguments longer than property ", np->full_name); break; } |
64b60e096 of: Add new helpe... |
900 |
} |
15c9a0acc of: create of_pha... |
901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 |
/* * All of the error cases above bail out of the loop, so at * this point, the parsing is successful. If the requested * index matches, then fill the out_args structure and return, * or return -ENOENT for an empty entry. */ if (cur_index == index) { if (!phandle) return -ENOENT; if (out_args) { int i; if (WARN_ON(count > MAX_PHANDLE_ARGS)) count = MAX_PHANDLE_ARGS; out_args->np = node; out_args->args_count = count; for (i = 0; i < count; i++) out_args->args[i] = be32_to_cpup(list++); } return 0; |
64b60e096 of: Add new helpe... |
921 |
} |
64b60e096 of: Add new helpe... |
922 923 924 |
of_node_put(node); node = NULL; |
15c9a0acc of: create of_pha... |
925 |
list += count; |
64b60e096 of: Add new helpe... |
926 927 |
cur_index++; } |
15c9a0acc of: create of_pha... |
928 929 930 931 |
/* Loop exited without finding a valid entry; return an error */ if (node) of_node_put(node); return -EINVAL; |
64b60e096 of: Add new helpe... |
932 |
} |
15c9a0acc of: create of_pha... |
933 |
EXPORT_SYMBOL(of_parse_phandle_with_args); |
02af11b03 of: merge prom_{a... |
934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 |
/** * prom_add_property - Add a property to a node */ int prom_add_property(struct device_node *np, struct property *prop) { struct property **next; unsigned long flags; prop->next = NULL; write_lock_irqsave(&devtree_lock, flags); next = &np->properties; while (*next) { if (strcmp(prop->name, (*next)->name) == 0) { /* duplicate ! don't insert it */ write_unlock_irqrestore(&devtree_lock, flags); return -1; } next = &(*next)->next; } *next = prop; write_unlock_irqrestore(&devtree_lock, flags); #ifdef CONFIG_PROC_DEVICETREE /* try to add to proc as well if it was initialized */ if (np->pde) proc_device_tree_add_prop(np->pde, prop); #endif /* CONFIG_PROC_DEVICETREE */ return 0; } /** * prom_remove_property - Remove a property from a node. * * Note that we don't actually remove it, since we have given out * who-knows-how-many pointers to the data using get-property. * Instead we just move the property to the "dead properties" * list, so it won't be found any more. */ int prom_remove_property(struct device_node *np, struct property *prop) { struct property **next; unsigned long flags; int found = 0; write_lock_irqsave(&devtree_lock, flags); next = &np->properties; while (*next) { if (*next == prop) { /* found the node */ *next = prop->next; prop->next = np->deadprops; np->deadprops = prop; found = 1; break; } next = &(*next)->next; } write_unlock_irqrestore(&devtree_lock, flags); if (!found) return -ENODEV; #ifdef CONFIG_PROC_DEVICETREE /* try to remove the proc node as well */ if (np->pde) proc_device_tree_remove_prop(np->pde, prop); #endif /* CONFIG_PROC_DEVICETREE */ return 0; } /* * prom_update_property - Update a property in a node. * * Note that we don't actually remove it, since we have given out * who-knows-how-many pointers to the data using get-property. * Instead we just move the property to the "dead properties" list, * and add the new property to the property list */ int prom_update_property(struct device_node *np, struct property *newprop, struct property *oldprop) { struct property **next; unsigned long flags; int found = 0; write_lock_irqsave(&devtree_lock, flags); next = &np->properties; while (*next) { if (*next == oldprop) { /* found the node */ newprop->next = oldprop->next; *next = newprop; oldprop->next = np->deadprops; np->deadprops = oldprop; found = 1; break; } next = &(*next)->next; } write_unlock_irqrestore(&devtree_lock, flags); if (!found) return -ENODEV; #ifdef CONFIG_PROC_DEVICETREE /* try to add to proc as well if it was initialized */ if (np->pde) proc_device_tree_update_prop(np->pde, newprop, oldprop); #endif /* CONFIG_PROC_DEVICETREE */ return 0; } |
fcdeb7fed of: merge of_atta... |
1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 |
#if defined(CONFIG_OF_DYNAMIC) /* * Support for dynamic device trees. * * On some platforms, the device tree can be manipulated at runtime. * The routines in this section support adding, removing and changing * device tree nodes. */ /** * of_attach_node - Plug a device node into the tree and global list. */ void of_attach_node(struct device_node *np) { unsigned long flags; write_lock_irqsave(&devtree_lock, flags); np->sibling = np->parent->child; np->allnext = allnodes; np->parent->child = np; allnodes = np; write_unlock_irqrestore(&devtree_lock, flags); } /** * of_detach_node - "Unplug" a node from the device tree. * * The caller must hold a reference to the node. The memory associated with * the node is not freed until its refcount goes to zero. */ void of_detach_node(struct device_node *np) { struct device_node *parent; unsigned long flags; write_lock_irqsave(&devtree_lock, flags); parent = np->parent; if (!parent) goto out_unlock; if (allnodes == np) allnodes = np->allnext; else { struct device_node *prev; for (prev = allnodes; prev->allnext != np; prev = prev->allnext) ; prev->allnext = np->allnext; } if (parent->child == np) parent->child = np->sibling; else { struct device_node *prevsib; for (prevsib = np->parent->child; prevsib->sibling != np; prevsib = prevsib->sibling) ; prevsib->sibling = np->sibling; } of_node_set_flag(np, OF_DETACHED); out_unlock: write_unlock_irqrestore(&devtree_lock, flags); } #endif /* defined(CONFIG_OF_DYNAMIC) */ |
611cad720 dt: add of_alias_... |
1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 |
static void of_alias_add(struct alias_prop *ap, struct device_node *np, int id, const char *stem, int stem_len) { ap->np = np; ap->id = id; strncpy(ap->stem, stem, stem_len); ap->stem[stem_len] = 0; list_add_tail(&ap->link, &aliases_lookup); pr_debug("adding DT alias:%s: stem=%s id=%i node=%s ", ap->alias, ap->stem, ap->id, np ? np->full_name : NULL); } /** * of_alias_scan - Scan all properties of 'aliases' node * * The function scans all the properties of 'aliases' node and populate * the the global lookup table with the properties. It returns the * number of alias_prop found, or error code in error case. * * @dt_alloc: An allocator that provides a virtual address to memory * for the resulting tree */ void of_alias_scan(void * (*dt_alloc)(u64 size, u64 align)) { struct property *pp; of_chosen = of_find_node_by_path("/chosen"); if (of_chosen == NULL) of_chosen = of_find_node_by_path("/chosen@0"); of_aliases = of_find_node_by_path("/aliases"); if (!of_aliases) return; |
8af0da93d dt: reform for_ea... |
1153 |
for_each_property_of_node(of_aliases, pp) { |
611cad720 dt: add of_alias_... |
1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 |
const char *start = pp->name; const char *end = start + strlen(start); struct device_node *np; struct alias_prop *ap; int id, len; /* Skip those we do not want to proceed */ if (!strcmp(pp->name, "name") || !strcmp(pp->name, "phandle") || !strcmp(pp->name, "linux,phandle")) continue; np = of_find_node_by_path(pp->value); if (!np) continue; /* walk the alias backwards to extract the id and work out * the 'stem' string */ while (isdigit(*(end-1)) && end > start) end--; len = end - start; if (kstrtoint(end, 10, &id) < 0) continue; /* Allocate an alias_prop with enough space for the stem */ ap = dt_alloc(sizeof(*ap) + len + 1, 4); if (!ap) continue; ap->alias = start; of_alias_add(ap, np, id, start, len); } } /** * of_alias_get_id - Get alias id for the given device_node * @np: Pointer to the given device_node * @stem: Alias stem of the given device_node * * The function travels the lookup table to get alias id for the given * device_node and alias stem. It returns the alias id if find it. */ int of_alias_get_id(struct device_node *np, const char *stem) { struct alias_prop *app; int id = -ENODEV; mutex_lock(&of_aliases_mutex); list_for_each_entry(app, &aliases_lookup, link) { if (strcmp(app->stem, stem) != 0) continue; if (np == app->np) { id = app->id; break; } } mutex_unlock(&of_aliases_mutex); return id; } EXPORT_SYMBOL_GPL(of_alias_get_id); |