source: mainline/boot/genarch/ofw_tree.c@ 34bd143

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 34bd143 was 34bd143, checked in by Jakub Jermar <jakub@…>, 19 years ago

Add node handle to in-memory ofw tree node.
This is essential for interrupt mapping on sparc64
and perhaps on other platforms that have OpenFirmware.

  • Property mode set to 100644
File size: 5.9 KB
Line 
1/*
2 * Copyright (C) 2006 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
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
15 * derived from this software without specific prior written permission.
16 *
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include <ofw_tree.h>
30#include <ofw.h>
31#include <types.h>
32#include <string.h>
33#include <balloc.h>
34#include <asm.h>
35
36#define MAX_PATH_LEN 256
37
38static ofw_tree_node_t *ofw_tree_node_alloc(void)
39{
40 return balloc(sizeof(ofw_tree_node_t), sizeof(ofw_tree_node_t));
41}
42
43static ofw_tree_property_t *ofw_tree_properties_alloc(unsigned count)
44{
45 return balloc(count * sizeof(ofw_tree_property_t), sizeof(ofw_tree_property_t));
46}
47
48static void * ofw_tree_space_alloc(size_t size)
49{
50 char *addr;
51
52 /*
53 * What we do here is a nasty hack :-)
54 * Problem: string property values that are allocated via this
55 * function typically do not contain the trailing '\0'. This
56 * is very uncomfortable for kernel, which is supposed to deal
57 * with the properties.
58 * Solution: when allocating space via this function, we always
59 * allocate space for the extra '\0' character that we store
60 * behind the requested memory.
61 */
62 addr = balloc(size + 1, size);
63 if (addr)
64 addr[size] = '\0';
65 return addr;
66}
67
68/** Transfer information from one OpenFirmware node into its memory representation.
69 *
70 * Transfer entire information from the OpenFirmware device tree 'current' node to
71 * its memory representation in 'current_node'. This function recursively processes
72 * all node's peers and children.
73 *
74 * @param current_node Pointer to uninitialized ofw_tree_node structure that will
75 * become the memory represenation of 'current'.
76 * @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 */
79static void ofw_tree_node_process(ofw_tree_node_t *current_node,
80 ofw_tree_node_t *parent_node, phandle current)
81{
82 static char path[MAX_PATH_LEN+1];
83 static char name[OFW_TREE_PROPERTY_MAX_NAMELEN];
84 phandle peer;
85 phandle child;
86 unsigned properties = 0;
87 size_t len;
88 int i;
89
90 /*
91 * Initialize node.
92 */
93 current_node->parent = parent_node;
94 current_node->peer = NULL;
95 current_node->child = NULL;
96 current_node->node_handle = current;
97 current_node->properties = 0;
98 current_node->property = NULL;
99
100 /*
101 * Get the disambigued name.
102 */
103 len = ofw_package_to_path(current, path, MAX_PATH_LEN);
104 if (len == -1)
105 return;
106
107 path[len] = '\0';
108 for (i = len - 1; i >= 0 && path[i] != '/'; i--)
109 ;
110 i++; /* do not include '/' */
111
112 len -= i;
113 current_node->da_name = ofw_tree_space_alloc(len + 1); /* add space for trailing '\0' */
114 if (!current_node->da_name)
115 return;
116
117 memcpy(current_node->da_name, &path[i], len);
118 current_node->da_name[len] = '\0';
119
120 /*
121 * Recursively process the potential peer node.
122 */
123 peer = ofw_get_peer_node(current);
124 if (peer != 0 && peer != -1) {
125 ofw_tree_node_t *peer_node;
126
127 peer_node = ofw_tree_node_alloc();
128 if (peer_node) {
129 ofw_tree_node_process(peer_node, parent_node, peer);
130 current_node->peer = peer_node;
131 }
132 }
133
134 /*
135 * Recursively process the potential child node.
136 */
137 child = ofw_get_child_node(current);
138 if (child != 0 && child != -1) {
139 ofw_tree_node_t *child_node;
140
141 child_node = ofw_tree_node_alloc();
142 if (child_node) {
143 ofw_tree_node_process(child_node, current_node, child);
144 current_node->child = child_node;
145 }
146 }
147
148 /*
149 * Count properties.
150 */
151 name[0] = '\0';
152 while (ofw_next_property(current, name, name) == 1)
153 current_node->properties++;
154
155 if (!current_node->properties)
156 return;
157
158 /*
159 * Copy properties.
160 */
161 current_node->property = ofw_tree_properties_alloc(current_node->properties);
162 if (!current_node->property)
163 return;
164
165 name[0] = '\0';
166 for (i = 0; ofw_next_property(current, name, name) == 1; i++) {
167 size_t size;
168
169 if (i == current_node->properties)
170 break;
171
172 memcpy(current_node->property[i].name, name, OFW_TREE_PROPERTY_MAX_NAMELEN);
173 current_node->property[i].name[OFW_TREE_PROPERTY_MAX_NAMELEN] = '\0';
174
175 size = ofw_get_proplen(current, name);
176 current_node->property[i].size = size;
177 if (size) {
178 void *buf;
179
180 buf = ofw_tree_space_alloc(size);
181 if (current_node->property[i].value = buf) {
182 /*
183 * Copy property value to memory node.
184 */
185 (void) ofw_get_property(current, name, buf, size);
186 }
187 } else {
188 current_node->property[i].value = NULL;
189 }
190 }
191
192 current_node->properties = i; /* Just in case we ran out of memory. */
193}
194
195/** Construct memory representation of OpenFirmware device tree.
196 *
197 * @return NULL on failure or pointer to the root node.
198 */
199ofw_tree_node_t *ofw_tree_build(void)
200{
201 ofw_tree_node_t *root;
202
203 root = ofw_tree_node_alloc();
204 if (root)
205 ofw_tree_node_process(root, NULL, ofw_root);
206
207 return root;
208}
Note: See TracBrowser for help on using the repository browser.