Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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 | * |
| 9 | * Added conditional policy language extensions |
| 10 | * |
| 11 | * Copyright (C) 2003 Tresys Technology, LLC |
| 12 | * This program is free software; you can redistribute it and/or modify |
| 13 | * it under the terms of the GNU General Public License as published by |
| 14 | * the Free Software Foundation, version 2. |
| 15 | */ |
| 16 | |
| 17 | #include <linux/kernel.h> |
| 18 | #include <linux/slab.h> |
| 19 | #include <linux/vmalloc.h> |
| 20 | #include <linux/errno.h> |
| 21 | |
| 22 | #include "avtab.h" |
| 23 | #include "policydb.h" |
| 24 | |
| 25 | #define AVTAB_HASH(keyp) \ |
| 26 | ((keyp->target_class + \ |
| 27 | (keyp->target_type << 2) + \ |
| 28 | (keyp->source_type << 9)) & \ |
| 29 | AVTAB_HASH_MASK) |
| 30 | |
| 31 | static kmem_cache_t *avtab_node_cachep; |
| 32 | |
| 33 | static struct avtab_node* |
| 34 | avtab_insert_node(struct avtab *h, int hvalue, |
| 35 | struct avtab_node * prev, struct avtab_node * cur, |
| 36 | struct avtab_key *key, struct avtab_datum *datum) |
| 37 | { |
| 38 | struct avtab_node * newnode; |
| 39 | newnode = kmem_cache_alloc(avtab_node_cachep, SLAB_KERNEL); |
| 40 | if (newnode == NULL) |
| 41 | return NULL; |
| 42 | memset(newnode, 0, sizeof(struct avtab_node)); |
| 43 | newnode->key = *key; |
| 44 | newnode->datum = *datum; |
| 45 | if (prev) { |
| 46 | newnode->next = prev->next; |
| 47 | prev->next = newnode; |
| 48 | } else { |
| 49 | newnode->next = h->htable[hvalue]; |
| 50 | h->htable[hvalue] = newnode; |
| 51 | } |
| 52 | |
| 53 | h->nel++; |
| 54 | return newnode; |
| 55 | } |
| 56 | |
| 57 | static int avtab_insert(struct avtab *h, struct avtab_key *key, struct avtab_datum *datum) |
| 58 | { |
| 59 | int hvalue; |
| 60 | struct avtab_node *prev, *cur, *newnode; |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 61 | u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 62 | |
| 63 | if (!h) |
| 64 | return -EINVAL; |
| 65 | |
| 66 | hvalue = AVTAB_HASH(key); |
| 67 | for (prev = NULL, cur = h->htable[hvalue]; |
| 68 | cur; |
| 69 | prev = cur, cur = cur->next) { |
| 70 | if (key->source_type == cur->key.source_type && |
| 71 | key->target_type == cur->key.target_type && |
| 72 | key->target_class == cur->key.target_class && |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 73 | (specified & cur->key.specified)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 74 | return -EEXIST; |
| 75 | if (key->source_type < cur->key.source_type) |
| 76 | break; |
| 77 | if (key->source_type == cur->key.source_type && |
| 78 | key->target_type < cur->key.target_type) |
| 79 | break; |
| 80 | if (key->source_type == cur->key.source_type && |
| 81 | key->target_type == cur->key.target_type && |
| 82 | key->target_class < cur->key.target_class) |
| 83 | break; |
| 84 | } |
| 85 | |
| 86 | newnode = avtab_insert_node(h, hvalue, prev, cur, key, datum); |
| 87 | if(!newnode) |
| 88 | return -ENOMEM; |
| 89 | |
| 90 | return 0; |
| 91 | } |
| 92 | |
| 93 | /* Unlike avtab_insert(), this function allow multiple insertions of the same |
| 94 | * key/specified mask into the table, as needed by the conditional avtab. |
| 95 | * It also returns a pointer to the node inserted. |
| 96 | */ |
| 97 | struct avtab_node * |
| 98 | avtab_insert_nonunique(struct avtab * h, struct avtab_key * key, struct avtab_datum * datum) |
| 99 | { |
| 100 | int hvalue; |
| 101 | struct avtab_node *prev, *cur, *newnode; |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 102 | u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 103 | |
| 104 | if (!h) |
| 105 | return NULL; |
| 106 | hvalue = AVTAB_HASH(key); |
| 107 | for (prev = NULL, cur = h->htable[hvalue]; |
| 108 | cur; |
| 109 | prev = cur, cur = cur->next) { |
| 110 | if (key->source_type == cur->key.source_type && |
| 111 | key->target_type == cur->key.target_type && |
| 112 | key->target_class == cur->key.target_class && |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 113 | (specified & cur->key.specified)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 114 | break; |
| 115 | if (key->source_type < cur->key.source_type) |
| 116 | break; |
| 117 | if (key->source_type == cur->key.source_type && |
| 118 | key->target_type < cur->key.target_type) |
| 119 | break; |
| 120 | if (key->source_type == cur->key.source_type && |
| 121 | key->target_type == cur->key.target_type && |
| 122 | key->target_class < cur->key.target_class) |
| 123 | break; |
| 124 | } |
| 125 | newnode = avtab_insert_node(h, hvalue, prev, cur, key, datum); |
| 126 | |
| 127 | return newnode; |
| 128 | } |
| 129 | |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 130 | struct avtab_datum *avtab_search(struct avtab *h, struct avtab_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 131 | { |
| 132 | int hvalue; |
| 133 | struct avtab_node *cur; |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 134 | u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 135 | |
| 136 | if (!h) |
| 137 | return NULL; |
| 138 | |
| 139 | hvalue = AVTAB_HASH(key); |
| 140 | for (cur = h->htable[hvalue]; cur; cur = cur->next) { |
| 141 | if (key->source_type == cur->key.source_type && |
| 142 | key->target_type == cur->key.target_type && |
| 143 | key->target_class == cur->key.target_class && |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 144 | (specified & cur->key.specified)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 145 | return &cur->datum; |
| 146 | |
| 147 | if (key->source_type < cur->key.source_type) |
| 148 | break; |
| 149 | if (key->source_type == cur->key.source_type && |
| 150 | key->target_type < cur->key.target_type) |
| 151 | break; |
| 152 | if (key->source_type == cur->key.source_type && |
| 153 | key->target_type == cur->key.target_type && |
| 154 | key->target_class < cur->key.target_class) |
| 155 | break; |
| 156 | } |
| 157 | |
| 158 | return NULL; |
| 159 | } |
| 160 | |
| 161 | /* This search function returns a node pointer, and can be used in |
| 162 | * conjunction with avtab_search_next_node() |
| 163 | */ |
| 164 | struct avtab_node* |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 165 | avtab_search_node(struct avtab *h, struct avtab_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 166 | { |
| 167 | int hvalue; |
| 168 | struct avtab_node *cur; |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 169 | u16 specified = key->specified & ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 170 | |
| 171 | if (!h) |
| 172 | return NULL; |
| 173 | |
| 174 | hvalue = AVTAB_HASH(key); |
| 175 | for (cur = h->htable[hvalue]; cur; cur = cur->next) { |
| 176 | if (key->source_type == cur->key.source_type && |
| 177 | key->target_type == cur->key.target_type && |
| 178 | key->target_class == cur->key.target_class && |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 179 | (specified & cur->key.specified)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 180 | return cur; |
| 181 | |
| 182 | if (key->source_type < cur->key.source_type) |
| 183 | break; |
| 184 | if (key->source_type == cur->key.source_type && |
| 185 | key->target_type < cur->key.target_type) |
| 186 | break; |
| 187 | if (key->source_type == cur->key.source_type && |
| 188 | key->target_type == cur->key.target_type && |
| 189 | key->target_class < cur->key.target_class) |
| 190 | break; |
| 191 | } |
| 192 | return NULL; |
| 193 | } |
| 194 | |
| 195 | struct avtab_node* |
| 196 | avtab_search_node_next(struct avtab_node *node, int specified) |
| 197 | { |
| 198 | struct avtab_node *cur; |
| 199 | |
| 200 | if (!node) |
| 201 | return NULL; |
| 202 | |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 203 | specified &= ~(AVTAB_ENABLED|AVTAB_ENABLED_OLD); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 204 | for (cur = node->next; cur; cur = cur->next) { |
| 205 | if (node->key.source_type == cur->key.source_type && |
| 206 | node->key.target_type == cur->key.target_type && |
| 207 | node->key.target_class == cur->key.target_class && |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 208 | (specified & cur->key.specified)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 209 | return cur; |
| 210 | |
| 211 | if (node->key.source_type < cur->key.source_type) |
| 212 | break; |
| 213 | if (node->key.source_type == cur->key.source_type && |
| 214 | node->key.target_type < cur->key.target_type) |
| 215 | break; |
| 216 | if (node->key.source_type == cur->key.source_type && |
| 217 | node->key.target_type == cur->key.target_type && |
| 218 | node->key.target_class < cur->key.target_class) |
| 219 | break; |
| 220 | } |
| 221 | return NULL; |
| 222 | } |
| 223 | |
| 224 | void avtab_destroy(struct avtab *h) |
| 225 | { |
| 226 | int i; |
| 227 | struct avtab_node *cur, *temp; |
| 228 | |
| 229 | if (!h || !h->htable) |
| 230 | return; |
| 231 | |
| 232 | for (i = 0; i < AVTAB_SIZE; i++) { |
| 233 | cur = h->htable[i]; |
| 234 | while (cur != NULL) { |
| 235 | temp = cur; |
| 236 | cur = cur->next; |
| 237 | kmem_cache_free(avtab_node_cachep, temp); |
| 238 | } |
| 239 | h->htable[i] = NULL; |
| 240 | } |
| 241 | vfree(h->htable); |
| 242 | h->htable = NULL; |
| 243 | } |
| 244 | |
| 245 | |
| 246 | int avtab_init(struct avtab *h) |
| 247 | { |
| 248 | int i; |
| 249 | |
| 250 | h->htable = vmalloc(sizeof(*(h->htable)) * AVTAB_SIZE); |
| 251 | if (!h->htable) |
| 252 | return -ENOMEM; |
| 253 | for (i = 0; i < AVTAB_SIZE; i++) |
| 254 | h->htable[i] = NULL; |
| 255 | h->nel = 0; |
| 256 | return 0; |
| 257 | } |
| 258 | |
| 259 | void avtab_hash_eval(struct avtab *h, char *tag) |
| 260 | { |
| 261 | int i, chain_len, slots_used, max_chain_len; |
| 262 | struct avtab_node *cur; |
| 263 | |
| 264 | slots_used = 0; |
| 265 | max_chain_len = 0; |
| 266 | for (i = 0; i < AVTAB_SIZE; i++) { |
| 267 | cur = h->htable[i]; |
| 268 | if (cur) { |
| 269 | slots_used++; |
| 270 | chain_len = 0; |
| 271 | while (cur) { |
| 272 | chain_len++; |
| 273 | cur = cur->next; |
| 274 | } |
| 275 | |
| 276 | if (chain_len > max_chain_len) |
| 277 | max_chain_len = chain_len; |
| 278 | } |
| 279 | } |
| 280 | |
| 281 | printk(KERN_INFO "%s: %d entries and %d/%d buckets used, longest " |
| 282 | "chain length %d\n", tag, h->nel, slots_used, AVTAB_SIZE, |
| 283 | max_chain_len); |
| 284 | } |
| 285 | |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 286 | static uint16_t spec_order[] = { |
| 287 | AVTAB_ALLOWED, |
| 288 | AVTAB_AUDITDENY, |
| 289 | AVTAB_AUDITALLOW, |
| 290 | AVTAB_TRANSITION, |
| 291 | AVTAB_CHANGE, |
| 292 | AVTAB_MEMBER |
| 293 | }; |
| 294 | |
| 295 | int avtab_read_item(void *fp, u32 vers, struct avtab *a, |
| 296 | int (*insertf)(struct avtab *a, struct avtab_key *k, |
| 297 | struct avtab_datum *d, void *p), |
| 298 | void *p) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 299 | { |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 300 | u16 buf16[4], enabled; |
| 301 | u32 buf32[7], items, items2, val; |
| 302 | struct avtab_key key; |
| 303 | struct avtab_datum datum; |
| 304 | int i, rc; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 305 | |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 306 | memset(&key, 0, sizeof(struct avtab_key)); |
| 307 | memset(&datum, 0, sizeof(struct avtab_datum)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 308 | |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 309 | if (vers < POLICYDB_VERSION_AVTAB) { |
| 310 | rc = next_entry(buf32, fp, sizeof(u32)); |
| 311 | if (rc < 0) { |
| 312 | printk(KERN_ERR "security: avtab: truncated entry\n"); |
| 313 | return -1; |
| 314 | } |
| 315 | items2 = le32_to_cpu(buf32[0]); |
| 316 | if (items2 > ARRAY_SIZE(buf32)) { |
| 317 | printk(KERN_ERR "security: avtab: entry overflow\n"); |
| 318 | return -1; |
| 319 | |
| 320 | } |
| 321 | rc = next_entry(buf32, fp, sizeof(u32)*items2); |
| 322 | if (rc < 0) { |
| 323 | printk(KERN_ERR "security: avtab: truncated entry\n"); |
| 324 | return -1; |
| 325 | } |
| 326 | items = 0; |
| 327 | |
| 328 | val = le32_to_cpu(buf32[items++]); |
| 329 | key.source_type = (u16)val; |
| 330 | if (key.source_type != val) { |
| 331 | printk("security: avtab: truncated source type\n"); |
| 332 | return -1; |
| 333 | } |
| 334 | val = le32_to_cpu(buf32[items++]); |
| 335 | key.target_type = (u16)val; |
| 336 | if (key.target_type != val) { |
| 337 | printk("security: avtab: truncated target type\n"); |
| 338 | return -1; |
| 339 | } |
| 340 | val = le32_to_cpu(buf32[items++]); |
| 341 | key.target_class = (u16)val; |
| 342 | if (key.target_class != val) { |
| 343 | printk("security: avtab: truncated target class\n"); |
| 344 | return -1; |
| 345 | } |
| 346 | |
| 347 | val = le32_to_cpu(buf32[items++]); |
| 348 | enabled = (val & AVTAB_ENABLED_OLD) ? AVTAB_ENABLED : 0; |
| 349 | |
| 350 | if (!(val & (AVTAB_AV | AVTAB_TYPE))) { |
| 351 | printk("security: avtab: null entry\n"); |
| 352 | return -1; |
| 353 | } |
| 354 | if ((val & AVTAB_AV) && |
| 355 | (val & AVTAB_TYPE)) { |
| 356 | printk("security: avtab: entry has both access vectors and types\n"); |
| 357 | return -1; |
| 358 | } |
| 359 | |
| 360 | for (i = 0; i < sizeof(spec_order)/sizeof(u16); i++) { |
| 361 | if (val & spec_order[i]) { |
| 362 | key.specified = spec_order[i] | enabled; |
| 363 | datum.data = le32_to_cpu(buf32[items++]); |
| 364 | rc = insertf(a, &key, &datum, p); |
| 365 | if (rc) return rc; |
| 366 | } |
| 367 | } |
| 368 | |
| 369 | if (items != items2) { |
| 370 | printk("security: avtab: entry only had %d items, expected %d\n", items2, items); |
| 371 | return -1; |
| 372 | } |
| 373 | return 0; |
| 374 | } |
| 375 | |
| 376 | rc = next_entry(buf16, fp, sizeof(u16)*4); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 377 | if (rc < 0) { |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 378 | printk("security: avtab: truncated entry\n"); |
| 379 | return -1; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 380 | } |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 381 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 382 | items = 0; |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 383 | key.source_type = le16_to_cpu(buf16[items++]); |
| 384 | key.target_type = le16_to_cpu(buf16[items++]); |
| 385 | key.target_class = le16_to_cpu(buf16[items++]); |
| 386 | key.specified = le16_to_cpu(buf16[items++]); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 387 | |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 388 | rc = next_entry(buf32, fp, sizeof(u32)); |
| 389 | if (rc < 0) { |
| 390 | printk("security: avtab: truncated entry\n"); |
| 391 | return -1; |
| 392 | } |
| 393 | datum.data = le32_to_cpu(*buf32); |
| 394 | return insertf(a, &key, &datum, p); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 395 | } |
| 396 | |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 397 | static int avtab_insertf(struct avtab *a, struct avtab_key *k, |
| 398 | struct avtab_datum *d, void *p) |
| 399 | { |
| 400 | return avtab_insert(a, k, d); |
| 401 | } |
| 402 | |
| 403 | int avtab_read(struct avtab *a, void *fp, u32 vers) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 404 | { |
| 405 | int rc; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 406 | u32 buf[1]; |
| 407 | u32 nel, i; |
| 408 | |
| 409 | |
| 410 | rc = next_entry(buf, fp, sizeof(u32)); |
| 411 | if (rc < 0) { |
| 412 | printk(KERN_ERR "security: avtab: truncated table\n"); |
| 413 | goto bad; |
| 414 | } |
| 415 | nel = le32_to_cpu(buf[0]); |
| 416 | if (!nel) { |
| 417 | printk(KERN_ERR "security: avtab: table is empty\n"); |
| 418 | rc = -EINVAL; |
| 419 | goto bad; |
| 420 | } |
| 421 | for (i = 0; i < nel; i++) { |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 422 | rc = avtab_read_item(fp,vers, a, avtab_insertf, NULL); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 423 | if (rc) { |
| 424 | if (rc == -ENOMEM) |
| 425 | printk(KERN_ERR "security: avtab: out of memory\n"); |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 426 | else if (rc == -EEXIST) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 427 | printk(KERN_ERR "security: avtab: duplicate entry\n"); |
Stephen Smalley | 782ebb9 | 2005-09-03 15:55:16 -0700 | [diff] [blame^] | 428 | else |
| 429 | rc = -EINVAL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 430 | goto bad; |
| 431 | } |
| 432 | } |
| 433 | |
| 434 | rc = 0; |
| 435 | out: |
| 436 | return rc; |
| 437 | |
| 438 | bad: |
| 439 | avtab_destroy(a); |
| 440 | goto out; |
| 441 | } |
| 442 | |
| 443 | void avtab_cache_init(void) |
| 444 | { |
| 445 | avtab_node_cachep = kmem_cache_create("avtab_node", |
| 446 | sizeof(struct avtab_node), |
| 447 | 0, SLAB_PANIC, NULL, NULL); |
| 448 | } |
| 449 | |
| 450 | void avtab_cache_destroy(void) |
| 451 | { |
| 452 | kmem_cache_destroy (avtab_node_cachep); |
| 453 | } |