1999-01-30 06:29:48 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1998 Mark Newton
|
|
|
|
* Copyright (c) 1995 Christos Zoulas
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* 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. The name of the author may not be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
|
1999-07-30 12:45:21 +00:00
|
|
|
*
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1999-01-30 06:29:48 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/filedesc.h>
|
|
|
|
#include <sys/sockio.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <net/if.h>
|
|
|
|
|
|
|
|
|
2000-08-31 22:54:09 +00:00
|
|
|
#include <compat/svr4/svr4.h>
|
|
|
|
#include <compat/svr4/svr4_util.h>
|
|
|
|
#include <compat/svr4/svr4_ioctl.h>
|
|
|
|
#include <compat/svr4/svr4_sockio.h>
|
1999-01-30 06:29:48 +00:00
|
|
|
|
|
|
|
static int bsd_to_svr4_flags __P((int));
|
|
|
|
|
|
|
|
#define bsd_to_svr4_flag(a) \
|
|
|
|
if (bf & __CONCAT(I,a)) sf |= __CONCAT(SVR4_I,a)
|
|
|
|
|
|
|
|
static int
|
|
|
|
bsd_to_svr4_flags(bf)
|
|
|
|
int bf;
|
|
|
|
{
|
|
|
|
int sf = 0;
|
|
|
|
bsd_to_svr4_flag(FF_UP);
|
|
|
|
bsd_to_svr4_flag(FF_BROADCAST);
|
|
|
|
bsd_to_svr4_flag(FF_DEBUG);
|
|
|
|
bsd_to_svr4_flag(FF_LOOPBACK);
|
|
|
|
bsd_to_svr4_flag(FF_POINTOPOINT);
|
|
|
|
#if defined(IFF_NOTRAILERS)
|
|
|
|
bsd_to_svr4_flag(FF_NOTRAILERS);
|
|
|
|
#endif
|
|
|
|
bsd_to_svr4_flag(FF_RUNNING);
|
|
|
|
bsd_to_svr4_flag(FF_NOARP);
|
|
|
|
bsd_to_svr4_flag(FF_PROMISC);
|
|
|
|
bsd_to_svr4_flag(FF_ALLMULTI);
|
|
|
|
bsd_to_svr4_flag(FF_MULTICAST);
|
|
|
|
return sf;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
svr4_sock_ioctl(fp, p, retval, fd, cmd, data)
|
|
|
|
struct file *fp;
|
|
|
|
struct proc *p;
|
|
|
|
register_t *retval;
|
|
|
|
int fd;
|
|
|
|
u_long cmd;
|
|
|
|
caddr_t data;
|
|
|
|
{
|
|
|
|
int error;
|
|
|
|
|
|
|
|
*retval = 0;
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case SVR4_SIOCGIFNUM:
|
|
|
|
{
|
|
|
|
struct ifnet *ifp;
|
|
|
|
struct ifaddr *ifa;
|
|
|
|
int ifnum = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This does not return the number of physical
|
|
|
|
* interfaces (if_index), but the number of interfaces
|
|
|
|
* + addresses like ifconf() does, because this number
|
|
|
|
* is used by code that will call SVR4_SIOCGIFCONF to
|
|
|
|
* find the space needed for SVR4_SIOCGIFCONF. So we
|
|
|
|
* count the number of ifreq entries that the next
|
|
|
|
* SVR4_SIOCGIFCONF will return. Maybe a more correct
|
|
|
|
* fix is to make SVR4_SIOCGIFCONF return only one
|
|
|
|
* entry per physical interface?
|
|
|
|
*/
|
|
|
|
|
2001-01-23 21:32:02 +00:00
|
|
|
TAILQ_FOREACH(ifp, &ifnet, if_link)
|
|
|
|
if (TAILQ_FIRST(&ifp->if_addrhead) == NULL)
|
1999-01-30 06:29:48 +00:00
|
|
|
ifnum++;
|
|
|
|
else
|
2001-01-23 21:32:02 +00:00
|
|
|
TAILQ_FOREACH(ifa, &ifp->if_addrhead,
|
|
|
|
ifa_link)
|
1999-01-30 06:29:48 +00:00
|
|
|
ifnum++;
|
|
|
|
|
|
|
|
|
|
|
|
DPRINTF(("SIOCGIFNUM %d\n", ifnum));
|
|
|
|
return copyout(&ifnum, data, sizeof(ifnum));
|
|
|
|
}
|
|
|
|
|
|
|
|
case SVR4_SIOCGIFFLAGS:
|
|
|
|
{
|
|
|
|
struct ifreq br;
|
|
|
|
struct svr4_ifreq sr;
|
|
|
|
|
|
|
|
if ((error = copyin(data, &sr, sizeof(sr))) != 0)
|
|
|
|
return error;
|
|
|
|
|
1999-01-30 09:42:55 +00:00
|
|
|
(void) strncpy(br.ifr_name, sr.svr4_ifr_name,
|
1999-01-30 06:29:48 +00:00
|
|
|
sizeof(br.ifr_name));
|
This is what was "fdfix2.patch," a fix for fd sharing. It's pretty
far-reaching in fd-land, so you'll want to consult the code for
changes. The biggest change is that now, you don't use
fp->f_ops->fo_foo(fp, bar)
but instead
fo_foo(fp, bar),
which increments and decrements the fp refcount upon entry and exit.
Two new calls, fhold() and fdrop(), are provided. Each does what it
seems like it should, and if fdrop() brings the refcount to zero, the
fd is freed as well.
Thanks to peter ("to hell with it, it looks ok to me.") for his review.
Thanks to msmith for keeping me from putting locks everywhere :)
Reviewed by: peter
1999-09-19 17:00:25 +00:00
|
|
|
if ((error = fo_ioctl(fp, SIOCGIFFLAGS,
|
1999-01-30 06:29:48 +00:00
|
|
|
(caddr_t) &br, p)) != 0) {
|
|
|
|
DPRINTF(("SIOCGIFFLAGS (%s) %s: error %d\n",
|
|
|
|
br.ifr_name, sr.svr4_ifr_name, error));
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
sr.svr4_ifr_flags = bsd_to_svr4_flags(br.ifr_flags);
|
|
|
|
DPRINTF(("SIOCGIFFLAGS %s = %x\n",
|
|
|
|
sr.svr4_ifr_name, sr.svr4_ifr_flags));
|
|
|
|
return copyout(&sr, data, sizeof(sr));
|
|
|
|
}
|
|
|
|
|
|
|
|
case SVR4_SIOCGIFCONF:
|
|
|
|
{
|
|
|
|
struct svr4_ifconf sc;
|
|
|
|
|
|
|
|
if ((error = copyin(data, &sc, sizeof(sc))) != 0)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
DPRINTF(("ifreq %d svr4_ifreq %d ifc_len %d\n",
|
|
|
|
sizeof(struct ifreq), sizeof(struct svr4_ifreq),
|
|
|
|
sc.svr4_ifc_len));
|
|
|
|
|
This is what was "fdfix2.patch," a fix for fd sharing. It's pretty
far-reaching in fd-land, so you'll want to consult the code for
changes. The biggest change is that now, you don't use
fp->f_ops->fo_foo(fp, bar)
but instead
fo_foo(fp, bar),
which increments and decrements the fp refcount upon entry and exit.
Two new calls, fhold() and fdrop(), are provided. Each does what it
seems like it should, and if fdrop() brings the refcount to zero, the
fd is freed as well.
Thanks to peter ("to hell with it, it looks ok to me.") for his review.
Thanks to msmith for keeping me from putting locks everywhere :)
Reviewed by: peter
1999-09-19 17:00:25 +00:00
|
|
|
if ((error = fo_ioctl(fp, OSIOCGIFCONF,
|
1999-01-30 06:29:48 +00:00
|
|
|
(caddr_t) &sc, p)) != 0)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
DPRINTF(("SIOCGIFCONF\n"));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
DPRINTF(("Unknown svr4 sockio %lx\n", cmd));
|
|
|
|
return 0; /* ENOSYS really */
|
|
|
|
}
|
|
|
|
}
|