Loading...
1/*
2 * AppArmor security module
3 *
4 * This file contains AppArmor functions for unpacking policy loaded from
5 * userspace.
6 *
7 * Copyright (C) 1998-2008 Novell/SUSE
8 * Copyright 2009-2010 Canonical Ltd.
9 *
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
13 * License.
14 *
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.
18 */
19
20#include <asm/unaligned.h>
21#include <linux/ctype.h>
22#include <linux/errno.h>
23
24#include "include/apparmor.h"
25#include "include/audit.h"
26#include "include/cred.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"
32
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))
37
38#define v5 5 /* base version */
39#define v6 6 /* per entry policydb mediation check */
40#define v7 7
41#define v8 8 /* full network masking */
42
43/*
44 * The AppArmor interface treats data as a type byte followed by the
45 * actual data. The interface has the notion of a a named entry
46 * which has a name (AA_NAME typecode followed by name string) followed by
47 * the entries typecode and data. Named types allow for optional
48 * elements and extensions to be added and tested for without breaking
49 * backwards compatibility.
50 */
51
52enum aa_code {
53 AA_U8,
54 AA_U16,
55 AA_U32,
56 AA_U64,
57 AA_NAME, /* same as string except it is items name */
58 AA_STRING,
59 AA_BLOB,
60 AA_STRUCT,
61 AA_STRUCTEND,
62 AA_LIST,
63 AA_LISTEND,
64 AA_ARRAY,
65 AA_ARRAYEND,
66};
67
68/*
69 * aa_ext is the read of the buffer containing the serialized profile. The
70 * data is copied into a kernel buffer in apparmorfs and then handed off to
71 * the unpack routines.
72 */
73struct aa_ext {
74 void *start;
75 void *end;
76 void *pos; /* pointer to current position in the buffer */
77 u32 version;
78};
79
80/* audit callback for unpack fields */
81static void audit_cb(struct audit_buffer *ab, void *va)
82{
83 struct common_audit_data *sa = va;
84
85 if (aad(sa)->iface.ns) {
86 audit_log_format(ab, " ns=");
87 audit_log_untrustedstring(ab, aad(sa)->iface.ns);
88 }
89 if (aad(sa)->name) {
90 audit_log_format(ab, " name=");
91 audit_log_untrustedstring(ab, aad(sa)->name);
92 }
93 if (aad(sa)->iface.pos)
94 audit_log_format(ab, " offset=%ld", aad(sa)->iface.pos);
95}
96
97/**
98 * audit_iface - do audit message for policy unpacking/load/replace/remove
99 * @new: profile if it has been allocated (MAYBE NULL)
100 * @ns_name: name of the ns the profile is to be loaded to (MAY BE NULL)
101 * @name: name of the profile being manipulated (MAYBE NULL)
102 * @info: any extra info about the failure (MAYBE NULL)
103 * @e: buffer position info
104 * @error: error code
105 *
106 * Returns: %0 or error
107 */
108static int audit_iface(struct aa_profile *new, const char *ns_name,
109 const char *name, const char *info, struct aa_ext *e,
110 int error)
111{
112 struct aa_profile *profile = labels_profile(aa_current_raw_label());
113 DEFINE_AUDIT_DATA(sa, LSM_AUDIT_DATA_NONE, NULL);
114 if (e)
115 aad(&sa)->iface.pos = e->pos - e->start;
116 aad(&sa)->iface.ns = ns_name;
117 if (new)
118 aad(&sa)->name = new->base.hname;
119 else
120 aad(&sa)->name = name;
121 aad(&sa)->info = info;
122 aad(&sa)->error = error;
123
124 return aa_audit(AUDIT_APPARMOR_STATUS, profile, &sa, audit_cb);
125}
126
127void __aa_loaddata_update(struct aa_loaddata *data, long revision)
128{
129 AA_BUG(!data);
130 AA_BUG(!data->ns);
131 AA_BUG(!data->dents[AAFS_LOADDATA_REVISION]);
132 AA_BUG(!mutex_is_locked(&data->ns->lock));
133 AA_BUG(data->revision > revision);
134
135 data->revision = revision;
136 d_inode(data->dents[AAFS_LOADDATA_DIR])->i_mtime =
137 current_time(d_inode(data->dents[AAFS_LOADDATA_DIR]));
138 d_inode(data->dents[AAFS_LOADDATA_REVISION])->i_mtime =
139 current_time(d_inode(data->dents[AAFS_LOADDATA_REVISION]));
140}
141
142bool aa_rawdata_eq(struct aa_loaddata *l, struct aa_loaddata *r)
143{
144 if (l->size != r->size)
145 return false;
146 if (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0)
147 return false;
148 return memcmp(l->data, r->data, r->size) == 0;
149}
150
151/*
152 * need to take the ns mutex lock which is NOT safe most places that
153 * put_loaddata is called, so we have to delay freeing it
154 */
155static void do_loaddata_free(struct work_struct *work)
156{
157 struct aa_loaddata *d = container_of(work, struct aa_loaddata, work);
158 struct aa_ns *ns = aa_get_ns(d->ns);
159
160 if (ns) {
161 mutex_lock_nested(&ns->lock, ns->level);
162 __aa_fs_remove_rawdata(d);
163 mutex_unlock(&ns->lock);
164 aa_put_ns(ns);
165 }
166
167 kzfree(d->hash);
168 kzfree(d->name);
169 kvfree(d->data);
170 kzfree(d);
171}
172
173void aa_loaddata_kref(struct kref *kref)
174{
175 struct aa_loaddata *d = container_of(kref, struct aa_loaddata, count);
176
177 if (d) {
178 INIT_WORK(&d->work, do_loaddata_free);
179 schedule_work(&d->work);
180 }
181}
182
183struct aa_loaddata *aa_loaddata_alloc(size_t size)
184{
185 struct aa_loaddata *d;
186
187 d = kzalloc(sizeof(*d), GFP_KERNEL);
188 if (d == NULL)
189 return ERR_PTR(-ENOMEM);
190 d->data = kvzalloc(size, GFP_KERNEL);
191 if (!d->data) {
192 kfree(d);
193 return ERR_PTR(-ENOMEM);
194 }
195 kref_init(&d->count);
196 INIT_LIST_HEAD(&d->list);
197
198 return d;
199}
200
201/* test if read will be in packed data bounds */
202static bool inbounds(struct aa_ext *e, size_t size)
203{
204 return (size <= e->end - e->pos);
205}
206
207static void *kvmemdup(const void *src, size_t len)
208{
209 void *p = kvmalloc(len, GFP_KERNEL);
210
211 if (p)
212 memcpy(p, src, len);
213 return p;
214}
215
216/**
217 * aa_u16_chunck - test and do bounds checking for a u16 size based chunk
218 * @e: serialized data read head (NOT NULL)
219 * @chunk: start address for chunk of data (NOT NULL)
220 *
221 * Returns: the size of chunk found with the read head at the end of the chunk.
222 */
223static size_t unpack_u16_chunk(struct aa_ext *e, char **chunk)
224{
225 size_t size = 0;
226
227 if (!inbounds(e, sizeof(u16)))
228 return 0;
229 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
230 e->pos += sizeof(__le16);
231 if (!inbounds(e, size))
232 return 0;
233 *chunk = e->pos;
234 e->pos += size;
235 return size;
236}
237
238/* unpack control byte */
239static bool unpack_X(struct aa_ext *e, enum aa_code code)
240{
241 if (!inbounds(e, 1))
242 return 0;
243 if (*(u8 *) e->pos != code)
244 return 0;
245 e->pos++;
246 return 1;
247}
248
249/**
250 * unpack_nameX - check is the next element is of type X with a name of @name
251 * @e: serialized data extent information (NOT NULL)
252 * @code: type code
253 * @name: name to match to the serialized element. (MAYBE NULL)
254 *
255 * check that the next serialized data element is of type X and has a tag
256 * name @name. If @name is specified then there must be a matching
257 * name element in the stream. If @name is NULL any name element will be
258 * skipped and only the typecode will be tested.
259 *
260 * Returns 1 on success (both type code and name tests match) and the read
261 * head is advanced past the headers
262 *
263 * Returns: 0 if either match fails, the read head does not move
264 */
265static bool unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
266{
267 /*
268 * May need to reset pos if name or type doesn't match
269 */
270 void *pos = e->pos;
271 /*
272 * Check for presence of a tagname, and if present name size
273 * AA_NAME tag value is a u16.
274 */
275 if (unpack_X(e, AA_NAME)) {
276 char *tag = NULL;
277 size_t size = unpack_u16_chunk(e, &tag);
278 /* if a name is specified it must match. otherwise skip tag */
279 if (name && (!size || strcmp(name, tag)))
280 goto fail;
281 } else if (name) {
282 /* if a name is specified and there is no name tag fail */
283 goto fail;
284 }
285
286 /* now check if type code matches */
287 if (unpack_X(e, code))
288 return 1;
289
290fail:
291 e->pos = pos;
292 return 0;
293}
294
295static bool unpack_u32(struct aa_ext *e, u32 *data, const char *name)
296{
297 if (unpack_nameX(e, AA_U32, name)) {
298 if (!inbounds(e, sizeof(u32)))
299 return 0;
300 if (data)
301 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
302 e->pos += sizeof(u32);
303 return 1;
304 }
305 return 0;
306}
307
308static bool unpack_u64(struct aa_ext *e, u64 *data, const char *name)
309{
310 if (unpack_nameX(e, AA_U64, name)) {
311 if (!inbounds(e, sizeof(u64)))
312 return 0;
313 if (data)
314 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
315 e->pos += sizeof(u64);
316 return 1;
317 }
318 return 0;
319}
320
321static size_t unpack_array(struct aa_ext *e, const char *name)
322{
323 if (unpack_nameX(e, AA_ARRAY, name)) {
324 int size;
325 if (!inbounds(e, sizeof(u16)))
326 return 0;
327 size = (int)le16_to_cpu(get_unaligned((__le16 *) e->pos));
328 e->pos += sizeof(u16);
329 return size;
330 }
331 return 0;
332}
333
334static size_t unpack_blob(struct aa_ext *e, char **blob, const char *name)
335{
336 if (unpack_nameX(e, AA_BLOB, name)) {
337 u32 size;
338 if (!inbounds(e, sizeof(u32)))
339 return 0;
340 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
341 e->pos += sizeof(u32);
342 if (inbounds(e, (size_t) size)) {
343 *blob = e->pos;
344 e->pos += size;
345 return size;
346 }
347 }
348 return 0;
349}
350
351static int unpack_str(struct aa_ext *e, const char **string, const char *name)
352{
353 char *src_str;
354 size_t size = 0;
355 void *pos = e->pos;
356 *string = NULL;
357 if (unpack_nameX(e, AA_STRING, name)) {
358 size = unpack_u16_chunk(e, &src_str);
359 if (size) {
360 /* strings are null terminated, length is size - 1 */
361 if (src_str[size - 1] != 0)
362 goto fail;
363 *string = src_str;
364 }
365 }
366 return size;
367
368fail:
369 e->pos = pos;
370 return 0;
371}
372
373static int unpack_strdup(struct aa_ext *e, char **string, const char *name)
374{
375 const char *tmp;
376 void *pos = e->pos;
377 int res = unpack_str(e, &tmp, name);
378 *string = NULL;
379
380 if (!res)
381 return 0;
382
383 *string = kmemdup(tmp, res, GFP_KERNEL);
384 if (!*string) {
385 e->pos = pos;
386 return 0;
387 }
388
389 return res;
390}
391
392#define DFA_VALID_PERM_MASK 0xffffffff
393#define DFA_VALID_PERM2_MASK 0xffffffff
394
395/**
396 * verify_accept - verify the accept tables of a dfa
397 * @dfa: dfa to verify accept tables of (NOT NULL)
398 * @flags: flags governing dfa
399 *
400 * Returns: 1 if valid accept tables else 0 if error
401 */
402static bool verify_accept(struct aa_dfa *dfa, int flags)
403{
404 int i;
405
406 /* verify accept permissions */
407 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
408 int mode = ACCEPT_TABLE(dfa)[i];
409
410 if (mode & ~DFA_VALID_PERM_MASK)
411 return 0;
412
413 if (ACCEPT_TABLE2(dfa)[i] & ~DFA_VALID_PERM2_MASK)
414 return 0;
415 }
416 return 1;
417}
418
419/**
420 * unpack_dfa - unpack a file rule dfa
421 * @e: serialized data extent information (NOT NULL)
422 *
423 * returns dfa or ERR_PTR or NULL if no dfa
424 */
425static struct aa_dfa *unpack_dfa(struct aa_ext *e)
426{
427 char *blob = NULL;
428 size_t size;
429 struct aa_dfa *dfa = NULL;
430
431 size = unpack_blob(e, &blob, "aadfa");
432 if (size) {
433 /*
434 * The dfa is aligned with in the blob to 8 bytes
435 * from the beginning of the stream.
436 * alignment adjust needed by dfa unpack
437 */
438 size_t sz = blob - (char *) e->start -
439 ((e->pos - e->start) & 7);
440 size_t pad = ALIGN(sz, 8) - sz;
441 int flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
442 TO_ACCEPT2_FLAG(YYTD_DATA32) | DFA_FLAG_VERIFY_STATES;
443 dfa = aa_dfa_unpack(blob + pad, size - pad, flags);
444
445 if (IS_ERR(dfa))
446 return dfa;
447
448 if (!verify_accept(dfa, flags))
449 goto fail;
450 }
451
452 return dfa;
453
454fail:
455 aa_put_dfa(dfa);
456 return ERR_PTR(-EPROTO);
457}
458
459/**
460 * unpack_trans_table - unpack a profile transition table
461 * @e: serialized data extent information (NOT NULL)
462 * @profile: profile to add the accept table to (NOT NULL)
463 *
464 * Returns: 1 if table successfully unpacked
465 */
466static bool unpack_trans_table(struct aa_ext *e, struct aa_profile *profile)
467{
468 void *saved_pos = e->pos;
469
470 /* exec table is optional */
471 if (unpack_nameX(e, AA_STRUCT, "xtable")) {
472 int i, size;
473
474 size = unpack_array(e, NULL);
475 /* currently 4 exec bits and entries 0-3 are reserved iupcx */
476 if (size > 16 - 4)
477 goto fail;
478 profile->file.trans.table = kzalloc(sizeof(char *) * size,
479 GFP_KERNEL);
480 if (!profile->file.trans.table)
481 goto fail;
482
483 profile->file.trans.size = size;
484 for (i = 0; i < size; i++) {
485 char *str;
486 int c, j, pos, size2 = unpack_strdup(e, &str, NULL);
487 /* unpack_strdup verifies that the last character is
488 * null termination byte.
489 */
490 if (!size2)
491 goto fail;
492 profile->file.trans.table[i] = str;
493 /* verify that name doesn't start with space */
494 if (isspace(*str))
495 goto fail;
496
497 /* count internal # of internal \0 */
498 for (c = j = 0; j < size2 - 1; j++) {
499 if (!str[j]) {
500 pos = j;
501 c++;
502 }
503 }
504 if (*str == ':') {
505 /* first character after : must be valid */
506 if (!str[1])
507 goto fail;
508 /* beginning with : requires an embedded \0,
509 * verify that exactly 1 internal \0 exists
510 * trailing \0 already verified by unpack_strdup
511 *
512 * convert \0 back to : for label_parse
513 */
514 if (c == 1)
515 str[pos] = ':';
516 else if (c > 1)
517 goto fail;
518 } else if (c)
519 /* fail - all other cases with embedded \0 */
520 goto fail;
521 }
522 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
523 goto fail;
524 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
525 goto fail;
526 }
527 return 1;
528
529fail:
530 aa_free_domain_entries(&profile->file.trans);
531 e->pos = saved_pos;
532 return 0;
533}
534
535static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
536{
537 void *pos = e->pos;
538
539 if (unpack_nameX(e, AA_STRUCT, "xattrs")) {
540 int i, size;
541
542 size = unpack_array(e, NULL);
543 profile->xattr_count = size;
544 profile->xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
545 if (!profile->xattrs)
546 goto fail;
547 for (i = 0; i < size; i++) {
548 if (!unpack_strdup(e, &profile->xattrs[i], NULL))
549 goto fail;
550 }
551 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
552 goto fail;
553 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
554 goto fail;
555 }
556
557 return 1;
558
559fail:
560 e->pos = pos;
561 return 0;
562}
563
564static bool unpack_rlimits(struct aa_ext *e, struct aa_profile *profile)
565{
566 void *pos = e->pos;
567
568 /* rlimits are optional */
569 if (unpack_nameX(e, AA_STRUCT, "rlimits")) {
570 int i, size;
571 u32 tmp = 0;
572 if (!unpack_u32(e, &tmp, NULL))
573 goto fail;
574 profile->rlimits.mask = tmp;
575
576 size = unpack_array(e, NULL);
577 if (size > RLIM_NLIMITS)
578 goto fail;
579 for (i = 0; i < size; i++) {
580 u64 tmp2 = 0;
581 int a = aa_map_resource(i);
582 if (!unpack_u64(e, &tmp2, NULL))
583 goto fail;
584 profile->rlimits.limits[a].rlim_max = tmp2;
585 }
586 if (!unpack_nameX(e, AA_ARRAYEND, NULL))
587 goto fail;
588 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
589 goto fail;
590 }
591 return 1;
592
593fail:
594 e->pos = pos;
595 return 0;
596}
597
598static u32 strhash(const void *data, u32 len, u32 seed)
599{
600 const char * const *key = data;
601
602 return jhash(*key, strlen(*key), seed);
603}
604
605static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
606{
607 const struct aa_data *data = obj;
608 const char * const *key = arg->key;
609
610 return strcmp(data->key, *key);
611}
612
613/**
614 * unpack_profile - unpack a serialized profile
615 * @e: serialized data extent information (NOT NULL)
616 *
617 * NOTE: unpack profile sets audit struct if there is a failure
618 */
619static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
620{
621 struct aa_profile *profile = NULL;
622 const char *tmpname, *tmpns = NULL, *name = NULL;
623 const char *info = "failed to unpack profile";
624 size_t ns_len;
625 struct rhashtable_params params = { 0 };
626 char *key = NULL;
627 struct aa_data *data;
628 int i, error = -EPROTO;
629 kernel_cap_t tmpcap;
630 u32 tmp;
631
632 *ns_name = NULL;
633
634 /* check that we have the right struct being passed */
635 if (!unpack_nameX(e, AA_STRUCT, "profile"))
636 goto fail;
637 if (!unpack_str(e, &name, NULL))
638 goto fail;
639 if (*name == '\0')
640 goto fail;
641
642 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
643 if (tmpns) {
644 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
645 if (!*ns_name) {
646 info = "out of memory";
647 goto fail;
648 }
649 name = tmpname;
650 }
651
652 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
653 if (!profile)
654 return ERR_PTR(-ENOMEM);
655
656 /* profile renaming is optional */
657 (void) unpack_str(e, &profile->rename, "rename");
658
659 /* attachment string is optional */
660 (void) unpack_str(e, &profile->attach, "attach");
661
662 /* xmatch is optional and may be NULL */
663 profile->xmatch = unpack_dfa(e);
664 if (IS_ERR(profile->xmatch)) {
665 error = PTR_ERR(profile->xmatch);
666 profile->xmatch = NULL;
667 info = "bad xmatch";
668 goto fail;
669 }
670 /* xmatch_len is not optional if xmatch is set */
671 if (profile->xmatch) {
672 if (!unpack_u32(e, &tmp, NULL)) {
673 info = "missing xmatch len";
674 goto fail;
675 }
676 profile->xmatch_len = tmp;
677 }
678
679 /* disconnected attachment string is optional */
680 (void) unpack_str(e, &profile->disconnected, "disconnected");
681
682 /* per profile debug flags (complain, audit) */
683 if (!unpack_nameX(e, AA_STRUCT, "flags")) {
684 info = "profile missing flags";
685 goto fail;
686 }
687 info = "failed to unpack profile flags";
688 if (!unpack_u32(e, &tmp, NULL))
689 goto fail;
690 if (tmp & PACKED_FLAG_HAT)
691 profile->label.flags |= FLAG_HAT;
692 if (!unpack_u32(e, &tmp, NULL))
693 goto fail;
694 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG))
695 profile->mode = APPARMOR_COMPLAIN;
696 else if (tmp == PACKED_MODE_KILL)
697 profile->mode = APPARMOR_KILL;
698 else if (tmp == PACKED_MODE_UNCONFINED)
699 profile->mode = APPARMOR_UNCONFINED;
700 if (!unpack_u32(e, &tmp, NULL))
701 goto fail;
702 if (tmp)
703 profile->audit = AUDIT_ALL;
704
705 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
706 goto fail;
707
708 /* path_flags is optional */
709 if (unpack_u32(e, &profile->path_flags, "path_flags"))
710 profile->path_flags |= profile->label.flags &
711 PATH_MEDIATE_DELETED;
712 else
713 /* set a default value if path_flags field is not present */
714 profile->path_flags = PATH_MEDIATE_DELETED;
715
716 info = "failed to unpack profile capabilities";
717 if (!unpack_u32(e, &(profile->caps.allow.cap[0]), NULL))
718 goto fail;
719 if (!unpack_u32(e, &(profile->caps.audit.cap[0]), NULL))
720 goto fail;
721 if (!unpack_u32(e, &(profile->caps.quiet.cap[0]), NULL))
722 goto fail;
723 if (!unpack_u32(e, &tmpcap.cap[0], NULL))
724 goto fail;
725
726 info = "failed to unpack upper profile capabilities";
727 if (unpack_nameX(e, AA_STRUCT, "caps64")) {
728 /* optional upper half of 64 bit caps */
729 if (!unpack_u32(e, &(profile->caps.allow.cap[1]), NULL))
730 goto fail;
731 if (!unpack_u32(e, &(profile->caps.audit.cap[1]), NULL))
732 goto fail;
733 if (!unpack_u32(e, &(profile->caps.quiet.cap[1]), NULL))
734 goto fail;
735 if (!unpack_u32(e, &(tmpcap.cap[1]), NULL))
736 goto fail;
737 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
738 goto fail;
739 }
740
741 info = "failed to unpack extended profile capabilities";
742 if (unpack_nameX(e, AA_STRUCT, "capsx")) {
743 /* optional extended caps mediation mask */
744 if (!unpack_u32(e, &(profile->caps.extended.cap[0]), NULL))
745 goto fail;
746 if (!unpack_u32(e, &(profile->caps.extended.cap[1]), NULL))
747 goto fail;
748 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
749 goto fail;
750 }
751
752 if (!unpack_xattrs(e, profile)) {
753 info = "failed to unpack profile xattrs";
754 goto fail;
755 }
756
757 if (!unpack_rlimits(e, profile)) {
758 info = "failed to unpack profile rlimits";
759 goto fail;
760 }
761
762 if (unpack_nameX(e, AA_STRUCT, "policydb")) {
763 /* generic policy dfa - optional and may be NULL */
764 info = "failed to unpack policydb";
765 profile->policy.dfa = unpack_dfa(e);
766 if (IS_ERR(profile->policy.dfa)) {
767 error = PTR_ERR(profile->policy.dfa);
768 profile->policy.dfa = NULL;
769 goto fail;
770 } else if (!profile->policy.dfa) {
771 error = -EPROTO;
772 goto fail;
773 }
774 if (!unpack_u32(e, &profile->policy.start[0], "start"))
775 /* default start state */
776 profile->policy.start[0] = DFA_START;
777 /* setup class index */
778 for (i = AA_CLASS_FILE; i <= AA_CLASS_LAST; i++) {
779 profile->policy.start[i] =
780 aa_dfa_next(profile->policy.dfa,
781 profile->policy.start[0],
782 i);
783 }
784 if (!unpack_nameX(e, AA_STRUCTEND, NULL))
785 goto fail;
786 } else
787 profile->policy.dfa = aa_get_dfa(nulldfa);
788
789 /* get file rules */
790 profile->file.dfa = unpack_dfa(e);
791 if (IS_ERR(profile->file.dfa)) {
792 error = PTR_ERR(profile->file.dfa);
793 profile->file.dfa = NULL;
794 info = "failed to unpack profile file rules";
795 goto fail;
796 } else if (profile->file.dfa) {
797 if (!unpack_u32(e, &profile->file.start, "dfa_start"))
798 /* default start state */
799 profile->file.start = DFA_START;
800 } else if (profile->policy.dfa &&
801 profile->policy.start[AA_CLASS_FILE]) {
802 profile->file.dfa = aa_get_dfa(profile->policy.dfa);
803 profile->file.start = profile->policy.start[AA_CLASS_FILE];
804 } else
805 profile->file.dfa = aa_get_dfa(nulldfa);
806
807 if (!unpack_trans_table(e, profile)) {
808 info = "failed to unpack profile transition table";
809 goto fail;
810 }
811
812 if (unpack_nameX(e, AA_STRUCT, "data")) {
813 info = "out of memory";
814 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
815 if (!profile->data)
816 goto fail;
817
818 params.nelem_hint = 3;
819 params.key_len = sizeof(void *);
820 params.key_offset = offsetof(struct aa_data, key);
821 params.head_offset = offsetof(struct aa_data, head);
822 params.hashfn = strhash;
823 params.obj_cmpfn = datacmp;
824
825 if (rhashtable_init(profile->data, ¶ms)) {
826 info = "failed to init key, value hash table";
827 goto fail;
828 }
829
830 while (unpack_strdup(e, &key, NULL)) {
831 data = kzalloc(sizeof(*data), GFP_KERNEL);
832 if (!data) {
833 kzfree(key);
834 goto fail;
835 }
836
837 data->key = key;
838 data->size = unpack_blob(e, &data->data, NULL);
839 data->data = kvmemdup(data->data, data->size);
840 if (data->size && !data->data) {
841 kzfree(data->key);
842 kzfree(data);
843 goto fail;
844 }
845
846 rhashtable_insert_fast(profile->data, &data->head,
847 profile->data->p);
848 }
849
850 if (!unpack_nameX(e, AA_STRUCTEND, NULL)) {
851 info = "failed to unpack end of key, value data table";
852 goto fail;
853 }
854 }
855
856 if (!unpack_nameX(e, AA_STRUCTEND, NULL)) {
857 info = "failed to unpack end of profile";
858 goto fail;
859 }
860
861 return profile;
862
863fail:
864 if (profile)
865 name = NULL;
866 else if (!name)
867 name = "unknown";
868 audit_iface(profile, NULL, name, info, e, error);
869 aa_free_profile(profile);
870
871 return ERR_PTR(error);
872}
873
874/**
875 * verify_head - unpack serialized stream header
876 * @e: serialized data read head (NOT NULL)
877 * @required: whether the header is required or optional
878 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
879 *
880 * Returns: error or 0 if header is good
881 */
882static int verify_header(struct aa_ext *e, int required, const char **ns)
883{
884 int error = -EPROTONOSUPPORT;
885 const char *name = NULL;
886 *ns = NULL;
887
888 /* get the interface version */
889 if (!unpack_u32(e, &e->version, "version")) {
890 if (required) {
891 audit_iface(NULL, NULL, NULL, "invalid profile format",
892 e, error);
893 return error;
894 }
895 }
896
897 /* Check that the interface version is currently supported.
898 * if not specified use previous version
899 * Mask off everything that is not kernel abi version
900 */
901 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v7)) {
902 audit_iface(NULL, NULL, NULL, "unsupported interface version",
903 e, error);
904 return error;
905 }
906
907 /* read the namespace if present */
908 if (unpack_str(e, &name, "namespace")) {
909 if (*name == '\0') {
910 audit_iface(NULL, NULL, NULL, "invalid namespace name",
911 e, error);
912 return error;
913 }
914 if (*ns && strcmp(*ns, name))
915 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
916 error);
917 else if (!*ns)
918 *ns = name;
919 }
920
921 return 0;
922}
923
924static bool verify_xindex(int xindex, int table_size)
925{
926 int index, xtype;
927 xtype = xindex & AA_X_TYPE_MASK;
928 index = xindex & AA_X_INDEX_MASK;
929 if (xtype == AA_X_TABLE && index >= table_size)
930 return 0;
931 return 1;
932}
933
934/* verify dfa xindexes are in range of transition tables */
935static bool verify_dfa_xindex(struct aa_dfa *dfa, int table_size)
936{
937 int i;
938 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
939 if (!verify_xindex(dfa_user_xindex(dfa, i), table_size))
940 return 0;
941 if (!verify_xindex(dfa_other_xindex(dfa, i), table_size))
942 return 0;
943 }
944 return 1;
945}
946
947/**
948 * verify_profile - Do post unpack analysis to verify profile consistency
949 * @profile: profile to verify (NOT NULL)
950 *
951 * Returns: 0 if passes verification else error
952 */
953static int verify_profile(struct aa_profile *profile)
954{
955 if (profile->file.dfa &&
956 !verify_dfa_xindex(profile->file.dfa,
957 profile->file.trans.size)) {
958 audit_iface(profile, NULL, NULL, "Invalid named transition",
959 NULL, -EPROTO);
960 return -EPROTO;
961 }
962
963 return 0;
964}
965
966void aa_load_ent_free(struct aa_load_ent *ent)
967{
968 if (ent) {
969 aa_put_profile(ent->rename);
970 aa_put_profile(ent->old);
971 aa_put_profile(ent->new);
972 kfree(ent->ns_name);
973 kzfree(ent);
974 }
975}
976
977struct aa_load_ent *aa_load_ent_alloc(void)
978{
979 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
980 if (ent)
981 INIT_LIST_HEAD(&ent->list);
982 return ent;
983}
984
985/**
986 * aa_unpack - unpack packed binary profile(s) data loaded from user space
987 * @udata: user data copied to kmem (NOT NULL)
988 * @lh: list to place unpacked profiles in a aa_repl_ws
989 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
990 *
991 * Unpack user data and return refcounted allocated profile(s) stored in
992 * @lh in order of discovery, with the list chain stored in base.list
993 * or error
994 *
995 * Returns: profile(s) on @lh else error pointer if fails to unpack
996 */
997int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
998 const char **ns)
999{
1000 struct aa_load_ent *tmp, *ent;
1001 struct aa_profile *profile = NULL;
1002 int error;
1003 struct aa_ext e = {
1004 .start = udata->data,
1005 .end = udata->data + udata->size,
1006 .pos = udata->data,
1007 };
1008
1009 *ns = NULL;
1010 while (e.pos < e.end) {
1011 char *ns_name = NULL;
1012 void *start;
1013 error = verify_header(&e, e.pos == e.start, ns);
1014 if (error)
1015 goto fail;
1016
1017 start = e.pos;
1018 profile = unpack_profile(&e, &ns_name);
1019 if (IS_ERR(profile)) {
1020 error = PTR_ERR(profile);
1021 goto fail;
1022 }
1023
1024 error = verify_profile(profile);
1025 if (error)
1026 goto fail_profile;
1027
1028 if (aa_g_hash_policy)
1029 error = aa_calc_profile_hash(profile, e.version, start,
1030 e.pos - start);
1031 if (error)
1032 goto fail_profile;
1033
1034 ent = aa_load_ent_alloc();
1035 if (!ent) {
1036 error = -ENOMEM;
1037 goto fail_profile;
1038 }
1039
1040 ent->new = profile;
1041 ent->ns_name = ns_name;
1042 list_add_tail(&ent->list, lh);
1043 }
1044 udata->abi = e.version & K_ABI_MASK;
1045 if (aa_g_hash_policy) {
1046 udata->hash = aa_calc_hash(udata->data, udata->size);
1047 if (IS_ERR(udata->hash)) {
1048 error = PTR_ERR(udata->hash);
1049 udata->hash = NULL;
1050 goto fail;
1051 }
1052 }
1053 return 0;
1054
1055fail_profile:
1056 aa_put_profile(profile);
1057
1058fail:
1059 list_for_each_entry_safe(ent, tmp, lh, list) {
1060 list_del_init(&ent->list);
1061 aa_load_ent_free(ent);
1062 }
1063
1064 return error;
1065}
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * AppArmor security module
4 *
5 * This file contains AppArmor functions for unpacking policy loaded from
6 * userspace.
7 *
8 * Copyright (C) 1998-2008 Novell/SUSE
9 * Copyright 2009-2010 Canonical Ltd.
10 *
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.
14 */
15
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>
21
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"
32
33/* audit callback for unpack fields */
34static void audit_cb(struct audit_buffer *ab, void *va)
35{
36 struct common_audit_data *sa = va;
37
38 if (aad(sa)->iface.ns) {
39 audit_log_format(ab, " ns=");
40 audit_log_untrustedstring(ab, aad(sa)->iface.ns);
41 }
42 if (aad(sa)->name) {
43 audit_log_format(ab, " name=");
44 audit_log_untrustedstring(ab, aad(sa)->name);
45 }
46 if (aad(sa)->iface.pos)
47 audit_log_format(ab, " offset=%ld", aad(sa)->iface.pos);
48}
49
50/**
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
57 * @error: error code
58 *
59 * Returns: %0 or error
60 */
61static int audit_iface(struct aa_profile *new, const char *ns_name,
62 const char *name, const char *info, struct aa_ext *e,
63 int error)
64{
65 struct aa_profile *profile = labels_profile(aa_current_raw_label());
66 DEFINE_AUDIT_DATA(sa, LSM_AUDIT_DATA_NONE, AA_CLASS_NONE, NULL);
67 if (e)
68 aad(&sa)->iface.pos = e->pos - e->start;
69 aad(&sa)->iface.ns = ns_name;
70 if (new)
71 aad(&sa)->name = new->base.hname;
72 else
73 aad(&sa)->name = name;
74 aad(&sa)->info = info;
75 aad(&sa)->error = error;
76
77 return aa_audit(AUDIT_APPARMOR_STATUS, profile, &sa, audit_cb);
78}
79
80void __aa_loaddata_update(struct aa_loaddata *data, long revision)
81{
82 AA_BUG(!data);
83 AA_BUG(!data->ns);
84 AA_BUG(!mutex_is_locked(&data->ns->lock));
85 AA_BUG(data->revision > revision);
86
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]));
93 }
94}
95
96bool aa_rawdata_eq(struct aa_loaddata *l, struct aa_loaddata *r)
97{
98 if (l->size != r->size)
99 return false;
100 if (l->compressed_size != r->compressed_size)
101 return false;
102 if (aa_g_hash_policy && memcmp(l->hash, r->hash, aa_hash_size()) != 0)
103 return false;
104 return memcmp(l->data, r->data, r->compressed_size ?: r->size) == 0;
105}
106
107/*
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
110 */
111static void do_loaddata_free(struct work_struct *work)
112{
113 struct aa_loaddata *d = container_of(work, struct aa_loaddata, work);
114 struct aa_ns *ns = aa_get_ns(d->ns);
115
116 if (ns) {
117 mutex_lock_nested(&ns->lock, ns->level);
118 __aa_fs_remove_rawdata(d);
119 mutex_unlock(&ns->lock);
120 aa_put_ns(ns);
121 }
122
123 kfree_sensitive(d->hash);
124 kfree_sensitive(d->name);
125 kvfree(d->data);
126 kfree_sensitive(d);
127}
128
129void aa_loaddata_kref(struct kref *kref)
130{
131 struct aa_loaddata *d = container_of(kref, struct aa_loaddata, count);
132
133 if (d) {
134 INIT_WORK(&d->work, do_loaddata_free);
135 schedule_work(&d->work);
136 }
137}
138
139struct aa_loaddata *aa_loaddata_alloc(size_t size)
140{
141 struct aa_loaddata *d;
142
143 d = kzalloc(sizeof(*d), GFP_KERNEL);
144 if (d == NULL)
145 return ERR_PTR(-ENOMEM);
146 d->data = kvzalloc(size, GFP_KERNEL);
147 if (!d->data) {
148 kfree(d);
149 return ERR_PTR(-ENOMEM);
150 }
151 kref_init(&d->count);
152 INIT_LIST_HEAD(&d->list);
153
154 return d;
155}
156
157/* test if read will be in packed data bounds */
158VISIBLE_IF_KUNIT bool aa_inbounds(struct aa_ext *e, size_t size)
159{
160 return (size <= e->end - e->pos);
161}
162EXPORT_SYMBOL_IF_KUNIT(aa_inbounds);
163
164static void *kvmemdup(const void *src, size_t len)
165{
166 void *p = kvmalloc(len, GFP_KERNEL);
167
168 if (p)
169 memcpy(p, src, len);
170 return p;
171}
172
173/**
174 * aa_unpack_u16_chunk - test and do bounds checking for a u16 size based chunk
175 * @e: serialized data read head (NOT NULL)
176 * @chunk: start address for chunk of data (NOT NULL)
177 *
178 * Returns: the size of chunk found with the read head at the end of the chunk.
179 */
180VISIBLE_IF_KUNIT size_t aa_unpack_u16_chunk(struct aa_ext *e, char **chunk)
181{
182 size_t size = 0;
183 void *pos = e->pos;
184
185 if (!aa_inbounds(e, sizeof(u16)))
186 goto fail;
187 size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
188 e->pos += sizeof(__le16);
189 if (!aa_inbounds(e, size))
190 goto fail;
191 *chunk = e->pos;
192 e->pos += size;
193 return size;
194
195fail:
196 e->pos = pos;
197 return 0;
198}
199EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u16_chunk);
200
201/* unpack control byte */
202VISIBLE_IF_KUNIT bool aa_unpack_X(struct aa_ext *e, enum aa_code code)
203{
204 if (!aa_inbounds(e, 1))
205 return false;
206 if (*(u8 *) e->pos != code)
207 return false;
208 e->pos++;
209 return true;
210}
211EXPORT_SYMBOL_IF_KUNIT(aa_unpack_X);
212
213/**
214 * aa_unpack_nameX - check is the next element is of type X with a name of @name
215 * @e: serialized data extent information (NOT NULL)
216 * @code: type code
217 * @name: name to match to the serialized element. (MAYBE NULL)
218 *
219 * check that the next serialized data element is of type X and has a tag
220 * name @name. If @name is specified then there must be a matching
221 * name element in the stream. If @name is NULL any name element will be
222 * skipped and only the typecode will be tested.
223 *
224 * Returns true on success (both type code and name tests match) and the read
225 * head is advanced past the headers
226 *
227 * Returns: false if either match fails, the read head does not move
228 */
229VISIBLE_IF_KUNIT bool aa_unpack_nameX(struct aa_ext *e, enum aa_code code, const char *name)
230{
231 /*
232 * May need to reset pos if name or type doesn't match
233 */
234 void *pos = e->pos;
235 /*
236 * Check for presence of a tagname, and if present name size
237 * AA_NAME tag value is a u16.
238 */
239 if (aa_unpack_X(e, AA_NAME)) {
240 char *tag = NULL;
241 size_t size = aa_unpack_u16_chunk(e, &tag);
242 /* if a name is specified it must match. otherwise skip tag */
243 if (name && (!size || tag[size-1] != '\0' || strcmp(name, tag)))
244 goto fail;
245 } else if (name) {
246 /* if a name is specified and there is no name tag fail */
247 goto fail;
248 }
249
250 /* now check if type code matches */
251 if (aa_unpack_X(e, code))
252 return true;
253
254fail:
255 e->pos = pos;
256 return false;
257}
258EXPORT_SYMBOL_IF_KUNIT(aa_unpack_nameX);
259
260static bool unpack_u8(struct aa_ext *e, u8 *data, const char *name)
261{
262 void *pos = e->pos;
263
264 if (aa_unpack_nameX(e, AA_U8, name)) {
265 if (!aa_inbounds(e, sizeof(u8)))
266 goto fail;
267 if (data)
268 *data = *((u8 *)e->pos);
269 e->pos += sizeof(u8);
270 return true;
271 }
272
273fail:
274 e->pos = pos;
275 return false;
276}
277
278VISIBLE_IF_KUNIT bool aa_unpack_u32(struct aa_ext *e, u32 *data, const char *name)
279{
280 void *pos = e->pos;
281
282 if (aa_unpack_nameX(e, AA_U32, name)) {
283 if (!aa_inbounds(e, sizeof(u32)))
284 goto fail;
285 if (data)
286 *data = le32_to_cpu(get_unaligned((__le32 *) e->pos));
287 e->pos += sizeof(u32);
288 return true;
289 }
290
291fail:
292 e->pos = pos;
293 return false;
294}
295EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u32);
296
297VISIBLE_IF_KUNIT bool aa_unpack_u64(struct aa_ext *e, u64 *data, const char *name)
298{
299 void *pos = e->pos;
300
301 if (aa_unpack_nameX(e, AA_U64, name)) {
302 if (!aa_inbounds(e, sizeof(u64)))
303 goto fail;
304 if (data)
305 *data = le64_to_cpu(get_unaligned((__le64 *) e->pos));
306 e->pos += sizeof(u64);
307 return true;
308 }
309
310fail:
311 e->pos = pos;
312 return false;
313}
314EXPORT_SYMBOL_IF_KUNIT(aa_unpack_u64);
315
316VISIBLE_IF_KUNIT bool aa_unpack_array(struct aa_ext *e, const char *name, u16 *size)
317{
318 void *pos = e->pos;
319
320 if (aa_unpack_nameX(e, AA_ARRAY, name)) {
321 if (!aa_inbounds(e, sizeof(u16)))
322 goto fail;
323 *size = le16_to_cpu(get_unaligned((__le16 *) e->pos));
324 e->pos += sizeof(u16);
325 return true;
326 }
327
328fail:
329 e->pos = pos;
330 return false;
331}
332EXPORT_SYMBOL_IF_KUNIT(aa_unpack_array);
333
334VISIBLE_IF_KUNIT size_t aa_unpack_blob(struct aa_ext *e, char **blob, const char *name)
335{
336 void *pos = e->pos;
337
338 if (aa_unpack_nameX(e, AA_BLOB, name)) {
339 u32 size;
340 if (!aa_inbounds(e, sizeof(u32)))
341 goto fail;
342 size = le32_to_cpu(get_unaligned((__le32 *) e->pos));
343 e->pos += sizeof(u32);
344 if (aa_inbounds(e, (size_t) size)) {
345 *blob = e->pos;
346 e->pos += size;
347 return size;
348 }
349 }
350
351fail:
352 e->pos = pos;
353 return 0;
354}
355EXPORT_SYMBOL_IF_KUNIT(aa_unpack_blob);
356
357VISIBLE_IF_KUNIT int aa_unpack_str(struct aa_ext *e, const char **string, const char *name)
358{
359 char *src_str;
360 size_t size = 0;
361 void *pos = e->pos;
362 *string = NULL;
363 if (aa_unpack_nameX(e, AA_STRING, name)) {
364 size = aa_unpack_u16_chunk(e, &src_str);
365 if (size) {
366 /* strings are null terminated, length is size - 1 */
367 if (src_str[size - 1] != 0)
368 goto fail;
369 *string = src_str;
370
371 return size;
372 }
373 }
374
375fail:
376 e->pos = pos;
377 return 0;
378}
379EXPORT_SYMBOL_IF_KUNIT(aa_unpack_str);
380
381VISIBLE_IF_KUNIT int aa_unpack_strdup(struct aa_ext *e, char **string, const char *name)
382{
383 const char *tmp;
384 void *pos = e->pos;
385 int res = aa_unpack_str(e, &tmp, name);
386 *string = NULL;
387
388 if (!res)
389 return 0;
390
391 *string = kmemdup(tmp, res, GFP_KERNEL);
392 if (!*string) {
393 e->pos = pos;
394 return 0;
395 }
396
397 return res;
398}
399EXPORT_SYMBOL_IF_KUNIT(aa_unpack_strdup);
400
401
402/**
403 * unpack_dfa - unpack a file rule dfa
404 * @e: serialized data extent information (NOT NULL)
405 * @flags: dfa flags to check
406 *
407 * returns dfa or ERR_PTR or NULL if no dfa
408 */
409static struct aa_dfa *unpack_dfa(struct aa_ext *e, int flags)
410{
411 char *blob = NULL;
412 size_t size;
413 struct aa_dfa *dfa = NULL;
414
415 size = aa_unpack_blob(e, &blob, "aadfa");
416 if (size) {
417 /*
418 * The dfa is aligned with in the blob to 8 bytes
419 * from the beginning of the stream.
420 * alignment adjust needed by dfa unpack
421 */
422 size_t sz = blob - (char *) e->start -
423 ((e->pos - e->start) & 7);
424 size_t pad = ALIGN(sz, 8) - sz;
425 if (aa_g_paranoid_load)
426 flags |= DFA_FLAG_VERIFY_STATES;
427 dfa = aa_dfa_unpack(blob + pad, size - pad, flags);
428
429 if (IS_ERR(dfa))
430 return dfa;
431
432 }
433
434 return dfa;
435}
436
437/**
438 * unpack_trans_table - unpack a profile transition table
439 * @e: serialized data extent information (NOT NULL)
440 * @table: str table to unpack to (NOT NULL)
441 *
442 * Returns: true if table successfully unpacked or not present
443 */
444static bool unpack_trans_table(struct aa_ext *e, struct aa_str_table *strs)
445{
446 void *saved_pos = e->pos;
447 char **table = NULL;
448
449 /* exec table is optional */
450 if (aa_unpack_nameX(e, AA_STRUCT, "xtable")) {
451 u16 size;
452 int i;
453
454 if (!aa_unpack_array(e, NULL, &size))
455 /*
456 * Note: index into trans table array is a max
457 * of 2^24, but unpack array can only unpack
458 * an array of 2^16 in size atm so no need
459 * for size check here
460 */
461 goto fail;
462 table = kcalloc(size, sizeof(char *), GFP_KERNEL);
463 if (!table)
464 goto fail;
465
466 for (i = 0; i < size; i++) {
467 char *str;
468 int c, j, pos, size2 = aa_unpack_strdup(e, &str, NULL);
469 /* aa_unpack_strdup verifies that the last character is
470 * null termination byte.
471 */
472 if (!size2)
473 goto fail;
474 table[i] = str;
475 /* verify that name doesn't start with space */
476 if (isspace(*str))
477 goto fail;
478
479 /* count internal # of internal \0 */
480 for (c = j = 0; j < size2 - 1; j++) {
481 if (!str[j]) {
482 pos = j;
483 c++;
484 }
485 }
486 if (*str == ':') {
487 /* first character after : must be valid */
488 if (!str[1])
489 goto fail;
490 /* beginning with : requires an embedded \0,
491 * verify that exactly 1 internal \0 exists
492 * trailing \0 already verified by aa_unpack_strdup
493 *
494 * convert \0 back to : for label_parse
495 */
496 if (c == 1)
497 str[pos] = ':';
498 else if (c > 1)
499 goto fail;
500 } else if (c)
501 /* fail - all other cases with embedded \0 */
502 goto fail;
503 }
504 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
505 goto fail;
506 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
507 goto fail;
508
509 strs->table = table;
510 strs->size = size;
511 }
512 return true;
513
514fail:
515 kfree_sensitive(table);
516 e->pos = saved_pos;
517 return false;
518}
519
520static bool unpack_xattrs(struct aa_ext *e, struct aa_profile *profile)
521{
522 void *pos = e->pos;
523
524 if (aa_unpack_nameX(e, AA_STRUCT, "xattrs")) {
525 u16 size;
526 int i;
527
528 if (!aa_unpack_array(e, NULL, &size))
529 goto fail;
530 profile->attach.xattr_count = size;
531 profile->attach.xattrs = kcalloc(size, sizeof(char *), GFP_KERNEL);
532 if (!profile->attach.xattrs)
533 goto fail;
534 for (i = 0; i < size; i++) {
535 if (!aa_unpack_strdup(e, &profile->attach.xattrs[i], NULL))
536 goto fail;
537 }
538 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
539 goto fail;
540 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
541 goto fail;
542 }
543
544 return true;
545
546fail:
547 e->pos = pos;
548 return false;
549}
550
551static bool unpack_secmark(struct aa_ext *e, struct aa_ruleset *rules)
552{
553 void *pos = e->pos;
554 u16 size;
555 int i;
556
557 if (aa_unpack_nameX(e, AA_STRUCT, "secmark")) {
558 if (!aa_unpack_array(e, NULL, &size))
559 goto fail;
560
561 rules->secmark = kcalloc(size, sizeof(struct aa_secmark),
562 GFP_KERNEL);
563 if (!rules->secmark)
564 goto fail;
565
566 rules->secmark_count = size;
567
568 for (i = 0; i < size; i++) {
569 if (!unpack_u8(e, &rules->secmark[i].audit, NULL))
570 goto fail;
571 if (!unpack_u8(e, &rules->secmark[i].deny, NULL))
572 goto fail;
573 if (!aa_unpack_strdup(e, &rules->secmark[i].label, NULL))
574 goto fail;
575 }
576 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
577 goto fail;
578 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
579 goto fail;
580 }
581
582 return true;
583
584fail:
585 if (rules->secmark) {
586 for (i = 0; i < size; i++)
587 kfree(rules->secmark[i].label);
588 kfree(rules->secmark);
589 rules->secmark_count = 0;
590 rules->secmark = NULL;
591 }
592
593 e->pos = pos;
594 return false;
595}
596
597static bool unpack_rlimits(struct aa_ext *e, struct aa_ruleset *rules)
598{
599 void *pos = e->pos;
600
601 /* rlimits are optional */
602 if (aa_unpack_nameX(e, AA_STRUCT, "rlimits")) {
603 u16 size;
604 int i;
605 u32 tmp = 0;
606 if (!aa_unpack_u32(e, &tmp, NULL))
607 goto fail;
608 rules->rlimits.mask = tmp;
609
610 if (!aa_unpack_array(e, NULL, &size) ||
611 size > RLIM_NLIMITS)
612 goto fail;
613 for (i = 0; i < size; i++) {
614 u64 tmp2 = 0;
615 int a = aa_map_resource(i);
616 if (!aa_unpack_u64(e, &tmp2, NULL))
617 goto fail;
618 rules->rlimits.limits[a].rlim_max = tmp2;
619 }
620 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
621 goto fail;
622 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
623 goto fail;
624 }
625 return true;
626
627fail:
628 e->pos = pos;
629 return false;
630}
631
632static bool unpack_perm(struct aa_ext *e, u32 version, struct aa_perms *perm)
633{
634 if (version != 1)
635 return false;
636
637 return aa_unpack_u32(e, &perm->allow, NULL) &&
638 aa_unpack_u32(e, &perm->allow, NULL) &&
639 aa_unpack_u32(e, &perm->deny, NULL) &&
640 aa_unpack_u32(e, &perm->subtree, NULL) &&
641 aa_unpack_u32(e, &perm->cond, NULL) &&
642 aa_unpack_u32(e, &perm->kill, NULL) &&
643 aa_unpack_u32(e, &perm->complain, NULL) &&
644 aa_unpack_u32(e, &perm->prompt, NULL) &&
645 aa_unpack_u32(e, &perm->audit, NULL) &&
646 aa_unpack_u32(e, &perm->quiet, NULL) &&
647 aa_unpack_u32(e, &perm->hide, NULL) &&
648 aa_unpack_u32(e, &perm->xindex, NULL) &&
649 aa_unpack_u32(e, &perm->tag, NULL) &&
650 aa_unpack_u32(e, &perm->label, NULL);
651}
652
653static ssize_t unpack_perms_table(struct aa_ext *e, struct aa_perms **perms)
654{
655 void *pos = e->pos;
656 u16 size = 0;
657
658 AA_BUG(!perms);
659 /*
660 * policy perms are optional, in which case perms are embedded
661 * in the dfa accept table
662 */
663 if (aa_unpack_nameX(e, AA_STRUCT, "perms")) {
664 int i;
665 u32 version;
666
667 if (!aa_unpack_u32(e, &version, "version"))
668 goto fail_reset;
669 if (!aa_unpack_array(e, NULL, &size))
670 goto fail_reset;
671 *perms = kcalloc(size, sizeof(struct aa_perms), GFP_KERNEL);
672 if (!*perms)
673 goto fail_reset;
674 for (i = 0; i < size; i++) {
675 if (!unpack_perm(e, version, &(*perms)[i]))
676 goto fail;
677 }
678 if (!aa_unpack_nameX(e, AA_ARRAYEND, NULL))
679 goto fail;
680 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
681 goto fail;
682 } else
683 *perms = NULL;
684
685 return size;
686
687fail:
688 kfree(*perms);
689fail_reset:
690 e->pos = pos;
691 return -EPROTO;
692}
693
694static int unpack_pdb(struct aa_ext *e, struct aa_policydb *policy,
695 bool required_dfa, bool required_trans,
696 const char **info)
697{
698 void *pos = e->pos;
699 int i, flags, error = -EPROTO;
700 ssize_t size;
701
702 size = unpack_perms_table(e, &policy->perms);
703 if (size < 0) {
704 error = size;
705 policy->perms = NULL;
706 *info = "failed to unpack - perms";
707 goto fail;
708 }
709 policy->size = size;
710
711 if (policy->perms) {
712 /* perms table present accept is index */
713 flags = TO_ACCEPT1_FLAG(YYTD_DATA32);
714 } else {
715 /* packed perms in accept1 and accept2 */
716 flags = TO_ACCEPT1_FLAG(YYTD_DATA32) |
717 TO_ACCEPT2_FLAG(YYTD_DATA32);
718 }
719
720 policy->dfa = unpack_dfa(e, flags);
721 if (IS_ERR(policy->dfa)) {
722 error = PTR_ERR(policy->dfa);
723 policy->dfa = NULL;
724 *info = "failed to unpack - dfa";
725 goto fail;
726 } else if (!policy->dfa) {
727 if (required_dfa) {
728 *info = "missing required dfa";
729 goto fail;
730 }
731 goto out;
732 }
733
734 /*
735 * only unpack the following if a dfa is present
736 *
737 * sadly start was given different names for file and policydb
738 * but since it is optional we can try both
739 */
740 if (!aa_unpack_u32(e, &policy->start[0], "start"))
741 /* default start state */
742 policy->start[0] = DFA_START;
743 if (!aa_unpack_u32(e, &policy->start[AA_CLASS_FILE], "dfa_start")) {
744 /* default start state for xmatch and file dfa */
745 policy->start[AA_CLASS_FILE] = DFA_START;
746 } /* setup class index */
747 for (i = AA_CLASS_FILE + 1; i <= AA_CLASS_LAST; i++) {
748 policy->start[i] = aa_dfa_next(policy->dfa, policy->start[0],
749 i);
750 }
751 if (!unpack_trans_table(e, &policy->trans) && required_trans) {
752 *info = "failed to unpack profile transition table";
753 goto fail;
754 }
755
756 /* TODO: move compat mapping here, requires dfa merging first */
757 /* TODO: move verify here, it has to be done after compat mappings */
758out:
759 return 0;
760
761fail:
762 e->pos = pos;
763 return error;
764}
765
766static u32 strhash(const void *data, u32 len, u32 seed)
767{
768 const char * const *key = data;
769
770 return jhash(*key, strlen(*key), seed);
771}
772
773static int datacmp(struct rhashtable_compare_arg *arg, const void *obj)
774{
775 const struct aa_data *data = obj;
776 const char * const *key = arg->key;
777
778 return strcmp(data->key, *key);
779}
780
781/**
782 * unpack_profile - unpack a serialized profile
783 * @e: serialized data extent information (NOT NULL)
784 * @ns_name: pointer of newly allocated copy of %NULL in case of error
785 *
786 * NOTE: unpack profile sets audit struct if there is a failure
787 */
788static struct aa_profile *unpack_profile(struct aa_ext *e, char **ns_name)
789{
790 struct aa_ruleset *rules;
791 struct aa_profile *profile = NULL;
792 const char *tmpname, *tmpns = NULL, *name = NULL;
793 const char *info = "failed to unpack profile";
794 size_t ns_len;
795 struct rhashtable_params params = { 0 };
796 char *key = NULL;
797 struct aa_data *data;
798 int error = -EPROTO;
799 kernel_cap_t tmpcap;
800 u32 tmp;
801
802 *ns_name = NULL;
803
804 /* check that we have the right struct being passed */
805 if (!aa_unpack_nameX(e, AA_STRUCT, "profile"))
806 goto fail;
807 if (!aa_unpack_str(e, &name, NULL))
808 goto fail;
809 if (*name == '\0')
810 goto fail;
811
812 tmpname = aa_splitn_fqname(name, strlen(name), &tmpns, &ns_len);
813 if (tmpns) {
814 *ns_name = kstrndup(tmpns, ns_len, GFP_KERNEL);
815 if (!*ns_name) {
816 info = "out of memory";
817 error = -ENOMEM;
818 goto fail;
819 }
820 name = tmpname;
821 }
822
823 profile = aa_alloc_profile(name, NULL, GFP_KERNEL);
824 if (!profile) {
825 info = "out of memory";
826 error = -ENOMEM;
827 goto fail;
828 }
829 rules = list_first_entry(&profile->rules, typeof(*rules), list);
830
831 /* profile renaming is optional */
832 (void) aa_unpack_str(e, &profile->rename, "rename");
833
834 /* attachment string is optional */
835 (void) aa_unpack_str(e, &profile->attach.xmatch_str, "attach");
836
837 /* xmatch is optional and may be NULL */
838 error = unpack_pdb(e, &profile->attach.xmatch, false, false, &info);
839 if (error) {
840 info = "bad xmatch";
841 goto fail;
842 }
843
844 /* neither xmatch_len not xmatch_perms are optional if xmatch is set */
845 if (profile->attach.xmatch.dfa) {
846 if (!aa_unpack_u32(e, &tmp, NULL)) {
847 info = "missing xmatch len";
848 goto fail;
849 }
850 profile->attach.xmatch_len = tmp;
851 profile->attach.xmatch.start[AA_CLASS_XMATCH] = DFA_START;
852 error = aa_compat_map_xmatch(&profile->attach.xmatch);
853 if (error) {
854 info = "failed to convert xmatch permission table";
855 goto fail;
856 }
857 }
858
859 /* disconnected attachment string is optional */
860 (void) aa_unpack_str(e, &profile->disconnected, "disconnected");
861
862 /* per profile debug flags (complain, audit) */
863 if (!aa_unpack_nameX(e, AA_STRUCT, "flags")) {
864 info = "profile missing flags";
865 goto fail;
866 }
867 info = "failed to unpack profile flags";
868 if (!aa_unpack_u32(e, &tmp, NULL))
869 goto fail;
870 if (tmp & PACKED_FLAG_HAT)
871 profile->label.flags |= FLAG_HAT;
872 if (tmp & PACKED_FLAG_DEBUG1)
873 profile->label.flags |= FLAG_DEBUG1;
874 if (tmp & PACKED_FLAG_DEBUG2)
875 profile->label.flags |= FLAG_DEBUG2;
876 if (!aa_unpack_u32(e, &tmp, NULL))
877 goto fail;
878 if (tmp == PACKED_MODE_COMPLAIN || (e->version & FORCE_COMPLAIN_FLAG)) {
879 profile->mode = APPARMOR_COMPLAIN;
880 } else if (tmp == PACKED_MODE_ENFORCE) {
881 profile->mode = APPARMOR_ENFORCE;
882 } else if (tmp == PACKED_MODE_KILL) {
883 profile->mode = APPARMOR_KILL;
884 } else if (tmp == PACKED_MODE_UNCONFINED) {
885 profile->mode = APPARMOR_UNCONFINED;
886 profile->label.flags |= FLAG_UNCONFINED;
887 } else if (tmp == PACKED_MODE_USER) {
888 profile->mode = APPARMOR_USER;
889 } else {
890 goto fail;
891 }
892 if (!aa_unpack_u32(e, &tmp, NULL))
893 goto fail;
894 if (tmp)
895 profile->audit = AUDIT_ALL;
896
897 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
898 goto fail;
899
900 /* path_flags is optional */
901 if (aa_unpack_u32(e, &profile->path_flags, "path_flags"))
902 profile->path_flags |= profile->label.flags &
903 PATH_MEDIATE_DELETED;
904 else
905 /* set a default value if path_flags field is not present */
906 profile->path_flags = PATH_MEDIATE_DELETED;
907
908 info = "failed to unpack profile capabilities";
909 if (!aa_unpack_u32(e, &(rules->caps.allow.cap[0]), NULL))
910 goto fail;
911 if (!aa_unpack_u32(e, &(rules->caps.audit.cap[0]), NULL))
912 goto fail;
913 if (!aa_unpack_u32(e, &(rules->caps.quiet.cap[0]), NULL))
914 goto fail;
915 if (!aa_unpack_u32(e, &tmpcap.cap[0], NULL))
916 goto fail;
917
918 info = "failed to unpack upper profile capabilities";
919 if (aa_unpack_nameX(e, AA_STRUCT, "caps64")) {
920 /* optional upper half of 64 bit caps */
921 if (!aa_unpack_u32(e, &(rules->caps.allow.cap[1]), NULL))
922 goto fail;
923 if (!aa_unpack_u32(e, &(rules->caps.audit.cap[1]), NULL))
924 goto fail;
925 if (!aa_unpack_u32(e, &(rules->caps.quiet.cap[1]), NULL))
926 goto fail;
927 if (!aa_unpack_u32(e, &(tmpcap.cap[1]), NULL))
928 goto fail;
929 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
930 goto fail;
931 }
932
933 info = "failed to unpack extended profile capabilities";
934 if (aa_unpack_nameX(e, AA_STRUCT, "capsx")) {
935 /* optional extended caps mediation mask */
936 if (!aa_unpack_u32(e, &(rules->caps.extended.cap[0]), NULL))
937 goto fail;
938 if (!aa_unpack_u32(e, &(rules->caps.extended.cap[1]), NULL))
939 goto fail;
940 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
941 goto fail;
942 }
943
944 if (!unpack_xattrs(e, profile)) {
945 info = "failed to unpack profile xattrs";
946 goto fail;
947 }
948
949 if (!unpack_rlimits(e, rules)) {
950 info = "failed to unpack profile rlimits";
951 goto fail;
952 }
953
954 if (!unpack_secmark(e, rules)) {
955 info = "failed to unpack profile secmark rules";
956 goto fail;
957 }
958
959 if (aa_unpack_nameX(e, AA_STRUCT, "policydb")) {
960 /* generic policy dfa - optional and may be NULL */
961 info = "failed to unpack policydb";
962 error = unpack_pdb(e, &rules->policy, true, false,
963 &info);
964 if (error)
965 goto fail;
966 /* Fixup: drop when we get rid of start array */
967 if (aa_dfa_next(rules->policy.dfa, rules->policy.start[0],
968 AA_CLASS_FILE))
969 rules->policy.start[AA_CLASS_FILE] =
970 aa_dfa_next(rules->policy.dfa,
971 rules->policy.start[0],
972 AA_CLASS_FILE);
973 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL))
974 goto fail;
975 error = aa_compat_map_policy(&rules->policy, e->version);
976 if (error) {
977 info = "failed to remap policydb permission table";
978 goto fail;
979 }
980 } else
981 rules->policy.dfa = aa_get_dfa(nulldfa);
982
983 /* get file rules */
984 error = unpack_pdb(e, &rules->file, false, true, &info);
985 if (error) {
986 goto fail;
987 } else if (rules->file.dfa) {
988 error = aa_compat_map_file(&rules->file);
989 if (error) {
990 info = "failed to remap file permission table";
991 goto fail;
992 }
993 } else if (rules->policy.dfa &&
994 rules->policy.start[AA_CLASS_FILE]) {
995 rules->file.dfa = aa_get_dfa(rules->policy.dfa);
996 rules->file.start[AA_CLASS_FILE] = rules->policy.start[AA_CLASS_FILE];
997 } else
998 rules->file.dfa = aa_get_dfa(nulldfa);
999
1000 error = -EPROTO;
1001 if (aa_unpack_nameX(e, AA_STRUCT, "data")) {
1002 info = "out of memory";
1003 profile->data = kzalloc(sizeof(*profile->data), GFP_KERNEL);
1004 if (!profile->data) {
1005 error = -ENOMEM;
1006 goto fail;
1007 }
1008 params.nelem_hint = 3;
1009 params.key_len = sizeof(void *);
1010 params.key_offset = offsetof(struct aa_data, key);
1011 params.head_offset = offsetof(struct aa_data, head);
1012 params.hashfn = strhash;
1013 params.obj_cmpfn = datacmp;
1014
1015 if (rhashtable_init(profile->data, ¶ms)) {
1016 info = "failed to init key, value hash table";
1017 goto fail;
1018 }
1019
1020 while (aa_unpack_strdup(e, &key, NULL)) {
1021 data = kzalloc(sizeof(*data), GFP_KERNEL);
1022 if (!data) {
1023 kfree_sensitive(key);
1024 error = -ENOMEM;
1025 goto fail;
1026 }
1027
1028 data->key = key;
1029 data->size = aa_unpack_blob(e, &data->data, NULL);
1030 data->data = kvmemdup(data->data, data->size);
1031 if (data->size && !data->data) {
1032 kfree_sensitive(data->key);
1033 kfree_sensitive(data);
1034 error = -ENOMEM;
1035 goto fail;
1036 }
1037
1038 rhashtable_insert_fast(profile->data, &data->head,
1039 profile->data->p);
1040 }
1041
1042 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1043 info = "failed to unpack end of key, value data table";
1044 goto fail;
1045 }
1046 }
1047
1048 if (!aa_unpack_nameX(e, AA_STRUCTEND, NULL)) {
1049 info = "failed to unpack end of profile";
1050 goto fail;
1051 }
1052
1053 return profile;
1054
1055fail:
1056 if (error == 0)
1057 /* default error covers most cases */
1058 error = -EPROTO;
1059 if (*ns_name) {
1060 kfree(*ns_name);
1061 *ns_name = NULL;
1062 }
1063 if (profile)
1064 name = NULL;
1065 else if (!name)
1066 name = "unknown";
1067 audit_iface(profile, NULL, name, info, e, error);
1068 aa_free_profile(profile);
1069
1070 return ERR_PTR(error);
1071}
1072
1073/**
1074 * verify_header - unpack serialized stream header
1075 * @e: serialized data read head (NOT NULL)
1076 * @required: whether the header is required or optional
1077 * @ns: Returns - namespace if one is specified else NULL (NOT NULL)
1078 *
1079 * Returns: error or 0 if header is good
1080 */
1081static int verify_header(struct aa_ext *e, int required, const char **ns)
1082{
1083 int error = -EPROTONOSUPPORT;
1084 const char *name = NULL;
1085 *ns = NULL;
1086
1087 /* get the interface version */
1088 if (!aa_unpack_u32(e, &e->version, "version")) {
1089 if (required) {
1090 audit_iface(NULL, NULL, NULL, "invalid profile format",
1091 e, error);
1092 return error;
1093 }
1094 }
1095
1096 /* Check that the interface version is currently supported.
1097 * if not specified use previous version
1098 * Mask off everything that is not kernel abi version
1099 */
1100 if (VERSION_LT(e->version, v5) || VERSION_GT(e->version, v9)) {
1101 audit_iface(NULL, NULL, NULL, "unsupported interface version",
1102 e, error);
1103 return error;
1104 }
1105
1106 /* read the namespace if present */
1107 if (aa_unpack_str(e, &name, "namespace")) {
1108 if (*name == '\0') {
1109 audit_iface(NULL, NULL, NULL, "invalid namespace name",
1110 e, error);
1111 return error;
1112 }
1113 if (*ns && strcmp(*ns, name)) {
1114 audit_iface(NULL, NULL, NULL, "invalid ns change", e,
1115 error);
1116 } else if (!*ns) {
1117 *ns = kstrdup(name, GFP_KERNEL);
1118 if (!*ns)
1119 return -ENOMEM;
1120 }
1121 }
1122
1123 return 0;
1124}
1125
1126static bool verify_xindex(int xindex, int table_size)
1127{
1128 int index, xtype;
1129 xtype = xindex & AA_X_TYPE_MASK;
1130 index = xindex & AA_X_INDEX_MASK;
1131 if (xtype == AA_X_TABLE && index >= table_size)
1132 return false;
1133 return true;
1134}
1135
1136/* verify dfa xindexes are in range of transition tables */
1137static bool verify_dfa_xindex(struct aa_dfa *dfa, int table_size)
1138{
1139 int i;
1140 for (i = 0; i < dfa->tables[YYTD_ID_ACCEPT]->td_lolen; i++) {
1141 if (!verify_xindex(ACCEPT_TABLE(dfa)[i], table_size))
1142 return false;
1143 }
1144 return true;
1145}
1146
1147static bool verify_perm(struct aa_perms *perm)
1148{
1149 /* TODO: allow option to just force the perms into a valid state */
1150 if (perm->allow & perm->deny)
1151 return false;
1152 if (perm->subtree & ~perm->allow)
1153 return false;
1154 if (perm->cond & (perm->allow | perm->deny))
1155 return false;
1156 if (perm->kill & perm->allow)
1157 return false;
1158 if (perm->complain & (perm->allow | perm->deny))
1159 return false;
1160 if (perm->prompt & (perm->allow | perm->deny))
1161 return false;
1162 if (perm->complain & perm->prompt)
1163 return false;
1164 if (perm->hide & perm->allow)
1165 return false;
1166
1167 return true;
1168}
1169
1170static bool verify_perms(struct aa_policydb *pdb)
1171{
1172 int i;
1173
1174 for (i = 0; i < pdb->size; i++) {
1175 if (!verify_perm(&pdb->perms[i]))
1176 return false;
1177 /* verify indexes into str table */
1178 if (pdb->perms[i].xindex >= pdb->trans.size)
1179 return false;
1180 if (pdb->perms[i].tag >= pdb->trans.size)
1181 return false;
1182 if (pdb->perms[i].label >= pdb->trans.size)
1183 return false;
1184 }
1185
1186 return true;
1187}
1188
1189/**
1190 * verify_profile - Do post unpack analysis to verify profile consistency
1191 * @profile: profile to verify (NOT NULL)
1192 *
1193 * Returns: 0 if passes verification else error
1194 *
1195 * This verification is post any unpack mapping or changes
1196 */
1197static int verify_profile(struct aa_profile *profile)
1198{
1199 struct aa_ruleset *rules = list_first_entry(&profile->rules,
1200 typeof(*rules), list);
1201 if (!rules)
1202 return 0;
1203
1204 if ((rules->file.dfa && !verify_dfa_xindex(rules->file.dfa,
1205 rules->file.trans.size)) ||
1206 (rules->policy.dfa &&
1207 !verify_dfa_xindex(rules->policy.dfa, rules->policy.trans.size))) {
1208 audit_iface(profile, NULL, NULL,
1209 "Unpack: Invalid named transition", NULL, -EPROTO);
1210 return -EPROTO;
1211 }
1212
1213 if (!verify_perms(&rules->file)) {
1214 audit_iface(profile, NULL, NULL,
1215 "Unpack: Invalid perm index", NULL, -EPROTO);
1216 return -EPROTO;
1217 }
1218 if (!verify_perms(&rules->policy)) {
1219 audit_iface(profile, NULL, NULL,
1220 "Unpack: Invalid perm index", NULL, -EPROTO);
1221 return -EPROTO;
1222 }
1223 if (!verify_perms(&profile->attach.xmatch)) {
1224 audit_iface(profile, NULL, NULL,
1225 "Unpack: Invalid perm index", NULL, -EPROTO);
1226 return -EPROTO;
1227 }
1228
1229 return 0;
1230}
1231
1232void aa_load_ent_free(struct aa_load_ent *ent)
1233{
1234 if (ent) {
1235 aa_put_profile(ent->rename);
1236 aa_put_profile(ent->old);
1237 aa_put_profile(ent->new);
1238 kfree(ent->ns_name);
1239 kfree_sensitive(ent);
1240 }
1241}
1242
1243struct aa_load_ent *aa_load_ent_alloc(void)
1244{
1245 struct aa_load_ent *ent = kzalloc(sizeof(*ent), GFP_KERNEL);
1246 if (ent)
1247 INIT_LIST_HEAD(&ent->list);
1248 return ent;
1249}
1250
1251static int compress_zstd(const char *src, size_t slen, char **dst, size_t *dlen)
1252{
1253#ifdef CONFIG_SECURITY_APPARMOR_EXPORT_BINARY
1254 const zstd_parameters params =
1255 zstd_get_params(aa_g_rawdata_compression_level, slen);
1256 const size_t wksp_len = zstd_cctx_workspace_bound(¶ms.cParams);
1257 void *wksp = NULL;
1258 zstd_cctx *ctx = NULL;
1259 size_t out_len = zstd_compress_bound(slen);
1260 void *out = NULL;
1261 int ret = 0;
1262
1263 out = kvzalloc(out_len, GFP_KERNEL);
1264 if (!out) {
1265 ret = -ENOMEM;
1266 goto cleanup;
1267 }
1268
1269 wksp = kvzalloc(wksp_len, GFP_KERNEL);
1270 if (!wksp) {
1271 ret = -ENOMEM;
1272 goto cleanup;
1273 }
1274
1275 ctx = zstd_init_cctx(wksp, wksp_len);
1276 if (!ctx) {
1277 ret = -EINVAL;
1278 goto cleanup;
1279 }
1280
1281 out_len = zstd_compress_cctx(ctx, out, out_len, src, slen, ¶ms);
1282 if (zstd_is_error(out_len) || out_len >= slen) {
1283 ret = -EINVAL;
1284 goto cleanup;
1285 }
1286
1287 if (is_vmalloc_addr(out)) {
1288 *dst = kvzalloc(out_len, GFP_KERNEL);
1289 if (*dst) {
1290 memcpy(*dst, out, out_len);
1291 kvfree(out);
1292 out = NULL;
1293 }
1294 } else {
1295 /*
1296 * If the staging buffer was kmalloc'd, then using krealloc is
1297 * probably going to be faster. The destination buffer will
1298 * always be smaller, so it's just shrunk, avoiding a memcpy
1299 */
1300 *dst = krealloc(out, out_len, GFP_KERNEL);
1301 }
1302
1303 if (!*dst) {
1304 ret = -ENOMEM;
1305 goto cleanup;
1306 }
1307
1308 *dlen = out_len;
1309
1310cleanup:
1311 if (ret) {
1312 kvfree(out);
1313 *dst = NULL;
1314 }
1315
1316 kvfree(wksp);
1317 return ret;
1318#else
1319 *dlen = slen;
1320 return 0;
1321#endif
1322}
1323
1324static int compress_loaddata(struct aa_loaddata *data)
1325{
1326 AA_BUG(data->compressed_size > 0);
1327
1328 /*
1329 * Shortcut the no compression case, else we increase the amount of
1330 * storage required by a small amount
1331 */
1332 if (aa_g_rawdata_compression_level != 0) {
1333 void *udata = data->data;
1334 int error = compress_zstd(udata, data->size, &data->data,
1335 &data->compressed_size);
1336 if (error) {
1337 data->compressed_size = data->size;
1338 return error;
1339 }
1340 if (udata != data->data)
1341 kvfree(udata);
1342 } else
1343 data->compressed_size = data->size;
1344
1345 return 0;
1346}
1347
1348/**
1349 * aa_unpack - unpack packed binary profile(s) data loaded from user space
1350 * @udata: user data copied to kmem (NOT NULL)
1351 * @lh: list to place unpacked profiles in a aa_repl_ws
1352 * @ns: Returns namespace profile is in if specified else NULL (NOT NULL)
1353 *
1354 * Unpack user data and return refcounted allocated profile(s) stored in
1355 * @lh in order of discovery, with the list chain stored in base.list
1356 * or error
1357 *
1358 * Returns: profile(s) on @lh else error pointer if fails to unpack
1359 */
1360int aa_unpack(struct aa_loaddata *udata, struct list_head *lh,
1361 const char **ns)
1362{
1363 struct aa_load_ent *tmp, *ent;
1364 struct aa_profile *profile = NULL;
1365 char *ns_name = NULL;
1366 int error;
1367 struct aa_ext e = {
1368 .start = udata->data,
1369 .end = udata->data + udata->size,
1370 .pos = udata->data,
1371 };
1372
1373 *ns = NULL;
1374 while (e.pos < e.end) {
1375 void *start;
1376 error = verify_header(&e, e.pos == e.start, ns);
1377 if (error)
1378 goto fail;
1379
1380 start = e.pos;
1381 profile = unpack_profile(&e, &ns_name);
1382 if (IS_ERR(profile)) {
1383 error = PTR_ERR(profile);
1384 goto fail;
1385 }
1386
1387 error = verify_profile(profile);
1388 if (error)
1389 goto fail_profile;
1390
1391 if (aa_g_hash_policy)
1392 error = aa_calc_profile_hash(profile, e.version, start,
1393 e.pos - start);
1394 if (error)
1395 goto fail_profile;
1396
1397 ent = aa_load_ent_alloc();
1398 if (!ent) {
1399 error = -ENOMEM;
1400 goto fail_profile;
1401 }
1402
1403 ent->new = profile;
1404 ent->ns_name = ns_name;
1405 ns_name = NULL;
1406 list_add_tail(&ent->list, lh);
1407 }
1408 udata->abi = e.version & K_ABI_MASK;
1409 if (aa_g_hash_policy) {
1410 udata->hash = aa_calc_hash(udata->data, udata->size);
1411 if (IS_ERR(udata->hash)) {
1412 error = PTR_ERR(udata->hash);
1413 udata->hash = NULL;
1414 goto fail;
1415 }
1416 }
1417
1418 if (aa_g_export_binary) {
1419 error = compress_loaddata(udata);
1420 if (error)
1421 goto fail;
1422 }
1423 return 0;
1424
1425fail_profile:
1426 kfree(ns_name);
1427 aa_put_profile(profile);
1428
1429fail:
1430 list_for_each_entry_safe(ent, tmp, lh, list) {
1431 list_del_init(&ent->list);
1432 aa_load_ent_free(ent);
1433 }
1434
1435 return error;
1436}