apparmor: avoid crash when parsed profile name is empty
[platform/kernel/linux-starfive.git] / security / apparmor / policy_unpack.c
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->i_mtime = inode_set_ctime_current(inode);
94
95                 inode = d_inode(data->dents[AAFS_LOADDATA_REVISION]);
96                 inode->i_mtime = 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         void *pos = e->pos;
713         int i, flags, error = -EPROTO;
714         ssize_t size;
715
716         size = unpack_perms_table(e, &policy->perms);
717         if (size < 0) {
718                 error = size;
719                 policy->perms = NULL;
720                 *info = "failed to unpack - perms";
721                 goto fail;
722         }
723         policy->size = size;
724
725         if (policy->perms) {
726                 /* perms table present accept is index */
727                 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
728         } else {
729                 /* packed perms in accept1 and accept2 */
730                 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
731                         TO_ACCEPT2_FLAG(YYTD_DATA32);
732         }
733
734         policy->dfa = unpack_dfa(e, flags);
735         if (IS_ERR(policy->dfa)) {
736                 error = PTR_ERR(policy->dfa);
737                 policy->dfa = NULL;
738                 *info = "failed to unpack - dfa";
739                 goto fail;
740         } else if (!policy->dfa) {
741                 if (required_dfa) {
742                         *info = "missing required dfa";
743                         goto fail;
744                 }
745                 goto out;
746         }
747
748         /*
749          * only unpack the following if a dfa is present
750          *
751          * sadly start was given different names for file and policydb
752          * but since it is optional we can try both
753          */
754         if (!aa_unpack_u32(e, &policy->start[0], "start"))
755                 /* default start state */
756                 policy->start[0] = DFA_START;
757         if (!aa_unpack_u32(e, &policy->start[AA_CLASS_FILE], "dfa_start")) {
758                 /* default start state for xmatch and file dfa */
759                 policy->start[AA_CLASS_FILE] = DFA_START;
760         }       /* setup class index */
761         for (i = AA_CLASS_FILE + 1; i <= AA_CLASS_LAST; i++) {
762                 policy->start[i] = aa_dfa_next(policy->dfa, policy->start[0],
763                                                i);
764         }
765         if (!unpack_trans_table(e, &policy->trans) && required_trans) {
766                 *info = "failed to unpack profile transition table";
767                 goto fail;
768         }
769
770         /* TODO: move compat mapping here, requires dfa merging first */
771         /* TODO: move verify here, it has to be done after compat mappings */
772 out:
773         return 0;
774
775 fail:
776         e->pos = pos;
777         return error;
778 }
779
780 static u32 strhash(const void *data, u32 len, u32 seed)
781 {
782         const char * const *key = data;
783
784         return jhash(*key, strlen(*key), seed);
785 }
786
787 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
788 {
789         const struct aa_data *data = obj;
790         const char * const *key = arg->key;
791
792         return strcmp(data->key, *key);
793 }
794
795 /**
796  * unpack_profile - unpack a serialized profile
797  * @e: serialized data extent information (NOT NULL)
798  * @ns_name: pointer of newly allocated copy of %NULL in case of error
799  *
800  * NOTE: unpack profile sets audit struct if there is a failure
801  */
802 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
803 {
804         struct aa_ruleset *rules;
805         struct aa_profile *profile = NULL;
806         const char *tmpname, *tmpns = NULL, *name = NULL;
807         const char *info = "failed to unpack profile";
808         size_t ns_len;
809         struct rhashtable_params params = { 0 };
810         char *key = NULL, *disconnected = NULL;
811         struct aa_data *data;
812         int error = -EPROTO;
813         kernel_cap_t tmpcap;
814         u32 tmp;
815
816         *ns_name = NULL;
817
818         /* check that we have the right struct being passed */
819         if (!aa_unpack_nameX(e, AA_STRUCT, "profile"))
820                 goto fail;
821         if (!aa_unpack_str(e, &name, NULL))
822                 goto fail;
823         if (*name == '\0')
824                 goto fail;
825
826         tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
827         if (tmpns) {
828                 if (!tmpname) {
829                         info = "empty profile name";
830                         goto fail;
831                 }
832                 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
833                 if (!*ns_name) {
834                         info = "out of memory";
835                         error = -ENOMEM;
836                         goto fail;
837                 }
838                 name = tmpname;
839         }
840
841         profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
842         if (!profile) {
843                 info = "out of memory";
844                 error = -ENOMEM;
845                 goto fail;
846         }
847         rules = list_first_entry(&profile->rules, typeof(*rules), list);
848
849         /* profile renaming is optional */
850         (void) aa_unpack_str(e, &profile->rename, "rename");
851
852         /* attachment string is optional */
853         (void) aa_unpack_str(e, &profile->attach.xmatch_str, "attach");
854
855         /* xmatch is optional and may be NULL */
856         error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
857         if (error) {
858                 info = "bad xmatch";
859                 goto fail;
860         }
861
862         /* neither xmatch_len not xmatch_perms are optional if xmatch is set */
863         if (profile->attach.xmatch.dfa) {
864                 if (!aa_unpack_u32(e, &tmp, NULL)) {
865                         info = "missing xmatch len";
866                         goto fail;
867                 }
868                 profile->attach.xmatch_len = tmp;
869                 profile->attach.xmatch.start[AA_CLASS_XMATCH] = DFA_START;
870                 if (!profile->attach.xmatch.perms) {
871                         error = aa_compat_map_xmatch(&profile->attach.xmatch);
872                         if (error) {
873                                 info = "failed to convert xmatch permission table";
874                                 goto fail;
875                         }
876                 }
877         }
878
879         /* disconnected attachment string is optional */
880         (void) aa_unpack_strdup(e, &disconnected, "disconnected");
881         profile->disconnected = disconnected;
882
883         /* per profile debug flags (complain, audit) */
884         if (!aa_unpack_nameX(e, AA_STRUCT, "flags")) {
885                 info = "profile missing flags";
886                 goto fail;
887         }
888         info = "failed to unpack profile flags";
889         if (!aa_unpack_u32(e, &tmp, NULL))
890                 goto fail;
891         if (tmp & PACKED_FLAG_HAT)
892                 profile->label.flags |= FLAG_HAT;
893         if (tmp & PACKED_FLAG_DEBUG1)
894                 profile->label.flags |= FLAG_DEBUG1;
895         if (tmp & PACKED_FLAG_DEBUG2)
896                 profile->label.flags |= FLAG_DEBUG2;
897         if (!aa_unpack_u32(e, &tmp, NULL))
898                 goto fail;
899         if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG)) {
900                 profile->mode = APPARMOR_COMPLAIN;
901         } else if (tmp == PACKED_MODE_ENFORCE) {
902                 profile->mode = APPARMOR_ENFORCE;
903         } else if (tmp == PACKED_MODE_KILL) {
904                 profile->mode = APPARMOR_KILL;
905         } else if (tmp == PACKED_MODE_UNCONFINED) {
906                 profile->mode = APPARMOR_UNCONFINED;
907                 profile->label.flags |= FLAG_UNCONFINED;
908         } else if (tmp == PACKED_MODE_USER) {
909                 profile->mode = APPARMOR_USER;
910         } else {
911                 goto fail;
912         }
913         if (!aa_unpack_u32(e, &tmp, NULL))
914                 goto fail;
915         if (tmp)
916                 profile->audit = AUDIT_ALL;
917
918         if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
919                 goto fail;
920
921         /* path_flags is optional */
922         if (aa_unpack_u32(e, &profile->path_flags, "path_flags"))
923                 profile->path_flags |= profile->label.flags &
924                         PATH_MEDIATE_DELETED;
925         else
926                 /* set a default value if path_flags field is not present */
927                 profile->path_flags = PATH_MEDIATE_DELETED;
928
929         info = "failed to unpack profile capabilities";
930         if (!aa_unpack_cap_low(e, &rules->caps.allow, NULL))
931                 goto fail;
932         if (!aa_unpack_cap_low(e, &rules->caps.audit, NULL))
933                 goto fail;
934         if (!aa_unpack_cap_low(e, &rules->caps.quiet, NULL))
935                 goto fail;
936         if (!aa_unpack_cap_low(e, &tmpcap, NULL))
937                 goto fail;
938
939         info = "failed to unpack upper profile capabilities";
940         if (aa_unpack_nameX(e, AA_STRUCT, "caps64")) {
941                 /* optional upper half of 64 bit caps */
942                 if (!aa_unpack_cap_high(e, &rules->caps.allow, NULL))
943                         goto fail;
944                 if (!aa_unpack_cap_high(e, &rules->caps.audit, NULL))
945                         goto fail;
946                 if (!aa_unpack_cap_high(e, &rules->caps.quiet, NULL))
947                         goto fail;
948                 if (!aa_unpack_cap_high(e, &tmpcap, NULL))
949                         goto fail;
950                 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
951                         goto fail;
952         }
953
954         info = "failed to unpack extended profile capabilities";
955         if (aa_unpack_nameX(e, AA_STRUCT, "capsx")) {
956                 /* optional extended caps mediation mask */
957                 if (!aa_unpack_cap_low(e, &rules->caps.extended, NULL))
958                         goto fail;
959                 if (!aa_unpack_cap_high(e, &rules->caps.extended, NULL))
960                         goto fail;
961                 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
962                         goto fail;
963         }
964
965         if (!unpack_xattrs(e, profile)) {
966                 info = "failed to unpack profile xattrs";
967                 goto fail;
968         }
969
970         if (!unpack_rlimits(e, rules)) {
971                 info = "failed to unpack profile rlimits";
972                 goto fail;
973         }
974
975         if (!unpack_secmark(e, rules)) {
976                 info = "failed to unpack profile secmark rules";
977                 goto fail;
978         }
979
980         if (aa_unpack_nameX(e, AA_STRUCT, "policydb")) {
981                 /* generic policy dfa - optional and may be NULL */
982                 info = "failed to unpack policydb";
983                 error = unpack_pdb(e, &rules->policy, true, false,
984                                    &info);
985                 if (error)
986                         goto fail;
987                 /* Fixup: drop when we get rid of start array */
988                 if (aa_dfa_next(rules->policy.dfa, rules->policy.start[0],
989                                 AA_CLASS_FILE))
990                         rules->policy.start[AA_CLASS_FILE] =
991                           aa_dfa_next(rules->policy.dfa,
992                                       rules->policy.start[0],
993                                       AA_CLASS_FILE);
994                 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
995                         goto fail;
996                 if (!rules->policy.perms) {
997                         error = aa_compat_map_policy(&rules->policy,
998                                                      e->version);
999                         if (error) {
1000                                 info = "failed to remap policydb permission table";
1001                                 goto fail;
1002                         }
1003                 }
1004         } else {
1005                 rules->policy.dfa = aa_get_dfa(nulldfa);
1006                 rules->policy.perms = kcalloc(2, sizeof(struct aa_perms),
1007                                               GFP_KERNEL);
1008                 if (!rules->policy.perms)
1009                         goto fail;
1010                 rules->policy.size = 2;
1011         }
1012         /* get file rules */
1013         error = unpack_pdb(e, &rules->file, false, true, &info);
1014         if (error) {
1015                 goto fail;
1016         } else if (rules->file.dfa) {
1017                 if (!rules->file.perms) {
1018                         error = aa_compat_map_file(&rules->file);
1019                         if (error) {
1020                                 info = "failed to remap file permission table";
1021                                 goto fail;
1022                         }
1023                 }
1024         } else if (rules->policy.dfa &&
1025                    rules->policy.start[AA_CLASS_FILE]) {
1026                 rules->file.dfa = aa_get_dfa(rules->policy.dfa);
1027                 rules->file.start[AA_CLASS_FILE] = rules->policy.start[AA_CLASS_FILE];
1028                 rules->file.perms = kcalloc(rules->policy.size,
1029                                             sizeof(struct aa_perms),
1030                                             GFP_KERNEL);
1031                 if (!rules->file.perms)
1032                         goto fail;
1033                 memcpy(rules->file.perms, rules->policy.perms,
1034                        rules->policy.size * sizeof(struct aa_perms));
1035                 rules->file.size = rules->policy.size;
1036         } else {
1037                 rules->file.dfa = aa_get_dfa(nulldfa);
1038                 rules->file.perms = kcalloc(2, sizeof(struct aa_perms),
1039                                             GFP_KERNEL);
1040                 if (!rules->file.perms)
1041                         goto fail;
1042                 rules->file.size = 2;
1043         }
1044         error = -EPROTO;
1045         if (aa_unpack_nameX(e, AA_STRUCT, "data")) {
1046                 info = "out of memory";
1047                 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
1048                 if (!profile->data) {
1049                         error = -ENOMEM;
1050                         goto fail;
1051                 }
1052                 params.nelem_hint = 3;
1053                 params.key_len = sizeof(void *);
1054                 params.key_offset = offsetof(struct aa_data, key);
1055                 params.head_offset = offsetof(struct aa_data, head);
1056                 params.hashfn = strhash;
1057                 params.obj_cmpfn = datacmp;
1058
1059                 if (rhashtable_init(profile->data, &params)) {
1060                         info = "failed to init key, value hash table";
1061                         goto fail;
1062                 }
1063
1064                 while (aa_unpack_strdup(e, &key, NULL)) {
1065                         data = kzalloc(sizeof(*data), GFP_KERNEL);
1066                         if (!data) {
1067                                 kfree_sensitive(key);
1068                                 error = -ENOMEM;
1069                                 goto fail;
1070                         }
1071
1072                         data->key = key;
1073                         data->size = aa_unpack_blob(e, &data->data, NULL);
1074                         data->data = kvmemdup(data->data, data->size, GFP_KERNEL);
1075                         if (data->size && !data->data) {
1076                                 kfree_sensitive(data->key);
1077                                 kfree_sensitive(data);
1078                                 error = -ENOMEM;
1079                                 goto fail;
1080                         }
1081
1082                         if (rhashtable_insert_fast(profile->data, &data->head,
1083                                                    profile->data->p)) {
1084                                 kfree_sensitive(data->key);
1085                                 kfree_sensitive(data);
1086                                 info = "failed to insert data to table";
1087                                 goto fail;
1088                         }
1089                 }
1090
1091                 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1092                         info = "failed to unpack end of key, value data table";
1093                         goto fail;
1094                 }
1095         }
1096
1097         if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1098                 info = "failed to unpack end of profile";
1099                 goto fail;
1100         }
1101
1102         return profile;
1103
1104 fail:
1105         if (error == 0)
1106                 /* default error covers most cases */
1107                 error = -EPROTO;
1108         if (*ns_name) {
1109                 kfree(*ns_name);
1110                 *ns_name = NULL;
1111         }
1112         if (profile)
1113                 name = NULL;
1114         else if (!name)
1115                 name = "unknown";
1116         audit_iface(profile, NULL, name, info, e, error);
1117         aa_free_profile(profile);
1118
1119         return ERR_PTR(error);
1120 }
1121
1122 /**
1123  * verify_header - unpack serialized stream header
1124  * @e: serialized data read head (NOT NULL)
1125  * @required: whether the header is required or optional
1126  * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
1127  *
1128  * Returns: error or 0 if header is good
1129  */
1130 static int verify_header(struct aa_ext *e, int required, const char **ns)
1131 {
1132         int error = -EPROTONOSUPPORT;
1133         const char *name = NULL;
1134         *ns = NULL;
1135
1136         /* get the interface version */
1137         if (!aa_unpack_u32(e, &e->version, "version")) {
1138                 if (required) {
1139                         audit_iface(NULL, NULL, NULL, "invalid profile format",
1140                                     e, error);
1141                         return error;
1142                 }
1143         }
1144
1145         /* Check that the interface version is currently supported.
1146          * if not specified use previous version
1147          * Mask off everything that is not kernel abi version
1148          */
1149         if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1150                 audit_iface(NULL, NULL, NULL, "unsupported interface version",
1151                             e, error);
1152                 return error;
1153         }
1154
1155         /* read the namespace if present */
1156         if (aa_unpack_str(e, &name, "namespace")) {
1157                 if (*name == '\0') {
1158                         audit_iface(NULL, NULL, NULL, "invalid namespace name",
1159                                     e, error);
1160                         return error;
1161                 }
1162                 if (*ns && strcmp(*ns, name)) {
1163                         audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1164                                     error);
1165                 } else if (!*ns) {
1166                         *ns = kstrdup(name, GFP_KERNEL);
1167                         if (!*ns)
1168                                 return -ENOMEM;
1169                 }
1170         }
1171
1172         return 0;
1173 }
1174
1175 /**
1176  * verify_dfa_accept_index - verify accept indexes are in range of perms table
1177  * @dfa: the dfa to check accept indexes are in range
1178  * table_size: the permission table size the indexes should be within
1179  */
1180 static bool verify_dfa_accept_index(struct aa_dfa *dfa, int table_size)
1181 {
1182         int i;
1183         for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1184                 if (ACCEPT_TABLE(dfa)[i] >= table_size)
1185                         return false;
1186         }
1187         return true;
1188 }
1189
1190 static bool verify_perm(struct aa_perms *perm)
1191 {
1192         /* TODO: allow option to just force the perms into a valid state */
1193         if (perm->allow & perm->deny)
1194                 return false;
1195         if (perm->subtree & ~perm->allow)
1196                 return false;
1197         if (perm->cond & (perm->allow | perm->deny))
1198                 return false;
1199         if (perm->kill & perm->allow)
1200                 return false;
1201         if (perm->complain & (perm->allow | perm->deny))
1202                 return false;
1203         if (perm->prompt & (perm->allow | perm->deny))
1204                 return false;
1205         if (perm->complain & perm->prompt)
1206                 return false;
1207         if (perm->hide & perm->allow)
1208                 return false;
1209
1210         return true;
1211 }
1212
1213 static bool verify_perms(struct aa_policydb *pdb)
1214 {
1215         int i;
1216
1217         for (i = 0; i < pdb->size; i++) {
1218                 if (!verify_perm(&pdb->perms[i]))
1219                         return false;
1220                 /* verify indexes into str table */
1221                 if ((pdb->perms[i].xindex & AA_X_TYPE_MASK) == AA_X_TABLE &&
1222                     (pdb->perms[i].xindex & AA_X_INDEX_MASK) >= pdb->trans.size)
1223                         return false;
1224                 if (pdb->perms[i].tag && pdb->perms[i].tag >= pdb->trans.size)
1225                         return false;
1226                 if (pdb->perms[i].label &&
1227                     pdb->perms[i].label >= pdb->trans.size)
1228                         return false;
1229         }
1230
1231         return true;
1232 }
1233
1234 /**
1235  * verify_profile - Do post unpack analysis to verify profile consistency
1236  * @profile: profile to verify (NOT NULL)
1237  *
1238  * Returns: 0 if passes verification else error
1239  *
1240  * This verification is post any unpack mapping or changes
1241  */
1242 static int verify_profile(struct aa_profile *profile)
1243 {
1244         struct aa_ruleset *rules = list_first_entry(&profile->rules,
1245                                                     typeof(*rules), list);
1246         if (!rules)
1247                 return 0;
1248
1249         if ((rules->file.dfa && !verify_dfa_accept_index(rules->file.dfa,
1250                                                          rules->file.size)) ||
1251             (rules->policy.dfa &&
1252              !verify_dfa_accept_index(rules->policy.dfa, rules->policy.size))) {
1253                 audit_iface(profile, NULL, NULL,
1254                             "Unpack: Invalid named transition", NULL, -EPROTO);
1255                 return -EPROTO;
1256         }
1257
1258         if (!verify_perms(&rules->file)) {
1259                 audit_iface(profile, NULL, NULL,
1260                             "Unpack: Invalid perm index", NULL, -EPROTO);
1261                 return -EPROTO;
1262         }
1263         if (!verify_perms(&rules->policy)) {
1264                 audit_iface(profile, NULL, NULL,
1265                             "Unpack: Invalid perm index", NULL, -EPROTO);
1266                 return -EPROTO;
1267         }
1268         if (!verify_perms(&profile->attach.xmatch)) {
1269                 audit_iface(profile, NULL, NULL,
1270                             "Unpack: Invalid perm index", NULL, -EPROTO);
1271                 return -EPROTO;
1272         }
1273
1274         return 0;
1275 }
1276
1277 void aa_load_ent_free(struct aa_load_ent *ent)
1278 {
1279         if (ent) {
1280                 aa_put_profile(ent->rename);
1281                 aa_put_profile(ent->old);
1282                 aa_put_profile(ent->new);
1283                 kfree(ent->ns_name);
1284                 kfree_sensitive(ent);
1285         }
1286 }
1287
1288 struct aa_load_ent *aa_load_ent_alloc(void)
1289 {
1290         struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1291         if (ent)
1292                 INIT_LIST_HEAD(&ent->list);
1293         return ent;
1294 }
1295
1296 static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
1297 {
1298 #ifdef CONFIG_SECURITY_APPARMOR_EXPORT_BINARY
1299         const zstd_parameters params =
1300                 zstd_get_params(aa_g_rawdata_compression_level, slen);
1301         const size_t wksp_len = zstd_cctx_workspace_bound(&params.cParams);
1302         void *wksp = NULL;
1303         zstd_cctx *ctx = NULL;
1304         size_t out_len = zstd_compress_bound(slen);
1305         void *out = NULL;
1306         int ret = 0;
1307
1308         out = kvzalloc(out_len, GFP_KERNEL);
1309         if (!out) {
1310                 ret = -ENOMEM;
1311                 goto cleanup;
1312         }
1313
1314         wksp = kvzalloc(wksp_len, GFP_KERNEL);
1315         if (!wksp) {
1316                 ret = -ENOMEM;
1317                 goto cleanup;
1318         }
1319
1320         ctx = zstd_init_cctx(wksp, wksp_len);
1321         if (!ctx) {
1322                 ret = -EINVAL;
1323                 goto cleanup;
1324         }
1325
1326         out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, &params);
1327         if (zstd_is_error(out_len) || out_len >= slen) {
1328                 ret = -EINVAL;
1329                 goto cleanup;
1330         }
1331
1332         if (is_vmalloc_addr(out)) {
1333                 *dst = kvzalloc(out_len, GFP_KERNEL);
1334                 if (*dst) {
1335                         memcpy(*dst, out, out_len);
1336                         kvfree(out);
1337                         out = NULL;
1338                 }
1339         } else {
1340                 /*
1341                  * If the staging buffer was kmalloc'd, then using krealloc is
1342                  * probably going to be faster. The destination buffer will
1343                  * always be smaller, so it's just shrunk, avoiding a memcpy
1344                  */
1345                 *dst = krealloc(out, out_len, GFP_KERNEL);
1346         }
1347
1348         if (!*dst) {
1349                 ret = -ENOMEM;
1350                 goto cleanup;
1351         }
1352
1353         *dlen = out_len;
1354
1355 cleanup:
1356         if (ret) {
1357                 kvfree(out);
1358                 *dst = NULL;
1359         }
1360
1361         kvfree(wksp);
1362         return ret;
1363 #else
1364         *dlen = slen;
1365         return 0;
1366 #endif
1367 }
1368
1369 static int compress_loaddata(struct aa_loaddata *data)
1370 {
1371         AA_BUG(data->compressed_size > 0);
1372
1373         /*
1374          * Shortcut the no compression case, else we increase the amount of
1375          * storage required by a small amount
1376          */
1377         if (aa_g_rawdata_compression_level != 0) {
1378                 void *udata = data->data;
1379                 int error = compress_zstd(udata, data->size, &data->data,
1380                                           &data->compressed_size);
1381                 if (error) {
1382                         data->compressed_size = data->size;
1383                         return error;
1384                 }
1385                 if (udata != data->data)
1386                         kvfree(udata);
1387         } else
1388                 data->compressed_size = data->size;
1389
1390         return 0;
1391 }
1392
1393 /**
1394  * aa_unpack - unpack packed binary profile(s) data loaded from user space
1395  * @udata: user data copied to kmem  (NOT NULL)
1396  * @lh: list to place unpacked profiles in a aa_repl_ws
1397  * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1398  *
1399  * Unpack user data and return refcounted allocated profile(s) stored in
1400  * @lh in order of discovery, with the list chain stored in base.list
1401  * or error
1402  *
1403  * Returns: profile(s) on @lh else error pointer if fails to unpack
1404  */
1405 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1406               const char **ns)
1407 {
1408         struct aa_load_ent *tmp, *ent;
1409         struct aa_profile *profile = NULL;
1410         char *ns_name = NULL;
1411         int error;
1412         struct aa_ext e = {
1413                 .start = udata->data,
1414                 .end = udata->data + udata->size,
1415                 .pos = udata->data,
1416         };
1417
1418         *ns = NULL;
1419         while (e.pos < e.end) {
1420                 void *start;
1421                 error = verify_header(&e, e.pos == e.start, ns);
1422                 if (error)
1423                         goto fail;
1424
1425                 start = e.pos;
1426                 profile = unpack_profile(&e, &ns_name);
1427                 if (IS_ERR(profile)) {
1428                         error = PTR_ERR(profile);
1429                         goto fail;
1430                 }
1431
1432                 error = verify_profile(profile);
1433                 if (error)
1434                         goto fail_profile;
1435
1436                 if (aa_g_hash_policy)
1437                         error = aa_calc_profile_hash(profile, e.version, start,
1438                                                      e.pos - start);
1439                 if (error)
1440                         goto fail_profile;
1441
1442                 ent = aa_load_ent_alloc();
1443                 if (!ent) {
1444                         error = -ENOMEM;
1445                         goto fail_profile;
1446                 }
1447
1448                 ent->new = profile;
1449                 ent->ns_name = ns_name;
1450                 ns_name = NULL;
1451                 list_add_tail(&ent->list, lh);
1452         }
1453         udata->abi = e.version & K_ABI_MASK;
1454         if (aa_g_hash_policy) {
1455                 udata->hash = aa_calc_hash(udata->data, udata->size);
1456                 if (IS_ERR(udata->hash)) {
1457                         error = PTR_ERR(udata->hash);
1458                         udata->hash = NULL;
1459                         goto fail;
1460                 }
1461         }
1462
1463         if (aa_g_export_binary) {
1464                 error = compress_loaddata(udata);
1465                 if (error)
1466                         goto fail;
1467         }
1468         return 0;
1469
1470 fail_profile:
1471         kfree(ns_name);
1472         aa_put_profile(profile);
1473
1474 fail:
1475         list_for_each_entry_safe(ent, tmp, lh, list) {
1476                 list_del_init(&ent->list);
1477                 aa_load_ent_free(ent);
1478         }
1479
1480         return error;
1481 }