1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3 * AppArmor security module
4 *
5 * This file contains AppArmor functions for unpacking policy loaded from
6 * userspace.
7 *
8 * Copyright (C) 1998-2008 Novell/SUSE
9 * Copyright 2009-2010 Canonical Ltd.
10 *
11 * AppArmor uses a serialized binary format for loading policy. To find
12 * policy format documentation see Documentation/admin-guide/LSM/apparmor.rst
13 * All policy is validated before it is used.
14 */
15
16 #include <asm/unaligned.h>
17 #include <kunit/visibility.h>
18 #include <linux/ctype.h>
19 #include <linux/errno.h>
20 #include <linux/zstd.h>
21
22 #include "include/apparmor.h"
23 #include "include/audit.h"
24 #include "include/cred.h"
25 #include "include/crypto.h"
26 #include "include/file.h"
27 #include "include/match.h"
28 #include "include/path.h"
29 #include "include/policy.h"
30 #include "include/policy_unpack.h"
31 #include "include/policy_compat.h"
32
33 /* audit callback for unpack fields */
34 static void audit_cb(struct audit_buffer *ab, void *va)
35 {
36 struct common_audit_data *sa = va;
37 struct apparmor_audit_data *ad = aad(sa);
38
39 if (ad->iface.ns) {
40 audit_log_format(ab, " ns=");
41 audit_log_untrustedstring(ab, ad->iface.ns);
42 }
43 if (ad->name) {
44 audit_log_format(ab, " name=");
45 audit_log_untrustedstring(ab, ad->name);
46 }
47 if (ad->iface.pos)
48 audit_log_format(ab, " offset=%ld", ad->iface.pos);
49 }
50
51 /**
52 * audit_iface - do audit message for policy unpacking/load/replace/remove
53 * @new: profile if it has been allocated (MAYBE NULL)
54 * @ns_name: name of the ns the profile is to be loaded to (MAY BE NULL)
55 * @name: name of the profile being manipulated (MAYBE NULL)
56 * @info: any extra info about the failure (MAYBE NULL)
57 * @e: buffer position info
58 * @error: error code
59 *
60 * Returns: %0 or error
61 */
62 static int audit_iface(struct aa_profile *new, const char *ns_name,
63 const char *name, const char *info, struct aa_ext *e,
64 int error)
65 {
66 struct aa_profile *profile = labels_profile(aa_current_raw_label());
67 DEFINE_AUDIT_DATA(ad, LSM_AUDIT_DATA_NONE, AA_CLASS_NONE, NULL);
68 if (e)
69 ad.iface.pos = e->pos - e->start;
70 ad.iface.ns = ns_name;
71 if (new)
72 ad.name = new->base.hname;
73 else
74 ad.name = name;
75 ad.info = info;
76 ad.error = error;
77
78 return aa_audit(AUDIT_APPARMOR_STATUS, profile, &ad, audit_cb);
79 }
80
81 void __aa_loaddata_update(struct aa_loaddata *data, long revision)
82 {
83 AA_BUG(!data);
84 AA_BUG(!data->ns);
85 AA_BUG(!mutex_is_locked(&data->ns->lock));
86 AA_BUG(data->revision > revision);
87
88 data->revision = revision;
89 if ((data->dents[AAFS_LOADDATA_REVISION])) {
90 struct inode *inode;
91
92 inode = d_inode(data->dents[AAFS_LOADDATA_DIR]);
93 inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
94
95 inode = d_inode(data->dents[AAFS_LOADDATA_REVISION]);
96 inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
97 }
98 }
99
100 bool aa_rawdata_eq(struct aa_loaddata *l, struct aa_loaddata *r)
101 {
102 if (l->size != r->size)
103 return false;
104 if (l->compressed_size != r->compressed_size)
105 return false;
106 if (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0)
107 return false;
108 return memcmp(l->data, r->data, r->compressed_size ?: r->size) == 0;
109 }
110
111 /*
112 * need to take the ns mutex lock which is NOT safe most places that
113 * put_loaddata is called, so we have to delay freeing it
114 */
115 static void do_loaddata_free(struct work_struct *work)
116 {
117 struct aa_loaddata *d = container_of(work, struct aa_loaddata, work);
118 struct aa_ns *ns = aa_get_ns(d->ns);
119
120 if (ns) {
121 mutex_lock_nested(&ns->lock, ns->level);
122 __aa_fs_remove_rawdata(d);
123 mutex_unlock(&ns->lock);
124 aa_put_ns(ns);
125 }
126
127 kfree_sensitive(d->hash);
128 kfree_sensitive(d->name);
129 kvfree(d->data);
130 kfree_sensitive(d);
131 }
132
133 void aa_loaddata_kref(struct kref *kref)
134 {
135 struct aa_loaddata *d = container_of(kref, struct aa_loaddata, count);
136
137 if (d) {
138 INIT_WORK(&d->work, do_loaddata_free);
139 schedule_work(&d->work);
140 }
141 }
142
143 struct aa_loaddata *aa_loaddata_alloc(size_t size)
144 {
145 struct aa_loaddata *d;
146
147 d = kzalloc(sizeof(*d), GFP_KERNEL);
148 if (d == NULL)
149 return ERR_PTR(-ENOMEM);
150 d->data = kvzalloc(size, GFP_KERNEL);
151 if (!d->data) {
152 kfree(d);
153 return ERR_PTR(-ENOMEM);
154 }
155 kref_init(&d->count);
156 INIT_LIST_HEAD(&d->list);
157
158 return d;
159 }
160
161 /* test if read will be in packed data bounds */
162 VISIBLE_IF_KUNIT bool aa_inbounds(struct aa_ext *e, size_t size)
163 {
164 return (size <= e->end - e->pos);
165 }
166 EXPORT_SYMBOL_IF_KUNIT(aa_inbounds);
167
168 /**
169 * aa_unpack_u16_chunk - test and do bounds checking for a u16 size based chunk
170 * @e: serialized data read head (NOT NULL)
171 * @chunk: start address for chunk of data (NOT NULL)
172 *
173 * Returns: the size of chunk found with the read head at the end of the chunk.
174 */
175 VISIBLE_IF_KUNIT size_t aa_unpack_u16_chunk(struct aa_ext *e, char **chunk)
176 {
177 size_t size = 0;
178 void *pos = e->pos;
179
180 if (!aa_inbounds(e, sizeof(u16)))
181 goto fail;
182 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
183 e->pos += sizeof(__le16);
184 if (!aa_inbounds(e, size))
185 goto fail;
186 *chunk = e->pos;
187 e->pos += size;
188 return size;
189
190 fail:
191 e->pos = pos;
192 return 0;
193 }
194 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u16_chunk);
195
196 /* unpack control byte */
197 VISIBLE_IF_KUNIT bool aa_unpack_X(struct aa_ext *e, enum aa_code code)
198 {
199 if (!aa_inbounds(e, 1))
200 return false;
201 if (*(u8 *) e->pos != code)
202 return false;
203 e->pos++;
204 return true;
205 }
206 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_X);
207
208 /**
209 * aa_unpack_nameX - check is the next element is of type X with a name of @name
210 * @e: serialized data extent information (NOT NULL)
211 * @code: type code
212 * @name: name to match to the serialized element. (MAYBE NULL)
213 *
214 * check that the next serialized data element is of type X and has a tag
215 * name @name. If @name is specified then there must be a matching
216 * name element in the stream. If @name is NULL any name element will be
217 * skipped and only the typecode will be tested.
218 *
219 * Returns true on success (both type code and name tests match) and the read
220 * head is advanced past the headers
221 *
222 * Returns: false if either match fails, the read head does not move
223 */
224 VISIBLE_IF_KUNIT bool aa_unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
225 {
226 /*
227 * May need to reset pos if name or type doesn't match
228 */
229 void *pos = e->pos;
230 /*
231 * Check for presence of a tagname, and if present name size
232 * AA_NAME tag value is a u16.
233 */
234 if (aa_unpack_X(e, AA_NAME)) {
235 char *tag = NULL;
236 size_t size = aa_unpack_u16_chunk(e, &tag);
237 /* if a name is specified it must match. otherwise skip tag */
238 if (name && (!size || tag[size-1] != '\0' || strcmp(name, tag)))
239 goto fail;
240 } else if (name) {
241 /* if a name is specified and there is no name tag fail */
242 goto fail;
243 }
244
245 /* now check if type code matches */
246 if (aa_unpack_X(e, code))
247 return true;
248
249 fail:
250 e->pos = pos;
251 return false;
252 }
253 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_nameX);
254
255 static bool unpack_u8(struct aa_ext *e, u8 *data, const char *name)
256 {
257 void *pos = e->pos;
258
259 if (aa_unpack_nameX(e, AA_U8, name)) {
260 if (!aa_inbounds(e, sizeof(u8)))
261 goto fail;
262 if (data)
263 *data = *((u8 *)e->pos);
264 e->pos += sizeof(u8);
265 return true;
266 }
267
268 fail:
269 e->pos = pos;
270 return false;
271 }
272
273 VISIBLE_IF_KUNIT bool aa_unpack_u32(struct aa_ext *e, u32 *data, const char *name)
274 {
275 void *pos = e->pos;
276
277 if (aa_unpack_nameX(e, AA_U32, name)) {
278 if (!aa_inbounds(e, sizeof(u32)))
279 goto fail;
280 if (data)
281 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
282 e->pos += sizeof(u32);
283 return true;
284 }
285
286 fail:
287 e->pos = pos;
288 return false;
289 }
290 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u32);
291
292 VISIBLE_IF_KUNIT bool aa_unpack_u64(struct aa_ext *e, u64 *data, const char *name)
293 {
294 void *pos = e->pos;
295
296 if (aa_unpack_nameX(e, AA_U64, name)) {
297 if (!aa_inbounds(e, sizeof(u64)))
298 goto fail;
299 if (data)
300 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
301 e->pos += sizeof(u64);
302 return true;
303 }
304
305 fail:
306 e->pos = pos;
307 return false;
308 }
309 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u64);
310
311 static bool aa_unpack_cap_low(struct aa_ext *e, kernel_cap_t *data, const char *name)
312 {
313 u32 val;
314
315 if (!aa_unpack_u32(e, &val, name))
316 return false;
317 data->val = val;
318 return true;
319 }
320
321 static bool aa_unpack_cap_high(struct aa_ext *e, kernel_cap_t *data, const char *name)
322 {
323 u32 val;
324
325 if (!aa_unpack_u32(e, &val, name))
326 return false;
327 data->val = (u32)data->val | ((u64)val << 32);
328 return true;
329 }
330
331 VISIBLE_IF_KUNIT bool aa_unpack_array(struct aa_ext *e, const char *name, u16 *size)
332 {
333 void *pos = e->pos;
334
335 if (aa_unpack_nameX(e, AA_ARRAY, name)) {
336 if (!aa_inbounds(e, sizeof(u16)))
337 goto fail;
338 *size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
339 e->pos += sizeof(u16);
340 return true;
341 }
342
343 fail:
344 e->pos = pos;
345 return false;
346 }
347 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_array);
348
349 VISIBLE_IF_KUNIT size_t aa_unpack_blob(struct aa_ext *e, char **blob, const char *name)
350 {
351 void *pos = e->pos;
352
353 if (aa_unpack_nameX(e, AA_BLOB, name)) {
354 u32 size;
355 if (!aa_inbounds(e, sizeof(u32)))
356 goto fail;
357 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
358 e->pos += sizeof(u32);
359 if (aa_inbounds(e, (size_t) size)) {
360 *blob = e->pos;
361 e->pos += size;
362 return size;
363 }
364 }
365
366 fail:
367 e->pos = pos;
368 return 0;
369 }
370 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_blob);
371
372 VISIBLE_IF_KUNIT int aa_unpack_str(struct aa_ext *e, const char **string, const char *name)
373 {
374 char *src_str;
375 size_t size = 0;
376 void *pos = e->pos;
377 *string = NULL;
378 if (aa_unpack_nameX(e, AA_STRING, name)) {
379 size = aa_unpack_u16_chunk(e, &src_str);
380 if (size) {
381 /* strings are null terminated, length is size - 1 */
382 if (src_str[size - 1] != 0)
383 goto fail;
384 *string = src_str;
385
386 return size;
387 }
388 }
389
390 fail:
391 e->pos = pos;
392 return 0;
393 }
394 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_str);
395
396 VISIBLE_IF_KUNIT int aa_unpack_strdup(struct aa_ext *e, char **string, const char *name)
397 {
398 const char *tmp;
399 void *pos = e->pos;
400 int res = aa_unpack_str(e, &tmp, name);
401 *string = NULL;
402
403 if (!res)
404 return 0;
405
406 *string = kmemdup(tmp, res, GFP_KERNEL);
407 if (!*string) {
408 e->pos = pos;
409 return 0;
410 }
411
412 return res;
413 }
414 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_strdup);
415
416
417 /**
418 * unpack_dfa - unpack a file rule dfa
419 * @e: serialized data extent information (NOT NULL)
420 * @flags: dfa flags to check
421 *
422 * returns dfa or ERR_PTR or NULL if no dfa
423 */
424 static struct aa_dfa *unpack_dfa(struct aa_ext *e, int flags)
425 {
426 char *blob = NULL;
427 size_t size;
428 struct aa_dfa *dfa = NULL;
429
430 size = aa_unpack_blob(e, &blob, "aadfa");
431 if (size) {
432 /*
433 * The dfa is aligned with in the blob to 8 bytes
434 * from the beginning of the stream.
435 * alignment adjust needed by dfa unpack
436 */
437 size_t sz = blob - (char *) e->start -
438 ((e->pos - e->start) & 7);
439 size_t pad = ALIGN(sz, 8) - sz;
440 if (aa_g_paranoid_load)
441 flags |= DFA_FLAG_VERIFY_STATES;
442 dfa = aa_dfa_unpack(blob + pad, size - pad, flags);
443
444 if (IS_ERR(dfa))
445 return dfa;
446
447 }
448
449 return dfa;
450 }
451
452 /**
453 * unpack_trans_table - unpack a profile transition table
454 * @e: serialized data extent information (NOT NULL)
455 * @strs: str table to unpack to (NOT NULL)
456 *
457 * Returns: true if table successfully unpacked or not present
458 */
459 static bool unpack_trans_table(struct aa_ext *e, struct aa_str_table *strs)
460 {
461 void *saved_pos = e->pos;
462 char **table = NULL;
463
464 /* exec table is optional */
465 if (aa_unpack_nameX(e, AA_STRUCT, "xtable")) {
466 u16 size;
467 int i;
468
469 if (!aa_unpack_array(e, NULL, &size))
470 /*
471 * Note: index into trans table array is a max
472 * of 2^24, but unpack array can only unpack
473 * an array of 2^16 in size atm so no need
474 * for size check here
475 */
476 goto fail;
477 table = kcalloc(size, sizeof(char *), GFP_KERNEL);
478 if (!table)
479 goto fail;
480
481 strs->table = table;
482 strs->size = size;
483 for (i = 0; i < size; i++) {
484 char *str;
485 int c, j, pos, size2 = aa_unpack_strdup(e, &str, NULL);
486 /* aa_unpack_strdup verifies that the last character is
487 * null termination byte.
488 */
489 if (!size2)
490 goto fail;
491 table[i] = str;
492 /* verify that name doesn't start with space */
493 if (isspace(*str))
494 goto fail;
495
496 /* count internal # of internal \0 */
497 for (c = j = 0; j < size2 - 1; j++) {
498 if (!str[j]) {
499 pos = j;
500 c++;
501 }
502 }
503 if (*str == ':') {
504 /* first character after : must be valid */
505 if (!str[1])
506 goto fail;
507 /* beginning with : requires an embedded \0,
508 * verify that exactly 1 internal \0 exists
509 * trailing \0 already verified by aa_unpack_strdup
510 *
511 * convert \0 back to : for label_parse
512 */
513 if (c == 1)
514 str[pos] = ':';
515 else if (c > 1)
516 goto fail;
517 } else if (c)
518 /* fail - all other cases with embedded \0 */
519 goto fail;
520 }
521 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
522 goto fail;
523 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
524 goto fail;
525 }
526 return true;
527
528 fail:
529 aa_free_str_table(strs);
530 e->pos = saved_pos;
531 return false;
532 }
533
534 static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
535 {
536 void *pos = e->pos;
537
538 if (aa_unpack_nameX(e, AA_STRUCT, "xattrs")) {
539 u16 size;
540 int i;
541
542 if (!aa_unpack_array(e, NULL, &size))
543 goto fail;
544 profile->attach.xattr_count = size;
545 profile->attach.xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
546 if (!profile->attach.xattrs)
547 goto fail;
548 for (i = 0; i < size; i++) {
549 if (!aa_unpack_strdup(e, &profile->attach.xattrs[i], NULL))
550 goto fail;
551 }
552 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
553 goto fail;
554 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
555 goto fail;
556 }
557
558 return true;
559
560 fail:
561 e->pos = pos;
562 return false;
563 }
564
565 static bool unpack_secmark(struct aa_ext *e, struct aa_ruleset *rules)
566 {
567 void *pos = e->pos;
568 u16 size;
569 int i;
570
571 if (aa_unpack_nameX(e, AA_STRUCT, "secmark")) {
572 if (!aa_unpack_array(e, NULL, &size))
573 goto fail;
574
575 rules->secmark = kcalloc(size, sizeof(struct aa_secmark),
576 GFP_KERNEL);
577 if (!rules->secmark)
578 goto fail;
579
580 rules->secmark_count = size;
581
582 for (i = 0; i < size; i++) {
583 if (!unpack_u8(e, &rules->secmark[i].audit, NULL))
584 goto fail;
585 if (!unpack_u8(e, &rules->secmark[i].deny, NULL))
586 goto fail;
587 if (!aa_unpack_strdup(e, &rules->secmark[i].label, NULL))
588 goto fail;
589 }
590 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
591 goto fail;
592 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
593 goto fail;
594 }
595
596 return true;
597
598 fail:
599 if (rules->secmark) {
600 for (i = 0; i < size; i++)
601 kfree(rules->secmark[i].label);
602 kfree(rules->secmark);
603 rules->secmark_count = 0;
604 rules->secmark = NULL;
605 }
606
607 e->pos = pos;
608 return false;
609 }
610
611 static bool unpack_rlimits(struct aa_ext *e, struct aa_ruleset *rules)
612 {
613 void *pos = e->pos;
614
615 /* rlimits are optional */
616 if (aa_unpack_nameX(e, AA_STRUCT, "rlimits")) {
617 u16 size;
618 int i;
619 u32 tmp = 0;
620 if (!aa_unpack_u32(e, &tmp, NULL))
621 goto fail;
622 rules->rlimits.mask = tmp;
623
624 if (!aa_unpack_array(e, NULL, &size) ||
625 size > RLIM_NLIMITS)
626 goto fail;
627 for (i = 0; i < size; i++) {
628 u64 tmp2 = 0;
629 int a = aa_map_resource(i);
630 if (!aa_unpack_u64(e, &tmp2, NULL))
631 goto fail;
632 rules->rlimits.limits[a].rlim_max = tmp2;
633 }
634 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
635 goto fail;
636 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
637 goto fail;
638 }
639 return true;
640
641 fail:
642 e->pos = pos;
643 return false;
644 }
645
646 static bool unpack_perm(struct aa_ext *e, u32 version, struct aa_perms *perm)
647 {
648 if (version != 1)
649 return false;
650
651 return aa_unpack_u32(e, &perm->allow, NULL) &&
652 aa_unpack_u32(e, &perm->allow, NULL) &&
653 aa_unpack_u32(e, &perm->deny, NULL) &&
654 aa_unpack_u32(e, &perm->subtree, NULL) &&
655 aa_unpack_u32(e, &perm->cond, NULL) &&
656 aa_unpack_u32(e, &perm->kill, NULL) &&
657 aa_unpack_u32(e, &perm->complain, NULL) &&
658 aa_unpack_u32(e, &perm->prompt, NULL) &&
659 aa_unpack_u32(e, &perm->audit, NULL) &&
660 aa_unpack_u32(e, &perm->quiet, NULL) &&
661 aa_unpack_u32(e, &perm->hide, NULL) &&
662 aa_unpack_u32(e, &perm->xindex, NULL) &&
663 aa_unpack_u32(e, &perm->tag, NULL) &&
664 aa_unpack_u32(e, &perm->label, NULL);
665 }
666
667 static ssize_t unpack_perms_table(struct aa_ext *e, struct aa_perms **perms)
668 {
669 void *pos = e->pos;
670 u16 size = 0;
671
672 AA_BUG(!perms);
673 /*
674 * policy perms are optional, in which case perms are embedded
675 * in the dfa accept table
676 */
677 if (aa_unpack_nameX(e, AA_STRUCT, "perms")) {
678 int i;
679 u32 version;
680
681 if (!aa_unpack_u32(e, &version, "version"))
682 goto fail_reset;
683 if (!aa_unpack_array(e, NULL, &size))
684 goto fail_reset;
685 *perms = kcalloc(size, sizeof(struct aa_perms), GFP_KERNEL);
686 if (!*perms)
687 goto fail_reset;
688 for (i = 0; i < size; i++) {
689 if (!unpack_perm(e, version, &(*perms)[i]))
690 goto fail;
691 }
692 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
693 goto fail;
694 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
695 goto fail;
696 } else
697 *perms = NULL;
698
699 return size;
700
701 fail:
702 kfree(*perms);
703 fail_reset:
704 e->pos = pos;
705 return -EPROTO;
706 }
707
708 static int unpack_pdb(struct aa_ext *e, struct aa_policydb **policy,
709 bool required_dfa, bool required_trans,
710 const char **info)
711 {
712 struct aa_policydb *pdb;
713 void *pos = e->pos;
714 int i, flags, error = -EPROTO;
715 ssize_t size;
716
717 pdb = aa_alloc_pdb(GFP_KERNEL);
718 if (!pdb)
719 return -ENOMEM;
720
721 size = unpack_perms_table(e, &pdb->perms);
722 if (size < 0) {
723 error = size;
724 pdb->perms = NULL;
725 *info = "failed to unpack - perms";
726 goto fail;
727 }
728 pdb->size = size;
729
730 if (pdb->perms) {
731 /* perms table present accept is index */
732 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
733 } else {
734 /* packed perms in accept1 and accept2 */
735 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
736 TO_ACCEPT2_FLAG(YYTD_DATA32);
737 }
738
739 pdb->dfa = unpack_dfa(e, flags);
740 if (IS_ERR(pdb->dfa)) {
741 error = PTR_ERR(pdb->dfa);
742 pdb->dfa = NULL;
743 *info = "failed to unpack - dfa";
744 goto fail;
745 } else if (!pdb->dfa) {
746 if (required_dfa) {
747 *info = "missing required dfa";
748 goto fail;
749 }
750 } else {
751 /*
752 * only unpack the following if a dfa is present
753 *
754 * sadly start was given different names for file and policydb
755 * but since it is optional we can try both
756 */
757 if (!aa_unpack_u32(e, &pdb->start[0], "start"))
758 /* default start state */
759 pdb->start[0] = DFA_START;
760 if (!aa_unpack_u32(e, &pdb->start[AA_CLASS_FILE], "dfa_start")) {
761 /* default start state for xmatch and file dfa */
762 pdb->start[AA_CLASS_FILE] = DFA_START;
763 } /* setup class index */
764 for (i = AA_CLASS_FILE + 1; i <= AA_CLASS_LAST; i++) {
765 pdb->start[i] = aa_dfa_next(pdb->dfa, pdb->start[0],
766 i);
767 }
768 }
769
770 /*
771 * Unfortunately due to a bug in earlier userspaces, a
772 * transition table may be present even when the dfa is
773 * not. For compatibility reasons unpack and discard.
774 */
775 if (!unpack_trans_table(e, &pdb->trans) && required_trans) {
776 *info = "failed to unpack profile transition table";
777 goto fail;
778 }
779
780 if (!pdb->dfa && pdb->trans.table)
781 aa_free_str_table(&pdb->trans);
782
783 /* TODO: move compat mapping here, requires dfa merging first */
784 /* TODO: move verify here, it has to be done after compat mappings */
785
786 *policy = pdb;
787 return 0;
788
789 fail:
790 aa_put_pdb(pdb);
791 e->pos = pos;
792 return error;
793 }
794
795 static u32 strhash(const void *data, u32 len, u32 seed)
796 {
797 const char * const *key = data;
798
799 return jhash(*key, strlen(*key), seed);
800 }
801
802 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
803 {
804 const struct aa_data *data = obj;
805 const char * const *key = arg->key;
806
807 return strcmp(data->key, *key);
808 }
809
810 /**
811 * unpack_profile - unpack a serialized profile
812 * @e: serialized data extent information (NOT NULL)
813 * @ns_name: pointer of newly allocated copy of %NULL in case of error
814 *
815 * NOTE: unpack profile sets audit struct if there is a failure
816 */
817 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
818 {
819 struct aa_ruleset *rules;
820 struct aa_profile *profile = NULL;
821 const char *tmpname, *tmpns = NULL, *name = NULL;
822 const char *info = "failed to unpack profile";
823 size_t ns_len;
824 struct rhashtable_params params = { 0 };
825 char *key = NULL, *disconnected = NULL;
826 struct aa_data *data;
827 int error = -EPROTO;
828 kernel_cap_t tmpcap;
829 u32 tmp;
830
831 *ns_name = NULL;
832
833 /* check that we have the right struct being passed */
834 if (!aa_unpack_nameX(e, AA_STRUCT, "profile"))
835 goto fail;
836 if (!aa_unpack_str(e, &name, NULL))
837 goto fail;
838 if (*name == '\0')
839 goto fail;
840
841 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
842 if (tmpns) {
843 if (!tmpname) {
844 info = "empty profile name";
845 goto fail;
846 }
847 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
848 if (!*ns_name) {
849 info = "out of memory";
850 error = -ENOMEM;
851 goto fail;
852 }
853 name = tmpname;
854 }
855
856 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
857 if (!profile) {
858 info = "out of memory";
859 error = -ENOMEM;
860 goto fail;
861 }
862 rules = list_first_entry(&profile->rules, typeof(*rules), list);
863
864 /* profile renaming is optional */
865 (void) aa_unpack_str(e, &profile->rename, "rename");
866
867 /* attachment string is optional */
868 (void) aa_unpack_str(e, &profile->attach.xmatch_str, "attach");
869
870 /* xmatch is optional and may be NULL */
871 error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
872 if (error) {
873 info = "bad xmatch";
874 goto fail;
875 }
876
877 /* neither xmatch_len not xmatch_perms are optional if xmatch is set */
878 if (profile->attach.xmatch->dfa) {
879 if (!aa_unpack_u32(e, &tmp, NULL)) {
880 info = "missing xmatch len";
881 goto fail;
882 }
883 profile->attach.xmatch_len = tmp;
884 profile->attach.xmatch->start[AA_CLASS_XMATCH] = DFA_START;
885 if (!profile->attach.xmatch->perms) {
886 error = aa_compat_map_xmatch(profile->attach.xmatch);
887 if (error) {
888 info = "failed to convert xmatch permission table";
889 goto fail;
890 }
891 }
892 }
893
894 /* disconnected attachment string is optional */
895 (void) aa_unpack_strdup(e, &disconnected, "disconnected");
896 profile->disconnected = disconnected;
897
898 /* per profile debug flags (complain, audit) */
899 if (!aa_unpack_nameX(e, AA_STRUCT, "flags")) {
900 info = "profile missing flags";
901 goto fail;
902 }
903 info = "failed to unpack profile flags";
904 if (!aa_unpack_u32(e, &tmp, NULL))
905 goto fail;
906 if (tmp & PACKED_FLAG_HAT)
907 profile->label.flags |= FLAG_HAT;
908 if (tmp & PACKED_FLAG_DEBUG1)
909 profile->label.flags |= FLAG_DEBUG1;
910 if (tmp & PACKED_FLAG_DEBUG2)
911 profile->label.flags |= FLAG_DEBUG2;
912 if (!aa_unpack_u32(e, &tmp, NULL))
913 goto fail;
914 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG)) {
915 profile->mode = APPARMOR_COMPLAIN;
916 } else if (tmp == PACKED_MODE_ENFORCE) {
917 profile->mode = APPARMOR_ENFORCE;
918 } else if (tmp == PACKED_MODE_KILL) {
919 profile->mode = APPARMOR_KILL;
920 } else if (tmp == PACKED_MODE_UNCONFINED) {
921 profile->mode = APPARMOR_UNCONFINED;
922 profile->label.flags |= FLAG_UNCONFINED;
923 } else if (tmp == PACKED_MODE_USER) {
924 profile->mode = APPARMOR_USER;
925 } else {
926 goto fail;
927 }
928 if (!aa_unpack_u32(e, &tmp, NULL))
929 goto fail;
930 if (tmp)
931 profile->audit = AUDIT_ALL;
932
933 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
934 goto fail;
935
936 /* path_flags is optional */
937 if (aa_unpack_u32(e, &profile->path_flags, "path_flags"))
938 profile->path_flags |= profile->label.flags &
939 PATH_MEDIATE_DELETED;
940 else
941 /* set a default value if path_flags field is not present */
942 profile->path_flags = PATH_MEDIATE_DELETED;
943
944 info = "failed to unpack profile capabilities";
945 if (!aa_unpack_cap_low(e, &rules->caps.allow, NULL))
946 goto fail;
947 if (!aa_unpack_cap_low(e, &rules->caps.audit, NULL))
948 goto fail;
949 if (!aa_unpack_cap_low(e, &rules->caps.quiet, NULL))
950 goto fail;
951 if (!aa_unpack_cap_low(e, &tmpcap, NULL))
952 goto fail;
953
954 info = "failed to unpack upper profile capabilities";
955 if (aa_unpack_nameX(e, AA_STRUCT, "caps64")) {
956 /* optional upper half of 64 bit caps */
957 if (!aa_unpack_cap_high(e, &rules->caps.allow, NULL))
958 goto fail;
959 if (!aa_unpack_cap_high(e, &rules->caps.audit, NULL))
960 goto fail;
961 if (!aa_unpack_cap_high(e, &rules->caps.quiet, NULL))
962 goto fail;
963 if (!aa_unpack_cap_high(e, &tmpcap, NULL))
964 goto fail;
965 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
966 goto fail;
967 }
968
969 info = "failed to unpack extended profile capabilities";
970 if (aa_unpack_nameX(e, AA_STRUCT, "capsx")) {
971 /* optional extended caps mediation mask */
972 if (!aa_unpack_cap_low(e, &rules->caps.extended, NULL))
973 goto fail;
974 if (!aa_unpack_cap_high(e, &rules->caps.extended, NULL))
975 goto fail;
976 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
977 goto fail;
978 }
979
980 if (!unpack_xattrs(e, profile)) {
981 info = "failed to unpack profile xattrs";
982 goto fail;
983 }
984
985 if (!unpack_rlimits(e, rules)) {
986 info = "failed to unpack profile rlimits";
987 goto fail;
988 }
989
990 if (!unpack_secmark(e, rules)) {
991 info = "failed to unpack profile secmark rules";
992 goto fail;
993 }
994
995 if (aa_unpack_nameX(e, AA_STRUCT, "policydb")) {
996 /* generic policy dfa - optional and may be NULL */
997 info = "failed to unpack policydb";
998 error = unpack_pdb(e, &rules->policy, true, false,
999 &info);
1000 if (error)
1001 goto fail;
1002 /* Fixup: drop when we get rid of start array */
1003 if (aa_dfa_next(rules->policy->dfa, rules->policy->start[0],
1004 AA_CLASS_FILE))
1005 rules->policy->start[AA_CLASS_FILE] =
1006 aa_dfa_next(rules->policy->dfa,
1007 rules->policy->start[0],
1008 AA_CLASS_FILE);
1009 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
1010 goto fail;
1011 if (!rules->policy->perms) {
1012 error = aa_compat_map_policy(rules->policy,
1013 e->version);
1014 if (error) {
1015 info = "failed to remap policydb permission table";
1016 goto fail;
1017 }
1018 }
1019 } else {
1020 rules->policy = aa_get_pdb(nullpdb);
1021 }
1022 /* get file rules */
1023 error = unpack_pdb(e, &rules->file, false, true, &info);
1024 if (error) {
1025 goto fail;
1026 } else if (rules->file->dfa) {
1027 if (!rules->file->perms) {
1028 error = aa_compat_map_file(rules->file);
1029 if (error) {
1030 info = "failed to remap file permission table";
1031 goto fail;
1032 }
1033 }
1034 } else if (rules->policy->dfa &&
1035 rules->policy->start[AA_CLASS_FILE]) {
1036 aa_put_pdb(rules->file);
1037 rules->file = aa_get_pdb(rules->policy);
1038 } else {
1039 aa_put_pdb(rules->file);
1040 rules->file = aa_get_pdb(nullpdb);
1041 }
1042 error = -EPROTO;
1043 if (aa_unpack_nameX(e, AA_STRUCT, "data")) {
1044 info = "out of memory";
1045 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
1046 if (!profile->data) {
1047 error = -ENOMEM;
1048 goto fail;
1049 }
1050 params.nelem_hint = 3;
1051 params.key_len = sizeof(void *);
1052 params.key_offset = offsetof(struct aa_data, key);
1053 params.head_offset = offsetof(struct aa_data, head);
1054 params.hashfn = strhash;
1055 params.obj_cmpfn = datacmp;
1056
1057 if (rhashtable_init(profile->data, ¶ms)) {
1058 info = "failed to init key, value hash table";
1059 goto fail;
1060 }
1061
1062 while (aa_unpack_strdup(e, &key, NULL)) {
1063 data = kzalloc(sizeof(*data), GFP_KERNEL);
1064 if (!data) {
1065 kfree_sensitive(key);
1066 error = -ENOMEM;
1067 goto fail;
1068 }
1069
1070 data->key = key;
1071 data->size = aa_unpack_blob(e, &data->data, NULL);
1072 data->data = kvmemdup(data->data, data->size, GFP_KERNEL);
1073 if (data->size && !data->data) {
1074 kfree_sensitive(data->key);
1075 kfree_sensitive(data);
1076 error = -ENOMEM;
1077 goto fail;
1078 }
1079
1080 if (rhashtable_insert_fast(profile->data, &data->head,
1081 profile->data->p)) {
1082 kvfree_sensitive(data->data, data->size);
1083 kfree_sensitive(data->key);
1084 kfree_sensitive(data);
1085 info = "failed to insert data to table";
1086 goto fail;
1087 }
1088 }
1089
1090 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1091 info = "failed to unpack end of key, value data table";
1092 goto fail;
1093 }
1094 }
1095
1096 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1097 info = "failed to unpack end of profile";
1098 goto fail;
1099 }
1100
1101 return profile;
1102
1103 fail:
1104 if (error == 0)
1105 /* default error covers most cases */
1106 error = -EPROTO;
1107 if (*ns_name) {
1108 kfree(*ns_name);
1109 *ns_name = NULL;
1110 }
1111 if (profile)
1112 name = NULL;
1113 else if (!name)
1114 name = "unknown";
1115 audit_iface(profile, NULL, name, info, e, error);
1116 aa_free_profile(profile);
1117
1118 return ERR_PTR(error);
1119 }
1120
1121 /**
1122 * verify_header - unpack serialized stream header
1123 * @e: serialized data read head (NOT NULL)
1124 * @required: whether the header is required or optional
1125 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
1126 *
1127 * Returns: error or 0 if header is good
1128 */
1129 static int verify_header(struct aa_ext *e, int required, const char **ns)
1130 {
1131 int error = -EPROTONOSUPPORT;
1132 const char *name = NULL;
1133 *ns = NULL;
1134
1135 /* get the interface version */
1136 if (!aa_unpack_u32(e, &e->version, "version")) {
1137 if (required) {
1138 audit_iface(NULL, NULL, NULL, "invalid profile format",
1139 e, error);
1140 return error;
1141 }
1142 }
1143
1144 /* Check that the interface version is currently supported.
1145 * if not specified use previous version
1146 * Mask off everything that is not kernel abi version
1147 */
1148 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1149 audit_iface(NULL, NULL, NULL, "unsupported interface version",
1150 e, error);
1151 return error;
1152 }
1153
1154 /* read the namespace if present */
1155 if (aa_unpack_str(e, &name, "namespace")) {
1156 if (*name == '\0') {
1157 audit_iface(NULL, NULL, NULL, "invalid namespace name",
1158 e, error);
1159 return error;
1160 }
1161 if (*ns && strcmp(*ns, name)) {
1162 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1163 error);
1164 } else if (!*ns) {
1165 *ns = kstrdup(name, GFP_KERNEL);
1166 if (!*ns)
1167 return -ENOMEM;
1168 }
1169 }
1170
1171 return 0;
1172 }
1173
1174 /**
1175 * verify_dfa_accept_index - verify accept indexes are in range of perms table
1176 * @dfa: the dfa to check accept indexes are in range
1177 * @table_size: the permission table size the indexes should be within
1178 */
1179 static bool verify_dfa_accept_index(struct aa_dfa *dfa, int table_size)
1180 {
1181 int i;
1182 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1183 if (ACCEPT_TABLE(dfa)[i] >= table_size)
1184 return false;
1185 }
1186 return true;
1187 }
1188
1189 static bool verify_perm(struct aa_perms *perm)
1190 {
1191 /* TODO: allow option to just force the perms into a valid state */
1192 if (perm->allow & perm->deny)
1193 return false;
1194 if (perm->subtree & ~perm->allow)
1195 return false;
1196 if (perm->cond & (perm->allow | perm->deny))
1197 return false;
1198 if (perm->kill & perm->allow)
1199 return false;
1200 if (perm->complain & (perm->allow | perm->deny))
1201 return false;
1202 if (perm->prompt & (perm->allow | perm->deny))
1203 return false;
1204 if (perm->complain & perm->prompt)
1205 return false;
1206 if (perm->hide & perm->allow)
1207 return false;
1208
1209 return true;
1210 }
1211
1212 static bool verify_perms(struct aa_policydb *pdb)
1213 {
1214 int i;
1215
1216 for (i = 0; i < pdb->size; i++) {
1217 if (!verify_perm(&pdb->perms[i]))
1218 return false;
1219 /* verify indexes into str table */
1220 if ((pdb->perms[i].xindex & AA_X_TYPE_MASK) == AA_X_TABLE &&
1221 (pdb->perms[i].xindex & AA_X_INDEX_MASK) >= pdb->trans.size)
1222 return false;
1223 if (pdb->perms[i].tag && pdb->perms[i].tag >= pdb->trans.size)
1224 return false;
1225 if (pdb->perms[i].label &&
1226 pdb->perms[i].label >= pdb->trans.size)
1227 return false;
1228 }
1229
1230 return true;
1231 }
1232
1233 /**
1234 * verify_profile - Do post unpack analysis to verify profile consistency
1235 * @profile: profile to verify (NOT NULL)
1236 *
1237 * Returns: 0 if passes verification else error
1238 *
1239 * This verification is post any unpack mapping or changes
1240 */
1241 static int verify_profile(struct aa_profile *profile)
1242 {
1243 struct aa_ruleset *rules = list_first_entry(&profile->rules,
1244 typeof(*rules), list);
1245 if (!rules)
1246 return 0;
1247
1248 if (rules->file->dfa && !verify_dfa_accept_index(rules->file->dfa,
1249 rules->file->size)) {
1250 audit_iface(profile, NULL, NULL,
1251 "Unpack: file Invalid named transition", NULL,
1252 -EPROTO);
1253 return -EPROTO;
1254 }
1255 if (rules->policy->dfa &&
1256 !verify_dfa_accept_index(rules->policy->dfa, rules->policy->size)) {
1257 audit_iface(profile, NULL, NULL,
1258 "Unpack: policy Invalid named transition", NULL,
1259 -EPROTO);
1260 return -EPROTO;
1261 }
1262
1263 if (!verify_perms(rules->file)) {
1264 audit_iface(profile, NULL, NULL,
1265 "Unpack: Invalid perm index", NULL, -EPROTO);
1266 return -EPROTO;
1267 }
1268 if (!verify_perms(rules->policy)) {
1269 audit_iface(profile, NULL, NULL,
1270 "Unpack: Invalid perm index", NULL, -EPROTO);
1271 return -EPROTO;
1272 }
1273 if (!verify_perms(profile->attach.xmatch)) {
1274 audit_iface(profile, NULL, NULL,
1275 "Unpack: Invalid perm index", NULL, -EPROTO);
1276 return -EPROTO;
1277 }
1278
1279 return 0;
1280 }
1281
1282 void aa_load_ent_free(struct aa_load_ent *ent)
1283 {
1284 if (ent) {
1285 aa_put_profile(ent->rename);
1286 aa_put_profile(ent->old);
1287 aa_put_profile(ent->new);
1288 kfree(ent->ns_name);
1289 kfree_sensitive(ent);
1290 }
1291 }
1292
1293 struct aa_load_ent *aa_load_ent_alloc(void)
1294 {
1295 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1296 if (ent)
1297 INIT_LIST_HEAD(&ent->list);
1298 return ent;
1299 }
1300
1301 static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
1302 {
1303 #ifdef CONFIG_SECURITY_APPARMOR_EXPORT_BINARY
1304 const zstd_parameters params =
1305 zstd_get_params(aa_g_rawdata_compression_level, slen);
1306 const size_t wksp_len = zstd_cctx_workspace_bound(¶ms.cParams);
1307 void *wksp = NULL;
1308 zstd_cctx *ctx = NULL;
1309 size_t out_len = zstd_compress_bound(slen);
1310 void *out = NULL;
1311 int ret = 0;
1312
1313 out = kvzalloc(out_len, GFP_KERNEL);
1314 if (!out) {
1315 ret = -ENOMEM;
1316 goto cleanup;
1317 }
1318
1319 wksp = kvzalloc(wksp_len, GFP_KERNEL);
1320 if (!wksp) {
1321 ret = -ENOMEM;
1322 goto cleanup;
1323 }
1324
1325 ctx = zstd_init_cctx(wksp, wksp_len);
1326 if (!ctx) {
1327 ret = -EINVAL;
1328 goto cleanup;
1329 }
1330
1331 out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, ¶ms);
1332 if (zstd_is_error(out_len) || out_len >= slen) {
1333 ret = -EINVAL;
1334 goto cleanup;
1335 }
1336
1337 if (is_vmalloc_addr(out)) {
1338 *dst = kvzalloc(out_len, GFP_KERNEL);
1339 if (*dst) {
1340 memcpy(*dst, out, out_len);
1341 kvfree(out);
1342 out = NULL;
1343 }
1344 } else {
1345 /*
1346 * If the staging buffer was kmalloc'd, then using krealloc is
1347 * probably going to be faster. The destination buffer will
1348 * always be smaller, so it's just shrunk, avoiding a memcpy
1349 */
1350 *dst = krealloc(out, out_len, GFP_KERNEL);
1351 }
1352
1353 if (!*dst) {
1354 ret = -ENOMEM;
1355 goto cleanup;
1356 }
1357
1358 *dlen = out_len;
1359
1360 cleanup:
1361 if (ret) {
1362 kvfree(out);
1363 *dst = NULL;
1364 }
1365
1366 kvfree(wksp);
1367 return ret;
1368 #else
1369 *dlen = slen;
1370 return 0;
1371 #endif
1372 }
1373
1374 static int compress_loaddata(struct aa_loaddata *data)
1375 {
1376 AA_BUG(data->compressed_size > 0);
1377
1378 /*
1379 * Shortcut the no compression case, else we increase the amount of
1380 * storage required by a small amount
1381 */
1382 if (aa_g_rawdata_compression_level != 0) {
1383 void *udata = data->data;
1384 int error = compress_zstd(udata, data->size, &data->data,
1385 &data->compressed_size);
1386 if (error) {
1387 data->compressed_size = data->size;
1388 return error;
1389 }
1390 if (udata != data->data)
1391 kvfree(udata);
1392 } else
1393 data->compressed_size = data->size;
1394
1395 return 0;
1396 }
1397
1398 /**
1399 * aa_unpack - unpack packed binary profile(s) data loaded from user space
1400 * @udata: user data copied to kmem (NOT NULL)
1401 * @lh: list to place unpacked profiles in a aa_repl_ws
1402 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1403 *
1404 * Unpack user data and return refcounted allocated profile(s) stored in
1405 * @lh in order of discovery, with the list chain stored in base.list
1406 * or error
1407 *
1408 * Returns: profile(s) on @lh else error pointer if fails to unpack
1409 */
1410 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1411 const char **ns)
1412 {
1413 struct aa_load_ent *tmp, *ent;
1414 struct aa_profile *profile = NULL;
1415 char *ns_name = NULL;
1416 int error;
1417 struct aa_ext e = {
1418 .start = udata->data,
1419 .end = udata->data + udata->size,
1420 .pos = udata->data,
1421 };
1422
1423 *ns = NULL;
1424 while (e.pos < e.end) {
1425 void *start;
1426 error = verify_header(&e, e.pos == e.start, ns);
1427 if (error)
1428 goto fail;
1429
1430 start = e.pos;
1431 profile = unpack_profile(&e, &ns_name);
1432 if (IS_ERR(profile)) {
1433 error = PTR_ERR(profile);
1434 goto fail;
1435 }
1436
1437 error = verify_profile(profile);
1438 if (error)
1439 goto fail_profile;
1440
1441 if (aa_g_hash_policy)
1442 error = aa_calc_profile_hash(profile, e.version, start,
1443 e.pos - start);
1444 if (error)
1445 goto fail_profile;
1446
1447 ent = aa_load_ent_alloc();
1448 if (!ent) {
1449 error = -ENOMEM;
1450 goto fail_profile;
1451 }
1452
1453 ent->new = profile;
1454 ent->ns_name = ns_name;
1455 ns_name = NULL;
1456 list_add_tail(&ent->list, lh);
1457 }
1458 udata->abi = e.version & K_ABI_MASK;
1459 if (aa_g_hash_policy) {
1460 udata->hash = aa_calc_hash(udata->data, udata->size);
1461 if (IS_ERR(udata->hash)) {
1462 error = PTR_ERR(udata->hash);
1463 udata->hash = NULL;
1464 goto fail;
1465 }
1466 }
1467
1468 if (aa_g_export_binary) {
1469 error = compress_loaddata(udata);
1470 if (error)
1471 goto fail;
1472 }
1473 return 0;
1474
1475 fail_profile:
1476 kfree(ns_name);
1477 aa_put_profile(profile);
1478
1479 fail:
1480 list_for_each_entry_safe(ent, tmp, lh, list) {
1481 list_del_init(&ent->list);
1482 aa_load_ent_free(ent);
1483 }
1484
1485 return error;
1486 }
1487
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.