/*
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
*
* This software was developed by the Computer Systems Engineering group
* at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
* contributed to Berkeley.
*
* All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Lawrence Berkeley Laboratory.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)openfirm.c 8.1 (Berkeley) 6/11/93
*/
static int
openfirmopen(dev_t dev, int flag, int mode, struct lwp *l)
{
return 0;
}
static int
openfirmioctl(dev_t dev, u_long cmd, void *data, int flags, struct lwp *l)
{
struct ofiocdesc *of;
int node, len, ok, error, s;
char *name, *value;
if (cmd == OFIOCGETOPTNODE) {
s = splhigh();
*(int *) data = OF_finddevice("/options");
splx(s);
return (0);
}
/* Verify node id */
of = (struct ofiocdesc *)data;
node = of->of_nodeid;
if (node != 0 && node != lastnode) {
/* Not an easy one, must search for it */
s = splhigh();
ok = openfirmcheckid(OF_peer(0), node);
splx(s);
if (!ok)
return (EINVAL);
lastnode = node;
}
name = value = NULL;
error = 0;
switch (cmd) {
case OFIOCGET:
if ((flags & FREAD) == 0)
return (EBADF);
if (node == 0)
return (EINVAL);
error = openfirmgetstr(of->of_namelen, of->of_name, &name);
if (error)
break;
s = splhigh();
len = OF_getproplen(node, name);
splx(s);
if (len > of->of_buflen) {
error = ENOMEM;
break;
}
of->of_buflen = len;
/* -1 means no entry; 0 means no value */
if (len <= 0)
break;
value = malloc(len, M_TEMP, M_WAITOK);
if (value == NULL) {
error = ENOMEM;
break;
}
s = splhigh();
len = OF_getprop(node, name, (void *)value, len);
splx(s);
error = copyout(value, of->of_buf, len);
break;
case OFIOCSET:
if ((flags & FWRITE) == 0)
return (EBADF);
if (node == 0)
return (EINVAL);
error = openfirmgetstr(of->of_namelen, of->of_name, &name);
if (error)
break;
error = openfirmgetstr(of->of_buflen, of->of_buf, &value);
if (error)
break;
s = splhigh();
len = OF_setprop(node, name, value, of->of_buflen + 1);
splx(s);
/*
* XXX
* some OF implementations return the buffer length including
* the trailing zero ( like macppc ) and some without ( like
* FirmWorks OF used in Shark )
*/
if ((len != (of->of_buflen + 1)) && (len != of->of_buflen))
error = EINVAL;
break;
case OFIOCNEXTPROP: {
char newname[32];
if ((flags & FREAD) == 0)
return (EBADF);
if (node == 0)
return (EINVAL);
if (of->of_namelen != 0) {
error = openfirmgetstr(of->of_namelen, of->of_name,
&name);
if (error)
break;
}
s = splhigh();
ok = OF_nextprop(node, name, newname);
splx(s);
if (ok == 0) {
error = ENOENT;
break;
}
if (ok == -1) {
error = EINVAL;
break;
}
len = strlen(newname);
if (len > of->of_buflen)
len = of->of_buflen;
else
of->of_buflen = len;
error = copyout(newname, of->of_buf, len);
break;
}
case OFIOCGETNEXT:
if ((flags & FREAD) == 0)
return (EBADF);
s = splhigh();
node = OF_peer(node);
splx(s);
*(int *)data = lastnode = node;
break;
case OFIOCGETCHILD:
if ((flags & FREAD) == 0)
return (EBADF);
if (node == 0)
return (EINVAL);
s = splhigh();
node = OF_child(node);
splx(s);
*(int *)data = lastnode = node;
break;