2 * AppArmor security module
4 * This file contains AppArmor functions for unpacking policy loaded from
7 * Copyright (C) 1998-2008 Novell/SUSE
8 * Copyright 2009-2010 Canonical Ltd.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License as
12 * published by the Free Software Foundation, version 2 of the
15 * AppArmor uses a serialized binary format for loading policy. To find
16 * policy format documentation see Documentation/admin-guide/LSM/apparmor.rst
17 * All policy is validated before it is used.
20 #include <asm/unaligned.h>
21 #include <linux/ctype.h>
22 #include <linux/errno.h>
24 #include "include/apparmor.h"
25 #include "include/audit.h"
26 #include "include/context.h"
27 #include "include/crypto.h"
28 #include "include/match.h"
29 #include "include/path.h"
30 #include "include/policy.h"
31 #include "include/policy_unpack.h"
33 #define K_ABI_MASK 0x3ff
34 #define FORCE_COMPLAIN_FLAG 0x800
35 #define VERSION_LT(X, Y) (((X) & K_ABI_MASK) < ((Y) & K_ABI_MASK))
36 #define VERSION_GT(X, Y) (((X) & K_ABI_MASK) > ((Y) & K_ABI_MASK))
38 #define v5 5 /* base version */
39 #define v6 6 /* per entry policydb mediation check */
40 #define v7 7 /* full network masking */
43 * The AppArmor interface treats data as a type byte followed by the
44 * actual data. The interface has the notion of a a named entry
45 * which has a name (AA_NAME typecode followed by name string) followed by
46 * the entries typecode and data. Named types allow for optional
47 * elements and extensions to be added and tested for without breaking
48 * backwards compatibility.
56 AA_NAME
, /* same as string except it is items name */
68 * aa_ext is the read of the buffer containing the serialized profile. The
69 * data is copied into a kernel buffer in apparmorfs and then handed off to
70 * the unpack routines.
75 void *pos
; /* pointer to current position in the buffer */
79 /* audit callback for unpack fields */
80 static void audit_cb(struct audit_buffer
*ab
, void *va
)
82 struct common_audit_data
*sa
= va
;
84 if (aad(sa
)->iface
.ns
) {
85 audit_log_format(ab
, " ns=");
86 audit_log_untrustedstring(ab
, aad(sa
)->iface
.ns
);
88 if (aad(sa
)->iface
.name
) {
89 audit_log_format(ab
, " name=");
90 audit_log_untrustedstring(ab
, aad(sa
)->iface
.name
);
92 if (aad(sa
)->iface
.pos
)
93 audit_log_format(ab
, " offset=%ld", aad(sa
)->iface
.pos
);
97 * audit_iface - do audit message for policy unpacking/load/replace/remove
98 * @new: profile if it has been allocated (MAYBE NULL)
99 * @ns_name: name of the ns the profile is to be loaded to (MAY BE NULL)
100 * @name: name of the profile being manipulated (MAYBE NULL)
101 * @info: any extra info about the failure (MAYBE NULL)
102 * @e: buffer position info
105 * Returns: %0 or error
107 static int audit_iface(struct aa_profile
*new, const char *ns_name
,
108 const char *name
, const char *info
, struct aa_ext
*e
,
111 struct aa_profile
*profile
= labels_profile(aa_current_raw_label());
112 DEFINE_AUDIT_DATA(sa
, LSM_AUDIT_DATA_NONE
, NULL
);
114 aad(&sa
)->iface
.pos
= e
->pos
- e
->start
;
115 aad(&sa
)->iface
.ns
= ns_name
;
117 aad(&sa
)->iface
.name
= new->base
.hname
;
119 aad(&sa
)->iface
.name
= name
;
120 aad(&sa
)->info
= info
;
121 aad(&sa
)->error
= error
;
123 return aa_audit(AUDIT_APPARMOR_STATUS
, profile
, &sa
, audit_cb
);
126 void __aa_loaddata_update(struct aa_loaddata
*data
, long revision
)
130 AA_BUG(!data
->dents
[AAFS_LOADDATA_REVISION
]);
131 AA_BUG(!mutex_is_locked(&data
->ns
->lock
));
132 AA_BUG(data
->revision
> revision
);
134 data
->revision
= revision
;
135 d_inode(data
->dents
[AAFS_LOADDATA_DIR
])->i_mtime
=
136 current_time(d_inode(data
->dents
[AAFS_LOADDATA_DIR
]));
137 d_inode(data
->dents
[AAFS_LOADDATA_REVISION
])->i_mtime
=
138 current_time(d_inode(data
->dents
[AAFS_LOADDATA_REVISION
]));
141 bool aa_rawdata_eq(struct aa_loaddata
*l
, struct aa_loaddata
*r
)
143 if (l
->size
!= r
->size
)
145 if (aa_g_hash_policy
&& memcmp(l
->hash
, r
->hash
, aa_hash_size()) != 0)
147 return memcmp(l
->data
, r
->data
, r
->size
) == 0;
151 * need to take the ns mutex lock which is NOT safe most places that
152 * put_loaddata is called, so we have to delay freeing it
154 static void do_loaddata_free(struct work_struct
*work
)
156 struct aa_loaddata
*d
= container_of(work
, struct aa_loaddata
, work
);
157 struct aa_ns
*ns
= aa_get_ns(d
->ns
);
160 mutex_lock(&ns
->lock
);
161 __aa_fs_remove_rawdata(d
);
162 mutex_unlock(&ns
->lock
);
171 void aa_loaddata_kref(struct kref
*kref
)
173 struct aa_loaddata
*d
= container_of(kref
, struct aa_loaddata
, count
);
176 INIT_WORK(&d
->work
, do_loaddata_free
);
177 schedule_work(&d
->work
);
181 struct aa_loaddata
*aa_loaddata_alloc(size_t size
)
183 struct aa_loaddata
*d
= kvzalloc(sizeof(*d
) + size
, GFP_KERNEL
);
186 return ERR_PTR(-ENOMEM
);
187 kref_init(&d
->count
);
188 INIT_LIST_HEAD(&d
->list
);
193 /* test if read will be in packed data bounds */
194 static bool inbounds(struct aa_ext
*e
, size_t size
)
196 return (size
<= e
->end
- e
->pos
);
200 * aa_u16_chunck - test and do bounds checking for a u16 size based chunk
201 * @e: serialized data read head (NOT NULL)
202 * @chunk: start address for chunk of data (NOT NULL)
204 * Returns: the size of chunk found with the read head at the end of the chunk.
206 static size_t unpack_u16_chunk(struct aa_ext
*e
, char **chunk
)
210 if (!inbounds(e
, sizeof(u16
)))
212 size
= le16_to_cpu(get_unaligned((__le16
*) e
->pos
));
213 e
->pos
+= sizeof(__le16
);
214 if (!inbounds(e
, size
))
221 /* unpack control byte */
222 static bool unpack_X(struct aa_ext
*e
, enum aa_code code
)
226 if (*(u8
*) e
->pos
!= code
)
233 * unpack_nameX - check is the next element is of type X with a name of @name
234 * @e: serialized data extent information (NOT NULL)
236 * @name: name to match to the serialized element. (MAYBE NULL)
238 * check that the next serialized data element is of type X and has a tag
239 * name @name. If @name is specified then there must be a matching
240 * name element in the stream. If @name is NULL any name element will be
241 * skipped and only the typecode will be tested.
243 * Returns 1 on success (both type code and name tests match) and the read
244 * head is advanced past the headers
246 * Returns: 0 if either match fails, the read head does not move
248 static bool unpack_nameX(struct aa_ext
*e
, enum aa_code code
, const char *name
)
251 * May need to reset pos if name or type doesn't match
255 * Check for presence of a tagname, and if present name size
256 * AA_NAME tag value is a u16.
258 if (unpack_X(e
, AA_NAME
)) {
260 size_t size
= unpack_u16_chunk(e
, &tag
);
261 /* if a name is specified it must match. otherwise skip tag */
262 if (name
&& (!size
|| strcmp(name
, tag
)))
265 /* if a name is specified and there is no name tag fail */
269 /* now check if type code matches */
270 if (unpack_X(e
, code
))
278 static bool unpack_u32(struct aa_ext
*e
, u32
*data
, const char *name
)
280 if (unpack_nameX(e
, AA_U32
, name
)) {
281 if (!inbounds(e
, sizeof(u32
)))
284 *data
= le32_to_cpu(get_unaligned((__le32
*) e
->pos
));
285 e
->pos
+= sizeof(u32
);
291 static bool unpack_u64(struct aa_ext
*e
, u64
*data
, const char *name
)
293 if (unpack_nameX(e
, AA_U64
, name
)) {
294 if (!inbounds(e
, sizeof(u64
)))
297 *data
= le64_to_cpu(get_unaligned((__le64
*) e
->pos
));
298 e
->pos
+= sizeof(u64
);
304 static size_t unpack_array(struct aa_ext
*e
, const char *name
)
306 if (unpack_nameX(e
, AA_ARRAY
, name
)) {
308 if (!inbounds(e
, sizeof(u16
)))
310 size
= (int)le16_to_cpu(get_unaligned((__le16
*) e
->pos
));
311 e
->pos
+= sizeof(u16
);
317 static size_t unpack_blob(struct aa_ext
*e
, char **blob
, const char *name
)
319 if (unpack_nameX(e
, AA_BLOB
, name
)) {
321 if (!inbounds(e
, sizeof(u32
)))
323 size
= le32_to_cpu(get_unaligned((__le32
*) e
->pos
));
324 e
->pos
+= sizeof(u32
);
325 if (inbounds(e
, (size_t) size
)) {
334 static int unpack_str(struct aa_ext
*e
, const char **string
, const char *name
)
340 if (unpack_nameX(e
, AA_STRING
, name
)) {
341 size
= unpack_u16_chunk(e
, &src_str
);
343 /* strings are null terminated, length is size - 1 */
344 if (src_str
[size
- 1] != 0)
356 static int unpack_strdup(struct aa_ext
*e
, char **string
, const char *name
)
360 int res
= unpack_str(e
, &tmp
, name
);
366 *string
= kmemdup(tmp
, res
, GFP_KERNEL
);
375 #define DFA_VALID_PERM_MASK 0xffffffff
376 #define DFA_VALID_PERM2_MASK 0xffffffff
379 * verify_accept - verify the accept tables of a dfa
380 * @dfa: dfa to verify accept tables of (NOT NULL)
381 * @flags: flags governing dfa
383 * Returns: 1 if valid accept tables else 0 if error
385 static bool verify_accept(struct aa_dfa
*dfa
, int flags
)
389 /* verify accept permissions */
390 for (i
= 0; i
< dfa
->tables
[YYTD_ID_ACCEPT
]->td_lolen
; i
++) {
391 int mode
= ACCEPT_TABLE(dfa
)[i
];
393 if (mode
& ~DFA_VALID_PERM_MASK
)
396 if (ACCEPT_TABLE2(dfa
)[i
] & ~DFA_VALID_PERM2_MASK
)
403 * unpack_dfa - unpack a file rule dfa
404 * @e: serialized data extent information (NOT NULL)
406 * returns dfa or ERR_PTR or NULL if no dfa
408 static struct aa_dfa
*unpack_dfa(struct aa_ext
*e
)
412 struct aa_dfa
*dfa
= NULL
;
414 size
= unpack_blob(e
, &blob
, "aadfa");
417 * The dfa is aligned with in the blob to 8 bytes
418 * from the beginning of the stream.
419 * alignment adjust needed by dfa unpack
421 size_t sz
= blob
- (char *) e
->start
-
422 ((e
->pos
- e
->start
) & 7);
423 size_t pad
= ALIGN(sz
, 8) - sz
;
424 int flags
= TO_ACCEPT1_FLAG(YYTD_DATA32
) |
425 TO_ACCEPT2_FLAG(YYTD_DATA32
) | DFA_FLAG_VERIFY_STATES
;
426 dfa
= aa_dfa_unpack(blob
+ pad
, size
- pad
, flags
);
431 if (!verify_accept(dfa
, flags
))
439 return ERR_PTR(-EPROTO
);
443 * unpack_trans_table - unpack a profile transition table
444 * @e: serialized data extent information (NOT NULL)
445 * @profile: profile to add the accept table to (NOT NULL)
447 * Returns: 1 if table successfully unpacked
449 static bool unpack_trans_table(struct aa_ext
*e
, struct aa_profile
*profile
)
453 /* exec table is optional */
454 if (unpack_nameX(e
, AA_STRUCT
, "xtable")) {
457 size
= unpack_array(e
, NULL
);
458 /* currently 4 exec bits and entries 0-3 are reserved iupcx */
461 profile
->file
.trans
.table
= kzalloc(sizeof(char *) * size
,
463 if (!profile
->file
.trans
.table
)
466 profile
->file
.trans
.size
= size
;
467 for (i
= 0; i
< size
; i
++) {
469 int c
, j
, pos
, size2
= unpack_strdup(e
, &str
, NULL
);
470 /* unpack_strdup verifies that the last character is
471 * null termination byte.
475 profile
->file
.trans
.table
[i
] = str
;
476 /* verify that name doesn't start with space */
480 /* count internal # of internal \0 */
481 for (c
= j
= 0; j
< size2
- 1; j
++) {
488 /* first character after : must be valid */
491 /* beginning with : requires an embedded \0,
492 * verify that exactly 1 internal \0 exists
493 * trailing \0 already verified by unpack_strdup
495 * convert \0 back to : for label_parse
502 /* fail - all other cases with embedded \0 */
505 if (!unpack_nameX(e
, AA_ARRAYEND
, NULL
))
507 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
513 aa_free_domain_entries(&profile
->file
.trans
);
518 static bool unpack_rlimits(struct aa_ext
*e
, struct aa_profile
*profile
)
522 /* rlimits are optional */
523 if (unpack_nameX(e
, AA_STRUCT
, "rlimits")) {
526 if (!unpack_u32(e
, &tmp
, NULL
))
528 profile
->rlimits
.mask
= tmp
;
530 size
= unpack_array(e
, NULL
);
531 if (size
> RLIM_NLIMITS
)
533 for (i
= 0; i
< size
; i
++) {
535 int a
= aa_map_resource(i
);
536 if (!unpack_u64(e
, &tmp2
, NULL
))
538 profile
->rlimits
.limits
[a
].rlim_max
= tmp2
;
540 if (!unpack_nameX(e
, AA_ARRAYEND
, NULL
))
542 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
552 static void *kvmemdup(const void *src
, size_t len
)
554 void *p
= kvmalloc(len
, GFP_KERNEL
);
561 static u32
strhash(const void *data
, u32 len
, u32 seed
)
563 const char * const *key
= data
;
565 return jhash(*key
, strlen(*key
), seed
);
568 static int datacmp(struct rhashtable_compare_arg
*arg
, const void *obj
)
570 const struct aa_data
*data
= obj
;
571 const char * const *key
= arg
->key
;
573 return strcmp(data
->key
, *key
);
577 * unpack_profile - unpack a serialized profile
578 * @e: serialized data extent information (NOT NULL)
580 * NOTE: unpack profile sets audit struct if there is a failure
582 static struct aa_profile
*unpack_profile(struct aa_ext
*e
, char **ns_name
)
584 struct aa_profile
*profile
= NULL
;
585 const char *tmpname
, *tmpns
= NULL
, *name
= NULL
;
587 struct rhashtable_params params
= { 0 };
589 struct aa_data
*data
;
590 int i
, error
= -EPROTO
;
596 /* check that we have the right struct being passed */
597 if (!unpack_nameX(e
, AA_STRUCT
, "profile"))
599 if (!unpack_str(e
, &name
, NULL
))
604 tmpname
= aa_splitn_fqname(name
, strlen(name
), &tmpns
, &ns_len
);
606 *ns_name
= kstrndup(tmpns
, ns_len
, GFP_KERNEL
);
612 profile
= aa_alloc_profile(name
, NULL
, GFP_KERNEL
);
614 return ERR_PTR(-ENOMEM
);
616 /* profile renaming is optional */
617 (void) unpack_str(e
, &profile
->rename
, "rename");
619 /* attachment string is optional */
620 (void) unpack_str(e
, &profile
->attach
, "attach");
622 /* xmatch is optional and may be NULL */
623 profile
->xmatch
= unpack_dfa(e
);
624 if (IS_ERR(profile
->xmatch
)) {
625 error
= PTR_ERR(profile
->xmatch
);
626 profile
->xmatch
= NULL
;
629 /* xmatch_len is not optional if xmatch is set */
630 if (profile
->xmatch
) {
631 if (!unpack_u32(e
, &tmp
, NULL
))
633 profile
->xmatch_len
= tmp
;
636 /* disconnected attachment string is optional */
637 (void) unpack_str(e
, &profile
->disconnected
, "disconnected");
639 /* per profile debug flags (complain, audit) */
640 if (!unpack_nameX(e
, AA_STRUCT
, "flags"))
642 if (!unpack_u32(e
, &tmp
, NULL
))
644 if (tmp
& PACKED_FLAG_HAT
)
645 profile
->label
.flags
|= FLAG_HAT
;
646 if (!unpack_u32(e
, &tmp
, NULL
))
648 if (tmp
== PACKED_MODE_COMPLAIN
|| (e
->version
& FORCE_COMPLAIN_FLAG
))
649 profile
->mode
= APPARMOR_COMPLAIN
;
650 else if (tmp
== PACKED_MODE_KILL
)
651 profile
->mode
= APPARMOR_KILL
;
652 else if (tmp
== PACKED_MODE_UNCONFINED
)
653 profile
->mode
= APPARMOR_UNCONFINED
;
654 if (!unpack_u32(e
, &tmp
, NULL
))
657 profile
->audit
= AUDIT_ALL
;
659 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
662 /* path_flags is optional */
663 if (unpack_u32(e
, &profile
->path_flags
, "path_flags"))
664 profile
->path_flags
|= profile
->label
.flags
&
665 PATH_MEDIATE_DELETED
;
667 /* set a default value if path_flags field is not present */
668 profile
->path_flags
= PATH_MEDIATE_DELETED
;
670 if (!unpack_u32(e
, &(profile
->caps
.allow
.cap
[0]), NULL
))
672 if (!unpack_u32(e
, &(profile
->caps
.audit
.cap
[0]), NULL
))
674 if (!unpack_u32(e
, &(profile
->caps
.quiet
.cap
[0]), NULL
))
676 if (!unpack_u32(e
, &tmpcap
.cap
[0], NULL
))
679 if (unpack_nameX(e
, AA_STRUCT
, "caps64")) {
680 /* optional upper half of 64 bit caps */
681 if (!unpack_u32(e
, &(profile
->caps
.allow
.cap
[1]), NULL
))
683 if (!unpack_u32(e
, &(profile
->caps
.audit
.cap
[1]), NULL
))
685 if (!unpack_u32(e
, &(profile
->caps
.quiet
.cap
[1]), NULL
))
687 if (!unpack_u32(e
, &(tmpcap
.cap
[1]), NULL
))
689 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
693 if (unpack_nameX(e
, AA_STRUCT
, "capsx")) {
694 /* optional extended caps mediation mask */
695 if (!unpack_u32(e
, &(profile
->caps
.extended
.cap
[0]), NULL
))
697 if (!unpack_u32(e
, &(profile
->caps
.extended
.cap
[1]), NULL
))
699 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
703 if (!unpack_rlimits(e
, profile
))
706 if (unpack_nameX(e
, AA_STRUCT
, "policydb")) {
707 /* generic policy dfa - optional and may be NULL */
708 profile
->policy
.dfa
= unpack_dfa(e
);
709 if (IS_ERR(profile
->policy
.dfa
)) {
710 error
= PTR_ERR(profile
->policy
.dfa
);
711 profile
->policy
.dfa
= NULL
;
713 } else if (!profile
->policy
.dfa
) {
717 if (!unpack_u32(e
, &profile
->policy
.start
[0], "start"))
718 /* default start state */
719 profile
->policy
.start
[0] = DFA_START
;
720 /* setup class index */
721 for (i
= AA_CLASS_FILE
; i
<= AA_CLASS_LAST
; i
++) {
722 profile
->policy
.start
[i
] =
723 aa_dfa_next(profile
->policy
.dfa
,
724 profile
->policy
.start
[0],
727 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
730 profile
->policy
.dfa
= aa_get_dfa(nulldfa
);
733 profile
->file
.dfa
= unpack_dfa(e
);
734 if (IS_ERR(profile
->file
.dfa
)) {
735 error
= PTR_ERR(profile
->file
.dfa
);
736 profile
->file
.dfa
= NULL
;
738 } else if (profile
->file
.dfa
) {
739 if (!unpack_u32(e
, &profile
->file
.start
, "dfa_start"))
740 /* default start state */
741 profile
->file
.start
= DFA_START
;
742 } else if (profile
->policy
.dfa
&&
743 profile
->policy
.start
[AA_CLASS_FILE
]) {
744 profile
->file
.dfa
= aa_get_dfa(profile
->policy
.dfa
);
745 profile
->file
.start
= profile
->policy
.start
[AA_CLASS_FILE
];
747 profile
->file
.dfa
= aa_get_dfa(nulldfa
);
749 if (!unpack_trans_table(e
, profile
))
752 if (unpack_nameX(e
, AA_STRUCT
, "data")) {
753 profile
->data
= kzalloc(sizeof(*profile
->data
), GFP_KERNEL
);
757 params
.nelem_hint
= 3;
758 params
.key_len
= sizeof(void *);
759 params
.key_offset
= offsetof(struct aa_data
, key
);
760 params
.head_offset
= offsetof(struct aa_data
, head
);
761 params
.hashfn
= strhash
;
762 params
.obj_cmpfn
= datacmp
;
764 if (rhashtable_init(profile
->data
, ¶ms
))
767 while (unpack_strdup(e
, &key
, NULL
)) {
768 data
= kzalloc(sizeof(*data
), GFP_KERNEL
);
775 data
->size
= unpack_blob(e
, &data
->data
, NULL
);
776 data
->data
= kvmemdup(data
->data
, data
->size
);
777 if (data
->size
&& !data
->data
) {
783 rhashtable_insert_fast(profile
->data
, &data
->head
,
787 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
791 if (!unpack_nameX(e
, AA_STRUCTEND
, NULL
))
801 audit_iface(profile
, NULL
, name
, "failed to unpack profile", e
,
803 aa_free_profile(profile
);
805 return ERR_PTR(error
);
809 * verify_head - unpack serialized stream header
810 * @e: serialized data read head (NOT NULL)
811 * @required: whether the header is required or optional
812 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
814 * Returns: error or 0 if header is good
816 static int verify_header(struct aa_ext
*e
, int required
, const char **ns
)
818 int error
= -EPROTONOSUPPORT
;
819 const char *name
= NULL
;
822 /* get the interface version */
823 if (!unpack_u32(e
, &e
->version
, "version")) {
825 audit_iface(NULL
, NULL
, NULL
, "invalid profile format",
831 /* Check that the interface version is currently supported.
832 * if not specified use previous version
833 * Mask off everything that is not kernel abi version
835 if (VERSION_LT(e
->version
, v5
) && VERSION_GT(e
->version
, v7
)) {
836 audit_iface(NULL
, NULL
, NULL
, "unsupported interface version",
841 /* read the namespace if present */
842 if (unpack_str(e
, &name
, "namespace")) {
844 audit_iface(NULL
, NULL
, NULL
, "invalid namespace name",
848 if (*ns
&& strcmp(*ns
, name
))
849 audit_iface(NULL
, NULL
, NULL
, "invalid ns change", e
,
858 static bool verify_xindex(int xindex
, int table_size
)
861 xtype
= xindex
& AA_X_TYPE_MASK
;
862 index
= xindex
& AA_X_INDEX_MASK
;
863 if (xtype
== AA_X_TABLE
&& index
>= table_size
)
868 /* verify dfa xindexes are in range of transition tables */
869 static bool verify_dfa_xindex(struct aa_dfa
*dfa
, int table_size
)
872 for (i
= 0; i
< dfa
->tables
[YYTD_ID_ACCEPT
]->td_lolen
; i
++) {
873 if (!verify_xindex(dfa_user_xindex(dfa
, i
), table_size
))
875 if (!verify_xindex(dfa_other_xindex(dfa
, i
), table_size
))
882 * verify_profile - Do post unpack analysis to verify profile consistency
883 * @profile: profile to verify (NOT NULL)
885 * Returns: 0 if passes verification else error
887 static int verify_profile(struct aa_profile
*profile
)
889 if (profile
->file
.dfa
&&
890 !verify_dfa_xindex(profile
->file
.dfa
,
891 profile
->file
.trans
.size
)) {
892 audit_iface(profile
, NULL
, NULL
, "Invalid named transition",
900 void aa_load_ent_free(struct aa_load_ent
*ent
)
903 aa_put_profile(ent
->rename
);
904 aa_put_profile(ent
->old
);
905 aa_put_profile(ent
->new);
911 struct aa_load_ent
*aa_load_ent_alloc(void)
913 struct aa_load_ent
*ent
= kzalloc(sizeof(*ent
), GFP_KERNEL
);
915 INIT_LIST_HEAD(&ent
->list
);
920 * aa_unpack - unpack packed binary profile(s) data loaded from user space
921 * @udata: user data copied to kmem (NOT NULL)
922 * @lh: list to place unpacked profiles in a aa_repl_ws
923 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
925 * Unpack user data and return refcounted allocated profile(s) stored in
926 * @lh in order of discovery, with the list chain stored in base.list
929 * Returns: profile(s) on @lh else error pointer if fails to unpack
931 int aa_unpack(struct aa_loaddata
*udata
, struct list_head
*lh
,
934 struct aa_load_ent
*tmp
, *ent
;
935 struct aa_profile
*profile
= NULL
;
938 .start
= udata
->data
,
939 .end
= udata
->data
+ udata
->size
,
944 while (e
.pos
< e
.end
) {
945 char *ns_name
= NULL
;
947 error
= verify_header(&e
, e
.pos
== e
.start
, ns
);
952 profile
= unpack_profile(&e
, &ns_name
);
953 if (IS_ERR(profile
)) {
954 error
= PTR_ERR(profile
);
958 error
= verify_profile(profile
);
962 if (aa_g_hash_policy
)
963 error
= aa_calc_profile_hash(profile
, e
.version
, start
,
968 ent
= aa_load_ent_alloc();
975 ent
->ns_name
= ns_name
;
976 list_add_tail(&ent
->list
, lh
);
978 udata
->abi
= e
.version
& K_ABI_MASK
;
979 if (aa_g_hash_policy
) {
980 udata
->hash
= aa_calc_hash(udata
->data
, udata
->size
);
981 if (IS_ERR(udata
->hash
)) {
982 error
= PTR_ERR(udata
->hash
);
990 aa_put_profile(profile
);
993 list_for_each_entry_safe(ent
, tmp
, lh
, list
) {
994 list_del_init(&ent
->list
);
995 aa_load_ent_free(ent
);