[linux-block.git] / security / selinux / ss / avtab.c

/*
 * Implementation of the access vector table type.
 *
 * Author : Stephen Smalley, <sds@epoch.ncsc.mil>
 */

/* Updated: Frank Mayer <mayerf@tresys.com> and Karl MacMillan <kmacmillan@tresys.com>
 *
 *	Added conditional policy language extensions
 *
 * Copyright (C) 2003 Tresys Technology, LLC
 *	This program is free software; you can redistribute it and/or modify
 *	it under the terms of the GNU General Public License as published by
 *	the Free Software Foundation, version 2.
 *
 * Updated: Yuichi Nakamura <ynakam@hitachisoft.jp>
 *	Tuned number of hash slots for avtab to reduce memory usage
 */

#include <linux/kernel.h>
#include <linux/slab.h>
#include <linux/errno.h>
#include "avtab.h"
#include "policydb.h"

static struct kmem_cache *avtab_node_cachep;
static struct kmem_cache *avtab_xperms_cachep;

/* Based on MurmurHash3, written by Austin Appleby and placed in the
 * public domain.
 */
static inline int avtab_hash(struct avtab_key *keyp, u32 mask)
{
	static const u32 c1 = 0xcc9e2d51;
	static const u32 c2 = 0x1b873593;
	static const u32 r1 = 15;
	static const u32 r2 = 13;
	static const u32 m  = 5;
	static const u32 n  = 0xe6546b64;

	u32 hash = 0;

#define mix(input) { \
	u32 v = input; \
	v *= c1; \
	v = (v << r1) | (v >> (32 - r1)); \
	v *= c2; \
	hash ^= v; \
	hash = (hash << r2) | (hash >> (32 - r2)); \
	hash = hash * m + n; \
}

	mix(keyp->target_class);
	mix(keyp->target_type);
	mix(keyp->source_type);

#undef mix

	hash ^= hash >> 16;
	hash *= 0x85ebca6b;
	hash ^= hash >> 13;
	hash *= 0xc2b2ae35;
	hash ^= hash >> 16;

	return hash & mask;
}

static struct avtab_node*
avtab_insert_node(struct avtab *h, int hvalue,
		  struct avtab_node *prev, struct avtab_node *cur,
		  struct avtab_key *key, struct avtab_datum *datum)
{
	struct avtab_node *newnode;
	struct avtab_extended_perms *xperms;
	newnode = kmem_cache_zalloc(avtab_node_cachep, GFP_KERNEL);
	if (newnode == NULL)
		return NULL;
	newnode->key = *key;

	if (key->specified & AVTAB_XPERMS) {
		xperms = kmem_cache_zalloc(avtab_xperms_cachep, GFP_KERNEL);
		if (xperms == NULL) {
			kmem_cache_free(avtab_node_cachep, newnode);
			return NULL;
		}
		*xperms = *(datum->u.xperms);
		newnode->datum.u.xperms = xperms;
	} else {
		newnode->datum.u.data = datum->u.data;
	}

	if (prev) {
		newnode->next = prev->next;
		prev->next = newnode;
	} else {
		newnode->next = flex_array_get_ptr(h->htable, hvalue);
		if (flex_array_put_ptr(h->htable, hvalue, newnode,
				       GFP_KERNEL|__GFP_ZERO)) {
			kmem_cache_free(avtab_node_cachep, newnode);
			return NULL;
		}
	}

	h->nel++;
	return newnode;
}

static int avtab_insert(struct avtab *h, struct avtab_key *key, struct avtab_datum *datum)
{
	int hvalue;
	struct avtab_node *prev, *cur, *newnode;
	u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD);

	if (!h || !h->htable)
		return -EINVAL;

	hvalue = avtab_hash(key, h->mask);
	for (prev = NULL, cur = flex_array_get_ptr(h->htable, hvalue);
	     cur;
	     prev = cur, cur = cur->next) {
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class == cur->key.target_class &&
		    (specified & cur->key.specified)) {
			/* extended perms may not be unique */
			if (specified & AVTAB_XPERMS)
				break;
			return -EEXIST;
		}
		if (key->source_type < cur->key.source_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type < cur->key.target_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class < cur->key.target_class)
			break;
	}

	newnode = avtab_insert_node(h, hvalue, prev, cur, key, datum);
	if (!newnode)
		return -ENOMEM;

	return 0;
}

/* Unlike avtab_insert(), this function allow multiple insertions of the same
 * key/specified mask into the table, as needed by the conditional avtab.
 * It also returns a pointer to the node inserted.
 */
struct avtab_node *
avtab_insert_nonunique(struct avtab *h, struct avtab_key *key, struct avtab_datum *datum)
{
	int hvalue;
	struct avtab_node *prev, *cur;
	u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD);

	if (!h || !h->htable)
		return NULL;
	hvalue = avtab_hash(key, h->mask);
	for (prev = NULL, cur = flex_array_get_ptr(h->htable, hvalue);
	     cur;
	     prev = cur, cur = cur->next) {
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class == cur->key.target_class &&
		    (specified & cur->key.specified))
			break;
		if (key->source_type < cur->key.source_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type < cur->key.target_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class < cur->key.target_class)
			break;
	}
	return avtab_insert_node(h, hvalue, prev, cur, key, datum);
}

struct avtab_datum *avtab_search(struct avtab *h, struct avtab_key *key)
{
	int hvalue;
	struct avtab_node *cur;
	u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD);

	if (!h || !h->htable)
		return NULL;

	hvalue = avtab_hash(key, h->mask);
	for (cur = flex_array_get_ptr(h->htable, hvalue); cur;
	     cur = cur->next) {
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class == cur->key.target_class &&
		    (specified & cur->key.specified))
			return &cur->datum;

		if (key->source_type < cur->key.source_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type < cur->key.target_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class < cur->key.target_class)
			break;
	}

	return NULL;
}

/* This search function returns a node pointer, and can be used in
 * conjunction with avtab_search_next_node()
 */
struct avtab_node*
avtab_search_node(struct avtab *h, struct avtab_key *key)
{
	int hvalue;
	struct avtab_node *cur;
	u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD);

	if (!h || !h->htable)
		return NULL;

	hvalue = avtab_hash(key, h->mask);
	for (cur = flex_array_get_ptr(h->htable, hvalue); cur;
	     cur = cur->next) {
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class == cur->key.target_class &&
		    (specified & cur->key.specified))
			return cur;

		if (key->source_type < cur->key.source_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type < cur->key.target_type)
			break;
		if (key->source_type == cur->key.source_type &&
		    key->target_type == cur->key.target_type &&
		    key->target_class < cur->key.target_class)
			break;
	}
	return NULL;
}

