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