tree.c 6.6 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
/* $Id: tree.c,v 1.10 1998/01/10 22:39:00 ecd Exp $
 * tree.c: Basic device tree traversal/scanning for the Linux
 *         prom library.
 *
 * Copyright (C) 1995 David S. Miller (davem@caip.rutgers.edu)
 * Copyright (C) 1996,1997 Jakub Jelinek (jj@sunsite.mff.cuni.cz)
 */

#include <linux/string.h>
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/sched.h>

#include <asm/openprom.h>
#include <asm/oplib.h>
16
#include <asm/ldc.h>
L
Linus Torvalds 已提交
17 18 19 20

/* Return the child of node 'node' or zero if no this node has no
 * direct descendent.
 */
D
David S. Miller 已提交
21
inline int __prom_getchild(int node)
L
Linus Torvalds 已提交
22 23 24 25
{
	return p1275_cmd ("child", P1275_INOUT(1, 1), node);
}

D
David S. Miller 已提交
26
inline int prom_getchild(int node)
L
Linus Torvalds 已提交
27 28 29 30 31 32 33 34 35
{
	int cnode;

	if(node == -1) return 0;
	cnode = __prom_getchild(node);
	if(cnode == -1) return 0;
	return (int)cnode;
}

D
David S. Miller 已提交
36
inline int prom_getparent(int node)
L
Linus Torvalds 已提交
37 38 39 40 41 42 43 44 45 46 47 48
{
	int cnode;

	if(node == -1) return 0;
	cnode = p1275_cmd ("parent", P1275_INOUT(1, 1), node);
	if(cnode == -1) return 0;
	return (int)cnode;
}

/* Return the next sibling of node 'node' or zero if no more siblings
 * at this level of depth in the tree.
 */
D
David S. Miller 已提交
49
inline int __prom_getsibling(int node)
L
Linus Torvalds 已提交
50
{
51
	return p1275_cmd(prom_peer_name, P1275_INOUT(1, 1), node);
L
Linus Torvalds 已提交
52 53
}

D
David S. Miller 已提交
54
inline int prom_getsibling(int node)
L
Linus Torvalds 已提交
55 56 57
{
	int sibnode;

58 59
	if (node == -1)
		return 0;
L
Linus Torvalds 已提交
60
	sibnode = __prom_getsibling(node);
61 62 63
	if (sibnode == -1)
		return 0;

L
Linus Torvalds 已提交
64 65 66 67 68 69
	return sibnode;
}

/* Return the length in bytes of property 'prop' at node 'node'.
 * Return -1 on error.
 */
D
David S. Miller 已提交
70
inline int prom_getproplen(int node, const char *prop)
L
Linus Torvalds 已提交
71 72 73 74 75 76 77 78 79 80 81 82
{
	if((!node) || (!prop)) return -1;
	return p1275_cmd ("getproplen", 
			  P1275_ARG(1,P1275_ARG_IN_STRING)|
			  P1275_INOUT(2, 1), 
			  node, prop);
}

/* Acquire a property 'prop' at node 'node' and place it in
 * 'buffer' which has a size of 'bufsize'.  If the acquisition
 * was successful the length will be returned, else -1 is returned.
 */
D
David S. Miller 已提交
83 84
inline int prom_getproperty(int node, const char *prop,
			    char *buffer, int bufsize)
L
Linus Torvalds 已提交
85 86 87 88
{
	int plen;

	plen = prom_getproplen(node, prop);
89
	if ((plen > bufsize) || (plen == 0) || (plen == -1)) {
L
Linus Torvalds 已提交
90
		return -1;
91
	} else {
L
Linus Torvalds 已提交
92
		/* Ok, things seem all right. */
93 94 95 96 97
		return p1275_cmd(prom_getprop_name, 
				 P1275_ARG(1,P1275_ARG_IN_STRING)|
				 P1275_ARG(2,P1275_ARG_OUT_BUF)|
				 P1275_INOUT(4, 1), 
				 node, prop, buffer, P1275_SIZE(plen));
L
Linus Torvalds 已提交
98 99 100 101 102 103
	}
}

/* Acquire an integer property and return its value.  Returns -1
 * on failure.
 */
D
David S. Miller 已提交
104
inline int prom_getint(int node, const char *prop)
L
Linus Torvalds 已提交
105 106 107 108 109 110 111 112 113 114 115 116 117
{
	int intprop;

	if(prom_getproperty(node, prop, (char *) &intprop, sizeof(int)) != -1)
		return intprop;

	return -1;
}

/* Acquire an integer property, upon error return the passed default
 * integer.
 */

D
David S. Miller 已提交
118
int prom_getintdefault(int node, const char *property, int deflt)
L
Linus Torvalds 已提交
119 120 121 122 123 124 125 126 127 128
{
	int retval;

	retval = prom_getint(node, property);
	if(retval == -1) return deflt;

	return retval;
}

/* Acquire a boolean property, 1=TRUE 0=FALSE. */
D
David S. Miller 已提交
129
int prom_getbool(int node, const char *prop)
L
Linus Torvalds 已提交
130 131 132 133 134 135 136 137 138 139 140 141
{
	int retval;

	retval = prom_getproplen(node, prop);
	if(retval == -1) return 0;
	return 1;
}

/* Acquire a property whose value is a string, returns a null
 * string on error.  The char pointer is the user supplied string
 * buffer.
 */
