yuezonghe | 824eb0c | 2024-06-27 02:32:26 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Implementation of the policy database. |
| 3 | * |
| 4 | * Author : Stephen Smalley, <sds@epoch.ncsc.mil> |
| 5 | */ |
| 6 | |
| 7 | /* |
| 8 | * Updated: Trusted Computer Solutions, Inc. <dgoeddel@trustedcs.com> |
| 9 | * |
| 10 | * Support for enhanced MLS infrastructure. |
| 11 | * |
| 12 | * Updated: Frank Mayer <mayerf@tresys.com> and Karl MacMillan <kmacmillan@tresys.com> |
| 13 | * |
| 14 | * Added conditional policy language extensions |
| 15 | * |
| 16 | * Updated: Hewlett-Packard <paul@paul-moore.com> |
| 17 | * |
| 18 | * Added support for the policy capability bitmap |
| 19 | * |
| 20 | * Copyright (C) 2007 Hewlett-Packard Development Company, L.P. |
| 21 | * Copyright (C) 2004-2005 Trusted Computer Solutions, Inc. |
| 22 | * Copyright (C) 2003 - 2004 Tresys Technology, LLC |
| 23 | * This program is free software; you can redistribute it and/or modify |
| 24 | * it under the terms of the GNU General Public License as published by |
| 25 | * the Free Software Foundation, version 2. |
| 26 | */ |
| 27 | |
| 28 | #include <linux/kernel.h> |
| 29 | #include <linux/sched.h> |
| 30 | #include <linux/slab.h> |
| 31 | #include <linux/string.h> |
| 32 | #include <linux/errno.h> |
| 33 | #include <linux/audit.h> |
| 34 | #include <linux/flex_array.h> |
| 35 | #include "security.h" |
| 36 | |
| 37 | #include "policydb.h" |
| 38 | #include "conditional.h" |
| 39 | #include "mls.h" |
| 40 | #include "services.h" |
| 41 | |
| 42 | #define _DEBUG_HASHES |
| 43 | |
| 44 | #ifdef DEBUG_HASHES |
| 45 | static const char *symtab_name[SYM_NUM] = { |
| 46 | "common prefixes", |
| 47 | "classes", |
| 48 | "roles", |
| 49 | "types", |
| 50 | "users", |
| 51 | "bools", |
| 52 | "levels", |
| 53 | "categories", |
| 54 | }; |
| 55 | #endif |
| 56 | |
| 57 | static unsigned int symtab_sizes[SYM_NUM] = { |
| 58 | 2, |
| 59 | 32, |
| 60 | 16, |
| 61 | 512, |
| 62 | 128, |
| 63 | 16, |
| 64 | 16, |
| 65 | 16, |
| 66 | }; |
| 67 | |
| 68 | struct policydb_compat_info { |
| 69 | int version; |
| 70 | int sym_num; |
| 71 | int ocon_num; |
| 72 | }; |
| 73 | |
| 74 | /* These need to be updated if SYM_NUM or OCON_NUM changes */ |
| 75 | static struct policydb_compat_info policydb_compat[] = { |
| 76 | { |
| 77 | .version = POLICYDB_VERSION_BASE, |
| 78 | .sym_num = SYM_NUM - 3, |
| 79 | .ocon_num = OCON_NUM - 1, |
| 80 | }, |
| 81 | { |
| 82 | .version = POLICYDB_VERSION_BOOL, |
| 83 | .sym_num = SYM_NUM - 2, |
| 84 | .ocon_num = OCON_NUM - 1, |
| 85 | }, |
| 86 | { |
| 87 | .version = POLICYDB_VERSION_IPV6, |
| 88 | .sym_num = SYM_NUM - 2, |
| 89 | .ocon_num = OCON_NUM, |
| 90 | }, |
| 91 | { |
| 92 | .version = POLICYDB_VERSION_NLCLASS, |
| 93 | .sym_num = SYM_NUM - 2, |
| 94 | .ocon_num = OCON_NUM, |
| 95 | }, |
| 96 | { |
| 97 | .version = POLICYDB_VERSION_MLS, |
| 98 | .sym_num = SYM_NUM, |
| 99 | .ocon_num = OCON_NUM, |
| 100 | }, |
| 101 | { |
| 102 | .version = POLICYDB_VERSION_AVTAB, |
| 103 | .sym_num = SYM_NUM, |
| 104 | .ocon_num = OCON_NUM, |
| 105 | }, |
| 106 | { |
| 107 | .version = POLICYDB_VERSION_RANGETRANS, |
| 108 | .sym_num = SYM_NUM, |
| 109 | .ocon_num = OCON_NUM, |
| 110 | }, |
| 111 | { |
| 112 | .version = POLICYDB_VERSION_POLCAP, |
| 113 | .sym_num = SYM_NUM, |
| 114 | .ocon_num = OCON_NUM, |
| 115 | }, |
| 116 | { |
| 117 | .version = POLICYDB_VERSION_PERMISSIVE, |
| 118 | .sym_num = SYM_NUM, |
| 119 | .ocon_num = OCON_NUM, |
| 120 | }, |
| 121 | { |
| 122 | .version = POLICYDB_VERSION_BOUNDARY, |
| 123 | .sym_num = SYM_NUM, |
| 124 | .ocon_num = OCON_NUM, |
| 125 | }, |
| 126 | { |
| 127 | .version = POLICYDB_VERSION_FILENAME_TRANS, |
| 128 | .sym_num = SYM_NUM, |
| 129 | .ocon_num = OCON_NUM, |
| 130 | }, |
| 131 | { |
| 132 | .version = POLICYDB_VERSION_ROLETRANS, |
| 133 | .sym_num = SYM_NUM, |
| 134 | .ocon_num = OCON_NUM, |
| 135 | }, |
| 136 | }; |
| 137 | |
| 138 | static struct policydb_compat_info *policydb_lookup_compat(int version) |
| 139 | { |
| 140 | int i; |
| 141 | struct policydb_compat_info *info = NULL; |
| 142 | |
| 143 | for (i = 0; i < ARRAY_SIZE(policydb_compat); i++) { |
| 144 | if (policydb_compat[i].version == version) { |
| 145 | info = &policydb_compat[i]; |
| 146 | break; |
| 147 | } |
| 148 | } |
| 149 | return info; |
| 150 | } |
| 151 | |
| 152 | /* |
| 153 | * Initialize the role table. |
| 154 | */ |
| 155 | static int roles_init(struct policydb *p) |
| 156 | { |
| 157 | char *key = NULL; |
| 158 | int rc; |
| 159 | struct role_datum *role; |
| 160 | |
| 161 | rc = -ENOMEM; |
| 162 | role = kzalloc(sizeof(*role), GFP_KERNEL); |
| 163 | if (!role) |
| 164 | goto out; |
| 165 | |
| 166 | rc = -EINVAL; |
| 167 | role->value = ++p->p_roles.nprim; |
| 168 | if (role->value != OBJECT_R_VAL) |
| 169 | goto out; |
| 170 | |
| 171 | rc = -ENOMEM; |
| 172 | key = kstrdup(OBJECT_R, GFP_KERNEL); |
| 173 | if (!key) |
| 174 | goto out; |
| 175 | |
| 176 | rc = hashtab_insert(p->p_roles.table, key, role); |
| 177 | if (rc) |
| 178 | goto out; |
| 179 | |
| 180 | return 0; |
| 181 | out: |
| 182 | kfree(key); |
| 183 | kfree(role); |
| 184 | return rc; |
| 185 | } |
| 186 | |
| 187 | static u32 filenametr_hash(struct hashtab *h, const void *k) |
| 188 | { |
| 189 | const struct filename_trans *ft = k; |
| 190 | unsigned long hash; |
| 191 | unsigned int byte_num; |
| 192 | unsigned char focus; |
| 193 | |
| 194 | hash = ft->stype ^ ft->ttype ^ ft->tclass; |
| 195 | |
| 196 | byte_num = 0; |
| 197 | while ((focus = ft->name[byte_num++])) |
| 198 | hash = partial_name_hash(focus, hash); |
| 199 | return hash & (h->size - 1); |
| 200 | } |
| 201 | |
| 202 | static int filenametr_cmp(struct hashtab *h, const void *k1, const void *k2) |
| 203 | { |
| 204 | const struct filename_trans *ft1 = k1; |
| 205 | const struct filename_trans *ft2 = k2; |
| 206 | int v; |
| 207 | |
| 208 | v = ft1->stype - ft2->stype; |
| 209 | if (v) |
| 210 | return v; |
| 211 | |
| 212 | v = ft1->ttype - ft2->ttype; |
| 213 | if (v) |
| 214 | return v; |
| 215 | |
| 216 | v = ft1->tclass - ft2->tclass; |
| 217 | if (v) |
| 218 | return v; |
| 219 | |
| 220 | return strcmp(ft1->name, ft2->name); |
| 221 | |
| 222 | } |
| 223 | |
| 224 | static u32 rangetr_hash(struct hashtab *h, const void *k) |
| 225 | { |
| 226 | const struct range_trans *key = k; |
| 227 | return (key->source_type + (key->target_type << 3) + |
| 228 | (key->target_class << 5)) & (h->size - 1); |
| 229 | } |
| 230 | |
| 231 | static int rangetr_cmp(struct hashtab *h, const void *k1, const void *k2) |
| 232 | { |
| 233 | const struct range_trans *key1 = k1, *key2 = k2; |
| 234 | int v; |
| 235 | |
| 236 | v = key1->source_type - key2->source_type; |
| 237 | if (v) |
| 238 | return v; |
| 239 | |
| 240 | v = key1->target_type - key2->target_type; |
| 241 | if (v) |
| 242 | return v; |
| 243 | |
| 244 | v = key1->target_class - key2->target_class; |
| 245 | |
| 246 | return v; |
| 247 | } |
| 248 | |
| 249 | /* |
| 250 | * Initialize a policy database structure. |
| 251 | */ |
| 252 | static int policydb_init(struct policydb *p) |
| 253 | { |
| 254 | int i, rc; |
| 255 | |
| 256 | memset(p, 0, sizeof(*p)); |
| 257 | |
| 258 | for (i = 0; i < SYM_NUM; i++) { |
| 259 | rc = symtab_init(&p->symtab[i], symtab_sizes[i]); |
| 260 | if (rc) |
| 261 | goto out; |
| 262 | } |
| 263 | |
| 264 | rc = avtab_init(&p->te_avtab); |
| 265 | if (rc) |
| 266 | goto out; |
| 267 | |
| 268 | rc = roles_init(p); |
| 269 | if (rc) |
| 270 | goto out; |
| 271 | |
| 272 | rc = cond_policydb_init(p); |
| 273 | if (rc) |
| 274 | goto out; |
| 275 | |
| 276 | p->filename_trans = hashtab_create(filenametr_hash, filenametr_cmp, (1 << 10)); |
| 277 | if (!p->filename_trans) |
| 278 | goto out; |
| 279 | |
| 280 | p->range_tr = hashtab_create(rangetr_hash, rangetr_cmp, 256); |
| 281 | if (!p->range_tr) |
| 282 | goto out; |
| 283 | |
| 284 | ebitmap_init(&p->filename_trans_ttypes); |
| 285 | ebitmap_init(&p->policycaps); |
| 286 | ebitmap_init(&p->permissive_map); |
| 287 | |
| 288 | return 0; |
| 289 | out: |
| 290 | hashtab_destroy(p->filename_trans); |
| 291 | hashtab_destroy(p->range_tr); |
| 292 | for (i = 0; i < SYM_NUM; i++) |
| 293 | hashtab_destroy(p->symtab[i].table); |
| 294 | return rc; |
| 295 | } |
| 296 | |
| 297 | /* |
| 298 | * The following *_index functions are used to |
| 299 | * define the val_to_name and val_to_struct arrays |
| 300 | * in a policy database structure. The val_to_name |
| 301 | * arrays are used when converting security context |
| 302 | * structures into string representations. The |
| 303 | * val_to_struct arrays are used when the attributes |
| 304 | * of a class, role, or user are needed. |
| 305 | */ |
| 306 | |
| 307 | static int common_index(void *key, void *datum, void *datap) |
| 308 | { |
| 309 | struct policydb *p; |
| 310 | struct common_datum *comdatum; |
| 311 | struct flex_array *fa; |
| 312 | |
| 313 | comdatum = datum; |
| 314 | p = datap; |
| 315 | if (!comdatum->value || comdatum->value > p->p_commons.nprim) |
| 316 | return -EINVAL; |
| 317 | |
| 318 | fa = p->sym_val_to_name[SYM_COMMONS]; |
| 319 | if (flex_array_put_ptr(fa, comdatum->value - 1, key, |
| 320 | GFP_KERNEL | __GFP_ZERO)) |
| 321 | BUG(); |
| 322 | return 0; |
| 323 | } |
| 324 | |
| 325 | static int class_index(void *key, void *datum, void *datap) |
| 326 | { |
| 327 | struct policydb *p; |
| 328 | struct class_datum *cladatum; |
| 329 | struct flex_array *fa; |
| 330 | |
| 331 | cladatum = datum; |
| 332 | p = datap; |
| 333 | if (!cladatum->value || cladatum->value > p->p_classes.nprim) |
| 334 | return -EINVAL; |
| 335 | fa = p->sym_val_to_name[SYM_CLASSES]; |
| 336 | if (flex_array_put_ptr(fa, cladatum->value - 1, key, |
| 337 | GFP_KERNEL | __GFP_ZERO)) |
| 338 | BUG(); |
| 339 | p->class_val_to_struct[cladatum->value - 1] = cladatum; |
| 340 | return 0; |
| 341 | } |
| 342 | |
| 343 | static int role_index(void *key, void *datum, void *datap) |
| 344 | { |
| 345 | struct policydb *p; |
| 346 | struct role_datum *role; |
| 347 | struct flex_array *fa; |
| 348 | |
| 349 | role = datum; |
| 350 | p = datap; |
| 351 | if (!role->value |
| 352 | || role->value > p->p_roles.nprim |
| 353 | || role->bounds > p->p_roles.nprim) |
| 354 | return -EINVAL; |
| 355 | |
| 356 | fa = p->sym_val_to_name[SYM_ROLES]; |
| 357 | if (flex_array_put_ptr(fa, role->value - 1, key, |
| 358 | GFP_KERNEL | __GFP_ZERO)) |
| 359 | BUG(); |
| 360 | p->role_val_to_struct[role->value - 1] = role; |
| 361 | return 0; |
| 362 | } |
| 363 | |
| 364 | static int type_index(void *key, void *datum, void *datap) |
| 365 | { |
| 366 | struct policydb *p; |
| 367 | struct type_datum *typdatum; |
| 368 | struct flex_array *fa; |
| 369 | |
| 370 | typdatum = datum; |
| 371 | p = datap; |
| 372 | |
| 373 | if (typdatum->primary) { |
| 374 | if (!typdatum->value |
| 375 | || typdatum->value > p->p_types.nprim |
| 376 | || typdatum->bounds > p->p_types.nprim) |
| 377 | return -EINVAL; |
| 378 | fa = p->sym_val_to_name[SYM_TYPES]; |
| 379 | if (flex_array_put_ptr(fa, typdatum->value - 1, key, |
| 380 | GFP_KERNEL | __GFP_ZERO)) |
| 381 | BUG(); |
| 382 | |
| 383 | fa = p->type_val_to_struct_array; |
| 384 | if (flex_array_put_ptr(fa, typdatum->value - 1, typdatum, |
| 385 | GFP_KERNEL | __GFP_ZERO)) |
| 386 | BUG(); |
| 387 | } |
| 388 | |
| 389 | return 0; |
| 390 | } |
| 391 | |
| 392 | static int user_index(void *key, void *datum, void *datap) |
| 393 | { |
| 394 | struct policydb *p; |
| 395 | struct user_datum *usrdatum; |
| 396 | struct flex_array *fa; |
| 397 | |
| 398 | usrdatum = datum; |
| 399 | p = datap; |
| 400 | if (!usrdatum->value |
| 401 | || usrdatum->value > p->p_users.nprim |
| 402 | || usrdatum->bounds > p->p_users.nprim) |
| 403 | return -EINVAL; |
| 404 | |
| 405 | fa = p->sym_val_to_name[SYM_USERS]; |
| 406 | if (flex_array_put_ptr(fa, usrdatum->value - 1, key, |
| 407 | GFP_KERNEL | __GFP_ZERO)) |
| 408 | BUG(); |
| 409 | p->user_val_to_struct[usrdatum->value - 1] = usrdatum; |
| 410 | return 0; |
| 411 | } |
| 412 | |
| 413 | static int sens_index(void *key, void *datum, void *datap) |
| 414 | { |
| 415 | struct policydb *p; |
| 416 | struct level_datum *levdatum; |
| 417 | struct flex_array *fa; |
| 418 | |
| 419 | levdatum = datum; |
| 420 | p = datap; |
| 421 | |
| 422 | if (!levdatum->isalias) { |
| 423 | if (!levdatum->level->sens || |
| 424 | levdatum->level->sens > p->p_levels.nprim) |
| 425 | return -EINVAL; |
| 426 | fa = p->sym_val_to_name[SYM_LEVELS]; |
| 427 | if (flex_array_put_ptr(fa, levdatum->level->sens - 1, key, |
| 428 | GFP_KERNEL | __GFP_ZERO)) |
| 429 | BUG(); |
| 430 | } |
| 431 | |
| 432 | return 0; |
| 433 | } |
| 434 | |
| 435 | static int cat_index(void *key, void *datum, void *datap) |
| 436 | { |
| 437 | struct policydb *p; |
| 438 | struct cat_datum *catdatum; |
| 439 | struct flex_array *fa; |
| 440 | |
| 441 | catdatum = datum; |
| 442 | p = datap; |
| 443 | |
| 444 | if (!catdatum->isalias) { |
| 445 | if (!catdatum->value || catdatum->value > p->p_cats.nprim) |
| 446 | return -EINVAL; |
| 447 | fa = p->sym_val_to_name[SYM_CATS]; |
| 448 | if (flex_array_put_ptr(fa, catdatum->value - 1, key, |
| 449 | GFP_KERNEL | __GFP_ZERO)) |
| 450 | BUG(); |
| 451 | } |
| 452 | |
| 453 | return 0; |
| 454 | } |
| 455 | |
| 456 | static int (*index_f[SYM_NUM]) (void *key, void *datum, void *datap) = |
| 457 | { |
| 458 | common_index, |
| 459 | class_index, |
| 460 | role_index, |
| 461 | type_index, |
| 462 | user_index, |
| 463 | cond_index_bool, |
| 464 | sens_index, |
| 465 | cat_index, |
| 466 | }; |
| 467 | |
| 468 | #ifdef DEBUG_HASHES |
| 469 | static void hash_eval(struct hashtab *h, const char *hash_name) |
| 470 | { |
| 471 | struct hashtab_info info; |
| 472 | |
| 473 | hashtab_stat(h, &info); |
| 474 | printk(KERN_DEBUG "SELinux: %s: %d entries and %d/%d buckets used, " |
| 475 | "longest chain length %d\n", hash_name, h->nel, |
| 476 | info.slots_used, h->size, info.max_chain_len); |
| 477 | } |
| 478 | |
| 479 | static void symtab_hash_eval(struct symtab *s) |
| 480 | { |
| 481 | int i; |
| 482 | |
| 483 | for (i = 0; i < SYM_NUM; i++) |
| 484 | hash_eval(s[i].table, symtab_name[i]); |
| 485 | } |
| 486 | |
| 487 | #else |
| 488 | static inline void hash_eval(struct hashtab *h, char *hash_name) |
| 489 | { |
| 490 | } |
| 491 | #endif |
| 492 | |
| 493 | /* |
| 494 | * Define the other val_to_name and val_to_struct arrays |
| 495 | * in a policy database structure. |
| 496 | * |
| 497 | * Caller must clean up on failure. |
| 498 | */ |
| 499 | static int policydb_index(struct policydb *p) |
| 500 | { |
| 501 | int i, rc; |
| 502 | |
| 503 | printk(KERN_DEBUG "SELinux: %d users, %d roles, %d types, %d bools", |
| 504 | p->p_users.nprim, p->p_roles.nprim, p->p_types.nprim, p->p_bools.nprim); |
| 505 | if (p->mls_enabled) |
| 506 | printk(", %d sens, %d cats", p->p_levels.nprim, |
| 507 | p->p_cats.nprim); |
| 508 | printk("\n"); |
| 509 | |
| 510 | printk(KERN_DEBUG "SELinux: %d classes, %d rules\n", |
| 511 | p->p_classes.nprim, p->te_avtab.nel); |
| 512 | |
| 513 | #ifdef DEBUG_HASHES |
| 514 | avtab_hash_eval(&p->te_avtab, "rules"); |
| 515 | symtab_hash_eval(p->symtab); |
| 516 | #endif |
| 517 | |
| 518 | rc = -ENOMEM; |
| 519 | p->class_val_to_struct = |
| 520 | kmalloc(p->p_classes.nprim * sizeof(*(p->class_val_to_struct)), |
| 521 | GFP_KERNEL); |
| 522 | if (!p->class_val_to_struct) |
| 523 | goto out; |
| 524 | |
| 525 | rc = -ENOMEM; |
| 526 | p->role_val_to_struct = |
| 527 | kmalloc(p->p_roles.nprim * sizeof(*(p->role_val_to_struct)), |
| 528 | GFP_KERNEL); |
| 529 | if (!p->role_val_to_struct) |
| 530 | goto out; |
| 531 | |
| 532 | rc = -ENOMEM; |
| 533 | p->user_val_to_struct = |
| 534 | kmalloc(p->p_users.nprim * sizeof(*(p->user_val_to_struct)), |
| 535 | GFP_KERNEL); |
| 536 | if (!p->user_val_to_struct) |
| 537 | goto out; |
| 538 | |
| 539 | /* Yes, I want the sizeof the pointer, not the structure */ |
| 540 | rc = -ENOMEM; |
| 541 | p->type_val_to_struct_array = flex_array_alloc(sizeof(struct type_datum *), |
| 542 | p->p_types.nprim, |
| 543 | GFP_KERNEL | __GFP_ZERO); |
| 544 | if (!p->type_val_to_struct_array) |
| 545 | goto out; |
| 546 | |
| 547 | rc = flex_array_prealloc(p->type_val_to_struct_array, 0, |
| 548 | p->p_types.nprim, GFP_KERNEL | __GFP_ZERO); |
| 549 | if (rc) |
| 550 | goto out; |
| 551 | |
| 552 | rc = cond_init_bool_indexes(p); |
| 553 | if (rc) |
| 554 | goto out; |
| 555 | |
| 556 | for (i = 0; i < SYM_NUM; i++) { |
| 557 | rc = -ENOMEM; |
| 558 | p->sym_val_to_name[i] = flex_array_alloc(sizeof(char *), |
| 559 | p->symtab[i].nprim, |
| 560 | GFP_KERNEL | __GFP_ZERO); |
| 561 | if (!p->sym_val_to_name[i]) |
| 562 | goto out; |
| 563 | |
| 564 | rc = flex_array_prealloc(p->sym_val_to_name[i], |
| 565 | 0, p->symtab[i].nprim, |
| 566 | GFP_KERNEL | __GFP_ZERO); |
| 567 | if (rc) |
| 568 | goto out; |
| 569 | |
| 570 | rc = hashtab_map(p->symtab[i].table, index_f[i], p); |
| 571 | if (rc) |
| 572 | goto out; |
| 573 | } |
| 574 | rc = 0; |
| 575 | out: |
| 576 | return rc; |
| 577 | } |
| 578 | |
| 579 | /* |
| 580 | * The following *_destroy functions are used to |
| 581 | * free any memory allocated for each kind of |
| 582 | * symbol data in the policy database. |
| 583 | */ |
| 584 | |
| 585 | static int perm_destroy(void *key, void *datum, void *p) |
| 586 | { |
| 587 | kfree(key); |
| 588 | kfree(datum); |
| 589 | return 0; |
| 590 | } |
| 591 | |
| 592 | static int common_destroy(void *key, void *datum, void *p) |
| 593 | { |
| 594 | struct common_datum *comdatum; |
| 595 | |
| 596 | kfree(key); |
| 597 | if (datum) { |
| 598 | comdatum = datum; |
| 599 | hashtab_map(comdatum->permissions.table, perm_destroy, NULL); |
| 600 | hashtab_destroy(comdatum->permissions.table); |
| 601 | } |
| 602 | kfree(datum); |
| 603 | return 0; |
| 604 | } |
| 605 | |
| 606 | static int cls_destroy(void *key, void *datum, void *p) |
| 607 | { |
| 608 | struct class_datum *cladatum; |
| 609 | struct constraint_node *constraint, *ctemp; |
| 610 | struct constraint_expr *e, *etmp; |
| 611 | |
| 612 | kfree(key); |
| 613 | if (datum) { |
| 614 | cladatum = datum; |
| 615 | hashtab_map(cladatum->permissions.table, perm_destroy, NULL); |
| 616 | hashtab_destroy(cladatum->permissions.table); |
| 617 | constraint = cladatum->constraints; |
| 618 | while (constraint) { |
| 619 | e = constraint->expr; |
| 620 | while (e) { |
| 621 | ebitmap_destroy(&e->names); |
| 622 | etmp = e; |
| 623 | e = e->next; |
| 624 | kfree(etmp); |
| 625 | } |
| 626 | ctemp = constraint; |
| 627 | constraint = constraint->next; |
| 628 | kfree(ctemp); |
| 629 | } |
| 630 | |
| 631 | constraint = cladatum->validatetrans; |
| 632 | while (constraint) { |
| 633 | e = constraint->expr; |
| 634 | while (e) { |
| 635 | ebitmap_destroy(&e->names); |
| 636 | etmp = e; |
| 637 | e = e->next; |
| 638 | kfree(etmp); |
| 639 | } |
| 640 | ctemp = constraint; |
| 641 | constraint = constraint->next; |
| 642 | kfree(ctemp); |
| 643 | } |
| 644 | |
| 645 | kfree(cladatum->comkey); |
| 646 | } |
| 647 | kfree(datum); |
| 648 | return 0; |
| 649 | } |
| 650 | |
| 651 | static int role_destroy(void *key, void *datum, void *p) |
| 652 | { |
| 653 | struct role_datum *role; |
| 654 | |
| 655 | kfree(key); |
| 656 | if (datum) { |
| 657 | role = datum; |
| 658 | ebitmap_destroy(&role->dominates); |
| 659 | ebitmap_destroy(&role->types); |
| 660 | } |
| 661 | kfree(datum); |
| 662 | return 0; |
| 663 | } |
| 664 | |
| 665 | static int type_destroy(void *key, void *datum, void *p) |
| 666 | { |
| 667 | kfree(key); |
| 668 | kfree(datum); |
| 669 | return 0; |
| 670 | } |
| 671 | |
| 672 | static int user_destroy(void *key, void *datum, void *p) |
| 673 | { |
| 674 | struct user_datum *usrdatum; |
| 675 | |
| 676 | kfree(key); |
| 677 | if (datum) { |
| 678 | usrdatum = datum; |
| 679 | ebitmap_destroy(&usrdatum->roles); |
| 680 | ebitmap_destroy(&usrdatum->range.level[0].cat); |
| 681 | ebitmap_destroy(&usrdatum->range.level[1].cat); |
| 682 | ebitmap_destroy(&usrdatum->dfltlevel.cat); |
| 683 | } |
| 684 | kfree(datum); |
| 685 | return 0; |
| 686 | } |
| 687 | |
| 688 | static int sens_destroy(void *key, void *datum, void *p) |
| 689 | { |
| 690 | struct level_datum *levdatum; |
| 691 | |
| 692 | kfree(key); |
| 693 | if (datum) { |
| 694 | levdatum = datum; |
| 695 | ebitmap_destroy(&levdatum->level->cat); |
| 696 | kfree(levdatum->level); |
| 697 | } |
| 698 | kfree(datum); |
| 699 | return 0; |
| 700 | } |
| 701 | |
| 702 | static int cat_destroy(void *key, void *datum, void *p) |
| 703 | { |
| 704 | kfree(key); |
| 705 | kfree(datum); |
| 706 | return 0; |
| 707 | } |
| 708 | |
| 709 | static int (*destroy_f[SYM_NUM]) (void *key, void *datum, void *datap) = |
| 710 | { |
| 711 | common_destroy, |
| 712 | cls_destroy, |
| 713 | role_destroy, |
| 714 | type_destroy, |
| 715 | user_destroy, |
| 716 | cond_destroy_bool, |
| 717 | sens_destroy, |
| 718 | cat_destroy, |
| 719 | }; |
| 720 | |
| 721 | static int filenametr_destroy(void *key, void *datum, void *p) |
| 722 | { |
| 723 | struct filename_trans *ft = key; |
| 724 | kfree(ft->name); |
| 725 | kfree(key); |
| 726 | kfree(datum); |
| 727 | cond_resched(); |
| 728 | return 0; |
| 729 | } |
| 730 | |
| 731 | static int range_tr_destroy(void *key, void *datum, void *p) |
| 732 | { |
| 733 | struct mls_range *rt = datum; |
| 734 | kfree(key); |
| 735 | ebitmap_destroy(&rt->level[0].cat); |
| 736 | ebitmap_destroy(&rt->level[1].cat); |
| 737 | kfree(datum); |
| 738 | cond_resched(); |
| 739 | return 0; |
| 740 | } |
| 741 | |
| 742 | static void ocontext_destroy(struct ocontext *c, int i) |
| 743 | { |
| 744 | if (!c) |
| 745 | return; |
| 746 | |
| 747 | context_destroy(&c->context[0]); |
| 748 | context_destroy(&c->context[1]); |
| 749 | if (i == OCON_ISID || i == OCON_FS || |
| 750 | i == OCON_NETIF || i == OCON_FSUSE) |
| 751 | kfree(c->u.name); |
| 752 | kfree(c); |
| 753 | } |
| 754 | |
| 755 | /* |
| 756 | * Free any memory allocated by a policy database structure. |
| 757 | */ |
| 758 | void policydb_destroy(struct policydb *p) |
| 759 | { |
| 760 | struct ocontext *c, *ctmp; |
| 761 | struct genfs *g, *gtmp; |
| 762 | int i; |
| 763 | struct role_allow *ra, *lra = NULL; |
| 764 | struct role_trans *tr, *ltr = NULL; |
| 765 | |
| 766 | for (i = 0; i < SYM_NUM; i++) { |
| 767 | cond_resched(); |
| 768 | hashtab_map(p->symtab[i].table, destroy_f[i], NULL); |
| 769 | hashtab_destroy(p->symtab[i].table); |
| 770 | } |
| 771 | |
| 772 | for (i = 0; i < SYM_NUM; i++) { |
| 773 | if (p->sym_val_to_name[i]) |
| 774 | flex_array_free(p->sym_val_to_name[i]); |
| 775 | } |
| 776 | |
| 777 | kfree(p->class_val_to_struct); |
| 778 | kfree(p->role_val_to_struct); |
| 779 | kfree(p->user_val_to_struct); |
| 780 | if (p->type_val_to_struct_array) |
| 781 | flex_array_free(p->type_val_to_struct_array); |
| 782 | |
| 783 | avtab_destroy(&p->te_avtab); |
| 784 | |
| 785 | for (i = 0; i < OCON_NUM; i++) { |
| 786 | cond_resched(); |
| 787 | c = p->ocontexts[i]; |
| 788 | while (c) { |
| 789 | ctmp = c; |
| 790 | c = c->next; |
| 791 | ocontext_destroy(ctmp, i); |
| 792 | } |
| 793 | p->ocontexts[i] = NULL; |
| 794 | } |
| 795 | |
| 796 | g = p->genfs; |
| 797 | while (g) { |
| 798 | cond_resched(); |
| 799 | kfree(g->fstype); |
| 800 | c = g->head; |
| 801 | while (c) { |
| 802 | ctmp = c; |
| 803 | c = c->next; |
| 804 | ocontext_destroy(ctmp, OCON_FSUSE); |
| 805 | } |
| 806 | gtmp = g; |
| 807 | g = g->next; |
| 808 | kfree(gtmp); |
| 809 | } |
| 810 | p->genfs = NULL; |
| 811 | |
| 812 | cond_policydb_destroy(p); |
| 813 | |
| 814 | for (tr = p->role_tr; tr; tr = tr->next) { |
| 815 | cond_resched(); |
| 816 | kfree(ltr); |
| 817 | ltr = tr; |
| 818 | } |
| 819 | kfree(ltr); |
| 820 | |
| 821 | for (ra = p->role_allow; ra; ra = ra->next) { |
| 822 | cond_resched(); |
| 823 | kfree(lra); |
| 824 | lra = ra; |
| 825 | } |
| 826 | kfree(lra); |
| 827 | |
| 828 | hashtab_map(p->filename_trans, filenametr_destroy, NULL); |
| 829 | hashtab_destroy(p->filename_trans); |
| 830 | |
| 831 | hashtab_map(p->range_tr, range_tr_destroy, NULL); |
| 832 | hashtab_destroy(p->range_tr); |
| 833 | |
| 834 | if (p->type_attr_map_array) { |
| 835 | for (i = 0; i < p->p_types.nprim; i++) { |
| 836 | struct ebitmap *e; |
| 837 | |
| 838 | e = flex_array_get(p->type_attr_map_array, i); |
| 839 | if (!e) |
| 840 | continue; |
| 841 | ebitmap_destroy(e); |
| 842 | } |
| 843 | flex_array_free(p->type_attr_map_array); |
| 844 | } |
| 845 | |
| 846 | ebitmap_destroy(&p->filename_trans_ttypes); |
| 847 | ebitmap_destroy(&p->policycaps); |
| 848 | ebitmap_destroy(&p->permissive_map); |
| 849 | |
| 850 | return; |
| 851 | } |
| 852 | |
| 853 | /* |
| 854 | * Load the initial SIDs specified in a policy database |
| 855 | * structure into a SID table. |
| 856 | */ |
| 857 | int policydb_load_isids(struct policydb *p, struct sidtab *s) |
| 858 | { |
| 859 | struct ocontext *head, *c; |
| 860 | int rc; |
| 861 | |
| 862 | rc = sidtab_init(s); |
| 863 | if (rc) { |
| 864 | printk(KERN_ERR "SELinux: out of memory on SID table init\n"); |
| 865 | goto out; |
| 866 | } |
| 867 | |
| 868 | head = p->ocontexts[OCON_ISID]; |
| 869 | for (c = head; c; c = c->next) { |
| 870 | rc = -EINVAL; |
| 871 | if (!c->context[0].user) { |
| 872 | printk(KERN_ERR "SELinux: SID %s was never defined.\n", |
| 873 | c->u.name); |
| 874 | goto out; |
| 875 | } |
| 876 | |
| 877 | rc = sidtab_insert(s, c->sid[0], &c->context[0]); |
| 878 | if (rc) { |
| 879 | printk(KERN_ERR "SELinux: unable to load initial SID %s.\n", |
| 880 | c->u.name); |
| 881 | goto out; |
| 882 | } |
| 883 | } |
| 884 | rc = 0; |
| 885 | out: |
| 886 | return rc; |
| 887 | } |
| 888 | |
| 889 | int policydb_class_isvalid(struct policydb *p, unsigned int class) |
| 890 | { |
| 891 | if (!class || class > p->p_classes.nprim) |
| 892 | return 0; |
| 893 | return 1; |
| 894 | } |
| 895 | |
| 896 | int policydb_role_isvalid(struct policydb *p, unsigned int role) |
| 897 | { |
| 898 | if (!role || role > p->p_roles.nprim) |
| 899 | return 0; |
| 900 | return 1; |
| 901 | } |
| 902 | |
| 903 | int policydb_type_isvalid(struct policydb *p, unsigned int type) |
| 904 | { |
| 905 | if (!type || type > p->p_types.nprim) |
| 906 | return 0; |
| 907 | return 1; |
| 908 | } |
| 909 | |
| 910 | /* |
| 911 | * Return 1 if the fields in the security context |
| 912 | * structure `c' are valid. Return 0 otherwise. |
| 913 | */ |
| 914 | int policydb_context_isvalid(struct policydb *p, struct context *c) |
| 915 | { |
| 916 | struct role_datum *role; |
| 917 | struct user_datum *usrdatum; |
| 918 | |
| 919 | if (!c->role || c->role > p->p_roles.nprim) |
| 920 | return 0; |
| 921 | |
| 922 | if (!c->user || c->user > p->p_users.nprim) |
| 923 | return 0; |
| 924 | |
| 925 | if (!c->type || c->type > p->p_types.nprim) |
| 926 | return 0; |
| 927 | |
| 928 | if (c->role != OBJECT_R_VAL) { |
| 929 | /* |
| 930 | * Role must be authorized for the type. |
| 931 | */ |
| 932 | role = p->role_val_to_struct[c->role - 1]; |
| 933 | if (!ebitmap_get_bit(&role->types, c->type - 1)) |
| 934 | /* role may not be associated with type */ |
| 935 | return 0; |
| 936 | |
| 937 | /* |
| 938 | * User must be authorized for the role. |
| 939 | */ |
| 940 | usrdatum = p->user_val_to_struct[c->user - 1]; |
| 941 | if (!usrdatum) |
| 942 | return 0; |
| 943 | |
| 944 | if (!ebitmap_get_bit(&usrdatum->roles, c->role - 1)) |
| 945 | /* user may not be associated with role */ |
| 946 | return 0; |
| 947 | } |
| 948 | |
| 949 | if (!mls_context_isvalid(p, c)) |
| 950 | return 0; |
| 951 | |
| 952 | return 1; |
| 953 | } |
| 954 | |
| 955 | /* |
| 956 | * Read a MLS range structure from a policydb binary |
| 957 | * representation file. |
| 958 | */ |
| 959 | static int mls_read_range_helper(struct mls_range *r, void *fp) |
| 960 | { |
| 961 | __le32 buf[2]; |
| 962 | u32 items; |
| 963 | int rc; |
| 964 | |
| 965 | rc = next_entry(buf, fp, sizeof(u32)); |
| 966 | if (rc) |
| 967 | goto out; |
| 968 | |
| 969 | rc = -EINVAL; |
| 970 | items = le32_to_cpu(buf[0]); |
| 971 | if (items > ARRAY_SIZE(buf)) { |
| 972 | printk(KERN_ERR "SELinux: mls: range overflow\n"); |
| 973 | goto out; |
| 974 | } |
| 975 | |
| 976 | rc = next_entry(buf, fp, sizeof(u32) * items); |
| 977 | if (rc) { |
| 978 | printk(KERN_ERR "SELinux: mls: truncated range\n"); |
| 979 | goto out; |
| 980 | } |
| 981 | |
| 982 | r->level[0].sens = le32_to_cpu(buf[0]); |
| 983 | if (items > 1) |
| 984 | r->level[1].sens = le32_to_cpu(buf[1]); |
| 985 | else |
| 986 | r->level[1].sens = r->level[0].sens; |
| 987 | |
| 988 | rc = ebitmap_read(&r->level[0].cat, fp); |
| 989 | if (rc) { |
| 990 | printk(KERN_ERR "SELinux: mls: error reading low categories\n"); |
| 991 | goto out; |
| 992 | } |
| 993 | if (items > 1) { |
| 994 | rc = ebitmap_read(&r->level[1].cat, fp); |
| 995 | if (rc) { |
| 996 | printk(KERN_ERR "SELinux: mls: error reading high categories\n"); |
| 997 | goto bad_high; |
| 998 | } |
| 999 | } else { |
| 1000 | rc = ebitmap_cpy(&r->level[1].cat, &r->level[0].cat); |
| 1001 | if (rc) { |
| 1002 | printk(KERN_ERR "SELinux: mls: out of memory\n"); |
| 1003 | goto bad_high; |
| 1004 | } |
| 1005 | } |
| 1006 | |
| 1007 | return 0; |
| 1008 | bad_high: |
| 1009 | ebitmap_destroy(&r->level[0].cat); |
| 1010 | out: |
| 1011 | return rc; |
| 1012 | } |
| 1013 | |
| 1014 | /* |
| 1015 | * Read and validate a security context structure |
| 1016 | * from a policydb binary representation file. |
| 1017 | */ |
| 1018 | static int context_read_and_validate(struct context *c, |
| 1019 | struct policydb *p, |
| 1020 | void *fp) |
| 1021 | { |
| 1022 | __le32 buf[3]; |
| 1023 | int rc; |
| 1024 | |
| 1025 | rc = next_entry(buf, fp, sizeof buf); |
| 1026 | if (rc) { |
| 1027 | printk(KERN_ERR "SELinux: context truncated\n"); |
| 1028 | goto out; |
| 1029 | } |
| 1030 | c->user = le32_to_cpu(buf[0]); |
| 1031 | c->role = le32_to_cpu(buf[1]); |
| 1032 | c->type = le32_to_cpu(buf[2]); |
| 1033 | if (p->policyvers >= POLICYDB_VERSION_MLS) { |
| 1034 | rc = mls_read_range_helper(&c->range, fp); |
| 1035 | if (rc) { |
| 1036 | printk(KERN_ERR "SELinux: error reading MLS range of context\n"); |
| 1037 | goto out; |
| 1038 | } |
| 1039 | } |
| 1040 | |
| 1041 | rc = -EINVAL; |
| 1042 | if (!policydb_context_isvalid(p, c)) { |
| 1043 | printk(KERN_ERR "SELinux: invalid security context\n"); |
| 1044 | context_destroy(c); |
| 1045 | goto out; |
| 1046 | } |
| 1047 | rc = 0; |
| 1048 | out: |
| 1049 | return rc; |
| 1050 | } |
| 1051 | |
| 1052 | /* |
| 1053 | * The following *_read functions are used to |
| 1054 | * read the symbol data from a policy database |
| 1055 | * binary representation file. |
| 1056 | */ |
| 1057 | |
| 1058 | static int perm_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1059 | { |
| 1060 | char *key = NULL; |
| 1061 | struct perm_datum *perdatum; |
| 1062 | int rc; |
| 1063 | __le32 buf[2]; |
| 1064 | u32 len; |
| 1065 | |
| 1066 | rc = -ENOMEM; |
| 1067 | perdatum = kzalloc(sizeof(*perdatum), GFP_KERNEL); |
| 1068 | if (!perdatum) |
| 1069 | goto bad; |
| 1070 | |
| 1071 | rc = next_entry(buf, fp, sizeof buf); |
| 1072 | if (rc) |
| 1073 | goto bad; |
| 1074 | |
| 1075 | len = le32_to_cpu(buf[0]); |
| 1076 | perdatum->value = le32_to_cpu(buf[1]); |
| 1077 | |
| 1078 | rc = -ENOMEM; |
| 1079 | key = kmalloc(len + 1, GFP_KERNEL); |
| 1080 | if (!key) |
| 1081 | goto bad; |
| 1082 | |
| 1083 | rc = next_entry(key, fp, len); |
| 1084 | if (rc) |
| 1085 | goto bad; |
| 1086 | key[len] = '\0'; |
| 1087 | |
| 1088 | rc = hashtab_insert(h, key, perdatum); |
| 1089 | if (rc) |
| 1090 | goto bad; |
| 1091 | |
| 1092 | return 0; |
| 1093 | bad: |
| 1094 | perm_destroy(key, perdatum, NULL); |
| 1095 | return rc; |
| 1096 | } |
| 1097 | |
| 1098 | static int common_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1099 | { |
| 1100 | char *key = NULL; |
| 1101 | struct common_datum *comdatum; |
| 1102 | __le32 buf[4]; |
| 1103 | u32 len, nel; |
| 1104 | int i, rc; |
| 1105 | |
| 1106 | rc = -ENOMEM; |
| 1107 | comdatum = kzalloc(sizeof(*comdatum), GFP_KERNEL); |
| 1108 | if (!comdatum) |
| 1109 | goto bad; |
| 1110 | |
| 1111 | rc = next_entry(buf, fp, sizeof buf); |
| 1112 | if (rc) |
| 1113 | goto bad; |
| 1114 | |
| 1115 | len = le32_to_cpu(buf[0]); |
| 1116 | comdatum->value = le32_to_cpu(buf[1]); |
| 1117 | |
| 1118 | rc = symtab_init(&comdatum->permissions, PERM_SYMTAB_SIZE); |
| 1119 | if (rc) |
| 1120 | goto bad; |
| 1121 | comdatum->permissions.nprim = le32_to_cpu(buf[2]); |
| 1122 | nel = le32_to_cpu(buf[3]); |
| 1123 | |
| 1124 | rc = -ENOMEM; |
| 1125 | key = kmalloc(len + 1, GFP_KERNEL); |
| 1126 | if (!key) |
| 1127 | goto bad; |
| 1128 | |
| 1129 | rc = next_entry(key, fp, len); |
| 1130 | if (rc) |
| 1131 | goto bad; |
| 1132 | key[len] = '\0'; |
| 1133 | |
| 1134 | for (i = 0; i < nel; i++) { |
| 1135 | rc = perm_read(p, comdatum->permissions.table, fp); |
| 1136 | if (rc) |
| 1137 | goto bad; |
| 1138 | } |
| 1139 | |
| 1140 | rc = hashtab_insert(h, key, comdatum); |
| 1141 | if (rc) |
| 1142 | goto bad; |
| 1143 | return 0; |
| 1144 | bad: |
| 1145 | common_destroy(key, comdatum, NULL); |
| 1146 | return rc; |
| 1147 | } |
| 1148 | |
| 1149 | static int read_cons_helper(struct constraint_node **nodep, int ncons, |
| 1150 | int allowxtarget, void *fp) |
| 1151 | { |
| 1152 | struct constraint_node *c, *lc; |
| 1153 | struct constraint_expr *e, *le; |
| 1154 | __le32 buf[3]; |
| 1155 | u32 nexpr; |
| 1156 | int rc, i, j, depth; |
| 1157 | |
| 1158 | lc = NULL; |
| 1159 | for (i = 0; i < ncons; i++) { |
| 1160 | c = kzalloc(sizeof(*c), GFP_KERNEL); |
| 1161 | if (!c) |
| 1162 | return -ENOMEM; |
| 1163 | |
| 1164 | if (lc) |
| 1165 | lc->next = c; |
| 1166 | else |
| 1167 | *nodep = c; |
| 1168 | |
| 1169 | rc = next_entry(buf, fp, (sizeof(u32) * 2)); |
| 1170 | if (rc) |
| 1171 | return rc; |
| 1172 | c->permissions = le32_to_cpu(buf[0]); |
| 1173 | nexpr = le32_to_cpu(buf[1]); |
| 1174 | le = NULL; |
| 1175 | depth = -1; |
| 1176 | for (j = 0; j < nexpr; j++) { |
| 1177 | e = kzalloc(sizeof(*e), GFP_KERNEL); |
| 1178 | if (!e) |
| 1179 | return -ENOMEM; |
| 1180 | |
| 1181 | if (le) |
| 1182 | le->next = e; |
| 1183 | else |
| 1184 | c->expr = e; |
| 1185 | |
| 1186 | rc = next_entry(buf, fp, (sizeof(u32) * 3)); |
| 1187 | if (rc) |
| 1188 | return rc; |
| 1189 | e->expr_type = le32_to_cpu(buf[0]); |
| 1190 | e->attr = le32_to_cpu(buf[1]); |
| 1191 | e->op = le32_to_cpu(buf[2]); |
| 1192 | |
| 1193 | switch (e->expr_type) { |
| 1194 | case CEXPR_NOT: |
| 1195 | if (depth < 0) |
| 1196 | return -EINVAL; |
| 1197 | break; |
| 1198 | case CEXPR_AND: |
| 1199 | case CEXPR_OR: |
| 1200 | if (depth < 1) |
| 1201 | return -EINVAL; |
| 1202 | depth--; |
| 1203 | break; |
| 1204 | case CEXPR_ATTR: |
| 1205 | if (depth == (CEXPR_MAXDEPTH - 1)) |
| 1206 | return -EINVAL; |
| 1207 | depth++; |
| 1208 | break; |
| 1209 | case CEXPR_NAMES: |
| 1210 | if (!allowxtarget && (e->attr & CEXPR_XTARGET)) |
| 1211 | return -EINVAL; |
| 1212 | if (depth == (CEXPR_MAXDEPTH - 1)) |
| 1213 | return -EINVAL; |
| 1214 | depth++; |
| 1215 | rc = ebitmap_read(&e->names, fp); |
| 1216 | if (rc) |
| 1217 | return rc; |
| 1218 | break; |
| 1219 | default: |
| 1220 | return -EINVAL; |
| 1221 | } |
| 1222 | le = e; |
| 1223 | } |
| 1224 | if (depth != 0) |
| 1225 | return -EINVAL; |
| 1226 | lc = c; |
| 1227 | } |
| 1228 | |
| 1229 | return 0; |
| 1230 | } |
| 1231 | |
| 1232 | static int class_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1233 | { |
| 1234 | char *key = NULL; |
| 1235 | struct class_datum *cladatum; |
| 1236 | __le32 buf[6]; |
| 1237 | u32 len, len2, ncons, nel; |
| 1238 | int i, rc; |
| 1239 | |
| 1240 | rc = -ENOMEM; |
| 1241 | cladatum = kzalloc(sizeof(*cladatum), GFP_KERNEL); |
| 1242 | if (!cladatum) |
| 1243 | goto bad; |
| 1244 | |
| 1245 | rc = next_entry(buf, fp, sizeof(u32)*6); |
| 1246 | if (rc) |
| 1247 | goto bad; |
| 1248 | |
| 1249 | len = le32_to_cpu(buf[0]); |
| 1250 | len2 = le32_to_cpu(buf[1]); |
| 1251 | cladatum->value = le32_to_cpu(buf[2]); |
| 1252 | |
| 1253 | rc = symtab_init(&cladatum->permissions, PERM_SYMTAB_SIZE); |
| 1254 | if (rc) |
| 1255 | goto bad; |
| 1256 | cladatum->permissions.nprim = le32_to_cpu(buf[3]); |
| 1257 | nel = le32_to_cpu(buf[4]); |
| 1258 | |
| 1259 | ncons = le32_to_cpu(buf[5]); |
| 1260 | |
| 1261 | rc = -ENOMEM; |
| 1262 | key = kmalloc(len + 1, GFP_KERNEL); |
| 1263 | if (!key) |
| 1264 | goto bad; |
| 1265 | |
| 1266 | rc = next_entry(key, fp, len); |
| 1267 | if (rc) |
| 1268 | goto bad; |
| 1269 | key[len] = '\0'; |
| 1270 | |
| 1271 | if (len2) { |
| 1272 | rc = -ENOMEM; |
| 1273 | cladatum->comkey = kmalloc(len2 + 1, GFP_KERNEL); |
| 1274 | if (!cladatum->comkey) |
| 1275 | goto bad; |
| 1276 | rc = next_entry(cladatum->comkey, fp, len2); |
| 1277 | if (rc) |
| 1278 | goto bad; |
| 1279 | cladatum->comkey[len2] = '\0'; |
| 1280 | |
| 1281 | rc = -EINVAL; |
| 1282 | cladatum->comdatum = hashtab_search(p->p_commons.table, cladatum->comkey); |
| 1283 | if (!cladatum->comdatum) { |
| 1284 | printk(KERN_ERR "SELinux: unknown common %s\n", cladatum->comkey); |
| 1285 | goto bad; |
| 1286 | } |
| 1287 | } |
| 1288 | for (i = 0; i < nel; i++) { |
| 1289 | rc = perm_read(p, cladatum->permissions.table, fp); |
| 1290 | if (rc) |
| 1291 | goto bad; |
| 1292 | } |
| 1293 | |
| 1294 | rc = read_cons_helper(&cladatum->constraints, ncons, 0, fp); |
| 1295 | if (rc) |
| 1296 | goto bad; |
| 1297 | |
| 1298 | if (p->policyvers >= POLICYDB_VERSION_VALIDATETRANS) { |
| 1299 | /* grab the validatetrans rules */ |
| 1300 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1301 | if (rc) |
| 1302 | goto bad; |
| 1303 | ncons = le32_to_cpu(buf[0]); |
| 1304 | rc = read_cons_helper(&cladatum->validatetrans, ncons, 1, fp); |
| 1305 | if (rc) |
| 1306 | goto bad; |
| 1307 | } |
| 1308 | |
| 1309 | rc = hashtab_insert(h, key, cladatum); |
| 1310 | if (rc) |
| 1311 | goto bad; |
| 1312 | |
| 1313 | return 0; |
| 1314 | bad: |
| 1315 | cls_destroy(key, cladatum, NULL); |
| 1316 | return rc; |
| 1317 | } |
| 1318 | |
| 1319 | static int role_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1320 | { |
| 1321 | char *key = NULL; |
| 1322 | struct role_datum *role; |
| 1323 | int rc, to_read = 2; |
| 1324 | __le32 buf[3]; |
| 1325 | u32 len; |
| 1326 | |
| 1327 | rc = -ENOMEM; |
| 1328 | role = kzalloc(sizeof(*role), GFP_KERNEL); |
| 1329 | if (!role) |
| 1330 | goto bad; |
| 1331 | |
| 1332 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) |
| 1333 | to_read = 3; |
| 1334 | |
| 1335 | rc = next_entry(buf, fp, sizeof(buf[0]) * to_read); |
| 1336 | if (rc) |
| 1337 | goto bad; |
| 1338 | |
| 1339 | len = le32_to_cpu(buf[0]); |
| 1340 | role->value = le32_to_cpu(buf[1]); |
| 1341 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) |
| 1342 | role->bounds = le32_to_cpu(buf[2]); |
| 1343 | |
| 1344 | rc = -ENOMEM; |
| 1345 | key = kmalloc(len + 1, GFP_KERNEL); |
| 1346 | if (!key) |
| 1347 | goto bad; |
| 1348 | |
| 1349 | rc = next_entry(key, fp, len); |
| 1350 | if (rc) |
| 1351 | goto bad; |
| 1352 | key[len] = '\0'; |
| 1353 | |
| 1354 | rc = ebitmap_read(&role->dominates, fp); |
| 1355 | if (rc) |
| 1356 | goto bad; |
| 1357 | |
| 1358 | rc = ebitmap_read(&role->types, fp); |
| 1359 | if (rc) |
| 1360 | goto bad; |
| 1361 | |
| 1362 | if (strcmp(key, OBJECT_R) == 0) { |
| 1363 | rc = -EINVAL; |
| 1364 | if (role->value != OBJECT_R_VAL) { |
| 1365 | printk(KERN_ERR "SELinux: Role %s has wrong value %d\n", |
| 1366 | OBJECT_R, role->value); |
| 1367 | goto bad; |
| 1368 | } |
| 1369 | rc = 0; |
| 1370 | goto bad; |
| 1371 | } |
| 1372 | |
| 1373 | rc = hashtab_insert(h, key, role); |
| 1374 | if (rc) |
| 1375 | goto bad; |
| 1376 | return 0; |
| 1377 | bad: |
| 1378 | role_destroy(key, role, NULL); |
| 1379 | return rc; |
| 1380 | } |
| 1381 | |
| 1382 | static int type_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1383 | { |
| 1384 | char *key = NULL; |
| 1385 | struct type_datum *typdatum; |
| 1386 | int rc, to_read = 3; |
| 1387 | __le32 buf[4]; |
| 1388 | u32 len; |
| 1389 | |
| 1390 | rc = -ENOMEM; |
| 1391 | typdatum = kzalloc(sizeof(*typdatum), GFP_KERNEL); |
| 1392 | if (!typdatum) |
| 1393 | goto bad; |
| 1394 | |
| 1395 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) |
| 1396 | to_read = 4; |
| 1397 | |
| 1398 | rc = next_entry(buf, fp, sizeof(buf[0]) * to_read); |
| 1399 | if (rc) |
| 1400 | goto bad; |
| 1401 | |
| 1402 | len = le32_to_cpu(buf[0]); |
| 1403 | typdatum->value = le32_to_cpu(buf[1]); |
| 1404 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) { |
| 1405 | u32 prop = le32_to_cpu(buf[2]); |
| 1406 | |
| 1407 | if (prop & TYPEDATUM_PROPERTY_PRIMARY) |
| 1408 | typdatum->primary = 1; |
| 1409 | if (prop & TYPEDATUM_PROPERTY_ATTRIBUTE) |
| 1410 | typdatum->attribute = 1; |
| 1411 | |
| 1412 | typdatum->bounds = le32_to_cpu(buf[3]); |
| 1413 | } else { |
| 1414 | typdatum->primary = le32_to_cpu(buf[2]); |
| 1415 | } |
| 1416 | |
| 1417 | rc = -ENOMEM; |
| 1418 | key = kmalloc(len + 1, GFP_KERNEL); |
| 1419 | if (!key) |
| 1420 | goto bad; |
| 1421 | rc = next_entry(key, fp, len); |
| 1422 | if (rc) |
| 1423 | goto bad; |
| 1424 | key[len] = '\0'; |
| 1425 | |
| 1426 | rc = hashtab_insert(h, key, typdatum); |
| 1427 | if (rc) |
| 1428 | goto bad; |
| 1429 | return 0; |
| 1430 | bad: |
| 1431 | type_destroy(key, typdatum, NULL); |
| 1432 | return rc; |
| 1433 | } |
| 1434 | |
| 1435 | |
| 1436 | /* |
| 1437 | * Read a MLS level structure from a policydb binary |
| 1438 | * representation file. |
| 1439 | */ |
| 1440 | static int mls_read_level(struct mls_level *lp, void *fp) |
| 1441 | { |
| 1442 | __le32 buf[1]; |
| 1443 | int rc; |
| 1444 | |
| 1445 | memset(lp, 0, sizeof(*lp)); |
| 1446 | |
| 1447 | rc = next_entry(buf, fp, sizeof buf); |
| 1448 | if (rc) { |
| 1449 | printk(KERN_ERR "SELinux: mls: truncated level\n"); |
| 1450 | return rc; |
| 1451 | } |
| 1452 | lp->sens = le32_to_cpu(buf[0]); |
| 1453 | |
| 1454 | rc = ebitmap_read(&lp->cat, fp); |
| 1455 | if (rc) { |
| 1456 | printk(KERN_ERR "SELinux: mls: error reading level categories\n"); |
| 1457 | return rc; |
| 1458 | } |
| 1459 | return 0; |
| 1460 | } |
| 1461 | |
| 1462 | static int user_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1463 | { |
| 1464 | char *key = NULL; |
| 1465 | struct user_datum *usrdatum; |
| 1466 | int rc, to_read = 2; |
| 1467 | __le32 buf[3]; |
| 1468 | u32 len; |
| 1469 | |
| 1470 | rc = -ENOMEM; |
| 1471 | usrdatum = kzalloc(sizeof(*usrdatum), GFP_KERNEL); |
| 1472 | if (!usrdatum) |
| 1473 | goto bad; |
| 1474 | |
| 1475 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) |
| 1476 | to_read = 3; |
| 1477 | |
| 1478 | rc = next_entry(buf, fp, sizeof(buf[0]) * to_read); |
| 1479 | if (rc) |
| 1480 | goto bad; |
| 1481 | |
| 1482 | len = le32_to_cpu(buf[0]); |
| 1483 | usrdatum->value = le32_to_cpu(buf[1]); |
| 1484 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) |
| 1485 | usrdatum->bounds = le32_to_cpu(buf[2]); |
| 1486 | |
| 1487 | rc = -ENOMEM; |
| 1488 | key = kmalloc(len + 1, GFP_KERNEL); |
| 1489 | if (!key) |
| 1490 | goto bad; |
| 1491 | rc = next_entry(key, fp, len); |
| 1492 | if (rc) |
| 1493 | goto bad; |
| 1494 | key[len] = '\0'; |
| 1495 | |
| 1496 | rc = ebitmap_read(&usrdatum->roles, fp); |
| 1497 | if (rc) |
| 1498 | goto bad; |
| 1499 | |
| 1500 | if (p->policyvers >= POLICYDB_VERSION_MLS) { |
| 1501 | rc = mls_read_range_helper(&usrdatum->range, fp); |
| 1502 | if (rc) |
| 1503 | goto bad; |
| 1504 | rc = mls_read_level(&usrdatum->dfltlevel, fp); |
| 1505 | if (rc) |
| 1506 | goto bad; |
| 1507 | } |
| 1508 | |
| 1509 | rc = hashtab_insert(h, key, usrdatum); |
| 1510 | if (rc) |
| 1511 | goto bad; |
| 1512 | return 0; |
| 1513 | bad: |
| 1514 | user_destroy(key, usrdatum, NULL); |
| 1515 | return rc; |
| 1516 | } |
| 1517 | |
| 1518 | static int sens_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1519 | { |
| 1520 | char *key = NULL; |
| 1521 | struct level_datum *levdatum; |
| 1522 | int rc; |
| 1523 | __le32 buf[2]; |
| 1524 | u32 len; |
| 1525 | |
| 1526 | rc = -ENOMEM; |
| 1527 | levdatum = kzalloc(sizeof(*levdatum), GFP_ATOMIC); |
| 1528 | if (!levdatum) |
| 1529 | goto bad; |
| 1530 | |
| 1531 | rc = next_entry(buf, fp, sizeof buf); |
| 1532 | if (rc) |
| 1533 | goto bad; |
| 1534 | |
| 1535 | len = le32_to_cpu(buf[0]); |
| 1536 | levdatum->isalias = le32_to_cpu(buf[1]); |
| 1537 | |
| 1538 | rc = -ENOMEM; |
| 1539 | key = kmalloc(len + 1, GFP_ATOMIC); |
| 1540 | if (!key) |
| 1541 | goto bad; |
| 1542 | rc = next_entry(key, fp, len); |
| 1543 | if (rc) |
| 1544 | goto bad; |
| 1545 | key[len] = '\0'; |
| 1546 | |
| 1547 | rc = -ENOMEM; |
| 1548 | levdatum->level = kmalloc(sizeof(struct mls_level), GFP_ATOMIC); |
| 1549 | if (!levdatum->level) |
| 1550 | goto bad; |
| 1551 | |
| 1552 | rc = mls_read_level(levdatum->level, fp); |
| 1553 | if (rc) |
| 1554 | goto bad; |
| 1555 | |
| 1556 | rc = hashtab_insert(h, key, levdatum); |
| 1557 | if (rc) |
| 1558 | goto bad; |
| 1559 | return 0; |
| 1560 | bad: |
| 1561 | sens_destroy(key, levdatum, NULL); |
| 1562 | return rc; |
| 1563 | } |
| 1564 | |
| 1565 | static int cat_read(struct policydb *p, struct hashtab *h, void *fp) |
| 1566 | { |
| 1567 | char *key = NULL; |
| 1568 | struct cat_datum *catdatum; |
| 1569 | int rc; |
| 1570 | __le32 buf[3]; |
| 1571 | u32 len; |
| 1572 | |
| 1573 | rc = -ENOMEM; |
| 1574 | catdatum = kzalloc(sizeof(*catdatum), GFP_ATOMIC); |
| 1575 | if (!catdatum) |
| 1576 | goto bad; |
| 1577 | |
| 1578 | rc = next_entry(buf, fp, sizeof buf); |
| 1579 | if (rc) |
| 1580 | goto bad; |
| 1581 | |
| 1582 | len = le32_to_cpu(buf[0]); |
| 1583 | catdatum->value = le32_to_cpu(buf[1]); |
| 1584 | catdatum->isalias = le32_to_cpu(buf[2]); |
| 1585 | |
| 1586 | rc = -ENOMEM; |
| 1587 | key = kmalloc(len + 1, GFP_ATOMIC); |
| 1588 | if (!key) |
| 1589 | goto bad; |
| 1590 | rc = next_entry(key, fp, len); |
| 1591 | if (rc) |
| 1592 | goto bad; |
| 1593 | key[len] = '\0'; |
| 1594 | |
| 1595 | rc = hashtab_insert(h, key, catdatum); |
| 1596 | if (rc) |
| 1597 | goto bad; |
| 1598 | return 0; |
| 1599 | bad: |
| 1600 | cat_destroy(key, catdatum, NULL); |
| 1601 | return rc; |
| 1602 | } |
| 1603 | |
| 1604 | static int (*read_f[SYM_NUM]) (struct policydb *p, struct hashtab *h, void *fp) = |
| 1605 | { |
| 1606 | common_read, |
| 1607 | class_read, |
| 1608 | role_read, |
| 1609 | type_read, |
| 1610 | user_read, |
| 1611 | cond_read_bool, |
| 1612 | sens_read, |
| 1613 | cat_read, |
| 1614 | }; |
| 1615 | |
| 1616 | static int user_bounds_sanity_check(void *key, void *datum, void *datap) |
| 1617 | { |
| 1618 | struct user_datum *upper, *user; |
| 1619 | struct policydb *p = datap; |
| 1620 | int depth = 0; |
| 1621 | |
| 1622 | upper = user = datum; |
| 1623 | while (upper->bounds) { |
| 1624 | struct ebitmap_node *node; |
| 1625 | unsigned long bit; |
| 1626 | |
| 1627 | if (++depth == POLICYDB_BOUNDS_MAXDEPTH) { |
| 1628 | printk(KERN_ERR "SELinux: user %s: " |
| 1629 | "too deep or looped boundary", |
| 1630 | (char *) key); |
| 1631 | return -EINVAL; |
| 1632 | } |
| 1633 | |
| 1634 | upper = p->user_val_to_struct[upper->bounds - 1]; |
| 1635 | ebitmap_for_each_positive_bit(&user->roles, node, bit) { |
| 1636 | if (ebitmap_get_bit(&upper->roles, bit)) |
| 1637 | continue; |
| 1638 | |
| 1639 | printk(KERN_ERR |
| 1640 | "SELinux: boundary violated policy: " |
| 1641 | "user=%s role=%s bounds=%s\n", |
| 1642 | sym_name(p, SYM_USERS, user->value - 1), |
| 1643 | sym_name(p, SYM_ROLES, bit), |
| 1644 | sym_name(p, SYM_USERS, upper->value - 1)); |
| 1645 | |
| 1646 | return -EINVAL; |
| 1647 | } |
| 1648 | } |
| 1649 | |
| 1650 | return 0; |
| 1651 | } |
| 1652 | |
| 1653 | static int role_bounds_sanity_check(void *key, void *datum, void *datap) |
| 1654 | { |
| 1655 | struct role_datum *upper, *role; |
| 1656 | struct policydb *p = datap; |
| 1657 | int depth = 0; |
| 1658 | |
| 1659 | upper = role = datum; |
| 1660 | while (upper->bounds) { |
| 1661 | struct ebitmap_node *node; |
| 1662 | unsigned long bit; |
| 1663 | |
| 1664 | if (++depth == POLICYDB_BOUNDS_MAXDEPTH) { |
| 1665 | printk(KERN_ERR "SELinux: role %s: " |
| 1666 | "too deep or looped bounds\n", |
| 1667 | (char *) key); |
| 1668 | return -EINVAL; |
| 1669 | } |
| 1670 | |
| 1671 | upper = p->role_val_to_struct[upper->bounds - 1]; |
| 1672 | ebitmap_for_each_positive_bit(&role->types, node, bit) { |
| 1673 | if (ebitmap_get_bit(&upper->types, bit)) |
| 1674 | continue; |
| 1675 | |
| 1676 | printk(KERN_ERR |
| 1677 | "SELinux: boundary violated policy: " |
| 1678 | "role=%s type=%s bounds=%s\n", |
| 1679 | sym_name(p, SYM_ROLES, role->value - 1), |
| 1680 | sym_name(p, SYM_TYPES, bit), |
| 1681 | sym_name(p, SYM_ROLES, upper->value - 1)); |
| 1682 | |
| 1683 | return -EINVAL; |
| 1684 | } |
| 1685 | } |
| 1686 | |
| 1687 | return 0; |
| 1688 | } |
| 1689 | |
| 1690 | static int type_bounds_sanity_check(void *key, void *datum, void *datap) |
| 1691 | { |
| 1692 | struct type_datum *upper; |
| 1693 | struct policydb *p = datap; |
| 1694 | int depth = 0; |
| 1695 | |
| 1696 | upper = datum; |
| 1697 | while (upper->bounds) { |
| 1698 | if (++depth == POLICYDB_BOUNDS_MAXDEPTH) { |
| 1699 | printk(KERN_ERR "SELinux: type %s: " |
| 1700 | "too deep or looped boundary\n", |
| 1701 | (char *) key); |
| 1702 | return -EINVAL; |
| 1703 | } |
| 1704 | |
| 1705 | upper = flex_array_get_ptr(p->type_val_to_struct_array, |
| 1706 | upper->bounds - 1); |
| 1707 | BUG_ON(!upper); |
| 1708 | |
| 1709 | if (upper->attribute) { |
| 1710 | printk(KERN_ERR "SELinux: type %s: " |
| 1711 | "bounded by attribute %s", |
| 1712 | (char *) key, |
| 1713 | sym_name(p, SYM_TYPES, upper->value - 1)); |
| 1714 | return -EINVAL; |
| 1715 | } |
| 1716 | } |
| 1717 | |
| 1718 | return 0; |
| 1719 | } |
| 1720 | |
| 1721 | static int policydb_bounds_sanity_check(struct policydb *p) |
| 1722 | { |
| 1723 | int rc; |
| 1724 | |
| 1725 | if (p->policyvers < POLICYDB_VERSION_BOUNDARY) |
| 1726 | return 0; |
| 1727 | |
| 1728 | rc = hashtab_map(p->p_users.table, |
| 1729 | user_bounds_sanity_check, p); |
| 1730 | if (rc) |
| 1731 | return rc; |
| 1732 | |
| 1733 | rc = hashtab_map(p->p_roles.table, |
| 1734 | role_bounds_sanity_check, p); |
| 1735 | if (rc) |
| 1736 | return rc; |
| 1737 | |
| 1738 | rc = hashtab_map(p->p_types.table, |
| 1739 | type_bounds_sanity_check, p); |
| 1740 | if (rc) |
| 1741 | return rc; |
| 1742 | |
| 1743 | return 0; |
| 1744 | } |
| 1745 | |
| 1746 | u16 string_to_security_class(struct policydb *p, const char *name) |
| 1747 | { |
| 1748 | struct class_datum *cladatum; |
| 1749 | |
| 1750 | cladatum = hashtab_search(p->p_classes.table, name); |
| 1751 | if (!cladatum) |
| 1752 | return 0; |
| 1753 | |
| 1754 | return cladatum->value; |
| 1755 | } |
| 1756 | |
| 1757 | u32 string_to_av_perm(struct policydb *p, u16 tclass, const char *name) |
| 1758 | { |
| 1759 | struct class_datum *cladatum; |
| 1760 | struct perm_datum *perdatum = NULL; |
| 1761 | struct common_datum *comdatum; |
| 1762 | |
| 1763 | if (!tclass || tclass > p->p_classes.nprim) |
| 1764 | return 0; |
| 1765 | |
| 1766 | cladatum = p->class_val_to_struct[tclass-1]; |
| 1767 | comdatum = cladatum->comdatum; |
| 1768 | if (comdatum) |
| 1769 | perdatum = hashtab_search(comdatum->permissions.table, |
| 1770 | name); |
| 1771 | if (!perdatum) |
| 1772 | perdatum = hashtab_search(cladatum->permissions.table, |
| 1773 | name); |
| 1774 | if (!perdatum) |
| 1775 | return 0; |
| 1776 | |
| 1777 | return 1U << (perdatum->value-1); |
| 1778 | } |
| 1779 | |
| 1780 | static int range_read(struct policydb *p, void *fp) |
| 1781 | { |
| 1782 | struct range_trans *rt = NULL; |
| 1783 | struct mls_range *r = NULL; |
| 1784 | int i, rc; |
| 1785 | __le32 buf[2]; |
| 1786 | u32 nel; |
| 1787 | |
| 1788 | if (p->policyvers < POLICYDB_VERSION_MLS) |
| 1789 | return 0; |
| 1790 | |
| 1791 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1792 | if (rc) |
| 1793 | goto out; |
| 1794 | |
| 1795 | nel = le32_to_cpu(buf[0]); |
| 1796 | for (i = 0; i < nel; i++) { |
| 1797 | rc = -ENOMEM; |
| 1798 | rt = kzalloc(sizeof(*rt), GFP_KERNEL); |
| 1799 | if (!rt) |
| 1800 | goto out; |
| 1801 | |
| 1802 | rc = next_entry(buf, fp, (sizeof(u32) * 2)); |
| 1803 | if (rc) |
| 1804 | goto out; |
| 1805 | |
| 1806 | rt->source_type = le32_to_cpu(buf[0]); |
| 1807 | rt->target_type = le32_to_cpu(buf[1]); |
| 1808 | if (p->policyvers >= POLICYDB_VERSION_RANGETRANS) { |
| 1809 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1810 | if (rc) |
| 1811 | goto out; |
| 1812 | rt->target_class = le32_to_cpu(buf[0]); |
| 1813 | } else |
| 1814 | rt->target_class = p->process_class; |
| 1815 | |
| 1816 | rc = -EINVAL; |
| 1817 | if (!policydb_type_isvalid(p, rt->source_type) || |
| 1818 | !policydb_type_isvalid(p, rt->target_type) || |
| 1819 | !policydb_class_isvalid(p, rt->target_class)) |
| 1820 | goto out; |
| 1821 | |
| 1822 | rc = -ENOMEM; |
| 1823 | r = kzalloc(sizeof(*r), GFP_KERNEL); |
| 1824 | if (!r) |
| 1825 | goto out; |
| 1826 | |
| 1827 | rc = mls_read_range_helper(r, fp); |
| 1828 | if (rc) |
| 1829 | goto out; |
| 1830 | |
| 1831 | rc = -EINVAL; |
| 1832 | if (!mls_range_isvalid(p, r)) { |
| 1833 | printk(KERN_WARNING "SELinux: rangetrans: invalid range\n"); |
| 1834 | goto out; |
| 1835 | } |
| 1836 | |
| 1837 | rc = hashtab_insert(p->range_tr, rt, r); |
| 1838 | if (rc) |
| 1839 | goto out; |
| 1840 | |
| 1841 | rt = NULL; |
| 1842 | r = NULL; |
| 1843 | } |
| 1844 | hash_eval(p->range_tr, "rangetr"); |
| 1845 | rc = 0; |
| 1846 | out: |
| 1847 | kfree(rt); |
| 1848 | kfree(r); |
| 1849 | return rc; |
| 1850 | } |
| 1851 | |
| 1852 | static int filename_trans_read(struct policydb *p, void *fp) |
| 1853 | { |
| 1854 | struct filename_trans *ft; |
| 1855 | struct filename_trans_datum *otype; |
| 1856 | char *name; |
| 1857 | u32 nel, len; |
| 1858 | __le32 buf[4]; |
| 1859 | int rc, i; |
| 1860 | |
| 1861 | if (p->policyvers < POLICYDB_VERSION_FILENAME_TRANS) |
| 1862 | return 0; |
| 1863 | |
| 1864 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1865 | if (rc) |
| 1866 | return rc; |
| 1867 | nel = le32_to_cpu(buf[0]); |
| 1868 | |
| 1869 | for (i = 0; i < nel; i++) { |
| 1870 | ft = NULL; |
| 1871 | otype = NULL; |
| 1872 | name = NULL; |
| 1873 | |
| 1874 | rc = -ENOMEM; |
| 1875 | ft = kzalloc(sizeof(*ft), GFP_KERNEL); |
| 1876 | if (!ft) |
| 1877 | goto out; |
| 1878 | |
| 1879 | rc = -ENOMEM; |
| 1880 | otype = kmalloc(sizeof(*otype), GFP_KERNEL); |
| 1881 | if (!otype) |
| 1882 | goto out; |
| 1883 | |
| 1884 | /* length of the path component string */ |
| 1885 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1886 | if (rc) |
| 1887 | goto out; |
| 1888 | len = le32_to_cpu(buf[0]); |
| 1889 | |
| 1890 | rc = -ENOMEM; |
| 1891 | name = kmalloc(len + 1, GFP_KERNEL); |
| 1892 | if (!name) |
| 1893 | goto out; |
| 1894 | |
| 1895 | ft->name = name; |
| 1896 | |
| 1897 | /* path component string */ |
| 1898 | rc = next_entry(name, fp, len); |
| 1899 | if (rc) |
| 1900 | goto out; |
| 1901 | name[len] = 0; |
| 1902 | |
| 1903 | rc = next_entry(buf, fp, sizeof(u32) * 4); |
| 1904 | if (rc) |
| 1905 | goto out; |
| 1906 | |
| 1907 | ft->stype = le32_to_cpu(buf[0]); |
| 1908 | ft->ttype = le32_to_cpu(buf[1]); |
| 1909 | ft->tclass = le32_to_cpu(buf[2]); |
| 1910 | |
| 1911 | otype->otype = le32_to_cpu(buf[3]); |
| 1912 | |
| 1913 | rc = ebitmap_set_bit(&p->filename_trans_ttypes, ft->ttype, 1); |
| 1914 | if (rc) |
| 1915 | goto out; |
| 1916 | |
| 1917 | rc = hashtab_insert(p->filename_trans, ft, otype); |
| 1918 | if (rc) { |
| 1919 | /* |
| 1920 | * Do not return -EEXIST to the caller, or the system |
| 1921 | * will not boot. |
| 1922 | */ |
| 1923 | if (rc != -EEXIST) |
| 1924 | goto out; |
| 1925 | /* But free memory to avoid memory leak. */ |
| 1926 | kfree(ft); |
| 1927 | kfree(name); |
| 1928 | kfree(otype); |
| 1929 | } |
| 1930 | } |
| 1931 | hash_eval(p->filename_trans, "filenametr"); |
| 1932 | return 0; |
| 1933 | out: |
| 1934 | kfree(ft); |
| 1935 | kfree(name); |
| 1936 | kfree(otype); |
| 1937 | |
| 1938 | return rc; |
| 1939 | } |
| 1940 | |
| 1941 | static int genfs_read(struct policydb *p, void *fp) |
| 1942 | { |
| 1943 | int i, j, rc; |
| 1944 | u32 nel, nel2, len, len2; |
| 1945 | __le32 buf[1]; |
| 1946 | struct ocontext *l, *c; |
| 1947 | struct ocontext *newc = NULL; |
| 1948 | struct genfs *genfs_p, *genfs; |
| 1949 | struct genfs *newgenfs = NULL; |
| 1950 | |
| 1951 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1952 | if (rc) |
| 1953 | goto out; |
| 1954 | nel = le32_to_cpu(buf[0]); |
| 1955 | |
| 1956 | for (i = 0; i < nel; i++) { |
| 1957 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1958 | if (rc) |
| 1959 | goto out; |
| 1960 | len = le32_to_cpu(buf[0]); |
| 1961 | |
| 1962 | rc = -ENOMEM; |
| 1963 | newgenfs = kzalloc(sizeof(*newgenfs), GFP_KERNEL); |
| 1964 | if (!newgenfs) |
| 1965 | goto out; |
| 1966 | |
| 1967 | rc = -ENOMEM; |
| 1968 | newgenfs->fstype = kmalloc(len + 1, GFP_KERNEL); |
| 1969 | if (!newgenfs->fstype) |
| 1970 | goto out; |
| 1971 | |
| 1972 | rc = next_entry(newgenfs->fstype, fp, len); |
| 1973 | if (rc) |
| 1974 | goto out; |
| 1975 | |
| 1976 | newgenfs->fstype[len] = 0; |
| 1977 | |
| 1978 | for (genfs_p = NULL, genfs = p->genfs; genfs; |
| 1979 | genfs_p = genfs, genfs = genfs->next) { |
| 1980 | rc = -EINVAL; |
| 1981 | if (strcmp(newgenfs->fstype, genfs->fstype) == 0) { |
| 1982 | printk(KERN_ERR "SELinux: dup genfs fstype %s\n", |
| 1983 | newgenfs->fstype); |
| 1984 | goto out; |
| 1985 | } |
| 1986 | if (strcmp(newgenfs->fstype, genfs->fstype) < 0) |
| 1987 | break; |
| 1988 | } |
| 1989 | newgenfs->next = genfs; |
| 1990 | if (genfs_p) |
| 1991 | genfs_p->next = newgenfs; |
| 1992 | else |
| 1993 | p->genfs = newgenfs; |
| 1994 | genfs = newgenfs; |
| 1995 | newgenfs = NULL; |
| 1996 | |
| 1997 | rc = next_entry(buf, fp, sizeof(u32)); |
| 1998 | if (rc) |
| 1999 | goto out; |
| 2000 | |
| 2001 | nel2 = le32_to_cpu(buf[0]); |
| 2002 | for (j = 0; j < nel2; j++) { |
| 2003 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2004 | if (rc) |
| 2005 | goto out; |
| 2006 | len = le32_to_cpu(buf[0]); |
| 2007 | |
| 2008 | rc = -ENOMEM; |
| 2009 | newc = kzalloc(sizeof(*newc), GFP_KERNEL); |
| 2010 | if (!newc) |
| 2011 | goto out; |
| 2012 | |
| 2013 | rc = -ENOMEM; |
| 2014 | newc->u.name = kmalloc(len + 1, GFP_KERNEL); |
| 2015 | if (!newc->u.name) |
| 2016 | goto out; |
| 2017 | |
| 2018 | rc = next_entry(newc->u.name, fp, len); |
| 2019 | if (rc) |
| 2020 | goto out; |
| 2021 | newc->u.name[len] = 0; |
| 2022 | |
| 2023 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2024 | if (rc) |
| 2025 | goto out; |
| 2026 | |
| 2027 | newc->v.sclass = le32_to_cpu(buf[0]); |
| 2028 | rc = context_read_and_validate(&newc->context[0], p, fp); |
| 2029 | if (rc) |
| 2030 | goto out; |
| 2031 | |
| 2032 | for (l = NULL, c = genfs->head; c; |
| 2033 | l = c, c = c->next) { |
| 2034 | rc = -EINVAL; |
| 2035 | if (!strcmp(newc->u.name, c->u.name) && |
| 2036 | (!c->v.sclass || !newc->v.sclass || |
| 2037 | newc->v.sclass == c->v.sclass)) { |
| 2038 | printk(KERN_ERR "SELinux: dup genfs entry (%s,%s)\n", |
| 2039 | genfs->fstype, c->u.name); |
| 2040 | goto out; |
| 2041 | } |
| 2042 | len = strlen(newc->u.name); |
| 2043 | len2 = strlen(c->u.name); |
| 2044 | if (len > len2) |
| 2045 | break; |
| 2046 | } |
| 2047 | |
| 2048 | newc->next = c; |
| 2049 | if (l) |
| 2050 | l->next = newc; |
| 2051 | else |
| 2052 | genfs->head = newc; |
| 2053 | newc = NULL; |
| 2054 | } |
| 2055 | } |
| 2056 | rc = 0; |
| 2057 | out: |
| 2058 | if (newgenfs) |
| 2059 | kfree(newgenfs->fstype); |
| 2060 | kfree(newgenfs); |
| 2061 | ocontext_destroy(newc, OCON_FSUSE); |
| 2062 | |
| 2063 | return rc; |
| 2064 | } |
| 2065 | |
| 2066 | static int ocontext_read(struct policydb *p, struct policydb_compat_info *info, |
| 2067 | void *fp) |
| 2068 | { |
| 2069 | int i, j, rc; |
| 2070 | u32 nel, len; |
| 2071 | __le32 buf[3]; |
| 2072 | struct ocontext *l, *c; |
| 2073 | u32 nodebuf[8]; |
| 2074 | |
| 2075 | for (i = 0; i < info->ocon_num; i++) { |
| 2076 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2077 | if (rc) |
| 2078 | goto out; |
| 2079 | nel = le32_to_cpu(buf[0]); |
| 2080 | |
| 2081 | l = NULL; |
| 2082 | for (j = 0; j < nel; j++) { |
| 2083 | rc = -ENOMEM; |
| 2084 | c = kzalloc(sizeof(*c), GFP_KERNEL); |
| 2085 | if (!c) |
| 2086 | goto out; |
| 2087 | if (l) |
| 2088 | l->next = c; |
| 2089 | else |
| 2090 | p->ocontexts[i] = c; |
| 2091 | l = c; |
| 2092 | |
| 2093 | switch (i) { |
| 2094 | case OCON_ISID: |
| 2095 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2096 | if (rc) |
| 2097 | goto out; |
| 2098 | |
| 2099 | c->sid[0] = le32_to_cpu(buf[0]); |
| 2100 | rc = context_read_and_validate(&c->context[0], p, fp); |
| 2101 | if (rc) |
| 2102 | goto out; |
| 2103 | break; |
| 2104 | case OCON_FS: |
| 2105 | case OCON_NETIF: |
| 2106 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2107 | if (rc) |
| 2108 | goto out; |
| 2109 | len = le32_to_cpu(buf[0]); |
| 2110 | |
| 2111 | rc = -ENOMEM; |
| 2112 | c->u.name = kmalloc(len + 1, GFP_KERNEL); |
| 2113 | if (!c->u.name) |
| 2114 | goto out; |
| 2115 | |
| 2116 | rc = next_entry(c->u.name, fp, len); |
| 2117 | if (rc) |
| 2118 | goto out; |
| 2119 | |
| 2120 | c->u.name[len] = 0; |
| 2121 | rc = context_read_and_validate(&c->context[0], p, fp); |
| 2122 | if (rc) |
| 2123 | goto out; |
| 2124 | rc = context_read_and_validate(&c->context[1], p, fp); |
| 2125 | if (rc) |
| 2126 | goto out; |
| 2127 | break; |
| 2128 | case OCON_PORT: |
| 2129 | rc = next_entry(buf, fp, sizeof(u32)*3); |
| 2130 | if (rc) |
| 2131 | goto out; |
| 2132 | c->u.port.protocol = le32_to_cpu(buf[0]); |
| 2133 | c->u.port.low_port = le32_to_cpu(buf[1]); |
| 2134 | c->u.port.high_port = le32_to_cpu(buf[2]); |
| 2135 | rc = context_read_and_validate(&c->context[0], p, fp); |
| 2136 | if (rc) |
| 2137 | goto out; |
| 2138 | break; |
| 2139 | case OCON_NODE: |
| 2140 | rc = next_entry(nodebuf, fp, sizeof(u32) * 2); |
| 2141 | if (rc) |
| 2142 | goto out; |
| 2143 | c->u.node.addr = nodebuf[0]; /* network order */ |
| 2144 | c->u.node.mask = nodebuf[1]; /* network order */ |
| 2145 | rc = context_read_and_validate(&c->context[0], p, fp); |
| 2146 | if (rc) |
| 2147 | goto out; |
| 2148 | break; |
| 2149 | case OCON_FSUSE: |
| 2150 | rc = next_entry(buf, fp, sizeof(u32)*2); |
| 2151 | if (rc) |
| 2152 | goto out; |
| 2153 | |
| 2154 | rc = -EINVAL; |
| 2155 | c->v.behavior = le32_to_cpu(buf[0]); |
| 2156 | if (c->v.behavior > SECURITY_FS_USE_NONE) |
| 2157 | goto out; |
| 2158 | |
| 2159 | rc = -ENOMEM; |
| 2160 | len = le32_to_cpu(buf[1]); |
| 2161 | c->u.name = kmalloc(len + 1, GFP_KERNEL); |
| 2162 | if (!c->u.name) |
| 2163 | goto out; |
| 2164 | |
| 2165 | rc = next_entry(c->u.name, fp, len); |
| 2166 | if (rc) |
| 2167 | goto out; |
| 2168 | c->u.name[len] = 0; |
| 2169 | rc = context_read_and_validate(&c->context[0], p, fp); |
| 2170 | if (rc) |
| 2171 | goto out; |
| 2172 | break; |
| 2173 | case OCON_NODE6: { |
| 2174 | int k; |
| 2175 | |
| 2176 | rc = next_entry(nodebuf, fp, sizeof(u32) * 8); |
| 2177 | if (rc) |
| 2178 | goto out; |
| 2179 | for (k = 0; k < 4; k++) |
| 2180 | c->u.node6.addr[k] = nodebuf[k]; |
| 2181 | for (k = 0; k < 4; k++) |
| 2182 | c->u.node6.mask[k] = nodebuf[k+4]; |
| 2183 | rc = context_read_and_validate(&c->context[0], p, fp); |
| 2184 | if (rc) |
| 2185 | goto out; |
| 2186 | break; |
| 2187 | } |
| 2188 | } |
| 2189 | } |
| 2190 | } |
| 2191 | rc = 0; |
| 2192 | out: |
| 2193 | return rc; |
| 2194 | } |
| 2195 | |
| 2196 | /* |
| 2197 | * Read the configuration data from a policy database binary |
| 2198 | * representation file into a policy database structure. |
| 2199 | */ |
| 2200 | int policydb_read(struct policydb *p, void *fp) |
| 2201 | { |
| 2202 | struct role_allow *ra, *lra; |
| 2203 | struct role_trans *tr, *ltr; |
| 2204 | int i, j, rc; |
| 2205 | __le32 buf[4]; |
| 2206 | u32 len, nprim, nel; |
| 2207 | |
| 2208 | char *policydb_str; |
| 2209 | struct policydb_compat_info *info; |
| 2210 | |
| 2211 | rc = policydb_init(p); |
| 2212 | if (rc) |
| 2213 | return rc; |
| 2214 | |
| 2215 | /* Read the magic number and string length. */ |
| 2216 | rc = next_entry(buf, fp, sizeof(u32) * 2); |
| 2217 | if (rc) |
| 2218 | goto bad; |
| 2219 | |
| 2220 | rc = -EINVAL; |
| 2221 | if (le32_to_cpu(buf[0]) != POLICYDB_MAGIC) { |
| 2222 | printk(KERN_ERR "SELinux: policydb magic number 0x%x does " |
| 2223 | "not match expected magic number 0x%x\n", |
| 2224 | le32_to_cpu(buf[0]), POLICYDB_MAGIC); |
| 2225 | goto bad; |
| 2226 | } |
| 2227 | |
| 2228 | rc = -EINVAL; |
| 2229 | len = le32_to_cpu(buf[1]); |
| 2230 | if (len != strlen(POLICYDB_STRING)) { |
| 2231 | printk(KERN_ERR "SELinux: policydb string length %d does not " |
| 2232 | "match expected length %Zu\n", |
| 2233 | len, strlen(POLICYDB_STRING)); |
| 2234 | goto bad; |
| 2235 | } |
| 2236 | |
| 2237 | rc = -ENOMEM; |
| 2238 | policydb_str = kmalloc(len + 1, GFP_KERNEL); |
| 2239 | if (!policydb_str) { |
| 2240 | printk(KERN_ERR "SELinux: unable to allocate memory for policydb " |
| 2241 | "string of length %d\n", len); |
| 2242 | goto bad; |
| 2243 | } |
| 2244 | |
| 2245 | rc = next_entry(policydb_str, fp, len); |
| 2246 | if (rc) { |
| 2247 | printk(KERN_ERR "SELinux: truncated policydb string identifier\n"); |
| 2248 | kfree(policydb_str); |
| 2249 | goto bad; |
| 2250 | } |
| 2251 | |
| 2252 | rc = -EINVAL; |
| 2253 | policydb_str[len] = '\0'; |
| 2254 | if (strcmp(policydb_str, POLICYDB_STRING)) { |
| 2255 | printk(KERN_ERR "SELinux: policydb string %s does not match " |
| 2256 | "my string %s\n", policydb_str, POLICYDB_STRING); |
| 2257 | kfree(policydb_str); |
| 2258 | goto bad; |
| 2259 | } |
| 2260 | /* Done with policydb_str. */ |
| 2261 | kfree(policydb_str); |
| 2262 | policydb_str = NULL; |
| 2263 | |
| 2264 | /* Read the version and table sizes. */ |
| 2265 | rc = next_entry(buf, fp, sizeof(u32)*4); |
| 2266 | if (rc) |
| 2267 | goto bad; |
| 2268 | |
| 2269 | rc = -EINVAL; |
| 2270 | p->policyvers = le32_to_cpu(buf[0]); |
| 2271 | if (p->policyvers < POLICYDB_VERSION_MIN || |
| 2272 | p->policyvers > POLICYDB_VERSION_MAX) { |
| 2273 | printk(KERN_ERR "SELinux: policydb version %d does not match " |
| 2274 | "my version range %d-%d\n", |
| 2275 | le32_to_cpu(buf[0]), POLICYDB_VERSION_MIN, POLICYDB_VERSION_MAX); |
| 2276 | goto bad; |
| 2277 | } |
| 2278 | |
| 2279 | if ((le32_to_cpu(buf[1]) & POLICYDB_CONFIG_MLS)) { |
| 2280 | p->mls_enabled = 1; |
| 2281 | |
| 2282 | rc = -EINVAL; |
| 2283 | if (p->policyvers < POLICYDB_VERSION_MLS) { |
| 2284 | printk(KERN_ERR "SELinux: security policydb version %d " |
| 2285 | "(MLS) not backwards compatible\n", |
| 2286 | p->policyvers); |
| 2287 | goto bad; |
| 2288 | } |
| 2289 | } |
| 2290 | p->reject_unknown = !!(le32_to_cpu(buf[1]) & REJECT_UNKNOWN); |
| 2291 | p->allow_unknown = !!(le32_to_cpu(buf[1]) & ALLOW_UNKNOWN); |
| 2292 | |
| 2293 | if (p->policyvers >= POLICYDB_VERSION_POLCAP) { |
| 2294 | rc = ebitmap_read(&p->policycaps, fp); |
| 2295 | if (rc) |
| 2296 | goto bad; |
| 2297 | } |
| 2298 | |
| 2299 | if (p->policyvers >= POLICYDB_VERSION_PERMISSIVE) { |
| 2300 | rc = ebitmap_read(&p->permissive_map, fp); |
| 2301 | if (rc) |
| 2302 | goto bad; |
| 2303 | } |
| 2304 | |
| 2305 | rc = -EINVAL; |
| 2306 | info = policydb_lookup_compat(p->policyvers); |
| 2307 | if (!info) { |
| 2308 | printk(KERN_ERR "SELinux: unable to find policy compat info " |
| 2309 | "for version %d\n", p->policyvers); |
| 2310 | goto bad; |
| 2311 | } |
| 2312 | |
| 2313 | rc = -EINVAL; |
| 2314 | if (le32_to_cpu(buf[2]) != info->sym_num || |
| 2315 | le32_to_cpu(buf[3]) != info->ocon_num) { |
| 2316 | printk(KERN_ERR "SELinux: policydb table sizes (%d,%d) do " |
| 2317 | "not match mine (%d,%d)\n", le32_to_cpu(buf[2]), |
| 2318 | le32_to_cpu(buf[3]), |
| 2319 | info->sym_num, info->ocon_num); |
| 2320 | goto bad; |
| 2321 | } |
| 2322 | |
| 2323 | for (i = 0; i < info->sym_num; i++) { |
| 2324 | rc = next_entry(buf, fp, sizeof(u32)*2); |
| 2325 | if (rc) |
| 2326 | goto bad; |
| 2327 | nprim = le32_to_cpu(buf[0]); |
| 2328 | nel = le32_to_cpu(buf[1]); |
| 2329 | for (j = 0; j < nel; j++) { |
| 2330 | rc = read_f[i](p, p->symtab[i].table, fp); |
| 2331 | if (rc) |
| 2332 | goto bad; |
| 2333 | } |
| 2334 | |
| 2335 | p->symtab[i].nprim = nprim; |
| 2336 | } |
| 2337 | |
| 2338 | rc = -EINVAL; |
| 2339 | p->process_class = string_to_security_class(p, "process"); |
| 2340 | if (!p->process_class) |
| 2341 | goto bad; |
| 2342 | |
| 2343 | rc = avtab_read(&p->te_avtab, fp, p); |
| 2344 | if (rc) |
| 2345 | goto bad; |
| 2346 | |
| 2347 | if (p->policyvers >= POLICYDB_VERSION_BOOL) { |
| 2348 | rc = cond_read_list(p, fp); |
| 2349 | if (rc) |
| 2350 | goto bad; |
| 2351 | } |
| 2352 | |
| 2353 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2354 | if (rc) |
| 2355 | goto bad; |
| 2356 | nel = le32_to_cpu(buf[0]); |
| 2357 | ltr = NULL; |
| 2358 | for (i = 0; i < nel; i++) { |
| 2359 | rc = -ENOMEM; |
| 2360 | tr = kzalloc(sizeof(*tr), GFP_KERNEL); |
| 2361 | if (!tr) |
| 2362 | goto bad; |
| 2363 | if (ltr) |
| 2364 | ltr->next = tr; |
| 2365 | else |
| 2366 | p->role_tr = tr; |
| 2367 | rc = next_entry(buf, fp, sizeof(u32)*3); |
| 2368 | if (rc) |
| 2369 | goto bad; |
| 2370 | |
| 2371 | rc = -EINVAL; |
| 2372 | tr->role = le32_to_cpu(buf[0]); |
| 2373 | tr->type = le32_to_cpu(buf[1]); |
| 2374 | tr->new_role = le32_to_cpu(buf[2]); |
| 2375 | if (p->policyvers >= POLICYDB_VERSION_ROLETRANS) { |
| 2376 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2377 | if (rc) |
| 2378 | goto bad; |
| 2379 | tr->tclass = le32_to_cpu(buf[0]); |
| 2380 | } else |
| 2381 | tr->tclass = p->process_class; |
| 2382 | |
| 2383 | if (!policydb_role_isvalid(p, tr->role) || |
| 2384 | !policydb_type_isvalid(p, tr->type) || |
| 2385 | !policydb_class_isvalid(p, tr->tclass) || |
| 2386 | !policydb_role_isvalid(p, tr->new_role)) |
| 2387 | goto bad; |
| 2388 | ltr = tr; |
| 2389 | } |
| 2390 | |
| 2391 | rc = next_entry(buf, fp, sizeof(u32)); |
| 2392 | if (rc) |
| 2393 | goto bad; |
| 2394 | nel = le32_to_cpu(buf[0]); |
| 2395 | lra = NULL; |
| 2396 | for (i = 0; i < nel; i++) { |
| 2397 | rc = -ENOMEM; |
| 2398 | ra = kzalloc(sizeof(*ra), GFP_KERNEL); |
| 2399 | if (!ra) |
| 2400 | goto bad; |
| 2401 | if (lra) |
| 2402 | lra->next = ra; |
| 2403 | else |
| 2404 | p->role_allow = ra; |
| 2405 | rc = next_entry(buf, fp, sizeof(u32)*2); |
| 2406 | if (rc) |
| 2407 | goto bad; |
| 2408 | |
| 2409 | rc = -EINVAL; |
| 2410 | ra->role = le32_to_cpu(buf[0]); |
| 2411 | ra->new_role = le32_to_cpu(buf[1]); |
| 2412 | if (!policydb_role_isvalid(p, ra->role) || |
| 2413 | !policydb_role_isvalid(p, ra->new_role)) |
| 2414 | goto bad; |
| 2415 | lra = ra; |
| 2416 | } |
| 2417 | |
| 2418 | rc = filename_trans_read(p, fp); |
| 2419 | if (rc) |
| 2420 | goto bad; |
| 2421 | |
| 2422 | rc = policydb_index(p); |
| 2423 | if (rc) |
| 2424 | goto bad; |
| 2425 | |
| 2426 | rc = -EINVAL; |
| 2427 | p->process_trans_perms = string_to_av_perm(p, p->process_class, "transition"); |
| 2428 | p->process_trans_perms |= string_to_av_perm(p, p->process_class, "dyntransition"); |
| 2429 | if (!p->process_trans_perms) |
| 2430 | goto bad; |
| 2431 | |
| 2432 | rc = ocontext_read(p, info, fp); |
| 2433 | if (rc) |
| 2434 | goto bad; |
| 2435 | |
| 2436 | rc = genfs_read(p, fp); |
| 2437 | if (rc) |
| 2438 | goto bad; |
| 2439 | |
| 2440 | rc = range_read(p, fp); |
| 2441 | if (rc) |
| 2442 | goto bad; |
| 2443 | |
| 2444 | rc = -ENOMEM; |
| 2445 | p->type_attr_map_array = flex_array_alloc(sizeof(struct ebitmap), |
| 2446 | p->p_types.nprim, |
| 2447 | GFP_KERNEL | __GFP_ZERO); |
| 2448 | if (!p->type_attr_map_array) |
| 2449 | goto bad; |
| 2450 | |
| 2451 | /* preallocate so we don't have to worry about the put ever failing */ |
| 2452 | rc = flex_array_prealloc(p->type_attr_map_array, 0, p->p_types.nprim, |
| 2453 | GFP_KERNEL | __GFP_ZERO); |
| 2454 | if (rc) |
| 2455 | goto bad; |
| 2456 | |
| 2457 | for (i = 0; i < p->p_types.nprim; i++) { |
| 2458 | struct ebitmap *e = flex_array_get(p->type_attr_map_array, i); |
| 2459 | |
| 2460 | BUG_ON(!e); |
| 2461 | ebitmap_init(e); |
| 2462 | if (p->policyvers >= POLICYDB_VERSION_AVTAB) { |
| 2463 | rc = ebitmap_read(e, fp); |
| 2464 | if (rc) |
| 2465 | goto bad; |
| 2466 | } |
| 2467 | /* add the type itself as the degenerate case */ |
| 2468 | rc = ebitmap_set_bit(e, i, 1); |
| 2469 | if (rc) |
| 2470 | goto bad; |
| 2471 | } |
| 2472 | |
| 2473 | rc = policydb_bounds_sanity_check(p); |
| 2474 | if (rc) |
| 2475 | goto bad; |
| 2476 | |
| 2477 | rc = 0; |
| 2478 | out: |
| 2479 | return rc; |
| 2480 | bad: |
| 2481 | policydb_destroy(p); |
| 2482 | goto out; |
| 2483 | } |
| 2484 | |
| 2485 | /* |
| 2486 | * Write a MLS level structure to a policydb binary |
| 2487 | * representation file. |
| 2488 | */ |
| 2489 | static int mls_write_level(struct mls_level *l, void *fp) |
| 2490 | { |
| 2491 | __le32 buf[1]; |
| 2492 | int rc; |
| 2493 | |
| 2494 | buf[0] = cpu_to_le32(l->sens); |
| 2495 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 2496 | if (rc) |
| 2497 | return rc; |
| 2498 | |
| 2499 | rc = ebitmap_write(&l->cat, fp); |
| 2500 | if (rc) |
| 2501 | return rc; |
| 2502 | |
| 2503 | return 0; |
| 2504 | } |
| 2505 | |
| 2506 | /* |
| 2507 | * Write a MLS range structure to a policydb binary |
| 2508 | * representation file. |
| 2509 | */ |
| 2510 | static int mls_write_range_helper(struct mls_range *r, void *fp) |
| 2511 | { |
| 2512 | __le32 buf[3]; |
| 2513 | size_t items; |
| 2514 | int rc, eq; |
| 2515 | |
| 2516 | eq = mls_level_eq(&r->level[1], &r->level[0]); |
| 2517 | |
| 2518 | if (eq) |
| 2519 | items = 2; |
| 2520 | else |
| 2521 | items = 3; |
| 2522 | buf[0] = cpu_to_le32(items-1); |
| 2523 | buf[1] = cpu_to_le32(r->level[0].sens); |
| 2524 | if (!eq) |
| 2525 | buf[2] = cpu_to_le32(r->level[1].sens); |
| 2526 | |
| 2527 | BUG_ON(items > (sizeof(buf)/sizeof(buf[0]))); |
| 2528 | |
| 2529 | rc = put_entry(buf, sizeof(u32), items, fp); |
| 2530 | if (rc) |
| 2531 | return rc; |
| 2532 | |
| 2533 | rc = ebitmap_write(&r->level[0].cat, fp); |
| 2534 | if (rc) |
| 2535 | return rc; |
| 2536 | if (!eq) { |
| 2537 | rc = ebitmap_write(&r->level[1].cat, fp); |
| 2538 | if (rc) |
| 2539 | return rc; |
| 2540 | } |
| 2541 | |
| 2542 | return 0; |
| 2543 | } |
| 2544 | |
| 2545 | static int sens_write(void *vkey, void *datum, void *ptr) |
| 2546 | { |
| 2547 | char *key = vkey; |
| 2548 | struct level_datum *levdatum = datum; |
| 2549 | struct policy_data *pd = ptr; |
| 2550 | void *fp = pd->fp; |
| 2551 | __le32 buf[2]; |
| 2552 | size_t len; |
| 2553 | int rc; |
| 2554 | |
| 2555 | len = strlen(key); |
| 2556 | buf[0] = cpu_to_le32(len); |
| 2557 | buf[1] = cpu_to_le32(levdatum->isalias); |
| 2558 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 2559 | if (rc) |
| 2560 | return rc; |
| 2561 | |
| 2562 | rc = put_entry(key, 1, len, fp); |
| 2563 | if (rc) |
| 2564 | return rc; |
| 2565 | |
| 2566 | rc = mls_write_level(levdatum->level, fp); |
| 2567 | if (rc) |
| 2568 | return rc; |
| 2569 | |
| 2570 | return 0; |
| 2571 | } |
| 2572 | |
| 2573 | static int cat_write(void *vkey, void *datum, void *ptr) |
| 2574 | { |
| 2575 | char *key = vkey; |
| 2576 | struct cat_datum *catdatum = datum; |
| 2577 | struct policy_data *pd = ptr; |
| 2578 | void *fp = pd->fp; |
| 2579 | __le32 buf[3]; |
| 2580 | size_t len; |
| 2581 | int rc; |
| 2582 | |
| 2583 | len = strlen(key); |
| 2584 | buf[0] = cpu_to_le32(len); |
| 2585 | buf[1] = cpu_to_le32(catdatum->value); |
| 2586 | buf[2] = cpu_to_le32(catdatum->isalias); |
| 2587 | rc = put_entry(buf, sizeof(u32), 3, fp); |
| 2588 | if (rc) |
| 2589 | return rc; |
| 2590 | |
| 2591 | rc = put_entry(key, 1, len, fp); |
| 2592 | if (rc) |
| 2593 | return rc; |
| 2594 | |
| 2595 | return 0; |
| 2596 | } |
| 2597 | |
| 2598 | static int role_trans_write(struct policydb *p, void *fp) |
| 2599 | { |
| 2600 | struct role_trans *r = p->role_tr; |
| 2601 | struct role_trans *tr; |
| 2602 | u32 buf[3]; |
| 2603 | size_t nel; |
| 2604 | int rc; |
| 2605 | |
| 2606 | nel = 0; |
| 2607 | for (tr = r; tr; tr = tr->next) |
| 2608 | nel++; |
| 2609 | buf[0] = cpu_to_le32(nel); |
| 2610 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 2611 | if (rc) |
| 2612 | return rc; |
| 2613 | for (tr = r; tr; tr = tr->next) { |
| 2614 | buf[0] = cpu_to_le32(tr->role); |
| 2615 | buf[1] = cpu_to_le32(tr->type); |
| 2616 | buf[2] = cpu_to_le32(tr->new_role); |
| 2617 | rc = put_entry(buf, sizeof(u32), 3, fp); |
| 2618 | if (rc) |
| 2619 | return rc; |
| 2620 | if (p->policyvers >= POLICYDB_VERSION_ROLETRANS) { |
| 2621 | buf[0] = cpu_to_le32(tr->tclass); |
| 2622 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 2623 | if (rc) |
| 2624 | return rc; |
| 2625 | } |
| 2626 | } |
| 2627 | |
| 2628 | return 0; |
| 2629 | } |
| 2630 | |
| 2631 | static int role_allow_write(struct role_allow *r, void *fp) |
| 2632 | { |
| 2633 | struct role_allow *ra; |
| 2634 | u32 buf[2]; |
| 2635 | size_t nel; |
| 2636 | int rc; |
| 2637 | |
| 2638 | nel = 0; |
| 2639 | for (ra = r; ra; ra = ra->next) |
| 2640 | nel++; |
| 2641 | buf[0] = cpu_to_le32(nel); |
| 2642 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 2643 | if (rc) |
| 2644 | return rc; |
| 2645 | for (ra = r; ra; ra = ra->next) { |
| 2646 | buf[0] = cpu_to_le32(ra->role); |
| 2647 | buf[1] = cpu_to_le32(ra->new_role); |
| 2648 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 2649 | if (rc) |
| 2650 | return rc; |
| 2651 | } |
| 2652 | return 0; |
| 2653 | } |
| 2654 | |
| 2655 | /* |
| 2656 | * Write a security context structure |
| 2657 | * to a policydb binary representation file. |
| 2658 | */ |
| 2659 | static int context_write(struct policydb *p, struct context *c, |
| 2660 | void *fp) |
| 2661 | { |
| 2662 | int rc; |
| 2663 | __le32 buf[3]; |
| 2664 | |
| 2665 | buf[0] = cpu_to_le32(c->user); |
| 2666 | buf[1] = cpu_to_le32(c->role); |
| 2667 | buf[2] = cpu_to_le32(c->type); |
| 2668 | |
| 2669 | rc = put_entry(buf, sizeof(u32), 3, fp); |
| 2670 | if (rc) |
| 2671 | return rc; |
| 2672 | |
| 2673 | rc = mls_write_range_helper(&c->range, fp); |
| 2674 | if (rc) |
| 2675 | return rc; |
| 2676 | |
| 2677 | return 0; |
| 2678 | } |
| 2679 | |
| 2680 | /* |
| 2681 | * The following *_write functions are used to |
| 2682 | * write the symbol data to a policy database |
| 2683 | * binary representation file. |
| 2684 | */ |
| 2685 | |
| 2686 | static int perm_write(void *vkey, void *datum, void *fp) |
| 2687 | { |
| 2688 | char *key = vkey; |
| 2689 | struct perm_datum *perdatum = datum; |
| 2690 | __le32 buf[2]; |
| 2691 | size_t len; |
| 2692 | int rc; |
| 2693 | |
| 2694 | len = strlen(key); |
| 2695 | buf[0] = cpu_to_le32(len); |
| 2696 | buf[1] = cpu_to_le32(perdatum->value); |
| 2697 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 2698 | if (rc) |
| 2699 | return rc; |
| 2700 | |
| 2701 | rc = put_entry(key, 1, len, fp); |
| 2702 | if (rc) |
| 2703 | return rc; |
| 2704 | |
| 2705 | return 0; |
| 2706 | } |
| 2707 | |
| 2708 | static int common_write(void *vkey, void *datum, void *ptr) |
| 2709 | { |
| 2710 | char *key = vkey; |
| 2711 | struct common_datum *comdatum = datum; |
| 2712 | struct policy_data *pd = ptr; |
| 2713 | void *fp = pd->fp; |
| 2714 | __le32 buf[4]; |
| 2715 | size_t len; |
| 2716 | int rc; |
| 2717 | |
| 2718 | len = strlen(key); |
| 2719 | buf[0] = cpu_to_le32(len); |
| 2720 | buf[1] = cpu_to_le32(comdatum->value); |
| 2721 | buf[2] = cpu_to_le32(comdatum->permissions.nprim); |
| 2722 | buf[3] = cpu_to_le32(comdatum->permissions.table->nel); |
| 2723 | rc = put_entry(buf, sizeof(u32), 4, fp); |
| 2724 | if (rc) |
| 2725 | return rc; |
| 2726 | |
| 2727 | rc = put_entry(key, 1, len, fp); |
| 2728 | if (rc) |
| 2729 | return rc; |
| 2730 | |
| 2731 | rc = hashtab_map(comdatum->permissions.table, perm_write, fp); |
| 2732 | if (rc) |
| 2733 | return rc; |
| 2734 | |
| 2735 | return 0; |
| 2736 | } |
| 2737 | |
| 2738 | static int write_cons_helper(struct policydb *p, struct constraint_node *node, |
| 2739 | void *fp) |
| 2740 | { |
| 2741 | struct constraint_node *c; |
| 2742 | struct constraint_expr *e; |
| 2743 | __le32 buf[3]; |
| 2744 | u32 nel; |
| 2745 | int rc; |
| 2746 | |
| 2747 | for (c = node; c; c = c->next) { |
| 2748 | nel = 0; |
| 2749 | for (e = c->expr; e; e = e->next) |
| 2750 | nel++; |
| 2751 | buf[0] = cpu_to_le32(c->permissions); |
| 2752 | buf[1] = cpu_to_le32(nel); |
| 2753 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 2754 | if (rc) |
| 2755 | return rc; |
| 2756 | for (e = c->expr; e; e = e->next) { |
| 2757 | buf[0] = cpu_to_le32(e->expr_type); |
| 2758 | buf[1] = cpu_to_le32(e->attr); |
| 2759 | buf[2] = cpu_to_le32(e->op); |
| 2760 | rc = put_entry(buf, sizeof(u32), 3, fp); |
| 2761 | if (rc) |
| 2762 | return rc; |
| 2763 | |
| 2764 | switch (e->expr_type) { |
| 2765 | case CEXPR_NAMES: |
| 2766 | rc = ebitmap_write(&e->names, fp); |
| 2767 | if (rc) |
| 2768 | return rc; |
| 2769 | break; |
| 2770 | default: |
| 2771 | break; |
| 2772 | } |
| 2773 | } |
| 2774 | } |
| 2775 | |
| 2776 | return 0; |
| 2777 | } |
| 2778 | |
| 2779 | static int class_write(void *vkey, void *datum, void *ptr) |
| 2780 | { |
| 2781 | char *key = vkey; |
| 2782 | struct class_datum *cladatum = datum; |
| 2783 | struct policy_data *pd = ptr; |
| 2784 | void *fp = pd->fp; |
| 2785 | struct policydb *p = pd->p; |
| 2786 | struct constraint_node *c; |
| 2787 | __le32 buf[6]; |
| 2788 | u32 ncons; |
| 2789 | size_t len, len2; |
| 2790 | int rc; |
| 2791 | |
| 2792 | len = strlen(key); |
| 2793 | if (cladatum->comkey) |
| 2794 | len2 = strlen(cladatum->comkey); |
| 2795 | else |
| 2796 | len2 = 0; |
| 2797 | |
| 2798 | ncons = 0; |
| 2799 | for (c = cladatum->constraints; c; c = c->next) |
| 2800 | ncons++; |
| 2801 | |
| 2802 | buf[0] = cpu_to_le32(len); |
| 2803 | buf[1] = cpu_to_le32(len2); |
| 2804 | buf[2] = cpu_to_le32(cladatum->value); |
| 2805 | buf[3] = cpu_to_le32(cladatum->permissions.nprim); |
| 2806 | if (cladatum->permissions.table) |
| 2807 | buf[4] = cpu_to_le32(cladatum->permissions.table->nel); |
| 2808 | else |
| 2809 | buf[4] = 0; |
| 2810 | buf[5] = cpu_to_le32(ncons); |
| 2811 | rc = put_entry(buf, sizeof(u32), 6, fp); |
| 2812 | if (rc) |
| 2813 | return rc; |
| 2814 | |
| 2815 | rc = put_entry(key, 1, len, fp); |
| 2816 | if (rc) |
| 2817 | return rc; |
| 2818 | |
| 2819 | if (cladatum->comkey) { |
| 2820 | rc = put_entry(cladatum->comkey, 1, len2, fp); |
| 2821 | if (rc) |
| 2822 | return rc; |
| 2823 | } |
| 2824 | |
| 2825 | rc = hashtab_map(cladatum->permissions.table, perm_write, fp); |
| 2826 | if (rc) |
| 2827 | return rc; |
| 2828 | |
| 2829 | rc = write_cons_helper(p, cladatum->constraints, fp); |
| 2830 | if (rc) |
| 2831 | return rc; |
| 2832 | |
| 2833 | /* write out the validatetrans rule */ |
| 2834 | ncons = 0; |
| 2835 | for (c = cladatum->validatetrans; c; c = c->next) |
| 2836 | ncons++; |
| 2837 | |
| 2838 | buf[0] = cpu_to_le32(ncons); |
| 2839 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 2840 | if (rc) |
| 2841 | return rc; |
| 2842 | |
| 2843 | rc = write_cons_helper(p, cladatum->validatetrans, fp); |
| 2844 | if (rc) |
| 2845 | return rc; |
| 2846 | |
| 2847 | return 0; |
| 2848 | } |
| 2849 | |
| 2850 | static int role_write(void *vkey, void *datum, void *ptr) |
| 2851 | { |
| 2852 | char *key = vkey; |
| 2853 | struct role_datum *role = datum; |
| 2854 | struct policy_data *pd = ptr; |
| 2855 | void *fp = pd->fp; |
| 2856 | struct policydb *p = pd->p; |
| 2857 | __le32 buf[3]; |
| 2858 | size_t items, len; |
| 2859 | int rc; |
| 2860 | |
| 2861 | len = strlen(key); |
| 2862 | items = 0; |
| 2863 | buf[items++] = cpu_to_le32(len); |
| 2864 | buf[items++] = cpu_to_le32(role->value); |
| 2865 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) |
| 2866 | buf[items++] = cpu_to_le32(role->bounds); |
| 2867 | |
| 2868 | BUG_ON(items > (sizeof(buf)/sizeof(buf[0]))); |
| 2869 | |
| 2870 | rc = put_entry(buf, sizeof(u32), items, fp); |
| 2871 | if (rc) |
| 2872 | return rc; |
| 2873 | |
| 2874 | rc = put_entry(key, 1, len, fp); |
| 2875 | if (rc) |
| 2876 | return rc; |
| 2877 | |
| 2878 | rc = ebitmap_write(&role->dominates, fp); |
| 2879 | if (rc) |
| 2880 | return rc; |
| 2881 | |
| 2882 | rc = ebitmap_write(&role->types, fp); |
| 2883 | if (rc) |
| 2884 | return rc; |
| 2885 | |
| 2886 | return 0; |
| 2887 | } |
| 2888 | |
| 2889 | static int type_write(void *vkey, void *datum, void *ptr) |
| 2890 | { |
| 2891 | char *key = vkey; |
| 2892 | struct type_datum *typdatum = datum; |
| 2893 | struct policy_data *pd = ptr; |
| 2894 | struct policydb *p = pd->p; |
| 2895 | void *fp = pd->fp; |
| 2896 | __le32 buf[4]; |
| 2897 | int rc; |
| 2898 | size_t items, len; |
| 2899 | |
| 2900 | len = strlen(key); |
| 2901 | items = 0; |
| 2902 | buf[items++] = cpu_to_le32(len); |
| 2903 | buf[items++] = cpu_to_le32(typdatum->value); |
| 2904 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) { |
| 2905 | u32 properties = 0; |
| 2906 | |
| 2907 | if (typdatum->primary) |
| 2908 | properties |= TYPEDATUM_PROPERTY_PRIMARY; |
| 2909 | |
| 2910 | if (typdatum->attribute) |
| 2911 | properties |= TYPEDATUM_PROPERTY_ATTRIBUTE; |
| 2912 | |
| 2913 | buf[items++] = cpu_to_le32(properties); |
| 2914 | buf[items++] = cpu_to_le32(typdatum->bounds); |
| 2915 | } else { |
| 2916 | buf[items++] = cpu_to_le32(typdatum->primary); |
| 2917 | } |
| 2918 | BUG_ON(items > (sizeof(buf) / sizeof(buf[0]))); |
| 2919 | rc = put_entry(buf, sizeof(u32), items, fp); |
| 2920 | if (rc) |
| 2921 | return rc; |
| 2922 | |
| 2923 | rc = put_entry(key, 1, len, fp); |
| 2924 | if (rc) |
| 2925 | return rc; |
| 2926 | |
| 2927 | return 0; |
| 2928 | } |
| 2929 | |
| 2930 | static int user_write(void *vkey, void *datum, void *ptr) |
| 2931 | { |
| 2932 | char *key = vkey; |
| 2933 | struct user_datum *usrdatum = datum; |
| 2934 | struct policy_data *pd = ptr; |
| 2935 | struct policydb *p = pd->p; |
| 2936 | void *fp = pd->fp; |
| 2937 | __le32 buf[3]; |
| 2938 | size_t items, len; |
| 2939 | int rc; |
| 2940 | |
| 2941 | len = strlen(key); |
| 2942 | items = 0; |
| 2943 | buf[items++] = cpu_to_le32(len); |
| 2944 | buf[items++] = cpu_to_le32(usrdatum->value); |
| 2945 | if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) |
| 2946 | buf[items++] = cpu_to_le32(usrdatum->bounds); |
| 2947 | BUG_ON(items > (sizeof(buf) / sizeof(buf[0]))); |
| 2948 | rc = put_entry(buf, sizeof(u32), items, fp); |
| 2949 | if (rc) |
| 2950 | return rc; |
| 2951 | |
| 2952 | rc = put_entry(key, 1, len, fp); |
| 2953 | if (rc) |
| 2954 | return rc; |
| 2955 | |
| 2956 | rc = ebitmap_write(&usrdatum->roles, fp); |
| 2957 | if (rc) |
| 2958 | return rc; |
| 2959 | |
| 2960 | rc = mls_write_range_helper(&usrdatum->range, fp); |
| 2961 | if (rc) |
| 2962 | return rc; |
| 2963 | |
| 2964 | rc = mls_write_level(&usrdatum->dfltlevel, fp); |
| 2965 | if (rc) |
| 2966 | return rc; |
| 2967 | |
| 2968 | return 0; |
| 2969 | } |
| 2970 | |
| 2971 | static int (*write_f[SYM_NUM]) (void *key, void *datum, |
| 2972 | void *datap) = |
| 2973 | { |
| 2974 | common_write, |
| 2975 | class_write, |
| 2976 | role_write, |
| 2977 | type_write, |
| 2978 | user_write, |
| 2979 | cond_write_bool, |
| 2980 | sens_write, |
| 2981 | cat_write, |
| 2982 | }; |
| 2983 | |
| 2984 | static int ocontext_write(struct policydb *p, struct policydb_compat_info *info, |
| 2985 | void *fp) |
| 2986 | { |
| 2987 | unsigned int i, j, rc; |
| 2988 | size_t nel, len; |
| 2989 | __le32 buf[3]; |
| 2990 | u32 nodebuf[8]; |
| 2991 | struct ocontext *c; |
| 2992 | for (i = 0; i < info->ocon_num; i++) { |
| 2993 | nel = 0; |
| 2994 | for (c = p->ocontexts[i]; c; c = c->next) |
| 2995 | nel++; |
| 2996 | buf[0] = cpu_to_le32(nel); |
| 2997 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 2998 | if (rc) |
| 2999 | return rc; |
| 3000 | for (c = p->ocontexts[i]; c; c = c->next) { |
| 3001 | switch (i) { |
| 3002 | case OCON_ISID: |
| 3003 | buf[0] = cpu_to_le32(c->sid[0]); |
| 3004 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3005 | if (rc) |
| 3006 | return rc; |
| 3007 | rc = context_write(p, &c->context[0], fp); |
| 3008 | if (rc) |
| 3009 | return rc; |
| 3010 | break; |
| 3011 | case OCON_FS: |
| 3012 | case OCON_NETIF: |
| 3013 | len = strlen(c->u.name); |
| 3014 | buf[0] = cpu_to_le32(len); |
| 3015 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3016 | if (rc) |
| 3017 | return rc; |
| 3018 | rc = put_entry(c->u.name, 1, len, fp); |
| 3019 | if (rc) |
| 3020 | return rc; |
| 3021 | rc = context_write(p, &c->context[0], fp); |
| 3022 | if (rc) |
| 3023 | return rc; |
| 3024 | rc = context_write(p, &c->context[1], fp); |
| 3025 | if (rc) |
| 3026 | return rc; |
| 3027 | break; |
| 3028 | case OCON_PORT: |
| 3029 | buf[0] = cpu_to_le32(c->u.port.protocol); |
| 3030 | buf[1] = cpu_to_le32(c->u.port.low_port); |
| 3031 | buf[2] = cpu_to_le32(c->u.port.high_port); |
| 3032 | rc = put_entry(buf, sizeof(u32), 3, fp); |
| 3033 | if (rc) |
| 3034 | return rc; |
| 3035 | rc = context_write(p, &c->context[0], fp); |
| 3036 | if (rc) |
| 3037 | return rc; |
| 3038 | break; |
| 3039 | case OCON_NODE: |
| 3040 | nodebuf[0] = c->u.node.addr; /* network order */ |
| 3041 | nodebuf[1] = c->u.node.mask; /* network order */ |
| 3042 | rc = put_entry(nodebuf, sizeof(u32), 2, fp); |
| 3043 | if (rc) |
| 3044 | return rc; |
| 3045 | rc = context_write(p, &c->context[0], fp); |
| 3046 | if (rc) |
| 3047 | return rc; |
| 3048 | break; |
| 3049 | case OCON_FSUSE: |
| 3050 | buf[0] = cpu_to_le32(c->v.behavior); |
| 3051 | len = strlen(c->u.name); |
| 3052 | buf[1] = cpu_to_le32(len); |
| 3053 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 3054 | if (rc) |
| 3055 | return rc; |
| 3056 | rc = put_entry(c->u.name, 1, len, fp); |
| 3057 | if (rc) |
| 3058 | return rc; |
| 3059 | rc = context_write(p, &c->context[0], fp); |
| 3060 | if (rc) |
| 3061 | return rc; |
| 3062 | break; |
| 3063 | case OCON_NODE6: |
| 3064 | for (j = 0; j < 4; j++) |
| 3065 | nodebuf[j] = c->u.node6.addr[j]; /* network order */ |
| 3066 | for (j = 0; j < 4; j++) |
| 3067 | nodebuf[j + 4] = c->u.node6.mask[j]; /* network order */ |
| 3068 | rc = put_entry(nodebuf, sizeof(u32), 8, fp); |
| 3069 | if (rc) |
| 3070 | return rc; |
| 3071 | rc = context_write(p, &c->context[0], fp); |
| 3072 | if (rc) |
| 3073 | return rc; |
| 3074 | break; |
| 3075 | } |
| 3076 | } |
| 3077 | } |
| 3078 | return 0; |
| 3079 | } |
| 3080 | |
| 3081 | static int genfs_write(struct policydb *p, void *fp) |
| 3082 | { |
| 3083 | struct genfs *genfs; |
| 3084 | struct ocontext *c; |
| 3085 | size_t len; |
| 3086 | __le32 buf[1]; |
| 3087 | int rc; |
| 3088 | |
| 3089 | len = 0; |
| 3090 | for (genfs = p->genfs; genfs; genfs = genfs->next) |
| 3091 | len++; |
| 3092 | buf[0] = cpu_to_le32(len); |
| 3093 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3094 | if (rc) |
| 3095 | return rc; |
| 3096 | for (genfs = p->genfs; genfs; genfs = genfs->next) { |
| 3097 | len = strlen(genfs->fstype); |
| 3098 | buf[0] = cpu_to_le32(len); |
| 3099 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3100 | if (rc) |
| 3101 | return rc; |
| 3102 | rc = put_entry(genfs->fstype, 1, len, fp); |
| 3103 | if (rc) |
| 3104 | return rc; |
| 3105 | len = 0; |
| 3106 | for (c = genfs->head; c; c = c->next) |
| 3107 | len++; |
| 3108 | buf[0] = cpu_to_le32(len); |
| 3109 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3110 | if (rc) |
| 3111 | return rc; |
| 3112 | for (c = genfs->head; c; c = c->next) { |
| 3113 | len = strlen(c->u.name); |
| 3114 | buf[0] = cpu_to_le32(len); |
| 3115 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3116 | if (rc) |
| 3117 | return rc; |
| 3118 | rc = put_entry(c->u.name, 1, len, fp); |
| 3119 | if (rc) |
| 3120 | return rc; |
| 3121 | buf[0] = cpu_to_le32(c->v.sclass); |
| 3122 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3123 | if (rc) |
| 3124 | return rc; |
| 3125 | rc = context_write(p, &c->context[0], fp); |
| 3126 | if (rc) |
| 3127 | return rc; |
| 3128 | } |
| 3129 | } |
| 3130 | return 0; |
| 3131 | } |
| 3132 | |
| 3133 | static int hashtab_cnt(void *key, void *data, void *ptr) |
| 3134 | { |
| 3135 | int *cnt = ptr; |
| 3136 | *cnt = *cnt + 1; |
| 3137 | |
| 3138 | return 0; |
| 3139 | } |
| 3140 | |
| 3141 | static int range_write_helper(void *key, void *data, void *ptr) |
| 3142 | { |
| 3143 | __le32 buf[2]; |
| 3144 | struct range_trans *rt = key; |
| 3145 | struct mls_range *r = data; |
| 3146 | struct policy_data *pd = ptr; |
| 3147 | void *fp = pd->fp; |
| 3148 | struct policydb *p = pd->p; |
| 3149 | int rc; |
| 3150 | |
| 3151 | buf[0] = cpu_to_le32(rt->source_type); |
| 3152 | buf[1] = cpu_to_le32(rt->target_type); |
| 3153 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 3154 | if (rc) |
| 3155 | return rc; |
| 3156 | if (p->policyvers >= POLICYDB_VERSION_RANGETRANS) { |
| 3157 | buf[0] = cpu_to_le32(rt->target_class); |
| 3158 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3159 | if (rc) |
| 3160 | return rc; |
| 3161 | } |
| 3162 | rc = mls_write_range_helper(r, fp); |
| 3163 | if (rc) |
| 3164 | return rc; |
| 3165 | |
| 3166 | return 0; |
| 3167 | } |
| 3168 | |
| 3169 | static int range_write(struct policydb *p, void *fp) |
| 3170 | { |
| 3171 | size_t nel; |
| 3172 | __le32 buf[1]; |
| 3173 | int rc; |
| 3174 | struct policy_data pd; |
| 3175 | |
| 3176 | pd.p = p; |
| 3177 | pd.fp = fp; |
| 3178 | |
| 3179 | /* count the number of entries in the hashtab */ |
| 3180 | nel = 0; |
| 3181 | rc = hashtab_map(p->range_tr, hashtab_cnt, &nel); |
| 3182 | if (rc) |
| 3183 | return rc; |
| 3184 | |
| 3185 | buf[0] = cpu_to_le32(nel); |
| 3186 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3187 | if (rc) |
| 3188 | return rc; |
| 3189 | |
| 3190 | /* actually write all of the entries */ |
| 3191 | rc = hashtab_map(p->range_tr, range_write_helper, &pd); |
| 3192 | if (rc) |
| 3193 | return rc; |
| 3194 | |
| 3195 | return 0; |
| 3196 | } |
| 3197 | |
| 3198 | static int filename_write_helper(void *key, void *data, void *ptr) |
| 3199 | { |
| 3200 | __le32 buf[4]; |
| 3201 | struct filename_trans *ft = key; |
| 3202 | struct filename_trans_datum *otype = data; |
| 3203 | void *fp = ptr; |
| 3204 | int rc; |
| 3205 | u32 len; |
| 3206 | |
| 3207 | len = strlen(ft->name); |
| 3208 | buf[0] = cpu_to_le32(len); |
| 3209 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3210 | if (rc) |
| 3211 | return rc; |
| 3212 | |
| 3213 | rc = put_entry(ft->name, sizeof(char), len, fp); |
| 3214 | if (rc) |
| 3215 | return rc; |
| 3216 | |
| 3217 | buf[0] = cpu_to_le32(ft->stype); |
| 3218 | buf[1] = cpu_to_le32(ft->ttype); |
| 3219 | buf[2] = cpu_to_le32(ft->tclass); |
| 3220 | buf[3] = cpu_to_le32(otype->otype); |
| 3221 | |
| 3222 | rc = put_entry(buf, sizeof(u32), 4, fp); |
| 3223 | if (rc) |
| 3224 | return rc; |
| 3225 | |
| 3226 | return 0; |
| 3227 | } |
| 3228 | |
| 3229 | static int filename_trans_write(struct policydb *p, void *fp) |
| 3230 | { |
| 3231 | u32 nel; |
| 3232 | __le32 buf[1]; |
| 3233 | int rc; |
| 3234 | |
| 3235 | if (p->policyvers < POLICYDB_VERSION_FILENAME_TRANS) |
| 3236 | return 0; |
| 3237 | |
| 3238 | nel = 0; |
| 3239 | rc = hashtab_map(p->filename_trans, hashtab_cnt, &nel); |
| 3240 | if (rc) |
| 3241 | return rc; |
| 3242 | |
| 3243 | buf[0] = cpu_to_le32(nel); |
| 3244 | rc = put_entry(buf, sizeof(u32), 1, fp); |
| 3245 | if (rc) |
| 3246 | return rc; |
| 3247 | |
| 3248 | rc = hashtab_map(p->filename_trans, filename_write_helper, fp); |
| 3249 | if (rc) |
| 3250 | return rc; |
| 3251 | |
| 3252 | return 0; |
| 3253 | } |
| 3254 | |
| 3255 | /* |
| 3256 | * Write the configuration data in a policy database |
| 3257 | * structure to a policy database binary representation |
| 3258 | * file. |
| 3259 | */ |
| 3260 | int policydb_write(struct policydb *p, void *fp) |
| 3261 | { |
| 3262 | unsigned int i, num_syms; |
| 3263 | int rc; |
| 3264 | __le32 buf[4]; |
| 3265 | u32 config; |
| 3266 | size_t len; |
| 3267 | struct policydb_compat_info *info; |
| 3268 | |
| 3269 | /* |
| 3270 | * refuse to write policy older than compressed avtab |
| 3271 | * to simplify the writer. There are other tests dropped |
| 3272 | * since we assume this throughout the writer code. Be |
| 3273 | * careful if you ever try to remove this restriction |
| 3274 | */ |
| 3275 | if (p->policyvers < POLICYDB_VERSION_AVTAB) { |
| 3276 | printk(KERN_ERR "SELinux: refusing to write policy version %d." |
| 3277 | " Because it is less than version %d\n", p->policyvers, |
| 3278 | POLICYDB_VERSION_AVTAB); |
| 3279 | return -EINVAL; |
| 3280 | } |
| 3281 | |
| 3282 | config = 0; |
| 3283 | if (p->mls_enabled) |
| 3284 | config |= POLICYDB_CONFIG_MLS; |
| 3285 | |
| 3286 | if (p->reject_unknown) |
| 3287 | config |= REJECT_UNKNOWN; |
| 3288 | if (p->allow_unknown) |
| 3289 | config |= ALLOW_UNKNOWN; |
| 3290 | |
| 3291 | /* Write the magic number and string identifiers. */ |
| 3292 | buf[0] = cpu_to_le32(POLICYDB_MAGIC); |
| 3293 | len = strlen(POLICYDB_STRING); |
| 3294 | buf[1] = cpu_to_le32(len); |
| 3295 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 3296 | if (rc) |
| 3297 | return rc; |
| 3298 | rc = put_entry(POLICYDB_STRING, 1, len, fp); |
| 3299 | if (rc) |
| 3300 | return rc; |
| 3301 | |
| 3302 | /* Write the version, config, and table sizes. */ |
| 3303 | info = policydb_lookup_compat(p->policyvers); |
| 3304 | if (!info) { |
| 3305 | printk(KERN_ERR "SELinux: compatibility lookup failed for policy " |
| 3306 | "version %d", p->policyvers); |
| 3307 | return -EINVAL; |
| 3308 | } |
| 3309 | |
| 3310 | buf[0] = cpu_to_le32(p->policyvers); |
| 3311 | buf[1] = cpu_to_le32(config); |
| 3312 | buf[2] = cpu_to_le32(info->sym_num); |
| 3313 | buf[3] = cpu_to_le32(info->ocon_num); |
| 3314 | |
| 3315 | rc = put_entry(buf, sizeof(u32), 4, fp); |
| 3316 | if (rc) |
| 3317 | return rc; |
| 3318 | |
| 3319 | if (p->policyvers >= POLICYDB_VERSION_POLCAP) { |
| 3320 | rc = ebitmap_write(&p->policycaps, fp); |
| 3321 | if (rc) |
| 3322 | return rc; |
| 3323 | } |
| 3324 | |
| 3325 | if (p->policyvers >= POLICYDB_VERSION_PERMISSIVE) { |
| 3326 | rc = ebitmap_write(&p->permissive_map, fp); |
| 3327 | if (rc) |
| 3328 | return rc; |
| 3329 | } |
| 3330 | |
| 3331 | num_syms = info->sym_num; |
| 3332 | for (i = 0; i < num_syms; i++) { |
| 3333 | struct policy_data pd; |
| 3334 | |
| 3335 | pd.fp = fp; |
| 3336 | pd.p = p; |
| 3337 | |
| 3338 | buf[0] = cpu_to_le32(p->symtab[i].nprim); |
| 3339 | buf[1] = cpu_to_le32(p->symtab[i].table->nel); |
| 3340 | |
| 3341 | rc = put_entry(buf, sizeof(u32), 2, fp); |
| 3342 | if (rc) |
| 3343 | return rc; |
| 3344 | rc = hashtab_map(p->symtab[i].table, write_f[i], &pd); |
| 3345 | if (rc) |
| 3346 | return rc; |
| 3347 | } |
| 3348 | |
| 3349 | rc = avtab_write(p, &p->te_avtab, fp); |
| 3350 | if (rc) |
| 3351 | return rc; |
| 3352 | |
| 3353 | rc = cond_write_list(p, p->cond_list, fp); |
| 3354 | if (rc) |
| 3355 | return rc; |
| 3356 | |
| 3357 | rc = role_trans_write(p, fp); |
| 3358 | if (rc) |
| 3359 | return rc; |
| 3360 | |
| 3361 | rc = role_allow_write(p->role_allow, fp); |
| 3362 | if (rc) |
| 3363 | return rc; |
| 3364 | |
| 3365 | rc = filename_trans_write(p, fp); |
| 3366 | if (rc) |
| 3367 | return rc; |
| 3368 | |
| 3369 | rc = ocontext_write(p, info, fp); |
| 3370 | if (rc) |
| 3371 | return rc; |
| 3372 | |
| 3373 | rc = genfs_write(p, fp); |
| 3374 | if (rc) |
| 3375 | return rc; |
| 3376 | |
| 3377 | rc = range_write(p, fp); |
| 3378 | if (rc) |
| 3379 | return rc; |
| 3380 | |
| 3381 | for (i = 0; i < p->p_types.nprim; i++) { |
| 3382 | struct ebitmap *e = flex_array_get(p->type_attr_map_array, i); |
| 3383 | |
| 3384 | BUG_ON(!e); |
| 3385 | rc = ebitmap_write(e, fp); |
| 3386 | if (rc) |
| 3387 | return rc; |
| 3388 | } |
| 3389 | |
| 3390 | return 0; |
| 3391 | } |