Linux Audio

Check our new training course

Loading...
v3.5.6
 
  1/* pdt.c: OF PROM device tree support 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 *  Adapted for multiple architectures by Andres Salomon <dilinger@queued.net>
 11 *
 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.
 16 */
 17
 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>
 26
 27static struct of_pdt_ops *of_pdt_prom_ops __initdata;
 28
 29void __initdata (*of_pdt_build_more)(struct device_node *dp,
 30		struct device_node ***nextp);
 31
 32#if defined(CONFIG_SPARC)
 33unsigned int of_pdt_unique_id __initdata;
 34
 35#define of_pdt_incr_unique_id(p) do { \
 36	(p)->unique_id = of_pdt_unique_id++; \
 37} while (0)
 38
 39static char * __init of_pdt_build_full_name(struct device_node *dp)
 40{
 41	int len, ourlen, plen;
 42	char *n;
 43
 44	dp->path_component_name = build_path_component(dp);
 45
 46	plen = strlen(dp->parent->full_name);
 47	ourlen = strlen(dp->path_component_name);
 48	len = ourlen + plen + 2;
 49
 50	n = prom_early_alloc(len);
 51	strcpy(n, dp->parent->full_name);
 52	if (!of_node_is_root(dp->parent)) {
 53		strcpy(n + plen, "/");
 54		plen++;
 55	}
 56	strcpy(n + plen, dp->path_component_name);
 57
 58	return n;
 59}
 60
 61#else /* CONFIG_SPARC */
 62
 63static inline void of_pdt_incr_unique_id(void *p) { }
 64static inline void irq_trans_init(struct device_node *dp) { }
 65
 66static char * __init of_pdt_build_full_name(struct device_node *dp)
 67{
 68	static int failsafe_id = 0; /* for generating unique names on failure */
 69	char *buf;
 70	int len;
 71
 72	if (of_pdt_prom_ops->pkg2path(dp->phandle, NULL, 0, &len))
 73		goto failsafe;
 74
 75	buf = prom_early_alloc(len + 1);
 76	if (of_pdt_prom_ops->pkg2path(dp->phandle, buf, len, &len))
 77		goto failsafe;
 78	return buf;
 79
 80 failsafe:
 81	buf = prom_early_alloc(strlen(dp->parent->full_name) +
 82			       strlen(dp->name) + 16);
 83	sprintf(buf, "%s/%s@unknown%i",
 84		of_node_is_root(dp->parent) ? "" : dp->parent->full_name,
 85		dp->name, failsafe_id++);
 86	pr_err("%s: pkg2path failed; assigning %s\n", __func__, buf);
 87	return buf;
 88}
 89
 90#endif /* !CONFIG_SPARC */
 91
 92static struct property * __init of_pdt_build_one_prop(phandle node, char *prev,
 93					       char *special_name,
 94					       void *special_val,
 95					       int special_len)
 96{
 97	static struct property *tmp = NULL;
 98	struct property *p;
 99	int err;
100
101	if (tmp) {
102		p = tmp;
103		memset(p, 0, sizeof(*p) + 32);
104		tmp = NULL;
105	} else {
106		p = prom_early_alloc(sizeof(struct property) + 32);
107		of_pdt_incr_unique_id(p);
108	}
109
110	p->name = (char *) (p + 1);
111	if (special_name) {
112		strcpy(p->name, special_name);
113		p->length = special_len;
114		p->value = prom_early_alloc(special_len);
115		memcpy(p->value, special_val, special_len);
116	} else {
117		err = of_pdt_prom_ops->nextprop(node, prev, p->name);
118		if (err) {
119			tmp = p;
120			return NULL;
121		}
122		p->length = of_pdt_prom_ops->getproplen(node, p->name);
123		if (p->length <= 0) {
124			p->length = 0;
125		} else {
126			int len;
127
128			p->value = prom_early_alloc(p->length + 1);
129			len = of_pdt_prom_ops->getproperty(node, p->name,
130					p->value, p->length);
131			if (len <= 0)
132				p->length = 0;
133			((unsigned char *)p->value)[p->length] = '\0';
134		}
135	}
136	return p;
137}
138
139static struct property * __init of_pdt_build_prop_list(phandle node)
140{
141	struct property *head, *tail;
142
143	head = tail = of_pdt_build_one_prop(node, NULL,
144				     ".node", &node, sizeof(node));
145
146	tail->next = of_pdt_build_one_prop(node, NULL, NULL, NULL, 0);
147	tail = tail->next;
148	while(tail) {
149		tail->next = of_pdt_build_one_prop(node, tail->name,
150					    NULL, NULL, 0);
151		tail = tail->next;
152	}
153
154	return head;
155}
156
157static char * __init of_pdt_get_one_property(phandle node, const char *name)
158{
159	char *buf = "<NULL>";
160	int len;
161
162	len = of_pdt_prom_ops->getproplen(node, name);
163	if (len > 0) {
164		buf = prom_early_alloc(len);
165		len = of_pdt_prom_ops->getproperty(node, name, buf, len);
166	}
167
168	return buf;
169}
170
171static struct device_node * __init of_pdt_create_node(phandle node,
172						    struct device_node *parent)
173{
174	struct device_node *dp;
175
176	if (!node)
177		return NULL;
178
179	dp = prom_early_alloc(sizeof(*dp));
 
180	of_pdt_incr_unique_id(dp);
181	dp->parent = parent;
182
183	kref_init(&dp->kref);
184
185	dp->name = of_pdt_get_one_property(node, "name");
186	dp->type = of_pdt_get_one_property(node, "device_type");
187	dp->phandle = node;
188
189	dp->properties = of_pdt_build_prop_list(node);
190
191	irq_trans_init(dp);
192
193	return dp;
194}
195
196static struct device_node * __init of_pdt_build_tree(struct device_node *parent,
197						   phandle node,
198						   struct device_node ***nextp)
199{
200	struct device_node *ret = NULL, *prev_sibling = NULL;
201	struct device_node *dp;
202
203	while (1) {
204		dp = of_pdt_create_node(node, parent);
205		if (!dp)
206			break;
207
208		if (prev_sibling)
209			prev_sibling->sibling = dp;
210
211		if (!ret)
212			ret = dp;
213		prev_sibling = dp;
214
215		*(*nextp) = dp;
216		*nextp = &dp->allnext;
217
218		dp->full_name = of_pdt_build_full_name(dp);
219
220		dp->child = of_pdt_build_tree(dp,
221				of_pdt_prom_ops->getchild(node), nextp);
222
223		if (of_pdt_build_more)
224			of_pdt_build_more(dp, nextp);
225
226		node = of_pdt_prom_ops->getsibling(node);
227	}
228
229	return ret;
230}
231
232static void * __init kernel_tree_alloc(u64 size, u64 align)
233{
234	return prom_early_alloc(size);
235}
236
237void __init of_pdt_build_devicetree(phandle root_node, struct of_pdt_ops *ops)
238{
239	struct device_node **nextp;
240
241	BUG_ON(!ops);
242	of_pdt_prom_ops = ops;
243
244	allnodes = of_pdt_create_node(root_node, NULL);
245#if defined(CONFIG_SPARC)
246	allnodes->path_component_name = "";
247#endif
248	allnodes->full_name = "/";
249
250	nextp = &allnodes->allnext;
251	allnodes->child = of_pdt_build_tree(allnodes,
252			of_pdt_prom_ops->getchild(allnodes->phandle), &nextp);
253
254	/* Get pointer to "/chosen" and "/aliasas" nodes for use everywhere */
255	of_alias_scan(kernel_tree_alloc);
256}
v4.17
  1// SPDX-License-Identifier: GPL-2.0+
  2/* pdt.c: OF PROM device tree support code.
  3 *
  4 * Paul Mackerras	August 1996.
  5 * Copyright (C) 1996-2005 Paul Mackerras.
  6 *
  7 *  Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner.
  8 *    {engebret|bergner}@us.ibm.com
  9 *
 10 *  Adapted for sparc by David S. Miller davem@davemloft.net
 11 *  Adapted for multiple architectures by Andres Salomon <dilinger@queued.net>
 
 
 
 
 
 12 */
 13
 14#include <linux/kernel.h>
 15#include <linux/module.h>
 16#include <linux/errno.h>
 17#include <linux/mutex.h>
 18#include <linux/slab.h>
 19#include <linux/of.h>
 20#include <linux/of_pdt.h>
 
 21
 22static struct of_pdt_ops *of_pdt_prom_ops __initdata;
 23
 24void __initdata (*of_pdt_build_more)(struct device_node *dp);
 
 25
 26#if defined(CONFIG_SPARC)
 27unsigned int of_pdt_unique_id __initdata;
 28
 29#define of_pdt_incr_unique_id(p) do { \
 30	(p)->unique_id = of_pdt_unique_id++; \
 31} while (0)
 32
 33static char * __init of_pdt_build_full_name(struct device_node *dp)
 34{
 35	int len, ourlen, plen;
 36	char *n;
 37
 38	dp->path_component_name = build_path_component(dp);
 39
 40	plen = strlen(dp->parent->full_name);
 41	ourlen = strlen(dp->path_component_name);
 42	len = ourlen + plen + 2;
 43
 44	n = prom_early_alloc(len);
 45	strcpy(n, dp->parent->full_name);
 46	if (!of_node_is_root(dp->parent)) {
 47		strcpy(n + plen, "/");
 48		plen++;
 49	}
 50	strcpy(n + plen, dp->path_component_name);
 51
 52	return n;
 53}
 54
 55#else /* CONFIG_SPARC */
 56
 57static inline void of_pdt_incr_unique_id(void *p) { }
 58static inline void irq_trans_init(struct device_node *dp) { }
 59
 60static char * __init of_pdt_build_full_name(struct device_node *dp)
 61{
 62	static int failsafe_id = 0; /* for generating unique names on failure */
 63	char *buf;
 64	int len;
 65
 66	if (of_pdt_prom_ops->pkg2path(dp->phandle, NULL, 0, &len))
 67		goto failsafe;
 68
 69	buf = prom_early_alloc(len + 1);
 70	if (of_pdt_prom_ops->pkg2path(dp->phandle, buf, len, &len))
 71		goto failsafe;
 72	return buf;
 73
 74 failsafe:
 75	buf = prom_early_alloc(strlen(dp->parent->full_name) +
 76			       strlen(dp->name) + 16);
 77	sprintf(buf, "%s/%s@unknown%i",
 78		of_node_is_root(dp->parent) ? "" : dp->parent->full_name,
 79		dp->name, failsafe_id++);
 80	pr_err("%s: pkg2path failed; assigning %s\n", __func__, buf);
 81	return buf;
 82}
 83
 84#endif /* !CONFIG_SPARC */
 85
 86static struct property * __init of_pdt_build_one_prop(phandle node, char *prev,
 87					       char *special_name,
 88					       void *special_val,
 89					       int special_len)
 90{
 91	static struct property *tmp = NULL;
 92	struct property *p;
 93	int err;
 94
 95	if (tmp) {
 96		p = tmp;
 97		memset(p, 0, sizeof(*p) + 32);
 98		tmp = NULL;
 99	} else {
100		p = prom_early_alloc(sizeof(struct property) + 32);
101		of_pdt_incr_unique_id(p);
102	}
103
104	p->name = (char *) (p + 1);
105	if (special_name) {
106		strcpy(p->name, special_name);
107		p->length = special_len;
108		p->value = prom_early_alloc(special_len);
109		memcpy(p->value, special_val, special_len);
110	} else {
111		err = of_pdt_prom_ops->nextprop(node, prev, p->name);
112		if (err) {
113			tmp = p;
114			return NULL;
115		}
116		p->length = of_pdt_prom_ops->getproplen(node, p->name);
117		if (p->length <= 0) {
118			p->length = 0;
119		} else {
120			int len;
121
122			p->value = prom_early_alloc(p->length + 1);
123			len = of_pdt_prom_ops->getproperty(node, p->name,
124					p->value, p->length);
125			if (len <= 0)
126				p->length = 0;
127			((unsigned char *)p->value)[p->length] = '\0';
128		}
129	}
130	return p;
131}
132
133static struct property * __init of_pdt_build_prop_list(phandle node)
134{
135	struct property *head, *tail;
136
137	head = tail = of_pdt_build_one_prop(node, NULL,
138				     ".node", &node, sizeof(node));
139
140	tail->next = of_pdt_build_one_prop(node, NULL, NULL, NULL, 0);
141	tail = tail->next;
142	while(tail) {
143		tail->next = of_pdt_build_one_prop(node, tail->name,
144					    NULL, NULL, 0);
145		tail = tail->next;
146	}
147
148	return head;
149}
150
151static char * __init of_pdt_get_one_property(phandle node, const char *name)
152{
153	char *buf = "<NULL>";
154	int len;
155
156	len = of_pdt_prom_ops->getproplen(node, name);
157	if (len > 0) {
158		buf = prom_early_alloc(len);
159		len = of_pdt_prom_ops->getproperty(node, name, buf, len);
160	}
161
162	return buf;
163}
164
165static struct device_node * __init of_pdt_create_node(phandle node,
166						    struct device_node *parent)
167{
168	struct device_node *dp;
169
170	if (!node)
171		return NULL;
172
173	dp = prom_early_alloc(sizeof(*dp));
174	of_node_init(dp);
175	of_pdt_incr_unique_id(dp);
176	dp->parent = parent;
177
 
 
178	dp->name = of_pdt_get_one_property(node, "name");
179	dp->type = of_pdt_get_one_property(node, "device_type");
180	dp->phandle = node;
181
182	dp->properties = of_pdt_build_prop_list(node);
183
184	irq_trans_init(dp);
185
186	return dp;
187}
188
189static struct device_node * __init of_pdt_build_tree(struct device_node *parent,
190						   phandle node)
 