struct avtab_node*
avtab_search_node_next(struct avtab_node *node, int specified)
{
	struct avtab_node *cur;

	if (!node)
		return NULL;

	specified &= ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD);
	for (cur = node->next; cur; cur = cur->next) {
		if (node->key.source_type == cur->key.source_type &&
		    node->key.target_type == cur->key.target_type &&
		    node->key.target_class == cur->key.target_class &&
		    (specified & cur->key.specified))
			return cur;

		if (node->key.source_type < cur->key.source_type)
			break;
		if (node->key.source_type == cur->key.source_type &&
		    node->key.target_type < cur->key.target_type)
			break;
		if (node->key.source_type == cur->key.source_type &&
		    node->key.target_type == cur->key.target_type &&
		    node->key.target_class < cur->key.target_class)
			break;
	}
	return NULL;
}

void avtab_destroy(struct avtab *h)
{
	int i;
	struct avtab_node *cur, *temp;

	if (!h || !h->htable)
		return;

	for (i = 0; i < h->nslot; i++) {
		cur = flex_array_get_ptr(h->htable, i);
		while (cur) {
			temp = cur;
			cur = cur->next;
			if (temp->key.specified & AVTAB_XPERMS)
				kmem_cache_free(avtab_xperms_cachep,
						temp->datum.u.xperms);
			kmem_cache_free(avtab_node_cachep, temp);
		}
	}
	flex_array_free(h->htable);
	h->htable = NULL;
	h->nslot = 0;
	h->mask = 0;
}

int avtab_init(struct avtab *h)
{
	h->htable = NULL;
	h->nel = 0;
	return 0;
}

int avtab_alloc(struct avtab *h, u32 nrules)
{
	u32 mask = 0;
	u32 shift = 0;
	u32 work = nrules;
	u32 nslot = 0;

	if (nrules == 0)
		goto avtab_alloc_out;

	while (work) {
		work  = work >> 1;
		shift++;
	}
	if (shift > 2)
		shift = shift - 2;
	nslot = 1 << shift;
	if (nslot > MAX_AVTAB_HASH_BUCKETS)
		nslot = MAX_AVTAB_HASH_BUCKETS;
	mask = nslot - 1;

	h->htable = flex_array_alloc(sizeof(struct avtab_node *), nslot,
				     GFP_KERNEL | __GFP_ZERO);
	if (!h->htable)
		return -ENOMEM;

 avtab_alloc_out:
	h->nel = 0;
	h->nslot = nslot;
	h->mask = mask;
	printk(KERN_DEBUG "SELinux: %d avtab hash slots, %d rules.\n",
	       h->nslot, nrules);
	return 0;
}

void avtab_hash_eval(struct avtab *h, char *tag)
{
	int i, chain_len, slots_used, max_chain_len;
	unsigned long long chain2_len_sum;
	struct avtab_node *cur;

	slots_used = 0;
	max_chain_len = 0;
	chain2_len_sum = 0;
	for (i = 0; i < h->nslot; i++) {
		cur = flex_array_get_ptr(h->htable, i);
		if (cur) {
			slots_used++;
			chain_len = 0;
			while (cur) {
				chain_len++;
				cur = cur->next;
			}

			if (chain_len > max_chain_len)
				max_chain_len = chain_len;
			chain2_len_sum += chain_len * chain_len;
		}
	}

	printk(KERN_DEBUG "SELinux: %s:  %d entries and %d/%d buckets used, "
	       "longest chain length %d sum of chain length^2 %llu\n",
	       tag, h->nel, slots_used, h->nslot, max_chain_len,
	       chain2_len_sum);
}

static uint16_t spec_order[] = {
	AVTAB_ALLOWED,
	AVTAB_AUDITDENY,
	AVTAB_AUDITALLOW,
	AVTAB_TRANSITION,
	AVTAB_CHANGE,
	AVTAB_MEMBER,
	AVTAB_XPERMS_ALLOWED,
	AVTAB_XPERMS_AUDITALLOW,
	AVTAB_XPERMS_DONTAUDIT
};

