Blame view

drivers/of/base.c 9.86 KB
97e873e5c   Stephen Rothwell   Start split out o...
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
  /*
   * Procedures for creating, accessing and interpreting the device tree.
   *
   * Paul Mackerras	August 1996.
   * Copyright (C) 1996-2005 Paul Mackerras.
   *
   *  Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner.
   *    {engebret|bergner}@us.ibm.com
   *
   *  Adapted for sparc and sparc64 by David S. Miller davem@davemloft.net
   *
   *  Reconsolidated from arch/x/kernel/prom.c by Stephen Rothwell.
   *
   *      This program is free software; you can redistribute it and/or
   *      modify it under the terms of the GNU General Public License
   *      as published by the Free Software Foundation; either version
   *      2 of the License, or (at your option) any later version.
   */
  #include <linux/module.h>
  #include <linux/of.h>
581b605a8   Stephen Rothwell   Consolidate of_fi...
21
  #include <linux/spinlock.h>
1ef4d4242   Stephen Rothwell   Consolidate of_fi...
22
  struct device_node *allnodes;
581b605a8   Stephen Rothwell   Consolidate of_fi...
23
24
25
26
  /* use when traversing tree through the allnext, child, sibling,
   * or parent members of struct device_node.
   */
  DEFINE_RWLOCK(devtree_lock);
97e873e5c   Stephen Rothwell   Start split out o...
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
  
  int of_n_addr_cells(struct device_node *np)
  {
  	const int *ip;
  
  	do {
  		if (np->parent)
  			np = np->parent;
  		ip = of_get_property(np, "#address-cells", NULL);
  		if (ip)
  			return *ip;
  	} while (np->parent);
  	/* No #address-cells property for the root node */
  	return OF_ROOT_NODE_ADDR_CELLS_DEFAULT;
  }
  EXPORT_SYMBOL(of_n_addr_cells);
  
  int of_n_size_cells(struct device_node *np)
  {
  	const int *ip;
  
  	do {
  		if (np->parent)
  			np = np->parent;
  		ip = of_get_property(np, "#size-cells", NULL);
  		if (ip)
  			return *ip;
  	} while (np->parent);
  	/* No #size-cells property for the root node */
  	return OF_ROOT_NODE_SIZE_CELLS_DEFAULT;
  }
  EXPORT_SYMBOL(of_n_size_cells);
581b605a8   Stephen Rothwell   Consolidate of_fi...
59
60
61
62
63
  struct property *of_find_property(const struct device_node *np,
  				  const char *name,
  				  int *lenp)
  {
  	struct property *pp;
64e4566f6   Timur Tabi   [POWERPC] Add nul...
64
65
  	if (!np)
  		return NULL;
581b605a8   Stephen Rothwell   Consolidate of_fi...
66
67
68
69
70
71
72
73
74
75
76
77
78
  	read_lock(&devtree_lock);
  	for (pp = np->properties; pp != 0; pp = pp->next) {
  		if (of_prop_cmp(pp->name, name) == 0) {
  			if (lenp != 0)
  				*lenp = pp->length;
  			break;
  		}
  	}
  	read_unlock(&devtree_lock);
  
  	return pp;
  }
  EXPORT_SYMBOL(of_find_property);
97e873e5c   Stephen Rothwell   Start split out o...
79
80
81
82
83
84
85
86
87
88
89
90
  /*
   * Find a property with a given name for a given node
   * and return the value.
   */
  const void *of_get_property(const struct device_node *np, const char *name,
  			 int *lenp)
  {
  	struct property *pp = of_find_property(np, name, lenp);
  
  	return pp ? pp->value : NULL;
  }
  EXPORT_SYMBOL(of_get_property);
0081cbc37   Stephen Rothwell   Consolidate of_de...
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
  
  /** Checks if the given "compat" string matches one of the strings in
   * the device's "compatible" property
   */
  int of_device_is_compatible(const struct device_node *device,
  		const char *compat)
  {
  	const char* cp;
  	int cplen, l;
  
  	cp = of_get_property(device, "compatible", &cplen);
  	if (cp == NULL)
  		return 0;
  	while (cplen > 0) {
  		if (of_compat_cmp(cp, compat, strlen(compat)) == 0)
  			return 1;
  		l = strlen(cp) + 1;
  		cp += l;
  		cplen -= l;
  	}
  
  	return 0;
  }
  EXPORT_SYMBOL(of_device_is_compatible);