191{
192	struct device_node *ret = NULL, *prev_sibling = NULL;
193	struct device_node *dp;
194
195	while (1) {
196		dp = of_pdt_create_node(node, parent);
197		if (!dp)
198			break;
199
200		if (prev_sibling)
201			prev_sibling->sibling = dp;
202
203		if (!ret)
204			ret = dp;
205		prev_sibling = dp;
206
 
 
 
207		dp->full_name = of_pdt_build_full_name(dp);
208
209		dp->child = of_pdt_build_tree(dp, of_pdt_prom_ops->getchild(node));
 
210
211		if (of_pdt_build_more)
212			of_pdt_build_more(dp);
213
214		node = of_pdt_prom_ops->getsibling(node);
215	}
216
217	return ret;
218}
219
220static void * __init kernel_tree_alloc(u64 size, u64 align)
221{
222	return prom_early_alloc(size);
223}
224
225void __init of_pdt_build_devicetree(phandle root_node, struct of_pdt_ops *ops)
226{
 
 
227	BUG_ON(!ops);
228	of_pdt_prom_ops = ops;
229
230	of_root = of_pdt_create_node(root_node, NULL);
231#if defined(CONFIG_SPARC)
232	of_root->path_component_name = "";
233#endif
234	of_root->full_name = "/";
235
236	of_root->child = of_pdt_build_tree(of_root,
237				of_pdt_prom_ops->getchild(of_root->phandle));
 
238
239	/* Get pointer to "/chosen" and "/aliases" nodes for use everywhere */
240	of_alias_scan(kernel_tree_alloc);
241}