Rev 1895 | Rev 1899 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1895 | Rev 1896 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2006 Jakub Jermar |
2 | * Copyright (C) 2006 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup ofw |
29 | /** @addtogroup ofw |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** |
32 | /** |
33 | * @file |
33 | * @file |
34 | * @brief OpenFirmware device tree navigation. |
34 | * @brief OpenFirmware device tree navigation. |
35 | * |
35 | * |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <genarch/ofw/ofw_tree.h> |
38 | #include <genarch/ofw/ofw_tree.h> |
39 | #include <arch/memstr.h> |
39 | #include <arch/memstr.h> |
40 | #include <func.h> |
40 | #include <func.h> |
41 | #include <print.h> |
41 | #include <print.h> |
42 | #include <panic.h> |
42 | #include <panic.h> |
43 | 43 | ||
44 | #define PATH_MAX_LEN 80 |
44 | #define PATH_MAX_LEN 80 |
45 | #define NAME_BUF_LEN 50 |
45 | #define NAME_BUF_LEN 50 |
46 | 46 | ||
47 | static ofw_tree_node_t *ofw_root; |
47 | static ofw_tree_node_t *ofw_root; |
48 | 48 | ||
49 | void ofw_tree_init(ofw_tree_node_t *root) |
49 | void ofw_tree_init(ofw_tree_node_t *root) |
50 | { |
50 | { |
51 | ofw_root = root; |
51 | ofw_root = root; |
52 | } |
52 | } |
53 | 53 | ||
- | 54 | /** Get OpenFirmware node property. |
|
- | 55 | * |
|
- | 56 | * @param node Node in which to lookup the property. |
|
- | 57 | * @param name Name of the property. |
|
- | 58 | * |
|
- | 59 | * @return Pointer to the property structure or NULL if no such property. |
|
- | 60 | */ |
|
- | 61 | ofw_tree_property_t *ofw_tree_getprop(const ofw_tree_node_t *node, const char *name) |
|
- | 62 | { |
|
- | 63 | int i; |
|
- | 64 | ||
- | 65 | for (i = 0; i < node->properties; i++) { |
|
- | 66 | if (strcmp(node->property[i].name, name) == 0) |
|
- | 67 | return &node->property[i]; |
|
- | 68 | } |
|
- | 69 | ||
- | 70 | return NULL; |
|
- | 71 | } |
|
- | 72 | ||
54 | /** Return value of the 'name' property. |
73 | /** Return value of the 'name' property. |
55 | * |
74 | * |
56 | * @param node Node of interest. |
75 | * @param node Node of interest. |
57 | * |
76 | * |
58 | * @return Value of the 'name' property belonging to the node. |
77 | * @return Value of the 'name' property belonging to the node. |
59 | */ |
78 | */ |
60 | const char *ofw_tree_node_name(const ofw_tree_node_t *node) |
79 | const char *ofw_tree_node_name(const ofw_tree_node_t *node) |
61 | { |
80 | { |
62 | int i; |
81 | ofw_tree_property_t *prop; |
63 | 82 | ||
64 | for (i = 0; i < node->properties; i++) { |
83 | prop = ofw_tree_getprop(node, "name"); |
65 | if (strncmp(node->property[i].name, "name", strlen("name")) == 0) { |
- | |
66 | if (node->property[i].size < 2) |
84 | if (!prop) |
67 | panic("Invalid name property.\n"); |
85 | panic("Node without name property.\n"); |
68 | return node->property[i].value; |
- | |
69 | } |
86 | |
70 | } |
87 | if (prop->size < 2) |
- | 88 | panic("Invalid name property.\n"); |
|
71 | 89 | ||
72 | panic("Node without name property.\n"); |
90 | return prop->value; |
73 | } |
91 | } |
74 | 92 | ||
75 | /** Lookup child of given name. |
93 | /** Lookup child of given name. |
76 | * |
94 | * |
77 | * @param node Node whose child is being looked up. |
95 | * @param node Node whose child is being looked up. |
78 | * @param da_name Disambigued name of the child being looked up. |
96 | * @param name Name of the child being looked up. |
79 | * |
97 | * |
80 | * @return NULL if there is no such child or pointer to the matching child node. |
98 | * @return NULL if there is no such child or pointer to the matching child node. |
81 | */ |
99 | */ |
82 | static ofw_tree_node_t *ofw_tree_find_child(ofw_tree_node_t *node, const char *da_name) |
100 | static ofw_tree_node_t *ofw_tree_find_child(ofw_tree_node_t *node, const char *name) |
83 | { |
101 | { |
84 | ofw_tree_node_t *cur; |
102 | ofw_tree_node_t *cur; |
85 | 103 | ||
- | 104 | /* |
|
- | 105 | * Try to find the disambigued name. |
|
- | 106 | */ |
|
86 | for (cur = node->child; cur; cur = cur->peer) { |
107 | for (cur = node->child; cur; cur = cur->peer) { |
87 | if (strncmp(cur->da_name, da_name, strlen(da_name)) == 0) |
108 | if (strcmp(cur->da_name, name) == 0) |
88 | return cur; |
109 | return cur; |
89 | } |
110 | } |
90 | 111 | ||
- | 112 | /* |
|
- | 113 | * Disambigued name not found. |
|
- | 114 | * Lets try our luck with possibly ambiguous "name" property. |
|
- | 115 | * |
|
- | 116 | * We need to do this because paths stored in "/aliases" |
|
- | 117 | * are not always fully-qualified. |
|
- | 118 | */ |
|
- | 119 | for (cur = node->child; cur; cur = cur->peer) { |
|
- | 120 | if (strcmp(ofw_tree_node_name(cur), name) == 0) |
|
- | 121 | return cur; |
|
- | 122 | } |
|
- | 123 | ||
91 | return NULL; |
124 | return NULL; |
92 | } |
125 | } |
93 | 126 | ||
94 | /** Lookup OpenFirmware node by its path. |
127 | /** Lookup OpenFirmware node by its path. |
95 | * |
128 | * |
96 | * @param path Path to the node. |
129 | * @param path Path to the node. |
97 | * |
130 | * |
98 | * @return NULL if there is no such node or pointer to the leaf node. |
131 | * @return NULL if there is no such node or pointer to the leaf node. |
99 | */ |
132 | */ |
100 | ofw_tree_node_t *ofw_tree_lookup(const char *path) |
133 | ofw_tree_node_t *ofw_tree_lookup(const char *path) |
101 | { |
134 | { |
102 | char buf[NAME_BUF_LEN+1]; |
135 | char buf[NAME_BUF_LEN+1]; |
103 | ofw_tree_node_t *node = ofw_root; |
136 | ofw_tree_node_t *node = ofw_root; |
104 | index_t i, j; |
137 | index_t i, j; |
105 | 138 | ||
106 | if (path[0] != '/') |
139 | if (path[0] != '/') |
107 | return NULL; |
140 | return NULL; |
108 | 141 | ||
109 | for (i = 1; i < strlen(path) && node; i = j + 1) { |
142 | for (i = 1; i < strlen(path) && node; i = j + 1) { |
110 | for (j = i; j < strlen(path) && path[j] != '/'; j++) |
143 | for (j = i; j < strlen(path) && path[j] != '/'; j++) |
111 | ; |
144 | ; |
112 | if (i == j) /* skip extra slashes */ |
145 | if (i == j) /* skip extra slashes */ |
113 | continue; |
146 | continue; |
114 | 147 | ||
115 | memcpy(buf, &path[i], j - i); |
148 | memcpy(buf, &path[i], j - i); |
116 | buf[j - i] = '\0'; |
149 | buf[j - i] = '\0'; |
117 | node = ofw_tree_find_child(node, buf); |
150 | node = ofw_tree_find_child(node, buf); |
118 | } |
151 | } |
119 | 152 | ||
120 | return node; |
153 | return node; |
121 | } |
154 | } |
122 | 155 | ||
123 | /** Recursively print subtree rooted in a node. |
156 | /** Recursively print subtree rooted in a node. |
124 | * |
157 | * |
125 | * @param node Root of the subtree. |
158 | * @param node Root of the subtree. |
126 | * @param path Current path, NULL for the very root of the entire tree. |
159 | * @param path Current path, NULL for the very root of the entire tree. |
127 | */ |
160 | */ |
128 | static void ofw_tree_node_print(const ofw_tree_node_t *node, const char *path) |
161 | static void ofw_tree_node_print(const ofw_tree_node_t *node, const char *path) |
129 | { |
162 | { |
130 | char p[PATH_MAX_LEN]; |
163 | char p[PATH_MAX_LEN]; |
131 | 164 | ||
132 | if (node->parent) { |
165 | if (node->parent) { |
133 | snprintf(p, PATH_MAX_LEN, "%s/%s", path, node->da_name); |
166 | snprintf(p, PATH_MAX_LEN, "%s/%s", path, node->da_name); |
134 | printf("%s\n", p); |
167 | printf("%s\n", p); |
135 | } else { |
168 | } else { |
136 | snprintf(p, PATH_MAX_LEN, "%s", node->da_name); |
169 | snprintf(p, PATH_MAX_LEN, "%s", node->da_name); |
137 | printf("/\n"); |
170 | printf("/\n"); |
138 | } |
171 | } |
139 | 172 | ||
140 | if (node->child) |
173 | if (node->child) |
141 | ofw_tree_node_print(node->child, p); |
174 | ofw_tree_node_print(node->child, p); |
142 | 175 | ||
143 | if (node->peer) |
176 | if (node->peer) |
144 | ofw_tree_node_print(node->peer, path); |
177 | ofw_tree_node_print(node->peer, path); |
145 | } |
178 | } |
146 | 179 | ||
147 | /** Print the structure of the OpenFirmware device tree. */ |
180 | /** Print the structure of the OpenFirmware device tree. */ |
148 | void ofw_tree_print(void) |
181 | void ofw_tree_print(void) |
149 | { |
182 | { |
150 | ofw_tree_node_print(ofw_root, NULL); |
183 | ofw_tree_node_print(ofw_root, NULL); |
151 | } |
184 | } |
152 | 185 | ||
153 | /** @} |
186 | /** @} |
154 | */ |
187 | */ |
155 | 188 |