e679c5f44   Stephen Rothwell   Consolidate of_ge...
115
116
  
  /**
834d97d45   Josh Boyer   [POWERPC] Add of_...
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
   *  of_device_is_available - check if a device is available for use
   *
   *  @device: Node to check for availability
   *
   *  Returns 1 if the status property is absent or set to "okay" or "ok",
   *  0 otherwise
   */
  int of_device_is_available(const struct device_node *device)
  {
  	const char *status;
  	int statlen;
  
  	status = of_get_property(device, "status", &statlen);
  	if (status == NULL)
  		return 1;
  
  	if (statlen > 0) {
  		if (!strcmp(status, "okay") || !strcmp(status, "ok"))
  			return 1;
  	}
  
  	return 0;
  }
  EXPORT_SYMBOL(of_device_is_available);
  
  /**
e679c5f44   Stephen Rothwell   Consolidate of_ge...
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
   *	of_get_parent - Get a node's parent if any
   *	@node:	Node to get parent
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_get_parent(const struct device_node *node)
  {
  	struct device_node *np;
  
  	if (!node)
  		return NULL;
  
  	read_lock(&devtree_lock);
  	np = of_node_get(node->parent);
  	read_unlock(&devtree_lock);
  	return np;
  }
  EXPORT_SYMBOL(of_get_parent);
d1cd355a5   Stephen Rothwell   Consolidate of_ge...
162
163
  
  /**
f4eb01070   Michael Ellerman   [POWERPC] Add of_...
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
   *	of_get_next_parent - Iterate to a node's parent
   *	@node:	Node to get parent of
   *
   * 	This is like of_get_parent() except that it drops the
   * 	refcount on the passed node, making it suitable for iterating
   * 	through a node's parents.
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_get_next_parent(struct device_node *node)
  {
  	struct device_node *parent;
  
  	if (!node)
  		return NULL;
  
  	read_lock(&devtree_lock);
  	parent = of_node_get(node->parent);
  	of_node_put(node);
  	read_unlock(&devtree_lock);
  	return parent;
  }
  
  /**
d1cd355a5   Stephen Rothwell   Consolidate of_ge...
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
   *	of_get_next_child - Iterate a node childs
   *	@node:	parent node
   *	@prev:	previous child of the parent node, or NULL to get first
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_get_next_child(const struct device_node *node,
  	struct device_node *prev)
  {
  	struct device_node *next;
  
  	read_lock(&devtree_lock);
  	next = prev ? prev->sibling : node->child;
  	for (; next; next = next->sibling)
  		if (of_node_get(next))
  			break;
  	of_node_put(prev);
  	read_unlock(&devtree_lock);
  	return next;
  }
  EXPORT_SYMBOL(of_get_next_child);
1ef4d4242   Stephen Rothwell   Consolidate of_fi...
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
  
  /**
   *	of_find_node_by_path - Find a node matching a full OF path
   *	@path:	The full path to match
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_find_node_by_path(const char *path)
  {
  	struct device_node *np = allnodes;
  
  	read_lock(&devtree_lock);
  	for (; np; np = np->allnext) {
  		if (np->full_name && (of_node_cmp(np->full_name, path) == 0)
  		    && of_node_get(np))
  			break;
  	}
  	read_unlock(&devtree_lock);
  	return np;
  }
  EXPORT_SYMBOL(of_find_node_by_path);
  
  /**
   *	of_find_node_by_name - Find a node by its "name" property
   *	@from:	The node to start searching from or NULL, the node
   *		you pass will not be searched, only the next one
   *		will; typically, you pass what the previous call
   *		returned. of_node_put() will be called on it
   *	@name:	The name string to match against
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_find_node_by_name(struct device_node *from,
  	const char *name)
  {
  	struct device_node *np;
  
  	read_lock(&devtree_lock);
  	np = from ? from->allnext : allnodes;
  	for (; np; np = np->allnext)
  		if (np->name && (of_node_cmp(np->name, name) == 0)
  		    && of_node_get(np))
  			break;
  	of_node_put(from);
  	read_unlock(&devtree_lock);
  	return np;
  }
  EXPORT_SYMBOL(of_find_node_by_name);
  
  /**
   *	of_find_node_by_type - Find a node by its "device_type" property
   *	@from:	The node to start searching from, or NULL to start searching
   *		the entire device tree. The node you pass will not be
   *		searched, only the next one will; typically, you pass
   *		what the previous call returned. of_node_put() will be
   *		called on from for you.
   *	@type:	The type string to match against
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_find_node_by_type(struct device_node *from,
  	const char *type)
  {
  	struct device_node *np;
  
  	read_lock(&devtree_lock);
  	np = from ? from->allnext : allnodes;
  	for (; np; np = np->allnext)
  		if (np->type && (of_node_cmp(np->type, type) == 0)
  		    && of_node_get(np))
  			break;
  	of_node_put(from);
  	read_unlock(&devtree_lock);
  	return np;
  }
  EXPORT_SYMBOL(of_find_node_by_type);
  
  /**
   *	of_find_compatible_node - Find a node based on type and one of the
   *                                tokens in its "compatible" property
   *	@from:		The node to start searching from or NULL, the node
   *			you pass will not be searched, only the next one
   *			will; typically, you pass what the previous call
   *			returned. of_node_put() will be called on it
   *	@type:		The type string to match "device_type" or NULL to ignore
   *	@compatible:	The string to match to one of the tokens in the device
   *			"compatible" list.
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_find_compatible_node(struct device_node *from,
  	const char *type, const char *compatible)
  {
  	struct device_node *np;
  
  	read_lock(&devtree_lock);
  	np = from ? from->allnext : allnodes;
  	for (; np; np = np->allnext) {
  		if (type
  		    && !(np->type && (of_node_cmp(np->type, type) == 0)))
  			continue;
  		if (of_device_is_compatible(np, compatible) && of_node_get(np))
  			break;
  	}
  	of_node_put(from);
  	read_unlock(&devtree_lock);
  	return np;
  }
  EXPORT_SYMBOL(of_find_compatible_node);
283029d16   Grant Likely   [POWERPC] Add of_...
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
  
  /**
   * of_match_node - Tell if an device_node has a matching of_match structure
   *	@matches:	array of of device match structures to search in
   *	@node:		the of device structure to match against
   *
   *	Low level utility function used by device matching.
   */
  const struct of_device_id *of_match_node(const struct of_device_id *matches,
  					 const struct device_node *node)
  {
  	while (matches->name[0] || matches->type[0] || matches->compatible[0]) {
  		int match = 1;
  		if (matches->name[0])
  			match &= node->name
  				&& !strcmp(matches->name, node->name);
  		if (matches->type[0])
  			match &= node->type
  				&& !strcmp(matches->type, node->type);
  		if (matches->compatible[0])
  			match &= of_device_is_compatible(node,
  						matches->compatible);
  		if (match)
  			return matches;
  		matches++;
  	}
  	return NULL;
  }
  EXPORT_SYMBOL(of_match_node);
  
  /**
   *	of_find_matching_node - Find a node based on an of_device_id match
   *				table.
   *	@from:		The node to start searching from or NULL, the node
   *			you pass will not be searched, only the next one
   *			will; typically, you pass what the previous call
   *			returned. of_node_put() will be called on it
   *	@matches:	array of of device match structures to search in
   *
   *	Returns a node pointer with refcount incremented, use
   *	of_node_put() on it when done.
   */
  struct device_node *of_find_matching_node(struct device_node *from,
  					  const struct of_device_id *matches)
  {
  	struct device_node *np;
  
  	read_lock(&devtree_lock);
  	np = from ? from->allnext : allnodes;
  	for (; np; np = np->allnext) {
  		if (of_match_node(matches, np) && of_node_get(np))
  			break;
  	}
  	of_node_put(from);
  	read_unlock(&devtree_lock);
  	return np;
  }
  EXPORT_SYMBOL(of_find_matching_node);