diff options
| author | Grant Likely <grant.likely@linaro.org> | 2014-10-03 16:28:27 +0100 |
|---|---|---|
| committer | Grant Likely <grant.likely@linaro.org> | 2014-11-04 13:29:38 +0000 |
| commit | 5063e25a302e6a83f6590d9a06bd5f6400b17430 (patch) | |
| tree | bd6aafd28fb65ea19cd1535fd9a53263b42a68c0 /drivers/of/dynamic.c | |
| parent | e7a00e4210e4cc980e3ba67ec7301af54061d14b (diff) | |
| download | linux-stable-5063e25a302e6a83f6590d9a06bd5f6400b17430.tar.gz linux-stable-5063e25a302e6a83f6590d9a06bd5f6400b17430.tar.bz2 linux-stable-5063e25a302e6a83f6590d9a06bd5f6400b17430.zip | |
of: Eliminate of_allnodes list
The device tree structure is composed of two lists; the 'allnodes' list
which is a singly linked list containing every node in the tree, and the
child->parent structure where each parent node has a singly linked list
of children. All of the data in the allnodes list can be easily
reproduced with the parent-child lists, so of_allnodes is actually
unnecessary. Remove it entirely which saves a bit of memory and
simplifies the data structure quite a lot.
Signed-off-by: Grant Likely <grant.likely@linaro.org>
Cc: Rob Herring <robh@kernel.org>
Cc: Gaurav Minocha <gaurav.minocha.os@gmail.com>
Cc: Pantelis Antoniou <pantelis@pantelis.antoniou@konsulko.com>
Diffstat (limited to 'drivers/of/dynamic.c')
| -rw-r--r-- | drivers/of/dynamic.c | 13 |
1 files changed, 0 insertions, 13 deletions
diff --git a/drivers/of/dynamic.c b/drivers/of/dynamic.c index f297891d8529..da2509d639c8 100644 --- a/drivers/of/dynamic.c +++ b/drivers/of/dynamic.c @@ -117,8 +117,6 @@ void __of_attach_node(struct device_node *np) np->child = NULL; np->sibling = np->parent->child; - np->allnext = np->parent->allnext; - np->parent->allnext = np; np->parent->child = np; of_node_clear_flag(np, OF_DETACHED); } @@ -154,17 +152,6 @@ void __of_detach_node(struct device_node *np) if (WARN_ON(!parent)) return; - if (of_allnodes == np) - of_allnodes = np->allnext; - else { - struct device_node *prev; - for (prev = of_allnodes; - prev->allnext != np; - prev = prev->allnext) - ; - prev->allnext = np->allnext; - } - if (parent->child == np) parent->child = np->sibling; else { |