2 * Copyright (c) 2013 FreeBSD Foundation
5 * This software was developed by Pawel Jakub Dawidek under sponsorship from
6 * the FreeBSD Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
34 * Note that this file is compiled into the kernel and into libc.
37 #include <sys/types.h>
38 #include <sys/capsicum.h>
41 #include <sys/systm.h>
43 #include <machine/stdarg.h>
53 #define assert(exp) KASSERT((exp), ("%s:%u", __func__, __LINE__))
56 #define CAPARSIZE_MIN (CAP_RIGHTS_VERSION_00 + 2)
57 #define CAPARSIZE_MAX (CAP_RIGHTS_VERSION + 2)
60 right_to_index(uint64_t right)
62 static const int bit2idx[] = {
63 -1, 0, 1, -1, 2, -1, -1, -1, 3, -1, -1, -1, -1, -1, -1, -1,
64 4, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
68 idx = CAPIDXBIT(right);
69 assert(idx >= 0 && idx < sizeof(bit2idx) / sizeof(bit2idx[0]));
70 return (bit2idx[idx]);
74 cap_rights_vset(cap_rights_t *rights, va_list ap)
79 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
81 n = CAPARSIZE(rights);
82 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
85 right = (uint64_t)va_arg(ap, unsigned long long);
88 assert(CAPRVER(right) == 0);
89 i = right_to_index(right);
92 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
93 rights->cr_rights[i] |= right;
94 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
99 cap_rights_vclear(cap_rights_t *rights, va_list ap)
104 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
106 n = CAPARSIZE(rights);
107 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
110 right = (uint64_t)va_arg(ap, unsigned long long);
113 assert(CAPRVER(right) == 0);
114 i = right_to_index(right);
117 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
118 rights->cr_rights[i] &= ~(right & 0x01FFFFFFFFFFFFFFULL);
119 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
124 cap_rights_is_vset(const cap_rights_t *rights, va_list ap)
129 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
131 n = CAPARSIZE(rights);
132 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
135 right = (uint64_t)va_arg(ap, unsigned long long);
138 assert(CAPRVER(right) == 0);
139 i = right_to_index(right);
142 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
143 if ((rights->cr_rights[i] & right) != right)
151 __cap_rights_init(int version, cap_rights_t *rights, ...)
156 assert(version == CAP_RIGHTS_VERSION_00);
159 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
161 va_start(ap, rights);
162 cap_rights_vset(rights, ap);
169 __cap_rights_set(cap_rights_t *rights, ...)
173 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
175 va_start(ap, rights);
176 cap_rights_vset(rights, ap);
183 __cap_rights_clear(cap_rights_t *rights, ...)
187 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
189 va_start(ap, rights);
190 cap_rights_vclear(rights, ap);
197 __cap_rights_is_set(const cap_rights_t *rights, ...)
202 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
204 va_start(ap, rights);
205 ret = cap_rights_is_vset(rights, ap);
212 cap_rights_is_valid(const cap_rights_t *rights)
214 cap_rights_t allrights;
217 if (CAPVER(rights) != CAP_RIGHTS_VERSION_00)
219 if (CAPARSIZE(rights) < CAPARSIZE_MIN ||
220 CAPARSIZE(rights) > CAPARSIZE_MAX) {
224 if (!cap_rights_contains(&allrights, rights))
226 for (i = 0; i < CAPARSIZE(rights); i++) {
227 j = right_to_index(rights->cr_rights[i]);
231 if (CAPRVER(rights->cr_rights[i]) != 0)
240 cap_rights_merge(cap_rights_t *dst, const cap_rights_t *src)
244 assert(CAPVER(dst) == CAP_RIGHTS_VERSION_00);
245 assert(CAPVER(src) == CAP_RIGHTS_VERSION_00);
246 assert(CAPVER(dst) == CAPVER(src));
247 assert(cap_rights_is_valid(src));
248 assert(cap_rights_is_valid(dst));
251 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
253 for (i = 0; i < n; i++)
254 dst->cr_rights[i] |= src->cr_rights[i];
256 assert(cap_rights_is_valid(src));
257 assert(cap_rights_is_valid(dst));
263 cap_rights_remove(cap_rights_t *dst, const cap_rights_t *src)
267 assert(CAPVER(dst) == CAP_RIGHTS_VERSION_00);
268 assert(CAPVER(src) == CAP_RIGHTS_VERSION_00);
269 assert(CAPVER(dst) == CAPVER(src));
270 assert(cap_rights_is_valid(src));
271 assert(cap_rights_is_valid(dst));
274 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
276 for (i = 0; i < n; i++) {
278 ~(src->cr_rights[i] & 0x01FFFFFFFFFFFFFFULL);
281 assert(cap_rights_is_valid(src));
282 assert(cap_rights_is_valid(dst));
288 cap_rights_contains(const cap_rights_t *big, const cap_rights_t *little)
292 assert(CAPVER(big) == CAP_RIGHTS_VERSION_00);
293 assert(CAPVER(little) == CAP_RIGHTS_VERSION_00);
294 assert(CAPVER(big) == CAPVER(little));
297 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
299 for (i = 0; i < n; i++) {
300 if ((big->cr_rights[i] & little->cr_rights[i]) !=
301 little->cr_rights[i]) {