1 // SPDX-License-Identifier: GPL-2.0-only
3 * AppArmor security module
5 * This file contains AppArmor functions for unpacking policy loaded from
8 * Copyright (C) 1998-2008 Novell/SUSE
9 * Copyright 2009-2010 Canonical Ltd.
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.
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>
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"
33 /* audit callback for unpack fields */
34 static void audit_cb(struct audit_buffer *ab, void *va)
36 struct common_audit_data *sa = va;
38 if (aad(sa)->iface.ns) {
39 audit_log_format(ab, " ns=");
40 audit_log_untrustedstring(ab, aad(sa)->iface.ns);
43 audit_log_format(ab, " name=");
44 audit_log_untrustedstring(ab, aad(sa)->name);
46 if (aad(sa)->iface.pos)
47 audit_log_format(ab, " offset=%ld", aad(sa)->iface.pos);
51 * audit_iface - do audit message for policy unpacking/load/replace/remove
52 * @new: profile if it has been allocated (MAYBE NULL)
53 * @ns_name: name of the ns the profile is to be loaded to (MAY BE NULL)
54 * @name: name of the profile being manipulated (MAYBE NULL)
55 * @info: any extra info about the failure (MAYBE NULL)
56 * @e: buffer position info
59 * Returns: %0 or error
61 static int audit_iface(struct aa_profile *new, const char *ns_name,
62 const char *name, const char *info, struct aa_ext *e,
65 struct aa_profile *profile = labels_profile(aa_current_raw_label());
66 DEFINE_AUDIT_DATA(sa, LSM_AUDIT_DATA_NONE, AA_CLASS_NONE, NULL);
68 aad(&sa)->iface.pos = e->pos - e->start;
69 aad(&sa)->iface.ns = ns_name;
71 aad(&sa)->name = new->base.hname;
73 aad(&sa)->name = name;
74 aad(&sa)->info = info;
75 aad(&sa)->error = error;
77 return aa_audit(AUDIT_APPARMOR_STATUS, profile, &sa, audit_cb);
80 void __aa_loaddata_update(struct aa_loaddata *data, long revision)
84 AA_BUG(!mutex_is_locked(&data->ns->lock));
85 AA_BUG(data->revision > revision);
87 data->revision = revision;
88 if ((data->dents[AAFS_LOADDATA_REVISION])) {
89 d_inode(data->dents[AAFS_LOADDATA_DIR])->i_mtime =
90 current_time(d_inode(data->dents[AAFS_LOADDATA_DIR]));
91 d_inode(data->dents[AAFS_LOADDATA_REVISION])->i_mtime =
92 current_time(d_inode(data->dents[AAFS_LOADDATA_REVISION]));
96 bool aa_rawdata_eq(struct aa_loaddata *l, struct aa_loaddata *r)
98 if (l->size != r->size)
100 if (l->compressed_size != r->compressed_size)
102 if (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0)
104 return memcmp(l->data, r->data, r->compressed_size ?: r->size) == 0;
108 * need to take the ns mutex lock which is NOT safe most places that
109 * put_loaddata is called, so we have to delay freeing it
111 static void do_loaddata_free(struct work_struct *work)
113 struct aa_loaddata *d = container_of(work, struct aa_loaddata, work);
114 struct aa_ns *ns = aa_get_ns(d->ns);
117 mutex_lock_nested(&ns->lock, ns->level);
118 __aa_fs_remove_rawdata(d);
119 mutex_unlock(&ns->lock);
123 kfree_sensitive(d->hash);
124 kfree_sensitive(d->name);
129 void aa_loaddata_kref(struct kref *kref)
131 struct aa_loaddata *d = container_of(kref, struct aa_loaddata, count);
134 INIT_WORK(&d->work, do_loaddata_free);
135 schedule_work(&d->work);
139 struct aa_loaddata *aa_loaddata_alloc(size_t size)
141 struct aa_loaddata *d;
143 d = kzalloc(sizeof(*d), GFP_KERNEL);
145 return ERR_PTR(-ENOMEM);
146 d->data = kvzalloc(size, GFP_KERNEL);
149 return ERR_PTR(-ENOMEM);
151 kref_init(&d->count);
152 INIT_LIST_HEAD(&d->list);
157 /* test if read will be in packed data bounds */
158 VISIBLE_IF_KUNIT bool aa_inbounds(struct aa_ext *e, size_t size)
160 return (size <= e->end - e->pos);
162 EXPORT_SYMBOL_IF_KUNIT(aa_inbounds);
164 static void *kvmemdup(const void *src, size_t len)
166 void *p = kvmalloc(len, GFP_KERNEL);
174 * aa_unpack_u16_chunk - test and do bounds checking for a u16 size based chunk
175 * @e: serialized data read head (NOT NULL)
176 * @chunk: start address for chunk of data (NOT NULL)
178 * Returns: the size of chunk found with the read head at the end of the chunk.
180 VISIBLE_IF_KUNIT size_t aa_unpack_u16_chunk(struct aa_ext *e, char **chunk)
185 if (!aa_inbounds(e, sizeof(u16)))
187 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
188 e->pos += sizeof(__le16);
189 if (!aa_inbounds(e, size))
199 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u16_chunk);
201 /* unpack control byte */
202 VISIBLE_IF_KUNIT bool aa_unpack_X(struct aa_ext *e, enum aa_code code)
204 if (!aa_inbounds(e, 1))
206 if (*(u8 *) e->pos != code)
211 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_X);
214 * aa_unpack_nameX - check is the next element is of type X with a name of @name
215 * @e: serialized data extent information (NOT NULL)
217 * @name: name to match to the serialized element. (MAYBE NULL)
219 * check that the next serialized data element is of type X and has a tag
220 * name @name. If @name is specified then there must be a matching
221 * name element in the stream. If @name is NULL any name element will be
222 * skipped and only the typecode will be tested.
224 * Returns true on success (both type code and name tests match) and the read
225 * head is advanced past the headers
227 * Returns: false if either match fails, the read head does not move
229 VISIBLE_IF_KUNIT bool aa_unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
232 * May need to reset pos if name or type doesn't match
236 * Check for presence of a tagname, and if present name size
237 * AA_NAME tag value is a u16.
239 if (aa_unpack_X(e, AA_NAME)) {
241 size_t size = aa_unpack_u16_chunk(e, &tag);
242 /* if a name is specified it must match. otherwise skip tag */
243 if (name && (!size || tag[size-1] != '\0' || strcmp(name, tag)))
246 /* if a name is specified and there is no name tag fail */
250 /* now check if type code matches */
251 if (aa_unpack_X(e, code))
258 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_nameX);
260 static bool unpack_u8(struct aa_ext *e, u8 *data, const char *name)
264 if (aa_unpack_nameX(e, AA_U8, name)) {
265 if (!aa_inbounds(e, sizeof(u8)))
268 *data = *((u8 *)e->pos);
269 e->pos += sizeof(u8);
278 VISIBLE_IF_KUNIT bool aa_unpack_u32(struct aa_ext *e, u32 *data, const char *name)
282 if (aa_unpack_nameX(e, AA_U32, name)) {
283 if (!aa_inbounds(e, sizeof(u32)))
286 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
287 e->pos += sizeof(u32);
295 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u32);
297 VISIBLE_IF_KUNIT bool aa_unpack_u64(struct aa_ext *e, u64 *data, const char *name)
301 if (aa_unpack_nameX(e, AA_U64, name)) {
302 if (!aa_inbounds(e, sizeof(u64)))
305 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
306 e->pos += sizeof(u64);
314 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u64);
316 VISIBLE_IF_KUNIT bool aa_unpack_array(struct aa_ext *e, const char *name, u16 *size)
320 if (aa_unpack_nameX(e, AA_ARRAY, name)) {
321 if (!aa_inbounds(e, sizeof(u16)))
323 *size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
324 e->pos += sizeof(u16);
332 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_array);
334 VISIBLE_IF_KUNIT size_t aa_unpack_blob(struct aa_ext *e, char **blob, const char *name)
338 if (aa_unpack_nameX(e, AA_BLOB, name)) {
340 if (!aa_inbounds(e, sizeof(u32)))
342 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
343 e->pos += sizeof(u32);
344 if (aa_inbounds(e, (size_t) size)) {
355 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_blob);
357 VISIBLE_IF_KUNIT int aa_unpack_str(struct aa_ext *e, const char **string, const char *name)
363 if (aa_unpack_nameX(e, AA_STRING, name)) {
364 size = aa_unpack_u16_chunk(e, &src_str);
366 /* strings are null terminated, length is size - 1 */
367 if (src_str[size - 1] != 0)
379 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_str);
381 VISIBLE_IF_KUNIT int aa_unpack_strdup(struct aa_ext *e, char **string, const char *name)
385 int res = aa_unpack_str(e, &tmp, name);
391 *string = kmemdup(tmp, res, GFP_KERNEL);
399 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_strdup);
403 * unpack_dfa - unpack a file rule dfa
404 * @e: serialized data extent information (NOT NULL)
405 * @flags: dfa flags to check
407 * returns dfa or ERR_PTR or NULL if no dfa
409 static struct aa_dfa *unpack_dfa(struct aa_ext *e, int flags)
413 struct aa_dfa *dfa = NULL;
415 size = aa_unpack_blob(e, &blob, "aadfa");
418 * The dfa is aligned with in the blob to 8 bytes
419 * from the beginning of the stream.
420 * alignment adjust needed by dfa unpack
422 size_t sz = blob - (char *) e->start -
423 ((e->pos - e->start) & 7);
424 size_t pad = ALIGN(sz, 8) - sz;
425 if (aa_g_paranoid_load)
426 flags |= DFA_FLAG_VERIFY_STATES;
427 dfa = aa_dfa_unpack(blob + pad, size - pad, flags);
438 * unpack_trans_table - unpack a profile transition table
439 * @e: serialized data extent information (NOT NULL)
440 * @table: str table to unpack to (NOT NULL)
442 * Returns: true if table successfully unpacked or not present
444 static bool unpack_trans_table(struct aa_ext *e, struct aa_str_table *strs)
446 void *saved_pos = e->pos;
449 /* exec table is optional */
450 if (aa_unpack_nameX(e, AA_STRUCT, "xtable")) {
454 if (!aa_unpack_array(e, NULL, &size))
456 * Note: index into trans table array is a max
457 * of 2^24, but unpack array can only unpack
458 * an array of 2^16 in size atm so no need
459 * for size check here
462 table = kcalloc(size, sizeof(char *), GFP_KERNEL);
466 for (i = 0; i < size; i++) {
468 int c, j, pos, size2 = aa_unpack_strdup(e, &str, NULL);
469 /* aa_unpack_strdup verifies that the last character is
470 * null termination byte.
475 /* verify that name doesn't start with space */
479 /* count internal # of internal \0 */
480 for (c = j = 0; j < size2 - 1; j++) {
487 /* first character after : must be valid */
490 /* beginning with : requires an embedded \0,
491 * verify that exactly 1 internal \0 exists
492 * trailing \0 already verified by aa_unpack_strdup
494 * convert \0 back to : for label_parse
501 /* fail - all other cases with embedded \0 */
504 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
506 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
515 kfree_sensitive(table);
520 static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
524 if (aa_unpack_nameX(e, AA_STRUCT, "xattrs")) {
528 if (!aa_unpack_array(e, NULL, &size))
530 profile->attach.xattr_count = size;
531 profile->attach.xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
532 if (!profile->attach.xattrs)
534 for (i = 0; i < size; i++) {
535 if (!aa_unpack_strdup(e, &profile->attach.xattrs[i], NULL))
538 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
540 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
551 static bool unpack_secmark(struct aa_ext *e, struct aa_ruleset *rules)
557 if (aa_unpack_nameX(e, AA_STRUCT, "secmark")) {
558 if (!aa_unpack_array(e, NULL, &size))
561 rules->secmark = kcalloc(size, sizeof(struct aa_secmark),
566 rules->secmark_count = size;
568 for (i = 0; i < size; i++) {
569 if (!unpack_u8(e, &rules->secmark[i].audit, NULL))
571 if (!unpack_u8(e, &rules->secmark[i].deny, NULL))
573 if (!aa_unpack_strdup(e, &rules->secmark[i].label, NULL))
576 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
578 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
585 if (rules->secmark) {
586 for (i = 0; i < size; i++)
587 kfree(rules->secmark[i].label);
588 kfree(rules->secmark);
589 rules->secmark_count = 0;
590 rules->secmark = NULL;
597 static bool unpack_rlimits(struct aa_ext *e, struct aa_ruleset *rules)
601 /* rlimits are optional */
602 if (aa_unpack_nameX(e, AA_STRUCT, "rlimits")) {
606 if (!aa_unpack_u32(e, &tmp, NULL))
608 rules->rlimits.mask = tmp;
610 if (!aa_unpack_array(e, NULL, &size) ||
613 for (i = 0; i < size; i++) {
615 int a = aa_map_resource(i);
616 if (!aa_unpack_u64(e, &tmp2, NULL))
618 rules->rlimits.limits[a].rlim_max = tmp2;
620 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
622 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
632 static bool unpack_perm(struct aa_ext *e, u32 version, struct aa_perms *perm)
637 return aa_unpack_u32(e, &perm->allow, NULL) &&
638 aa_unpack_u32(e, &perm->allow, NULL) &&
639 aa_unpack_u32(e, &perm->deny, NULL) &&
640 aa_unpack_u32(e, &perm->subtree, NULL) &&
641 aa_unpack_u32(e, &perm->cond, NULL) &&
642 aa_unpack_u32(e, &perm->kill, NULL) &&
643 aa_unpack_u32(e, &perm->complain, NULL) &&
644 aa_unpack_u32(e, &perm->prompt, NULL) &&
645 aa_unpack_u32(e, &perm->audit, NULL) &&
646 aa_unpack_u32(e, &perm->quiet, NULL) &&
647 aa_unpack_u32(e, &perm->hide, NULL) &&
648 aa_unpack_u32(e, &perm->xindex, NULL) &&
649 aa_unpack_u32(e, &perm->tag, NULL) &&
650 aa_unpack_u32(e, &perm->label, NULL);
653 static ssize_t unpack_perms_table(struct aa_ext *e, struct aa_perms **perms)
660 * policy perms are optional, in which case perms are embedded
661 * in the dfa accept table
663 if (aa_unpack_nameX(e, AA_STRUCT, "perms")) {
667 if (!aa_unpack_u32(e, &version, "version"))
669 if (!aa_unpack_array(e, NULL, &size))
671 *perms = kcalloc(size, sizeof(struct aa_perms), GFP_KERNEL);
674 for (i = 0; i < size; i++) {
675 if (!unpack_perm(e, version, &(*perms)[i]))
678 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
680 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
694 static int unpack_pdb(struct aa_ext *e, struct aa_policydb *policy,
695 bool required_dfa, bool required_trans,
699 int i, flags, error = -EPROTO;
702 size = unpack_perms_table(e, &policy->perms);
705 policy->perms = NULL;
706 *info = "failed to unpack - perms";
712 /* perms table present accept is index */
713 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
715 /* packed perms in accept1 and accept2 */
716 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
717 TO_ACCEPT2_FLAG(YYTD_DATA32);
720 policy->dfa = unpack_dfa(e, flags);
721 if (IS_ERR(policy->dfa)) {
722 error = PTR_ERR(policy->dfa);
724 *info = "failed to unpack - dfa";
726 } else if (!policy->dfa) {
728 *info = "missing required dfa";
735 * only unpack the following if a dfa is present
737 * sadly start was given different names for file and policydb
738 * but since it is optional we can try both
740 if (!aa_unpack_u32(e, &policy->start[0], "start"))
741 /* default start state */
742 policy->start[0] = DFA_START;
743 if (!aa_unpack_u32(e, &policy->start[AA_CLASS_FILE], "dfa_start")) {
744 /* default start state for xmatch and file dfa */
745 policy->start[AA_CLASS_FILE] = DFA_START;
746 } /* setup class index */
747 for (i = AA_CLASS_FILE + 1; i <= AA_CLASS_LAST; i++) {
748 policy->start[i] = aa_dfa_next(policy->dfa, policy->start[0],
751 if (!unpack_trans_table(e, &policy->trans) && required_trans) {
752 *info = "failed to unpack profile transition table";
756 /* TODO: move compat mapping here, requires dfa merging first */
757 /* TODO: move verify here, it has to be done after compat mappings */
766 static u32 strhash(const void *data, u32 len, u32 seed)
768 const char * const *key = data;
770 return jhash(*key, strlen(*key), seed);
773 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
775 const struct aa_data *data = obj;
776 const char * const *key = arg->key;
778 return strcmp(data->key, *key);
782 * unpack_profile - unpack a serialized profile
783 * @e: serialized data extent information (NOT NULL)
784 * @ns_name: pointer of newly allocated copy of %NULL in case of error
786 * NOTE: unpack profile sets audit struct if there is a failure
788 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
790 struct aa_ruleset *rules;
791 struct aa_profile *profile = NULL;
792 const char *tmpname, *tmpns = NULL, *name = NULL;
793 const char *info = "failed to unpack profile";
795 struct rhashtable_params params = { 0 };
797 struct aa_data *data;
804 /* check that we have the right struct being passed */
805 if (!aa_unpack_nameX(e, AA_STRUCT, "profile"))
807 if (!aa_unpack_str(e, &name, NULL))
812 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
814 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
816 info = "out of memory";
823 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
825 info = "out of memory";
829 rules = list_first_entry(&profile->rules, typeof(*rules), list);
831 /* profile renaming is optional */
832 (void) aa_unpack_str(e, &profile->rename, "rename");
834 /* attachment string is optional */
835 (void) aa_unpack_str(e, &profile->attach.xmatch_str, "attach");
837 /* xmatch is optional and may be NULL */
838 error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
844 /* neither xmatch_len not xmatch_perms are optional if xmatch is set */
845 if (profile->attach.xmatch.dfa) {
846 if (!aa_unpack_u32(e, &tmp, NULL)) {
847 info = "missing xmatch len";
850 profile->attach.xmatch_len = tmp;
851 profile->attach.xmatch.start[AA_CLASS_XMATCH] = DFA_START;
852 error = aa_compat_map_xmatch(&profile->attach.xmatch);
854 info = "failed to convert xmatch permission table";
859 /* disconnected attachment string is optional */
860 (void) aa_unpack_str(e, &profile->disconnected, "disconnected");
862 /* per profile debug flags (complain, audit) */
863 if (!aa_unpack_nameX(e, AA_STRUCT, "flags")) {
864 info = "profile missing flags";
867 info = "failed to unpack profile flags";
868 if (!aa_unpack_u32(e, &tmp, NULL))
870 if (tmp & PACKED_FLAG_HAT)
871 profile->label.flags |= FLAG_HAT;
872 if (tmp & PACKED_FLAG_DEBUG1)
873 profile->label.flags |= FLAG_DEBUG1;
874 if (tmp & PACKED_FLAG_DEBUG2)
875 profile->label.flags |= FLAG_DEBUG2;
876 if (!aa_unpack_u32(e, &tmp, NULL))
878 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG)) {
879 profile->mode = APPARMOR_COMPLAIN;
880 } else if (tmp == PACKED_MODE_ENFORCE) {
881 profile->mode = APPARMOR_ENFORCE;
882 } else if (tmp == PACKED_MODE_KILL) {
883 profile->mode = APPARMOR_KILL;
884 } else if (tmp == PACKED_MODE_UNCONFINED) {
885 profile->mode = APPARMOR_UNCONFINED;
886 profile->label.flags |= FLAG_UNCONFINED;
887 } else if (tmp == PACKED_MODE_USER) {
888 profile->mode = APPARMOR_USER;
892 if (!aa_unpack_u32(e, &tmp, NULL))
895 profile->audit = AUDIT_ALL;
897 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
900 /* path_flags is optional */
901 if (aa_unpack_u32(e, &profile->path_flags, "path_flags"))
902 profile->path_flags |= profile->label.flags &
903 PATH_MEDIATE_DELETED;
905 /* set a default value if path_flags field is not present */
906 profile->path_flags = PATH_MEDIATE_DELETED;
908 info = "failed to unpack profile capabilities";
909 if (!aa_unpack_u32(e, &(rules->caps.allow.cap[0]), NULL))
911 if (!aa_unpack_u32(e, &(rules->caps.audit.cap[0]), NULL))
913 if (!aa_unpack_u32(e, &(rules->caps.quiet.cap[0]), NULL))
915 if (!aa_unpack_u32(e, &tmpcap.cap[0], NULL))
918 info = "failed to unpack upper profile capabilities";
919 if (aa_unpack_nameX(e, AA_STRUCT, "caps64")) {
920 /* optional upper half of 64 bit caps */
921 if (!aa_unpack_u32(e, &(rules->caps.allow.cap[1]), NULL))
923 if (!aa_unpack_u32(e, &(rules->caps.audit.cap[1]), NULL))
925 if (!aa_unpack_u32(e, &(rules->caps.quiet.cap[1]), NULL))
927 if (!aa_unpack_u32(e, &(tmpcap.cap[1]), NULL))
929 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
933 info = "failed to unpack extended profile capabilities";
934 if (aa_unpack_nameX(e, AA_STRUCT, "capsx")) {
935 /* optional extended caps mediation mask */
936 if (!aa_unpack_u32(e, &(rules->caps.extended.cap[0]), NULL))
938 if (!aa_unpack_u32(e, &(rules->caps.extended.cap[1]), NULL))
940 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
944 if (!unpack_xattrs(e, profile)) {
945 info = "failed to unpack profile xattrs";
949 if (!unpack_rlimits(e, rules)) {
950 info = "failed to unpack profile rlimits";
954 if (!unpack_secmark(e, rules)) {
955 info = "failed to unpack profile secmark rules";
959 if (aa_unpack_nameX(e, AA_STRUCT, "policydb")) {
960 /* generic policy dfa - optional and may be NULL */
961 info = "failed to unpack policydb";
962 error = unpack_pdb(e, &rules->policy, true, false,
966 /* Fixup: drop when we get rid of start array */
967 if (aa_dfa_next(rules->policy.dfa, rules->policy.start[0],
969 rules->policy.start[AA_CLASS_FILE] =
970 aa_dfa_next(rules->policy.dfa,
971 rules->policy.start[0],
973 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
975 error = aa_compat_map_policy(&rules->policy, e->version);
977 info = "failed to remap policydb permission table";
981 rules->policy.dfa = aa_get_dfa(nulldfa);
984 error = unpack_pdb(e, &rules->file, false, true, &info);
987 } else if (rules->file.dfa) {
988 error = aa_compat_map_file(&rules->file);
990 info = "failed to remap file permission table";
993 } else if (rules->policy.dfa &&
994 rules->policy.start[AA_CLASS_FILE]) {
995 rules->file.dfa = aa_get_dfa(rules->policy.dfa);
996 rules->file.start[AA_CLASS_FILE] = rules->policy.start[AA_CLASS_FILE];
998 rules->file.dfa = aa_get_dfa(nulldfa);
1001 if (aa_unpack_nameX(e, AA_STRUCT, "data")) {
1002 info = "out of memory";
1003 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
1004 if (!profile->data) {
1008 params.nelem_hint = 3;
1009 params.key_len = sizeof(void *);
1010 params.key_offset = offsetof(struct aa_data, key);
1011 params.head_offset = offsetof(struct aa_data, head);
1012 params.hashfn = strhash;
1013 params.obj_cmpfn = datacmp;
1015 if (rhashtable_init(profile->data, ¶ms)) {
1016 info = "failed to init key, value hash table";
1020 while (aa_unpack_strdup(e, &key, NULL)) {
1021 data = kzalloc(sizeof(*data), GFP_KERNEL);
1023 kfree_sensitive(key);
1029 data->size = aa_unpack_blob(e, &data->data, NULL);
1030 data->data = kvmemdup(data->data, data->size);
1031 if (data->size && !data->data) {
1032 kfree_sensitive(data->key);
1033 kfree_sensitive(data);
1038 rhashtable_insert_fast(profile->data, &data->head,
1042 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1043 info = "failed to unpack end of key, value data table";
1048 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1049 info = "failed to unpack end of profile";
1057 /* default error covers most cases */
1067 audit_iface(profile, NULL, name, info, e, error);
1068 aa_free_profile(profile);
1070 return ERR_PTR(error);
1074 * verify_header - unpack serialized stream header
1075 * @e: serialized data read head (NOT NULL)
1076 * @required: whether the header is required or optional
1077 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
1079 * Returns: error or 0 if header is good
1081 static int verify_header(struct aa_ext *e, int required, const char **ns)
1083 int error = -EPROTONOSUPPORT;
1084 const char *name = NULL;
1087 /* get the interface version */
1088 if (!aa_unpack_u32(e, &e->version, "version")) {
1090 audit_iface(NULL, NULL, NULL, "invalid profile format",
1096 /* Check that the interface version is currently supported.
1097 * if not specified use previous version
1098 * Mask off everything that is not kernel abi version
1100 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1101 audit_iface(NULL, NULL, NULL, "unsupported interface version",
1106 /* read the namespace if present */
1107 if (aa_unpack_str(e, &name, "namespace")) {
1108 if (*name == '\0') {
1109 audit_iface(NULL, NULL, NULL, "invalid namespace name",
1113 if (*ns && strcmp(*ns, name)) {
1114 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1117 *ns = kstrdup(name, GFP_KERNEL);
1126 static bool verify_xindex(int xindex, int table_size)
1129 xtype = xindex & AA_X_TYPE_MASK;
1130 index = xindex & AA_X_INDEX_MASK;
1131 if (xtype == AA_X_TABLE && index >= table_size)
1136 /* verify dfa xindexes are in range of transition tables */
1137 static bool verify_dfa_xindex(struct aa_dfa *dfa, int table_size)
1140 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1141 if (!verify_xindex(ACCEPT_TABLE(dfa)[i], table_size))
1147 static bool verify_perm(struct aa_perms *perm)
1149 /* TODO: allow option to just force the perms into a valid state */
1150 if (perm->allow & perm->deny)
1152 if (perm->subtree & ~perm->allow)
1154 if (perm->cond & (perm->allow | perm->deny))
1156 if (perm->kill & perm->allow)
1158 if (perm->complain & (perm->allow | perm->deny))
1160 if (perm->prompt & (perm->allow | perm->deny))
1162 if (perm->complain & perm->prompt)
1164 if (perm->hide & perm->allow)
1170 static bool verify_perms(struct aa_policydb *pdb)
1174 for (i = 0; i < pdb->size; i++) {
1175 if (!verify_perm(&pdb->perms[i]))
1177 /* verify indexes into str table */
1178 if (pdb->perms[i].xindex >= pdb->trans.size)
1180 if (pdb->perms[i].tag >= pdb->trans.size)
1182 if (pdb->perms[i].label >= pdb->trans.size)
1190 * verify_profile - Do post unpack analysis to verify profile consistency
1191 * @profile: profile to verify (NOT NULL)
1193 * Returns: 0 if passes verification else error
1195 * This verification is post any unpack mapping or changes
1197 static int verify_profile(struct aa_profile *profile)
1199 struct aa_ruleset *rules = list_first_entry(&profile->rules,
1200 typeof(*rules), list);
1204 if ((rules->file.dfa && !verify_dfa_xindex(rules->file.dfa,
1205 rules->file.trans.size)) ||
1206 (rules->policy.dfa &&
1207 !verify_dfa_xindex(rules->policy.dfa, rules->policy.trans.size))) {
1208 audit_iface(profile, NULL, NULL,
1209 "Unpack: Invalid named transition", NULL, -EPROTO);
1213 if (!verify_perms(&rules->file)) {
1214 audit_iface(profile, NULL, NULL,
1215 "Unpack: Invalid perm index", NULL, -EPROTO);
1218 if (!verify_perms(&rules->policy)) {
1219 audit_iface(profile, NULL, NULL,
1220 "Unpack: Invalid perm index", NULL, -EPROTO);
1223 if (!verify_perms(&profile->attach.xmatch)) {
1224 audit_iface(profile, NULL, NULL,
1225 "Unpack: Invalid perm index", NULL, -EPROTO);
1232 void aa_load_ent_free(struct aa_load_ent *ent)
1235 aa_put_profile(ent->rename);
1236 aa_put_profile(ent->old);
1237 aa_put_profile(ent->new);
1238 kfree(ent->ns_name);
1239 kfree_sensitive(ent);
1243 struct aa_load_ent *aa_load_ent_alloc(void)
1245 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1247 INIT_LIST_HEAD(&ent->list);
1251 static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
1253 #ifdef CONFIG_SECURITY_APPARMOR_EXPORT_BINARY
1254 const zstd_parameters params =
1255 zstd_get_params(aa_g_rawdata_compression_level, slen);
1256 const size_t wksp_len = zstd_cctx_workspace_bound(¶ms.cParams);
1258 zstd_cctx *ctx = NULL;
1259 size_t out_len = zstd_compress_bound(slen);
1263 out = kvzalloc(out_len, GFP_KERNEL);
1269 wksp = kvzalloc(wksp_len, GFP_KERNEL);
1275 ctx = zstd_init_cctx(wksp, wksp_len);
1281 out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, ¶ms);
1282 if (zstd_is_error(out_len) || out_len >= slen) {
1287 if (is_vmalloc_addr(out)) {
1288 *dst = kvzalloc(out_len, GFP_KERNEL);
1290 memcpy(*dst, out, out_len);
1296 * If the staging buffer was kmalloc'd, then using krealloc is
1297 * probably going to be faster. The destination buffer will
1298 * always be smaller, so it's just shrunk, avoiding a memcpy
1300 *dst = krealloc(out, out_len, GFP_KERNEL);
1324 static int compress_loaddata(struct aa_loaddata *data)
1326 AA_BUG(data->compressed_size > 0);
1329 * Shortcut the no compression case, else we increase the amount of
1330 * storage required by a small amount
1332 if (aa_g_rawdata_compression_level != 0) {
1333 void *udata = data->data;
1334 int error = compress_zstd(udata, data->size, &data->data,
1335 &data->compressed_size);
1337 data->compressed_size = data->size;
1340 if (udata != data->data)
1343 data->compressed_size = data->size;
1349 * aa_unpack - unpack packed binary profile(s) data loaded from user space
1350 * @udata: user data copied to kmem (NOT NULL)
1351 * @lh: list to place unpacked profiles in a aa_repl_ws
1352 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1354 * Unpack user data and return refcounted allocated profile(s) stored in
1355 * @lh in order of discovery, with the list chain stored in base.list
1358 * Returns: profile(s) on @lh else error pointer if fails to unpack
1360 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1363 struct aa_load_ent *tmp, *ent;
1364 struct aa_profile *profile = NULL;
1365 char *ns_name = NULL;
1368 .start = udata->data,
1369 .end = udata->data + udata->size,
1374 while (e.pos < e.end) {
1376 error = verify_header(&e, e.pos == e.start, ns);
1381 profile = unpack_profile(&e, &ns_name);
1382 if (IS_ERR(profile)) {
1383 error = PTR_ERR(profile);
1387 error = verify_profile(profile);
1391 if (aa_g_hash_policy)
1392 error = aa_calc_profile_hash(profile, e.version, start,
1397 ent = aa_load_ent_alloc();
1404 ent->ns_name = ns_name;
1406 list_add_tail(&ent->list, lh);
1408 udata->abi = e.version & K_ABI_MASK;
1409 if (aa_g_hash_policy) {
1410 udata->hash = aa_calc_hash(udata->data, udata->size);
1411 if (IS_ERR(udata->hash)) {
1412 error = PTR_ERR(udata->hash);
1418 if (aa_g_export_binary) {
1419 error = compress_loaddata(udata);
1427 aa_put_profile(profile);
1430 list_for_each_entry_safe(ent, tmp, lh, list) {
1431 list_del_init(&ent->list);
1432 aa_load_ent_free(ent);