1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318
|
/*
* $Id: cap_text.c,v 1.1.1.1.4.1 2000/07/11 05:29:14 agmorgan Exp $
*
* Copyright (c) 1997-2000 Andrew G Morgan <morgan@linux.kernel.org>
* Copyright (c) 1997 Andrew Main <zefram@dcs.warwick.ac.uk>
*
* This file deals with exchanging internal and textual
* representations of capability sets.
*/
#define LIBCAP_PLEASE_INCLUDE_ARRAY
#include "libcap.h"
#include <ctype.h>
#include <stdio.h>
/* Maximum output text length (16 per cap) */
#define CAP_TEXT_SIZE (16*__CAP_BITS)
#define LIBCAP_EFF 01
#define LIBCAP_INH 02
#define LIBCAP_PER 04
/*
* Parse a textual representation of capabilities, returning an internal
* representation.
*/
#define setbits(A,B) _setbits((__cap_s *)A, (__cap_s *)B)
static void _setbits(__cap_s *a, __cap_s *b)
{
int n;
for (n = __CAP_BLKS; n--; )
a->_blk[n] |= b->_blk[n];
}
#define clrbits(A,B) _clrbits((__cap_s *)A, (__cap_s *)B)
static void _clrbits(__cap_s *a, __cap_s *b)
{
int n;
for (n = __CAP_BLKS; n--; )
a->_blk[n] &= ~b->_blk[n];
}
static char const *namcmp(char const *str, char const *nam)
{
while (*nam && tolower((unsigned char)*str) == *nam) {
str++;
nam++;
}
if (*nam || isalnum((unsigned char)*str) || *str == '_')
return NULL;
return str;
}
static int lookupname(char const **strp)
{
char const *str = *strp;
if (isdigit(*str)) {
unsigned long n = strtoul(str, (char **)&str, 0);
if (n >= __CAP_BITS)
return -1;
*strp = str;
return n;
} else {
char const *s;
int n;
for (n = __CAP_BITS; n--; )
if (_cap_names[n] && (s = namcmp(str, _cap_names[n]))) {
*strp = s;
return n;
}
return -1;
}
}
cap_t cap_from_text(const char *str)
{
cap_t res;
__cap_s allones;
int n;
if (str == NULL) {
_cap_debug("bad argument");
errno = EINVAL;
return NULL;
}
if (!(res = cap_init()))
return NULL;
for (n = __CAP_BLKS; n--; )
allones._blk[n] = -1;
_cap_debug("%s", str);
for (;;) {
char op;
int flags = 0, listed=0;
__cap_s list = {{0}};
/* skip leading spaces */
while (isspace((unsigned char)*str))
str++;
if (!*str) {
_cap_debugcap("e = ", &res->set.effective);
_cap_debugcap("i = ", &res->set.inheritable);
_cap_debugcap("p = ", &res->set.permitted);
return res;
}
/* identify caps specified by this clause */
if (isalnum((unsigned char)*str) || *str == '_') {
for (;;) {
if (namcmp(str, "all")) {
str += 3;
list = allones;
} else {
n = lookupname(&str);
if (n == -1)
goto bad;
list.raise_cap(n);
}
if (*str != ',')
break;
if (!isalnum((unsigned char)*++str) && *str != '_')
goto bad;
}
listed = 1;
} else if (*str == '+' || *str == '-')
goto bad; /* require a list of capabilities */
else
list = allones;
/* identify first operation on list of capabilities */
op = *str++;
if (op == '=' && (*str == '+' || *str == '-')) {
if (!listed)
goto bad;
op = (*str++ == '+' ? 'P':'M'); /* skip '=' and take next op */
} else if (op != '+' && op != '-' && op != '=')
goto bad;
/* cycle through list of actions */
do {
_cap_debug("next char = `%c'", *str);
if (*str && !isspace(*str)) {
switch (*str++) { /* Effective, Inheritable, Permitted */
case 'e':
flags |= LIBCAP_EFF;
break;
case 'i':
flags |= LIBCAP_INH;
break;
case 'p':
flags |= LIBCAP_PER;
break;
default:
goto bad;
}
} else if (op != '=') {
_cap_debug("only '=' can be followed by space");
goto bad;
}
_cap_debug("how to read?");
switch (op) { /* how do we interpret the caps? */
case '=':
case 'P': /* =+ */
case 'M': /* =- */
clrbits(&res->set.effective, &list);
clrbits(&res->set.inheritable, &list);
clrbits(&res->set.permitted, &list);
/* fall through */
if (op == 'M')
goto minus;
case '+':
if (flags & LIBCAP_EFF)
setbits(&res->set.effective, &list);
if (flags & LIBCAP_INH)
setbits(&res->set.inheritable, &list);
if (flags & LIBCAP_PER)
setbits(&res->set.permitted, &list);
break;
case '-':
minus:
if (flags & LIBCAP_EFF)
clrbits(&res->set.effective, &list);
if (flags & LIBCAP_INH)
clrbits(&res->set.inheritable, &list);
if (flags & LIBCAP_PER)
clrbits(&res->set.permitted, &list);
break;
}
/* new directive? */
if (*str == '+' || *str == '-') {
if (!listed) {
_cap_debug("for + & - must list capabilities");
goto bad;
}
flags = 0; /* reset the flags */
op = *str++;
if (!isalpha(*str))
goto bad;
}
} while (*str && !isspace(*str));
_cap_debug("next clause");
}
bad:
cap_free(&res);
errno = EINVAL;
return NULL;
}
/*
* Convert an internal representation to a textual one. The textual
* representation is stored in static memory. It will be overwritten
* on the next occasion that this function is called.
*/
static int getstateflags(cap_t caps, int capno)
{
int f = 0;
if (isset_cap((__cap_s *)(&caps->set.effective),capno))
f |= LIBCAP_EFF;
if (isset_cap((__cap_s *)(&caps->set.inheritable),capno))
f |= LIBCAP_INH;
if (isset_cap((__cap_s *)(&caps->set.permitted),capno))
f |= LIBCAP_PER;
return f;
}
#define CAP_TEXT_BUFFER_ZONE 100
char *cap_to_text(cap_t caps, ssize_t *length_p)
{
char *buf, *cap_string = NULL;
char *p;
int histo[8] = {0};
int m, n, t;
/* Check arguments */
if (!good_cap_t(caps)) {
errno = EINVAL;
return NULL;
}
buf = calloc(1, CAP_TEXT_SIZE+CAP_TEXT_BUFFER_ZONE);
if (buf == NULL) {
errno = ENOMEM;
return NULL;
}
_cap_debugcap("e = ", &caps->set.effective);
_cap_debugcap("i = ", &caps->set.inheritable);
_cap_debugcap("p = ", &caps->set.permitted);
for (n = __CAP_BITS; n--; )
histo[getstateflags(caps, n)]++;
for (m=t=7; t--; )
if (histo[t] > histo[m])
m = t;
/* blank is not a valid capability set */
p = sprintf(buf, "=%s%s%s",
(m & LIBCAP_EFF) ? "e" : "",
(m & LIBCAP_INH) ? "i" : "",
(m & LIBCAP_PER) ? "p" : "" ) + buf;
for (t = 8; t--; )
if (t != m && histo[t]) {
*p++ = ' ';
for (n = 0; n != __CAP_BITS; n++)
if (getstateflags(caps, n) == t) {
if (_cap_names[n])
p += sprintf(p, "%s,", _cap_names[n]);
else
p += sprintf(p, "%d,", n);
if (p - buf > CAP_TEXT_SIZE) {
errno = ERANGE;
goto drop_buf;
}
}
p--;
n = t & ~m;
if (n)
p += sprintf(p, "+%s%s%s",
(n & LIBCAP_EFF) ? "e" : "",
(n & LIBCAP_INH) ? "i" : "",
(n & LIBCAP_PER) ? "p" : "");
n = ~t & m;
if (n)
p += sprintf(p, "-%s%s%s",
(n & LIBCAP_EFF) ? "e" : "",
(n & LIBCAP_INH) ? "i" : "",
(n & LIBCAP_PER) ? "p" : "");
if (p - buf > CAP_TEXT_SIZE) {
errno = ERANGE;
goto drop_buf;
}
}
_cap_debug("%s", buf);
if (length_p) {
*length_p = p - buf;
}
cap_string = _libcap_strdup(buf);
drop_buf:
memset(buf, 0, strlen(buf));
free(buf);
return cap_string;
}
|