conditional.c 11.0 KB
Newer Older
L
Linus Torvalds 已提交
1
/* Authors: Karl MacMillan <kmacmillan@tresys.com>
2
 *	    Frank Mayer <mayerf@tresys.com>
L
Linus Torvalds 已提交
3 4 5
 *
 * Copyright (C) 2003 - 2004 Tresys Technology, LLC
 *	This program is free software; you can redistribute it and/or modify
6
 *	it under the terms of the GNU General Public License as published by
L
Linus Torvalds 已提交
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
 *	the Free Software Foundation, version 2.
 */

#include <linux/kernel.h>
#include <linux/errno.h>
#include <linux/string.h>
#include <linux/spinlock.h>
#include <asm/semaphore.h>
#include <linux/slab.h>

#include "security.h"
#include "conditional.h"

/*
 * cond_evaluate_expr evaluates a conditional expr
 * in reverse polish notation. It returns true (1), false (0),
 * or undefined (-1). Undefined occurs when the expression
 * exceeds the stack depth of COND_EXPR_MAXDEPTH.
 */
static int cond_evaluate_expr(struct policydb *p, struct cond_expr *expr)
{

	struct cond_expr *cur;
	int s[COND_EXPR_MAXDEPTH];
	int sp = -1;

	for (cur = expr; cur != NULL; cur = cur->next) {
		switch (cur->expr_type) {
		case COND_BOOL:
			if (sp == (COND_EXPR_MAXDEPTH - 1))
				return -1;
			sp++;
			s[sp] = p->bool_val_to_struct[cur->bool - 1]->state;
			break;
		case COND_NOT:
			if (sp < 0)
				return -1;
			s[sp] = !s[sp];
			break;
		case COND_OR:
			if (sp < 1)
				return -1;
			sp--;
			s[sp] |= s[sp + 1];
			break;
		case COND_AND:
			if (sp < 1)
				return -1;
			sp--;
			s[sp] &= s[sp + 1];
			break;
		case COND_XOR:
			if (sp < 1)
				return -1;
			sp--;
			s[sp] ^= s[sp + 1];
			break;
		case COND_EQ:
			if (sp < 1)
				return -1;
			sp--;
			s[sp] = (s[sp] == s[sp + 1]);
			break;
		case COND_NEQ:
			if (sp < 1)
				return -1;
			sp--;
			s[sp] = (s[sp] != s[sp + 1]);
			break;
		default:
			return -1;
		}
	}
	return s[0];
}

/*
 * evaluate_cond_node evaluates the conditional stored in
 * a struct cond_node and if the result is different than the
 * current state of the node it sets the rules in the true/false
 * list appropriately. If the result of the expression is undefined
 * all of the rules are disabled for safety.
 */
int evaluate_cond_node(struct policydb *p, struct cond_node *node)
{
	int new_state;
93
	struct cond_av_list *cur;
L
Linus Torvalds 已提交
94 95 96 97 98

	new_state = cond_evaluate_expr(p, node->expr);
	if (new_state != node->cur_state) {
		node->cur_state = new_state;
		if (new_state == -1)
J
James Morris 已提交
99
			printk(KERN_ERR "SELinux: expression result was undefined - disabling all rules.\n");
L
Linus Torvalds 已提交
100 101
		/* turn the rules on or off */
		for (cur = node->true_list; cur != NULL; cur = cur->next) {
102
			if (new_state <= 0)
103
				cur->node->key.specified &= ~AVTAB_ENABLED;
104
			else
105
				cur->node->key.specified |= AVTAB_ENABLED;
L
Linus Torvalds 已提交
106 107 108 109
		}

		for (cur = node->false_list; cur != NULL; cur = cur->next) {
			/* -1 or 1 */
110
			if (new_state)
111
				cur->node->key.specified &= ~AVTAB_ENABLED;
112
			else
113
				cur->node->key.specified |= AVTAB_ENABLED;
L
Linus Torvalds 已提交
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
		}
	}
	return 0;
}

int cond_policydb_init(struct policydb *p)
{
	p->bool_val_to_struct = NULL;
	p->cond_list = NULL;
	if (avtab_init(&p->te_cond_avtab))
		return -1;

	return 0;
}

static void cond_av_list_destroy(struct cond_av_list *list)
{
	struct cond_av_list *cur, *next;
	for (cur = list; cur != NULL; cur = next) {
		next = cur->next;
		/* the avtab_ptr_t node is destroy by the avtab */
		kfree(cur);
	}
}

