WebSVN – HelenOS – Diff – /tags/0.4.1/boot/genarch/ofw_tree.c


/*
 * Copyright (c) 2006 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <ofw_tree.h>
#include <ofw.h>
#include <types.h>
#include <string.h>
#include <balloc.h>
#include <asm.h>
 
#define MAX_PATH_LEN    256
 
static ofw_tree_node_t *ofw_tree_node_alloc(void)
{
    return balloc(sizeof(ofw_tree_node_t), sizeof(ofw_tree_node_t));
}
 
static ofw_tree_property_t *ofw_tree_properties_alloc(unsigned count)
{
    return balloc(count * sizeof(ofw_tree_property_t),
        sizeof(ofw_tree_property_t));
}
 
static void *ofw_tree_space_alloc(size_t size)
{
    char *addr;
 
    /*
     * What we do here is a nasty hack :-)
     * Problem: string property values that are allocated via this
     * function typically do not contain the trailing '\0'. This
     * is very uncomfortable for kernel, which is supposed to deal
     * with the properties.
     * Solution: when allocating space via this function, we always
     * allocate space for the extra '\0' character that we store
     * behind the requested memory.
     */
    addr = balloc(size + 1, size);
    if (addr)
        addr[size] = '\0';
    return addr;
}
 
/** Transfer information from one OpenFirmware node into its memory
 * representation.
 *
 * Transfer entire information from the OpenFirmware device tree 'current' node
 * to its memory representation in 'current_node'. This function recursively
 * processes all node's children. Node's peers are processed iteratively in
 * order to prevent stack from overflowing.
 *
 * @param current_node  Pointer to uninitialized ofw_tree_node structure that
 *          will become the memory represenation of 'current'.
 * @param parent_node   Parent ofw_tree_node structure or NULL in case of root
 *          node.
 * @param current   OpenFirmware phandle to the current device tree node.
 */
static void ofw_tree_node_process(ofw_tree_node_t *current_node,
    ofw_tree_node_t *parent_node, phandle current)
{
    static char path[MAX_PATH_LEN + 1];
    static char name[OFW_TREE_PROPERTY_MAX_NAMELEN];
    static char name2[OFW_TREE_PROPERTY_MAX_NAMELEN];
    phandle peer;
    phandle child;
    size_t len;
    int i;
 
    while (current_node) {
        /*
         * Initialize node.
         */
        current_node->parent = parent_node;
        current_node->peer = NULL;
        current_node->child = NULL;
        current_node->node_handle = current;
        current_node->properties = 0;
        current_node->property = NULL;
        current_node->device = NULL;
   
        /*
         * Get the disambigued name.
         */
        len = ofw_package_to_path(current, path, MAX_PATH_LEN);
        if (len == -1)
            return;
   
        path[len] = '\0';
        for (i = len - 1; i >= 0 && path[i] != '/'; i--)
            ;
        i++;    /* do not include '/' */
   
        len -= i;
 
        /* add space for trailing '\0' */
        current_node->da_name = ofw_tree_space_alloc(len + 1);
        if (!current_node->da_name)
            return;
   
        memcpy(current_node->da_name, &path[i], len);
        current_node->da_name[len] = '\0';
   
        /*
         * Recursively process the potential child node.
         */
        child = ofw_get_child_node(current);
        if (child != 0 && child != -1) {
            ofw_tree_node_t *child_node;
       
            child_node = ofw_tree_node_alloc();
            if (child_node) {
                ofw_tree_node_process(child_node, current_node,
                    child);
                current_node->child = child_node;
            }
        }
   
        /*
         * Count properties.
         */
        name[0] = '\0';
        while (ofw_next_property(current, name, name2) == 1) {
            current_node->properties++;
            memcpy(name, name2, OFW_TREE_PROPERTY_MAX_NAMELEN);
        }
 
        if (!current_node->properties)
            return;
   
        /*
         * Copy properties.
         */
        current_node->property =
            ofw_tree_properties_alloc(current_node->properties);
        if (!current_node->property)
            return;
       
        name[0] = '\0';
        for (i = 0; ofw_next_property(current, name, name2) == 1; i++) {
            size_t size;
       
            if (i == current_node->properties)
                break;
       
            memcpy(name, name2, OFW_TREE_PROPERTY_MAX_NAMELEN);
            memcpy(current_node->property[i].name, name,
                OFW_TREE_PROPERTY_MAX_NAMELEN);
            current_node->property[i].name[
                OFW_TREE_PROPERTY_MAX_NAMELEN] = '\0';
 
            size = ofw_get_proplen(current, name);
            current_node->property[i].size = size;
            if (size) {
                void *buf;
           
                buf = ofw_tree_space_alloc(size);
                if (current_node->property[i].value = buf) {
                    /*
                     * Copy property value to memory node.
                     */
                    (void) ofw_get_property(current, name,
                        buf, size);
                }
            } else {
                current_node->property[i].value = NULL;
            }
        }
 
        /* Just in case we ran out of memory. */
        current_node->properties = i;
 
        /*
         * Iteratively process the next peer node.
         * Note that recursion is a bad idea here.
         * Due to the topology of the OpenFirmware device tree,
         * the nesting of peer nodes could be to wide and the
         * risk of overflowing the stack is too real.
         */
        peer = ofw_get_peer_node(current);
        if (peer != 0 && peer != -1) {
            ofw_tree_node_t *peer_node;
       
            peer_node = ofw_tree_node_alloc();
            if (peer_node) {
                current_node->peer = peer_node;
                current_node = peer_node;
                current = peer;
                /*
                 * Process the peer in next iteration.
                 */
                continue;
            }
        }
        /*
         * No more peers on this level.
         */
        break;
    }
}
 
/** Construct memory representation of OpenFirmware device tree.
 *
 * @return      NULL on failure or pointer to the root node.
 */
ofw_tree_node_t *ofw_tree_build(void)
{
    ofw_tree_node_t *root;
    phandle ssm_node;
    ofw_tree_node_t *ssm;
   
    root = ofw_tree_node_alloc();
    if (root)
        ofw_tree_node_process(root, NULL, ofw_root);
 
    /*
     * The firmware client interface does not automatically include the
     * "ssm" node in the list of children of "/". A nasty yet working
     * solution is to explicitly stick "ssm" to the OFW tree.
     */
    ssm_node = ofw_find_device("/ssm@0,0");
    if (ssm_node != -1) {
        ssm = ofw_tree_node_alloc();
        if (ssm) {
            ofw_tree_node_process(ssm, root,
                ofw_find_device("/ssm@0,0"));
            ssm->peer = root->child;
            root->child = ssm;
        }
    }
   
    return root;
}
 

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

Subversion Repositories HelenOS

(root)/tags/0.4.1/boot/genarch/ofw_tree.c – Rev 3797 → 4687