int avtab_read_item(struct avtab *a, void *fp, struct policydb *pol,
		    int (*insertf)(struct avtab *a, struct avtab_key *k,
				   struct avtab_datum *d, void *p),
		    void *p)
{
	__le16 buf16[4];
	u16 enabled;
	u32 items, items2, val, vers = pol->policyvers;
	struct avtab_key key;
	struct avtab_datum datum;
	struct avtab_extended_perms xperms;
	__le32 buf32[ARRAY_SIZE(xperms.perms.p)];
	int i, rc;
	unsigned set;

	memset(&key, 0, sizeof(struct avtab_key));
	memset(&datum, 0, sizeof(struct avtab_datum));

	if (vers < POLICYDB_VERSION_AVTAB) {
		rc = next_entry(buf32, fp, sizeof(u32));
		if (rc) {
			printk(KERN_ERR "SELinux: avtab: truncated entry\n");
			return rc;
		}
		items2 = le32_to_cpu(buf32[0]);
		if (items2 > ARRAY_SIZE(buf32)) {
			printk(KERN_ERR "SELinux: avtab: entry overflow\n");
			return -EINVAL;

		}
		rc = next_entry(buf32, fp, sizeof(u32)*items2);
		if (rc) {
			printk(KERN_ERR "SELinux: avtab: truncated entry\n");
			return rc;
		}
		items = 0;

		val = le32_to_cpu(buf32[items++]);
		key.source_type = (u16)val;
		if (key.source_type != val) {
			printk(KERN_ERR "SELinux: avtab: truncated source type\n");
			return -EINVAL;
		}
		val = le32_to_cpu(buf32[items++]);
		key.target_type = (u16)val;
		if (key.target_type != val) {
			printk(KERN_ERR "SELinux: avtab: truncated target type\n");
			return -EINVAL;
		}
		val = le32_to_cpu(buf32[items++]);
		key.target_class = (u16)val;
		if (key.target_class != val) {
			printk(KERN_ERR "SELinux: avtab: truncated target class\n");
			return -EINVAL;
		}

		val = le32_to_cpu(buf32[items++]);
		enabled = (val & AVTAB_ENABLED_OLD) ? AVTAB_ENABLED : 0;

		if (!(val & (AVTAB_AV | AVTAB_TYPE))) {
			printk(KERN_ERR "SELinux: avtab: null entry\n");
			return -EINVAL;
		}
		if ((val & AVTAB_AV) &&
		    (val & AVTAB_TYPE)) {
			printk(KERN_ERR "SELinux: avtab: entry has both access vectors and types\n");
			return -EINVAL;
		}
		if (val & AVTAB_XPERMS) {
			printk(KERN_ERR "SELinux: avtab: entry has extended permissions\n");
			return -EINVAL;
		}

		for (i = 0; i < ARRAY_SIZE(spec_order); i++) {
			if (val & spec_order[i]) {
				key.specified = spec_order[i] | enabled;
				datum.u.data = le32_to_cpu(buf32[items++]);
				rc = insertf(a, &key, &datum, p);
				if (rc)
					return rc;
			}
		}

		if (items != items2) {
			printk(KERN_ERR "SELinux: avtab: entry only had %d items, expected %d\n", items2, items);
			return -EINVAL;
		}
		return 0;
	}

	rc = next_entry(buf16, fp, sizeof(u16)*4);
	if (rc) {
		printk(KERN_ERR "SELinux: avtab: truncated entry\n");
		return rc;
	}

	items = 0;
	key.source_type = le16_to_cpu(buf16[items++]);
	key.target_type = le16_to_cpu(buf16[items++]);
	key.target_class = le16_to_cpu(buf16[items++]);
	key.specified = le16_to_cpu(buf16[items++]);

	if (!policydb_type_isvalid(pol, key.source_type) ||
	    !policydb_type_isvalid(pol, key.target_type) ||
	    !policydb_class_isvalid(pol, key.target_class)) {
		printk(KERN_ERR "SELinux: avtab: invalid type or class\n");
		return -EINVAL;
	}

	set = 0;
	for (i = 0; i < ARRAY_SIZE(spec_order); i++) {
		if (key.specified & spec_order[i])
			set++;
	}
	if (!set || set > 1) {
		printk(KERN_ERR "SELinux:  avtab:  more than one specifier\n");
		return -EINVAL;
	}

	if ((vers < POLICYDB_VERSION_XPERMS_IOCTL) &&
			(key.specified & AVTAB_XPERMS)) {
		printk(KERN_ERR "SELinux:  avtab:  policy version %u does not "
				"support extended permissions rules and one "
				"was specified\n", vers);
		return -EINVAL;
	} else if (key.specified & AVTAB_XPERMS) {
		memset(&xperms, 0, sizeof(struct avtab_extended_perms));
		rc = next_entry(&xperms.specified, fp, sizeof(u8));
		if (rc) {
			printk(KERN_ERR "SELinux: avtab: truncated entry\n");
			return rc;
		}
		rc = next_entry(&xperms.driver, fp, sizeof(u8));
		if (rc) {
			printk(KERN_ERR "SELinux: avtab: truncated entry\n");
			return rc;
		}
		rc = next_entry(buf32, fp, sizeof(u32)*ARRAY_SIZE(xperms.perms.p));
		if (rc) {
			printk(KERN_ERR "SELinux: avtab: truncated entry\n");
			return rc;
		}
		for (i = 0; i < ARRAY_SIZE(xperms.perms.p); i++)
			xperms.perms.p[i] = le32_to_cpu(buf32[i]);
		datum.u.xperms = &xperms;
	} else {
		rc = next_entry(buf32, fp, sizeof(u32));
		if (rc) {
			printk(KERN_ERR "SELinux: avtab: truncated entry\n");
			return rc;
		}
		datum.u.data = le32_to_cpu(*buf32);
	}
	if ((key.specified & AVTAB_TYPE) &&
	    !policydb_type_isvalid(pol, datum.u.data)) {
		printk(KERN_ERR "SELinux: avtab: invalid type\n");
		return -EINVAL;
	}
	return insertf(a, &key, &datum, p);
}

static int avtab_insertf(struct avtab *a, struct avtab_key *k,
			 struct avtab_datum *d, void *p)
{
	return avtab_insert(a, k, d);
}

int avtab_read(struct avtab *a, void *fp, struct policydb *pol)
{
	int rc;
	__le32 buf[1];
	u32 nel, i;


	rc = next_entry(buf, fp, sizeof(u32));
	if (rc < 0) {
		printk(KERN_ERR "SELinux: avtab: truncated table\n");
		goto bad;
	}
	nel = le32_to_cpu(buf[0]);
	if (!nel) {
		printk(KERN_ERR "SELinux: avtab: table is empty\n");
		rc = -EINVAL;
		goto bad;
	}

	rc = avtab_alloc(a, nel);
	if (rc)
		goto bad;

	for (i = 0; i < nel; i++) {
		rc = avtab_read_item(a, fp, pol, avtab_insertf, NULL);
		if (rc) {
			if (rc == -ENOMEM)
				printk(KERN_ERR "SELinux: avtab: out of memory\n");
			else if (rc == -EEXIST)
				printk(KERN_ERR "SELinux: avtab: duplicate entry\n");

			goto bad;
		}
	}

	rc = 0;
out:
	return rc;

bad:
	avtab_destroy(a);
	goto out;
}

int avtab_write_item(struct policydb *p, struct avtab_node *cur, void *fp)
{
	__le16 buf16[4];
	__le32 buf32[ARRAY_SIZE(cur->datum.u.xperms->perms.p)];
	int rc;
	unsigned int i;

	buf16[0] = cpu_to_le16(cur->key.source_type);
	buf16[1] = cpu_to_le16(cur->key.target_type);
	buf16[2] = cpu_to_le16(cur->key.target_class);
	buf16[3] = cpu_to_le16(cur->key.specified);
	rc = put_entry(buf16, sizeof(u16), 4, fp);
	if (rc)
		return rc;

	if (cur->key.specified & AVTAB_XPERMS) {
		rc = put_entry(&cur->datum.u.xperms->specified, sizeof(u8), 1, fp);
		if (rc)
			return rc;
		rc = put_entry(&cur->datum.u.xperms->driver, sizeof(u8), 1, fp);
		if (rc)
			return rc;
		for (i = 0; i < ARRAY_SIZE(cur->datum.u.xperms->perms.p); i++)
			buf32[i] = cpu_to_le32(cur->datum.u.xperms->perms.p[i]);
		rc = put_entry(buf32, sizeof(u32),
				ARRAY_SIZE(cur->datum.u.xperms->perms.p), fp);
	} else {
		buf32[0] = cpu_to_le32(cur->datum.u.data);
		rc = put_entry(buf32, sizeof(u32), 1, fp);
	}
	if (rc)
		return rc;
	return 0;
}

