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>
20 #include "include/apparmor.h"
21 #include "include/audit.h"
22 #include "include/cred.h"
23 #include "include/crypto.h"
24 #include "include/match.h"
25 #include "include/path.h"
26 #include "include/policy.h"
27 #include "include/policy_unpack.h"
29 #define K_ABI_MASK 0x3ff
30 #define FORCE_COMPLAIN_FLAG 0x800
31 #define VERSION_LT(X, Y) (((X) & K_ABI_MASK) < ((Y) & K_ABI_MASK))
32 #define VERSION_GT(X, Y) (((X) & K_ABI_MASK) > ((Y) & K_ABI_MASK))
34 #define v5 5 /* base version */
35 #define v6 6 /* per entry policydb mediation check */
37 #define v8 8 /* full network masking */
40 * The AppArmor interface treats data as a type byte followed by the
41 * actual data. The interface has the notion of a a named entry
42 * which has a name (AA_NAME typecode followed by name string) followed by
43 * the entries typecode and data. Named types allow for optional
44 * elements and extensions to be added and tested for without breaking
45 * backwards compatibility.
53 AA_NAME, /* same as string except it is items name */
65 * aa_ext is the read of the buffer containing the serialized profile. The
66 * data is copied into a kernel buffer in apparmorfs and then handed off to
67 * the unpack routines.
72 void *pos; /* pointer to current position in the buffer */
76 /* audit callback for unpack fields */
77 static void audit_cb(struct audit_buffer *ab, void *va)
79 struct common_audit_data *sa = va;
81 if (aad(sa)->iface.ns) {
82 audit_log_format(ab, " ns=");
83 audit_log_untrustedstring(ab, aad(sa)->iface.ns);
86 audit_log_format(ab, " name=");
87 audit_log_untrustedstring(ab, aad(sa)->name);
89 if (aad(sa)->iface.pos)
90 audit_log_format(ab, " offset=%ld", aad(sa)->iface.pos);
94 * audit_iface - do audit message for policy unpacking/load/replace/remove
95 * @new: profile if it has been allocated (MAYBE NULL)
96 * @ns_name: name of the ns the profile is to be loaded to (MAY BE NULL)
97 * @name: name of the profile being manipulated (MAYBE NULL)
98 * @info: any extra info about the failure (MAYBE NULL)
99 * @e: buffer position info
102 * Returns: %0 or error
104 static int audit_iface(struct aa_profile *new, const char *ns_name,
105 const char *name, const char *info, struct aa_ext *e,
108 struct aa_profile *profile = labels_profile(aa_current_raw_label());
109 DEFINE_AUDIT_DATA(sa, LSM_AUDIT_DATA_NONE, NULL);
111 aad(&sa)->iface.pos = e->pos - e->start;
112 aad(&sa)->iface.ns = ns_name;
114 aad(&sa)->name = new->base.hname;
116 aad(&sa)->name = name;
117 aad(&sa)->info = info;
118 aad(&sa)->error = error;
120 return aa_audit(AUDIT_APPARMOR_STATUS, profile, &sa, audit_cb);
123 void __aa_loaddata_update(struct aa_loaddata *data, long revision)
127 AA_BUG(!data->dents[AAFS_LOADDATA_REVISION]);
128 AA_BUG(!mutex_is_locked(&data->ns->lock));
129 AA_BUG(data->revision > revision);
131 data->revision = revision;
132 d_inode(data->dents[AAFS_LOADDATA_DIR])->i_mtime =
133 current_time(d_inode(data->dents[AAFS_LOADDATA_DIR]));
134 d_inode(data->dents[AAFS_LOADDATA_REVISION])->i_mtime =
135 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 (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0)
144 return memcmp(l->data, r->data, r->size) == 0;
148 * need to take the ns mutex lock which is NOT safe most places that
149 * put_loaddata is called, so we have to delay freeing it
151 static void do_loaddata_free(struct work_struct *work)
153 struct aa_loaddata *d = container_of(work, struct aa_loaddata, work);
154 struct aa_ns *ns = aa_get_ns(d->ns);
157 mutex_lock_nested(&ns->lock, ns->level);
158 __aa_fs_remove_rawdata(d);
159 mutex_unlock(&ns->lock);
169 void aa_loaddata_kref(struct kref *kref)
171 struct aa_loaddata *d = container_of(kref, struct aa_loaddata, count);
174 INIT_WORK(&d->work, do_loaddata_free);
175 schedule_work(&d->work);
179 struct aa_loaddata *aa_loaddata_alloc(size_t size)
181 struct aa_loaddata *d;
183 d = kzalloc(sizeof(*d), GFP_KERNEL);
185 return ERR_PTR(-ENOMEM);
186 d->data = kvzalloc(size, GFP_KERNEL);
189 return ERR_PTR(-ENOMEM);
191 kref_init(&d->count);
192 INIT_LIST_HEAD(&d->list);
197 /* test if read will be in packed data bounds */
198 static bool inbounds(struct aa_ext *e, size_t size)
200 return (size <= e->end - e->pos);
203 static void *kvmemdup(const void *src, size_t len)
205 void *p = kvmalloc(len, GFP_KERNEL);
213 * aa_u16_chunck - test and do bounds checking for a u16 size based chunk
214 * @e: serialized data read head (NOT NULL)
215 * @chunk: start address for chunk of data (NOT NULL)
217 * Returns: the size of chunk found with the read head at the end of the chunk.
219 static size_t unpack_u16_chunk(struct aa_ext *e, char **chunk)
224 if (!inbounds(e, sizeof(u16)))
226 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
227 e->pos += sizeof(__le16);
228 if (!inbounds(e, size))
239 /* unpack control byte */
240 static bool unpack_X(struct aa_ext *e, enum aa_code code)
244 if (*(u8 *) e->pos != code)
251 * unpack_nameX - check is the next element is of type X with a name of @name
252 * @e: serialized data extent information (NOT NULL)
254 * @name: name to match to the serialized element. (MAYBE NULL)
256 * check that the next serialized data element is of type X and has a tag
257 * name @name. If @name is specified then there must be a matching
258 * name element in the stream. If @name is NULL any name element will be
259 * skipped and only the typecode will be tested.
261 * Returns 1 on success (both type code and name tests match) and the read
262 * head is advanced past the headers
264 * Returns: 0 if either match fails, the read head does not move
266 static bool unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
269 * May need to reset pos if name or type doesn't match
273 * Check for presence of a tagname, and if present name size
274 * AA_NAME tag value is a u16.
276 if (unpack_X(e, AA_NAME)) {
278 size_t size = unpack_u16_chunk(e, &tag);
279 /* if a name is specified it must match. otherwise skip tag */
280 if (name && (!size || tag[size-1] != '\0' || strcmp(name, tag)))
283 /* if a name is specified and there is no name tag fail */
287 /* now check if type code matches */
288 if (unpack_X(e, code))
296 static bool unpack_u8(struct aa_ext *e, u8 *data, const char *name)
300 if (unpack_nameX(e, AA_U8, name)) {
301 if (!inbounds(e, sizeof(u8)))
304 *data = get_unaligned((u8 *)e->pos);
305 e->pos += sizeof(u8);
314 static bool unpack_u32(struct aa_ext *e, u32 *data, const char *name)
318 if (unpack_nameX(e, AA_U32, name)) {
319 if (!inbounds(e, sizeof(u32)))
322 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
323 e->pos += sizeof(u32);
332 static bool unpack_u64(struct aa_ext *e, u64 *data, const char *name)
336 if (unpack_nameX(e, AA_U64, name)) {
337 if (!inbounds(e, sizeof(u64)))
340 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
341 e->pos += sizeof(u64);
350 static size_t unpack_array(struct aa_ext *e, const char *name)
354 if (unpack_nameX(e, AA_ARRAY, name)) {
356 if (!inbounds(e, sizeof(u16)))
358 size = (int)le16_to_cpu(get_unaligned((__le16 *) e->pos));
359 e->pos += sizeof(u16);
368 static size_t unpack_blob(struct aa_ext *e, char **blob, const char *name)
372 if (unpack_nameX(e, AA_BLOB, name)) {
374 if (!inbounds(e, sizeof(u32)))
376 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
377 e->pos += sizeof(u32);
378 if (inbounds(e, (size_t) size)) {
390 static int unpack_str(struct aa_ext *e, const char **string, const char *name)
396 if (unpack_nameX(e, AA_STRING, name)) {
397 size = unpack_u16_chunk(e, &src_str);
399 /* strings are null terminated, length is size - 1 */
400 if (src_str[size - 1] != 0)
413 static int unpack_strdup(struct aa_ext *e, char **string, const char *name)
417 int res = unpack_str(e, &tmp, name);
423 *string = kmemdup(tmp, res, GFP_KERNEL);
434 * unpack_dfa - unpack a file rule dfa
435 * @e: serialized data extent information (NOT NULL)
437 * returns dfa or ERR_PTR or NULL if no dfa
439 static struct aa_dfa *unpack_dfa(struct aa_ext *e)
443 struct aa_dfa *dfa = NULL;
445 size = unpack_blob(e, &blob, "aadfa");
448 * The dfa is aligned with in the blob to 8 bytes
449 * from the beginning of the stream.
450 * alignment adjust needed by dfa unpack
452 size_t sz = blob - (char *) e->start -
453 ((e->pos - e->start) & 7);
454 size_t pad = ALIGN(sz, 8) - sz;
455 int flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
456 TO_ACCEPT2_FLAG(YYTD_DATA32) | DFA_FLAG_VERIFY_STATES;
457 dfa = aa_dfa_unpack(blob + pad, size - pad, flags);
468 * unpack_trans_table - unpack a profile transition table
469 * @e: serialized data extent information (NOT NULL)
470 * @profile: profile to add the accept table to (NOT NULL)
472 * Returns: 1 if table successfully unpacked
474 static bool unpack_trans_table(struct aa_ext *e, struct aa_profile *profile)
476 void *saved_pos = e->pos;
478 /* exec table is optional */
479 if (unpack_nameX(e, AA_STRUCT, "xtable")) {
482 size = unpack_array(e, NULL);
483 /* currently 4 exec bits and entries 0-3 are reserved iupcx */
486 profile->file.trans.table = kcalloc(size, sizeof(char *),
488 if (!profile->file.trans.table)
491 profile->file.trans.size = size;
492 for (i = 0; i < size; i++) {
494 int c, j, pos, size2 = unpack_strdup(e, &str, NULL);
495 /* unpack_strdup verifies that the last character is
496 * null termination byte.
500 profile->file.trans.table[i] = str;
501 /* verify that name doesn't start with space */
505 /* count internal # of internal \0 */
506 for (c = j = 0; j < size2 - 1; j++) {
513 /* first character after : must be valid */
516 /* beginning with : requires an embedded \0,
517 * verify that exactly 1 internal \0 exists
518 * trailing \0 already verified by unpack_strdup
520 * convert \0 back to : for label_parse
527 /* fail - all other cases with embedded \0 */
530 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
532 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
538 aa_free_domain_entries(&profile->file.trans);
543 static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
547 if (unpack_nameX(e, AA_STRUCT, "xattrs")) {
550 size = unpack_array(e, NULL);
551 profile->xattr_count = size;
552 profile->xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
553 if (!profile->xattrs)
555 for (i = 0; i < size; i++) {
556 if (!unpack_strdup(e, &profile->xattrs[i], NULL))
559 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
561 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
572 static bool unpack_secmark(struct aa_ext *e, struct aa_profile *profile)
577 if (unpack_nameX(e, AA_STRUCT, "secmark")) {
578 size = unpack_array(e, NULL);
580 profile->secmark = kcalloc(size, sizeof(struct aa_secmark),
582 if (!profile->secmark)
585 profile->secmark_count = size;
587 for (i = 0; i < size; i++) {
588 if (!unpack_u8(e, &profile->secmark[i].audit, NULL))
590 if (!unpack_u8(e, &profile->secmark[i].deny, NULL))
592 if (!unpack_strdup(e, &profile->secmark[i].label, NULL))
595 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
597 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
604 if (profile->secmark) {
605 for (i = 0; i < size; i++)
606 kfree(profile->secmark[i].label);
607 kfree(profile->secmark);
608 profile->secmark_count = 0;
609 profile->secmark = NULL;
616 static bool unpack_rlimits(struct aa_ext *e, struct aa_profile *profile)
620 /* rlimits are optional */
621 if (unpack_nameX(e, AA_STRUCT, "rlimits")) {
624 if (!unpack_u32(e, &tmp, NULL))
626 profile->rlimits.mask = tmp;
628 size = unpack_array(e, NULL);
629 if (size > RLIM_NLIMITS)
631 for (i = 0; i < size; i++) {
633 int a = aa_map_resource(i);
634 if (!unpack_u64(e, &tmp2, NULL))
636 profile->rlimits.limits[a].rlim_max = tmp2;
638 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
640 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
650 static u32 strhash(const void *data, u32 len, u32 seed)
652 const char * const *key = data;
654 return jhash(*key, strlen(*key), seed);
657 static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
659 const struct aa_data *data = obj;
660 const char * const *key = arg->key;
662 return strcmp(data->key, *key);
666 * unpack_profile - unpack a serialized profile
667 * @e: serialized data extent information (NOT NULL)
669 * NOTE: unpack profile sets audit struct if there is a failure
671 static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
673 struct aa_profile *profile = NULL;
674 const char *tmpname, *tmpns = NULL, *name = NULL;
675 const char *info = "failed to unpack profile";
677 struct rhashtable_params params = { 0 };
679 struct aa_data *data;
680 int i, error = -EPROTO;
686 /* check that we have the right struct being passed */
687 if (!unpack_nameX(e, AA_STRUCT, "profile"))
689 if (!unpack_str(e, &name, NULL))
694 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
696 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
698 info = "out of memory";
704 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
706 return ERR_PTR(-ENOMEM);
708 /* profile renaming is optional */
709 (void) unpack_str(e, &profile->rename, "rename");
711 /* attachment string is optional */
712 (void) unpack_str(e, &profile->attach, "attach");
714 /* xmatch is optional and may be NULL */
715 profile->xmatch = unpack_dfa(e);
716 if (IS_ERR(profile->xmatch)) {
717 error = PTR_ERR(profile->xmatch);
718 profile->xmatch = NULL;
722 /* xmatch_len is not optional if xmatch is set */
723 if (profile->xmatch) {
724 if (!unpack_u32(e, &tmp, NULL)) {
725 info = "missing xmatch len";
728 profile->xmatch_len = tmp;
731 /* disconnected attachment string is optional */
732 (void) unpack_str(e, &profile->disconnected, "disconnected");
734 /* per profile debug flags (complain, audit) */
735 if (!unpack_nameX(e, AA_STRUCT, "flags")) {
736 info = "profile missing flags";
739 info = "failed to unpack profile flags";
740 if (!unpack_u32(e, &tmp, NULL))
742 if (tmp & PACKED_FLAG_HAT)
743 profile->label.flags |= FLAG_HAT;
744 if (!unpack_u32(e, &tmp, NULL))
746 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG))
747 profile->mode = APPARMOR_COMPLAIN;
748 else if (tmp == PACKED_MODE_KILL)
749 profile->mode = APPARMOR_KILL;
750 else if (tmp == PACKED_MODE_UNCONFINED)
751 profile->mode = APPARMOR_UNCONFINED;
752 if (!unpack_u32(e, &tmp, NULL))
755 profile->audit = AUDIT_ALL;
757 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
760 /* path_flags is optional */
761 if (unpack_u32(e, &profile->path_flags, "path_flags"))
762 profile->path_flags |= profile->label.flags &
763 PATH_MEDIATE_DELETED;
765 /* set a default value if path_flags field is not present */
766 profile->path_flags = PATH_MEDIATE_DELETED;
768 info = "failed to unpack profile capabilities";
769 if (!unpack_u32(e, &(profile->caps.allow.cap[0]), NULL))
771 if (!unpack_u32(e, &(profile->caps.audit.cap[0]), NULL))
773 if (!unpack_u32(e, &(profile->caps.quiet.cap[0]), NULL))
775 if (!unpack_u32(e, &tmpcap.cap[0], NULL))
778 info = "failed to unpack upper profile capabilities";
779 if (unpack_nameX(e, AA_STRUCT, "caps64")) {
780 /* optional upper half of 64 bit caps */
781 if (!unpack_u32(e, &(profile->caps.allow.cap[1]), NULL))
783 if (!unpack_u32(e, &(profile->caps.audit.cap[1]), NULL))
785 if (!unpack_u32(e, &(profile->caps.quiet.cap[1]), NULL))
787 if (!unpack_u32(e, &(tmpcap.cap[1]), NULL))
789 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
793 info = "failed to unpack extended profile capabilities";
794 if (unpack_nameX(e, AA_STRUCT, "capsx")) {
795 /* optional extended caps mediation mask */
796 if (!unpack_u32(e, &(profile->caps.extended.cap[0]), NULL))
798 if (!unpack_u32(e, &(profile->caps.extended.cap[1]), NULL))
800 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
804 if (!unpack_xattrs(e, profile)) {
805 info = "failed to unpack profile xattrs";
809 if (!unpack_rlimits(e, profile)) {
810 info = "failed to unpack profile rlimits";
814 if (!unpack_secmark(e, profile)) {
815 info = "failed to unpack profile secmark rules";
819 if (unpack_nameX(e, AA_STRUCT, "policydb")) {
820 /* generic policy dfa - optional and may be NULL */
821 info = "failed to unpack policydb";
822 profile->policy.dfa = unpack_dfa(e);
823 if (IS_ERR(profile->policy.dfa)) {
824 error = PTR_ERR(profile->policy.dfa);
825 profile->policy.dfa = NULL;
827 } else if (!profile->policy.dfa) {
831 if (!unpack_u32(e, &profile->policy.start[0], "start"))
832 /* default start state */
833 profile->policy.start[0] = DFA_START;
834 /* setup class index */
835 for (i = AA_CLASS_FILE; i <= AA_CLASS_LAST; i++) {
836 profile->policy.start[i] =
837 aa_dfa_next(profile->policy.dfa,
838 profile->policy.start[0],
841 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
844 profile->policy.dfa = aa_get_dfa(nulldfa);
847 profile->file.dfa = unpack_dfa(e);
848 if (IS_ERR(profile->file.dfa)) {
849 error = PTR_ERR(profile->file.dfa);
850 profile->file.dfa = NULL;
851 info = "failed to unpack profile file rules";
853 } else if (profile->file.dfa) {
854 if (!unpack_u32(e, &profile->file.start, "dfa_start"))
855 /* default start state */
856 profile->file.start = DFA_START;
857 } else if (profile->policy.dfa &&
858 profile->policy.start[AA_CLASS_FILE]) {
859 profile->file.dfa = aa_get_dfa(profile->policy.dfa);
860 profile->file.start = profile->policy.start[AA_CLASS_FILE];
862 profile->file.dfa = aa_get_dfa(nulldfa);
864 if (!unpack_trans_table(e, profile)) {
865 info = "failed to unpack profile transition table";
869 if (unpack_nameX(e, AA_STRUCT, "data")) {
870 info = "out of memory";
871 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
875 params.nelem_hint = 3;
876 params.key_len = sizeof(void *);
877 params.key_offset = offsetof(struct aa_data, key);
878 params.head_offset = offsetof(struct aa_data, head);
879 params.hashfn = strhash;
880 params.obj_cmpfn = datacmp;
882 if (rhashtable_init(profile->data, ¶ms)) {
883 info = "failed to init key, value hash table";
887 while (unpack_strdup(e, &key, NULL)) {
888 data = kzalloc(sizeof(*data), GFP_KERNEL);
895 data->size = unpack_blob(e, &data->data, NULL);
896 data->data = kvmemdup(data->data, data->size);
897 if (data->size && !data->data) {
903 rhashtable_insert_fast(profile->data, &data->head,
907 if (!unpack_nameX(e, AA_STRUCTEND, NULL)) {
908 info = "failed to unpack end of key, value data table";
913 if (!unpack_nameX(e, AA_STRUCTEND, NULL)) {
914 info = "failed to unpack end of profile";
925 audit_iface(profile, NULL, name, info, e, error);
926 aa_free_profile(profile);
928 return ERR_PTR(error);
932 * verify_head - unpack serialized stream header
933 * @e: serialized data read head (NOT NULL)
934 * @required: whether the header is required or optional
935 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
937 * Returns: error or 0 if header is good
939 static int verify_header(struct aa_ext *e, int required, const char **ns)
941 int error = -EPROTONOSUPPORT;
942 const char *name = NULL;
945 /* get the interface version */
946 if (!unpack_u32(e, &e->version, "version")) {
948 audit_iface(NULL, NULL, NULL, "invalid profile format",
954 /* Check that the interface version is currently supported.
955 * if not specified use previous version
956 * Mask off everything that is not kernel abi version
958 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v8)) {
959 audit_iface(NULL, NULL, NULL, "unsupported interface version",
964 /* read the namespace if present */
965 if (unpack_str(e, &name, "namespace")) {
967 audit_iface(NULL, NULL, NULL, "invalid namespace name",
971 if (*ns && strcmp(*ns, name))
972 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
981 static bool verify_xindex(int xindex, int table_size)
984 xtype = xindex & AA_X_TYPE_MASK;
985 index = xindex & AA_X_INDEX_MASK;
986 if (xtype == AA_X_TABLE && index >= table_size)
991 /* verify dfa xindexes are in range of transition tables */
992 static bool verify_dfa_xindex(struct aa_dfa *dfa, int table_size)
995 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
996 if (!verify_xindex(dfa_user_xindex(dfa, i), table_size))
998 if (!verify_xindex(dfa_other_xindex(dfa, i), table_size))
1005 * verify_profile - Do post unpack analysis to verify profile consistency
1006 * @profile: profile to verify (NOT NULL)
1008 * Returns: 0 if passes verification else error
1010 static int verify_profile(struct aa_profile *profile)
1012 if (profile->file.dfa &&
1013 !verify_dfa_xindex(profile->file.dfa,
1014 profile->file.trans.size)) {
1015 audit_iface(profile, NULL, NULL, "Invalid named transition",
1023 void aa_load_ent_free(struct aa_load_ent *ent)
1026 aa_put_profile(ent->rename);
1027 aa_put_profile(ent->old);
1028 aa_put_profile(ent->new);
1029 kfree(ent->ns_name);
1034 struct aa_load_ent *aa_load_ent_alloc(void)
1036 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1038 INIT_LIST_HEAD(&ent->list);
1043 * aa_unpack - unpack packed binary profile(s) data loaded from user space
1044 * @udata: user data copied to kmem (NOT NULL)
1045 * @lh: list to place unpacked profiles in a aa_repl_ws
1046 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1048 * Unpack user data and return refcounted allocated profile(s) stored in
1049 * @lh in order of discovery, with the list chain stored in base.list
1052 * Returns: profile(s) on @lh else error pointer if fails to unpack
1054 int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1057 struct aa_load_ent *tmp, *ent;
1058 struct aa_profile *profile = NULL;
1061 .start = udata->data,
1062 .end = udata->data + udata->size,
1067 while (e.pos < e.end) {
1068 char *ns_name = NULL;
1070 error = verify_header(&e, e.pos == e.start, ns);
1075 profile = unpack_profile(&e, &ns_name);
1076 if (IS_ERR(profile)) {
1077 error = PTR_ERR(profile);
1081 error = verify_profile(profile);
1085 if (aa_g_hash_policy)
1086 error = aa_calc_profile_hash(profile, e.version, start,
1091 ent = aa_load_ent_alloc();
1098 ent->ns_name = ns_name;
1099 list_add_tail(&ent->list, lh);
1101 udata->abi = e.version & K_ABI_MASK;
1102 if (aa_g_hash_policy) {
1103 udata->hash = aa_calc_hash(udata->data, udata->size);
1104 if (IS_ERR(udata->hash)) {
1105 error = PTR_ERR(udata->hash);
1113 aa_put_profile(profile);
1116 list_for_each_entry_safe(ent, tmp, lh, list) {
1117 list_del_init(&ent->list);
1118 aa_load_ent_free(ent);