2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2013 FreeBSD Foundation
7 * This software was developed by Pawel Jakub Dawidek under sponsorship from
8 * the FreeBSD Foundation.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
36 * Note that this file is compiled into the kernel and into libc.
39 #include <sys/types.h>
40 #include <sys/capsicum.h>
43 #include <sys/systm.h>
45 #include <machine/stdarg.h>
55 #define assert(exp) KASSERT((exp), ("%s:%u", __func__, __LINE__))
58 #define CAPARSIZE_MIN (CAP_RIGHTS_VERSION_00 + 2)
59 #define CAPARSIZE_MAX (CAP_RIGHTS_VERSION + 2)
62 right_to_index(uint64_t right)
64 static const int bit2idx[] = {
65 -1, 0, 1, -1, 2, -1, -1, -1, 3, -1, -1, -1, -1, -1, -1, -1,
66 4, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
70 idx = CAPIDXBIT(right);
71 assert(idx >= 0 && idx < sizeof(bit2idx) / sizeof(bit2idx[0]));
72 return (bit2idx[idx]);
76 cap_rights_vset(cap_rights_t *rights, va_list ap)
81 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
83 n = CAPARSIZE(rights);
84 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
87 right = (uint64_t)va_arg(ap, unsigned long long);
90 assert(CAPRVER(right) == 0);
91 i = right_to_index(right);
94 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
95 rights->cr_rights[i] |= right;
96 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
101 cap_rights_vclear(cap_rights_t *rights, va_list ap)
106 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
108 n = CAPARSIZE(rights);
109 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
112 right = (uint64_t)va_arg(ap, unsigned long long);
115 assert(CAPRVER(right) == 0);
116 i = right_to_index(right);
119 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
120 rights->cr_rights[i] &= ~(right & 0x01FFFFFFFFFFFFFFULL);
121 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
126 cap_rights_is_vset(const cap_rights_t *rights, va_list ap)
131 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
133 n = CAPARSIZE(rights);
134 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
137 right = (uint64_t)va_arg(ap, unsigned long long);
140 assert(CAPRVER(right) == 0);
141 i = right_to_index(right);
144 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
145 if ((rights->cr_rights[i] & right) != right)
153 __cap_rights_init(int version, cap_rights_t *rights, ...)
158 assert(version == CAP_RIGHTS_VERSION_00);
161 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
163 va_start(ap, rights);
164 cap_rights_vset(rights, ap);
171 __cap_rights_set(cap_rights_t *rights, ...)
175 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
177 va_start(ap, rights);
178 cap_rights_vset(rights, ap);
185 __cap_rights_clear(cap_rights_t *rights, ...)
189 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
191 va_start(ap, rights);
192 cap_rights_vclear(rights, ap);
199 __cap_rights_is_set(const cap_rights_t *rights, ...)
204 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
206 va_start(ap, rights);
207 ret = cap_rights_is_vset(rights, ap);
214 cap_rights_is_valid(const cap_rights_t *rights)
216 cap_rights_t allrights;
219 if (CAPVER(rights) != CAP_RIGHTS_VERSION_00)
221 if (CAPARSIZE(rights) < CAPARSIZE_MIN ||
222 CAPARSIZE(rights) > CAPARSIZE_MAX) {
226 if (!cap_rights_contains(&allrights, rights))
228 for (i = 0; i < CAPARSIZE(rights); i++) {
229 j = right_to_index(rights->cr_rights[i]);
233 if (CAPRVER(rights->cr_rights[i]) != 0)
242 cap_rights_merge(cap_rights_t *dst, const cap_rights_t *src)
246 assert(CAPVER(dst) == CAP_RIGHTS_VERSION_00);
247 assert(CAPVER(src) == CAP_RIGHTS_VERSION_00);
248 assert(CAPVER(dst) == CAPVER(src));
249 assert(cap_rights_is_valid(src));
250 assert(cap_rights_is_valid(dst));
253 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
255 for (i = 0; i < n; i++)
256 dst->cr_rights[i] |= src->cr_rights[i];
258 assert(cap_rights_is_valid(src));
259 assert(cap_rights_is_valid(dst));
265 cap_rights_remove(cap_rights_t *dst, const cap_rights_t *src)
269 assert(CAPVER(dst) == CAP_RIGHTS_VERSION_00);
270 assert(CAPVER(src) == CAP_RIGHTS_VERSION_00);
271 assert(CAPVER(dst) == CAPVER(src));
272 assert(cap_rights_is_valid(src));
273 assert(cap_rights_is_valid(dst));
276 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
278 for (i = 0; i < n; i++) {
280 ~(src->cr_rights[i] & 0x01FFFFFFFFFFFFFFULL);
283 assert(cap_rights_is_valid(src));
284 assert(cap_rights_is_valid(dst));
290 cap_rights_contains(const cap_rights_t *big, const cap_rights_t *little)
294 assert(CAPVER(big) == CAP_RIGHTS_VERSION_00);
295 assert(CAPVER(little) == CAP_RIGHTS_VERSION_00);
296 assert(CAPVER(big) == CAPVER(little));
299 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
301 for (i = 0; i < n; i++) {
302 if ((big->cr_rights[i] & little->cr_rights[i]) !=
303 little->cr_rights[i]) {