diff options
| -rw-r--r-- | arch/sparc/kernel/prom_common.c | 190 | ||||
| -rw-r--r-- | drivers/of/pdt.c | 215 |
2 files changed, 216 insertions, 189 deletions
diff --git a/arch/sparc/kernel/prom_common.c b/arch/sparc/kernel/prom_common.c index 1f830da2ddf2..7b454f6413f7 100644 --- a/arch/sparc/kernel/prom_common.c +++ b/arch/sparc/kernel/prom_common.c | |||
| @@ -26,8 +26,6 @@ | |||
| 26 | 26 | ||
| 27 | #include "prom.h" | 27 | #include "prom.h" |
| 28 | 28 | ||
| 29 | void (*prom_build_more)(struct device_node *dp, struct device_node ***nextp); | ||
| 30 | |||
| 31 | struct device_node *of_console_device; | 29 | struct device_node *of_console_device; |
| 32 | EXPORT_SYMBOL(of_console_device); | 30 | EXPORT_SYMBOL(of_console_device); |
| 33 | 31 | ||
| @@ -119,192 +117,6 @@ int of_find_in_proplist(const char *list, const char *match, int len) | |||
| 119 | } | 117 | } |
| 120 | EXPORT_SYMBOL(of_find_in_proplist); | 118 | EXPORT_SYMBOL(of_find_in_proplist); |
| 121 | 119 | ||
| 122 | unsigned int prom_unique_id; | ||
| 123 | |||
| 124 | static struct property * __init build_one_prop(phandle node, char *prev, | ||
| 125 | char *special_name, | ||
| 126 | void *special_val, | ||
| 127 | int special_len) | ||
| 128 | { | ||
| 129 | static struct property *tmp = NULL; | ||
| 130 | struct property *p; | ||
| 131 | const char *name; | ||
| 132 | |||
| 133 | if (tmp) { | ||
| 134 | p = tmp; | ||
| 135 | memset(p, 0, sizeof(*p) + 32); | ||
| 136 | tmp = NULL; | ||
| 137 | } else { | ||
| 138 | p = prom_early_alloc(sizeof(struct property) + 32); | ||
| 139 | p->unique_id = prom_unique_id++; | ||
| 140 | } | ||
| 141 | |||
| 142 | p->name = (char *) (p + 1); | ||
| 143 | if (special_name) { | ||
| 144 | strcpy(p->name, special_name); | ||
| 145 | p->length = special_len; | ||
| 146 | p->value = prom_early_alloc(special_len); | ||
| 147 | memcpy(p->value, special_val, special_len); | ||
| 148 | } else { | ||
| 149 | if (prev == NULL) { | ||
| 150 | name = prom_firstprop(node, p->name); | ||
| 151 | } else { | ||
| 152 | name = prom_nextprop(node, prev, p->name); | ||
| 153 | } | ||
| 154 | |||
| 155 | if (!name || strlen(name) == 0) { | ||
| 156 | tmp = p; | ||
| 157 | return NULL; | ||
| 158 | } | ||
| 159 | #ifdef CONFIG_SPARC32 | ||
| 160 | strcpy(p->name, name); | ||
| 161 | #endif | ||
| 162 | p->length = prom_getproplen(node, p->name); | ||
| 163 | if (p->length <= 0) { | ||
| 164 | p->length = 0; | ||
| 165 | } else { | ||
| 166 | int len; | ||
| 167 | |||
| 168 | p->value = prom_early_alloc(p->length + 1); | ||
| 169 | len = prom_getproperty(node, p->name, p->value, | ||
| 170 | p->length); | ||
| 171 | if (len <= 0) | ||
| 172 | p->length = 0; | ||
| 173 | ((unsigned char *)p->value)[p->length] = '\0'; | ||
| 174 | } | ||
| 175 | } | ||
| 176 | return p; | ||
| 177 | } | ||
| 178 | |||
| 179 | static struct property * __init build_prop_list(phandle node) | ||
| 180 | { | ||
| 181 | struct property *head, *tail; | ||
| 182 | |||
| 183 | head = tail = build_one_prop(node, NULL, | ||
| 184 | ".node", &node, sizeof(node)); | ||
| 185 | |||
| 186 | tail->next = build_one_prop(node, NULL, NULL, NULL, 0); | ||
| 187 | tail = tail->next; | ||
| 188 | while(tail) { | ||
| 189 | tail->next = build_one_prop(node, tail->name, | ||
| 190 | NULL, NULL, 0); | ||
| 191 | tail = tail->next; | ||
| 192 | } | ||
| 193 | |||
| 194 | return head; | ||
| 195 | } | ||
| 196 | |||
| 197 | static char * __init get_one_property(phandle node, const char *name) | ||
| 198 | { | ||
| 199 | char *buf = "<NULL>"; | ||
| 200 | int len; | ||
| 201 | |||
| 202 | len = prom_getproplen(node, name); | ||
| 203 | if (len > 0) { | ||
| 204 | buf = prom_early_alloc(len); | ||
| 205 | len = prom_getproperty(node, name, buf, len); | ||
| 206 | } | ||
| 207 | |||
| 208 | return buf; | ||
| 209 | } | ||
| 210 | |||
| 211 | static struct device_node * __init prom_create_node(phandle node, | ||
| 212 | struct device_node *parent) | ||
| 213 | { | ||
| 214 | struct device_node *dp; | ||
| 215 | |||
| 216 | if (!node) | ||
| 217 | return NULL; | ||
| 218 | |||
| 219 | dp = prom_early_alloc(sizeof(*dp)); | ||
| 220 | dp->unique_id = prom_unique_id++; | ||
| 221 | dp->parent = parent; | ||
| 222 | |||
| 223 | kref_init(&dp->kref); | ||
| 224 | |||
| 225 | dp->name = get_one_property(node, "name"); | ||
| 226 | dp->type = get_one_property(node, "device_type"); | ||
| 227 | dp->phandle = node; | ||
| 228 | |||
| 229 | dp->properties = build_prop_list(node); | ||
| 230 | |||
| 231 | irq_trans_init(dp); | ||
| 232 | |||
| 233 | return dp; | ||
| 234 | } | ||
| 235 | |||
| 236 | char * __init build_full_name(struct device_node *dp) | ||
| 237 | { | ||
| 238 | int len, ourlen, plen; | ||
| 239 | char *n; | ||
| 240 | |||
| 241 | plen = strlen(dp->parent->full_name); | ||
| 242 | ourlen = strlen(dp->path_component_name); | ||
| 243 | len = ourlen + plen + 2; | ||
| 244 | |||
| 245 | n = prom_early_alloc(len); | ||
| 246 | strcpy(n, dp->parent->full_name); | ||
| 247 | if (!of_node_is_root(dp->parent)) { | ||
| 248 | strcpy(n + plen, "/"); | ||
| 249 | plen++; | ||
| 250 | } | ||
| 251 | strcpy(n + plen, dp->path_component_name); | ||
| 252 | |||
| 253 | return n; | ||
| 254 | } | ||
| 255 | |||
| 256 | static struct device_node * __init prom_build_tree(struct device_node *parent, | ||
| 257 | phandle node, | ||
| 258 | struct device_node ***nextp) | ||
| 259 | { | ||
| 260 | struct device_node *ret = NULL, *prev_sibling = NULL; | ||
| 261 | struct device_node *dp; | ||
| 262 | |||
| 263 | while (1) { | ||
| 264 | dp = prom_create_node(node, parent); | ||
| 265 | if (!dp) | ||
| 266 | break; | ||
| 267 | |||
| 268 | if (prev_sibling) | ||
| 269 | prev_sibling->sibling = dp; | ||
| 270 | |||
| 271 | if (!ret) | ||
| 272 | ret = dp; | ||
| 273 | prev_sibling = dp; | ||
| 274 | |||
| 275 | *(*nextp) = dp; | ||
| 276 | *nextp = &dp->allnext; | ||
| 277 | |||
| 278 | dp->path_component_name = build_path_component(dp); | ||
| 279 | dp->full_name = build_full_name(dp); | ||
| 280 | |||
| 281 | dp->child = prom_build_tree(dp, prom_getchild(node), nextp); | ||
| 282 | |||
| 283 | if (prom_build_more) | ||
| 284 | prom_build_more(dp, nextp); | ||
| 285 | |||
| 286 | node = prom_getsibling(node); | ||
| 287 | } | ||
| 288 | |||
| 289 | return ret; | ||
| 290 | } | ||
| 291 | |||
| 292 | unsigned int prom_early_allocated __initdata; | 120 | unsigned int prom_early_allocated __initdata; |
| 293 | 121 | ||
| 294 | void __init prom_build_devicetree(void) | 122 | #include "../../../drivers/of/pdt.c" |
| 295 | { | ||
| 296 | struct device_node **nextp; | ||
| 297 | |||
| 298 | allnodes = prom_create_node(prom_root_node, NULL); | ||
| 299 | allnodes->path_component_name = ""; | ||
| 300 | allnodes->full_name = "/"; | ||
| 301 | |||
| 302 | nextp = &allnodes->allnext; | ||
| 303 | allnodes->child = prom_build_tree(allnodes, | ||
| 304 | prom_getchild(allnodes->phandle), | ||
| 305 | &nextp); | ||
| 306 | of_console_init(); | ||
| 307 | |||
| 308 | printk("PROM: Built device tree with %u bytes of memory.\n", | ||
| 309 | prom_early_allocated); | ||
| 310 | } | ||
diff --git a/drivers/of/pdt.c b/drivers/of/pdt.c new file mode 100644 index 000000000000..c3c2d70b3f75 --- /dev/null +++ b/drivers/of/pdt.c | |||
| @@ -0,0 +1,215 @@ | |||
| 1 | /* prom_common.c: OF device tree support common code. | ||
| 2 | * | ||
| 3 | * Paul Mackerras August 1996. | ||
| 4 | * Copyright (C) 1996-2005 Paul Mackerras. | ||
| 5 | * | ||
| 6 | * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner. | ||
| 7 | * {engebret|bergner}@us.ibm.com | ||
| 8 | * | ||
| 9 | * Adapted for sparc by David S. Miller davem@davemloft.net | ||
| 10 | * | ||
| 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. | ||
| 15 | */ | ||
| 16 | |||
| 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> | ||
| 26 | |||
| 27 | void (*prom_build_more)(struct device_node *dp, struct device_node ***nextp); | ||
| 28 | |||
| 29 | unsigned int prom_unique_id; | ||
| 30 | |||
| 31 | static struct property * __init build_one_prop(phandle node, char *prev, | ||
| 32 | char *special_name, | ||
| 33 | void *special_val, | ||
| 34 | int special_len) | ||
| 35 | { | ||
| 36 | static struct property *tmp = NULL; | ||
| 37 | struct property *p; | ||
| 38 | const char *name; | ||
| 39 | |||
| 40 | if (tmp) { | ||
| 41 | p = tmp; | ||
| 42 | memset(p, 0, sizeof(*p) + 32); | ||
| 43 | tmp = NULL; | ||
| 44 | } else { | ||
| 45 | p = prom_early_alloc(sizeof(struct property) + 32); | ||
| 46 | p->unique_id = prom_unique_id++; | ||
| 47 | } | ||
| 48 | |||
| 49 | p->name = (char *) (p + 1); | ||
| 50 | if (special_name) { | ||
| 51 | strcpy(p->name, special_name); | ||
| 52 | p->length = special_len; | ||
| 53 | p->value = prom_early_alloc(special_len); | ||
| 54 | memcpy(p->value, special_val, special_len); | ||
| 55 | } else { | ||
| 56 | if (prev == NULL) { | ||
| 57 | name = prom_firstprop(node, p->name); | ||
| 58 | } else { | ||
| 59 | name = prom_nextprop(node, prev, p->name); | ||
| 60 | } | ||
| 61 | |||
| 62 | if (!name || strlen(name) == 0) { | ||
| 63 | tmp = p; | ||
| 64 | return NULL; | ||
| 65 | } | ||
| 66 | #ifdef CONFIG_SPARC32 | ||
| 67 | strcpy(p->name, name); | ||
| 68 | #endif | ||
| 69 | p->length = prom_getproplen(node, p->name); | ||
| 70 | if (p->length <= 0) { | ||
| 71 | p->length = 0; | ||
| 72 | } else { | ||
| 73 | int len; | ||
| 74 | |||
| 75 | p->value = prom_early_alloc(p->length + 1); | ||
| 76 | len = prom_getproperty(node, p->name, p->value, | ||
| 77 | p->length); | ||
| 78 | if (len <= 0) | ||
| 79 | p->length = 0; | ||
| 80 | ((unsigned char *)p->value)[p->length] = '\0'; | ||
| 81 | } | ||
| 82 | } | ||
| 83 | return p; | ||
| 84 | } | ||
| 85 | |||
| 86 | static struct property * __init build_prop_list(phandle node) | ||
| 87 | { | ||
| 88 | struct property *head, *tail; | ||
| 89 | |||
| 90 | head = tail = build_one_prop(node, NULL, | ||
| 91 | ".node", &node, sizeof(node)); | ||
| 92 | |||
| 93 | tail->next = build_one_prop(node, NULL, NULL, NULL, 0); | ||
| 94 | tail = tail->next; | ||
| 95 | while(tail) { | ||
| 96 | tail->next = build_one_prop(node, tail->name, | ||
| 97 | NULL, NULL, 0); | ||
| 98 | tail = tail->next; | ||
| 99 | } | ||
| 100 | |||
| 101 | return head; | ||
| 102 | } | ||
| 103 | |||
| 104 | static char * __init get_one_property(phandle node, const char *name) | ||
| 105 | { | ||
| 106 | char *buf = "<NULL>"; | ||
| 107 | int len; | ||
| 108 | |||
| 109 | len = prom_getproplen(node, name); | ||
| 110 | if (len > 0) { | ||
| 111 | buf = prom_early_alloc(len); | ||
| 112 | len = prom_getproperty(node, name, buf, len); | ||
| 113 | } | ||
| 114 | |||
| 115 | return buf; | ||
| 116 | } | ||
| 117 | |||
| 118 | static struct device_node * __init prom_create_node(phandle node, | ||
| 119 | struct device_node *parent) | ||
| 120 | { | ||
| 121 | struct device_node *dp; | ||
| 122 | |||
| 123 | if (!node) | ||
| 124 | return NULL; | ||
| 125 | |||
| 126 | dp = prom_early_alloc(sizeof(*dp)); | ||
| 127 | dp->unique_id = prom_unique_id++; | ||
| 128 | dp->parent = parent; | ||
| 129 | |||
| 130 | kref_init(&dp->kref); | ||
| 131 | |||
| 132 | dp->name = get_one_property(node, "name"); | ||
| 133 | dp->type = get_one_property(node, "device_type"); | ||
| 134 | dp->phandle = node; | ||
| 135 | |||
| 136 | dp->properties = build_prop_list(node); | ||
| 137 | |||
| 138 | irq_trans_init(dp); | ||
| 139 | |||
| 140 | return dp; | ||
| 141 | } | ||
| 142 | |||
| 143 | char * __init build_full_name(struct device_node *dp) | ||
| 144 | { | ||
| 145 | int len, ourlen, plen; | ||
| 146 | char *n; | ||
| 147 | |||
| 148 | plen = strlen(dp->parent->full_name); | ||
| 149 | ourlen = strlen(dp->path_component_name); | ||
| 150 | len = ourlen + plen + 2; | ||
| 151 | |||
| 152 | n = prom_early_alloc(len); | ||
| 153 | strcpy(n, dp->parent->full_name); | ||
| 154 | if (!of_node_is_root(dp->parent)) { | ||
| 155 | strcpy(n + plen, "/"); | ||
| 156 | plen++; | ||
| 157 | } | ||
| 158 | strcpy(n + plen, dp->path_component_name); | ||
| 159 | |||
| 160 | return n; | ||
| 161 | } | ||
| 162 | |||
| 163 | static struct device_node * __init prom_build_tree(struct device_node *parent, | ||
| 164 | phandle node, | ||
| 165 | struct device_node ***nextp) | ||
| 166 | { | ||
| 167 | struct device_node *ret = NULL, *prev_sibling = NULL; | ||
| 168 | struct device_node *dp; | ||
| 169 | |||
| 170 | while (1) { | ||
| 171 | dp = prom_create_node(node, parent); | ||
| 172 | if (!dp) | ||
| 173 | break; | ||
| 174 | |||
| 175 | if (prev_sibling) | ||
| 176 | prev_sibling->sibling = dp; | ||
| 177 | |||
| 178 | if (!ret) | ||
| 179 | ret = dp; | ||
| 180 | prev_sibling = dp; | ||
| 181 | |||
| 182 | *(*nextp) = dp; | ||
| 183 | *nextp = &dp->allnext; | ||
| 184 | |||
| 185 | dp->path_component_name = build_path_component(dp); | ||
| 186 | dp->full_name = build_full_name(dp); | ||
| 187 | |||
| 188 | dp->child = prom_build_tree(dp, prom_getchild(node), nextp); | ||
| 189 | |||
| 190 | if (prom_build_more) | ||
| 191 | prom_build_more(dp, nextp); | ||
| 192 | |||
| 193 | node = prom_getsibling(node); | ||
| 194 | } | ||
| 195 | |||
| 196 | return ret; | ||
| 197 | } | ||
| 198 | |||
| 199 | void __init prom_build_devicetree(void) | ||
| 200 | { | ||
| 201 | struct device_node **nextp; | ||
| 202 | |||
| 203 | allnodes = prom_create_node(prom_root_node, NULL); | ||
| 204 | allnodes->path_component_name = ""; | ||
| 205 | allnodes->full_name = "/"; | ||
| 206 | |||
| 207 | nextp = &allnodes->allnext; | ||
| 208 | allnodes->child = prom_build_tree(allnodes, | ||
| 209 | prom_getchild(allnodes->phandle), | ||
| 210 | &nextp); | ||
| 211 | of_console_init(); | ||
| 212 | |||
| 213 | printk("PROM: Built device tree with %u bytes of memory.\n", | ||
| 214 | prom_early_allocated); | ||
| 215 | } | ||