static void cond_node_destroy(struct cond_node *node)
{
	struct cond_expr *cur_expr, *next_expr;

	for (cur_expr = node->expr; cur_expr != NULL; cur_expr = next_expr) {
		next_expr = cur_expr->next;
		kfree(cur_expr);
	}
	cond_av_list_destroy(node->true_list);
	cond_av_list_destroy(node->false_list);
	kfree(node);
}

static void cond_list_destroy(struct cond_node *list)
{
	struct cond_node *next, *cur;

	if (list == NULL)
		return;

	for (cur = list; cur != NULL; cur = next) {
		next = cur->next;
		cond_node_destroy(cur);
	}
}

void cond_policydb_destroy(struct policydb *p)
{
J
Jesper Juhl 已提交
167
	kfree(p->bool_val_to_struct);
L
Linus Torvalds 已提交
168 169 170 171 172 173
	avtab_destroy(&p->te_cond_avtab);
	cond_list_destroy(p->cond_list);
}

int cond_init_bool_indexes(struct policydb *p)
{
J
Jesper Juhl 已提交
174
	kfree(p->bool_val_to_struct);
175 176
	p->bool_val_to_struct = (struct cond_bool_datum **)
		kmalloc(p->p_bools.nprim * sizeof(struct cond_bool_datum *), GFP_KERNEL);
L
Linus Torvalds 已提交
177 178 179 180 181 182 183
	if (!p->bool_val_to_struct)
		return -1;
	return 0;
}

int cond_destroy_bool(void *key, void *datum, void *p)
{
J
Jesper Juhl 已提交
184
	kfree(key);
L
Linus Torvalds 已提交
185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200
	kfree(datum);
	return 0;
}

int cond_index_bool(void *key, void *datum, void *datap)
{
	struct policydb *p;
	struct cond_bool_datum *booldatum;

	booldatum = datum;
	p = datap;

	if (!booldatum->value || booldatum->value > p->p_bools.nprim)
		return -EINVAL;

	p->p_bool_val_to_name[booldatum->value - 1] = key;
201
	p->bool_val_to_struct[booldatum->value - 1] = booldatum;
L
Linus Torvalds 已提交
202 203 204 205 206 207 208 209 210 211 212 213 214 215 216

	return 0;
}

static int bool_isvalid(struct cond_bool_datum *b)
{
	if (!(b->state == 0 || b->state == 1))
		return 0;
	return 1;
}

int cond_read_bool(struct policydb *p, struct hashtab *h, void *fp)
{
	char *key = NULL;
	struct cond_bool_datum *booldatum;
217 218
	__le32 buf[3];
	u32 len;
L
Linus Torvalds 已提交
219 220
	int rc;

J
James Morris 已提交
221
	booldatum = kzalloc(sizeof(struct cond_bool_datum), GFP_KERNEL);
L
Linus Torvalds 已提交
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
	if (!booldatum)
		return -1;

	rc = next_entry(buf, fp, sizeof buf);
	if (rc < 0)
		goto err;

	booldatum->value = le32_to_cpu(buf[0]);
	booldatum->state = le32_to_cpu(buf[1]);

	if (!bool_isvalid(booldatum))
		goto err;

	len = le32_to_cpu(buf[2]);

	key = kmalloc(len + 1, GFP_KERNEL);
	if (!key)
		goto err;
	rc = next_entry(key, fp, len);
	if (rc < 0)
		goto err;
	key[len] = 0;
	if (hashtab_insert(h, key, booldatum))
		goto err;

	return 0;
err:
	cond_destroy_bool(key, booldatum, NULL);
	return -1;
}

253
struct cond_insertf_data {
254 255 256 257 258 259 260 261 262 263 264
	struct policydb *p;
	struct cond_av_list *other;
	struct cond_av_list *head;
	struct cond_av_list *tail;
};