D
David S. Miller 已提交
142
void prom_getstring(int node, const char *prop, char *user_buf, int ubuf_size)
L
Linus Torvalds 已提交
143 144 145 146 147 148 149 150 151 152 153 154 155
{
	int len;

	len = prom_getproperty(node, prop, user_buf, ubuf_size);
	if(len != -1) return;
	user_buf[0] = 0;
	return;
}


/* Does the device at node 'node' have name 'name'?
 * YES = 1   NO = 0
 */
D
David S. Miller 已提交
156
int prom_nodematch(int node, const char *name)
L
Linus Torvalds 已提交
157 158 159 160 161 162 163 164 165 166
{
	char namebuf[128];
	prom_getproperty(node, "name", namebuf, sizeof(namebuf));
	if(strcmp(namebuf, name) == 0) return 1;
	return 0;
}

/* Search siblings at 'node_start' for a node with name
 * 'nodename'.  Return node if successful, zero if not.
 */
D
David S. Miller 已提交
167
int prom_searchsiblings(int node_start, const char *nodename)
L
Linus Torvalds 已提交
168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187
{

	int thisnode, error;
	char promlib_buf[128];

	for(thisnode = node_start; thisnode;
	    thisnode=prom_getsibling(thisnode)) {
		error = prom_getproperty(thisnode, "name", promlib_buf,
					 sizeof(promlib_buf));
		/* Should this ever happen? */
		if(error == -1) continue;
		if(strcmp(nodename, promlib_buf)==0) return thisnode;
	}

	return 0;
}

/* Return the first property type for node 'node'.
 * buffer should be at least 32B in length
 */
D
David S. Miller 已提交
188
inline char *prom_firstprop(int node, char *buffer)
L
Linus Torvalds 已提交
189 190 191 192 193 194 195 196 197 198 199 200 201
{
	*buffer = 0;
	if(node == -1) return buffer;
	p1275_cmd ("nextprop", P1275_ARG(2,P1275_ARG_OUT_32B)|
			       P1275_INOUT(3, 0), 
			       node, (char *) 0x0, buffer);
	return buffer;
}

/* Return the property type string after property type 'oprop'
 * at node 'node' .  Returns NULL string if no more
 * property types for this node.
 */
D
David S. Miller 已提交
202
inline char *prom_nextprop(int node, const char *oprop, char *buffer)
L
Linus Torvalds 已提交
203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
{
	char buf[32];

	if(node == -1) {
		*buffer = 0;
		return buffer;
	}
	if (oprop == buffer) {
		strcpy (buf, oprop);
		oprop = buf;
	}
	p1275_cmd ("nextprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
				    P1275_ARG(2,P1275_ARG_OUT_32B)|
				    P1275_INOUT(3, 0), 
				    node, oprop, buffer); 
	return buffer;
}

int
222
prom_finddevice(const char *name)
L
Linus Torvalds 已提交
223
{
224 225 226 227 228 229
	if (!name)
		return 0;
	return p1275_cmd(prom_finddev_name,
			 P1275_ARG(0,P1275_ARG_IN_STRING)|
			 P1275_INOUT(1, 1), 
			 name);
L
Linus Torvalds 已提交
230 231
}

232
int prom_node_has_property(int node, const char *prop)
L
Linus Torvalds 已提交
233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248
{
	char buf [32];
        
	*buf = 0;
	do {
		prom_nextprop(node, buf, buf);
		if(!strcmp(buf, prop))
			return 1;
	} while (*buf);
	return 0;
}
                                                                                           
/* Set property 'pname' at node 'node' to value 'value' which has a length
 * of 'size' bytes.  Return the number of bytes the prom accepted.
 */
int
249
prom_setprop(int node, const char *pname, char *value, int size)
L
Linus Torvalds 已提交
250
{
251 252 253 254
	if (size == 0)
		return 0;
	if ((pname == 0) || (value == 0))
		return 0;
L
Linus Torvalds 已提交
255
	
256 257 258 259 260 261
#ifdef CONFIG_SUN_LDOMS
	if (ldom_domaining_enabled) {
		ldom_set_var(pname, value);
		return 0;
	}
#endif
L
Linus Torvalds 已提交
262 263 264 265 266 267
	return p1275_cmd ("setprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
					  P1275_ARG(2,P1275_ARG_IN_BUF)|
					  P1275_INOUT(4, 1), 
					  node, pname, value, P1275_SIZE(size));
}

D
David S. Miller 已提交
268
inline int prom_inst2pkg(int inst)
L
Linus Torvalds 已提交
269 270 271 272 273 274 275 276 277 278 279 280
{
	int node;
	
	node = p1275_cmd ("instance-to-package", P1275_INOUT(1, 1), inst);
	if (node == -1) return 0;
	return node;
}

/* Return 'node' assigned to a particular prom 'path'
 * FIXME: Should work for v0 as well
 */
int
281
prom_pathtoinode(const char *path)
L
Linus Torvalds 已提交
282 283 284 285 286 287 288 289 290 291
{
	int node, inst;

	inst = prom_devopen (path);
	if (inst == 0) return 0;
	node = prom_inst2pkg (inst);
	prom_devclose (inst);
	if (node == -1) return 0;
	return node;
}
292 293 294 295 296 297 298 299

int prom_ihandle2path(int handle, char *buffer, int bufsize)
{
	return p1275_cmd("instance-to-path",
			 P1275_ARG(1,P1275_ARG_OUT_BUF)|
			 P1275_INOUT(3, 1),
			 handle, buffer, P1275_SIZE(bufsize));
}