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