static int cond_insertf(struct avtab *a, struct avtab_key *k, struct avtab_datum *d, void *ptr)
{
	struct cond_insertf_data *data = ptr;
	struct policydb *p = data->p;
	struct cond_av_list *other = data->other, *list, *cur;
L
Linus Torvalds 已提交
265 266 267 268
	struct avtab_node *node_ptr;
	u8 found;


269 270 271 272 273 274 275
	/*
	 * For type rules we have to make certain there aren't any
	 * conflicting rules by searching the te_avtab and the
	 * cond_te_avtab.
	 */
	if (k->specified & AVTAB_TYPE) {
		if (avtab_search(&p->te_avtab, k)) {
J
James Morris 已提交
276
			printk("SELinux: type rule already exists outside of a conditional.");
L
Linus Torvalds 已提交
277
			goto err;
278
		}
L
Linus Torvalds 已提交
279
		/*
280 281 282 283 284 285
		 * If we are reading the false list other will be a pointer to
		 * the true list. We can have duplicate entries if there is only
		 * 1 other entry and it is in our true list.
		 *
		 * If we are reading the true list (other == NULL) there shouldn't
		 * be any other entries.
L
Linus Torvalds 已提交
286
		 */
287 288 289 290
		if (other) {
			node_ptr = avtab_search_node(&p->te_cond_avtab, k);
			if (node_ptr) {
				if (avtab_search_node_next(node_ptr, k->specified)) {
J
James Morris 已提交
291
					printk("SELinux: too many conflicting type rules.");
292 293 294 295 296 297 298
					goto err;
				}
				found = 0;
				for (cur = other; cur != NULL; cur = cur->next) {
					if (cur->node == node_ptr) {
						found = 1;
						break;
L
Linus Torvalds 已提交
299 300
					}
				}
301
				if (!found) {
J
James Morris 已提交
302
					printk("SELinux: conflicting type rules.\n");
L
Linus Torvalds 已提交
303 304 305
					goto err;
				}
			}
306 307
		} else {
			if (avtab_search(&p->te_cond_avtab, k)) {
J
James Morris 已提交
308
				printk("SELinux: conflicting type rules when adding type rule for true.\n");
309 310
				goto err;
			}
L
Linus Torvalds 已提交
311
		}
312
	}
L
Linus Torvalds 已提交
313

314 315
	node_ptr = avtab_insert_nonunique(&p->te_cond_avtab, k, d);
	if (!node_ptr) {
J
James Morris 已提交
316
		printk("SELinux: could not insert rule.");
317
		goto err;
L
Linus Torvalds 已提交
318 319
	}

J
James Morris 已提交
320
	list = kzalloc(sizeof(struct cond_av_list), GFP_KERNEL);
321 322 323 324 325 326 327 328 329
	if (!list)
		goto err;

	list->node = node_ptr;
	if (!data->head)
		data->head = list;
	else
		data->tail->next = list;
	data->tail = list;
L
Linus Torvalds 已提交
330
	return 0;
331

L
Linus Torvalds 已提交
332
err:
333 334
	cond_av_list_destroy(data->head);
	data->head = NULL;
L
Linus Torvalds 已提交
335 336 337
	return -1;
}

338 339 340
static int cond_read_av_list(struct policydb *p, void *fp, struct cond_av_list **ret_list, struct cond_av_list *other)
{
	int i, rc;
341 342
	__le32 buf[1];
	u32 len;
343 344 345 346 347 348 349 350 351 352
	struct cond_insertf_data data;

	*ret_list = NULL;

	len = 0;
	rc = next_entry(buf, fp, sizeof(u32));
	if (rc < 0)
		return -1;

	len = le32_to_cpu(buf[0]);
353
	if (len == 0)
354 355 356 357 358 359 360
		return 0;

	data.p = p;
	data.other = other;
	data.head = NULL;
	data.tail = NULL;
	for (i = 0; i < len; i++) {
361 362
		rc = avtab_read_item(&p->te_cond_avtab, fp, p, cond_insertf,
				     &data);
363 364 365 366 367 368 369 370 371
		if (rc)
			return rc;

	}

	*ret_list = data.head;
	return 0;
}

L
Linus Torvalds 已提交
372 373 374
static int expr_isvalid(struct policydb *p, struct cond_expr *expr)
{
	if (expr->expr_type <= 0 || expr->expr_type > COND_LAST) {
J
James Morris 已提交
375
		printk("SELinux: conditional expressions uses unknown operator.\n");
L
Linus Torvalds 已提交
376 377 378 379
		return 0;
	}

	if (expr->bool > p->p_bools.nprim) {
J
James Morris 已提交
380
		printk("SELinux: conditional expressions uses unknown bool.\n");
L
Linus Torvalds 已提交
381 382 383 384 385 386 387
		return 0;
	}
	return 1;
}

