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 <linux/ctype.h>
18 #include <linux/errno.h>
19 #include <linux/zstd.h>
21 #include "include/apparmor.h"
22 #include "include/audit.h"
23 #include "include/cred.h"
24 #include "include/crypto.h"
25 #include "include/file.h"
26 #include "include/match.h"
27 #include "include/path.h"
28 #include "include/policy.h"
29 #include "include/policy_unpack.h"
30 #include "include/policy_compat.h"
34 * The AppArmor interface treats data as a type byte followed by the
35 * actual data. The interface has the notion of a named entry
36 * which has a name (AA_NAME typecode followed by name string) followed by
37 * the entries typecode and data. Named types allow for optional
38 * elements and extensions to be added and tested for without breaking
39 * backwards compatibility.
47 AA_NAME, /* same as string except it is items name */
59 * aa_ext is the read of the buffer containing the serialized profile. The
60 * data is copied into a kernel buffer in apparmorfs and then handed off to
61 * the unpack routines.
66 void *pos; /* pointer to current position in the buffer */
75 /* audit callback for unpack fields */
76 static void audit_cb(struct audit_buffer *ab, void *va)
78 struct common_audit_data *sa = va;
80 if (aad(sa)->iface.ns) {
81 audit_log_format(ab, " ns=");
82 audit_log_untrustedstring(ab, aad(sa)->iface.ns);
85 audit_log_format(ab, " name=");
86 audit_log_untrustedstring(ab, aad(sa)->name);
88 if (aad(sa)->iface.pos)
89 audit_log_format(ab, " offset=%ld", aad(sa)->iface.pos);
93 * audit_iface - do audit message for policy unpacking/load/replace/remove
94 * @new: profile if it has been allocated (MAYBE NULL)
95 * @ns_name: name of the ns the profile is to be loaded to (MAY BE NULL)
96 * @name: name of the profile being manipulated (MAYBE NULL)
97 * @info: any extra info about the failure (MAYBE NULL)
98 * @e: buffer position info
101 * Returns: %0 or error
103 static int audit_iface(struct aa_profile *new, const char *ns_name,
104 const char *name, const char *info, struct aa_ext *e,
107 struct aa_profile *profile = labels_profile(aa_current_raw_label());
108 DEFINE_AUDIT_DATA(sa, LSM_AUDIT_DATA_NONE, AA_CLASS_NONE, NULL);
110 aad(&sa)->iface.pos = e->pos - e->start;
111 aad(&sa)->iface.ns = ns_name;
113 aad(&sa)->name = new->base.hname;
115 aad(&sa)->name = name;
116 aad(&sa)->info = info;
117 aad(&sa)->error = error;
119 return aa_audit(AUDIT_APPARMOR_STATUS, profile, &sa, audit_cb);
122 void __aa_loaddata_update(struct aa_loaddata *data, long revision)
126 AA_BUG(!mutex_is_locked(&data->ns->lock));
127 AA_BUG(data->revision > revision);
129 data->revision = revision;
130 if ((data->dents[AAFS_LOADDATA_REVISION])) {
131 d_inode(data->dents[AAFS_LOADDATA_DIR])->i_mtime =
132 current_time(d_inode(data->dents[AAFS_LOADDATA_DIR]));
133 d_inode(data->dents[AAFS_LOADDATA_REVISION])->i_mtime =
134 current_time(d_inode(data->dents[AAFS_LOADDATA_REVISION]));
138 bool aa_rawdata_eq(struct aa_loaddata *l, struct aa_loaddata *r)
140 if (l->size != r->size)
142 if (l->compressed_size != r->compressed_size)
144 if (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0)
146 return memcmp(l->data, r->data, r->compressed_size ?: r->size) == 0;
150 * need to take the ns mutex lock which is NOT safe most places that
151 * put_loaddata is called, so we have to delay freeing it
153 static void do_loaddata_free(struct work_struct *work)
155 struct aa_loaddata *d = container_of(work, struct aa_loaddata, work);
156 struct aa_ns *ns = aa_get_ns(d->ns);
159 mutex_lock_nested(&ns->lock, ns->level);
160 __aa_fs_remove_rawdata(d);
161 mutex_unlock(&ns->lock);
165 kfree_sensitive(d->hash);
166 kfree_sensitive(d->name);
171 void aa_loaddata_kref(struct kref *kref)
173 struct aa_loaddata *d = container_of(kref, struct aa_loaddata, count);
176 INIT_WORK(&d->work, do_loaddata_free);
177 schedule_work(&d->work);
181 struct aa_loaddata *aa_loaddata_alloc(size_t size)
183 struct aa_loaddata *d;
185 d = kzalloc(sizeof(*d), GFP_KERNEL);
187 return ERR_PTR(-ENOMEM);
188 d->data = kvzalloc(size, GFP_KERNEL);
191 return ERR_PTR(-ENOMEM);
193 kref_init(&d->count);
194 INIT_LIST_HEAD(&d->list);
199 /* test if read will be in packed data bounds */
200 static bool inbounds(struct aa_ext *e, size_t size)
202 return (size <= e->end - e->pos);
205 static void *kvmemdup(const void *src, size_t len)
207 void *p = kvmalloc(len, GFP_KERNEL);
215 * unpack_u16_chunk - test and do bounds checking for a u16 size based chunk
216 * @e: serialized data read head (NOT NULL)
217 * @chunk: start address for chunk of data (NOT NULL)
219 * Returns: the size of chunk found with the read head at the end of the chunk.
221 static size_t unpack_u16_chunk(struct aa_ext *e, char **chunk)
226 if (!inbounds(e, sizeof(u16)))
228 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
229 e->pos += sizeof(__le16);
230 if (!inbounds(e, size))
241 /* unpack control byte */
242 static bool unpack_X(struct aa_ext *e, enum aa_code code)
246 if (*(u8 *) e->pos != code)
253 * unpack_nameX - check is the next element is of type X with a name of @name
254 * @e: serialized data extent information (NOT NULL)
256 * @name: name to match to the serialized element. (MAYBE NULL)
258 * check that the next serialized data element is of type X and has a tag
259 * name @name. If @name is specified then there must be a matching
260 * name element in the stream. If @name is NULL any name element will be
261 * skipped and only the typecode will be tested.
263 * Returns true on success (both type code and name tests match) and the read
264 * head is advanced past the headers
266 * Returns: false if either match fails, the read head does not move
268 static bool unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
271 * May need to reset pos if name or type doesn't match
275 * Check for presence of a tagname, and if present name size
276 * AA_NAME tag value is a u16.
278 if (unpack_X(e, AA_NAME)) {
280 size_t size = unpack_u16_chunk(e, &tag);
281 /* if a name is specified it must match. otherwise skip tag */
282 if (name && (!size || tag[size-1] != '\0' || strcmp(name, tag)))
285 /* if a name is specified and there is no name tag fail */
289 /* now check if type code matches */
290 if (unpack_X(e, code))
298 static bool unpack_u8(struct aa_ext *e, u8 *data, const char *name)
302 if (unpack_nameX(e, AA_U8, name)) {
303 if (!inbounds(e, sizeof(u8)))
306 *data = *((u8 *)e->pos);
307 e->pos += sizeof(u8);
316 static bool unpack_u32(struct aa_ext *e, u32 *data, const char *name)
320 if (unpack_nameX(e, AA_U32, name)) {
321 if (!inbounds(e, sizeof(u32)))
324 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
325 e->pos += sizeof(u32);
334 static bool unpack_u64(struct aa_ext *e, u64 *data, const char *name)
338 if (unpack_nameX(e, AA_U64, name)) {
339 if (!inbounds(e, sizeof(u64)))
342 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
343 e->pos += sizeof(u64);
352 static tri unpack_array(struct aa_ext *e, const char *name, u16 *size)
356 if (unpack_nameX(e, AA_ARRAY, name)) {
357 if (!inbounds(e, sizeof(u16)))
359 *size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
360 e->pos += sizeof(u16);
370 static size_t unpack_blob(struct aa_ext *e, char **blob, const char *name)
374 if (unpack_nameX(e, AA_BLOB, name)) {
376 if (!inbounds(e, sizeof(u32)))
378 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
379 e->pos += sizeof(u32);
380 if (inbounds(e, (size_t) size)) {
392 static int unpack_str(struct aa_ext *e, const char **string, const char *name)
398 if (unpack_nameX(e, AA_STRING, name)) {
399 size = unpack_u16_chunk(e, &src_str);
401 /* strings are null terminated, length is size - 1 */
402 if (src_str[size - 1] != 0)
415 static int unpack_strdup(struct aa_ext *e, char **string, const char *name)
419 int res = unpack_str(e, &tmp, name);
425 *string = kmemdup(tmp, res, GFP_KERNEL);
436 * unpack_dfa - unpack a file rule dfa
437 * @e: serialized data extent information (NOT NULL)
438 * @flags: dfa flags to check
440 * returns dfa or ERR_PTR or NULL if no dfa
442 static struct aa_dfa *unpack_dfa(struct aa_ext *e, int flags)
446 struct aa_dfa *dfa = NULL;
448 size = unpack_blob(e, &blob, "aadfa");
451 * The dfa is aligned with in the blob to 8 bytes
452 * from the beginning of the stream.
453 * alignment adjust needed by dfa unpack
455 size_t sz = blob - (char *) e->start -
456 ((e->pos - e->start) & 7);
457 size_t pad = ALIGN(sz, 8) - sz;
458 if (aa_g_paranoid_load)
459 flags |= DFA_FLAG_VERIFY_STATES;
460 dfa = aa_dfa_unpack(blob + pad, size - pad, flags);
471 * unpack_trans_table - unpack a profile transition table
472 * @e: serialized data extent information (NOT NULL)
473 * @table: str table to unpack to (NOT NULL)
475 * Returns: true if table successfully unpacked or not present
477 static bool unpack_trans_table(struct aa_ext *e, struct aa_str_table *strs)
479 void *saved_pos = e->pos;
482 /* exec table is optional */
483 if (unpack_nameX(e, AA_STRUCT, "xtable")) {
487 if (unpack_array(e, NULL, &size) != TRI_TRUE)
489 * Note: index into trans table array is a max
490 * of 2^24, but unpack array can only unpack
491 * an array of 2^16 in size atm so no need
492 * for size check here
495 table = kcalloc(size, sizeof(char *), GFP_KERNEL);
499 for (i = 0; i < size; i++) {
501 int c, j, pos, size2 = unpack_strdup(e, &str, NULL);
502 /* unpack_strdup verifies that the last character is
503 * null termination byte.
508 /* verify that name doesn't start with space */
512 /* count internal # of internal \0 */
513 for (c = j = 0; j < size2 - 1; j++) {
520 /* first character after : must be valid */
523 /* beginning with : requires an embedded \0,
524 * verify that exactly 1 internal \0 exists
525 * trailing \0 already verified by unpack_strdup
527 * convert \0 back to : for label_parse
534 /* fail - all other cases with embedded \0 */
537 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
539 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
548 kfree_sensitive(table);
553 static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
557 if (unpack_nameX(e, AA_STRUCT, "xattrs")) {
561 if (unpack_array(e, NULL, &size) != TRI_TRUE)
563 profile->attach.xattr_count = size;
564 profile->attach.xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
565 if (!profile->attach.xattrs)
567 for (i = 0; i < size; i++) {
568 if (!unpack_strdup(e, &profile->attach.xattrs[i], NULL))
571 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
573 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
584 static bool unpack_secmark(struct aa_ext *e, struct aa_ruleset *rules)
590 if (unpack_nameX(e, AA_STRUCT, "secmark")) {
591 if (unpack_array(e, NULL, &size) != TRI_TRUE)
594 rules->secmark = kcalloc(size, sizeof(struct aa_secmark),
599 rules->secmark_count = size;
601 for (i = 0; i < size; i++) {
602 if (!unpack_u8(e, &rules->secmark[i].audit, NULL))
604 if (!unpack_u8(e, &rules->secmark[i].deny, NULL))
606 if (!unpack_strdup(e, &rules->secmark[i].label, NULL))
609 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
611 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
618 if (rules->secmark) {
619 for (i = 0; i < size; i++)
620 kfree(rules->secmark[i].label);
621 kfree(rules->secmark);
622 rules->secmark_count = 0;
623 rules->secmark = NULL;
630 static bool unpack_rlimits(struct aa_ext *e, struct aa_ruleset *rules)
634 /* rlimits are optional */
635 if (unpack_nameX(e, AA_STRUCT, "rlimits")) {
639 if (!unpack_u32(e, &tmp, NULL))
641 rules->rlimits.mask = tmp;
643 if (unpack_array(e, NULL, &size) != TRI_TRUE ||
646 for (i = 0; i < size; i++) {
648 int a = aa_map_resource(i);
649 if (!unpack_u64(e, &tmp2, NULL))
651 rules->rlimits.limits[a].rlim_max = tmp2;
653 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
655 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
665 static bool unpack_perm(struct aa_ext *e, u32 version, struct aa_perms *perm)
672 res = unpack_u32(e, &perm->allow, NULL);
673 res = res && unpack_u32(e, &perm->allow, NULL);
674 res = res && unpack_u32(e, &perm->deny, NULL);
675 res = res && unpack_u32(e, &perm->subtree, NULL);
676 res = res && unpack_u32(e, &perm->cond, NULL);
677 res = res && unpack_u32(e, &perm->kill, NULL);
678 res = res && unpack_u32(e, &perm->complain, NULL);
679 res = res && unpack_u32(e, &perm->prompt, NULL);
680 res = res && unpack_u32(e, &perm->audit, NULL);
681 res = res && unpack_u32(e, &perm->quiet, NULL);
682 res = res && unpack_u32(e, &perm->hide, NULL);
683 res = res && unpack_u32(e, &perm->xindex, NULL);
684 res = res && unpack_u32(e, &perm->tag, NULL);
685 res = res && unpack_u32(e, &perm->label, NULL);
690 static ssize_t unpack_perms_table(struct aa_ext *e, struct aa_perms **perms)
697 * policy perms are optional, in which case perms are embedded
698 * in the dfa accept table
700 if (unpack_nameX(e, AA_STRUCT, "perms")) {
704 if (!unpack_u32(e, &version, "version"))
706 if (unpack_array(e, NULL, &size) != TRI_TRUE)
708 *perms = kcalloc(size, sizeof(struct aa_perms), GFP_KERNEL);
711 for (i = 0; i < size; i++) {
712 if (!unpack_perm(e, version, &(*perms)[i]))
715 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
717 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
731 static int unpack_pdb(struct aa_ext *e, struct aa_policydb *policy,
732 bool required_dfa, bool required_trans,
736 int i, flags, error = -EPROTO;
739 size = unpack_perms_table(e, &policy->perms);
742 policy->perms = NULL;
743 *info = "failed to unpack - perms";
749 /* perms table present accept is index */
750 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
752 /* packed perms in accept1 and accept2 */
753 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
754 TO_ACCEPT2_FLAG(YYTD_DATA32);
757 policy->dfa = unpack_dfa(e, flags);
758 if (IS_ERR(policy->dfa)) {
759 error = PTR_ERR(policy->dfa);
761 *info = "failed to unpack - dfa";
763 } else if (!policy->dfa) {
765 *info = "missing required dfa";
772 * only unpack the following if a dfa is present
774 * sadly start was given different names for file and policydb
775 * but since it is optional we can try both
777 if (!unpack_u32(e, &policy->start[0], "start"))
778 /* default start state */
779 policy->start[0] = DFA_START;
780 if (!unpack_u32(e, &policy->start[AA_CLASS_FILE], "dfa_start")) {
781 /* default start state for xmatch and file dfa */
782 policy->start[AA_CLASS_FILE] = DFA_START;
783 } /* setup class index */
784 for (i = AA_CLASS_FILE + 1; i <= AA_CLASS_LAST; i++) {
785 policy->start[i] = aa_dfa_next(policy->dfa, policy->start[0],
788 if (!unpack_trans_table(e, &policy->trans) && required_trans) {
789 *info = "failed to unpack profile transition table";
793 /* TODO: move compat mapping here, requires dfa merging first */
794 /* TODO: move verify here, it has to be done after compat mappings */
803 static u32 strhash(const void *data, u32 len, u32 seed)
805 const char * const *key = data;
807 return jhash(*key, strlen(*key), seed);
810 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
812 const struct aa_data *data = obj;
813 const char * const *key = arg->key;
815 return strcmp(data->key, *key);
819 * unpack_profile - unpack a serialized profile
820 * @e: serialized data extent information (NOT NULL)
821 * @ns_name: pointer of newly allocated copy of %NULL in case of error
823 * NOTE: unpack profile sets audit struct if there is a failure
825 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
827 struct aa_ruleset *rules;
828 struct aa_profile *profile = NULL;
829 const char *tmpname, *tmpns = NULL, *name = NULL;
830 const char *info = "failed to unpack profile";
832 struct rhashtable_params params = { 0 };
834 struct aa_data *data;
841 /* check that we have the right struct being passed */
842 if (!unpack_nameX(e, AA_STRUCT, "profile"))
844 if (!unpack_str(e, &name, NULL))
849 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
851 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
853 info = "out of memory";
860 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
862 info = "out of memory";
866 rules = list_first_entry(&profile->rules, typeof(*rules), list);
868 /* profile renaming is optional */
869 (void) unpack_str(e, &profile->rename, "rename");
871 /* attachment string is optional */
872 (void) unpack_str(e, &profile->attach.xmatch_str, "attach");
874 /* xmatch is optional and may be NULL */
875 error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
881 /* neither xmatch_len not xmatch_perms are optional if xmatch is set */
882 if (profile->attach.xmatch.dfa) {
883 if (!unpack_u32(e, &tmp, NULL)) {
884 info = "missing xmatch len";
887 profile->attach.xmatch_len = tmp;
888 profile->attach.xmatch.start[AA_CLASS_XMATCH] = DFA_START;
889 error = aa_compat_map_xmatch(&profile->attach.xmatch);
891 info = "failed to convert xmatch permission table";
896 /* disconnected attachment string is optional */
897 (void) unpack_str(e, &profile->disconnected, "disconnected");
899 /* per profile debug flags (complain, audit) */
900 if (!unpack_nameX(e, AA_STRUCT, "flags")) {
901 info = "profile missing flags";
904 info = "failed to unpack profile flags";
905 if (!unpack_u32(e, &tmp, NULL))
907 if (tmp & PACKED_FLAG_HAT)
908 profile->label.flags |= FLAG_HAT;
909 if (tmp & PACKED_FLAG_DEBUG1)
910 profile->label.flags |= FLAG_DEBUG1;
911 if (tmp & PACKED_FLAG_DEBUG2)
912 profile->label.flags |= FLAG_DEBUG2;
913 if (!unpack_u32(e, &tmp, NULL))
915 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG)) {
916 profile->mode = APPARMOR_COMPLAIN;
917 } else if (tmp == PACKED_MODE_ENFORCE) {
918 profile->mode = APPARMOR_ENFORCE;
919 } else if (tmp == PACKED_MODE_KILL) {
920 profile->mode = APPARMOR_KILL;
921 } else if (tmp == PACKED_MODE_UNCONFINED) {
922 profile->mode = APPARMOR_UNCONFINED;
923 profile->label.flags |= FLAG_UNCONFINED;
924 } else if (tmp == PACKED_MODE_USER) {
925 profile->mode = APPARMOR_USER;
929 if (!unpack_u32(e, &tmp, NULL))
932 profile->audit = AUDIT_ALL;
934 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
937 /* path_flags is optional */
938 if (unpack_u32(e, &profile->path_flags, "path_flags"))
939 profile->path_flags |= profile->label.flags &
940 PATH_MEDIATE_DELETED;
942 /* set a default value if path_flags field is not present */
943 profile->path_flags = PATH_MEDIATE_DELETED;
945 info = "failed to unpack profile capabilities";
946 if (!unpack_u32(e, &(rules->caps.allow.cap[0]), NULL))
948 if (!unpack_u32(e, &(rules->caps.audit.cap[0]), NULL))
950 if (!unpack_u32(e, &(rules->caps.quiet.cap[0]), NULL))
952 if (!unpack_u32(e, &tmpcap.cap[0], NULL))
955 info = "failed to unpack upper profile capabilities";
956 if (unpack_nameX(e, AA_STRUCT, "caps64")) {
957 /* optional upper half of 64 bit caps */
958 if (!unpack_u32(e, &(rules->caps.allow.cap[1]), NULL))
960 if (!unpack_u32(e, &(rules->caps.audit.cap[1]), NULL))
962 if (!unpack_u32(e, &(rules->caps.quiet.cap[1]), NULL))
964 if (!unpack_u32(e, &(tmpcap.cap[1]), NULL))
966 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
970 info = "failed to unpack extended profile capabilities";
971 if (unpack_nameX(e, AA_STRUCT, "capsx")) {
972 /* optional extended caps mediation mask */
973 if (!unpack_u32(e, &(rules->caps.extended.cap[0]), NULL))
975 if (!unpack_u32(e, &(rules->caps.extended.cap[1]), NULL))
977 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
981 if (!unpack_xattrs(e, profile)) {
982 info = "failed to unpack profile xattrs";
986 if (!unpack_rlimits(e, rules)) {
987 info = "failed to unpack profile rlimits";
991 if (!unpack_secmark(e, rules)) {
992 info = "failed to unpack profile secmark rules";
996 if (unpack_nameX(e, AA_STRUCT, "policydb")) {
997 /* generic policy dfa - optional and may be NULL */
998 info = "failed to unpack policydb";
999 error = unpack_pdb(e, &rules->policy, true, false,
1003 /* Fixup: drop when we get rid of start array */
1004 if (aa_dfa_next(rules->policy.dfa, rules->policy.start[0],
1006 rules->policy.start[AA_CLASS_FILE] =
1007 aa_dfa_next(rules->policy.dfa,
1008 rules->policy.start[0],
1010 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
1012 error = aa_compat_map_policy(&rules->policy, e->version);
1014 info = "failed to remap policydb permission table";
1018 rules->policy.dfa = aa_get_dfa(nulldfa);
1020 /* get file rules */
1021 error = unpack_pdb(e, &rules->file, false, true, &info);
1024 } else if (rules->file.dfa) {
1025 error = aa_compat_map_file(&rules->file);
1027 info = "failed to remap file permission table";
1030 } else if (rules->policy.dfa &&
1031 rules->policy.start[AA_CLASS_FILE]) {
1032 rules->file.dfa = aa_get_dfa(rules->policy.dfa);
1033 rules->file.start[AA_CLASS_FILE] = rules->policy.start[AA_CLASS_FILE];
1035 rules->file.dfa = aa_get_dfa(nulldfa);
1038 if (unpack_nameX(e, AA_STRUCT, "data")) {
1039 info = "out of memory";
1040 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
1041 if (!profile->data) {
1045 params.nelem_hint = 3;
1046 params.key_len = sizeof(void *);
1047 params.key_offset = offsetof(struct aa_data, key);
1048 params.head_offset = offsetof(struct aa_data, head);
1049 params.hashfn = strhash;
1050 params.obj_cmpfn = datacmp;
1052 if (rhashtable_init(profile->data, ¶ms)) {
1053 info = "failed to init key, value hash table";
1057 while (unpack_strdup(e, &key, NULL)) {
1058 data = kzalloc(sizeof(*data), GFP_KERNEL);
1060 kfree_sensitive(key);
1066 data->size = unpack_blob(e, &data->data, NULL);
1067 data->data = kvmemdup(data->data, data->size);
1068 if (data->size && !data->data) {
1069 kfree_sensitive(data->key);
1070 kfree_sensitive(data);
1075 rhashtable_insert_fast(profile->data, &data->head,
1079 if (!unpack_nameX(e, AA_STRUCTEND, NULL)) {
1080 info = "failed to unpack end of key, value data table";
1085 if (!unpack_nameX(e, AA_STRUCTEND, NULL)) {
1086 info = "failed to unpack end of profile";
1094 /* default error covers most cases */
1104 audit_iface(profile, NULL, name, info, e, error);
1105 aa_free_profile(profile);
1107 return ERR_PTR(error);
1111 * verify_header - unpack serialized stream header
1112 * @e: serialized data read head (NOT NULL)
1113 * @required: whether the header is required or optional
1114 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
1116 * Returns: error or 0 if header is good
1118 static int verify_header(struct aa_ext *e, int required, const char **ns)
1120 int error = -EPROTONOSUPPORT;
1121 const char *name = NULL;
1124 /* get the interface version */
1125 if (!unpack_u32(e, &e->version, "version")) {
1127 audit_iface(NULL, NULL, NULL, "invalid profile format",
1133 /* Check that the interface version is currently supported.
1134 * if not specified use previous version
1135 * Mask off everything that is not kernel abi version
1137 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1138 audit_iface(NULL, NULL, NULL, "unsupported interface version",
1143 /* read the namespace if present */
1144 if (unpack_str(e, &name, "namespace")) {
1145 if (*name == '\0') {
1146 audit_iface(NULL, NULL, NULL, "invalid namespace name",
1150 if (*ns && strcmp(*ns, name)) {
1151 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1154 *ns = kstrdup(name, GFP_KERNEL);
1163 static bool verify_xindex(int xindex, int table_size)
1166 xtype = xindex & AA_X_TYPE_MASK;
1167 index = xindex & AA_X_INDEX_MASK;
1168 if (xtype == AA_X_TABLE && index >= table_size)
1173 /* verify dfa xindexes are in range of transition tables */
1174 static bool verify_dfa_xindex(struct aa_dfa *dfa, int table_size)
1177 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1178 if (!verify_xindex(ACCEPT_TABLE(dfa)[i], table_size))
1184 static bool verify_perm(struct aa_perms *perm)
1186 /* TODO: allow option to just force the perms into a valid state */
1187 if (perm->allow & perm->deny)
1189 if (perm->subtree & ~perm->allow)
1191 if (perm->cond & (perm->allow | perm->deny))
1193 if (perm->kill & perm->allow)
1195 if (perm->complain & (perm->allow | perm->deny))
1197 if (perm->prompt & (perm->allow | perm->deny))
1199 if (perm->complain & perm->prompt)
1201 if (perm->hide & perm->allow)
1207 static bool verify_perms(struct aa_policydb *pdb)
1211 for (i = 0; i < pdb->size; i++) {
1212 if (!verify_perm(&pdb->perms[i]))
1214 /* verify indexes into str table */
1215 if (pdb->perms[i].xindex >= pdb->trans.size)
1217 if (pdb->perms[i].tag >= pdb->trans.size)
1219 if (pdb->perms[i].label >= pdb->trans.size)
1227 * verify_profile - Do post unpack analysis to verify profile consistency
1228 * @profile: profile to verify (NOT NULL)
1230 * Returns: 0 if passes verification else error
1232 * This verification is post any unpack mapping or changes
1234 static int verify_profile(struct aa_profile *profile)
1236 struct aa_ruleset *rules = list_first_entry(&profile->rules,
1237 typeof(*rules), list);
1241 if ((rules->file.dfa && !verify_dfa_xindex(rules->file.dfa,
1242 rules->file.trans.size)) ||
1243 (rules->policy.dfa &&
1244 !verify_dfa_xindex(rules->policy.dfa, rules->policy.trans.size))) {
1245 audit_iface(profile, NULL, NULL,
1246 "Unpack: Invalid named transition", NULL, -EPROTO);
1250 if (!verify_perms(&rules->file)) {
1251 audit_iface(profile, NULL, NULL,
1252 "Unpack: Invalid perm index", NULL, -EPROTO);
1255 if (!verify_perms(&rules->policy)) {
1256 audit_iface(profile, NULL, NULL,
1257 "Unpack: Invalid perm index", NULL, -EPROTO);
1260 if (!verify_perms(&profile->attach.xmatch)) {
1261 audit_iface(profile, NULL, NULL,
1262 "Unpack: Invalid perm index", NULL, -EPROTO);
1269 void aa_load_ent_free(struct aa_load_ent *ent)
1272 aa_put_profile(ent->rename);
1273 aa_put_profile(ent->old);
1274 aa_put_profile(ent->new);
1275 kfree(ent->ns_name);
1276 kfree_sensitive(ent);
1280 struct aa_load_ent *aa_load_ent_alloc(void)
1282 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1284 INIT_LIST_HEAD(&ent->list);
1288 static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
1290 #ifdef CONFIG_SECURITY_APPARMOR_EXPORT_BINARY
1291 const zstd_parameters params =
1292 zstd_get_params(aa_g_rawdata_compression_level, slen);
1293 const size_t wksp_len = zstd_cctx_workspace_bound(¶ms.cParams);
1295 zstd_cctx *ctx = NULL;
1296 size_t out_len = zstd_compress_bound(slen);
1300 out = kvzalloc(out_len, GFP_KERNEL);
1306 wksp = kvzalloc(wksp_len, GFP_KERNEL);
1312 ctx = zstd_init_cctx(wksp, wksp_len);
1318 out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, ¶ms);
1319 if (zstd_is_error(out_len) || out_len >= slen) {
1324 if (is_vmalloc_addr(out)) {
1325 *dst = kvzalloc(out_len, GFP_KERNEL);
1327 memcpy(*dst, out, out_len);
1333 * If the staging buffer was kmalloc'd, then using krealloc is
1334 * probably going to be faster. The destination buffer will
1335 * always be smaller, so it's just shrunk, avoiding a memcpy
1337 *dst = krealloc(out, out_len, GFP_KERNEL);
1361 static int compress_loaddata(struct aa_loaddata *data)
1363 AA_BUG(data->compressed_size > 0);
1366 * Shortcut the no compression case, else we increase the amount of
1367 * storage required by a small amount
1369 if (aa_g_rawdata_compression_level != 0) {
1370 void *udata = data->data;
1371 int error = compress_zstd(udata, data->size, &data->data,
1372 &data->compressed_size);
1374 data->compressed_size = data->size;
1377 if (udata != data->data)
1380 data->compressed_size = data->size;
1386 * aa_unpack - unpack packed binary profile(s) data loaded from user space
1387 * @udata: user data copied to kmem (NOT NULL)
1388 * @lh: list to place unpacked profiles in a aa_repl_ws
1389 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1391 * Unpack user data and return refcounted allocated profile(s) stored in
1392 * @lh in order of discovery, with the list chain stored in base.list
1395 * Returns: profile(s) on @lh else error pointer if fails to unpack
1397 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1400 struct aa_load_ent *tmp, *ent;
1401 struct aa_profile *profile = NULL;
1402 char *ns_name = NULL;
1405 .start = udata->data,
1406 .end = udata->data + udata->size,
1411 while (e.pos < e.end) {
1413 error = verify_header(&e, e.pos == e.start, ns);
1418 profile = unpack_profile(&e, &ns_name);
1419 if (IS_ERR(profile)) {
1420 error = PTR_ERR(profile);
1424 error = verify_profile(profile);
1428 if (aa_g_hash_policy)
1429 error = aa_calc_profile_hash(profile, e.version, start,
1434 ent = aa_load_ent_alloc();
1441 ent->ns_name = ns_name;
1443 list_add_tail(&ent->list, lh);
1445 udata->abi = e.version & K_ABI_MASK;
1446 if (aa_g_hash_policy) {
1447 udata->hash = aa_calc_hash(udata->data, udata->size);
1448 if (IS_ERR(udata->hash)) {
1449 error = PTR_ERR(udata->hash);
1455 if (aa_g_export_binary) {
1456 error = compress_loaddata(udata);
1464 aa_put_profile(profile);
1467 list_for_each_entry_safe(ent, tmp, lh, list) {
1468 list_del_init(&ent->list);
1469 aa_load_ent_free(ent);
1475 #ifdef CONFIG_SECURITY_APPARMOR_KUNIT_TEST
1476 #include "policy_unpack_test.c"
1477 #endif /* CONFIG_SECURITY_APPARMOR_KUNIT_TEST */