int avtab_write(struct policydb *p, struct avtab *a, void *fp)
{
	unsigned int i;
	int rc = 0;
	struct avtab_node *cur;
	__le32 buf[1];

	buf[0] = cpu_to_le32(a->nel);
	rc = put_entry(buf, sizeof(u32), 1, fp);
	if (rc)
		return rc;

	for (i = 0; i < a->nslot; i++) {
		for (cur = flex_array_get_ptr(a->htable, i); cur;
		     cur = cur->next) {
			rc = avtab_write_item(p, cur, fp);
			if (rc)
				return rc;
		}
	}

	return rc;
}
void avtab_cache_init(void)
{
	avtab_node_cachep = kmem_cache_create("avtab_node",
					      sizeof(struct avtab_node),
					      0, SLAB_PANIC, NULL);
	avtab_xperms_cachep = kmem_cache_create("avtab_extended_perms",
						sizeof(struct avtab_extended_perms),
						0, SLAB_PANIC, NULL);
}

void avtab_cache_destroy(void)
{
	kmem_cache_destroy(avtab_node_cachep);
	kmem_cache_destroy(avtab_xperms_cachep);
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Implementation of the access vector table type.
	3	*
	4	* Author : Stephen Smalley, <sds@epoch.ncsc.mil>
	5	*/
	6
	7	/* Updated: Frank Mayer <mayerf@tresys.com> and Karl MacMillan <kmacmillan@tresys.com>
	8	*
eb5df9a7	9	* Added conditional policy language extensions
1da177e4 LT	10	*
	11	* Copyright (C) 2003 Tresys Technology, LLC
	12	* This program is free software; you can redistribute it and/or modify
eb5df9a7	13	* it under the terms of the GNU General Public License as published by
1da177e4	14	* the Free Software Foundation, version 2.
3232c110 YN	15	*
3232c110 YN	16	* Updated: Yuichi Nakamura <ynakam@hitachisoft.jp>
eb5df9a7	17	* Tuned number of hash slots for avtab to reduce memory usage
1da177e4 LT	18	*/
	19
	20	#include <linux/kernel.h>
	21	#include <linux/slab.h>
1da177e4	22	#include <linux/errno.h>
1da177e4 LT	23	#include "avtab.h"
	24	#include "policydb.h"
	25
e18b890b	26	static struct kmem_cache *avtab_node_cachep;
fa1aa143	27	static struct kmem_cache *avtab_xperms_cachep;
1da177e4	28
33ebc193 JB	29	/* Based on MurmurHash3, written by Austin Appleby and placed in the
	30	* public domain.
	31	*/
	32	static inline int avtab_hash(struct avtab_key *keyp, u32 mask)
3232c110	33	{
33ebc193 JB	34	static const u32 c1 = 0xcc9e2d51;
	35	static const u32 c2 = 0x1b873593;
	36	static const u32 r1 = 15;
	37	static const u32 r2 = 13;
	38	static const u32 m = 5;
	39	static const u32 n = 0xe6546b64;
	40
	41	u32 hash = 0;
	42
	43	#define mix(input) { \
	44	u32 v = input; \
	45	v *= c1; \
	46	v = (v << r1) \| (v >> (32 - r1)); \
	47	v *= c2; \
	48	hash ^= v; \
	49	hash = (hash << r2) \| (hash >> (32 - r2)); \
	50	hash = hash * m + n; \
	51	}
	52
	53	mix(keyp->target_class);
	54	mix(keyp->target_type);
	55	mix(keyp->source_type);
	56
	57	#undef mix
	58
	59	hash ^= hash >> 16;
	60	hash *= 0x85ebca6b;
	61	hash ^= hash >> 13;
	62	hash *= 0xc2b2ae35;
	63	hash ^= hash >> 16;
	64
	65	return hash & mask;
3232c110 YN	66	}
3232c110 YN	67
1da177e4 LT	68	static struct avtab_node*
1da177e4 LT	69	avtab_insert_node(struct avtab *h, int hvalue,
eb5df9a7	70	struct avtab_node prev, struct avtab_node cur,
1da177e4 LT	71	struct avtab_key key, struct avtab_datum datum)
1da177e4 LT	72	{
eb5df9a7	73	struct avtab_node *newnode;
fa1aa143	74	struct avtab_extended_perms *xperms;
c3762229	75	newnode = kmem_cache_zalloc(avtab_node_cachep, GFP_KERNEL);
1da177e4 LT	76	if (newnode == NULL)
1da177e4 LT	77	return NULL;
1da177e4	78	newnode->key = *key;
fa1aa143 JVS	79
	80	if (key->specified & AVTAB_XPERMS) {
	81	xperms = kmem_cache_zalloc(avtab_xperms_cachep, GFP_KERNEL);
	82	if (xperms == NULL) {
	83	kmem_cache_free(avtab_node_cachep, newnode);
	84	return NULL;
	85	}
	86	xperms = (datum->u.xperms);
	87	newnode->datum.u.xperms = xperms;
	88	} else {
	89	newnode->datum.u.data = datum->u.data;
	90	}
	91
1da177e4 LT	92	if (prev) {
	93	newnode->next = prev->next;
	94	prev->next = newnode;
	95	} else {
ba39db6e SS	96	newnode->next = flex_array_get_ptr(h->htable, hvalue);
	97	if (flex_array_put_ptr(h->htable, hvalue, newnode,
	98	GFP_KERNEL\|__GFP_ZERO)) {
	99	kmem_cache_free(avtab_node_cachep, newnode);
	100	return NULL;
	101	}
1da177e4 LT	102	}
	103
	104	h->nel++;
	105	return newnode;
	106	}
	107
	108	static int avtab_insert(struct avtab h, struct avtab_key key, struct avtab_datum *datum)
	109	{
	110	int hvalue;
	111	struct avtab_node prev, cur, *newnode;
782ebb99	112	u16 specified = key->specified & ~(AVTAB_ENABLED\|AVTAB_ENABLED_OLD);
1da177e4	113
3232c110	114	if (!h \|\| !h->htable)
1da177e4 LT	115	return -EINVAL;
1da177e4 LT	116
3232c110	117	hvalue = avtab_hash(key, h->mask);
ba39db6e	118	for (prev = NULL, cur = flex_array_get_ptr(h->htable, hvalue);
1da177e4 LT	119	cur;
	120	prev = cur, cur = cur->next) {
	121	if (key->source_type == cur->key.source_type &&
	122	key->target_type == cur->key.target_type &&
	123	key->target_class == cur->key.target_class &&
fa1aa143 JVS	124	(specified & cur->key.specified)) {
	125	/* extended perms may not be unique */
	126	if (specified & AVTAB_XPERMS)
	127	break;
1da177e4	128	return -EEXIST;
fa1aa143	129	}
1da177e4 LT	130	if (key->source_type < cur->key.source_type)
	131	break;
	132	if (key->source_type == cur->key.source_type &&
	133	key->target_type < cur->key.target_type)
	134	break;
	135	if (key->source_type == cur->key.source_type &&
	136	key->target_type == cur->key.target_type &&
	137	key->target_class < cur->key.target_class)
	138	break;
	139	}
	140
	141	newnode = avtab_insert_node(h, hvalue, prev, cur, key, datum);
eb5df9a7	142	if (!newnode)
1da177e4 LT	143	return -ENOMEM;
	144
	145	return 0;
	146	}
	147
	148	/* Unlike avtab_insert(), this function allow multiple insertions of the same
	149	* key/specified mask into the table, as needed by the conditional avtab.
	150	* It also returns a pointer to the node inserted.
	151	*/
	152	struct avtab_node *
