Rev 1909 | Rev 2071 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1909 | Rev 1973 | ||
---|---|---|---|
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 | #include <ofw_tree.h> |
29 | #include <ofw_tree.h> |
30 | #include <ofw.h> |
30 | #include <ofw.h> |
31 | #include <types.h> |
31 | #include <types.h> |
32 | #include <string.h> |
32 | #include <string.h> |
33 | #include <balloc.h> |
33 | #include <balloc.h> |
34 | #include <asm.h> |
34 | #include <asm.h> |
35 | 35 | ||
36 | #define MAX_PATH_LEN 256 |
36 | #define MAX_PATH_LEN 256 |
37 | 37 | ||
38 | static ofw_tree_node_t *ofw_tree_node_alloc(void) |
38 | static ofw_tree_node_t *ofw_tree_node_alloc(void) |
39 | { |
39 | { |
40 | return balloc(sizeof(ofw_tree_node_t), sizeof(ofw_tree_node_t)); |
40 | return balloc(sizeof(ofw_tree_node_t), sizeof(ofw_tree_node_t)); |
41 | } |
41 | } |
42 | 42 | ||
43 | static ofw_tree_property_t *ofw_tree_properties_alloc(unsigned count) |
43 | static ofw_tree_property_t *ofw_tree_properties_alloc(unsigned count) |
44 | { |
44 | { |
45 | return balloc(count * sizeof(ofw_tree_property_t), sizeof(ofw_tree_property_t)); |
45 | return balloc(count * sizeof(ofw_tree_property_t), sizeof(ofw_tree_property_t)); |
46 | } |
46 | } |
47 | 47 | ||
48 | static void * ofw_tree_space_alloc(size_t size) |
48 | static void * ofw_tree_space_alloc(size_t size) |
49 | { |
49 | { |
50 | char *addr; |
50 | char *addr; |
51 | 51 | ||
52 | /* |
52 | /* |
53 | * What we do here is a nasty hack :-) |
53 | * What we do here is a nasty hack :-) |
54 | * Problem: string property values that are allocated via this |
54 | * Problem: string property values that are allocated via this |
55 | * function typically do not contain the trailing '\0'. This |
55 | * function typically do not contain the trailing '\0'. This |
56 | * is very uncomfortable for kernel, which is supposed to deal |
56 | * is very uncomfortable for kernel, which is supposed to deal |
57 | * with the properties. |
57 | * with the properties. |
58 | * Solution: when allocating space via this function, we always |
58 | * Solution: when allocating space via this function, we always |
59 | * allocate space for the extra '\0' character that we store |
59 | * allocate space for the extra '\0' character that we store |
60 | * behind the requested memory. |
60 | * behind the requested memory. |
61 | */ |
61 | */ |
62 | addr = balloc(size + 1, size); |
62 | addr = balloc(size + 1, size); |
63 | if (addr) |
63 | if (addr) |
64 | addr[size] = '\0'; |
64 | addr[size] = '\0'; |
65 | return addr; |
65 | return addr; |
66 | } |
66 | } |
67 | 67 | ||
68 | /** Transfer information from one OpenFirmware node into its memory representation. |
68 | /** Transfer information from one OpenFirmware node into its memory representation. |
69 | * |
69 | * |
70 | * Transfer entire information from the OpenFirmware device tree 'current' node to |
70 | * Transfer entire information from the OpenFirmware device tree 'current' node to |
71 | * its memory representation in 'current_node'. This function recursively processes |
71 | * its memory representation in 'current_node'. This function recursively processes |
- | 72 | * all node's children. Node's peers are processed iteratively in order to prevent |
|
72 | * all node's peers and children. |
73 | * stack from overflowing. |
73 | * |
74 | * |
74 | * @param current_node Pointer to uninitialized ofw_tree_node structure that will |
75 | * @param current_node Pointer to uninitialized ofw_tree_node structure that will |
75 | * become the memory represenation of 'current'. |
76 | * become the memory represenation of 'current'. |
76 | * @param parent_node Parent ofw_tree_node structure or NULL in case of root node. |
77 | * @param parent_node Parent ofw_tree_node structure or NULL in case of root node. |
77 | * @param current OpenFirmware phandle to the current device tree node. |
78 | * @param current OpenFirmware phandle to the current device tree node. |
78 | */ |
79 | */ |
79 | static void ofw_tree_node_process(ofw_tree_node_t *current_node, |
80 | static void ofw_tree_node_process(ofw_tree_node_t *current_node, |
80 | ofw_tree_node_t *parent_node, phandle current) |
81 | ofw_tree_node_t *parent_node, phandle current) |
81 | { |
82 | { |
82 | static char path[MAX_PATH_LEN+1]; |
83 | static char path[MAX_PATH_LEN+1]; |
83 | static char name[OFW_TREE_PROPERTY_MAX_NAMELEN]; |
84 | static char name[OFW_TREE_PROPERTY_MAX_NAMELEN]; |
84 | phandle peer; |
85 | phandle peer; |
85 | phandle child; |
86 | phandle child; |
86 | unsigned properties = 0; |
- | |
87 | size_t len; |
87 | size_t len; |
88 | int i; |
88 | int i; |
89 | 89 | ||
- | 90 | while (current_node) { |
|
90 | /* |
91 | /* |
91 | * Initialize node. |
92 | * Initialize node. |
92 | */ |
93 | */ |
93 | current_node->parent = parent_node; |
94 | current_node->parent = parent_node; |
94 | current_node->peer = NULL; |
95 | current_node->peer = NULL; |
95 | current_node->child = NULL; |
96 | current_node->child = NULL; |
96 | current_node->node_handle = current; |
97 | current_node->node_handle = current; |
97 | current_node->properties = 0; |
98 | current_node->properties = 0; |
98 | current_node->property = NULL; |
99 | current_node->property = NULL; |
99 | current_node->device = NULL; |
100 | current_node->device = NULL; |
100 | 101 | ||
101 | /* |
102 | /* |
102 | * Get the disambigued name. |
103 | * Get the disambigued name. |
103 | */ |
104 | */ |
104 | len = ofw_package_to_path(current, path, MAX_PATH_LEN); |
105 | len = ofw_package_to_path(current, path, MAX_PATH_LEN); |
105 | if (len == -1) |
106 | if (len == -1) |
106 | return; |
107 | return; |
107 | 108 | ||
108 | path[len] = '\0'; |
109 | path[len] = '\0'; |
109 | for (i = len - 1; i >= 0 && path[i] != '/'; i--) |
110 | for (i = len - 1; i >= 0 && path[i] != '/'; i--) |
110 | ; |
111 | ; |
111 | i++; /* do not include '/' */ |
112 | i++; /* do not include '/' */ |
112 | - | ||
113 | len -= i; |
- | |
114 | current_node->da_name = ofw_tree_space_alloc(len + 1); /* add space for trailing '\0' */ |
- | |
115 | if (!current_node->da_name) |
- | |
116 | return; |
- | |
117 | - | ||
118 | memcpy(current_node->da_name, &path[i], len); |
- | |
119 | current_node->da_name[len] = '\0'; |
- | |
120 | - | ||
121 | /* |
- | |
122 | * Recursively process the potential peer node. |
- | |
123 | */ |
- | |
124 | peer = ofw_get_peer_node(current); |
- | |
125 | if (peer != 0 && peer != -1) { |
- | |
126 | ofw_tree_node_t *peer_node; |
- | |
127 | - | ||
128 | peer_node = ofw_tree_node_alloc(); |
- | |
129 | if (peer_node) { |
- | |
130 | ofw_tree_node_process(peer_node, parent_node, peer); |
- | |
131 | current_node->peer = peer_node; |
- | |
132 | } |
- | |
133 | } |
- | |
134 | 113 | ||
- | 114 | len -= i; |
|
- | 115 | ||
- | 116 | /* add space for trailing '\0' */ |
|
- | 117 | current_node->da_name = ofw_tree_space_alloc(len + 1); |
|
- | 118 | if (!current_node->da_name) |
|
- | 119 | return; |
|
- | 120 | ||
- | 121 | memcpy(current_node->da_name, &path[i], len); |
|
- | 122 | current_node->da_name[len] = '\0'; |
|
- | 123 | ||
- | 124 | ||
135 | /* |
125 | /* |
136 | * Recursively process the potential child node. |
126 | * Recursively process the potential child node. |
137 | */ |
127 | */ |
138 | child = ofw_get_child_node(current); |
128 | child = ofw_get_child_node(current); |
139 | if (child != 0 && child != -1) { |
129 | if (child != 0 && child != -1) { |
140 | ofw_tree_node_t *child_node; |
130 | ofw_tree_node_t *child_node; |
141 | 131 | ||
142 | child_node = ofw_tree_node_alloc(); |
132 | child_node = ofw_tree_node_alloc(); |
143 | if (child_node) { |
133 | if (child_node) { |
144 | ofw_tree_node_process(child_node, current_node, child); |
134 | ofw_tree_node_process(child_node, current_node, child); |
145 | current_node->child = child_node; |
135 | current_node->child = child_node; |
- | 136 | } |
|
146 | } |
137 | } |
147 | } |
- | |
148 | 138 | ||
149 | /* |
139 | /* |
150 | * Count properties. |
140 | * Count properties. |
151 | */ |
141 | */ |
152 | name[0] = '\0'; |
142 | name[0] = '\0'; |
153 | while (ofw_next_property(current, name, name) == 1) |
143 | while (ofw_next_property(current, name, name) == 1) |
154 | current_node->properties++; |
144 | current_node->properties++; |
155 | 145 | ||
156 | if (!current_node->properties) |
146 | if (!current_node->properties) |
157 | return; |
147 | return; |
158 | 148 | ||
159 | /* |
149 | /* |
160 | * Copy properties. |
150 | * Copy properties. |
161 | */ |
151 | */ |
162 | current_node->property = ofw_tree_properties_alloc(current_node->properties); |
152 | current_node->property = ofw_tree_properties_alloc(current_node->properties); |
163 | if (!current_node->property) |
153 | if (!current_node->property) |
164 | return; |
154 | return; |
165 | 155 | ||
166 | name[0] = '\0'; |
156 | name[0] = '\0'; |
167 | for (i = 0; ofw_next_property(current, name, name) == 1; i++) { |
157 | for (i = 0; ofw_next_property(current, name, name) == 1; i++) { |
168 | size_t size; |
158 | size_t size; |
169 | 159 | ||
170 | if (i == current_node->properties) |
160 | if (i == current_node->properties) |
171 | break; |
161 | break; |
172 | 162 | ||
173 | memcpy(current_node->property[i].name, name, OFW_TREE_PROPERTY_MAX_NAMELEN); |
163 | memcpy(current_node->property[i].name, name, |
- | 164 | OFW_TREE_PROPERTY_MAX_NAMELEN); |
|
174 | current_node->property[i].name[OFW_TREE_PROPERTY_MAX_NAMELEN] = '\0'; |
165 | current_node->property[i].name[OFW_TREE_PROPERTY_MAX_NAMELEN] = '\0'; |
175 | 166 | ||
176 | size = ofw_get_proplen(current, name); |
167 | size = ofw_get_proplen(current, name); |
177 | current_node->property[i].size = size; |
168 | current_node->property[i].size = size; |
178 | if (size) { |
169 | if (size) { |
179 | void *buf; |
170 | void *buf; |
180 | 171 | ||
181 | buf = ofw_tree_space_alloc(size); |
172 | buf = ofw_tree_space_alloc(size); |
182 | if (current_node->property[i].value = buf) { |
173 | if (current_node->property[i].value = buf) { |
- | 174 | /* |
|
- | 175 | * Copy property value to memory node. |
|
- | 176 | */ |
|
- | 177 | (void) ofw_get_property(current, name, buf, size); |
|
- | 178 | } |
|
- | 179 | } else { |
|
- | 180 | current_node->property[i].value = NULL; |
|
- | 181 | } |
|
- | 182 | } |
|
- | 183 | ||
- | 184 | current_node->properties = i; /* Just in case we ran out of memory. */ |
|
- | 185 | ||
- | 186 | /* |
|
- | 187 | * Iteratively process the next peer node. |
|
- | 188 | * Note that recursion is a bad idea here. |
|
- | 189 | * Due to the topology of the OpenFirmware device tree, |
|
- | 190 | * the nesting of peer nodes could be to wide and the |
|
- | 191 | * risk of overflowing the stack is too real. |
|
- | 192 | */ |
|
- | 193 | peer = ofw_get_peer_node(current); |
|
- | 194 | if (peer != 0 && peer != -1) { |
|
- | 195 | ofw_tree_node_t *peer_node; |
|
- | 196 | ||
- | 197 | peer_node = ofw_tree_node_alloc(); |
|
- | 198 | if (peer_node) { |
|
- | 199 | current_node->peer = peer_node; |
|
- | 200 | current_node = peer_node; |
|
- | 201 | current = peer; |
|
183 | /* |
202 | /* |
184 | * Copy property value to memory node. |
203 | * Process the peer in next iteration. |
185 | */ |
204 | */ |
186 | (void) ofw_get_property(current, name, buf, size); |
205 | continue; |
187 | } |
206 | } |
188 | } else { |
- | |
189 | current_node->property[i].value = NULL; |
- | |
190 | } |
207 | } |
- | 208 | /* |
|
- | 209 | * No more peers on this level. |
|
- | 210 | */ |
|
- | 211 | break; |
|
191 | } |
212 | } |
192 | - | ||
193 | current_node->properties = i; /* Just in case we ran out of memory. */ |
- | |
194 | } |
213 | } |
195 | 214 | ||
196 | /** Construct memory representation of OpenFirmware device tree. |
215 | /** Construct memory representation of OpenFirmware device tree. |
197 | * |
216 | * |
198 | * @return NULL on failure or pointer to the root node. |
217 | * @return NULL on failure or pointer to the root node. |
199 | */ |
218 | */ |
200 | ofw_tree_node_t *ofw_tree_build(void) |
219 | ofw_tree_node_t *ofw_tree_build(void) |
201 | { |
220 | { |
202 | ofw_tree_node_t *root; |
221 | ofw_tree_node_t *root; |
203 | 222 | ||
204 | root = ofw_tree_node_alloc(); |
223 | root = ofw_tree_node_alloc(); |
205 | if (root) |
224 | if (root) |
206 | ofw_tree_node_process(root, NULL, ofw_root); |
225 | ofw_tree_node_process(root, NULL, ofw_root); |
207 | 226 | ||
208 | return root; |
227 | return root; |
209 | } |
228 | } |
210 | 229 |