1*1eaf0ac3Slogwang /*- 2*1eaf0ac3Slogwang * Copyright (c) 2013 FreeBSD Foundation 3*1eaf0ac3Slogwang * All rights reserved. 4*1eaf0ac3Slogwang * 5*1eaf0ac3Slogwang * This software was developed by Pawel Jakub Dawidek under sponsorship from 6*1eaf0ac3Slogwang * the FreeBSD Foundation. 7*1eaf0ac3Slogwang * 8*1eaf0ac3Slogwang * Redistribution and use in source and binary forms, with or without 9*1eaf0ac3Slogwang * modification, are permitted provided that the following conditions 10*1eaf0ac3Slogwang * are met: 11*1eaf0ac3Slogwang * 1. Redistributions of source code must retain the above copyright 12*1eaf0ac3Slogwang * notice, this list of conditions and the following disclaimer. 13*1eaf0ac3Slogwang * 2. Redistributions in binary form must reproduce the above copyright 14*1eaf0ac3Slogwang * notice, this list of conditions and the following disclaimer in the 15*1eaf0ac3Slogwang * documentation and/or other materials provided with the distribution. 16*1eaf0ac3Slogwang * 17*1eaf0ac3Slogwang * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18*1eaf0ac3Slogwang * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19*1eaf0ac3Slogwang * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20*1eaf0ac3Slogwang * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21*1eaf0ac3Slogwang * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22*1eaf0ac3Slogwang * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23*1eaf0ac3Slogwang * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24*1eaf0ac3Slogwang * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25*1eaf0ac3Slogwang * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26*1eaf0ac3Slogwang * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27*1eaf0ac3Slogwang * SUCH DAMAGE. 28*1eaf0ac3Slogwang * 29*1eaf0ac3Slogwang * $FreeBSD$ 30*1eaf0ac3Slogwang */ 31*1eaf0ac3Slogwang 32*1eaf0ac3Slogwang #ifndef _SYS_CAPRIGHTS_H_ 33*1eaf0ac3Slogwang #define _SYS_CAPRIGHTS_H_ 34*1eaf0ac3Slogwang 35*1eaf0ac3Slogwang /* 36*1eaf0ac3Slogwang * The top two bits in the first element of the cr_rights[] array contain 37*1eaf0ac3Slogwang * total number of elements in the array - 2. This means if those two bits are 38*1eaf0ac3Slogwang * equal to 0, we have 2 array elements. 39*1eaf0ac3Slogwang * The top two bits in all remaining array elements should be 0. 40*1eaf0ac3Slogwang * The next five bits contain array index. Only one bit is used and bit position 41*1eaf0ac3Slogwang * in this five-bits range defines array index. This means there can be at most 42*1eaf0ac3Slogwang * five array elements. 43*1eaf0ac3Slogwang */ 44*1eaf0ac3Slogwang #define CAP_RIGHTS_VERSION_00 0 45*1eaf0ac3Slogwang /* 46*1eaf0ac3Slogwang #define CAP_RIGHTS_VERSION_01 1 47*1eaf0ac3Slogwang #define CAP_RIGHTS_VERSION_02 2 48*1eaf0ac3Slogwang #define CAP_RIGHTS_VERSION_03 3 49*1eaf0ac3Slogwang */ 50*1eaf0ac3Slogwang #define CAP_RIGHTS_VERSION CAP_RIGHTS_VERSION_00 51*1eaf0ac3Slogwang 52*1eaf0ac3Slogwang struct cap_rights { 53*1eaf0ac3Slogwang uint64_t cr_rights[CAP_RIGHTS_VERSION + 2]; 54*1eaf0ac3Slogwang }; 55*1eaf0ac3Slogwang 56*1eaf0ac3Slogwang #ifndef _CAP_RIGHTS_T_DECLARED 57*1eaf0ac3Slogwang #define _CAP_RIGHTS_T_DECLARED 58*1eaf0ac3Slogwang typedef struct cap_rights cap_rights_t; 59*1eaf0ac3Slogwang #endif 60*1eaf0ac3Slogwang 61*1eaf0ac3Slogwang #endif /* !_SYS_CAPRIGHTS_H_ */ 62