eb5df9a7	153	avtab_insert_nonunique(struct avtab h, struct avtab_key key, struct avtab_datum *datum)
1da177e4 LT	154	{
1da177e4 LT	155	int hvalue;
0c0e186f	156	struct avtab_node prev, cur;
782ebb99	157	u16 specified = key->specified & ~(AVTAB_ENABLED\|AVTAB_ENABLED_OLD);
1da177e4	158
3232c110	159	if (!h \|\| !h->htable)
1da177e4	160	return NULL;
3232c110	161	hvalue = avtab_hash(key, h->mask);
ba39db6e	162	for (prev = NULL, cur = flex_array_get_ptr(h->htable, hvalue);
1da177e4 LT	163	cur;
	164	prev = cur, cur = cur->next) {
	165	if (key->source_type == cur->key.source_type &&
	166	key->target_type == cur->key.target_type &&
	167	key->target_class == cur->key.target_class &&
782ebb99	168	(specified & cur->key.specified))
1da177e4 LT	169	break;
	170	if (key->source_type < cur->key.source_type)
	171	break;
	172	if (key->source_type == cur->key.source_type &&
	173	key->target_type < cur->key.target_type)
	174	break;
	175	if (key->source_type == cur->key.source_type &&
	176	key->target_type == cur->key.target_type &&
	177	key->target_class < cur->key.target_class)
	178	break;
	179	}
0c0e186f	180	return avtab_insert_node(h, hvalue, prev, cur, key, datum);
1da177e4 LT	181	}
1da177e4 LT	182
782ebb99	183	struct avtab_datum avtab_search(struct avtab h, struct avtab_key *key)
1da177e4 LT	184	{
	185	int hvalue;
	186	struct avtab_node *cur;
782ebb99	187	u16 specified = key->specified & ~(AVTAB_ENABLED\|AVTAB_ENABLED_OLD);
1da177e4	188
3232c110	189	if (!h \|\| !h->htable)
1da177e4 LT	190	return NULL;
1da177e4 LT	191
3232c110	192	hvalue = avtab_hash(key, h->mask);
ba39db6e SS	193	for (cur = flex_array_get_ptr(h->htable, hvalue); cur;
ba39db6e SS	194	cur = cur->next) {
1da177e4 LT	195	if (key->source_type == cur->key.source_type &&
	196	key->target_type == cur->key.target_type &&
	197	key->target_class == cur->key.target_class &&
782ebb99	198	(specified & cur->key.specified))
1da177e4 LT	199	return &cur->datum;
	200
	201	if (key->source_type < cur->key.source_type)
	202	break;
	203	if (key->source_type == cur->key.source_type &&
	204	key->target_type < cur->key.target_type)
	205	break;
	206	if (key->source_type == cur->key.source_type &&
	207	key->target_type == cur->key.target_type &&
	208	key->target_class < cur->key.target_class)
	209	break;
	210	}
	211
	212	return NULL;
	213	}
	214
	215	/* This search function returns a node pointer, and can be used in
	216	* conjunction with avtab_search_next_node()
	217	*/
	218	struct avtab_node*
