of/promtree: no longer call prom_ functions directly; use an ops structure
[linux-2.6/libata-dev.git] / drivers / of / pdt.c
blobfd02fc1dd891e3b2c2e02704867f3fc274fc71d9
1 /* pdt.c: OF PROM device tree support code.
3 * Paul Mackerras August 1996.
4 * Copyright (C) 1996-2005 Paul Mackerras.
6 * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner.
7 * {engebret|bergner}@us.ibm.com
9 * Adapted for sparc by David S. Miller davem@davemloft.net
10 * Adapted for multiple architectures by Andres Salomon <dilinger@queued.net>
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation; either version
15 * 2 of the License, or (at your option) any later version.
18 #include <linux/kernel.h>
19 #include <linux/module.h>
20 #include <linux/errno.h>
21 #include <linux/mutex.h>
22 #include <linux/slab.h>
23 #include <linux/of.h>
24 #include <linux/of_pdt.h>
25 #include <asm/prom.h>
27 static struct of_pdt_ops *of_pdt_prom_ops __initdata;
29 void __initdata (*prom_build_more)(struct device_node *dp,
30 struct device_node ***nextp);
32 #if defined(CONFIG_SPARC)
33 unsigned int of_pdt_unique_id __initdata;
35 #define of_pdt_incr_unique_id(p) do { \
36 (p)->unique_id = of_pdt_unique_id++; \
37 } while (0)
39 static inline const char *of_pdt_node_name(struct device_node *dp)
41 return dp->path_component_name;
44 #else
46 static inline void of_pdt_incr_unique_id(void *p) { }
47 static inline void irq_trans_init(struct device_node *dp) { }
49 static inline const char *of_pdt_node_name(struct device_node *dp)
51 return dp->name;
54 #endif /* !CONFIG_SPARC */
56 static struct property * __init build_one_prop(phandle node, char *prev,
57 char *special_name,
58 void *special_val,
59 int special_len)
61 static struct property *tmp = NULL;
62 struct property *p;
63 int err;
65 if (tmp) {
66 p = tmp;
67 memset(p, 0, sizeof(*p) + 32);
68 tmp = NULL;
69 } else {
70 p = prom_early_alloc(sizeof(struct property) + 32);
71 of_pdt_incr_unique_id(p);
74 p->name = (char *) (p + 1);
75 if (special_name) {
76 strcpy(p->name, special_name);
77 p->length = special_len;
78 p->value = prom_early_alloc(special_len);
79 memcpy(p->value, special_val, special_len);
80 } else {
81 err = of_pdt_prom_ops->nextprop(node, prev, p->name);
82 if (err) {
83 tmp = p;
84 return NULL;
86 p->length = of_pdt_prom_ops->getproplen(node, p->name);
87 if (p->length <= 0) {
88 p->length = 0;
89 } else {
90 int len;
92 p->value = prom_early_alloc(p->length + 1);
93 len = of_pdt_prom_ops->getproperty(node, p->name,
94 p->value, p->length);
95 if (len <= 0)
96 p->length = 0;
97 ((unsigned char *)p->value)[p->length] = '\0';
100 return p;
103 static struct property * __init build_prop_list(phandle node)
105 struct property *head, *tail;
107 head = tail = build_one_prop(node, NULL,
108 ".node", &node, sizeof(node));
110 tail->next = build_one_prop(node, NULL, NULL, NULL, 0);
111 tail = tail->next;
112 while(tail) {
113 tail->next = build_one_prop(node, tail->name,
114 NULL, NULL, 0);
115 tail = tail->next;
118 return head;
121 static char * __init get_one_property(phandle node, const char *name)
123 char *buf = "<NULL>";
124 int len;
126 len = of_pdt_prom_ops->getproplen(node, name);
127 if (len > 0) {
128 buf = prom_early_alloc(len);
129 len = of_pdt_prom_ops->getproperty(node, name, buf, len);
132 return buf;
135 static struct device_node * __init prom_create_node(phandle node,
136 struct device_node *parent)
138 struct device_node *dp;
140 if (!node)
141 return NULL;
143 dp = prom_early_alloc(sizeof(*dp));
144 of_pdt_incr_unique_id(dp);
145 dp->parent = parent;
147 kref_init(&dp->kref);
149 dp->name = get_one_property(node, "name");
150 dp->type = get_one_property(node, "device_type");
151 dp->phandle = node;
153 dp->properties = build_prop_list(node);
155 irq_trans_init(dp);
157 return dp;
160 static char * __init build_full_name(struct device_node *dp)
162 int len, ourlen, plen;
163 char *n;
165 plen = strlen(dp->parent->full_name);
166 ourlen = strlen(of_pdt_node_name(dp));
167 len = ourlen + plen + 2;
169 n = prom_early_alloc(len);
170 strcpy(n, dp->parent->full_name);
171 if (!of_node_is_root(dp->parent)) {
172 strcpy(n + plen, "/");
173 plen++;
175 strcpy(n + plen, of_pdt_node_name(dp));
177 return n;
180 static struct device_node * __init prom_build_tree(struct device_node *parent,
181 phandle node,
182 struct device_node ***nextp)
184 struct device_node *ret = NULL, *prev_sibling = NULL;
185 struct device_node *dp;
187 while (1) {
188 dp = prom_create_node(node, parent);
189 if (!dp)
190 break;
192 if (prev_sibling)
193 prev_sibling->sibling = dp;
195 if (!ret)
196 ret = dp;
197 prev_sibling = dp;
199 *(*nextp) = dp;
200 *nextp = &dp->allnext;
202 #if defined(CONFIG_SPARC)
203 dp->path_component_name = build_path_component(dp);
204 #endif
205 dp->full_name = build_full_name(dp);
207 dp->child = prom_build_tree(dp,
208 of_pdt_prom_ops->getchild(node), nextp);
210 if (prom_build_more)
211 prom_build_more(dp, nextp);
213 node = of_pdt_prom_ops->getsibling(node);
216 return ret;
219 void __init of_pdt_build_devicetree(phandle root_node, struct of_pdt_ops *ops)
221 struct device_node **nextp;
223 BUG_ON(!ops);
224 of_pdt_prom_ops = ops;
226 allnodes = prom_create_node(root_node, NULL);
227 #if defined(CONFIG_SPARC)
228 allnodes->path_component_name = "";
229 #endif
230 allnodes->full_name = "/";
232 nextp = &allnodes->allnext;
233 allnodes->child = prom_build_tree(allnodes,
234 of_pdt_prom_ops->getchild(allnodes->phandle), &nextp);