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