782ebb99	219	avtab_search_node(struct avtab h, struct avtab_key key)
1da177e4 LT	220	{
	221	int hvalue;
	222	struct avtab_node *cur;
782ebb99	223	u16 specified = key->specified & ~(AVTAB_ENABLED\|AVTAB_ENABLED_OLD);
1da177e4	224
3232c110	225	if (!h \|\| !h->htable)
1da177e4 LT	226	return NULL;
1da177e4 LT	227
3232c110	228	hvalue = avtab_hash(key, h->mask);
ba39db6e SS	229	for (cur = flex_array_get_ptr(h->htable, hvalue); cur;
ba39db6e SS	230	cur = cur->next) {
1da177e4 LT	231	if (key->source_type == cur->key.source_type &&
	232	key->target_type == cur->key.target_type &&
	233	key->target_class == cur->key.target_class &&
782ebb99	234	(specified & cur->key.specified))
1da177e4 LT	235	return cur;
	236
	237	if (key->source_type < cur->key.source_type)
	238	break;
	239	if (key->source_type == cur->key.source_type &&
	240	key->target_type < cur->key.target_type)
	241	break;
	242	if (key->source_type == cur->key.source_type &&
	243	key->target_type == cur->key.target_type &&
	244	key->target_class < cur->key.target_class)
	245	break;
	246	}
	247	return NULL;
	248	}
	249
	250	struct avtab_node*
	251	avtab_search_node_next(struct avtab_node *node, int specified)
	252	{
	253	struct avtab_node *cur;
	254
	255	if (!node)
	256	return NULL;
	257
782ebb99	258	specified &= ~(AVTAB_ENABLED\|AVTAB_ENABLED_OLD);
1da177e4 LT	259	for (cur = node->next; cur; cur = cur->next) {
	260	if (node->key.source_type == cur->key.source_type &&
	261	node->key.target_type == cur->key.target_type &&
	262	node->key.target_class == cur->key.target_class &&
782ebb99	263	(specified & cur->key.specified))
1da177e4 LT	264	return cur;
	265
	266	if (node->key.source_type < cur->key.source_type)
	267	break;
	268	if (node->key.source_type == cur->key.source_type &&
	269	node->key.target_type < cur->key.target_type)
	270	break;
	271	if (node->key.source_type == cur->key.source_type &&
	272	node->key.target_type == cur->key.target_type &&
	273	node->key.target_class < cur->key.target_class)
	274	break;
	275	}
	276	return NULL;
	277	}
	278
	279	void avtab_destroy(struct avtab *h)
	280	{
	281	int i;
	282	struct avtab_node cur, temp;
	283
	284	if (!h \|\| !h->htable)
	285	return;
	286
3232c110	287	for (i = 0; i < h->nslot; i++) {
ba39db6e	288	cur = flex_array_get_ptr(h->htable, i);
dbc74c65	289	while (cur) {
1da177e4 LT	290	temp = cur;
1da177e4 LT	291	cur = cur->next;
fa1aa143 JVS	292	if (temp->key.specified & AVTAB_XPERMS)
	293	kmem_cache_free(avtab_xperms_cachep,
	294	temp->datum.u.xperms);
1da177e4 LT	295	kmem_cache_free(avtab_node_cachep, temp);
1da177e4 LT	296	}
1da177e4	297	}
ba39db6e	298	flex_array_free(h->htable);
1da177e4	299	h->htable = NULL;
3232c110 YN	300	h->nslot = 0;
3232c110 YN	301	h->mask = 0;
1da177e4 LT	302	}
1da177e4 LT	303
1da177e4 LT	304	int avtab_init(struct avtab *h)
1da177e4 LT	305	{
3232c110 YN	306	h->htable = NULL;
	307	h->nel = 0;
	308	return 0;
	309	}
	310
	311	int avtab_alloc(struct avtab *h, u32 nrules)
	312	{
33ebc193	313	u32 mask = 0;
3232c110 YN	314	u32 shift = 0;
	315	u32 work = nrules;
	316	u32 nslot = 0;
	317
	318	if (nrules == 0)
	319	goto avtab_alloc_out;
1da177e4	320
3232c110 YN	321	while (work) {
	322	work = work >> 1;
	323	shift++;
	324	}
	325	if (shift > 2)
	326	shift = shift - 2;
	327	nslot = 1 << shift;
00d85c83 EP	328	if (nslot > MAX_AVTAB_HASH_BUCKETS)
00d85c83 EP	329	nslot = MAX_AVTAB_HASH_BUCKETS;
3232c110 YN	330	mask = nslot - 1;
3232c110 YN	331
ba39db6e SS	332	h->htable = flex_array_alloc(sizeof(struct avtab_node *), nslot,
ba39db6e SS	333	GFP_KERNEL \| __GFP_ZERO);
1da177e4 LT	334	if (!h->htable)
1da177e4 LT	335	return -ENOMEM;
3232c110 YN	336
3232c110 YN	337	avtab_alloc_out:
1da177e4	338	h->nel = 0;
3232c110 YN	339	h->nslot = nslot;
3232c110 YN	340	h->mask = mask;
454d972c JM	341	printk(KERN_DEBUG "SELinux: %d avtab hash slots, %d rules.\n",
454d972c JM	342	h->nslot, nrules);
1da177e4 LT	343	return 0;
	344	}
	345
	346	void avtab_hash_eval(struct avtab h, char tag)
	347	{
	348	int i, chain_len, slots_used, max_chain_len;
3232c110	349	unsigned long long chain2_len_sum;
1da177e4 LT	350	struct avtab_node *cur;
	351
	352	slots_used = 0;
	353	max_chain_len = 0;
3232c110 YN	354	chain2_len_sum = 0;
3232c110 YN	355	for (i = 0; i < h->nslot; i++) {
ba39db6e	356	cur = flex_array_get_ptr(h->htable, i);
1da177e4 LT	357	if (cur) {
	358	slots_used++;
	359	chain_len = 0;
	360	while (cur) {
	361	chain_len++;
	362	cur = cur->next;
	363	}
	364
	365	if (chain_len > max_chain_len)
	366	max_chain_len = chain_len;
3232c110	367	chain2_len_sum += chain_len * chain_len;
1da177e4 LT	368	}
	369	}
	370
744ba35e	371	printk(KERN_DEBUG "SELinux: %s: %d entries and %d/%d buckets used, "
f5269710	372	"longest chain length %d sum of chain length^2 %llu\n",
3232c110 YN	373	tag, h->nel, slots_used, h->nslot, max_chain_len,
3232c110 YN	374	chain2_len_sum);
1da177e4 LT	375	}
1da177e4 LT	376
782ebb99 SS	377	static uint16_t spec_order[] = {
	378	AVTAB_ALLOWED,
	379	AVTAB_AUDITDENY,
	380	AVTAB_AUDITALLOW,
	381	AVTAB_TRANSITION,
	382	AVTAB_CHANGE,
fa1aa143 JVS	383	AVTAB_MEMBER,
	384	AVTAB_XPERMS_ALLOWED,
	385	AVTAB_XPERMS_AUDITALLOW,
	386	AVTAB_XPERMS_DONTAUDIT
782ebb99 SS	387	};
782ebb99 SS	388
45e5421e	389	int avtab_read_item(struct avtab a, void fp, struct policydb *pol,
eb5df9a7	390	int (insertf)(struct avtab a, struct avtab_key *k,
782ebb99 SS	391	struct avtab_datum d, void p),
782ebb99 SS	392	void *p)
1da177e4	393	{
b5bf6c55 AD	394	__le16 buf16[4];
b5bf6c55 AD	395	u16 enabled;
45e5421e	396	u32 items, items2, val, vers = pol->policyvers;
782ebb99 SS	397	struct avtab_key key;
782ebb99 SS	398	struct avtab_datum datum;
fa1aa143 JVS	399	struct avtab_extended_perms xperms;
fa1aa143 JVS	400	__le32 buf32[ARRAY_SIZE(xperms.perms.p)];
782ebb99	401	int i, rc;
45e5421e	402	unsigned set;
782ebb99 SS	403
	404	memset(&key, 0, sizeof(struct avtab_key));
	405	memset(&datum, 0, sizeof(struct avtab_datum));
	406
	407	if (vers < POLICYDB_VERSION_AVTAB) {
	408	rc = next_entry(buf32, fp, sizeof(u32));
9e0bd4cb	409	if (rc) {
454d972c	410	printk(KERN_ERR "SELinux: avtab: truncated entry\n");
9e0bd4cb	411	return rc;
782ebb99 SS	412	}
	413	items2 = le32_to_cpu(buf32[0]);
	414	if (items2 > ARRAY_SIZE(buf32)) {
454d972c	415	printk(KERN_ERR "SELinux: avtab: entry overflow\n");
9e0bd4cb	416	return -EINVAL;
1da177e4	417
782ebb99 SS	418	}
782ebb99 SS	419	rc = next_entry(buf32, fp, sizeof(u32)*items2);
9e0bd4cb	420	if (rc) {
454d972c	421	printk(KERN_ERR "SELinux: avtab: truncated entry\n");
9e0bd4cb	422	return rc;
782ebb99 SS	423	}
782ebb99 SS	424	items = 0;
1da177e4	425
782ebb99 SS	426	val = le32_to_cpu(buf32[items++]);
	427	key.source_type = (u16)val;
	428	if (key.source_type != val) {
744ba35e	429	printk(KERN_ERR "SELinux: avtab: truncated source type\n");
9e0bd4cb	430	return -EINVAL;
782ebb99 SS	431	}
	432	val = le32_to_cpu(buf32[items++]);
	433	key.target_type = (u16)val;
	434	if (key.target_type != val) {
744ba35e	435	printk(KERN_ERR "SELinux: avtab: truncated target type\n");
9e0bd4cb	436	return -EINVAL;
782ebb99 SS	437	}
	438	val = le32_to_cpu(buf32[items++]);
	439	key.target_class = (u16)val;
	440	if (key.target_class != val) {
744ba35e	441	printk(KERN_ERR "SELinux: avtab: truncated target class\n");
9e0bd4cb	442	return -EINVAL;
782ebb99 SS	443	}
	444
	445	val = le32_to_cpu(buf32[items++]);
	446	enabled = (val & AVTAB_ENABLED_OLD) ? AVTAB_ENABLED : 0;
	447
	448	if (!(val & (AVTAB_AV \| AVTAB_TYPE))) {
744ba35e	449	printk(KERN_ERR "SELinux: avtab: null entry\n");
9e0bd4cb	450	return -EINVAL;
782ebb99 SS	451	}
	452	if ((val & AVTAB_AV) &&
	453	(val & AVTAB_TYPE)) {
744ba35e	454	printk(KERN_ERR "SELinux: avtab: entry has both access vectors and types\n");
9e0bd4cb	455	return -EINVAL;
782ebb99	456	}
fa1aa143 JVS	457	if (val & AVTAB_XPERMS) {
	458	printk(KERN_ERR "SELinux: avtab: entry has extended permissions\n");
	459	return -EINVAL;
	460	}
782ebb99	461
32725ad8	462	for (i = 0; i < ARRAY_SIZE(spec_order); i++) {
782ebb99 SS	463	if (val & spec_order[i]) {
782ebb99 SS	464	key.specified = spec_order[i] \| enabled;
fa1aa143	465	datum.u.data = le32_to_cpu(buf32[items++]);
782ebb99	466	rc = insertf(a, &key, &datum, p);
eb5df9a7 EP	467	if (rc)
eb5df9a7 EP	468	return rc;
782ebb99 SS	469	}
	470	}
	471
	472	if (items != items2) {
744ba35e	473	printk(KERN_ERR "SELinux: avtab: entry only had %d items, expected %d\n", items2, items);
9e0bd4cb	474	return -EINVAL;
782ebb99 SS	475	}
782ebb99 SS	476	return 0;
1da177e4	477	}
782ebb99 SS	478
782ebb99 SS	479	rc = next_entry(buf16, fp, sizeof(u16)*4);
9e0bd4cb	480	if (rc) {
744ba35e	481	printk(KERN_ERR "SELinux: avtab: truncated entry\n");
9e0bd4cb	482	return rc;
1da177e4	483	}
782ebb99	484
1da177e4	485	items = 0;
782ebb99 SS	486	key.source_type = le16_to_cpu(buf16[items++]);
	487	key.target_type = le16_to_cpu(buf16[items++]);
	488	key.target_class = le16_to_cpu(buf16[items++]);
	489	key.specified = le16_to_cpu(buf16[items++]);
	490
45e5421e SS	491	if (!policydb_type_isvalid(pol, key.source_type) \|\|
	492	!policydb_type_isvalid(pol, key.target_type) \|\|
	493	!policydb_class_isvalid(pol, key.target_class)) {
744ba35e	494	printk(KERN_ERR "SELinux: avtab: invalid type or class\n");
9e0bd4cb	495	return -EINVAL;
45e5421e SS	496	}
	497
	498	set = 0;
	499	for (i = 0; i < ARRAY_SIZE(spec_order); i++) {
	500	if (key.specified & spec_order[i])
	501	set++;
	502	}
	503	if (!set \|\| set > 1) {
744ba35e	504	printk(KERN_ERR "SELinux: avtab: more than one specifier\n");
9e0bd4cb	505	return -EINVAL;
45e5421e SS	506	}
45e5421e SS	507
fa1aa143 JVS	508	if ((vers < POLICYDB_VERSION_XPERMS_IOCTL) &&
	509	(key.specified & AVTAB_XPERMS)) {
	510	printk(KERN_ERR "SELinux: avtab: policy version %u does not "
	511	"support extended permissions rules and one "
	512	"was specified\n", vers);
	513	return -EINVAL;
	514	} else if (key.specified & AVTAB_XPERMS) {
	515	memset(&xperms, 0, sizeof(struct avtab_extended_perms));
	516	rc = next_entry(&xperms.specified, fp, sizeof(u8));
	517	if (rc) {
	518	printk(KERN_ERR "SELinux: avtab: truncated entry\n");
	519	return rc;
	520	}
	521	rc = next_entry(&xperms.driver, fp, sizeof(u8));
	522	if (rc) {
	523	printk(KERN_ERR "SELinux: avtab: truncated entry\n");
	524	return rc;
	525	}
	526	rc = next_entry(buf32, fp, sizeof(u32)*ARRAY_SIZE(xperms.perms.p));
	527	if (rc) {
	528	printk(KERN_ERR "SELinux: avtab: truncated entry\n");
	529	return rc;
	530	}
	531	for (i = 0; i < ARRAY_SIZE(xperms.perms.p); i++)
	532	xperms.perms.p[i] = le32_to_cpu(buf32[i]);
	533	datum.u.xperms = &xperms;
	534	} else {
	535	rc = next_entry(buf32, fp, sizeof(u32));
	536	if (rc) {
	537	printk(KERN_ERR "SELinux: avtab: truncated entry\n");
	538	return rc;
	539	}
	540	datum.u.data = le32_to_cpu(*buf32);
1da177e4	541	}
45e5421e	542	if ((key.specified & AVTAB_TYPE) &&
fa1aa143	543	!policydb_type_isvalid(pol, datum.u.data)) {
744ba35e	544	printk(KERN_ERR "SELinux: avtab: invalid type\n");
9e0bd4cb	545	return -EINVAL;
45e5421e	546	}
782ebb99 SS	547	return insertf(a, &key, &datum, p);
782ebb99 SS	548	}
1da177e4	549
782ebb99 SS	550	static int avtab_insertf(struct avtab a, struct avtab_key k,
	551	struct avtab_datum d, void p)
	552	{
	553	return avtab_insert(a, k, d);
1da177e4 LT	554	}
1da177e4 LT	555
45e5421e	556	int avtab_read(struct avtab a, void fp, struct policydb *pol)
1da177e4 LT	557	{
1da177e4 LT	558	int rc;
b5bf6c55	559	__le32 buf[1];
1da177e4 LT	560	u32 nel, i;
	561
	562
	563	rc = next_entry(buf, fp, sizeof(u32));
	564	if (rc < 0) {
454d972c	565	printk(KERN_ERR "SELinux: avtab: truncated table\n");
1da177e4 LT	566	goto bad;
	567	}
	568	nel = le32_to_cpu(buf[0]);
	569	if (!nel) {
454d972c	570	printk(KERN_ERR "SELinux: avtab: table is empty\n");
1da177e4 LT	571	rc = -EINVAL;
	572	goto bad;
	573	}
3232c110 YN	574
	575	rc = avtab_alloc(a, nel);
	576	if (rc)
	577	goto bad;
	578
1da177e4	579	for (i = 0; i < nel; i++) {
45e5421e	580	rc = avtab_read_item(a, fp, pol, avtab_insertf, NULL);
1da177e4 LT	581	if (rc) {
1da177e4 LT	582	if (rc == -ENOMEM)
454d972c	583	printk(KERN_ERR "SELinux: avtab: out of memory\n");
782ebb99	584	else if (rc == -EEXIST)
454d972c	585	printk(KERN_ERR "SELinux: avtab: duplicate entry\n");
9e0bd4cb	586
1da177e4 LT	587	goto bad;
	588	}
	589	}
	590
	591	rc = 0;
	592	out:
	593	return rc;
	594
	595	bad:
	596	avtab_destroy(a);
	597	goto out;
	598	}
	599
