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 #include <sys/types.h>
35 #include <sys/capability.h>
36 #include <sys/systm.h>
38 #include <machine/stdarg.h>
40 #include <sys/types.h>
41 #include <sys/capability.h>
51 #define assert(exp) KASSERT((exp), ("%s:%u", __func__, __LINE__))
54 #define CAPARSIZE_MIN (CAP_RIGHTS_VERSION_00 + 2)
55 #define CAPARSIZE_MAX (CAP_RIGHTS_VERSION + 2)
58 right_to_index(uint64_t right)
60 static const int bit2idx[] = {
61 -1, 0, 1, -1, 2, -1, -1, -1, 3, -1, -1, -1, -1, -1, -1, -1,
62 4, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
66 idx = CAPIDXBIT(right);
67 assert(idx >= 0 && idx < sizeof(bit2idx) / sizeof(bit2idx[0]));
68 return (bit2idx[idx]);
72 cap_rights_vset(cap_rights_t *rights, va_list ap)
77 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
79 n = CAPARSIZE(rights);
80 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
83 right = (uint64_t)va_arg(ap, unsigned long long);
86 assert(CAPRVER(right) == 0);
87 i = right_to_index(right);
90 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
91 rights->cr_rights[i] |= right;
92 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
97 cap_rights_vclear(cap_rights_t *rights, va_list ap)
102 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
104 n = CAPARSIZE(rights);
105 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
108 right = (uint64_t)va_arg(ap, unsigned long long);
111 assert(CAPRVER(right) == 0);
112 i = right_to_index(right);
115 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
116 rights->cr_rights[i] &= ~(right & 0x01FFFFFFFFFFFFFFULL);
117 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
122 cap_rights_is_vset(const cap_rights_t *rights, va_list ap)
127 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
129 n = CAPARSIZE(rights);
130 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
133 right = (uint64_t)va_arg(ap, unsigned long long);
136 assert(CAPRVER(right) == 0);
137 i = right_to_index(right);
140 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right));
141 if ((rights->cr_rights[i] & right) != right)
149 __cap_rights_init(int version, cap_rights_t *rights, ...)
154 assert(version == CAP_RIGHTS_VERSION_00);
157 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
158 memset(rights->cr_rights, 0, sizeof(rights->cr_rights[0]) * n);
160 va_start(ap, rights);
161 cap_rights_vset(rights, ap);
168 __cap_rights_set(cap_rights_t *rights, ...)
172 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
174 va_start(ap, rights);
175 cap_rights_vset(rights, ap);
180 __cap_rights_clear(cap_rights_t *rights, ...)
184 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
186 va_start(ap, rights);
187 cap_rights_vclear(rights, ap);
192 __cap_rights_is_set(const cap_rights_t *rights, ...)
197 assert(CAPVER(rights) == CAP_RIGHTS_VERSION_00);
199 va_start(ap, rights);
200 ret = cap_rights_is_vset(rights, ap);
207 cap_rights_is_valid(const cap_rights_t *rights)
209 cap_rights_t allrights;
212 if (CAPVER(rights) != CAP_RIGHTS_VERSION_00)
214 if (CAPARSIZE(rights) < CAPARSIZE_MIN ||
215 CAPARSIZE(rights) > CAPARSIZE_MAX) {
219 if (!cap_rights_contains(&allrights, rights))
221 for (i = 0; i < CAPARSIZE(rights); i++) {
222 j = right_to_index(rights->cr_rights[i]);
226 if (CAPRVER(rights->cr_rights[i]) != 0)
235 cap_rights_merge(cap_rights_t *dst, const cap_rights_t *src)
239 assert(CAPVER(dst) == CAP_RIGHTS_VERSION_00);
240 assert(CAPVER(src) == CAP_RIGHTS_VERSION_00);
241 assert(CAPVER(dst) == CAPVER(src));
242 assert(cap_rights_is_valid(src));
243 assert(cap_rights_is_valid(dst));
246 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
248 for (i = 0; i < n; i++)
249 dst->cr_rights[i] |= src->cr_rights[i];
251 assert(cap_rights_is_valid(src));
252 assert(cap_rights_is_valid(dst));
256 cap_rights_remove(cap_rights_t *dst, const cap_rights_t *src)
260 assert(CAPVER(dst) == CAP_RIGHTS_VERSION_00);
261 assert(CAPVER(src) == CAP_RIGHTS_VERSION_00);
262 assert(CAPVER(dst) == CAPVER(src));
263 assert(cap_rights_is_valid(src));
264 assert(cap_rights_is_valid(dst));
267 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
269 for (i = 0; i < n; i++) {
271 ~(src->cr_rights[i] & 0x01FFFFFFFFFFFFFFULL);
274 assert(cap_rights_is_valid(src));
275 assert(cap_rights_is_valid(dst));
279 cap_rights_contains(const cap_rights_t *big, const cap_rights_t *little)
283 assert(CAPVER(big) == CAP_RIGHTS_VERSION_00);
284 assert(CAPVER(little) == CAP_RIGHTS_VERSION_00);
285 assert(CAPVER(big) == CAPVER(little));
288 assert(n >= CAPARSIZE_MIN && n <= CAPARSIZE_MAX);
290 for (i = 0; i < n; i++) {
291 if ((big->cr_rights[i] & little->cr_rights[i]) !=
292 little->cr_rights[i]) {