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;
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->i_mtime = inode_set_ctime_current(inode);
95 inode = d_inode(data->dents[AAFS_LOADDATA_REVISION]);
96 inode->i_mtime = 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)
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);
667 static ssize_t unpack_perms_table(struct aa_ext *e, struct aa_perms **perms)
674 * policy perms are optional, in which case perms are embedded
675 * in the dfa accept table
677 if (aa_unpack_nameX(e, AA_STRUCT, "perms")) {
681 if (!aa_unpack_u32(e, &version, "version"))
683 if (!aa_unpack_array(e, NULL, &size))
685 *perms = kcalloc(size, sizeof(struct aa_perms), GFP_KERNEL);
688 for (i = 0; i < size; i++) {
689 if (!unpack_perm(e, version, &(*perms)[i]))
692 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
694 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
708 static int unpack_pdb(struct aa_ext *e, struct aa_policydb *policy,
709 bool required_dfa, bool required_trans,
713 int i, flags, error = -EPROTO;
716 size = unpack_perms_table(e, &policy->perms);
719 policy->perms = NULL;
720 *info = "failed to unpack - perms";
726 /* perms table present accept is index */
727 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
729 /* packed perms in accept1 and accept2 */
730 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
731 TO_ACCEPT2_FLAG(YYTD_DATA32);
734 policy->dfa = unpack_dfa(e, flags);
735 if (IS_ERR(policy->dfa)) {
736 error = PTR_ERR(policy->dfa);
738 *info = "failed to unpack - dfa";
740 } else if (!policy->dfa) {
742 *info = "missing required dfa";
749 * only unpack the following if a dfa is present
751 * sadly start was given different names for file and policydb
752 * but since it is optional we can try both
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],
765 if (!unpack_trans_table(e, &policy->trans) && required_trans) {
766 *info = "failed to unpack profile transition table";
770 /* TODO: move compat mapping here, requires dfa merging first */
771 /* TODO: move verify here, it has to be done after compat mappings */
780 static u32 strhash(const void *data, u32 len, u32 seed)
782 const char * const *key = data;
784 return jhash(*key, strlen(*key), seed);
787 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
789 const struct aa_data *data = obj;
790 const char * const *key = arg->key;
792 return strcmp(data->key, *key);
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
800 * NOTE: unpack profile sets audit struct if there is a failure
802 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
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";
809 struct rhashtable_params params = { 0 };
810 char *key = NULL, *disconnected = NULL;
811 struct aa_data *data;
818 /* check that we have the right struct being passed */
819 if (!aa_unpack_nameX(e, AA_STRUCT, "profile"))
821 if (!aa_unpack_str(e, &name, NULL))
826 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
829 info = "empty profile name";
832 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
834 info = "out of memory";
841 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
843 info = "out of memory";
847 rules = list_first_entry(&profile->rules, typeof(*rules), list);
849 /* profile renaming is optional */
850 (void) aa_unpack_str(e, &profile->rename, "rename");
852 /* attachment string is optional */
853 (void) aa_unpack_str(e, &profile->attach.xmatch_str, "attach");
855 /* xmatch is optional and may be NULL */
856 error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
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";
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);
873 info = "failed to convert xmatch permission table";
879 /* disconnected attachment string is optional */
880 (void) aa_unpack_strdup(e, &disconnected, "disconnected");
881 profile->disconnected = disconnected;
883 /* per profile debug flags (complain, audit) */
884 if (!aa_unpack_nameX(e, AA_STRUCT, "flags")) {
885 info = "profile missing flags";
888 info = "failed to unpack profile flags";
889 if (!aa_unpack_u32(e, &tmp, NULL))
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))
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;
913 if (!aa_unpack_u32(e, &tmp, NULL))
916 profile->audit = AUDIT_ALL;
918 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
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;
926 /* set a default value if path_flags field is not present */
927 profile->path_flags = PATH_MEDIATE_DELETED;
929 info = "failed to unpack profile capabilities";
930 if (!aa_unpack_cap_low(e, &rules->caps.allow, NULL))
932 if (!aa_unpack_cap_low(e, &rules->caps.audit, NULL))
934 if (!aa_unpack_cap_low(e, &rules->caps.quiet, NULL))
936 if (!aa_unpack_cap_low(e, &tmpcap, NULL))
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))
944 if (!aa_unpack_cap_high(e, &rules->caps.audit, NULL))
946 if (!aa_unpack_cap_high(e, &rules->caps.quiet, NULL))
948 if (!aa_unpack_cap_high(e, &tmpcap, NULL))
950 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
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))
959 if (!aa_unpack_cap_high(e, &rules->caps.extended, NULL))
961 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
965 if (!unpack_xattrs(e, profile)) {
966 info = "failed to unpack profile xattrs";
970 if (!unpack_rlimits(e, rules)) {
971 info = "failed to unpack profile rlimits";
975 if (!unpack_secmark(e, rules)) {
976 info = "failed to unpack profile secmark rules";
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,
987 /* Fixup: drop when we get rid of start array */
988 if (aa_dfa_next(rules->policy.dfa, rules->policy.start[0],
990 rules->policy.start[AA_CLASS_FILE] =
991 aa_dfa_next(rules->policy.dfa,
992 rules->policy.start[0],
994 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
996 if (!rules->policy.perms) {
997 error = aa_compat_map_policy(&rules->policy,
1000 info = "failed to remap policydb permission table";
1005 rules->policy.dfa = aa_get_dfa(nulldfa);
1006 rules->policy.perms = kcalloc(2, sizeof(struct aa_perms),
1008 if (!rules->policy.perms)
1010 rules->policy.size = 2;
1012 /* get file rules */
1013 error = unpack_pdb(e, &rules->file, false, true, &info);
1016 } else if (rules->file.dfa) {
1017 if (!rules->file.perms) {
1018 error = aa_compat_map_file(&rules->file);
1020 info = "failed to remap file permission table";
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),
1031 if (!rules->file.perms)
1033 memcpy(rules->file.perms, rules->policy.perms,
1034 rules->policy.size * sizeof(struct aa_perms));
1035 rules->file.size = rules->policy.size;
1037 rules->file.dfa = aa_get_dfa(nulldfa);
1038 rules->file.perms = kcalloc(2, sizeof(struct aa_perms),
1040 if (!rules->file.perms)
1042 rules->file.size = 2;
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) {
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;
1059 if (rhashtable_init(profile->data, ¶ms)) {
1060 info = "failed to init key, value hash table";
1064 while (aa_unpack_strdup(e, &key, NULL)) {
1065 data = kzalloc(sizeof(*data), GFP_KERNEL);
1067 kfree_sensitive(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);
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";
1091 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1092 info = "failed to unpack end of key, value data table";
1097 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1098 info = "failed to unpack end of profile";
1106 /* default error covers most cases */
1116 audit_iface(profile, NULL, name, info, e, error);
1117 aa_free_profile(profile);
1119 return ERR_PTR(error);
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)
1128 * Returns: error or 0 if header is good
1130 static int verify_header(struct aa_ext *e, int required, const char **ns)
1132 int error = -EPROTONOSUPPORT;
1133 const char *name = NULL;
1136 /* get the interface version */
1137 if (!aa_unpack_u32(e, &e->version, "version")) {
1139 audit_iface(NULL, NULL, NULL, "invalid profile format",
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
1149 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1150 audit_iface(NULL, NULL, NULL, "unsupported interface version",
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",
1162 if (*ns && strcmp(*ns, name)) {
1163 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1166 *ns = kstrdup(name, GFP_KERNEL);
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
1180 static bool verify_dfa_accept_index(struct aa_dfa *dfa, int table_size)
1183 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1184 if (ACCEPT_TABLE(dfa)[i] >= table_size)
1190 static bool verify_perm(struct aa_perms *perm)
1192 /* TODO: allow option to just force the perms into a valid state */
1193 if (perm->allow & perm->deny)
1195 if (perm->subtree & ~perm->allow)
1197 if (perm->cond & (perm->allow | perm->deny))
1199 if (perm->kill & perm->allow)
1201 if (perm->complain & (perm->allow | perm->deny))
1203 if (perm->prompt & (perm->allow | perm->deny))
1205 if (perm->complain & perm->prompt)
1207 if (perm->hide & perm->allow)
1213 static bool verify_perms(struct aa_policydb *pdb)
1217 for (i = 0; i < pdb->size; i++) {
1218 if (!verify_perm(&pdb->perms[i]))
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)
1224 if (pdb->perms[i].tag && pdb->perms[i].tag >= pdb->trans.size)
1226 if (pdb->perms[i].label &&
1227 pdb->perms[i].label >= pdb->trans.size)
1235 * verify_profile - Do post unpack analysis to verify profile consistency
1236 * @profile: profile to verify (NOT NULL)
1238 * Returns: 0 if passes verification else error
1240 * This verification is post any unpack mapping or changes
1242 static int verify_profile(struct aa_profile *profile)
1244 struct aa_ruleset *rules = list_first_entry(&profile->rules,
1245 typeof(*rules), list);
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);
1258 if (!verify_perms(&rules->file)) {
1259 audit_iface(profile, NULL, NULL,
1260 "Unpack: Invalid perm index", NULL, -EPROTO);
1263 if (!verify_perms(&rules->policy)) {
1264 audit_iface(profile, NULL, NULL,
1265 "Unpack: Invalid perm index", NULL, -EPROTO);
1268 if (!verify_perms(&profile->attach.xmatch)) {
1269 audit_iface(profile, NULL, NULL,
1270 "Unpack: Invalid perm index", NULL, -EPROTO);
1277 void aa_load_ent_free(struct aa_load_ent *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);
1288 struct aa_load_ent *aa_load_ent_alloc(void)
1290 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1292 INIT_LIST_HEAD(&ent->list);
1296 static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
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(¶ms.cParams);
1303 zstd_cctx *ctx = NULL;
1304 size_t out_len = zstd_compress_bound(slen);
1308 out = kvzalloc(out_len, GFP_KERNEL);
1314 wksp = kvzalloc(wksp_len, GFP_KERNEL);
1320 ctx = zstd_init_cctx(wksp, wksp_len);
1326 out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, ¶ms);
1327 if (zstd_is_error(out_len) || out_len >= slen) {
1332 if (is_vmalloc_addr(out)) {
1333 *dst = kvzalloc(out_len, GFP_KERNEL);
1335 memcpy(*dst, out, out_len);
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
1345 *dst = krealloc(out, out_len, GFP_KERNEL);
1369 static int compress_loaddata(struct aa_loaddata *data)
1371 AA_BUG(data->compressed_size > 0);
1374 * Shortcut the no compression case, else we increase the amount of
1375 * storage required by a small amount
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);
1382 data->compressed_size = data->size;
1385 if (udata != data->data)
1388 data->compressed_size = data->size;
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)
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
1403 * Returns: profile(s) on @lh else error pointer if fails to unpack
1405 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1408 struct aa_load_ent *tmp, *ent;
1409 struct aa_profile *profile = NULL;
1410 char *ns_name = NULL;
1413 .start = udata->data,
1414 .end = udata->data + udata->size,
1419 while (e.pos < e.end) {
1421 error = verify_header(&e, e.pos == e.start, ns);
1426 profile = unpack_profile(&e, &ns_name);
1427 if (IS_ERR(profile)) {
1428 error = PTR_ERR(profile);
1432 error = verify_profile(profile);
1436 if (aa_g_hash_policy)
1437 error = aa_calc_profile_hash(profile, e.version, start,
1442 ent = aa_load_ent_alloc();
1449 ent->ns_name = ns_name;
1451 list_add_tail(&ent->list, lh);
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);
1463 if (aa_g_export_binary) {
1464 error = compress_loaddata(udata);
1472 aa_put_profile(profile);
1475 list_for_each_entry_safe(ent, tmp, lh, list) {
1476 list_del_init(&ent->list);
1477 aa_load_ent_free(ent);