cee74f47 EP	600	int avtab_write_item(struct policydb p, struct avtab_node cur, void *fp)
	601	{
	602	__le16 buf16[4];
fa1aa143	603	__le32 buf32[ARRAY_SIZE(cur->datum.u.xperms->perms.p)];
cee74f47	604	int rc;
fa1aa143	605	unsigned int i;
cee74f47 EP	606
	607	buf16[0] = cpu_to_le16(cur->key.source_type);
	608	buf16[1] = cpu_to_le16(cur->key.target_type);
	609	buf16[2] = cpu_to_le16(cur->key.target_class);
	610	buf16[3] = cpu_to_le16(cur->key.specified);
	611	rc = put_entry(buf16, sizeof(u16), 4, fp);
	612	if (rc)
	613	return rc;
fa1aa143 JVS	614
	615	if (cur->key.specified & AVTAB_XPERMS) {
	616	rc = put_entry(&cur->datum.u.xperms->specified, sizeof(u8), 1, fp);
	617	if (rc)
	618	return rc;
	619	rc = put_entry(&cur->datum.u.xperms->driver, sizeof(u8), 1, fp);
	620	if (rc)
	621	return rc;
	622	for (i = 0; i < ARRAY_SIZE(cur->datum.u.xperms->perms.p); i++)
	623	buf32[i] = cpu_to_le32(cur->datum.u.xperms->perms.p[i]);
	624	rc = put_entry(buf32, sizeof(u32),
	625	ARRAY_SIZE(cur->datum.u.xperms->perms.p), fp);
	626	} else {
	627	buf32[0] = cpu_to_le32(cur->datum.u.data);
	628	rc = put_entry(buf32, sizeof(u32), 1, fp);
	629	}
cee74f47 EP	630	if (rc)
	631	return rc;
	632	return 0;
	633	}
	634
	635	int avtab_write(struct policydb p, struct avtab a, void *fp)
	636	{
	637	unsigned int i;
	638	int rc = 0;
	639	struct avtab_node *cur;
	640	__le32 buf[1];
	641
	642	buf[0] = cpu_to_le32(a->nel);
	643	rc = put_entry(buf, sizeof(u32), 1, fp);
	644	if (rc)
	645	return rc;
	646
	647	for (i = 0; i < a->nslot; i++) {
ba39db6e SS	648	for (cur = flex_array_get_ptr(a->htable, i); cur;
ba39db6e SS	649	cur = cur->next) {
cee74f47 EP	650	rc = avtab_write_item(p, cur, fp);
	651	if (rc)
	652	return rc;
	653	}
	654	}
	655
	656	return rc;
	657	}
1da177e4 LT	658	void avtab_cache_init(void)
	659	{
	660	avtab_node_cachep = kmem_cache_create("avtab_node",
	661	sizeof(struct avtab_node),
20c2df83	662	0, SLAB_PANIC, NULL);
fa1aa143 JVS	663	avtab_xperms_cachep = kmem_cache_create("avtab_extended_perms",
	664	sizeof(struct avtab_extended_perms),
	665	0, SLAB_PANIC, NULL);
1da177e4 LT	666	}
	667
	668	void avtab_cache_destroy(void)
	669	{
eb5df9a7	670	kmem_cache_destroy(avtab_node_cachep);
fa1aa143	671	kmem_cache_destroy(avtab_xperms_cachep);
1da177e4	672	}