jbd: Journal block numbers can ever be only 32-bit use unsigned int for them
[linux/fpc-iii.git] / arch / sparc / kernel / prom_common.c
blob138910c672066561b72d2b1d47a27eba8e1bb74d
1 /* prom_common.c: OF device tree support common 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
11 * This program is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU General Public License
13 * as published by the Free Software Foundation; either version
14 * 2 of the License, or (at your option) any later version.
17 #include <linux/kernel.h>
18 #include <linux/module.h>
19 #include <linux/errno.h>
20 #include <linux/mutex.h>
21 #include <linux/slab.h>
22 #include <linux/of.h>
23 #include <asm/prom.h>
24 #include <asm/oplib.h>
25 #include <asm/leon.h>
27 #include "prom.h"
29 void (*prom_build_more)(struct device_node *dp, struct device_node ***nextp);
31 struct device_node *of_console_device;
32 EXPORT_SYMBOL(of_console_device);
34 char *of_console_path;
35 EXPORT_SYMBOL(of_console_path);
37 char *of_console_options;
38 EXPORT_SYMBOL(of_console_options);
40 struct device_node *of_find_node_by_phandle(phandle handle)
42 struct device_node *np;
44 for (np = allnodes; np; np = np->allnext)
45 if (np->node == handle)
46 break;
48 return np;
50 EXPORT_SYMBOL(of_find_node_by_phandle);
52 int of_getintprop_default(struct device_node *np, const char *name, int def)
54 struct property *prop;
55 int len;
57 prop = of_find_property(np, name, &len);
58 if (!prop || len != 4)
59 return def;
61 return *(int *) prop->value;
63 EXPORT_SYMBOL(of_getintprop_default);
65 DEFINE_MUTEX(of_set_property_mutex);
66 EXPORT_SYMBOL(of_set_property_mutex);
68 int of_set_property(struct device_node *dp, const char *name, void *val, int len)
70 struct property **prevp;
71 void *new_val;
72 int err;
74 new_val = kmalloc(len, GFP_KERNEL);
75 if (!new_val)
76 return -ENOMEM;
78 memcpy(new_val, val, len);
80 err = -ENODEV;
82 write_lock(&devtree_lock);
83 prevp = &dp->properties;
84 while (*prevp) {
85 struct property *prop = *prevp;
87 if (!strcasecmp(prop->name, name)) {
88 void *old_val = prop->value;
89 int ret;
91 mutex_lock(&of_set_property_mutex);
92 ret = prom_setprop(dp->node, name, val, len);
93 mutex_unlock(&of_set_property_mutex);
95 err = -EINVAL;
96 if (ret >= 0) {
97 prop->value = new_val;
98 prop->length = len;
100 if (OF_IS_DYNAMIC(prop))
101 kfree(old_val);
103 OF_MARK_DYNAMIC(prop);
105 err = 0;
107 break;
109 prevp = &(*prevp)->next;
111 write_unlock(&devtree_lock);
113 /* XXX Upate procfs if necessary... */
115 return err;
117 EXPORT_SYMBOL(of_set_property);
119 int of_find_in_proplist(const char *list, const char *match, int len)
121 while (len > 0) {
122 int l;
124 if (!strcmp(list, match))
125 return 1;
126 l = strlen(list) + 1;
127 list += l;
128 len -= l;
130 return 0;
132 EXPORT_SYMBOL(of_find_in_proplist);
134 unsigned int prom_unique_id;
136 static struct property * __init build_one_prop(phandle node, char *prev,
137 char *special_name,
138 void *special_val,
139 int special_len)
141 static struct property *tmp = NULL;
142 struct property *p;
143 const char *name;
145 if (tmp) {
146 p = tmp;
147 memset(p, 0, sizeof(*p) + 32);
148 tmp = NULL;
149 } else {
150 p = prom_early_alloc(sizeof(struct property) + 32);
151 p->unique_id = prom_unique_id++;
154 p->name = (char *) (p + 1);
155 if (special_name) {
156 strcpy(p->name, special_name);
157 p->length = special_len;
158 p->value = prom_early_alloc(special_len);
159 memcpy(p->value, special_val, special_len);
160 } else {
161 if (prev == NULL) {
162 name = prom_firstprop(node, p->name);
163 } else {
164 name = prom_nextprop(node, prev, p->name);
167 if (!name || strlen(name) == 0) {
168 tmp = p;
169 return NULL;
171 #ifdef CONFIG_SPARC32
172 strcpy(p->name, name);
173 #endif
174 p->length = prom_getproplen(node, p->name);
175 if (p->length <= 0) {
176 p->length = 0;
177 } else {
178 int len;
180 p->value = prom_early_alloc(p->length + 1);
181 len = prom_getproperty(node, p->name, p->value,
182 p->length);
183 if (len <= 0)
184 p->length = 0;
185 ((unsigned char *)p->value)[p->length] = '\0';
188 return p;
191 static struct property * __init build_prop_list(phandle node)
193 struct property *head, *tail;
195 head = tail = build_one_prop(node, NULL,
196 ".node", &node, sizeof(node));
198 tail->next = build_one_prop(node, NULL, NULL, NULL, 0);
199 tail = tail->next;
200 while(tail) {
201 tail->next = build_one_prop(node, tail->name,
202 NULL, NULL, 0);
203 tail = tail->next;
206 return head;
209 static char * __init get_one_property(phandle node, const char *name)
211 char *buf = "<NULL>";
212 int len;
214 len = prom_getproplen(node, name);
215 if (len > 0) {
216 buf = prom_early_alloc(len);
217 len = prom_getproperty(node, name, buf, len);
220 return buf;
223 static struct device_node * __init prom_create_node(phandle node,
224 struct device_node *parent)
226 struct device_node *dp;
228 if (!node)
229 return NULL;
231 dp = prom_early_alloc(sizeof(*dp));
232 dp->unique_id = prom_unique_id++;
233 dp->parent = parent;
235 kref_init(&dp->kref);
237 dp->name = get_one_property(node, "name");
238 dp->type = get_one_property(node, "device_type");
239 dp->node = node;
241 dp->properties = build_prop_list(node);
243 irq_trans_init(dp);
245 return dp;
248 char * __init build_full_name(struct device_node *dp)
250 int len, ourlen, plen;
251 char *n;
253 plen = strlen(dp->parent->full_name);
254 ourlen = strlen(dp->path_component_name);
255 len = ourlen + plen + 2;
257 n = prom_early_alloc(len);
258 strcpy(n, dp->parent->full_name);
259 if (!is_root_node(dp->parent)) {
260 strcpy(n + plen, "/");
261 plen++;
263 strcpy(n + plen, dp->path_component_name);
265 return n;
268 static struct device_node * __init prom_build_tree(struct device_node *parent,
269 phandle node,
270 struct device_node ***nextp)
272 struct device_node *ret = NULL, *prev_sibling = NULL;
273 struct device_node *dp;
275 while (1) {
276 dp = prom_create_node(node, parent);
277 if (!dp)
278 break;
280 if (prev_sibling)
281 prev_sibling->sibling = dp;
283 if (!ret)
284 ret = dp;
285 prev_sibling = dp;
287 *(*nextp) = dp;
288 *nextp = &dp->allnext;
290 dp->path_component_name = build_path_component(dp);
291 dp->full_name = build_full_name(dp);
293 dp->child = prom_build_tree(dp, prom_getchild(node), nextp);
295 if (prom_build_more)
296 prom_build_more(dp, nextp);
298 node = prom_getsibling(node);
301 return ret;
304 unsigned int prom_early_allocated __initdata;
306 void __init prom_build_devicetree(void)
308 struct device_node **nextp;
310 allnodes = prom_create_node(prom_root_node, NULL);
311 allnodes->path_component_name = "";
312 allnodes->full_name = "/";
314 nextp = &allnodes->allnext;
315 allnodes->child = prom_build_tree(allnodes,
316 prom_getchild(allnodes->node),
317 &nextp);
318 of_console_init();
320 printk("PROM: Built device tree with %u bytes of memory.\n",
321 prom_early_allocated);