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 <linux/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;
37 struct apparmor_audit_data *ad = aad(sa);
40 audit_log_format(ab, " ns=");
41 audit_log_untrustedstring(ab, ad->iface.ns);
44 audit_log_format(ab, " name=");
45 audit_log_untrustedstring(ab, ad->name);
48 audit_log_format(ab, " offset=%ld", ad->iface.pos);
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
60 * Returns: %0 or error
62 static int audit_iface(struct aa_profile *new, const char *ns_name,
63 const char *name, const char *info, struct aa_ext *e,
66 struct aa_profile *profile = labels_profile(aa_current_raw_label());
67 DEFINE_AUDIT_DATA(ad, LSM_AUDIT_DATA_NONE, AA_CLASS_NONE, NULL);
69 ad.iface.pos = e->pos - e->start;
70 ad.iface.ns = ns_name;
72 ad.name = new->base.hname;
78 return aa_audit(AUDIT_APPARMOR_STATUS, profile, &ad, audit_cb);
81 void __aa_loaddata_update(struct aa_loaddata *data, long revision)
85 AA_BUG(!mutex_is_locked(&data->ns->lock));
86 AA_BUG(data->revision > revision);
88 data->revision = revision;
89 if ((data->dents[AAFS_LOADDATA_REVISION])) {
92 inode = d_inode(data->dents[AAFS_LOADDATA_DIR]);
93 inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
95 inode = d_inode(data->dents[AAFS_LOADDATA_REVISION]);
96 inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
100 bool aa_rawdata_eq(struct aa_loaddata *l, struct aa_loaddata *r)
102 if (l->size != r->size)
104 if (l->compressed_size != r->compressed_size)
106 if (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0)
108 return memcmp(l->data, r->data, r->compressed_size ?: r->size) == 0;
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
115 static void do_loaddata_free(struct work_struct *work)
117 struct aa_loaddata *d = container_of(work, struct aa_loaddata, work);
118 struct aa_ns *ns = aa_get_ns(d->ns);
121 mutex_lock_nested(&ns->lock, ns->level);
122 __aa_fs_remove_rawdata(d);
123 mutex_unlock(&ns->lock);
127 kfree_sensitive(d->hash);
128 kfree_sensitive(d->name);
133 void aa_loaddata_kref(struct kref *kref)
135 struct aa_loaddata *d = container_of(kref, struct aa_loaddata, count);
138 INIT_WORK(&d->work, do_loaddata_free);
139 schedule_work(&d->work);
143 struct aa_loaddata *aa_loaddata_alloc(size_t size)
145 struct aa_loaddata *d;
147 d = kzalloc(sizeof(*d), GFP_KERNEL);
149 return ERR_PTR(-ENOMEM);
150 d->data = kvzalloc(size, GFP_KERNEL);
153 return ERR_PTR(-ENOMEM);
155 kref_init(&d->count);
156 INIT_LIST_HEAD(&d->list);
161 /* test if read will be in packed data bounds */
162 VISIBLE_IF_KUNIT bool aa_inbounds(struct aa_ext *e, size_t size)
164 return (size <= e->end - e->pos);
166 EXPORT_SYMBOL_IF_KUNIT(aa_inbounds);
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)
173 * Returns: the size of chunk found with the read head at the end of the chunk.
175 VISIBLE_IF_KUNIT size_t aa_unpack_u16_chunk(struct aa_ext *e, char **chunk)
180 if (!aa_inbounds(e, sizeof(u16)))
182 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
183 e->pos += sizeof(__le16);
184 if (!aa_inbounds(e, size))
194 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u16_chunk);
196 /* unpack control byte */
197 VISIBLE_IF_KUNIT bool aa_unpack_X(struct aa_ext *e, enum aa_code code)
199 if (!aa_inbounds(e, 1))
201 if (*(u8 *) e->pos != code)
206 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_X);
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)
212 * @name: name to match to the serialized element. (MAYBE NULL)
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.
219 * Returns true on success (both type code and name tests match) and the read
220 * head is advanced past the headers
222 * Returns: false if either match fails, the read head does not move
224 VISIBLE_IF_KUNIT bool aa_unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
227 * May need to reset pos if name or type doesn't match
231 * Check for presence of a tagname, and if present name size
232 * AA_NAME tag value is a u16.
234 if (aa_unpack_X(e, AA_NAME)) {
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)))
241 /* if a name is specified and there is no name tag fail */
245 /* now check if type code matches */
246 if (aa_unpack_X(e, code))
253 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_nameX);
255 static bool unpack_u8(struct aa_ext *e, u8 *data, const char *name)
259 if (aa_unpack_nameX(e, AA_U8, name)) {
260 if (!aa_inbounds(e, sizeof(u8)))
263 *data = *((u8 *)e->pos);
264 e->pos += sizeof(u8);
273 VISIBLE_IF_KUNIT bool aa_unpack_u32(struct aa_ext *e, u32 *data, const char *name)
277 if (aa_unpack_nameX(e, AA_U32, name)) {
278 if (!aa_inbounds(e, sizeof(u32)))
281 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
282 e->pos += sizeof(u32);
290 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u32);
292 VISIBLE_IF_KUNIT bool aa_unpack_u64(struct aa_ext *e, u64 *data, const char *name)
296 if (aa_unpack_nameX(e, AA_U64, name)) {
297 if (!aa_inbounds(e, sizeof(u64)))
300 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
301 e->pos += sizeof(u64);
309 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u64);
311 static bool aa_unpack_cap_low(struct aa_ext *e, kernel_cap_t *data, const char *name)
315 if (!aa_unpack_u32(e, &val, name))
321 static bool aa_unpack_cap_high(struct aa_ext *e, kernel_cap_t *data, const char *name)
325 if (!aa_unpack_u32(e, &val, name))
327 data->val = (u32)data->val | ((u64)val << 32);
331 VISIBLE_IF_KUNIT bool aa_unpack_array(struct aa_ext *e, const char *name, u16 *size)
335 if (aa_unpack_nameX(e, AA_ARRAY, name)) {
336 if (!aa_inbounds(e, sizeof(u16)))
338 *size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
339 e->pos += sizeof(u16);
347 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_array);
349 VISIBLE_IF_KUNIT size_t aa_unpack_blob(struct aa_ext *e, char **blob, const char *name)
353 if (aa_unpack_nameX(e, AA_BLOB, name)) {
355 if (!aa_inbounds(e, sizeof(u32)))
357 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
358 e->pos += sizeof(u32);
359 if (aa_inbounds(e, (size_t) size)) {
370 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_blob);
372 VISIBLE_IF_KUNIT int aa_unpack_str(struct aa_ext *e, const char **string, const char *name)
378 if (aa_unpack_nameX(e, AA_STRING, name)) {
379 size = aa_unpack_u16_chunk(e, &src_str);
381 /* strings are null terminated, length is size - 1 */
382 if (src_str[size - 1] != 0)
394 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_str);
396 VISIBLE_IF_KUNIT int aa_unpack_strdup(struct aa_ext *e, char **string, const char *name)
400 int res = aa_unpack_str(e, &tmp, name);
406 *string = kmemdup(tmp, res, GFP_KERNEL);
414 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_strdup);
418 * unpack_dfa - unpack a file rule dfa
419 * @e: serialized data extent information (NOT NULL)
420 * @flags: dfa flags to check
422 * returns dfa or ERR_PTR or NULL if no dfa
424 static struct aa_dfa *unpack_dfa(struct aa_ext *e, int flags)
428 struct aa_dfa *dfa = NULL;
430 size = aa_unpack_blob(e, &blob, "aadfa");
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
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);
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)
457 * Returns: true if table successfully unpacked or not present
459 static bool unpack_trans_table(struct aa_ext *e, struct aa_str_table *strs)
461 void *saved_pos = e->pos;
464 /* exec table is optional */
465 if (aa_unpack_nameX(e, AA_STRUCT, "xtable")) {
469 if (!aa_unpack_array(e, NULL, &size))
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
477 table = kcalloc(size, sizeof(char *), GFP_KERNEL);
483 for (i = 0; i < size; i++) {
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.
492 /* verify that name doesn't start with space */
496 /* count internal # of internal \0 */
497 for (c = j = 0; j < size2 - 1; j++) {
504 /* first character after : must be valid */
507 /* beginning with : requires an embedded \0,
508 * verify that exactly 1 internal \0 exists
509 * trailing \0 already verified by aa_unpack_strdup
511 * convert \0 back to : for label_parse
518 /* fail - all other cases with embedded \0 */
521 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
523 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
529 aa_free_str_table(strs);
534 static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
538 if (aa_unpack_nameX(e, AA_STRUCT, "xattrs")) {
542 if (!aa_unpack_array(e, NULL, &size))
544 profile->attach.xattr_count = size;
545 profile->attach.xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
546 if (!profile->attach.xattrs)
548 for (i = 0; i < size; i++) {
549 if (!aa_unpack_strdup(e, &profile->attach.xattrs[i], NULL))
552 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
554 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
565 static bool unpack_secmark(struct aa_ext *e, struct aa_ruleset *rules)
571 if (aa_unpack_nameX(e, AA_STRUCT, "secmark")) {
572 if (!aa_unpack_array(e, NULL, &size))
575 rules->secmark = kcalloc(size, sizeof(struct aa_secmark),
580 rules->secmark_count = size;
582 for (i = 0; i < size; i++) {
583 if (!unpack_u8(e, &rules->secmark[i].audit, NULL))
585 if (!unpack_u8(e, &rules->secmark[i].deny, NULL))
587 if (!aa_unpack_strdup(e, &rules->secmark[i].label, NULL))
590 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
592 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
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;
611 static bool unpack_rlimits(struct aa_ext *e, struct aa_ruleset *rules)
615 /* rlimits are optional */
616 if (aa_unpack_nameX(e, AA_STRUCT, "rlimits")) {
620 if (!aa_unpack_u32(e, &tmp, NULL))
622 rules->rlimits.mask = tmp;
624 if (!aa_unpack_array(e, NULL, &size) ||
627 for (i = 0; i < size; i++) {
629 int a = aa_map_resource(i);
630 if (!aa_unpack_u64(e, &tmp2, NULL))
632 rules->rlimits.limits[a].rlim_max = tmp2;
634 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
636 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
646 static bool unpack_perm(struct aa_ext *e, u32 version, struct aa_perms *perm)
653 /* reserved entry is for later expansion, discard for now */
654 return aa_unpack_u32(e, &reserved, NULL) &&
655 aa_unpack_u32(e, &perm->allow, NULL) &&
656 aa_unpack_u32(e, &perm->deny, NULL) &&
657 aa_unpack_u32(e, &perm->subtree, NULL) &&
658 aa_unpack_u32(e, &perm->cond, NULL) &&
659 aa_unpack_u32(e, &perm->kill, NULL) &&
660 aa_unpack_u32(e, &perm->complain, NULL) &&
661 aa_unpack_u32(e, &perm->prompt, NULL) &&
662 aa_unpack_u32(e, &perm->audit, NULL) &&
663 aa_unpack_u32(e, &perm->quiet, NULL) &&
664 aa_unpack_u32(e, &perm->hide, NULL) &&
665 aa_unpack_u32(e, &perm->xindex, NULL) &&
666 aa_unpack_u32(e, &perm->tag, NULL) &&
667 aa_unpack_u32(e, &perm->label, NULL);
670 static ssize_t unpack_perms_table(struct aa_ext *e, struct aa_perms **perms)
677 * policy perms are optional, in which case perms are embedded
678 * in the dfa accept table
680 if (aa_unpack_nameX(e, AA_STRUCT, "perms")) {
684 if (!aa_unpack_u32(e, &version, "version"))
686 if (!aa_unpack_array(e, NULL, &size))
688 *perms = kcalloc(size, sizeof(struct aa_perms), GFP_KERNEL);
691 for (i = 0; i < size; i++) {
692 if (!unpack_perm(e, version, &(*perms)[i]))
695 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
697 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
711 static int unpack_pdb(struct aa_ext *e, struct aa_policydb **policy,
712 bool required_dfa, bool required_trans,
715 struct aa_policydb *pdb;
717 int i, flags, error = -EPROTO;
720 pdb = aa_alloc_pdb(GFP_KERNEL);
724 size = unpack_perms_table(e, &pdb->perms);
728 *info = "failed to unpack - perms";
734 /* perms table present accept is index */
735 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
737 /* packed perms in accept1 and accept2 */
738 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
739 TO_ACCEPT2_FLAG(YYTD_DATA32);
742 pdb->dfa = unpack_dfa(e, flags);
743 if (IS_ERR(pdb->dfa)) {
744 error = PTR_ERR(pdb->dfa);
746 *info = "failed to unpack - dfa";
748 } else if (!pdb->dfa) {
750 *info = "missing required dfa";
755 * only unpack the following if a dfa is present
757 * sadly start was given different names for file and policydb
758 * but since it is optional we can try both
760 if (!aa_unpack_u32(e, &pdb->start[0], "start"))
761 /* default start state */
762 pdb->start[0] = DFA_START;
763 if (!aa_unpack_u32(e, &pdb->start[AA_CLASS_FILE], "dfa_start")) {
764 /* default start state for xmatch and file dfa */
765 pdb->start[AA_CLASS_FILE] = DFA_START;
766 } /* setup class index */
767 for (i = AA_CLASS_FILE + 1; i <= AA_CLASS_LAST; i++) {
768 pdb->start[i] = aa_dfa_next(pdb->dfa, pdb->start[0],
774 * Unfortunately due to a bug in earlier userspaces, a
775 * transition table may be present even when the dfa is
776 * not. For compatibility reasons unpack and discard.
778 if (!unpack_trans_table(e, &pdb->trans) && required_trans) {
779 *info = "failed to unpack profile transition table";
783 if (!pdb->dfa && pdb->trans.table)
784 aa_free_str_table(&pdb->trans);
786 /* TODO: move compat mapping here, requires dfa merging first */
787 /* TODO: move verify here, it has to be done after compat mappings */
798 static u32 strhash(const void *data, u32 len, u32 seed)
800 const char * const *key = data;
802 return jhash(*key, strlen(*key), seed);
805 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
807 const struct aa_data *data = obj;
808 const char * const *key = arg->key;
810 return strcmp(data->key, *key);
814 * unpack_profile - unpack a serialized profile
815 * @e: serialized data extent information (NOT NULL)
816 * @ns_name: pointer of newly allocated copy of %NULL in case of error
818 * NOTE: unpack profile sets audit struct if there is a failure
820 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
822 struct aa_ruleset *rules;
823 struct aa_profile *profile = NULL;
824 const char *tmpname, *tmpns = NULL, *name = NULL;
825 const char *info = "failed to unpack profile";
827 struct rhashtable_params params = { 0 };
828 char *key = NULL, *disconnected = NULL;
829 struct aa_data *data;
836 /* check that we have the right struct being passed */
837 if (!aa_unpack_nameX(e, AA_STRUCT, "profile"))
839 if (!aa_unpack_str(e, &name, NULL))
844 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
847 info = "empty profile name";
850 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
852 info = "out of memory";
859 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
861 info = "out of memory";
865 rules = list_first_entry(&profile->rules, typeof(*rules), list);
867 /* profile renaming is optional */
868 (void) aa_unpack_str(e, &profile->rename, "rename");
870 /* attachment string is optional */
871 (void) aa_unpack_str(e, &profile->attach.xmatch_str, "attach");
873 /* xmatch is optional and may be NULL */
874 error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
880 /* neither xmatch_len not xmatch_perms are optional if xmatch is set */
881 if (profile->attach.xmatch->dfa) {
882 if (!aa_unpack_u32(e, &tmp, NULL)) {
883 info = "missing xmatch len";
886 profile->attach.xmatch_len = tmp;
887 profile->attach.xmatch->start[AA_CLASS_XMATCH] = DFA_START;
888 if (!profile->attach.xmatch->perms) {
889 error = aa_compat_map_xmatch(profile->attach.xmatch);
891 info = "failed to convert xmatch permission table";
897 /* disconnected attachment string is optional */
898 (void) aa_unpack_strdup(e, &disconnected, "disconnected");
899 profile->disconnected = disconnected;
901 /* per profile debug flags (complain, audit) */
902 if (!aa_unpack_nameX(e, AA_STRUCT, "flags")) {
903 info = "profile missing flags";
906 info = "failed to unpack profile flags";
907 if (!aa_unpack_u32(e, &tmp, NULL))
909 if (tmp & PACKED_FLAG_HAT)
910 profile->label.flags |= FLAG_HAT;
911 if (tmp & PACKED_FLAG_DEBUG1)
912 profile->label.flags |= FLAG_DEBUG1;
913 if (tmp & PACKED_FLAG_DEBUG2)
914 profile->label.flags |= FLAG_DEBUG2;
915 if (!aa_unpack_u32(e, &tmp, NULL))
917 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG)) {
918 profile->mode = APPARMOR_COMPLAIN;
919 } else if (tmp == PACKED_MODE_ENFORCE) {
920 profile->mode = APPARMOR_ENFORCE;
921 } else if (tmp == PACKED_MODE_KILL) {
922 profile->mode = APPARMOR_KILL;
923 } else if (tmp == PACKED_MODE_UNCONFINED) {
924 profile->mode = APPARMOR_UNCONFINED;
925 profile->label.flags |= FLAG_UNCONFINED;
926 } else if (tmp == PACKED_MODE_USER) {
927 profile->mode = APPARMOR_USER;
931 if (!aa_unpack_u32(e, &tmp, NULL))
934 profile->audit = AUDIT_ALL;
936 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
939 /* path_flags is optional */
940 if (aa_unpack_u32(e, &profile->path_flags, "path_flags"))
941 profile->path_flags |= profile->label.flags &
942 PATH_MEDIATE_DELETED;
944 /* set a default value if path_flags field is not present */
945 profile->path_flags = PATH_MEDIATE_DELETED;
947 info = "failed to unpack profile capabilities";
948 if (!aa_unpack_cap_low(e, &rules->caps.allow, NULL))
950 if (!aa_unpack_cap_low(e, &rules->caps.audit, NULL))
952 if (!aa_unpack_cap_low(e, &rules->caps.quiet, NULL))
954 if (!aa_unpack_cap_low(e, &tmpcap, NULL))
957 info = "failed to unpack upper profile capabilities";
958 if (aa_unpack_nameX(e, AA_STRUCT, "caps64")) {
959 /* optional upper half of 64 bit caps */
960 if (!aa_unpack_cap_high(e, &rules->caps.allow, NULL))
962 if (!aa_unpack_cap_high(e, &rules->caps.audit, NULL))
964 if (!aa_unpack_cap_high(e, &rules->caps.quiet, NULL))
966 if (!aa_unpack_cap_high(e, &tmpcap, NULL))
968 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
972 info = "failed to unpack extended profile capabilities";
973 if (aa_unpack_nameX(e, AA_STRUCT, "capsx")) {
974 /* optional extended caps mediation mask */
975 if (!aa_unpack_cap_low(e, &rules->caps.extended, NULL))
977 if (!aa_unpack_cap_high(e, &rules->caps.extended, NULL))
979 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
983 if (!unpack_xattrs(e, profile)) {
984 info = "failed to unpack profile xattrs";
988 if (!unpack_rlimits(e, rules)) {
989 info = "failed to unpack profile rlimits";
993 if (!unpack_secmark(e, rules)) {
994 info = "failed to unpack profile secmark rules";
998 if (aa_unpack_nameX(e, AA_STRUCT, "policydb")) {
999 /* generic policy dfa - optional and may be NULL */
1000 info = "failed to unpack policydb";
1001 error = unpack_pdb(e, &rules->policy, true, false,
1005 /* Fixup: drop when we get rid of start array */
1006 if (aa_dfa_next(rules->policy->dfa, rules->policy->start[0],
1008 rules->policy->start[AA_CLASS_FILE] =
1009 aa_dfa_next(rules->policy->dfa,
1010 rules->policy->start[0],
1012 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
1014 if (!rules->policy->perms) {
1015 error = aa_compat_map_policy(rules->policy,
1018 info = "failed to remap policydb permission table";
1023 rules->policy = aa_get_pdb(nullpdb);
1025 /* get file rules */
1026 error = unpack_pdb(e, &rules->file, false, true, &info);
1029 } else if (rules->file->dfa) {
1030 if (!rules->file->perms) {
1031 error = aa_compat_map_file(rules->file);
1033 info = "failed to remap file permission table";
1037 } else if (rules->policy->dfa &&
1038 rules->policy->start[AA_CLASS_FILE]) {
1039 aa_put_pdb(rules->file);
1040 rules->file = aa_get_pdb(rules->policy);
1042 aa_put_pdb(rules->file);
1043 rules->file = aa_get_pdb(nullpdb);
1046 if (aa_unpack_nameX(e, AA_STRUCT, "data")) {
1047 info = "out of memory";
1048 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
1049 if (!profile->data) {
1053 params.nelem_hint = 3;
1054 params.key_len = sizeof(void *);
1055 params.key_offset = offsetof(struct aa_data, key);
1056 params.head_offset = offsetof(struct aa_data, head);
1057 params.hashfn = strhash;
1058 params.obj_cmpfn = datacmp;
1060 if (rhashtable_init(profile->data, ¶ms)) {
1061 info = "failed to init key, value hash table";
1065 while (aa_unpack_strdup(e, &key, NULL)) {
1066 data = kzalloc(sizeof(*data), GFP_KERNEL);
1068 kfree_sensitive(key);
1074 data->size = aa_unpack_blob(e, &data->data, NULL);
1075 data->data = kvmemdup(data->data, data->size, GFP_KERNEL);
1076 if (data->size && !data->data) {
1077 kfree_sensitive(data->key);
1078 kfree_sensitive(data);
1083 if (rhashtable_insert_fast(profile->data, &data->head,
1084 profile->data->p)) {
1085 kvfree_sensitive(data->data, data->size);
1086 kfree_sensitive(data->key);
1087 kfree_sensitive(data);
1088 info = "failed to insert data to table";
1093 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1094 info = "failed to unpack end of key, value data table";
1099 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1100 info = "failed to unpack end of profile";
1108 /* default error covers most cases */
1118 audit_iface(profile, NULL, name, info, e, error);
1119 aa_free_profile(profile);
1121 return ERR_PTR(error);
1125 * verify_header - unpack serialized stream header
1126 * @e: serialized data read head (NOT NULL)
1127 * @required: whether the header is required or optional
1128 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
1130 * Returns: error or 0 if header is good
1132 static int verify_header(struct aa_ext *e, int required, const char **ns)
1134 int error = -EPROTONOSUPPORT;
1135 const char *name = NULL;
1138 /* get the interface version */
1139 if (!aa_unpack_u32(e, &e->version, "version")) {
1141 audit_iface(NULL, NULL, NULL, "invalid profile format",
1147 /* Check that the interface version is currently supported.
1148 * if not specified use previous version
1149 * Mask off everything that is not kernel abi version
1151 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1152 audit_iface(NULL, NULL, NULL, "unsupported interface version",
1157 /* read the namespace if present */
1158 if (aa_unpack_str(e, &name, "namespace")) {
1159 if (*name == '\0') {
1160 audit_iface(NULL, NULL, NULL, "invalid namespace name",
1164 if (*ns && strcmp(*ns, name)) {
1165 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1168 *ns = kstrdup(name, GFP_KERNEL);
1178 * verify_dfa_accept_index - verify accept indexes are in range of perms table
1179 * @dfa: the dfa to check accept indexes are in range
1180 * @table_size: the permission table size the indexes should be within
1182 static bool verify_dfa_accept_index(struct aa_dfa *dfa, int table_size)
1185 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1186 if (ACCEPT_TABLE(dfa)[i] >= table_size)
1192 static bool verify_perm(struct aa_perms *perm)
1194 /* TODO: allow option to just force the perms into a valid state */
1195 if (perm->allow & perm->deny)
1197 if (perm->subtree & ~perm->allow)
1199 if (perm->cond & (perm->allow | perm->deny))
1201 if (perm->kill & perm->allow)
1203 if (perm->complain & (perm->allow | perm->deny))
1205 if (perm->prompt & (perm->allow | perm->deny))
1207 if (perm->complain & perm->prompt)
1209 if (perm->hide & perm->allow)
1215 static bool verify_perms(struct aa_policydb *pdb)
1219 for (i = 0; i < pdb->size; i++) {
1220 if (!verify_perm(&pdb->perms[i]))
1222 /* verify indexes into str table */
1223 if ((pdb->perms[i].xindex & AA_X_TYPE_MASK) == AA_X_TABLE &&
1224 (pdb->perms[i].xindex & AA_X_INDEX_MASK) >= pdb->trans.size)
1226 if (pdb->perms[i].tag && pdb->perms[i].tag >= pdb->trans.size)
1228 if (pdb->perms[i].label &&
1229 pdb->perms[i].label >= pdb->trans.size)
1237 * verify_profile - Do post unpack analysis to verify profile consistency
1238 * @profile: profile to verify (NOT NULL)
1240 * Returns: 0 if passes verification else error
1242 * This verification is post any unpack mapping or changes
1244 static int verify_profile(struct aa_profile *profile)
1246 struct aa_ruleset *rules = list_first_entry(&profile->rules,
1247 typeof(*rules), list);
1251 if (rules->file->dfa && !verify_dfa_accept_index(rules->file->dfa,
1252 rules->file->size)) {
1253 audit_iface(profile, NULL, NULL,
1254 "Unpack: file Invalid named transition", NULL,
1258 if (rules->policy->dfa &&
1259 !verify_dfa_accept_index(rules->policy->dfa, rules->policy->size)) {
1260 audit_iface(profile, NULL, NULL,
1261 "Unpack: policy Invalid named transition", NULL,
1266 if (!verify_perms(rules->file)) {
1267 audit_iface(profile, NULL, NULL,
1268 "Unpack: Invalid perm index", NULL, -EPROTO);
1271 if (!verify_perms(rules->policy)) {
1272 audit_iface(profile, NULL, NULL,
1273 "Unpack: Invalid perm index", NULL, -EPROTO);
1276 if (!verify_perms(profile->attach.xmatch)) {
1277 audit_iface(profile, NULL, NULL,
1278 "Unpack: Invalid perm index", NULL, -EPROTO);
1285 void aa_load_ent_free(struct aa_load_ent *ent)
1288 aa_put_profile(ent->rename);
1289 aa_put_profile(ent->old);
1290 aa_put_profile(ent->new);
1291 kfree(ent->ns_name);
1292 kfree_sensitive(ent);
1296 struct aa_load_ent *aa_load_ent_alloc(void)
1298 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1300 INIT_LIST_HEAD(&ent->list);
1304 static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
1306 #ifdef CONFIG_SECURITY_APPARMOR_EXPORT_BINARY
1307 const zstd_parameters params =
1308 zstd_get_params(aa_g_rawdata_compression_level, slen);
1309 const size_t wksp_len = zstd_cctx_workspace_bound(¶ms.cParams);
1311 zstd_cctx *ctx = NULL;
1312 size_t out_len = zstd_compress_bound(slen);
1316 out = kvzalloc(out_len, GFP_KERNEL);
1322 wksp = kvzalloc(wksp_len, GFP_KERNEL);
1328 ctx = zstd_init_cctx(wksp, wksp_len);
1334 out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, ¶ms);
1335 if (zstd_is_error(out_len) || out_len >= slen) {
1340 if (is_vmalloc_addr(out)) {
1341 *dst = kvzalloc(out_len, GFP_KERNEL);
1343 memcpy(*dst, out, out_len);
1349 * If the staging buffer was kmalloc'd, then using krealloc is
1350 * probably going to be faster. The destination buffer will
1351 * always be smaller, so it's just shrunk, avoiding a memcpy
1353 *dst = krealloc(out, out_len, GFP_KERNEL);
1377 static int compress_loaddata(struct aa_loaddata *data)
1379 AA_BUG(data->compressed_size > 0);
1382 * Shortcut the no compression case, else we increase the amount of
1383 * storage required by a small amount
1385 if (aa_g_rawdata_compression_level != 0) {
1386 void *udata = data->data;
1387 int error = compress_zstd(udata, data->size, &data->data,
1388 &data->compressed_size);
1390 data->compressed_size = data->size;
1393 if (udata != data->data)
1396 data->compressed_size = data->size;
1402 * aa_unpack - unpack packed binary profile(s) data loaded from user space
1403 * @udata: user data copied to kmem (NOT NULL)
1404 * @lh: list to place unpacked profiles in a aa_repl_ws
1405 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1407 * Unpack user data and return refcounted allocated profile(s) stored in
1408 * @lh in order of discovery, with the list chain stored in base.list
1411 * Returns: profile(s) on @lh else error pointer if fails to unpack
1413 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1416 struct aa_load_ent *tmp, *ent;
1417 struct aa_profile *profile = NULL;
1418 char *ns_name = NULL;
1421 .start = udata->data,
1422 .end = udata->data + udata->size,
1427 while (e.pos < e.end) {
1429 error = verify_header(&e, e.pos == e.start, ns);
1434 profile = unpack_profile(&e, &ns_name);
1435 if (IS_ERR(profile)) {
1436 error = PTR_ERR(profile);
1440 error = verify_profile(profile);
1444 if (aa_g_hash_policy)
1445 error = aa_calc_profile_hash(profile, e.version, start,
1450 ent = aa_load_ent_alloc();
1457 ent->ns_name = ns_name;
1459 list_add_tail(&ent->list, lh);
1461 udata->abi = e.version & K_ABI_MASK;
1462 if (aa_g_hash_policy) {
1463 udata->hash = aa_calc_hash(udata->data, udata->size);
1464 if (IS_ERR(udata->hash)) {
1465 error = PTR_ERR(udata->hash);
1471 if (aa_g_export_binary) {
1472 error = compress_loaddata(udata);
1480 aa_put_profile(profile);
1483 list_for_each_entry_safe(ent, tmp, lh, list) {
1484 list_del_init(&ent->list);
1485 aa_load_ent_free(ent);