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);
165 * aa_unpack_u16_chunk - test and do bounds checking for a u16 size based chunk
166 * @e: serialized data read head (NOT NULL)
167 * @chunk: start address for chunk of data (NOT NULL)
169 * Returns: the size of chunk found with the read head at the end of the chunk.
171 VISIBLE_IF_KUNIT size_t aa_unpack_u16_chunk(struct aa_ext *e, char **chunk)
176 if (!aa_inbounds(e, sizeof(u16)))
178 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
179 e->pos += sizeof(__le16);
180 if (!aa_inbounds(e, size))
190 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u16_chunk);
192 /* unpack control byte */
193 VISIBLE_IF_KUNIT bool aa_unpack_X(struct aa_ext *e, enum aa_code code)
195 if (!aa_inbounds(e, 1))
197 if (*(u8 *) e->pos != code)
202 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_X);
205 * aa_unpack_nameX - check is the next element is of type X with a name of @name
206 * @e: serialized data extent information (NOT NULL)
208 * @name: name to match to the serialized element. (MAYBE NULL)
210 * check that the next serialized data element is of type X and has a tag
211 * name @name. If @name is specified then there must be a matching
212 * name element in the stream. If @name is NULL any name element will be
213 * skipped and only the typecode will be tested.
215 * Returns true on success (both type code and name tests match) and the read
216 * head is advanced past the headers
218 * Returns: false if either match fails, the read head does not move
220 VISIBLE_IF_KUNIT bool aa_unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
223 * May need to reset pos if name or type doesn't match
227 * Check for presence of a tagname, and if present name size
228 * AA_NAME tag value is a u16.
230 if (aa_unpack_X(e, AA_NAME)) {
232 size_t size = aa_unpack_u16_chunk(e, &tag);
233 /* if a name is specified it must match. otherwise skip tag */
234 if (name && (!size || tag[size-1] != '\0' || strcmp(name, tag)))
237 /* if a name is specified and there is no name tag fail */
241 /* now check if type code matches */
242 if (aa_unpack_X(e, code))
249 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_nameX);
251 static bool unpack_u8(struct aa_ext *e, u8 *data, const char *name)
255 if (aa_unpack_nameX(e, AA_U8, name)) {
256 if (!aa_inbounds(e, sizeof(u8)))
259 *data = *((u8 *)e->pos);
260 e->pos += sizeof(u8);
269 VISIBLE_IF_KUNIT bool aa_unpack_u32(struct aa_ext *e, u32 *data, const char *name)
273 if (aa_unpack_nameX(e, AA_U32, name)) {
274 if (!aa_inbounds(e, sizeof(u32)))
277 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
278 e->pos += sizeof(u32);
286 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u32);
288 VISIBLE_IF_KUNIT bool aa_unpack_u64(struct aa_ext *e, u64 *data, const char *name)
292 if (aa_unpack_nameX(e, AA_U64, name)) {
293 if (!aa_inbounds(e, sizeof(u64)))
296 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
297 e->pos += sizeof(u64);
305 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u64);
307 static bool aa_unpack_cap_low(struct aa_ext *e, kernel_cap_t *data, const char *name)
311 if (!aa_unpack_u32(e, &val, name))
317 static bool aa_unpack_cap_high(struct aa_ext *e, kernel_cap_t *data, const char *name)
321 if (!aa_unpack_u32(e, &val, name))
323 data->val = (u32)data->val | ((u64)val << 32);
327 VISIBLE_IF_KUNIT bool aa_unpack_array(struct aa_ext *e, const char *name, u16 *size)
331 if (aa_unpack_nameX(e, AA_ARRAY, name)) {
332 if (!aa_inbounds(e, sizeof(u16)))
334 *size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
335 e->pos += sizeof(u16);
343 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_array);
345 VISIBLE_IF_KUNIT size_t aa_unpack_blob(struct aa_ext *e, char **blob, const char *name)
349 if (aa_unpack_nameX(e, AA_BLOB, name)) {
351 if (!aa_inbounds(e, sizeof(u32)))
353 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
354 e->pos += sizeof(u32);
355 if (aa_inbounds(e, (size_t) size)) {
366 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_blob);
368 VISIBLE_IF_KUNIT int aa_unpack_str(struct aa_ext *e, const char **string, const char *name)
374 if (aa_unpack_nameX(e, AA_STRING, name)) {
375 size = aa_unpack_u16_chunk(e, &src_str);
377 /* strings are null terminated, length is size - 1 */
378 if (src_str[size - 1] != 0)
390 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_str);
392 VISIBLE_IF_KUNIT int aa_unpack_strdup(struct aa_ext *e, char **string, const char *name)
396 int res = aa_unpack_str(e, &tmp, name);
402 *string = kmemdup(tmp, res, GFP_KERNEL);
410 EXPORT_SYMBOL_IF_KUNIT(aa_unpack_strdup);
414 * unpack_dfa - unpack a file rule dfa
415 * @e: serialized data extent information (NOT NULL)
416 * @flags: dfa flags to check
418 * returns dfa or ERR_PTR or NULL if no dfa
420 static struct aa_dfa *unpack_dfa(struct aa_ext *e, int flags)
424 struct aa_dfa *dfa = NULL;
426 size = aa_unpack_blob(e, &blob, "aadfa");
429 * The dfa is aligned with in the blob to 8 bytes
430 * from the beginning of the stream.
431 * alignment adjust needed by dfa unpack
433 size_t sz = blob - (char *) e->start -
434 ((e->pos - e->start) & 7);
435 size_t pad = ALIGN(sz, 8) - sz;
436 if (aa_g_paranoid_load)
437 flags |= DFA_FLAG_VERIFY_STATES;
438 dfa = aa_dfa_unpack(blob + pad, size - pad, flags);
449 * unpack_trans_table - unpack a profile transition table
450 * @e: serialized data extent information (NOT NULL)
451 * @table: str table to unpack to (NOT NULL)
453 * Returns: true if table successfully unpacked or not present
455 static bool unpack_trans_table(struct aa_ext *e, struct aa_str_table *strs)
457 void *saved_pos = e->pos;
460 /* exec table is optional */
461 if (aa_unpack_nameX(e, AA_STRUCT, "xtable")) {
465 if (!aa_unpack_array(e, NULL, &size))
467 * Note: index into trans table array is a max
468 * of 2^24, but unpack array can only unpack
469 * an array of 2^16 in size atm so no need
470 * for size check here
473 table = kcalloc(size, sizeof(char *), GFP_KERNEL);
477 for (i = 0; i < size; i++) {
479 int c, j, pos, size2 = aa_unpack_strdup(e, &str, NULL);
480 /* aa_unpack_strdup verifies that the last character is
481 * null termination byte.
486 /* verify that name doesn't start with space */
490 /* count internal # of internal \0 */
491 for (c = j = 0; j < size2 - 1; j++) {
498 /* first character after : must be valid */
501 /* beginning with : requires an embedded \0,
502 * verify that exactly 1 internal \0 exists
503 * trailing \0 already verified by aa_unpack_strdup
505 * convert \0 back to : for label_parse
512 /* fail - all other cases with embedded \0 */
515 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
517 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
526 kfree_sensitive(table);
531 static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
535 if (aa_unpack_nameX(e, AA_STRUCT, "xattrs")) {
539 if (!aa_unpack_array(e, NULL, &size))
541 profile->attach.xattr_count = size;
542 profile->attach.xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
543 if (!profile->attach.xattrs)
545 for (i = 0; i < size; i++) {
546 if (!aa_unpack_strdup(e, &profile->attach.xattrs[i], NULL))
549 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
551 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
562 static bool unpack_secmark(struct aa_ext *e, struct aa_ruleset *rules)
568 if (aa_unpack_nameX(e, AA_STRUCT, "secmark")) {
569 if (!aa_unpack_array(e, NULL, &size))
572 rules->secmark = kcalloc(size, sizeof(struct aa_secmark),
577 rules->secmark_count = size;
579 for (i = 0; i < size; i++) {
580 if (!unpack_u8(e, &rules->secmark[i].audit, NULL))
582 if (!unpack_u8(e, &rules->secmark[i].deny, NULL))
584 if (!aa_unpack_strdup(e, &rules->secmark[i].label, NULL))
587 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
589 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
596 if (rules->secmark) {
597 for (i = 0; i < size; i++)
598 kfree(rules->secmark[i].label);
599 kfree(rules->secmark);
600 rules->secmark_count = 0;
601 rules->secmark = NULL;
608 static bool unpack_rlimits(struct aa_ext *e, struct aa_ruleset *rules)
612 /* rlimits are optional */
613 if (aa_unpack_nameX(e, AA_STRUCT, "rlimits")) {
617 if (!aa_unpack_u32(e, &tmp, NULL))
619 rules->rlimits.mask = tmp;
621 if (!aa_unpack_array(e, NULL, &size) ||
624 for (i = 0; i < size; i++) {
626 int a = aa_map_resource(i);
627 if (!aa_unpack_u64(e, &tmp2, NULL))
629 rules->rlimits.limits[a].rlim_max = tmp2;
631 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
633 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
643 static bool unpack_perm(struct aa_ext *e, u32 version, struct aa_perms *perm)
648 return aa_unpack_u32(e, &perm->allow, NULL) &&
649 aa_unpack_u32(e, &perm->allow, NULL) &&
650 aa_unpack_u32(e, &perm->deny, NULL) &&
651 aa_unpack_u32(e, &perm->subtree, NULL) &&
652 aa_unpack_u32(e, &perm->cond, NULL) &&
653 aa_unpack_u32(e, &perm->kill, NULL) &&
654 aa_unpack_u32(e, &perm->complain, NULL) &&
655 aa_unpack_u32(e, &perm->prompt, NULL) &&
656 aa_unpack_u32(e, &perm->audit, NULL) &&
657 aa_unpack_u32(e, &perm->quiet, NULL) &&
658 aa_unpack_u32(e, &perm->hide, NULL) &&
659 aa_unpack_u32(e, &perm->xindex, NULL) &&
660 aa_unpack_u32(e, &perm->tag, NULL) &&
661 aa_unpack_u32(e, &perm->label, NULL);
664 static ssize_t unpack_perms_table(struct aa_ext *e, struct aa_perms **perms)
671 * policy perms are optional, in which case perms are embedded
672 * in the dfa accept table
674 if (aa_unpack_nameX(e, AA_STRUCT, "perms")) {
678 if (!aa_unpack_u32(e, &version, "version"))
680 if (!aa_unpack_array(e, NULL, &size))
682 *perms = kcalloc(size, sizeof(struct aa_perms), GFP_KERNEL);
685 for (i = 0; i < size; i++) {
686 if (!unpack_perm(e, version, &(*perms)[i]))
689 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
691 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
705 static int unpack_pdb(struct aa_ext *e, struct aa_policydb *policy,
706 bool required_dfa, bool required_trans,
710 int i, flags, error = -EPROTO;
713 size = unpack_perms_table(e, &policy->perms);
716 policy->perms = NULL;
717 *info = "failed to unpack - perms";
723 /* perms table present accept is index */
724 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
726 /* packed perms in accept1 and accept2 */
727 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
728 TO_ACCEPT2_FLAG(YYTD_DATA32);
731 policy->dfa = unpack_dfa(e, flags);
732 if (IS_ERR(policy->dfa)) {
733 error = PTR_ERR(policy->dfa);
735 *info = "failed to unpack - dfa";
737 } else if (!policy->dfa) {
739 *info = "missing required dfa";
746 * only unpack the following if a dfa is present
748 * sadly start was given different names for file and policydb
749 * but since it is optional we can try both
751 if (!aa_unpack_u32(e, &policy->start[0], "start"))
752 /* default start state */
753 policy->start[0] = DFA_START;
754 if (!aa_unpack_u32(e, &policy->start[AA_CLASS_FILE], "dfa_start")) {
755 /* default start state for xmatch and file dfa */
756 policy->start[AA_CLASS_FILE] = DFA_START;
757 } /* setup class index */
758 for (i = AA_CLASS_FILE + 1; i <= AA_CLASS_LAST; i++) {
759 policy->start[i] = aa_dfa_next(policy->dfa, policy->start[0],
762 if (!unpack_trans_table(e, &policy->trans) && required_trans) {
763 *info = "failed to unpack profile transition table";
767 /* TODO: move compat mapping here, requires dfa merging first */
768 /* TODO: move verify here, it has to be done after compat mappings */
777 static u32 strhash(const void *data, u32 len, u32 seed)
779 const char * const *key = data;
781 return jhash(*key, strlen(*key), seed);
784 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
786 const struct aa_data *data = obj;
787 const char * const *key = arg->key;
789 return strcmp(data->key, *key);
793 * unpack_profile - unpack a serialized profile
794 * @e: serialized data extent information (NOT NULL)
795 * @ns_name: pointer of newly allocated copy of %NULL in case of error
797 * NOTE: unpack profile sets audit struct if there is a failure
799 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
801 struct aa_ruleset *rules;
802 struct aa_profile *profile = NULL;
803 const char *tmpname, *tmpns = NULL, *name = NULL;
804 const char *info = "failed to unpack profile";
806 struct rhashtable_params params = { 0 };
808 struct aa_data *data;
815 /* check that we have the right struct being passed */
816 if (!aa_unpack_nameX(e, AA_STRUCT, "profile"))
818 if (!aa_unpack_str(e, &name, NULL))
823 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
825 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
827 info = "out of memory";
834 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
836 info = "out of memory";
840 rules = list_first_entry(&profile->rules, typeof(*rules), list);
842 /* profile renaming is optional */
843 (void) aa_unpack_str(e, &profile->rename, "rename");
845 /* attachment string is optional */
846 (void) aa_unpack_str(e, &profile->attach.xmatch_str, "attach");
848 /* xmatch is optional and may be NULL */
849 error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
855 /* neither xmatch_len not xmatch_perms are optional if xmatch is set */
856 if (profile->attach.xmatch.dfa) {
857 if (!aa_unpack_u32(e, &tmp, NULL)) {
858 info = "missing xmatch len";
861 profile->attach.xmatch_len = tmp;
862 profile->attach.xmatch.start[AA_CLASS_XMATCH] = DFA_START;
863 error = aa_compat_map_xmatch(&profile->attach.xmatch);
865 info = "failed to convert xmatch permission table";
870 /* disconnected attachment string is optional */
871 (void) aa_unpack_str(e, &profile->disconnected, "disconnected");
873 /* per profile debug flags (complain, audit) */
874 if (!aa_unpack_nameX(e, AA_STRUCT, "flags")) {
875 info = "profile missing flags";
878 info = "failed to unpack profile flags";
879 if (!aa_unpack_u32(e, &tmp, NULL))
881 if (tmp & PACKED_FLAG_HAT)
882 profile->label.flags |= FLAG_HAT;
883 if (tmp & PACKED_FLAG_DEBUG1)
884 profile->label.flags |= FLAG_DEBUG1;
885 if (tmp & PACKED_FLAG_DEBUG2)
886 profile->label.flags |= FLAG_DEBUG2;
887 if (!aa_unpack_u32(e, &tmp, NULL))
889 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG)) {
890 profile->mode = APPARMOR_COMPLAIN;
891 } else if (tmp == PACKED_MODE_ENFORCE) {
892 profile->mode = APPARMOR_ENFORCE;
893 } else if (tmp == PACKED_MODE_KILL) {
894 profile->mode = APPARMOR_KILL;
895 } else if (tmp == PACKED_MODE_UNCONFINED) {
896 profile->mode = APPARMOR_UNCONFINED;
897 profile->label.flags |= FLAG_UNCONFINED;
898 } else if (tmp == PACKED_MODE_USER) {
899 profile->mode = APPARMOR_USER;
903 if (!aa_unpack_u32(e, &tmp, NULL))
906 profile->audit = AUDIT_ALL;
908 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
911 /* path_flags is optional */
912 if (aa_unpack_u32(e, &profile->path_flags, "path_flags"))
913 profile->path_flags |= profile->label.flags &
914 PATH_MEDIATE_DELETED;
916 /* set a default value if path_flags field is not present */
917 profile->path_flags = PATH_MEDIATE_DELETED;
919 info = "failed to unpack profile capabilities";
920 if (!aa_unpack_cap_low(e, &rules->caps.allow, NULL))
922 if (!aa_unpack_cap_low(e, &rules->caps.audit, NULL))
924 if (!aa_unpack_cap_low(e, &rules->caps.quiet, NULL))
926 if (!aa_unpack_cap_low(e, &tmpcap, NULL))
929 info = "failed to unpack upper profile capabilities";
930 if (aa_unpack_nameX(e, AA_STRUCT, "caps64")) {
931 /* optional upper half of 64 bit caps */
932 if (!aa_unpack_cap_high(e, &rules->caps.allow, NULL))
934 if (!aa_unpack_cap_high(e, &rules->caps.audit, NULL))
936 if (!aa_unpack_cap_high(e, &rules->caps.quiet, NULL))
938 if (!aa_unpack_cap_high(e, &tmpcap, NULL))
940 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
944 info = "failed to unpack extended profile capabilities";
945 if (aa_unpack_nameX(e, AA_STRUCT, "capsx")) {
946 /* optional extended caps mediation mask */
947 if (!aa_unpack_cap_low(e, &rules->caps.extended, NULL))
949 if (!aa_unpack_cap_high(e, &rules->caps.extended, NULL))
951 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
955 if (!unpack_xattrs(e, profile)) {
956 info = "failed to unpack profile xattrs";
960 if (!unpack_rlimits(e, rules)) {
961 info = "failed to unpack profile rlimits";
965 if (!unpack_secmark(e, rules)) {
966 info = "failed to unpack profile secmark rules";
970 if (aa_unpack_nameX(e, AA_STRUCT, "policydb")) {
971 /* generic policy dfa - optional and may be NULL */
972 info = "failed to unpack policydb";
973 error = unpack_pdb(e, &rules->policy, true, false,
977 /* Fixup: drop when we get rid of start array */
978 if (aa_dfa_next(rules->policy.dfa, rules->policy.start[0],
980 rules->policy.start[AA_CLASS_FILE] =
981 aa_dfa_next(rules->policy.dfa,
982 rules->policy.start[0],
984 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
986 error = aa_compat_map_policy(&rules->policy, e->version);
988 info = "failed to remap policydb permission table";
992 rules->policy.dfa = aa_get_dfa(nulldfa);
995 error = unpack_pdb(e, &rules->file, false, true, &info);
998 } else if (rules->file.dfa) {
999 error = aa_compat_map_file(&rules->file);
1001 info = "failed to remap file permission table";
1004 } else if (rules->policy.dfa &&
1005 rules->policy.start[AA_CLASS_FILE]) {
1006 rules->file.dfa = aa_get_dfa(rules->policy.dfa);
1007 rules->file.start[AA_CLASS_FILE] = rules->policy.start[AA_CLASS_FILE];
1009 rules->file.dfa = aa_get_dfa(nulldfa);
1012 if (aa_unpack_nameX(e, AA_STRUCT, "data")) {
1013 info = "out of memory";
1014 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
1015 if (!profile->data) {
1019 params.nelem_hint = 3;
1020 params.key_len = sizeof(void *);
1021 params.key_offset = offsetof(struct aa_data, key);
1022 params.head_offset = offsetof(struct aa_data, head);
1023 params.hashfn = strhash;
1024 params.obj_cmpfn = datacmp;
1026 if (rhashtable_init(profile->data, ¶ms)) {
1027 info = "failed to init key, value hash table";
1031 while (aa_unpack_strdup(e, &key, NULL)) {
1032 data = kzalloc(sizeof(*data), GFP_KERNEL);
1034 kfree_sensitive(key);
1040 data->size = aa_unpack_blob(e, &data->data, NULL);
1041 data->data = kvmemdup(data->data, data->size, GFP_KERNEL);
1042 if (data->size && !data->data) {
1043 kfree_sensitive(data->key);
1044 kfree_sensitive(data);
1049 rhashtable_insert_fast(profile->data, &data->head,
1053 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1054 info = "failed to unpack end of key, value data table";
1059 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1060 info = "failed to unpack end of profile";
1068 /* default error covers most cases */
1078 audit_iface(profile, NULL, name, info, e, error);
1079 aa_free_profile(profile);
1081 return ERR_PTR(error);
1085 * verify_header - unpack serialized stream header
1086 * @e: serialized data read head (NOT NULL)
1087 * @required: whether the header is required or optional
1088 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
1090 * Returns: error or 0 if header is good
1092 static int verify_header(struct aa_ext *e, int required, const char **ns)
1094 int error = -EPROTONOSUPPORT;
1095 const char *name = NULL;
1098 /* get the interface version */
1099 if (!aa_unpack_u32(e, &e->version, "version")) {
1101 audit_iface(NULL, NULL, NULL, "invalid profile format",
1107 /* Check that the interface version is currently supported.
1108 * if not specified use previous version
1109 * Mask off everything that is not kernel abi version
1111 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1112 audit_iface(NULL, NULL, NULL, "unsupported interface version",
1117 /* read the namespace if present */
1118 if (aa_unpack_str(e, &name, "namespace")) {
1119 if (*name == '\0') {
1120 audit_iface(NULL, NULL, NULL, "invalid namespace name",
1124 if (*ns && strcmp(*ns, name)) {
1125 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1128 *ns = kstrdup(name, GFP_KERNEL);
1137 static bool verify_xindex(int xindex, int table_size)
1140 xtype = xindex & AA_X_TYPE_MASK;
1141 index = xindex & AA_X_INDEX_MASK;
1142 if (xtype == AA_X_TABLE && index >= table_size)
1147 /* verify dfa xindexes are in range of transition tables */
1148 static bool verify_dfa_xindex(struct aa_dfa *dfa, int table_size)
1151 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1152 if (!verify_xindex(ACCEPT_TABLE(dfa)[i], table_size))
1158 static bool verify_perm(struct aa_perms *perm)
1160 /* TODO: allow option to just force the perms into a valid state */
1161 if (perm->allow & perm->deny)
1163 if (perm->subtree & ~perm->allow)
1165 if (perm->cond & (perm->allow | perm->deny))
1167 if (perm->kill & perm->allow)
1169 if (perm->complain & (perm->allow | perm->deny))
1171 if (perm->prompt & (perm->allow | perm->deny))
1173 if (perm->complain & perm->prompt)
1175 if (perm->hide & perm->allow)
1181 static bool verify_perms(struct aa_policydb *pdb)
1185 for (i = 0; i < pdb->size; i++) {
1186 if (!verify_perm(&pdb->perms[i]))
1188 /* verify indexes into str table */
1189 if (pdb->perms[i].xindex >= pdb->trans.size)
1191 if (pdb->perms[i].tag >= pdb->trans.size)
1193 if (pdb->perms[i].label >= pdb->trans.size)
1201 * verify_profile - Do post unpack analysis to verify profile consistency
1202 * @profile: profile to verify (NOT NULL)
1204 * Returns: 0 if passes verification else error
1206 * This verification is post any unpack mapping or changes
1208 static int verify_profile(struct aa_profile *profile)
1210 struct aa_ruleset *rules = list_first_entry(&profile->rules,
1211 typeof(*rules), list);
1215 if ((rules->file.dfa && !verify_dfa_xindex(rules->file.dfa,
1216 rules->file.trans.size)) ||
1217 (rules->policy.dfa &&
1218 !verify_dfa_xindex(rules->policy.dfa, rules->policy.trans.size))) {
1219 audit_iface(profile, NULL, NULL,
1220 "Unpack: Invalid named transition", NULL, -EPROTO);
1224 if (!verify_perms(&rules->file)) {
1225 audit_iface(profile, NULL, NULL,
1226 "Unpack: Invalid perm index", NULL, -EPROTO);
1229 if (!verify_perms(&rules->policy)) {
1230 audit_iface(profile, NULL, NULL,
1231 "Unpack: Invalid perm index", NULL, -EPROTO);
1234 if (!verify_perms(&profile->attach.xmatch)) {
1235 audit_iface(profile, NULL, NULL,
1236 "Unpack: Invalid perm index", NULL, -EPROTO);
1243 void aa_load_ent_free(struct aa_load_ent *ent)
1246 aa_put_profile(ent->rename);
1247 aa_put_profile(ent->old);
1248 aa_put_profile(ent->new);
1249 kfree(ent->ns_name);
1250 kfree_sensitive(ent);
1254 struct aa_load_ent *aa_load_ent_alloc(void)
1256 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1258 INIT_LIST_HEAD(&ent->list);
1262 static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
1264 #ifdef CONFIG_SECURITY_APPARMOR_EXPORT_BINARY
1265 const zstd_parameters params =
1266 zstd_get_params(aa_g_rawdata_compression_level, slen);
1267 const size_t wksp_len = zstd_cctx_workspace_bound(¶ms.cParams);
1269 zstd_cctx *ctx = NULL;
1270 size_t out_len = zstd_compress_bound(slen);
1274 out = kvzalloc(out_len, GFP_KERNEL);
1280 wksp = kvzalloc(wksp_len, GFP_KERNEL);
1286 ctx = zstd_init_cctx(wksp, wksp_len);
1292 out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, ¶ms);
1293 if (zstd_is_error(out_len) || out_len >= slen) {
1298 if (is_vmalloc_addr(out)) {
1299 *dst = kvzalloc(out_len, GFP_KERNEL);
1301 memcpy(*dst, out, out_len);
1307 * If the staging buffer was kmalloc'd, then using krealloc is
1308 * probably going to be faster. The destination buffer will
1309 * always be smaller, so it's just shrunk, avoiding a memcpy
1311 *dst = krealloc(out, out_len, GFP_KERNEL);
1335 static int compress_loaddata(struct aa_loaddata *data)
1337 AA_BUG(data->compressed_size > 0);
1340 * Shortcut the no compression case, else we increase the amount of
1341 * storage required by a small amount
1343 if (aa_g_rawdata_compression_level != 0) {
1344 void *udata = data->data;
1345 int error = compress_zstd(udata, data->size, &data->data,
1346 &data->compressed_size);
1348 data->compressed_size = data->size;
1351 if (udata != data->data)
1354 data->compressed_size = data->size;
1360 * aa_unpack - unpack packed binary profile(s) data loaded from user space
1361 * @udata: user data copied to kmem (NOT NULL)
1362 * @lh: list to place unpacked profiles in a aa_repl_ws
1363 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1365 * Unpack user data and return refcounted allocated profile(s) stored in
1366 * @lh in order of discovery, with the list chain stored in base.list
1369 * Returns: profile(s) on @lh else error pointer if fails to unpack
1371 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1374 struct aa_load_ent *tmp, *ent;
1375 struct aa_profile *profile = NULL;
1376 char *ns_name = NULL;
1379 .start = udata->data,
1380 .end = udata->data + udata->size,
1385 while (e.pos < e.end) {
1387 error = verify_header(&e, e.pos == e.start, ns);
1392 profile = unpack_profile(&e, &ns_name);
1393 if (IS_ERR(profile)) {
1394 error = PTR_ERR(profile);
1398 error = verify_profile(profile);
1402 if (aa_g_hash_policy)
1403 error = aa_calc_profile_hash(profile, e.version, start,
1408 ent = aa_load_ent_alloc();
1415 ent->ns_name = ns_name;
1417 list_add_tail(&ent->list, lh);
1419 udata->abi = e.version & K_ABI_MASK;
1420 if (aa_g_hash_policy) {
1421 udata->hash = aa_calc_hash(udata->data, udata->size);
1422 if (IS_ERR(udata->hash)) {
1423 error = PTR_ERR(udata->hash);
1429 if (aa_g_export_binary) {
1430 error = compress_loaddata(udata);
1438 aa_put_profile(profile);
1441 list_for_each_entry_safe(ent, tmp, lh, list) {
1442 list_del_init(&ent->list);
1443 aa_load_ent_free(ent);