1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * Implementation of the access vector table type.
10 * Added conditional policy language extensions
11 * Copyright (C) 2003 Tresys Technology, LLC
14 * Tuned number of hash slots for avtab to reduce memory usage
17 #include <linux/bitops.h>
18 #include <linux/kernel.h>
19 #include <linux/slab.h>
20 #include <linux/errno.h>
24 static struct kmem_cache *avtab_node_cachep __ro_after_init;
25 static struct kmem_cache *avtab_xperms_cachep __ro_after_init;
27 /* Based on MurmurHash3, written by Austin Appleby and placed in the
30 static inline u32 avtab_hash(const struct avtab_key *keyp, u32 mask)
32 static const u32 c1 = 0xcc9e2d51;
33 static const u32 c2 = 0x1b873593;
34 static const u32 r1 = 15;
35 static const u32 r2 = 13;
36 static const u32 m = 5;
37 static const u32 n = 0xe6546b64;
45 v = (v << r1) | (v >> (32 - r1)); \
48 hash = (hash << r2) | (hash >> (32 - r2)); \
49 hash = hash * m + n; \
52 mix(keyp->target_class);
53 mix(keyp->target_type);
54 mix(keyp->source_type);
67 static struct avtab_node *avtab_insert_node(struct avtab *h,
68 struct avtab_node **dst,
69 const struct avtab_key *key,
70 const struct avtab_datum *datum)
72 struct avtab_node *newnode;
73 struct avtab_extended_perms *xperms;
74 newnode = kmem_cache_zalloc(avtab_node_cachep, GFP_KERNEL);
79 if (key->specified & AVTAB_XPERMS) {
80 xperms = kmem_cache_zalloc(avtab_xperms_cachep, GFP_KERNEL);
82 kmem_cache_free(avtab_node_cachep, newnode);
85 *xperms = *(datum->u.xperms);
86 newnode->datum.u.xperms = xperms;
88 newnode->datum.u.data = datum->u.data;
98 static int avtab_node_cmp(const struct avtab_key *key1,
99 const struct avtab_key *key2)
101 u16 specified = key1->specified & ~(AVTAB_ENABLED | AVTAB_ENABLED_OLD);
103 if (key1->source_type == key2->source_type &&
104 key1->target_type == key2->target_type &&
105 key1->target_class == key2->target_class &&
106 (specified & key2->specified))
108 if (key1->source_type < key2->source_type)
110 if (key1->source_type == key2->source_type &&
111 key1->target_type < key2->target_type)
113 if (key1->source_type == key2->source_type &&
114 key1->target_type == key2->target_type &&
115 key1->target_class < key2->target_class)
120 static int avtab_insert(struct avtab *h, const struct avtab_key *key,
121 const struct avtab_datum *datum)
124 struct avtab_node *prev, *cur, *newnode;
127 if (!h || !h->nslot || h->nel == U32_MAX)
130 hvalue = avtab_hash(key, h->mask);
131 for (prev = NULL, cur = h->htable[hvalue]; cur;
132 prev = cur, cur = cur->next) {
133 cmp = avtab_node_cmp(key, &cur->key);
134 /* extended perms may not be unique */
135 if (cmp == 0 && !(key->specified & AVTAB_XPERMS))
141 newnode = avtab_insert_node(h, prev ? &prev->next : &h->htable[hvalue],
149 /* Unlike avtab_insert(), this function allow multiple insertions of the same
150 * key/specified mask into the table, as needed by the conditional avtab.
151 * It also returns a pointer to the node inserted.
153 struct avtab_node *avtab_insert_nonunique(struct avtab *h,
154 const struct avtab_key *key,
155 const struct avtab_datum *datum)
158 struct avtab_node *prev, *cur;
161 if (!h || !h->nslot || h->nel == U32_MAX)
163 hvalue = avtab_hash(key, h->mask);
164 for (prev = NULL, cur = h->htable[hvalue]; cur;
165 prev = cur, cur = cur->next) {
166 cmp = avtab_node_cmp(key, &cur->key);
170 return avtab_insert_node(h, prev ? &prev->next : &h->htable[hvalue],
174 /* This search function returns a node pointer, and can be used in
175 * conjunction with avtab_search_next_node()
177 struct avtab_node *avtab_search_node(struct avtab *h,
178 const struct avtab_key *key)
181 struct avtab_node *cur;
187 hvalue = avtab_hash(key, h->mask);
188 for (cur = h->htable[hvalue]; cur; cur = cur->next) {
189 cmp = avtab_node_cmp(key, &cur->key);
198 struct avtab_node *avtab_search_node_next(struct avtab_node *node,
201 struct avtab_key tmp_key;
202 struct avtab_node *cur;
208 tmp_key.specified = specified;
209 for (cur = node->next; cur; cur = cur->next) {
210 cmp = avtab_node_cmp(&tmp_key, &cur->key);
219 void avtab_destroy(struct avtab *h)
222 struct avtab_node *cur, *temp;
227 for (i = 0; i < h->nslot; i++) {
232 if (temp->key.specified & AVTAB_XPERMS)
233 kmem_cache_free(avtab_xperms_cachep,
234 temp->datum.u.xperms);
235 kmem_cache_free(avtab_node_cachep, temp);
245 void avtab_init(struct avtab *h)
253 static int avtab_alloc_common(struct avtab *h, u32 nslot)
258 h->htable = kvcalloc(nslot, sizeof(void *), GFP_KERNEL);
267 int avtab_alloc(struct avtab *h, u32 nrules)
273 nslot = nrules > 3 ? rounddown_pow_of_two(nrules / 2) : 2;
274 if (nslot > MAX_AVTAB_HASH_BUCKETS)
275 nslot = MAX_AVTAB_HASH_BUCKETS;
277 rc = avtab_alloc_common(h, nslot);
282 pr_debug("SELinux: %d avtab hash slots, %d rules.\n", nslot, nrules);
286 int avtab_alloc_dup(struct avtab *new, const struct avtab *orig)
288 return avtab_alloc_common(new, orig->nslot);
291 #ifdef CONFIG_SECURITY_SELINUX_DEBUG
292 void avtab_hash_eval(struct avtab *h, const char *tag)
294 u32 i, chain_len, slots_used, max_chain_len;
295 unsigned long long chain2_len_sum;
296 struct avtab_node *cur;
301 for (i = 0; i < h->nslot; i++) {
311 if (chain_len > max_chain_len)
312 max_chain_len = chain_len;
314 (unsigned long long)chain_len * chain_len;
318 pr_debug("SELinux: %s: %d entries and %d/%d buckets used, "
319 "longest chain length %d, sum of chain length^2 %llu\n",
320 tag, h->nel, slots_used, h->nslot, max_chain_len,
323 #endif /* CONFIG_SECURITY_SELINUX_DEBUG */
325 /* clang-format off */
326 static const uint16_t spec_order[] = {
333 AVTAB_XPERMS_ALLOWED,
334 AVTAB_XPERMS_AUDITALLOW,
335 AVTAB_XPERMS_DONTAUDIT
337 /* clang-format on */
339 int avtab_read_item(struct avtab *a, struct policy_file *fp, struct policydb *pol,
340 int (*insertf)(struct avtab *a, const struct avtab_key *k,
341 const struct avtab_datum *d, void *p),
342 void *p, bool conditional)
346 u32 items, items2, val, i;
347 struct avtab_key key;
348 struct avtab_datum datum;
349 struct avtab_extended_perms xperms;
350 __le32 buf32[ARRAY_SIZE(xperms.perms.p)];
352 unsigned int set, vers = pol->policyvers;
354 memset(&key, 0, sizeof(struct avtab_key));
355 memset(&datum, 0, sizeof(struct avtab_datum));
357 if (vers < POLICYDB_VERSION_AVTAB) {
358 rc = next_entry(buf32, fp, sizeof(u32));
360 pr_err("SELinux: avtab: truncated entry\n");
363 items2 = le32_to_cpu(buf32[0]);
364 if (items2 > ARRAY_SIZE(buf32)) {
365 pr_err("SELinux: avtab: entry overflow\n");
368 rc = next_entry(buf32, fp, sizeof(u32) * items2);
370 pr_err("SELinux: avtab: truncated entry\n");
375 val = le32_to_cpu(buf32[items++]);
376 key.source_type = (u16)val;
377 if (key.source_type != val) {
378 pr_err("SELinux: avtab: truncated source type\n");
381 val = le32_to_cpu(buf32[items++]);
382 key.target_type = (u16)val;
383 if (key.target_type != val) {
384 pr_err("SELinux: avtab: truncated target type\n");
387 val = le32_to_cpu(buf32[items++]);
388 key.target_class = (u16)val;
389 if (key.target_class != val) {
390 pr_err("SELinux: avtab: truncated target class\n");
394 val = le32_to_cpu(buf32[items++]);
395 enabled = (val & AVTAB_ENABLED_OLD) ? AVTAB_ENABLED : 0;
397 if (!(val & (AVTAB_AV | AVTAB_TYPE))) {
398 pr_err("SELinux: avtab: null entry\n");
401 if ((val & AVTAB_AV) && (val & AVTAB_TYPE)) {
402 pr_err("SELinux: avtab: entry has both access vectors and types\n");
405 if (val & AVTAB_XPERMS) {
406 pr_err("SELinux: avtab: entry has extended permissions\n");
410 for (i = 0; i < ARRAY_SIZE(spec_order); i++) {
411 if (val & spec_order[i]) {
412 key.specified = spec_order[i] | enabled;
413 datum.u.data = le32_to_cpu(buf32[items++]);
414 rc = insertf(a, &key, &datum, p);
420 if (items != items2) {
421 pr_err("SELinux: avtab: entry only had %d items, expected %d\n",
428 rc = next_entry(buf16, fp, sizeof(u16) * 4);
430 pr_err("SELinux: avtab: truncated entry\n");
435 key.source_type = le16_to_cpu(buf16[items++]);
436 key.target_type = le16_to_cpu(buf16[items++]);
437 key.target_class = le16_to_cpu(buf16[items++]);
438 key.specified = le16_to_cpu(buf16[items++]);
440 if (!policydb_type_isvalid(pol, key.source_type) ||
441 !policydb_type_isvalid(pol, key.target_type) ||
442 !policydb_class_isvalid(pol, key.target_class)) {
443 pr_err("SELinux: avtab: invalid type or class\n");
447 set = hweight16(key.specified & (AVTAB_XPERMS | AVTAB_TYPE | AVTAB_AV));
448 if (!set || set > 1) {
449 pr_err("SELinux: avtab: more than one specifier\n");
453 if ((vers < POLICYDB_VERSION_XPERMS_IOCTL) &&
454 (key.specified & AVTAB_XPERMS)) {
455 pr_err("SELinux: avtab: policy version %u does not "
456 "support extended permissions rules and one "
460 } else if ((vers < POLICYDB_VERSION_COND_XPERMS) &&
461 (key.specified & AVTAB_XPERMS) && conditional) {
462 pr_err("SELinux: avtab: policy version %u does not "
463 "support extended permissions rules in conditional "
464 "policies and one was specified\n",
467 } else if (key.specified & AVTAB_XPERMS) {
468 memset(&xperms, 0, sizeof(struct avtab_extended_perms));
469 rc = next_entry(&xperms.specified, fp, sizeof(u8));
471 pr_err("SELinux: avtab: truncated entry\n");
474 rc = next_entry(&xperms.driver, fp, sizeof(u8));
476 pr_err("SELinux: avtab: truncated entry\n");
479 rc = next_entry(buf32, fp,
480 sizeof(u32) * ARRAY_SIZE(xperms.perms.p));
482 pr_err("SELinux: avtab: truncated entry\n");
485 for (i = 0; i < ARRAY_SIZE(xperms.perms.p); i++)
486 xperms.perms.p[i] = le32_to_cpu(buf32[i]);
487 datum.u.xperms = &xperms;
489 rc = next_entry(buf32, fp, sizeof(u32));
491 pr_err("SELinux: avtab: truncated entry\n");
494 datum.u.data = le32_to_cpu(*buf32);
496 if ((key.specified & AVTAB_TYPE) &&
497 !policydb_type_isvalid(pol, datum.u.data)) {
498 pr_err("SELinux: avtab: invalid type\n");
501 return insertf(a, &key, &datum, p);
504 static int avtab_insertf(struct avtab *a, const struct avtab_key *k,
505 const struct avtab_datum *d, void *p)
507 return avtab_insert(a, k, d);
510 int avtab_read(struct avtab *a, struct policy_file *fp, struct policydb *pol)
516 rc = next_entry(buf, fp, sizeof(u32));
518 pr_err("SELinux: avtab: truncated table\n");
521 nel = le32_to_cpu(buf[0]);
523 pr_err("SELinux: avtab: table is empty\n");
528 rc = avtab_alloc(a, nel);
532 for (i = 0; i < nel; i++) {
533 rc = avtab_read_item(a, fp, pol, avtab_insertf, NULL, false);
536 pr_err("SELinux: avtab: out of memory\n");
537 else if (rc == -EEXIST)
538 pr_err("SELinux: avtab: duplicate entry\n");
553 int avtab_write_item(struct policydb *p, const struct avtab_node *cur, struct policy_file *fp)
556 __le32 buf32[ARRAY_SIZE(cur->datum.u.xperms->perms.p)];
560 buf16[0] = cpu_to_le16(cur->key.source_type);
561 buf16[1] = cpu_to_le16(cur->key.target_type);
562 buf16[2] = cpu_to_le16(cur->key.target_class);
563 buf16[3] = cpu_to_le16(cur->key.specified);
564 rc = put_entry(buf16, sizeof(u16), 4, fp);
568 if (cur->key.specified & AVTAB_XPERMS) {
569 rc = put_entry(&cur->datum.u.xperms->specified, sizeof(u8), 1,
573 rc = put_entry(&cur->datum.u.xperms->driver, sizeof(u8), 1, fp);
576 for (i = 0; i < ARRAY_SIZE(cur->datum.u.xperms->perms.p); i++)
577 buf32[i] = cpu_to_le32(cur->datum.u.xperms->perms.p[i]);
578 rc = put_entry(buf32, sizeof(u32),
579 ARRAY_SIZE(cur->datum.u.xperms->perms.p), fp);
581 buf32[0] = cpu_to_le32(cur->datum.u.data);
582 rc = put_entry(buf32, sizeof(u32), 1, fp);
589 int avtab_write(struct policydb *p, struct avtab *a, struct policy_file *fp)
593 struct avtab_node *cur;
596 buf[0] = cpu_to_le32(a->nel);
597 rc = put_entry(buf, sizeof(u32), 1, fp);
601 for (i = 0; i < a->nslot; i++) {
602 for (cur = a->htable[i]; cur; cur = cur->next) {
603 rc = avtab_write_item(p, cur, fp);
612 void __init avtab_cache_init(void)
614 avtab_node_cachep = KMEM_CACHE(avtab_node, SLAB_PANIC);
615 avtab_xperms_cachep = KMEM_CACHE(avtab_extended_perms, SLAB_PANIC);