2007-04-29 14:05:22 +00:00
|
|
|
/*
|
2015-08-14 14:58:04 +00:00
|
|
|
* It'd be nice to automatically generate the syscall symbols, but we
|
|
|
|
|
* don't know to what version they will eventually belong to, so for now
|
2007-04-29 14:05:22 +00:00
|
|
|
* it has to be manual.
|
|
|
|
|
*/
|
2006-03-13 00:53:21 +00:00
|
|
|
FBSD_1.0 {
|
|
|
|
|
__acl_aclcheck_fd;
|
|
|
|
|
__acl_aclcheck_file;
|
|
|
|
|
__acl_aclcheck_link;
|
|
|
|
|
__acl_delete_fd;
|
|
|
|
|
__acl_delete_file;
|
|
|
|
|
__acl_delete_link;
|
|
|
|
|
__acl_get_fd;
|
|
|
|
|
__acl_get_file;
|
|
|
|
|
__acl_get_link;
|
|
|
|
|
__acl_set_fd;
|
|
|
|
|
__acl_set_file;
|
|
|
|
|
__acl_set_link;
|
|
|
|
|
__getcwd;
|
|
|
|
|
__mac_execve;
|
|
|
|
|
__mac_get_fd;
|
|
|
|
|
__mac_get_file;
|
|
|
|
|
__mac_get_link;
|
|
|
|
|
__mac_get_pid;
|
|
|
|
|
__mac_get_proc;
|
|
|
|
|
__mac_set_fd;
|
|
|
|
|
__mac_set_file;
|
|
|
|
|
__mac_set_link;
|
|
|
|
|
__mac_set_proc;
|
|
|
|
|
__setugid;
|
|
|
|
|
__syscall;
|
|
|
|
|
__sysctl;
|
2023-11-15 23:40:33 +00:00
|
|
|
_exit;
|
2006-03-13 00:53:21 +00:00
|
|
|
_umtx_op;
|
|
|
|
|
abort2;
|
|
|
|
|
access;
|
|
|
|
|
acct;
|
|
|
|
|
adjtime;
|
|
|
|
|
aio_cancel;
|
|
|
|
|
aio_error;
|
2006-07-23 13:08:54 +00:00
|
|
|
aio_fsync;
|
2006-03-13 00:53:21 +00:00
|
|
|
aio_read;
|
|
|
|
|
aio_return;
|
|
|
|
|
aio_waitcomplete;
|
|
|
|
|
aio_write;
|
|
|
|
|
audit;
|
|
|
|
|
auditctl;
|
|
|
|
|
auditon;
|
|
|
|
|
bind;
|
|
|
|
|
chdir;
|
|
|
|
|
chflags;
|
|
|
|
|
chmod;
|
|
|
|
|
chown;
|
|
|
|
|
chroot;
|
|
|
|
|
clock_getres;
|
|
|
|
|
clock_gettime;
|
|
|
|
|
clock_settime;
|
|
|
|
|
dup;
|
|
|
|
|
dup2;
|
|
|
|
|
eaccess;
|
|
|
|
|
execve;
|
|
|
|
|
extattr_delete_fd;
|
|
|
|
|
extattr_delete_file;
|
|
|
|
|
extattr_delete_link;
|
|
|
|
|
extattr_get_fd;
|
|
|
|
|
extattr_get_file;
|
|
|
|
|
extattr_get_link;
|
|
|
|
|
extattr_list_fd;
|
|
|
|
|
extattr_list_file;
|
|
|
|
|
extattr_list_link;
|
|
|
|
|
extattr_set_fd;
|
|
|
|
|
extattr_set_file;
|
|
|
|
|
extattr_set_link;
|
|
|
|
|
extattrctl;
|
2024-02-20 15:13:09 +00:00
|
|
|
errno;
|
2006-03-13 00:53:21 +00:00
|
|
|
fchdir;
|
|
|
|
|
fchflags;
|
|
|
|
|
fchmod;
|
|
|
|
|
fchown;
|
|
|
|
|
fhopen;
|
|
|
|
|
flock;
|
|
|
|
|
fpathconf;
|
|
|
|
|
futimes;
|
|
|
|
|
getaudit;
|
|
|
|
|
getaudit_addr;
|
|
|
|
|
getauid;
|
|
|
|
|
getcontext;
|
|
|
|
|
getdtablesize;
|
|
|
|
|
getegid;
|
|
|
|
|
geteuid;
|
|
|
|
|
getfh;
|
|
|
|
|
getgid;
|
|
|
|
|
getgroups;
|
|
|
|
|
getitimer;
|
2023-11-17 18:55:25 +00:00
|
|
|
getpagesize;
|
2006-03-13 00:53:21 +00:00
|
|
|
getpeername;
|
|
|
|
|
getpgid;
|
|
|
|
|
getpgrp;
|
|
|
|
|
getpid;
|
|
|
|
|
getppid;
|
|
|
|
|
getpriority;
|
|
|
|
|
getresgid;
|
|
|
|
|
getresuid;
|
|
|
|
|
getrlimit;
|
|
|
|
|
getrusage;
|
|
|
|
|
getsid;
|
|
|
|
|
getsockname;
|
|
|
|
|
getsockopt;
|
|
|
|
|
gettimeofday;
|
|
|
|
|
getuid;
|
|
|
|
|
ioctl;
|
|
|
|
|
issetugid;
|
|
|
|
|
jail;
|
|
|
|
|
jail_attach;
|
|
|
|
|
kenv;
|
|
|
|
|
kill;
|
|
|
|
|
kldfind;
|
|
|
|
|
kldfirstmod;
|
|
|
|
|
kldload;
|
|
|
|
|
kldnext;
|
|
|
|
|
kldstat;
|
|
|
|
|
kldsym;
|
|
|
|
|
kldunload;
|
|
|
|
|
kldunloadf;
|
|
|
|
|
kqueue;
|
2007-05-28 11:36:43 +00:00
|
|
|
kmq_notify; /* Do we want these to be public interfaces? */
|
2007-04-29 14:05:22 +00:00
|
|
|
kmq_open; /* librt uses them to provide mq_xxx. */
|
2006-03-13 00:53:21 +00:00
|
|
|
kmq_setattr;
|
|
|
|
|
kmq_timedreceive;
|
|
|
|
|
kmq_timedsend;
|
|
|
|
|
kmq_unlink;
|
|
|
|
|
ksem_close;
|
|
|
|
|
ksem_destroy;
|
|
|
|
|
ksem_getvalue;
|
|
|
|
|
ksem_init;
|
|
|
|
|
ksem_open;
|
|
|
|
|
ksem_post;
|
|
|
|
|
ksem_timedwait;
|
|
|
|
|
ksem_trywait;
|
|
|
|
|
ksem_unlink;
|
|
|
|
|
ksem_wait;
|
|
|
|
|
ktrace;
|
|
|
|
|
lchflags;
|
|
|
|
|
lchmod;
|
|
|
|
|
lchown;
|
|
|
|
|
lgetfh;
|
|
|
|
|
link;
|
|
|
|
|
lio_listio;
|
|
|
|
|
listen;
|
|
|
|
|
lutimes;
|
|
|
|
|
mac_syscall;
|
|
|
|
|
madvise;
|
|
|
|
|
mincore;
|
|
|
|
|
minherit;
|
|
|
|
|
mkdir;
|
|
|
|
|
mkfifo;
|
|
|
|
|
mlock;
|
|
|
|
|
mlockall;
|
|
|
|
|
modfind;
|
|
|
|
|
modfnext;
|
|
|
|
|
modnext;
|
|
|
|
|
modstat;
|
|
|
|
|
mount;
|
|
|
|
|
mprotect;
|
|
|
|
|
msgget;
|
|
|
|
|
msgrcv;
|
|
|
|
|
msgsnd;
|
|
|
|
|
msgsys;
|
|
|
|
|
munlock;
|
|
|
|
|
munlockall;
|
|
|
|
|
munmap;
|
|
|
|
|
nfssvc;
|
|
|
|
|
nmount;
|
|
|
|
|
ntp_adjtime;
|
|
|
|
|
ntp_gettime;
|
|
|
|
|
pathconf;
|
Integrate the new MPSAFE TTY layer to the FreeBSD operating system.
The last half year I've been working on a replacement TTY layer for the
FreeBSD kernel. The new TTY layer was designed to improve the following:
- Improved driver model:
The old TTY layer has a driver model that is not abstract enough to
make it friendly to use. A good example is the output path, where the
device drivers directly access the output buffers. This means that an
in-kernel PPP implementation must always convert network buffers into
TTY buffers.
If a PPP implementation would be built on top of the new TTY layer
(still needs a hooks layer, though), it would allow the PPP
implementation to directly hand the data to the TTY driver.
- Improved hotplugging:
With the old TTY layer, it isn't entirely safe to destroy TTY's from
the system. This implementation has a two-step destructing design,
where the driver first abandons the TTY. After all threads have left
the TTY, the TTY layer calls a routine in the driver, which can be
used to free resources (unit numbers, etc).
The pts(4) driver also implements this feature, which means
posix_openpt() will now return PTY's that are created on the fly.
- Improved performance:
One of the major improvements is the per-TTY mutex, which is expected
to improve scalability when compared to the old Giant locking.
Another change is the unbuffered copying to userspace, which is both
used on TTY device nodes and PTY masters.
Upgrading should be quite straightforward. Unlike previous versions,
existing kernel configuration files do not need to be changed, except
when they reference device drivers that are listed in UPDATING.
Obtained from: //depot/projects/mpsafetty/...
Approved by: philip (ex-mentor)
Discussed: on the lists, at BSDCan, at the DevSummit
Sponsored by: Snow B.V., the Netherlands
dcons(4) fixed by: kan
2008-08-20 08:31:58 +00:00
|
|
|
posix_openpt;
|
2006-03-13 00:53:21 +00:00
|
|
|
preadv;
|
|
|
|
|
profil;
|
|
|
|
|
pwritev;
|
|
|
|
|
quotactl;
|
|
|
|
|
readlink;
|
|
|
|
|
reboot;
|
|
|
|
|
rename;
|
|
|
|
|
revoke;
|
|
|
|
|
rfork;
|
|
|
|
|
rmdir;
|
|
|
|
|
rtprio;
|
2006-09-21 04:22:46 +00:00
|
|
|
rtprio_thread;
|
2006-03-13 00:53:21 +00:00
|
|
|
sched_get_priority_max;
|
|
|
|
|
sched_get_priority_min;
|
|
|
|
|
sched_getparam;
|
|
|
|
|
sched_getscheduler;
|
|
|
|
|
sched_rr_get_interval;
|
|
|
|
|
sched_setparam;
|
|
|
|
|
sched_setscheduler;
|
|
|
|
|
sched_yield;
|
|
|
|
|
semget;
|
|
|
|
|
semop;
|
|
|
|
|
semsys;
|
|
|
|
|
sendfile;
|
|
|
|
|
setaudit;
|
|
|
|
|
setaudit_addr;
|
|
|
|
|
setauid;
|
|
|
|
|
setegid;
|
|
|
|
|
seteuid;
|
|
|
|
|
setgid;
|
|
|
|
|
setgroups;
|
|
|
|
|
setitimer;
|
|
|
|
|
setlogin;
|
|
|
|
|
setpgid;
|
|
|
|
|
setpriority;
|
|
|
|
|
setregid;
|
|
|
|
|
setresgid;
|
|
|
|
|
setresuid;
|
|
|
|
|
setreuid;
|
|
|
|
|
setrlimit;
|
|
|
|
|
setsid;
|
|
|
|
|
setsockopt;
|
|
|
|
|
settimeofday;
|
|
|
|
|
setuid;
|
2009-04-02 15:53:29 +00:00
|
|
|
shm_unlink;
|
2006-03-13 00:53:21 +00:00
|
|
|
shmat;
|
|
|
|
|
shmdt;
|
|
|
|
|
shmget;
|
|
|
|
|
shmsys;
|
|
|
|
|
shutdown;
|
|
|
|
|
sigaltstack;
|
|
|
|
|
sigpending;
|
|
|
|
|
sigqueue;
|
|
|
|
|
sigreturn;
|
|
|
|
|
socket;
|
|
|
|
|
socketpair;
|
|
|
|
|
swapon;
|
|
|
|
|
symlink;
|
|
|
|
|
sync;
|
|
|
|
|
sysarch;
|
|
|
|
|
syscall;
|
|
|
|
|
thr_create;
|
|
|
|
|
thr_exit;
|
|
|
|
|
thr_kill;
|
2007-08-22 01:56:35 +00:00
|
|
|
thr_kill2;
|
2006-03-13 00:53:21 +00:00
|
|
|
thr_new;
|
|
|
|
|
thr_self;
|
|
|
|
|
thr_set_name;
|
|
|
|
|
thr_suspend;
|
|
|
|
|
thr_wake;
|
2007-05-28 11:36:43 +00:00
|
|
|
ktimer_create; /* Do we want these to be public interfaces? */
|
2007-04-29 14:05:22 +00:00
|
|
|
ktimer_delete; /* librt uses them to provide timer_xxx. */
|
2006-03-13 00:53:21 +00:00
|
|
|
ktimer_getoverrun;
|
|
|
|
|
ktimer_gettime;
|
|
|
|
|
ktimer_settime;
|
|
|
|
|
umask;
|
|
|
|
|
undelete;
|
|
|
|
|
unlink;
|
|
|
|
|
unmount;
|
|
|
|
|
utimes;
|
|
|
|
|
utrace;
|
|
|
|
|
uuidgen;
|
2023-11-15 23:40:33 +00:00
|
|
|
vfork;
|
2006-03-13 00:53:21 +00:00
|
|
|
|
|
|
|
|
__error;
|
|
|
|
|
ftruncate;
|
|
|
|
|
lseek;
|
|
|
|
|
mmap;
|
|
|
|
|
pread;
|
|
|
|
|
pwrite;
|
|
|
|
|
truncate;
|
|
|
|
|
};
|
|
|
|
|
|
2008-03-31 12:14:04 +00:00
|
|
|
FBSD_1.1 {
|
2009-06-24 21:10:52 +00:00
|
|
|
__semctl;
|
2008-04-07 13:53:51 +00:00
|
|
|
cpuset;
|
|
|
|
|
cpuset_getid;
|
|
|
|
|
cpuset_setid;
|
|
|
|
|
cpuset_getaffinity;
|
|
|
|
|
cpuset_setaffinity;
|
2008-03-31 12:14:04 +00:00
|
|
|
faccessat;
|
|
|
|
|
fchmodat;
|
|
|
|
|
fchownat;
|
|
|
|
|
fexecve;
|
|
|
|
|
futimesat;
|
2009-04-29 21:14:15 +00:00
|
|
|
jail_get;
|
|
|
|
|
jail_set;
|
|
|
|
|
jail_remove;
|
2008-03-31 12:14:04 +00:00
|
|
|
linkat;
|
2009-07-08 15:23:18 +00:00
|
|
|
lpathconf;
|
2008-03-31 12:14:04 +00:00
|
|
|
mkdirat;
|
|
|
|
|
mkfifoat;
|
2009-06-24 21:10:52 +00:00
|
|
|
msgctl;
|
2008-03-31 12:14:04 +00:00
|
|
|
readlinkat;
|
|
|
|
|
renameat;
|
Add code to allow the system to handle multiple routing tables.
This particular implementation is designed to be fully backwards compatible
and to be MFC-able to 7.x (and 6.x)
Currently the only protocol that can make use of the multiple tables is IPv4
Similar functionality exists in OpenBSD and Linux.
From my notes:
-----
One thing where FreeBSD has been falling behind, and which by chance I
have some time to work on is "policy based routing", which allows
different
packet streams to be routed by more than just the destination address.
Constraints:
------------
I want to make some form of this available in the 6.x tree
(and by extension 7.x) , but FreeBSD in general needs it so I might as
well do it in -current and back port the portions I need.
One of the ways that this can be done is to have the ability to
instantiate multiple kernel routing tables (which I will now
refer to as "Forwarding Information Bases" or "FIBs" for political
correctness reasons). Which FIB a particular packet uses to make
the next hop decision can be decided by a number of mechanisms.
The policies these mechanisms implement are the "Policies" referred
to in "Policy based routing".
One of the constraints I have if I try to back port this work to
6.x is that it must be implemented as a EXTENSION to the existing
ABIs in 6.x so that third party applications do not need to be
recompiled in timespan of the branch.
This first version will not have some of the bells and whistles that
will come with later versions. It will, for example, be limited to 16
tables in the first commit.
Implementation method, Compatible version. (part 1)
-------------------------------
For this reason I have implemented a "sufficient subset" of a
multiple routing table solution in Perforce, and back-ported it
to 6.x. (also in Perforce though not always caught up with what I
have done in -current/P4). The subset allows a number of FIBs
to be defined at compile time (8 is sufficient for my purposes in 6.x)
and implements the changes needed to allow IPV4 to use them. I have not
done the changes for ipv6 simply because I do not need it, and I do not
have enough knowledge of ipv6 (e.g. neighbor discovery) needed to do it.
Other protocol families are left untouched and should there be
users with proprietary protocol families, they should continue to work
and be oblivious to the existence of the extra FIBs.
To understand how this is done, one must know that the current FIB
code starts everything off with a single dimensional array of
pointers to FIB head structures (One per protocol family), each of
which in turn points to the trie of routes available to that family.
The basic change in the ABI compatible version of the change is to
extent that array to be a 2 dimensional array, so that
instead of protocol family X looking at rt_tables[X] for the
table it needs, it looks at rt_tables[Y][X] when for all
protocol families except ipv4 Y is always 0.
Code that is unaware of the change always just sees the first row
of the table, which of course looks just like the one dimensional
array that existed before.
The entry points rtrequest(), rtalloc(), rtalloc1(), rtalloc_ign()
are all maintained, but refer only to the first row of the array,
so that existing callers in proprietary protocols can continue to
do the "right thing".
Some new entry points are added, for the exclusive use of ipv4 code
called in_rtrequest(), in_rtalloc(), in_rtalloc1() and in_rtalloc_ign(),
which have an extra argument which refers the code to the correct row.
In addition, there are some new entry points (currently called
rtalloc_fib() and friends) that check the Address family being
looked up and call either rtalloc() (and friends) if the protocol
is not IPv4 forcing the action to row 0 or to the appropriate row
if it IS IPv4 (and that info is available). These are for calling
from code that is not specific to any particular protocol. The way
these are implemented would change in the non ABI preserving code
to be added later.
One feature of the first version of the code is that for ipv4,
the interface routes show up automatically on all the FIBs, so
that no matter what FIB you select you always have the basic
direct attached hosts available to you. (rtinit() does this
automatically).
You CAN delete an interface route from one FIB should you want
to but by default it's there. ARP information is also available
in each FIB. It's assumed that the same machine would have the
same MAC address, regardless of which FIB you are using to get
to it.
This brings us as to how the correct FIB is selected for an outgoing
IPV4 packet.
Firstly, all packets have a FIB associated with them. if nothing
has been done to change it, it will be FIB 0. The FIB is changed
in the following ways.
Packets fall into one of a number of classes.
1/ locally generated packets, coming from a socket/PCB.
Such packets select a FIB from a number associated with the
socket/PCB. This in turn is inherited from the process,
but can be changed by a socket option. The process in turn
inherits it on fork. I have written a utility call setfib
that acts a bit like nice..
setfib -3 ping target.example.com # will use fib 3 for ping.
It is an obvious extension to make it a property of a jail
but I have not done so. It can be achieved by combining the setfib and
jail commands.
2/ packets received on an interface for forwarding.
By default these packets would use table 0,
(or possibly a number settable in a sysctl(not yet)).
but prior to routing the firewall can inspect them (see below).
(possibly in the future you may be able to associate a FIB
with packets received on an interface.. An ifconfig arg, but not yet.)
3/ packets inspected by a packet classifier, which can arbitrarily
associate a fib with it on a packet by packet basis.
A fib assigned to a packet by a packet classifier
(such as ipfw) would over-ride a fib associated by
a more default source. (such as cases 1 or 2).
4/ a tcp listen socket associated with a fib will generate
accept sockets that are associated with that same fib.
5/ Packets generated in response to some other packet (e.g. reset
or icmp packets). These should use the FIB associated with the
packet being reponded to.
6/ Packets generated during encapsulation.
gif, tun and other tunnel interfaces will encapsulate using the FIB
that was in effect withthe proces that set up the tunnel.
thus setfib 1 ifconfig gif0 [tunnel instructions]
will set the fib for the tunnel to use to be fib 1.
Routing messages would be associated with their
process, and thus select one FIB or another.
messages from the kernel would be associated with the fib they
refer to and would only be received by a routing socket associated
with that fib. (not yet implemented)
In addition Netstat has been edited to be able to cope with the
fact that the array is now 2 dimensional. (It looks in system
memory using libkvm (!)). Old versions of netstat see only the first FIB.
In addition two sysctls are added to give:
a) the number of FIBs compiled in (active)
b) the default FIB of the calling process.
Early testing experience:
-------------------------
Basically our (IronPort's) appliance does this functionality already
using ipfw fwd but that method has some drawbacks.
For example,
It can't fully simulate a routing table because it can't influence the
socket's choice of local address when a connect() is done.
Testing during the generating of these changes has been
remarkably smooth so far. Multiple tables have co-existed
with no notable side effects, and packets have been routes
accordingly.
ipfw has grown 2 new keywords:
setfib N ip from anay to any
count ip from any to any fib N
In pf there seems to be a requirement to be able to give symbolic names to the
fibs but I do not have that capacity. I am not sure if it is required.
SCTP has interestingly enough built in support for this, called VRFs
in Cisco parlance. it will be interesting to see how that handles it
when it suddenly actually does something.
Where to next:
--------------------
After committing the ABI compatible version and MFCing it, I'd
like to proceed in a forward direction in -current. this will
result in some roto-tilling in the routing code.
Firstly: the current code's idea of having a separate tree per
protocol family, all of the same format, and pointed to by the
1 dimensional array is a bit silly. Especially when one considers that
there is code that makes assumptions about every protocol having the
same internal structures there. Some protocols don't WANT that
sort of structure. (for example the whole idea of a netmask is foreign
to appletalk). This needs to be made opaque to the external code.
My suggested first change is to add routing method pointers to the
'domain' structure, along with information pointing the data.
instead of having an array of pointers to uniform structures,
there would be an array pointing to the 'domain' structures
for each protocol address domain (protocol family),
and the methods this reached would be called. The methods would have
an argument that gives FIB number, but the protocol would be free
to ignore it.
When the ABI can be changed it raises the possibilty of the
addition of a fib entry into the "struct route". Currently,
the structure contains the sockaddr of the desination, and the resulting
fib entry. To make this work fully, one could add a fib number
so that given an address and a fib, one can find the third element, the
fib entry.
Interaction with the ARP layer/ LL layer would need to be
revisited as well. Qing Li has been working on this already.
This work was sponsored by Ironport Systems/Cisco
PR:
Reviewed by: several including rwatson, bz and mlair (parts each)
Approved by:
Obtained from: Ironport systems/Cisco
MFC after:
Security:
PR:
Submitted by:
Reviewed by:
Approved by:
Obtained from:
MFC after:
Security:
2008-05-09 23:00:21 +00:00
|
|
|
setfib;
|
2009-06-24 21:10:52 +00:00
|
|
|
shmctl;
|
2008-03-31 12:14:04 +00:00
|
|
|
symlinkat;
|
|
|
|
|
unlinkat;
|
|
|
|
|
};
|
|
|
|
|
|
2011-03-06 08:52:59 +00:00
|
|
|
FBSD_1.2 {
|
2011-03-12 12:10:17 +00:00
|
|
|
cap_enter;
|
|
|
|
|
cap_getmode;
|
2011-03-06 08:55:36 +00:00
|
|
|
getloginclass;
|
2023-11-17 18:55:25 +00:00
|
|
|
getpagesizes;
|
Add experimental support for process descriptors
A "process descriptor" file descriptor is used to manage processes
without using the PID namespace. This is required for Capsicum's
Capability Mode, where the PID namespace is unavailable.
New system calls pdfork(2) and pdkill(2) offer the functional equivalents
of fork(2) and kill(2). pdgetpid(2) allows querying the PID of the remote
process for debugging purposes. The currently-unimplemented pdwait(2) will,
in the future, allow querying rusage/exit status. In the interim, poll(2)
may be used to check (and wait for) process termination.
When a process is referenced by a process descriptor, it does not issue
SIGCHLD to the parent, making it suitable for use in libraries---a common
scenario when using library compartmentalisation from within large
applications (such as web browsers). Some observers may note a similarity
to Mach task ports; process descriptors provide a subset of this behaviour,
but in a UNIX style.
This feature is enabled by "options PROCDESC", but as with several other
Capsicum kernel features, is not enabled by default in GENERIC 9.0.
Reviewed by: jhb, kib
Approved by: re (kib), mentor (rwatson)
Sponsored by: Google Inc
2011-08-18 22:51:30 +00:00
|
|
|
pdgetpid;
|
|
|
|
|
pdkill;
|
2011-04-18 16:32:22 +00:00
|
|
|
posix_fallocate;
|
2011-03-30 18:08:31 +00:00
|
|
|
rctl_get_racct;
|
|
|
|
|
rctl_get_rules;
|
|
|
|
|
rctl_get_limits;
|
|
|
|
|
rctl_add_rule;
|
|
|
|
|
rctl_remove_rule;
|
2011-03-06 08:55:36 +00:00
|
|
|
setloginclass;
|
2011-03-06 08:52:59 +00:00
|
|
|
};
|
|
|
|
|
|
2011-11-04 04:02:50 +00:00
|
|
|
FBSD_1.3 {
|
2013-06-08 13:27:57 +00:00
|
|
|
aio_mlock;
|
2013-03-02 21:11:30 +00:00
|
|
|
bindat;
|
Merge Capsicum overhaul:
- Capability is no longer separate descriptor type. Now every descriptor
has set of its own capability rights.
- The cap_new(2) system call is left, but it is no longer documented and
should not be used in new code.
- The new syscall cap_rights_limit(2) should be used instead of
cap_new(2), which limits capability rights of the given descriptor
without creating a new one.
- The cap_getrights(2) syscall is renamed to cap_rights_get(2).
- If CAP_IOCTL capability right is present we can further reduce allowed
ioctls list with the new cap_ioctls_limit(2) syscall. List of allowed
ioctls can be retrived with cap_ioctls_get(2) syscall.
- If CAP_FCNTL capability right is present we can further reduce fcntls
that can be used with the new cap_fcntls_limit(2) syscall and retrive
them with cap_fcntls_get(2).
- To support ioctl and fcntl white-listing the filedesc structure was
heavly modified.
- The audit subsystem, kdump and procstat tools were updated to
recognize new syscalls.
- Capability rights were revised and eventhough I tried hard to provide
backward API and ABI compatibility there are some incompatible changes
that are described in detail below:
CAP_CREATE old behaviour:
- Allow for openat(2)+O_CREAT.
- Allow for linkat(2).
- Allow for symlinkat(2).
CAP_CREATE new behaviour:
- Allow for openat(2)+O_CREAT.
Added CAP_LINKAT:
- Allow for linkat(2). ABI: Reuses CAP_RMDIR bit.
- Allow to be target for renameat(2).
Added CAP_SYMLINKAT:
- Allow for symlinkat(2).
Removed CAP_DELETE. Old behaviour:
- Allow for unlinkat(2) when removing non-directory object.
- Allow to be source for renameat(2).
Removed CAP_RMDIR. Old behaviour:
- Allow for unlinkat(2) when removing directory.
Added CAP_RENAMEAT:
- Required for source directory for the renameat(2) syscall.
Added CAP_UNLINKAT (effectively it replaces CAP_DELETE and CAP_RMDIR):
- Allow for unlinkat(2) on any object.
- Required if target of renameat(2) exists and will be removed by this
call.
Removed CAP_MAPEXEC.
CAP_MMAP old behaviour:
- Allow for mmap(2) with any combination of PROT_NONE, PROT_READ and
PROT_WRITE.
CAP_MMAP new behaviour:
- Allow for mmap(2)+PROT_NONE.
Added CAP_MMAP_R:
- Allow for mmap(PROT_READ).
Added CAP_MMAP_W:
- Allow for mmap(PROT_WRITE).
Added CAP_MMAP_X:
- Allow for mmap(PROT_EXEC).
Added CAP_MMAP_RW:
- Allow for mmap(PROT_READ | PROT_WRITE).
Added CAP_MMAP_RX:
- Allow for mmap(PROT_READ | PROT_EXEC).
Added CAP_MMAP_WX:
- Allow for mmap(PROT_WRITE | PROT_EXEC).
Added CAP_MMAP_RWX:
- Allow for mmap(PROT_READ | PROT_WRITE | PROT_EXEC).
Renamed CAP_MKDIR to CAP_MKDIRAT.
Renamed CAP_MKFIFO to CAP_MKFIFOAT.
Renamed CAP_MKNODE to CAP_MKNODEAT.
CAP_READ old behaviour:
- Allow pread(2).
- Disallow read(2), readv(2) (if there is no CAP_SEEK).
CAP_READ new behaviour:
- Allow read(2), readv(2).
- Disallow pread(2) (CAP_SEEK was also required).
CAP_WRITE old behaviour:
- Allow pwrite(2).
- Disallow write(2), writev(2) (if there is no CAP_SEEK).
CAP_WRITE new behaviour:
- Allow write(2), writev(2).
- Disallow pwrite(2) (CAP_SEEK was also required).
Added convinient defines:
#define CAP_PREAD (CAP_SEEK | CAP_READ)
#define CAP_PWRITE (CAP_SEEK | CAP_WRITE)
#define CAP_MMAP_R (CAP_MMAP | CAP_SEEK | CAP_READ)
#define CAP_MMAP_W (CAP_MMAP | CAP_SEEK | CAP_WRITE)
#define CAP_MMAP_X (CAP_MMAP | CAP_SEEK | 0x0000000000000008ULL)
#define CAP_MMAP_RW (CAP_MMAP_R | CAP_MMAP_W)
#define CAP_MMAP_RX (CAP_MMAP_R | CAP_MMAP_X)
#define CAP_MMAP_WX (CAP_MMAP_W | CAP_MMAP_X)
#define CAP_MMAP_RWX (CAP_MMAP_R | CAP_MMAP_W | CAP_MMAP_X)
#define CAP_RECV CAP_READ
#define CAP_SEND CAP_WRITE
#define CAP_SOCK_CLIENT \
(CAP_CONNECT | CAP_GETPEERNAME | CAP_GETSOCKNAME | CAP_GETSOCKOPT | \
CAP_PEELOFF | CAP_RECV | CAP_SEND | CAP_SETSOCKOPT | CAP_SHUTDOWN)
#define CAP_SOCK_SERVER \
(CAP_ACCEPT | CAP_BIND | CAP_GETPEERNAME | CAP_GETSOCKNAME | \
CAP_GETSOCKOPT | CAP_LISTEN | CAP_PEELOFF | CAP_RECV | CAP_SEND | \
CAP_SETSOCKOPT | CAP_SHUTDOWN)
Added defines for backward API compatibility:
#define CAP_MAPEXEC CAP_MMAP_X
#define CAP_DELETE CAP_UNLINKAT
#define CAP_MKDIR CAP_MKDIRAT
#define CAP_RMDIR CAP_UNLINKAT
#define CAP_MKFIFO CAP_MKFIFOAT
#define CAP_MKNOD CAP_MKNODAT
#define CAP_SOCK_ALL (CAP_SOCK_CLIENT | CAP_SOCK_SERVER)
Sponsored by: The FreeBSD Foundation
Reviewed by: Christoph Mallon <christoph.mallon@gmx.de>
Many aspects discussed with: rwatson, benl, jonathan
ABI compatibility discussed with: kib
2013-03-02 00:53:12 +00:00
|
|
|
cap_fcntls_get;
|
|
|
|
|
cap_fcntls_limit;
|
|
|
|
|
cap_ioctls_get;
|
|
|
|
|
cap_ioctls_limit;
|
Change the cap_rights_t type from uint64_t to a structure that we can extend
in the future in a backward compatible (API and ABI) way.
The cap_rights_t represents capability rights. We used to use one bit to
represent one right, but we are running out of spare bits. Currently the new
structure provides place for 114 rights (so 50 more than the previous
cap_rights_t), but it is possible to grow the structure to hold at least 285
rights, although we can make it even larger if 285 rights won't be enough.
The structure definition looks like this:
struct cap_rights {
uint64_t cr_rights[CAP_RIGHTS_VERSION + 2];
};
The initial CAP_RIGHTS_VERSION is 0.
The top two bits in the first element of the cr_rights[] array contain total
number of elements in the array - 2. This means if those two bits are equal to
0, we have 2 array elements.
The top two bits in all remaining array elements should be 0.
The next five bits in all array elements contain array index. Only one bit is
used and bit position in this five-bits range defines array index. This means
there can be at most five array elements in the future.
To define new right the CAPRIGHT() macro must be used. The macro takes two
arguments - an array index and a bit to set, eg.
#define CAP_PDKILL CAPRIGHT(1, 0x0000000000000800ULL)
We still support aliases that combine few rights, but the rights have to belong
to the same array element, eg:
#define CAP_LOOKUP CAPRIGHT(0, 0x0000000000000400ULL)
#define CAP_FCHMOD CAPRIGHT(0, 0x0000000000002000ULL)
#define CAP_FCHMODAT (CAP_FCHMOD | CAP_LOOKUP)
There is new API to manage the new cap_rights_t structure:
cap_rights_t *cap_rights_init(cap_rights_t *rights, ...);
void cap_rights_set(cap_rights_t *rights, ...);
void cap_rights_clear(cap_rights_t *rights, ...);
bool cap_rights_is_set(const cap_rights_t *rights, ...);
bool cap_rights_is_valid(const cap_rights_t *rights);
void cap_rights_merge(cap_rights_t *dst, const cap_rights_t *src);
void cap_rights_remove(cap_rights_t *dst, const cap_rights_t *src);
bool cap_rights_contains(const cap_rights_t *big, const cap_rights_t *little);
Capability rights to the cap_rights_init(), cap_rights_set(),
cap_rights_clear() and cap_rights_is_set() functions are provided by
separating them with commas, eg:
cap_rights_t rights;
cap_rights_init(&rights, CAP_READ, CAP_WRITE, CAP_FSTAT);
There is no need to terminate the list of rights, as those functions are
actually macros that take care of the termination, eg:
#define cap_rights_set(rights, ...) \
__cap_rights_set((rights), __VA_ARGS__, 0ULL)
void __cap_rights_set(cap_rights_t *rights, ...);
Thanks to using one bit as an array index we can assert in those functions that
there are no two rights belonging to different array elements provided
together. For example this is illegal and will be detected, because CAP_LOOKUP
belongs to element 0 and CAP_PDKILL to element 1:
cap_rights_init(&rights, CAP_LOOKUP | CAP_PDKILL);
Providing several rights that belongs to the same array's element this way is
correct, but is not advised. It should only be used for aliases definition.
This commit also breaks compatibility with some existing Capsicum system calls,
but I see no other way to do that. This should be fine as Capsicum is still
experimental and this change is not going to 9.x.
Sponsored by: The FreeBSD Foundation
2013-09-05 00:09:56 +00:00
|
|
|
__cap_rights_get;
|
Merge Capsicum overhaul:
- Capability is no longer separate descriptor type. Now every descriptor
has set of its own capability rights.
- The cap_new(2) system call is left, but it is no longer documented and
should not be used in new code.
- The new syscall cap_rights_limit(2) should be used instead of
cap_new(2), which limits capability rights of the given descriptor
without creating a new one.
- The cap_getrights(2) syscall is renamed to cap_rights_get(2).
- If CAP_IOCTL capability right is present we can further reduce allowed
ioctls list with the new cap_ioctls_limit(2) syscall. List of allowed
ioctls can be retrived with cap_ioctls_get(2) syscall.
- If CAP_FCNTL capability right is present we can further reduce fcntls
that can be used with the new cap_fcntls_limit(2) syscall and retrive
them with cap_fcntls_get(2).
- To support ioctl and fcntl white-listing the filedesc structure was
heavly modified.
- The audit subsystem, kdump and procstat tools were updated to
recognize new syscalls.
- Capability rights were revised and eventhough I tried hard to provide
backward API and ABI compatibility there are some incompatible changes
that are described in detail below:
CAP_CREATE old behaviour:
- Allow for openat(2)+O_CREAT.
- Allow for linkat(2).
- Allow for symlinkat(2).
CAP_CREATE new behaviour:
- Allow for openat(2)+O_CREAT.
Added CAP_LINKAT:
- Allow for linkat(2). ABI: Reuses CAP_RMDIR bit.
- Allow to be target for renameat(2).
Added CAP_SYMLINKAT:
- Allow for symlinkat(2).
Removed CAP_DELETE. Old behaviour:
- Allow for unlinkat(2) when removing non-directory object.
- Allow to be source for renameat(2).
Removed CAP_RMDIR. Old behaviour:
- Allow for unlinkat(2) when removing directory.
Added CAP_RENAMEAT:
- Required for source directory for the renameat(2) syscall.
Added CAP_UNLINKAT (effectively it replaces CAP_DELETE and CAP_RMDIR):
- Allow for unlinkat(2) on any object.
- Required if target of renameat(2) exists and will be removed by this
call.
Removed CAP_MAPEXEC.
CAP_MMAP old behaviour:
- Allow for mmap(2) with any combination of PROT_NONE, PROT_READ and
PROT_WRITE.
CAP_MMAP new behaviour:
- Allow for mmap(2)+PROT_NONE.
Added CAP_MMAP_R:
- Allow for mmap(PROT_READ).
Added CAP_MMAP_W:
- Allow for mmap(PROT_WRITE).
Added CAP_MMAP_X:
- Allow for mmap(PROT_EXEC).
Added CAP_MMAP_RW:
- Allow for mmap(PROT_READ | PROT_WRITE).
Added CAP_MMAP_RX:
- Allow for mmap(PROT_READ | PROT_EXEC).
Added CAP_MMAP_WX:
- Allow for mmap(PROT_WRITE | PROT_EXEC).
Added CAP_MMAP_RWX:
- Allow for mmap(PROT_READ | PROT_WRITE | PROT_EXEC).
Renamed CAP_MKDIR to CAP_MKDIRAT.
Renamed CAP_MKFIFO to CAP_MKFIFOAT.
Renamed CAP_MKNODE to CAP_MKNODEAT.
CAP_READ old behaviour:
- Allow pread(2).
- Disallow read(2), readv(2) (if there is no CAP_SEEK).
CAP_READ new behaviour:
- Allow read(2), readv(2).
- Disallow pread(2) (CAP_SEEK was also required).
CAP_WRITE old behaviour:
- Allow pwrite(2).
- Disallow write(2), writev(2) (if there is no CAP_SEEK).
CAP_WRITE new behaviour:
- Allow write(2), writev(2).
- Disallow pwrite(2) (CAP_SEEK was also required).
Added convinient defines:
#define CAP_PREAD (CAP_SEEK | CAP_READ)
#define CAP_PWRITE (CAP_SEEK | CAP_WRITE)
#define CAP_MMAP_R (CAP_MMAP | CAP_SEEK | CAP_READ)
#define CAP_MMAP_W (CAP_MMAP | CAP_SEEK | CAP_WRITE)
#define CAP_MMAP_X (CAP_MMAP | CAP_SEEK | 0x0000000000000008ULL)
#define CAP_MMAP_RW (CAP_MMAP_R | CAP_MMAP_W)
#define CAP_MMAP_RX (CAP_MMAP_R | CAP_MMAP_X)
#define CAP_MMAP_WX (CAP_MMAP_W | CAP_MMAP_X)
#define CAP_MMAP_RWX (CAP_MMAP_R | CAP_MMAP_W | CAP_MMAP_X)
#define CAP_RECV CAP_READ
#define CAP_SEND CAP_WRITE
#define CAP_SOCK_CLIENT \
(CAP_CONNECT | CAP_GETPEERNAME | CAP_GETSOCKNAME | CAP_GETSOCKOPT | \
CAP_PEELOFF | CAP_RECV | CAP_SEND | CAP_SETSOCKOPT | CAP_SHUTDOWN)
#define CAP_SOCK_SERVER \
(CAP_ACCEPT | CAP_BIND | CAP_GETPEERNAME | CAP_GETSOCKNAME | \
CAP_GETSOCKOPT | CAP_LISTEN | CAP_PEELOFF | CAP_RECV | CAP_SEND | \
CAP_SETSOCKOPT | CAP_SHUTDOWN)
Added defines for backward API compatibility:
#define CAP_MAPEXEC CAP_MMAP_X
#define CAP_DELETE CAP_UNLINKAT
#define CAP_MKDIR CAP_MKDIRAT
#define CAP_RMDIR CAP_UNLINKAT
#define CAP_MKFIFO CAP_MKFIFOAT
#define CAP_MKNOD CAP_MKNODAT
#define CAP_SOCK_ALL (CAP_SOCK_CLIENT | CAP_SOCK_SERVER)
Sponsored by: The FreeBSD Foundation
Reviewed by: Christoph Mallon <christoph.mallon@gmx.de>
Many aspects discussed with: rwatson, benl, jonathan
ABI compatibility discussed with: kib
2013-03-02 00:53:12 +00:00
|
|
|
cap_rights_limit;
|
2013-03-21 22:59:01 +00:00
|
|
|
chflagsat;
|
2012-08-17 02:26:31 +00:00
|
|
|
clock_getcpuclockid2;
|
2013-03-02 21:11:30 +00:00
|
|
|
connectat;
|
2012-07-10 08:31:28 +00:00
|
|
|
ffclock_getcounter;
|
|
|
|
|
ffclock_getestimate;
|
|
|
|
|
ffclock_setestimate;
|
2013-05-01 22:42:42 +00:00
|
|
|
pipe2;
|
2011-11-04 04:02:50 +00:00
|
|
|
posix_fadvise;
|
2013-09-19 18:53:42 +00:00
|
|
|
procctl;
|
2011-11-04 04:02:50 +00:00
|
|
|
};
|
|
|
|
|
|
2014-11-13 05:26:14 +00:00
|
|
|
FBSD_1.4 {
|
2015-01-23 21:07:08 +00:00
|
|
|
futimens;
|
|
|
|
|
utimensat;
|
2014-11-13 05:26:14 +00:00
|
|
|
};
|
|
|
|
|
|
2016-08-15 19:08:51 +00:00
|
|
|
FBSD_1.5 {
|
2023-11-15 20:53:28 +00:00
|
|
|
elf_aux_info;
|
Commit the 64-bit inode project.
Extend the ino_t, dev_t, nlink_t types to 64-bit ints. Modify
struct dirent layout to add d_off, increase the size of d_fileno
to 64-bits, increase the size of d_namlen to 16-bits, and change
the required alignment. Increase struct statfs f_mntfromname[] and
f_mntonname[] array length MNAMELEN to 1024.
ABI breakage is mitigated by providing compatibility using versioned
symbols, ingenious use of the existing padding in structures, and
by employing other tricks. Unfortunately, not everything can be
fixed, especially outside the base system. For instance, third-party
APIs which pass struct stat around are broken in backward and
forward incompatible ways.
Kinfo sysctl MIBs ABI is changed in backward-compatible way, but
there is no general mechanism to handle other sysctl MIBS which
return structures where the layout has changed. It was considered
that the breakage is either in the management interfaces, where we
usually allow ABI slip, or is not important.
Struct xvnode changed layout, no compat shims are provided.
For struct xtty, dev_t tty device member was reduced to uint32_t.
It was decided that keeping ABI compat in this case is more useful
than reporting 64-bit dev_t, for the sake of pstat.
Update note: strictly follow the instructions in UPDATING. Build
and install the new kernel with COMPAT_FREEBSD11 option enabled,
then reboot, and only then install new world.
Credits: The 64-bit inode project, also known as ino64, started life
many years ago as a project by Gleb Kurtsou (gleb). Kirk McKusick
(mckusick) then picked up and updated the patch, and acted as a
flag-waver. Feedback, suggestions, and discussions were carried
by Ed Maste (emaste), John Baldwin (jhb), Jilles Tjoelker (jilles),
and Rick Macklem (rmacklem). Kris Moore (kris) performed an initial
ports investigation followed by an exp-run by Antoine Brodin (antoine).
Essential and all-embracing testing was done by Peter Holm (pho).
The heavy lifting of coordinating all these efforts and bringing the
project to completion were done by Konstantin Belousov (kib).
Sponsored by: The FreeBSD Foundation (emaste, kib)
Differential revision: https://reviews.freebsd.org/D10439
2017-05-23 09:29:05 +00:00
|
|
|
fhstat;
|
|
|
|
|
fhstatfs;
|
|
|
|
|
fstat;
|
|
|
|
|
fstatat;
|
|
|
|
|
fstatfs;
|
|
|
|
|
getdirentries;
|
|
|
|
|
getfsstat;
|
2018-03-21 01:15:45 +00:00
|
|
|
getrandom;
|
Commit the 64-bit inode project.
Extend the ino_t, dev_t, nlink_t types to 64-bit ints. Modify
struct dirent layout to add d_off, increase the size of d_fileno
to 64-bits, increase the size of d_namlen to 16-bits, and change
the required alignment. Increase struct statfs f_mntfromname[] and
f_mntonname[] array length MNAMELEN to 1024.
ABI breakage is mitigated by providing compatibility using versioned
symbols, ingenious use of the existing padding in structures, and
by employing other tricks. Unfortunately, not everything can be
fixed, especially outside the base system. For instance, third-party
APIs which pass struct stat around are broken in backward and
forward incompatible ways.
Kinfo sysctl MIBs ABI is changed in backward-compatible way, but
there is no general mechanism to handle other sysctl MIBS which
return structures where the layout has changed. It was considered
that the breakage is either in the management interfaces, where we
usually allow ABI slip, or is not important.
Struct xvnode changed layout, no compat shims are provided.
For struct xtty, dev_t tty device member was reduced to uint32_t.
It was decided that keeping ABI compat in this case is more useful
than reporting 64-bit dev_t, for the sake of pstat.
Update note: strictly follow the instructions in UPDATING. Build
and install the new kernel with COMPAT_FREEBSD11 option enabled,
then reboot, and only then install new world.
Credits: The 64-bit inode project, also known as ino64, started life
many years ago as a project by Gleb Kurtsou (gleb). Kirk McKusick
(mckusick) then picked up and updated the patch, and acted as a
flag-waver. Feedback, suggestions, and discussions were carried
by Ed Maste (emaste), John Baldwin (jhb), Jilles Tjoelker (jilles),
and Rick Macklem (rmacklem). Kris Moore (kris) performed an initial
ports investigation followed by an exp-run by Antoine Brodin (antoine).
Essential and all-embracing testing was done by Peter Holm (pho).
The heavy lifting of coordinating all these efforts and bringing the
project to completion were done by Konstantin Belousov (kib).
Sponsored by: The FreeBSD Foundation (emaste, kib)
Differential revision: https://reviews.freebsd.org/D10439
2017-05-23 09:29:05 +00:00
|
|
|
mknodat;
|
|
|
|
|
statfs;
|
2018-01-12 22:48:23 +00:00
|
|
|
cpuset_getdomain;
|
|
|
|
|
cpuset_setdomain;
|
2016-08-15 19:08:51 +00:00
|
|
|
};
|
|
|
|
|
|
2018-12-07 15:17:29 +00:00
|
|
|
FBSD_1.6 {
|
2019-09-03 04:16:30 +00:00
|
|
|
__sysctlbyname;
|
2021-01-02 23:34:20 +00:00
|
|
|
aio_readv;
|
|
|
|
|
aio_writev;
|
2020-04-12 21:23:19 +00:00
|
|
|
close_range;
|
2019-07-25 06:05:49 +00:00
|
|
|
copy_file_range;
|
2018-12-07 15:17:29 +00:00
|
|
|
fhlink;
|
|
|
|
|
fhlinkat;
|
|
|
|
|
fhreadlink;
|
|
|
|
|
getfhat;
|
2019-04-06 09:34:26 +00:00
|
|
|
funlinkat;
|
2019-09-26 15:32:28 +00:00
|
|
|
shm_rename;
|
2018-12-07 15:17:29 +00:00
|
|
|
};
|
|
|
|
|
|
2021-08-02 09:50:32 +00:00
|
|
|
FBSD_1.7 {
|
2021-08-05 15:20:42 +00:00
|
|
|
fspacectl;
|
2023-03-31 22:27:00 +00:00
|
|
|
kqueuex;
|
2021-10-07 21:10:07 +00:00
|
|
|
membarrier;
|
2024-03-15 22:52:07 +00:00
|
|
|
sched_getcpu;
|
2021-12-08 21:04:57 +00:00
|
|
|
swapoff;
|
2023-08-24 04:39:54 +00:00
|
|
|
timerfd_create;
|
|
|
|
|
timerfd_gettime;
|
|
|
|
|
timerfd_settime;
|
2021-08-02 09:50:32 +00:00
|
|
|
};
|
|
|
|
|
|
2024-01-19 19:55:11 +00:00
|
|
|
FBSD_1.8 {
|
|
|
|
|
kcmp;
|
|
|
|
|
};
|
|
|
|
|
|
2007-04-29 14:05:22 +00:00
|
|
|
FBSDprivate_1.0 {
|
2023-11-21 18:30:00 +00:00
|
|
|
/* Add entries in sort(1) order */
|
2024-01-11 18:27:20 +00:00
|
|
|
__set_error_selector;
|
|
|
|
|
__sigwait;
|
|
|
|
|
gssd_syscall;
|
|
|
|
|
nlm_syscall;
|
2020-05-28 21:26:26 +00:00
|
|
|
rpctls_syscall;
|
2006-03-13 00:53:21 +00:00
|
|
|
};
|