mirror of
https://git.FreeBSD.org/src.git
synced 2024-12-26 11:47:31 +00:00
7008be5bd7
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
188 lines
7.1 KiB
C
188 lines
7.1 KiB
C
/*-
|
|
* Copyright (c) 1990, 1993
|
|
* The Regents of the University of California. 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.
|
|
* 4. 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.
|
|
*
|
|
* @(#)filedesc.h 8.1 (Berkeley) 6/2/93
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _SYS_FILEDESC_H_
|
|
#define _SYS_FILEDESC_H_
|
|
|
|
#include <sys/caprights.h>
|
|
#include <sys/queue.h>
|
|
#include <sys/event.h>
|
|
#include <sys/lock.h>
|
|
#include <sys/priority.h>
|
|
#include <sys/sx.h>
|
|
|
|
#include <machine/_limits.h>
|
|
|
|
struct filecaps {
|
|
cap_rights_t fc_rights; /* per-descriptor capability rights */
|
|
u_long *fc_ioctls; /* per-descriptor allowed ioctls */
|
|
int16_t fc_nioctls; /* fc_ioctls array size */
|
|
uint32_t fc_fcntls; /* per-descriptor allowed fcntls */
|
|
};
|
|
|
|
struct filedescent {
|
|
struct file *fde_file; /* file structure for open file */
|
|
struct filecaps fde_caps; /* per-descriptor rights */
|
|
uint8_t fde_flags; /* per-process open file flags */
|
|
};
|
|
#define fde_rights fde_caps.fc_rights
|
|
#define fde_fcntls fde_caps.fc_fcntls
|
|
#define fde_ioctls fde_caps.fc_ioctls
|
|
#define fde_nioctls fde_caps.fc_nioctls
|
|
|
|
/*
|
|
* This structure is used for the management of descriptors. It may be
|
|
* shared by multiple processes.
|
|
*/
|
|
#define NDSLOTTYPE u_long
|
|
|
|
struct filedesc {
|
|
struct filedescent *fd_ofiles; /* open files */
|
|
struct vnode *fd_cdir; /* current directory */
|
|
struct vnode *fd_rdir; /* root directory */
|
|
struct vnode *fd_jdir; /* jail root directory */
|
|
int fd_nfiles; /* number of open files allocated */
|
|
NDSLOTTYPE *fd_map; /* bitmap of free fds */
|
|
int fd_lastfile; /* high-water mark of fd_ofiles */
|
|
int fd_freefile; /* approx. next free file */
|
|
u_short fd_cmask; /* mask for file creation */
|
|
u_short fd_refcnt; /* thread reference count */
|
|
u_short fd_holdcnt; /* hold count on structure + mutex */
|
|
struct sx fd_sx; /* protects members of this struct */
|
|
struct kqlist fd_kqlist; /* list of kqueues on this filedesc */
|
|
int fd_holdleaderscount; /* block fdfree() for shared close() */
|
|
int fd_holdleaderswakeup; /* fdfree() needs wakeup */
|
|
};
|
|
|
|
/*
|
|
* Structure to keep track of (process leader, struct fildedesc) tuples.
|
|
* Each process has a pointer to such a structure when detailed tracking
|
|
* is needed, e.g., when rfork(RFPROC | RFMEM) causes a file descriptor
|
|
* table to be shared by processes having different "p_leader" pointers
|
|
* and thus distinct POSIX style locks.
|
|
*
|
|
* fdl_refcount and fdl_holdcount are protected by struct filedesc mtx.
|
|
*/
|
|
struct filedesc_to_leader {
|
|
int fdl_refcount; /* references from struct proc */
|
|
int fdl_holdcount; /* temporary hold during closef */
|
|
int fdl_wakeup; /* fdfree() waits on closef() */
|
|
struct proc *fdl_leader; /* owner of POSIX locks */
|
|
/* Circular list: */
|
|
struct filedesc_to_leader *fdl_prev;
|
|
struct filedesc_to_leader *fdl_next;
|
|
};
|
|
|
|
/*
|
|
* Per-process open flags.
|
|
*/
|
|
#define UF_EXCLOSE 0x01 /* auto-close on exec */
|
|
|
|
#ifdef _KERNEL
|
|
|
|
/* Flags for do_dup() */
|
|
#define DUP_FIXED 0x1 /* Force fixed allocation. */
|
|
#define DUP_FCNTL 0x2 /* fcntl()-style errors. */
|
|
#define DUP_CLOEXEC 0x4 /* Atomically set FD_CLOEXEC. */
|
|
|
|
/* Lock a file descriptor table. */
|
|
#define FILEDESC_LOCK_INIT(fdp) sx_init(&(fdp)->fd_sx, "filedesc structure")
|
|
#define FILEDESC_LOCK_DESTROY(fdp) sx_destroy(&(fdp)->fd_sx)
|
|
#define FILEDESC_LOCK(fdp) (&(fdp)->fd_sx)
|
|
#define FILEDESC_XLOCK(fdp) sx_xlock(&(fdp)->fd_sx)
|
|
#define FILEDESC_XUNLOCK(fdp) sx_xunlock(&(fdp)->fd_sx)
|
|
#define FILEDESC_SLOCK(fdp) sx_slock(&(fdp)->fd_sx)
|
|
#define FILEDESC_SUNLOCK(fdp) sx_sunlock(&(fdp)->fd_sx)
|
|
|
|
#define FILEDESC_LOCK_ASSERT(fdp) sx_assert(&(fdp)->fd_sx, SX_LOCKED | \
|
|
SX_NOTRECURSED)
|
|
#define FILEDESC_XLOCK_ASSERT(fdp) sx_assert(&(fdp)->fd_sx, SX_XLOCKED | \
|
|
SX_NOTRECURSED)
|
|
#define FILEDESC_UNLOCK_ASSERT(fdp) sx_assert(&(fdp)->fd_sx, SX_UNLOCKED)
|
|
|
|
struct thread;
|
|
|
|
void filecaps_init(struct filecaps *fcaps);
|
|
void filecaps_copy(const struct filecaps *src, struct filecaps *dst);
|
|
void filecaps_move(struct filecaps *src, struct filecaps *dst);
|
|
void filecaps_free(struct filecaps *fcaps);
|
|
|
|
int closef(struct file *fp, struct thread *td);
|
|
int do_dup(struct thread *td, int flags, int old, int new,
|
|
register_t *retval);
|
|
int dupfdopen(struct thread *td, struct filedesc *fdp, int dfd, int mode,
|
|
int openerror, int *indxp);
|
|
int falloc(struct thread *td, struct file **resultfp, int *resultfd,
|
|
int flags);
|
|
int falloc_noinstall(struct thread *td, struct file **resultfp);
|
|
int finstall(struct thread *td, struct file *fp, int *resultfp, int flags,
|
|
struct filecaps *fcaps);
|
|
int fdalloc(struct thread *td, int minfd, int *result);
|
|
int fdallocn(struct thread *td, int minfd, int *fds, int n);
|
|
int fdavail(struct thread *td, int n);
|
|
int fdcheckstd(struct thread *td);
|
|
void fdclose(struct filedesc *fdp, struct file *fp, int idx, struct thread *td);
|
|
void fdcloseexec(struct thread *td);
|
|
struct filedesc *fdcopy(struct filedesc *fdp);
|
|
void fdunshare(struct proc *p, struct thread *td);
|
|
void fdescfree(struct thread *td);
|
|
struct filedesc *fdinit(struct filedesc *fdp);
|
|
struct filedesc *fdshare(struct filedesc *fdp);
|
|
struct filedesc_to_leader *
|
|
filedesc_to_leader_alloc(struct filedesc_to_leader *old,
|
|
struct filedesc *fdp, struct proc *leader);
|
|
int getvnode(struct filedesc *fdp, int fd, cap_rights_t *rightsp,
|
|
struct file **fpp);
|
|
void mountcheckdirs(struct vnode *olddp, struct vnode *newdp);
|
|
void setugidsafety(struct thread *td);
|
|
|
|
/* Return a referenced file from an unlocked descriptor. */
|
|
int fget_unlocked(struct filedesc *fdp, int fd, cap_rights_t *needrightsp,
|
|
int needfcntl, struct file **fpp, cap_rights_t *haverightsp);
|
|
|
|
/* Requires a FILEDESC_{S,X}LOCK held and returns without a ref. */
|
|
static __inline struct file *
|
|
fget_locked(struct filedesc *fdp, int fd)
|
|
{
|
|
|
|
FILEDESC_LOCK_ASSERT(fdp);
|
|
|
|
if (fd < 0 || fd >= fdp->fd_nfiles)
|
|
return (NULL);
|
|
|
|
return (fdp->fd_ofiles[fd].fde_file);
|
|
}
|
|
|
|
#endif /* _KERNEL */
|
|
|
|
#endif /* !_SYS_FILEDESC_H_ */
|