static int cond_read_node(struct policydb *p, struct cond_node *node, void *fp)
{
388 389
	__le32 buf[2];
	u32 len, i;
L
Linus Torvalds 已提交
390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406
	int rc;
	struct cond_expr *expr = NULL, *last = NULL;

	rc = next_entry(buf, fp, sizeof(u32));
	if (rc < 0)
		return -1;

	node->cur_state = le32_to_cpu(buf[0]);

	len = 0;
	rc = next_entry(buf, fp, sizeof(u32));
	if (rc < 0)
		return -1;

	/* expr */
	len = le32_to_cpu(buf[0]);

407
	for (i = 0; i < len; i++) {
L
Linus Torvalds 已提交
408 409 410 411
		rc = next_entry(buf, fp, sizeof(u32) * 2);
		if (rc < 0)
			goto err;

J
James Morris 已提交
412
		expr = kzalloc(sizeof(struct cond_expr), GFP_KERNEL);
413
		if (!expr)
L
Linus Torvalds 已提交
414 415 416 417 418 419 420 421 422 423
			goto err;

		expr->expr_type = le32_to_cpu(buf[0]);
		expr->bool = le32_to_cpu(buf[1]);

		if (!expr_isvalid(p, expr)) {
			kfree(expr);
			goto err;
		}

424
		if (i == 0)
L
Linus Torvalds 已提交
425
			node->expr = expr;
426
		else
L
Linus Torvalds 已提交
427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
			last->next = expr;
		last = expr;
	}

	if (cond_read_av_list(p, fp, &node->true_list, NULL) != 0)
		goto err;
	if (cond_read_av_list(p, fp, &node->false_list, node->true_list) != 0)
		goto err;
	return 0;
err:
	cond_node_destroy(node);
	return -1;
}

int cond_read_list(struct policydb *p, void *fp)
{
	struct cond_node *node, *last = NULL;
444 445
	__le32 buf[1];
	u32 i, len;
L
Linus Torvalds 已提交
446 447 448 449 450 451 452 453
	int rc;

	rc = next_entry(buf, fp, sizeof buf);
	if (rc < 0)
		return -1;

	len = le32_to_cpu(buf[0]);

454 455 456 457
	rc = avtab_alloc(&(p->te_cond_avtab), p->te_avtab.nel);
	if (rc)
		goto err;

L
Linus Torvalds 已提交
458
	for (i = 0; i < len; i++) {
J
James Morris 已提交
459
		node = kzalloc(sizeof(struct cond_node), GFP_KERNEL);
L
Linus Torvalds 已提交
460 461 462 463 464 465
		if (!node)
			goto err;

		if (cond_read_node(p, node, fp) != 0)
			goto err;

466
		if (i == 0)
L
Linus Torvalds 已提交
467
			p->cond_list = node;
468
		else
L
Linus Torvalds 已提交
469 470 471 472 473 474
			last->next = node;
		last = node;
	}
	return 0;
err:
	cond_list_destroy(p->cond_list);
475
	p->cond_list = NULL;
L
Linus Torvalds 已提交
476 477 478 479 480 481 482 483 484 485
	return -1;
}

/* Determine whether additional permissions are granted by the conditional
 * av table, and if so, add them to the result
 */
void cond_compute_av(struct avtab *ctab, struct avtab_key *key, struct av_decision *avd)
{
	struct avtab_node *node;

486
	if (!ctab || !key || !avd)
L
Linus Torvalds 已提交
487 488
		return;

489
	for (node = avtab_search_node(ctab, key); node != NULL;
490
				node = avtab_search_node_next(node, key->specified)) {
491 492
		if ((u16)(AVTAB_ALLOWED|AVTAB_ENABLED) ==
		    (node->key.specified & (AVTAB_ALLOWED|AVTAB_ENABLED)))
493
			avd->allowed |= node->datum.data;
494 495
		if ((u16)(AVTAB_AUDITDENY|AVTAB_ENABLED) ==
		    (node->key.specified & (AVTAB_AUDITDENY|AVTAB_ENABLED)))
L
Linus Torvalds 已提交
496 497 498 499 500
			/* Since a '0' in an auditdeny mask represents a
			 * permission we do NOT want to audit (dontaudit), we use
			 * the '&' operand to ensure that all '0's in the mask
			 * are retained (much unlike the allow and auditallow cases).
			 */
501
			avd->auditdeny &= node->datum.data;
502 503
		if ((u16)(AVTAB_AUDITALLOW|AVTAB_ENABLED) ==
		    (node->key.specified & (AVTAB_AUDITALLOW|AVTAB_ENABLED)))
504
			avd->auditallow |= node->datum.data;
L
Linus Torvalds 已提交
505 506 507
	}
	return;
}