Loading...
1/*
2 * AppArmor security module
3 *
4 * This file contains AppArmor policy manipulation functions
5 *
6 * Copyright (C) 1998-2008 Novell/SUSE
7 * Copyright 2009-2010 Canonical Ltd.
8 *
9 * This program is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU General Public License as
11 * published by the Free Software Foundation, version 2 of the
12 * License.
13 *
14 *
15 * AppArmor policy is based around profiles, which contain the rules a
16 * task is confined by. Every task in the system has a profile attached
17 * to it determined either by matching "unconfined" tasks against the
18 * visible set of profiles or by following a profiles attachment rules.
19 *
20 * Each profile exists in a profile namespace which is a container of
21 * visible profiles. Each namespace contains a special "unconfined" profile,
22 * which doesn't enforce any confinement on a task beyond DAC.
23 *
24 * Namespace and profile names can be written together in either
25 * of two syntaxes.
26 * :namespace:profile - used by kernel interfaces for easy detection
27 * namespace://profile - used by policy
28 *
29 * Profile names can not start with : or @ or ^ and may not contain \0
30 *
31 * Reserved profile names
32 * unconfined - special automatically generated unconfined profile
33 * inherit - special name to indicate profile inheritance
34 * null-XXXX-YYYY - special automatically generated learning profiles
35 *
36 * Namespace names may not start with / or @ and may not contain \0 or :
37 * Reserved namespace names
38 * user-XXXX - user defined profiles
39 *
40 * a // in a profile or namespace name indicates a hierarchical name with the
41 * name before the // being the parent and the name after the child.
42 *
43 * Profile and namespace hierarchies serve two different but similar purposes.
44 * The namespace contains the set of visible profiles that are considered
45 * for attachment. The hierarchy of namespaces allows for virtualizing
46 * the namespace so that for example a chroot can have its own set of profiles
47 * which may define some local user namespaces.
48 * The profile hierarchy severs two distinct purposes,
49 * - it allows for sub profiles or hats, which allows an application to run
50 * subprograms under its own profile with different restriction than it
51 * self, and not have it use the system profile.
52 * eg. if a mail program starts an editor, the policy might make the
53 * restrictions tighter on the editor tighter than the mail program,
54 * and definitely different than general editor restrictions
55 * - it allows for binary hierarchy of profiles, so that execution history
56 * is preserved. This feature isn't exploited by AppArmor reference policy
57 * but is allowed. NOTE: this is currently suboptimal because profile
58 * aliasing is not currently implemented so that a profile for each
59 * level must be defined.
60 * eg. /bin/bash///bin/ls as a name would indicate /bin/ls was started
61 * from /bin/bash
62 *
63 * A profile or namespace name that can contain one or more // separators
64 * is referred to as an hname (hierarchical).
65 * eg. /bin/bash//bin/ls
66 *
67 * An fqname is a name that may contain both namespace and profile hnames.
68 * eg. :ns:/bin/bash//bin/ls
69 *
70 * NOTES:
71 * - locking of profile lists is currently fairly coarse. All profile
72 * lists within a namespace use the namespace lock.
73 * FIXME: move profile lists to using rcu_lists
74 */
75
76#include <linux/slab.h>
77#include <linux/spinlock.h>
78#include <linux/string.h>
79
80#include "include/apparmor.h"
81#include "include/capability.h"
82#include "include/context.h"
83#include "include/file.h"
84#include "include/ipc.h"
85#include "include/match.h"
86#include "include/path.h"
87#include "include/policy.h"
88#include "include/policy_unpack.h"
89#include "include/resource.h"
90#include "include/sid.h"
91
92
93/* root profile namespace */
94struct aa_namespace *root_ns;
95
96const char *profile_mode_names[] = {
97 "enforce",
98 "complain",
99 "kill",
100};
101
102/**
103 * hname_tail - find the last component of an hname
104 * @name: hname to find the base profile name component of (NOT NULL)
105 *
106 * Returns: the tail (base profile name) name component of an hname
107 */
108static const char *hname_tail(const char *hname)
109{
110 char *split;
111 hname = strim((char *)hname);
112 for (split = strstr(hname, "//"); split; split = strstr(hname, "//"))
113 hname = split + 2;
114
115 return hname;
116}
117
118/**
119 * policy_init - initialize a policy structure
120 * @policy: policy to initialize (NOT NULL)
121 * @prefix: prefix name if any is required. (MAYBE NULL)
122 * @name: name of the policy, init will make a copy of it (NOT NULL)
123 *
124 * Note: this fn creates a copy of strings passed in
125 *
126 * Returns: true if policy init successful
127 */
128static bool policy_init(struct aa_policy *policy, const char *prefix,
129 const char *name)
130{
131 /* freed by policy_free */
132 if (prefix) {
133 policy->hname = kmalloc(strlen(prefix) + strlen(name) + 3,
134 GFP_KERNEL);
135 if (policy->hname)
136 sprintf(policy->hname, "%s//%s", prefix, name);
137 } else
138 policy->hname = kstrdup(name, GFP_KERNEL);
139 if (!policy->hname)
140 return 0;
141 /* base.name is a substring of fqname */
142 policy->name = (char *)hname_tail(policy->hname);
143 INIT_LIST_HEAD(&policy->list);
144 INIT_LIST_HEAD(&policy->profiles);
145 kref_init(&policy->count);
146
147 return 1;
148}
149
150/**
151 * policy_destroy - free the elements referenced by @policy
152 * @policy: policy that is to have its elements freed (NOT NULL)
153 */
154static void policy_destroy(struct aa_policy *policy)
155{
156 /* still contains profiles -- invalid */
157 if (!list_empty(&policy->profiles)) {
158 AA_ERROR("%s: internal error, "
159 "policy '%s' still contains profiles\n",
160 __func__, policy->name);
161 BUG();
162 }
163 if (!list_empty(&policy->list)) {
164 AA_ERROR("%s: internal error, policy '%s' still on list\n",
165 __func__, policy->name);
166 BUG();
167 }
168
169 /* don't free name as its a subset of hname */
170 kzfree(policy->hname);
171}
172
173/**
174 * __policy_find - find a policy by @name on a policy list
175 * @head: list to search (NOT NULL)
176 * @name: name to search for (NOT NULL)
177 *
178 * Requires: correct locks for the @head list be held
179 *
180 * Returns: unrefcounted policy that match @name or NULL if not found
181 */
182static struct aa_policy *__policy_find(struct list_head *head, const char *name)
183{
184 struct aa_policy *policy;
185
186 list_for_each_entry(policy, head, list) {
187 if (!strcmp(policy->name, name))
188 return policy;
189 }
190 return NULL;
191}
192
193/**
194 * __policy_strn_find - find a policy that's name matches @len chars of @str
195 * @head: list to search (NOT NULL)
196 * @str: string to search for (NOT NULL)
197 * @len: length of match required
198 *
199 * Requires: correct locks for the @head list be held
200 *
201 * Returns: unrefcounted policy that match @str or NULL if not found
202 *
203 * if @len == strlen(@strlen) then this is equiv to __policy_find
204 * other wise it allows searching for policy by a partial match of name
205 */
206static struct aa_policy *__policy_strn_find(struct list_head *head,
207 const char *str, int len)
208{
209 struct aa_policy *policy;
210
211 list_for_each_entry(policy, head, list) {
212 if (aa_strneq(policy->name, str, len))
213 return policy;
214 }
215
216 return NULL;
217}
218
219/*
220 * Routines for AppArmor namespaces
221 */
222
223static const char *hidden_ns_name = "---";
224/**
225 * aa_ns_visible - test if @view is visible from @curr
226 * @curr: namespace to treat as the parent (NOT NULL)
227 * @view: namespace to test if visible from @curr (NOT NULL)
228 *
229 * Returns: true if @view is visible from @curr else false
230 */
231bool aa_ns_visible(struct aa_namespace *curr, struct aa_namespace *view)
232{
233 if (curr == view)
234 return true;
235
236 for ( ; view; view = view->parent) {
237 if (view->parent == curr)
238 return true;
239 }
240 return false;
241}
242
243/**
244 * aa_na_name - Find the ns name to display for @view from @curr
245 * @curr - current namespace (NOT NULL)
246 * @view - namespace attempting to view (NOT NULL)
247 *
248 * Returns: name of @view visible from @curr
249 */
250const char *aa_ns_name(struct aa_namespace *curr, struct aa_namespace *view)
251{
252 /* if view == curr then the namespace name isn't displayed */
253 if (curr == view)
254 return "";
255
256 if (aa_ns_visible(curr, view)) {
257 /* at this point if a ns is visible it is in a view ns
258 * thus the curr ns.hname is a prefix of its name.
259 * Only output the virtualized portion of the name
260 * Add + 2 to skip over // separating curr hname prefix
261 * from the visible tail of the views hname
262 */
263 return view->base.hname + strlen(curr->base.hname) + 2;
264 } else
265 return hidden_ns_name;
266}
267
268/**
269 * alloc_namespace - allocate, initialize and return a new namespace
270 * @prefix: parent namespace name (MAYBE NULL)
271 * @name: a preallocated name (NOT NULL)
272 *
273 * Returns: refcounted namespace or NULL on failure.
274 */
275static struct aa_namespace *alloc_namespace(const char *prefix,
276 const char *name)
277{
278 struct aa_namespace *ns;
279
280 ns = kzalloc(sizeof(*ns), GFP_KERNEL);
281 AA_DEBUG("%s(%p)\n", __func__, ns);
282 if (!ns)
283 return NULL;
284 if (!policy_init(&ns->base, prefix, name))
285 goto fail_ns;
286
287 INIT_LIST_HEAD(&ns->sub_ns);
288 rwlock_init(&ns->lock);
289
290 /* released by free_namespace */
291 ns->unconfined = aa_alloc_profile("unconfined");
292 if (!ns->unconfined)
293 goto fail_unconfined;
294
295 ns->unconfined->sid = aa_alloc_sid();
296 ns->unconfined->flags = PFLAG_UNCONFINED | PFLAG_IX_ON_NAME_ERROR |
297 PFLAG_IMMUTABLE;
298
299 /*
300 * released by free_namespace, however __remove_namespace breaks
301 * the cyclic references (ns->unconfined, and unconfined->ns) and
302 * replaces with refs to parent namespace unconfined
303 */
304 ns->unconfined->ns = aa_get_namespace(ns);
305
306 return ns;
307
308fail_unconfined:
309 kzfree(ns->base.hname);
310fail_ns:
311 kzfree(ns);
312 return NULL;
313}
314
315/**
316 * free_namespace - free a profile namespace
317 * @ns: the namespace to free (MAYBE NULL)
318 *
319 * Requires: All references to the namespace must have been put, if the
320 * namespace was referenced by a profile confining a task,
321 */
322static void free_namespace(struct aa_namespace *ns)
323{
324 if (!ns)
325 return;
326
327 policy_destroy(&ns->base);
328 aa_put_namespace(ns->parent);
329
330 if (ns->unconfined && ns->unconfined->ns == ns)
331 ns->unconfined->ns = NULL;
332
333 aa_put_profile(ns->unconfined);
334 kzfree(ns);
335}
336
337/**
338 * aa_free_namespace_kref - free aa_namespace by kref (see aa_put_namespace)
339 * @kr: kref callback for freeing of a namespace (NOT NULL)
340 */
341void aa_free_namespace_kref(struct kref *kref)
342{
343 free_namespace(container_of(kref, struct aa_namespace, base.count));
344}
345
346/**
347 * __aa_find_namespace - find a namespace on a list by @name
348 * @head: list to search for namespace on (NOT NULL)
349 * @name: name of namespace to look for (NOT NULL)
350 *
351 * Returns: unrefcounted namespace
352 *
353 * Requires: ns lock be held
354 */
355static struct aa_namespace *__aa_find_namespace(struct list_head *head,
356 const char *name)
357{
358 return (struct aa_namespace *)__policy_find(head, name);
359}
360
361/**
362 * aa_find_namespace - look up a profile namespace on the namespace list
363 * @root: namespace to search in (NOT NULL)
364 * @name: name of namespace to find (NOT NULL)
365 *
366 * Returns: a refcounted namespace on the list, or NULL if no namespace
367 * called @name exists.
368 *
369 * refcount released by caller
370 */
371struct aa_namespace *aa_find_namespace(struct aa_namespace *root,
372 const char *name)
373{
374 struct aa_namespace *ns = NULL;
375
376 read_lock(&root->lock);
377 ns = aa_get_namespace(__aa_find_namespace(&root->sub_ns, name));
378 read_unlock(&root->lock);
379
380 return ns;
381}
382
383/**
384 * aa_prepare_namespace - find an existing or create a new namespace of @name
385 * @name: the namespace to find or add (MAYBE NULL)
386 *
387 * Returns: refcounted namespace or NULL if failed to create one
388 */
389static struct aa_namespace *aa_prepare_namespace(const char *name)
390{
391 struct aa_namespace *ns, *root;
392
393 root = aa_current_profile()->ns;
394
395 write_lock(&root->lock);
396
397 /* if name isn't specified the profile is loaded to the current ns */
398 if (!name) {
399 /* released by caller */
400 ns = aa_get_namespace(root);
401 goto out;
402 }
403
404 /* try and find the specified ns and if it doesn't exist create it */
405 /* released by caller */
406 ns = aa_get_namespace(__aa_find_namespace(&root->sub_ns, name));
407 if (!ns) {
408 /* namespace not found */
409 struct aa_namespace *new_ns;
410 write_unlock(&root->lock);
411 new_ns = alloc_namespace(root->base.hname, name);
412 if (!new_ns)
413 return NULL;
414 write_lock(&root->lock);
415 /* test for race when new_ns was allocated */
416 ns = __aa_find_namespace(&root->sub_ns, name);
417 if (!ns) {
418 /* add parent ref */
419 new_ns->parent = aa_get_namespace(root);
420
421 list_add(&new_ns->base.list, &root->sub_ns);
422 /* add list ref */
423 ns = aa_get_namespace(new_ns);
424 } else {
425 /* raced so free the new one */
426 free_namespace(new_ns);
427 /* get reference on namespace */
428 aa_get_namespace(ns);
429 }
430 }
431out:
432 write_unlock(&root->lock);
433
434 /* return ref */
435 return ns;
436}
437
438/**
439 * __list_add_profile - add a profile to a list
440 * @list: list to add it to (NOT NULL)
441 * @profile: the profile to add (NOT NULL)
442 *
443 * refcount @profile, should be put by __list_remove_profile
444 *
445 * Requires: namespace lock be held, or list not be shared
446 */
447static void __list_add_profile(struct list_head *list,
448 struct aa_profile *profile)
449{
450 list_add(&profile->base.list, list);
451 /* get list reference */
452 aa_get_profile(profile);
453}
454
455/**
456 * __list_remove_profile - remove a profile from the list it is on
457 * @profile: the profile to remove (NOT NULL)
458 *
459 * remove a profile from the list, warning generally removal should
460 * be done with __replace_profile as most profile removals are
461 * replacements to the unconfined profile.
462 *
463 * put @profile list refcount
464 *
465 * Requires: namespace lock be held, or list not have been live
466 */
467static void __list_remove_profile(struct aa_profile *profile)
468{
469 list_del_init(&profile->base.list);
470 if (!(profile->flags & PFLAG_NO_LIST_REF))
471 /* release list reference */
472 aa_put_profile(profile);
473}
474
475/**
476 * __replace_profile - replace @old with @new on a list
477 * @old: profile to be replaced (NOT NULL)
478 * @new: profile to replace @old with (NOT NULL)
479 *
480 * Will duplicate and refcount elements that @new inherits from @old
481 * and will inherit @old children.
482 *
483 * refcount @new for list, put @old list refcount
484 *
485 * Requires: namespace list lock be held, or list not be shared
486 */
487static void __replace_profile(struct aa_profile *old, struct aa_profile *new)
488{
489 struct aa_policy *policy;
490 struct aa_profile *child, *tmp;
491
492 if (old->parent)
493 policy = &old->parent->base;
494 else
495 policy = &old->ns->base;
496
497 /* released when @new is freed */
498 new->parent = aa_get_profile(old->parent);
499 new->ns = aa_get_namespace(old->ns);
500 new->sid = old->sid;
501 __list_add_profile(&policy->profiles, new);
502 /* inherit children */
503 list_for_each_entry_safe(child, tmp, &old->base.profiles, base.list) {
504 aa_put_profile(child->parent);
505 child->parent = aa_get_profile(new);
506 /* list refcount transferred to @new*/
507 list_move(&child->base.list, &new->base.profiles);
508 }
509
510 /* released by free_profile */
511 old->replacedby = aa_get_profile(new);
512 __list_remove_profile(old);
513}
514
515static void __profile_list_release(struct list_head *head);
516
517/**
518 * __remove_profile - remove old profile, and children
519 * @profile: profile to be replaced (NOT NULL)
520 *
521 * Requires: namespace list lock be held, or list not be shared
522 */
523static void __remove_profile(struct aa_profile *profile)
524{
525 /* release any children lists first */
526 __profile_list_release(&profile->base.profiles);
527 /* released by free_profile */
528 profile->replacedby = aa_get_profile(profile->ns->unconfined);
529 __list_remove_profile(profile);
530}
531
532/**
533 * __profile_list_release - remove all profiles on the list and put refs
534 * @head: list of profiles (NOT NULL)
535 *
536 * Requires: namespace lock be held
537 */
538static void __profile_list_release(struct list_head *head)
539{
540 struct aa_profile *profile, *tmp;
541 list_for_each_entry_safe(profile, tmp, head, base.list)
542 __remove_profile(profile);
543}
544
545static void __ns_list_release(struct list_head *head);
546
547/**
548 * destroy_namespace - remove everything contained by @ns
549 * @ns: namespace to have it contents removed (NOT NULL)
550 */
551static void destroy_namespace(struct aa_namespace *ns)
552{
553 if (!ns)
554 return;
555
556 write_lock(&ns->lock);
557 /* release all profiles in this namespace */
558 __profile_list_release(&ns->base.profiles);
559
560 /* release all sub namespaces */
561 __ns_list_release(&ns->sub_ns);
562
563 write_unlock(&ns->lock);
564}
565
566/**
567 * __remove_namespace - remove a namespace and all its children
568 * @ns: namespace to be removed (NOT NULL)
569 *
570 * Requires: ns->parent->lock be held and ns removed from parent.
571 */
572static void __remove_namespace(struct aa_namespace *ns)
573{
574 struct aa_profile *unconfined = ns->unconfined;
575
576 /* remove ns from namespace list */
577 list_del_init(&ns->base.list);
578
579 /*
580 * break the ns, unconfined profile cyclic reference and forward
581 * all new unconfined profiles requests to the parent namespace
582 * This will result in all confined tasks that have a profile
583 * being removed, inheriting the parent->unconfined profile.
584 */
585 if (ns->parent)
586 ns->unconfined = aa_get_profile(ns->parent->unconfined);
587
588 destroy_namespace(ns);
589
590 /* release original ns->unconfined ref */
591 aa_put_profile(unconfined);
592 /* release ns->base.list ref, from removal above */
593 aa_put_namespace(ns);
594}
595
596/**
597 * __ns_list_release - remove all profile namespaces on the list put refs
598 * @head: list of profile namespaces (NOT NULL)
599 *
600 * Requires: namespace lock be held
601 */
602static void __ns_list_release(struct list_head *head)
603{
604 struct aa_namespace *ns, *tmp;
605 list_for_each_entry_safe(ns, tmp, head, base.list)
606 __remove_namespace(ns);
607
608}
609
610/**
611 * aa_alloc_root_ns - allocate the root profile namespace
612 *
613 * Returns: %0 on success else error
614 *
615 */
616int __init aa_alloc_root_ns(void)
617{
618 /* released by aa_free_root_ns - used as list ref*/
619 root_ns = alloc_namespace(NULL, "root");
620 if (!root_ns)
621 return -ENOMEM;
622
623 return 0;
624}
625
626 /**
627 * aa_free_root_ns - free the root profile namespace
628 */
629void __init aa_free_root_ns(void)
630 {
631 struct aa_namespace *ns = root_ns;
632 root_ns = NULL;
633
634 destroy_namespace(ns);
635 aa_put_namespace(ns);
636}
637
638/**
639 * aa_alloc_profile - allocate, initialize and return a new profile
640 * @hname: name of the profile (NOT NULL)
641 *
642 * Returns: refcount profile or NULL on failure
643 */
644struct aa_profile *aa_alloc_profile(const char *hname)
645{
646 struct aa_profile *profile;
647
648 /* freed by free_profile - usually through aa_put_profile */
649 profile = kzalloc(sizeof(*profile), GFP_KERNEL);
650 if (!profile)
651 return NULL;
652
653 if (!policy_init(&profile->base, NULL, hname)) {
654 kzfree(profile);
655 return NULL;
656 }
657
658 /* refcount released by caller */
659 return profile;
660}
661
662/**
663 * aa_new_null_profile - create a new null-X learning profile
664 * @parent: profile that caused this profile to be created (NOT NULL)
665 * @hat: true if the null- learning profile is a hat
666 *
667 * Create a null- complain mode profile used in learning mode. The name of
668 * the profile is unique and follows the format of parent//null-sid.
669 *
670 * null profiles are added to the profile list but the list does not
671 * hold a count on them so that they are automatically released when
672 * not in use.
673 *
674 * Returns: new refcounted profile else NULL on failure
675 */
676struct aa_profile *aa_new_null_profile(struct aa_profile *parent, int hat)
677{
678 struct aa_profile *profile = NULL;
679 char *name;
680 u32 sid = aa_alloc_sid();
681
682 /* freed below */
683 name = kmalloc(strlen(parent->base.hname) + 2 + 7 + 8, GFP_KERNEL);
684 if (!name)
685 goto fail;
686 sprintf(name, "%s//null-%x", parent->base.hname, sid);
687
688 profile = aa_alloc_profile(name);
689 kfree(name);
690 if (!profile)
691 goto fail;
692
693 profile->sid = sid;
694 profile->mode = APPARMOR_COMPLAIN;
695 profile->flags = PFLAG_NULL;
696 if (hat)
697 profile->flags |= PFLAG_HAT;
698
699 /* released on free_profile */
700 profile->parent = aa_get_profile(parent);
701 profile->ns = aa_get_namespace(parent->ns);
702
703 write_lock(&profile->ns->lock);
704 __list_add_profile(&parent->base.profiles, profile);
705 write_unlock(&profile->ns->lock);
706
707 /* refcount released by caller */
708 return profile;
709
710fail:
711 aa_free_sid(sid);
712 return NULL;
713}
714
715/**
716 * free_profile - free a profile
717 * @profile: the profile to free (MAYBE NULL)
718 *
719 * Free a profile, its hats and null_profile. All references to the profile,
720 * its hats and null_profile must have been put.
721 *
722 * If the profile was referenced from a task context, free_profile() will
723 * be called from an rcu callback routine, so we must not sleep here.
724 */
725static void free_profile(struct aa_profile *profile)
726{
727 AA_DEBUG("%s(%p)\n", __func__, profile);
728
729 if (!profile)
730 return;
731
732 if (!list_empty(&profile->base.list)) {
733 AA_ERROR("%s: internal error, "
734 "profile '%s' still on ns list\n",
735 __func__, profile->base.name);
736 BUG();
737 }
738
739 /* free children profiles */
740 policy_destroy(&profile->base);
741 aa_put_profile(profile->parent);
742
743 aa_put_namespace(profile->ns);
744 kzfree(profile->rename);
745
746 aa_free_file_rules(&profile->file);
747 aa_free_cap_rules(&profile->caps);
748 aa_free_rlimit_rules(&profile->rlimits);
749
750 aa_free_sid(profile->sid);
751 aa_put_dfa(profile->xmatch);
752
753 aa_put_profile(profile->replacedby);
754
755 kzfree(profile);
756}
757
758/**
759 * aa_free_profile_kref - free aa_profile by kref (called by aa_put_profile)
760 * @kr: kref callback for freeing of a profile (NOT NULL)
761 */
762void aa_free_profile_kref(struct kref *kref)
763{
764 struct aa_profile *p = container_of(kref, struct aa_profile,
765 base.count);
766
767 free_profile(p);
768}
769
770/* TODO: profile accounting - setup in remove */
771
772/**
773 * __find_child - find a profile on @head list with a name matching @name
774 * @head: list to search (NOT NULL)
775 * @name: name of profile (NOT NULL)
776 *
777 * Requires: ns lock protecting list be held
778 *
779 * Returns: unrefcounted profile ptr, or NULL if not found
780 */
781static struct aa_profile *__find_child(struct list_head *head, const char *name)
782{
783 return (struct aa_profile *)__policy_find(head, name);
784}
785
786/**
787 * __strn_find_child - find a profile on @head list using substring of @name
788 * @head: list to search (NOT NULL)
789 * @name: name of profile (NOT NULL)
790 * @len: length of @name substring to match
791 *
792 * Requires: ns lock protecting list be held
793 *
794 * Returns: unrefcounted profile ptr, or NULL if not found
795 */
796static struct aa_profile *__strn_find_child(struct list_head *head,
797 const char *name, int len)
798{
799 return (struct aa_profile *)__policy_strn_find(head, name, len);
800}
801
802/**
803 * aa_find_child - find a profile by @name in @parent
804 * @parent: profile to search (NOT NULL)
805 * @name: profile name to search for (NOT NULL)
806 *
807 * Returns: a refcounted profile or NULL if not found
808 */
809struct aa_profile *aa_find_child(struct aa_profile *parent, const char *name)
810{
811 struct aa_profile *profile;
812
813 read_lock(&parent->ns->lock);
814 profile = aa_get_profile(__find_child(&parent->base.profiles, name));
815 read_unlock(&parent->ns->lock);
816
817 /* refcount released by caller */
818 return profile;
819}
820
821/**
822 * __lookup_parent - lookup the parent of a profile of name @hname
823 * @ns: namespace to lookup profile in (NOT NULL)
824 * @hname: hierarchical profile name to find parent of (NOT NULL)
825 *
826 * Lookups up the parent of a fully qualified profile name, the profile
827 * that matches hname does not need to exist, in general this
828 * is used to load a new profile.
829 *
830 * Requires: ns->lock be held
831 *
832 * Returns: unrefcounted policy or NULL if not found
833 */
834static struct aa_policy *__lookup_parent(struct aa_namespace *ns,
835 const char *hname)
836{
837 struct aa_policy *policy;
838 struct aa_profile *profile = NULL;
839 char *split;
840
841 policy = &ns->base;
842
843 for (split = strstr(hname, "//"); split;) {
844 profile = __strn_find_child(&policy->profiles, hname,
845 split - hname);
846 if (!profile)
847 return NULL;
848 policy = &profile->base;
849 hname = split + 2;
850 split = strstr(hname, "//");
851 }
852 if (!profile)
853 return &ns->base;
854 return &profile->base;
855}
856
857/**
858 * __lookup_profile - lookup the profile matching @hname
859 * @base: base list to start looking up profile name from (NOT NULL)
860 * @hname: hierarchical profile name (NOT NULL)
861 *
862 * Requires: ns->lock be held
863 *
864 * Returns: unrefcounted profile pointer or NULL if not found
865 *
866 * Do a relative name lookup, recursing through profile tree.
867 */
868static struct aa_profile *__lookup_profile(struct aa_policy *base,
869 const char *hname)
870{
871 struct aa_profile *profile = NULL;
872 char *split;
873
874 for (split = strstr(hname, "//"); split;) {
875 profile = __strn_find_child(&base->profiles, hname,
876 split - hname);
877 if (!profile)
878 return NULL;
879
880 base = &profile->base;
881 hname = split + 2;
882 split = strstr(hname, "//");
883 }
884
885 profile = __find_child(&base->profiles, hname);
886
887 return profile;
888}
889
890/**
891 * aa_lookup_profile - find a profile by its full or partial name
892 * @ns: the namespace to start from (NOT NULL)
893 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
894 *
895 * Returns: refcounted profile or NULL if not found
896 */
897struct aa_profile *aa_lookup_profile(struct aa_namespace *ns, const char *hname)
898{
899 struct aa_profile *profile;
900
901 read_lock(&ns->lock);
902 profile = aa_get_profile(__lookup_profile(&ns->base, hname));
903 read_unlock(&ns->lock);
904
905 /* refcount released by caller */
906 return profile;
907}
908
909/**
910 * replacement_allowed - test to see if replacement is allowed
911 * @profile: profile to test if it can be replaced (MAYBE NULL)
912 * @noreplace: true if replacement shouldn't be allowed but addition is okay
913 * @info: Returns - info about why replacement failed (NOT NULL)
914 *
915 * Returns: %0 if replacement allowed else error code
916 */
917static int replacement_allowed(struct aa_profile *profile, int noreplace,
918 const char **info)
919{
920 if (profile) {
921 if (profile->flags & PFLAG_IMMUTABLE) {
922 *info = "cannot replace immutible profile";
923 return -EPERM;
924 } else if (noreplace) {
925 *info = "profile already exists";
926 return -EEXIST;
927 }
928 }
929 return 0;
930}
931
932/**
933 * __add_new_profile - simple wrapper around __list_add_profile
934 * @ns: namespace that profile is being added to (NOT NULL)
935 * @policy: the policy container to add the profile to (NOT NULL)
936 * @profile: profile to add (NOT NULL)
937 *
938 * add a profile to a list and do other required basic allocations
939 */
940static void __add_new_profile(struct aa_namespace *ns, struct aa_policy *policy,
941 struct aa_profile *profile)
942{
943 if (policy != &ns->base)
944 /* released on profile replacement or free_profile */
945 profile->parent = aa_get_profile((struct aa_profile *) policy);
946 __list_add_profile(&policy->profiles, profile);
947 /* released on free_profile */
948 profile->sid = aa_alloc_sid();
949 profile->ns = aa_get_namespace(ns);
950}
951
952/**
953 * aa_audit_policy - Do auditing of policy changes
954 * @op: policy operation being performed
955 * @gfp: memory allocation flags
956 * @name: name of profile being manipulated (NOT NULL)
957 * @info: any extra information to be audited (MAYBE NULL)
958 * @error: error code
959 *
960 * Returns: the error to be returned after audit is done
961 */
962static int audit_policy(int op, gfp_t gfp, const char *name, const char *info,
963 int error)
964{
965 struct common_audit_data sa;
966 COMMON_AUDIT_DATA_INIT(&sa, NONE);
967 sa.aad.op = op;
968 sa.aad.name = name;
969 sa.aad.info = info;
970 sa.aad.error = error;
971
972 return aa_audit(AUDIT_APPARMOR_STATUS, __aa_current_profile(), gfp,
973 &sa, NULL);
974}
975
976/**
977 * aa_may_manage_policy - can the current task manage policy
978 * @op: the policy manipulation operation being done
979 *
980 * Returns: true if the task is allowed to manipulate policy
981 */
982bool aa_may_manage_policy(int op)
983{
984 /* check if loading policy is locked out */
985 if (aa_g_lock_policy) {
986 audit_policy(op, GFP_KERNEL, NULL, "policy_locked", -EACCES);
987 return 0;
988 }
989
990 if (!capable(CAP_MAC_ADMIN)) {
991 audit_policy(op, GFP_KERNEL, NULL, "not policy admin", -EACCES);
992 return 0;
993 }
994
995 return 1;
996}
997
998/**
999 * aa_replace_profiles - replace profile(s) on the profile list
1000 * @udata: serialized data stream (NOT NULL)
1001 * @size: size of the serialized data stream
1002 * @noreplace: true if only doing addition, no replacement allowed
1003 *
1004 * unpack and replace a profile on the profile list and uses of that profile
1005 * by any aa_task_cxt. If the profile does not exist on the profile list
1006 * it is added.
1007 *
1008 * Returns: size of data consumed else error code on failure.
1009 */
1010ssize_t aa_replace_profiles(void *udata, size_t size, bool noreplace)
1011{
1012 struct aa_policy *policy;
1013 struct aa_profile *old_profile = NULL, *new_profile = NULL;
1014 struct aa_profile *rename_profile = NULL;
1015 struct aa_namespace *ns = NULL;
1016 const char *ns_name, *name = NULL, *info = NULL;
1017 int op = OP_PROF_REPL;
1018 ssize_t error;
1019
1020 /* released below */
1021 new_profile = aa_unpack(udata, size, &ns_name);
1022 if (IS_ERR(new_profile)) {
1023 error = PTR_ERR(new_profile);
1024 new_profile = NULL;
1025 goto fail;
1026 }
1027
1028 /* released below */
1029 ns = aa_prepare_namespace(ns_name);
1030 if (!ns) {
1031 info = "failed to prepare namespace";
1032 error = -ENOMEM;
1033 name = ns_name;
1034 goto fail;
1035 }
1036
1037 name = new_profile->base.hname;
1038
1039 write_lock(&ns->lock);
1040 /* no ref on policy only use inside lock */
1041 policy = __lookup_parent(ns, new_profile->base.hname);
1042
1043 if (!policy) {
1044 info = "parent does not exist";
1045 error = -ENOENT;
1046 goto audit;
1047 }
1048
1049 old_profile = __find_child(&policy->profiles, new_profile->base.name);
1050 /* released below */
1051 aa_get_profile(old_profile);
1052
1053 if (new_profile->rename) {
1054 rename_profile = __lookup_profile(&ns->base,
1055 new_profile->rename);
1056 /* released below */
1057 aa_get_profile(rename_profile);
1058
1059 if (!rename_profile) {
1060 info = "profile to rename does not exist";
1061 name = new_profile->rename;
1062 error = -ENOENT;
1063 goto audit;
1064 }
1065 }
1066
1067 error = replacement_allowed(old_profile, noreplace, &info);
1068 if (error)
1069 goto audit;
1070
1071 error = replacement_allowed(rename_profile, noreplace, &info);
1072 if (error)
1073 goto audit;
1074
1075audit:
1076 if (!old_profile && !rename_profile)
1077 op = OP_PROF_LOAD;
1078
1079 error = audit_policy(op, GFP_ATOMIC, name, info, error);
1080
1081 if (!error) {
1082 if (rename_profile)
1083 __replace_profile(rename_profile, new_profile);
1084 if (old_profile) {
1085 /* when there are both rename and old profiles
1086 * inherit old profiles sid
1087 */
1088 if (rename_profile)
1089 aa_free_sid(new_profile->sid);
1090 __replace_profile(old_profile, new_profile);
1091 }
1092 if (!(old_profile || rename_profile))
1093 __add_new_profile(ns, policy, new_profile);
1094 }
1095 write_unlock(&ns->lock);
1096
1097out:
1098 aa_put_namespace(ns);
1099 aa_put_profile(rename_profile);
1100 aa_put_profile(old_profile);
1101 aa_put_profile(new_profile);
1102 if (error)
1103 return error;
1104 return size;
1105
1106fail:
1107 error = audit_policy(op, GFP_KERNEL, name, info, error);
1108 goto out;
1109}
1110
1111/**
1112 * aa_remove_profiles - remove profile(s) from the system
1113 * @fqname: name of the profile or namespace to remove (NOT NULL)
1114 * @size: size of the name
1115 *
1116 * Remove a profile or sub namespace from the current namespace, so that
1117 * they can not be found anymore and mark them as replaced by unconfined
1118 *
1119 * NOTE: removing confinement does not restore rlimits to preconfinemnet values
1120 *
1121 * Returns: size of data consume else error code if fails
1122 */
1123ssize_t aa_remove_profiles(char *fqname, size_t size)
1124{
1125 struct aa_namespace *root, *ns = NULL;
1126 struct aa_profile *profile = NULL;
1127 const char *name = fqname, *info = NULL;
1128 ssize_t error = 0;
1129
1130 if (*fqname == 0) {
1131 info = "no profile specified";
1132 error = -ENOENT;
1133 goto fail;
1134 }
1135
1136 root = aa_current_profile()->ns;
1137
1138 if (fqname[0] == ':') {
1139 char *ns_name;
1140 name = aa_split_fqname(fqname, &ns_name);
1141 if (ns_name) {
1142 /* released below */
1143 ns = aa_find_namespace(root, ns_name);
1144 if (!ns) {
1145 info = "namespace does not exist";
1146 error = -ENOENT;
1147 goto fail;
1148 }
1149 }
1150 } else
1151 /* released below */
1152 ns = aa_get_namespace(root);
1153
1154 if (!name) {
1155 /* remove namespace - can only happen if fqname[0] == ':' */
1156 write_lock(&ns->parent->lock);
1157 __remove_namespace(ns);
1158 write_unlock(&ns->parent->lock);
1159 } else {
1160 /* remove profile */
1161 write_lock(&ns->lock);
1162 profile = aa_get_profile(__lookup_profile(&ns->base, name));
1163 if (!profile) {
1164 error = -ENOENT;
1165 info = "profile does not exist";
1166 goto fail_ns_lock;
1167 }
1168 name = profile->base.hname;
1169 __remove_profile(profile);
1170 write_unlock(&ns->lock);
1171 }
1172
1173 /* don't fail removal if audit fails */
1174 (void) audit_policy(OP_PROF_RM, GFP_KERNEL, name, info, error);
1175 aa_put_namespace(ns);
1176 aa_put_profile(profile);
1177 return size;
1178
1179fail_ns_lock:
1180 write_unlock(&ns->lock);
1181 aa_put_namespace(ns);
1182
1183fail:
1184 (void) audit_policy(OP_PROF_RM, GFP_KERNEL, name, info, error);
1185 return error;
1186}
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * AppArmor security module
4 *
5 * This file contains AppArmor policy manipulation functions
6 *
7 * Copyright (C) 1998-2008 Novell/SUSE
8 * Copyright 2009-2010 Canonical Ltd.
9 *
10 * AppArmor policy is based around profiles, which contain the rules a
11 * task is confined by. Every task in the system has a profile attached
12 * to it determined either by matching "unconfined" tasks against the
13 * visible set of profiles or by following a profiles attachment rules.
14 *
15 * Each profile exists in a profile namespace which is a container of
16 * visible profiles. Each namespace contains a special "unconfined" profile,
17 * which doesn't enforce any confinement on a task beyond DAC.
18 *
19 * Namespace and profile names can be written together in either
20 * of two syntaxes.
21 * :namespace:profile - used by kernel interfaces for easy detection
22 * namespace://profile - used by policy
23 *
24 * Profile names can not start with : or @ or ^ and may not contain \0
25 *
26 * Reserved profile names
27 * unconfined - special automatically generated unconfined profile
28 * inherit - special name to indicate profile inheritance
29 * null-XXXX-YYYY - special automatically generated learning profiles
30 *
31 * Namespace names may not start with / or @ and may not contain \0 or :
32 * Reserved namespace names
33 * user-XXXX - user defined profiles
34 *
35 * a // in a profile or namespace name indicates a hierarchical name with the
36 * name before the // being the parent and the name after the child.
37 *
38 * Profile and namespace hierarchies serve two different but similar purposes.
39 * The namespace contains the set of visible profiles that are considered
40 * for attachment. The hierarchy of namespaces allows for virtualizing
41 * the namespace so that for example a chroot can have its own set of profiles
42 * which may define some local user namespaces.
43 * The profile hierarchy severs two distinct purposes,
44 * - it allows for sub profiles or hats, which allows an application to run
45 * subprograms under its own profile with different restriction than it
46 * self, and not have it use the system profile.
47 * eg. if a mail program starts an editor, the policy might make the
48 * restrictions tighter on the editor tighter than the mail program,
49 * and definitely different than general editor restrictions
50 * - it allows for binary hierarchy of profiles, so that execution history
51 * is preserved. This feature isn't exploited by AppArmor reference policy
52 * but is allowed. NOTE: this is currently suboptimal because profile
53 * aliasing is not currently implemented so that a profile for each
54 * level must be defined.
55 * eg. /bin/bash///bin/ls as a name would indicate /bin/ls was started
56 * from /bin/bash
57 *
58 * A profile or namespace name that can contain one or more // separators
59 * is referred to as an hname (hierarchical).
60 * eg. /bin/bash//bin/ls
61 *
62 * An fqname is a name that may contain both namespace and profile hnames.
63 * eg. :ns:/bin/bash//bin/ls
64 *
65 * NOTES:
66 * - locking of profile lists is currently fairly coarse. All profile
67 * lists within a namespace use the namespace lock.
68 * FIXME: move profile lists to using rcu_lists
69 */
70
71#include <linux/slab.h>
72#include <linux/spinlock.h>
73#include <linux/string.h>
74#include <linux/cred.h>
75#include <linux/rculist.h>
76#include <linux/user_namespace.h>
77
78#include "include/apparmor.h"
79#include "include/capability.h"
80#include "include/cred.h"
81#include "include/file.h"
82#include "include/ipc.h"
83#include "include/match.h"
84#include "include/path.h"
85#include "include/policy.h"
86#include "include/policy_ns.h"
87#include "include/policy_unpack.h"
88#include "include/resource.h"
89
90int unprivileged_userns_apparmor_policy = 1;
91
92const char *const aa_profile_mode_names[] = {
93 "enforce",
94 "complain",
95 "kill",
96 "unconfined",
97};
98
99
100/**
101 * __add_profile - add a profiles to list and label tree
102 * @list: list to add it to (NOT NULL)
103 * @profile: the profile to add (NOT NULL)
104 *
105 * refcount @profile, should be put by __list_remove_profile
106 *
107 * Requires: namespace lock be held, or list not be shared
108 */
109static void __add_profile(struct list_head *list, struct aa_profile *profile)
110{
111 struct aa_label *l;
112
113 AA_BUG(!list);
114 AA_BUG(!profile);
115 AA_BUG(!profile->ns);
116 AA_BUG(!mutex_is_locked(&profile->ns->lock));
117
118 list_add_rcu(&profile->base.list, list);
119 /* get list reference */
120 aa_get_profile(profile);
121 l = aa_label_insert(&profile->ns->labels, &profile->label);
122 AA_BUG(l != &profile->label);
123 aa_put_label(l);
124}
125
126/**
127 * __list_remove_profile - remove a profile from the list it is on
128 * @profile: the profile to remove (NOT NULL)
129 *
130 * remove a profile from the list, warning generally removal should
131 * be done with __replace_profile as most profile removals are
132 * replacements to the unconfined profile.
133 *
134 * put @profile list refcount
135 *
136 * Requires: namespace lock be held, or list not have been live
137 */
138static void __list_remove_profile(struct aa_profile *profile)
139{
140 AA_BUG(!profile);
141 AA_BUG(!profile->ns);
142 AA_BUG(!mutex_is_locked(&profile->ns->lock));
143
144 list_del_rcu(&profile->base.list);
145 aa_put_profile(profile);
146}
147
148/**
149 * __remove_profile - remove old profile, and children
150 * @profile: profile to be replaced (NOT NULL)
151 *
152 * Requires: namespace list lock be held, or list not be shared
153 */
154static void __remove_profile(struct aa_profile *profile)
155{
156 AA_BUG(!profile);
157 AA_BUG(!profile->ns);
158 AA_BUG(!mutex_is_locked(&profile->ns->lock));
159
160 /* release any children lists first */
161 __aa_profile_list_release(&profile->base.profiles);
162 /* released by free_profile */
163 aa_label_remove(&profile->label);
164 __aafs_profile_rmdir(profile);
165 __list_remove_profile(profile);
166}
167
168/**
169 * __aa_profile_list_release - remove all profiles on the list and put refs
170 * @head: list of profiles (NOT NULL)
171 *
172 * Requires: namespace lock be held
173 */
174void __aa_profile_list_release(struct list_head *head)
175{
176 struct aa_profile *profile, *tmp;
177 list_for_each_entry_safe(profile, tmp, head, base.list)
178 __remove_profile(profile);
179}
180
181/**
182 * aa_free_data - free a data blob
183 * @ptr: data to free
184 * @arg: unused
185 */
186static void aa_free_data(void *ptr, void *arg)
187{
188 struct aa_data *data = ptr;
189
190 kfree_sensitive(data->data);
191 kfree_sensitive(data->key);
192 kfree_sensitive(data);
193}
194
195/**
196 * aa_free_profile - free a profile
197 * @profile: the profile to free (MAYBE NULL)
198 *
199 * Free a profile, its hats and null_profile. All references to the profile,
200 * its hats and null_profile must have been put.
201 *
202 * If the profile was referenced from a task context, free_profile() will
203 * be called from an rcu callback routine, so we must not sleep here.
204 */
205void aa_free_profile(struct aa_profile *profile)
206{
207 struct rhashtable *rht;
208 int i;
209
210 AA_DEBUG("%s(%p)\n", __func__, profile);
211
212 if (!profile)
213 return;
214
215 /* free children profiles */
216 aa_policy_destroy(&profile->base);
217 aa_put_profile(rcu_access_pointer(profile->parent));
218
219 aa_put_ns(profile->ns);
220 kfree_sensitive(profile->rename);
221
222 aa_free_file_rules(&profile->file);
223 aa_free_cap_rules(&profile->caps);
224 aa_free_rlimit_rules(&profile->rlimits);
225
226 for (i = 0; i < profile->xattr_count; i++)
227 kfree_sensitive(profile->xattrs[i]);
228 kfree_sensitive(profile->xattrs);
229 for (i = 0; i < profile->secmark_count; i++)
230 kfree_sensitive(profile->secmark[i].label);
231 kfree_sensitive(profile->secmark);
232 kfree_sensitive(profile->dirname);
233 aa_put_dfa(profile->xmatch);
234 aa_put_dfa(profile->policy.dfa);
235
236 if (profile->data) {
237 rht = profile->data;
238 profile->data = NULL;
239 rhashtable_free_and_destroy(rht, aa_free_data, NULL);
240 kfree_sensitive(rht);
241 }
242
243 kfree_sensitive(profile->hash);
244 aa_put_loaddata(profile->rawdata);
245 aa_label_destroy(&profile->label);
246
247 kfree_sensitive(profile);
248}
249
250/**
251 * aa_alloc_profile - allocate, initialize and return a new profile
252 * @hname: name of the profile (NOT NULL)
253 * @gfp: allocation type
254 *
255 * Returns: refcount profile or NULL on failure
256 */
257struct aa_profile *aa_alloc_profile(const char *hname, struct aa_proxy *proxy,
258 gfp_t gfp)
259{
260 struct aa_profile *profile;
261
262 /* freed by free_profile - usually through aa_put_profile */
263 profile = kzalloc(sizeof(*profile) + sizeof(struct aa_profile *) * 2,
264 gfp);
265 if (!profile)
266 return NULL;
267
268 if (!aa_policy_init(&profile->base, NULL, hname, gfp))
269 goto fail;
270 if (!aa_label_init(&profile->label, 1, gfp))
271 goto fail;
272
273 /* update being set needed by fs interface */
274 if (!proxy) {
275 proxy = aa_alloc_proxy(&profile->label, gfp);
276 if (!proxy)
277 goto fail;
278 } else
279 aa_get_proxy(proxy);
280 profile->label.proxy = proxy;
281
282 profile->label.hname = profile->base.hname;
283 profile->label.flags |= FLAG_PROFILE;
284 profile->label.vec[0] = profile;
285
286 /* refcount released by caller */
287 return profile;
288
289fail:
290 aa_free_profile(profile);
291
292 return NULL;
293}
294
295/* TODO: profile accounting - setup in remove */
296
297/**
298 * __strn_find_child - find a profile on @head list using substring of @name
299 * @head: list to search (NOT NULL)
300 * @name: name of profile (NOT NULL)
301 * @len: length of @name substring to match
302 *
303 * Requires: rcu_read_lock be held
304 *
305 * Returns: unrefcounted profile ptr, or NULL if not found
306 */
307static struct aa_profile *__strn_find_child(struct list_head *head,
308 const char *name, int len)
309{
310 return (struct aa_profile *)__policy_strn_find(head, name, len);
311}
312
313/**
314 * __find_child - find a profile on @head list with a name matching @name
315 * @head: list to search (NOT NULL)
316 * @name: name of profile (NOT NULL)
317 *
318 * Requires: rcu_read_lock be held
319 *
320 * Returns: unrefcounted profile ptr, or NULL if not found
321 */
322static struct aa_profile *__find_child(struct list_head *head, const char *name)
323{
324 return __strn_find_child(head, name, strlen(name));
325}
326
327/**
328 * aa_find_child - find a profile by @name in @parent
329 * @parent: profile to search (NOT NULL)
330 * @name: profile name to search for (NOT NULL)
331 *
332 * Returns: a refcounted profile or NULL if not found
333 */
334struct aa_profile *aa_find_child(struct aa_profile *parent, const char *name)
335{
336 struct aa_profile *profile;
337
338 rcu_read_lock();
339 do {
340 profile = __find_child(&parent->base.profiles, name);
341 } while (profile && !aa_get_profile_not0(profile));
342 rcu_read_unlock();
343
344 /* refcount released by caller */
345 return profile;
346}
347
348/**
349 * __lookup_parent - lookup the parent of a profile of name @hname
350 * @ns: namespace to lookup profile in (NOT NULL)
351 * @hname: hierarchical profile name to find parent of (NOT NULL)
352 *
353 * Lookups up the parent of a fully qualified profile name, the profile
354 * that matches hname does not need to exist, in general this
355 * is used to load a new profile.
356 *
357 * Requires: rcu_read_lock be held
358 *
359 * Returns: unrefcounted policy or NULL if not found
360 */
361static struct aa_policy *__lookup_parent(struct aa_ns *ns,
362 const char *hname)
363{
364 struct aa_policy *policy;
365 struct aa_profile *profile = NULL;
366 char *split;
367
368 policy = &ns->base;
369
370 for (split = strstr(hname, "//"); split;) {
371 profile = __strn_find_child(&policy->profiles, hname,
372 split - hname);
373 if (!profile)
374 return NULL;
375 policy = &profile->base;
376 hname = split + 2;
377 split = strstr(hname, "//");
378 }
379 if (!profile)
380 return &ns->base;
381 return &profile->base;
382}
383
384/**
385 * __lookupn_profile - lookup the profile matching @hname
386 * @base: base list to start looking up profile name from (NOT NULL)
387 * @hname: hierarchical profile name (NOT NULL)
388 * @n: length of @hname
389 *
390 * Requires: rcu_read_lock be held
391 *
392 * Returns: unrefcounted profile pointer or NULL if not found
393 *
394 * Do a relative name lookup, recursing through profile tree.
395 */
396static struct aa_profile *__lookupn_profile(struct aa_policy *base,
397 const char *hname, size_t n)
398{
399 struct aa_profile *profile = NULL;
400 const char *split;
401
402 for (split = strnstr(hname, "//", n); split;
403 split = strnstr(hname, "//", n)) {
404 profile = __strn_find_child(&base->profiles, hname,
405 split - hname);
406 if (!profile)
407 return NULL;
408
409 base = &profile->base;
410 n -= split + 2 - hname;
411 hname = split + 2;
412 }
413
414 if (n)
415 return __strn_find_child(&base->profiles, hname, n);
416 return NULL;
417}
418
419static struct aa_profile *__lookup_profile(struct aa_policy *base,
420 const char *hname)
421{
422 return __lookupn_profile(base, hname, strlen(hname));
423}
424
425/**
426 * aa_lookup_profile - find a profile by its full or partial name
427 * @ns: the namespace to start from (NOT NULL)
428 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
429 * @n: size of @hname
430 *
431 * Returns: refcounted profile or NULL if not found
432 */
433struct aa_profile *aa_lookupn_profile(struct aa_ns *ns, const char *hname,
434 size_t n)
435{
436 struct aa_profile *profile;
437
438 rcu_read_lock();
439 do {
440 profile = __lookupn_profile(&ns->base, hname, n);
441 } while (profile && !aa_get_profile_not0(profile));
442 rcu_read_unlock();
443
444 /* the unconfined profile is not in the regular profile list */
445 if (!profile && strncmp(hname, "unconfined", n) == 0)
446 profile = aa_get_newest_profile(ns->unconfined);
447
448 /* refcount released by caller */
449 return profile;
450}
451
452struct aa_profile *aa_lookup_profile(struct aa_ns *ns, const char *hname)
453{
454 return aa_lookupn_profile(ns, hname, strlen(hname));
455}
456
457struct aa_profile *aa_fqlookupn_profile(struct aa_label *base,
458 const char *fqname, size_t n)
459{
460 struct aa_profile *profile;
461 struct aa_ns *ns;
462 const char *name, *ns_name;
463 size_t ns_len;
464
465 name = aa_splitn_fqname(fqname, n, &ns_name, &ns_len);
466 if (ns_name) {
467 ns = aa_lookupn_ns(labels_ns(base), ns_name, ns_len);
468 if (!ns)
469 return NULL;
470 } else
471 ns = aa_get_ns(labels_ns(base));
472
473 if (name)
474 profile = aa_lookupn_profile(ns, name, n - (name - fqname));
475 else if (ns)
476 /* default profile for ns, currently unconfined */
477 profile = aa_get_newest_profile(ns->unconfined);
478 else
479 profile = NULL;
480 aa_put_ns(ns);
481
482 return profile;
483}
484
485/**
486 * aa_new_null_profile - create or find a null-X learning profile
487 * @parent: profile that caused this profile to be created (NOT NULL)
488 * @hat: true if the null- learning profile is a hat
489 * @base: name to base the null profile off of
490 * @gfp: type of allocation
491 *
492 * Find/Create a null- complain mode profile used in learning mode. The
493 * name of the profile is unique and follows the format of parent//null-XXX.
494 * where XXX is based on the @name or if that fails or is not supplied
495 * a unique number
496 *
497 * null profiles are added to the profile list but the list does not
498 * hold a count on them so that they are automatically released when
499 * not in use.
500 *
501 * Returns: new refcounted profile else NULL on failure
502 */
503struct aa_profile *aa_new_null_profile(struct aa_profile *parent, bool hat,
504 const char *base, gfp_t gfp)
505{
506 struct aa_profile *p, *profile;
507 const char *bname;
508 char *name = NULL;
509
510 AA_BUG(!parent);
511
512 if (base) {
513 name = kmalloc(strlen(parent->base.hname) + 8 + strlen(base),
514 gfp);
515 if (name) {
516 sprintf(name, "%s//null-%s", parent->base.hname, base);
517 goto name;
518 }
519 /* fall through to try shorter uniq */
520 }
521
522 name = kmalloc(strlen(parent->base.hname) + 2 + 7 + 8, gfp);
523 if (!name)
524 return NULL;
525 sprintf(name, "%s//null-%x", parent->base.hname,
526 atomic_inc_return(&parent->ns->uniq_null));
527
528name:
529 /* lookup to see if this is a dup creation */
530 bname = basename(name);
531 profile = aa_find_child(parent, bname);
532 if (profile)
533 goto out;
534
535 profile = aa_alloc_profile(name, NULL, gfp);
536 if (!profile)
537 goto fail;
538
539 profile->mode = APPARMOR_COMPLAIN;
540 profile->label.flags |= FLAG_NULL;
541 if (hat)
542 profile->label.flags |= FLAG_HAT;
543 profile->path_flags = parent->path_flags;
544
545 /* released on free_profile */
546 rcu_assign_pointer(profile->parent, aa_get_profile(parent));
547 profile->ns = aa_get_ns(parent->ns);
548 profile->file.dfa = aa_get_dfa(nulldfa);
549 profile->policy.dfa = aa_get_dfa(nulldfa);
550
551 mutex_lock_nested(&profile->ns->lock, profile->ns->level);
552 p = __find_child(&parent->base.profiles, bname);
553 if (p) {
554 aa_free_profile(profile);
555 profile = aa_get_profile(p);
556 } else {
557 __add_profile(&parent->base.profiles, profile);
558 }
559 mutex_unlock(&profile->ns->lock);
560
561 /* refcount released by caller */
562out:
563 kfree(name);
564
565 return profile;
566
567fail:
568 kfree(name);
569 aa_free_profile(profile);
570 return NULL;
571}
572
573/**
574 * replacement_allowed - test to see if replacement is allowed
575 * @profile: profile to test if it can be replaced (MAYBE NULL)
576 * @noreplace: true if replacement shouldn't be allowed but addition is okay
577 * @info: Returns - info about why replacement failed (NOT NULL)
578 *
579 * Returns: %0 if replacement allowed else error code
580 */
581static int replacement_allowed(struct aa_profile *profile, int noreplace,
582 const char **info)
583{
584 if (profile) {
585 if (profile->label.flags & FLAG_IMMUTIBLE) {
586 *info = "cannot replace immutable profile";
587 return -EPERM;
588 } else if (noreplace) {
589 *info = "profile already exists";
590 return -EEXIST;
591 }
592 }
593 return 0;
594}
595
596/* audit callback for net specific fields */
597static void audit_cb(struct audit_buffer *ab, void *va)
598{
599 struct common_audit_data *sa = va;
600
601 if (aad(sa)->iface.ns) {
602 audit_log_format(ab, " ns=");
603 audit_log_untrustedstring(ab, aad(sa)->iface.ns);
604 }
605}
606
607/**
608 * audit_policy - Do auditing of policy changes
609 * @label: label to check if it can manage policy
610 * @op: policy operation being performed
611 * @ns_name: name of namespace being manipulated
612 * @name: name of profile being manipulated (NOT NULL)
613 * @info: any extra information to be audited (MAYBE NULL)
614 * @error: error code
615 *
616 * Returns: the error to be returned after audit is done
617 */
618static int audit_policy(struct aa_label *label, const char *op,
619 const char *ns_name, const char *name,
620 const char *info, int error)
621{
622 DEFINE_AUDIT_DATA(sa, LSM_AUDIT_DATA_NONE, op);
623
624 aad(&sa)->iface.ns = ns_name;
625 aad(&sa)->name = name;
626 aad(&sa)->info = info;
627 aad(&sa)->error = error;
628 aad(&sa)->label = label;
629
630 aa_audit_msg(AUDIT_APPARMOR_STATUS, &sa, audit_cb);
631
632 return error;
633}
634
635/**
636 * policy_view_capable - check if viewing policy in at @ns is allowed
637 * ns: namespace being viewed by current task (may be NULL)
638 * Returns: true if viewing policy is allowed
639 *
640 * If @ns is NULL then the namespace being viewed is assumed to be the
641 * tasks current namespace.
642 */
643bool policy_view_capable(struct aa_ns *ns)
644{
645 struct user_namespace *user_ns = current_user_ns();
646 struct aa_ns *view_ns = aa_get_current_ns();
647 bool root_in_user_ns = uid_eq(current_euid(), make_kuid(user_ns, 0)) ||
648 in_egroup_p(make_kgid(user_ns, 0));
649 bool response = false;
650 if (!ns)
651 ns = view_ns;
652
653 if (root_in_user_ns && aa_ns_visible(view_ns, ns, true) &&
654 (user_ns == &init_user_ns ||
655 (unprivileged_userns_apparmor_policy != 0 &&
656 user_ns->level == view_ns->level)))
657 response = true;
658 aa_put_ns(view_ns);
659
660 return response;
661}
662
663bool policy_admin_capable(struct aa_ns *ns)
664{
665 struct user_namespace *user_ns = current_user_ns();
666 bool capable = ns_capable(user_ns, CAP_MAC_ADMIN);
667
668 AA_DEBUG("cap_mac_admin? %d\n", capable);
669 AA_DEBUG("policy locked? %d\n", aa_g_lock_policy);
670
671 return policy_view_capable(ns) && capable && !aa_g_lock_policy;
672}
673
674/**
675 * aa_may_manage_policy - can the current task manage policy
676 * @label: label to check if it can manage policy
677 * @op: the policy manipulation operation being done
678 *
679 * Returns: 0 if the task is allowed to manipulate policy else error
680 */
681int aa_may_manage_policy(struct aa_label *label, struct aa_ns *ns, u32 mask)
682{
683 const char *op;
684
685 if (mask & AA_MAY_REMOVE_POLICY)
686 op = OP_PROF_RM;
687 else if (mask & AA_MAY_REPLACE_POLICY)
688 op = OP_PROF_REPL;
689 else
690 op = OP_PROF_LOAD;
691
692 /* check if loading policy is locked out */
693 if (aa_g_lock_policy)
694 return audit_policy(label, op, NULL, NULL, "policy_locked",
695 -EACCES);
696
697 if (!policy_admin_capable(ns))
698 return audit_policy(label, op, NULL, NULL, "not policy admin",
699 -EACCES);
700
701 /* TODO: add fine grained mediation of policy loads */
702 return 0;
703}
704
705static struct aa_profile *__list_lookup_parent(struct list_head *lh,
706 struct aa_profile *profile)
707{
708 const char *base = basename(profile->base.hname);
709 long len = base - profile->base.hname;
710 struct aa_load_ent *ent;
711
712 /* parent won't have trailing // so remove from len */
713 if (len <= 2)
714 return NULL;
715 len -= 2;
716
717 list_for_each_entry(ent, lh, list) {
718 if (ent->new == profile)
719 continue;
720 if (strncmp(ent->new->base.hname, profile->base.hname, len) ==
721 0 && ent->new->base.hname[len] == 0)
722 return ent->new;
723 }
724
725 return NULL;
726}
727
728/**
729 * __replace_profile - replace @old with @new on a list
730 * @old: profile to be replaced (NOT NULL)
731 * @new: profile to replace @old with (NOT NULL)
732 * @share_proxy: transfer @old->proxy to @new
733 *
734 * Will duplicate and refcount elements that @new inherits from @old
735 * and will inherit @old children.
736 *
737 * refcount @new for list, put @old list refcount
738 *
739 * Requires: namespace list lock be held, or list not be shared
740 */
741static void __replace_profile(struct aa_profile *old, struct aa_profile *new)
742{
743 struct aa_profile *child, *tmp;
744
745 if (!list_empty(&old->base.profiles)) {
746 LIST_HEAD(lh);
747 list_splice_init_rcu(&old->base.profiles, &lh, synchronize_rcu);
748
749 list_for_each_entry_safe(child, tmp, &lh, base.list) {
750 struct aa_profile *p;
751
752 list_del_init(&child->base.list);
753 p = __find_child(&new->base.profiles, child->base.name);
754 if (p) {
755 /* @p replaces @child */
756 __replace_profile(child, p);
757 continue;
758 }
759
760 /* inherit @child and its children */
761 /* TODO: update hname of inherited children */
762 /* list refcount transferred to @new */
763 p = aa_deref_parent(child);
764 rcu_assign_pointer(child->parent, aa_get_profile(new));
765 list_add_rcu(&child->base.list, &new->base.profiles);
766 aa_put_profile(p);
767 }
768 }
769
770 if (!rcu_access_pointer(new->parent)) {
771 struct aa_profile *parent = aa_deref_parent(old);
772 rcu_assign_pointer(new->parent, aa_get_profile(parent));
773 }
774 aa_label_replace(&old->label, &new->label);
775 /* migrate dents must come after label replacement b/c update */
776 __aafs_profile_migrate_dents(old, new);
777
778 if (list_empty(&new->base.list)) {
779 /* new is not on a list already */
780 list_replace_rcu(&old->base.list, &new->base.list);
781 aa_get_profile(new);
782 aa_put_profile(old);
783 } else
784 __list_remove_profile(old);
785}
786
787/**
788 * __lookup_replace - lookup replacement information for a profile
789 * @ns - namespace the lookup occurs in
790 * @hname - name of profile to lookup
791 * @noreplace - true if not replacing an existing profile
792 * @p - Returns: profile to be replaced
793 * @info - Returns: info string on why lookup failed
794 *
795 * Returns: profile to replace (no ref) on success else ptr error
796 */
797static int __lookup_replace(struct aa_ns *ns, const char *hname,
798 bool noreplace, struct aa_profile **p,
799 const char **info)
800{
801 *p = aa_get_profile(__lookup_profile(&ns->base, hname));
802 if (*p) {
803 int error = replacement_allowed(*p, noreplace, info);
804 if (error) {
805 *info = "profile can not be replaced";
806 return error;
807 }
808 }
809
810 return 0;
811}
812
813static void share_name(struct aa_profile *old, struct aa_profile *new)
814{
815 aa_put_str(new->base.hname);
816 aa_get_str(old->base.hname);
817 new->base.hname = old->base.hname;
818 new->base.name = old->base.name;
819 new->label.hname = old->label.hname;
820}
821
822/* Update to newest version of parent after previous replacements
823 * Returns: unrefcount newest version of parent
824 */
825static struct aa_profile *update_to_newest_parent(struct aa_profile *new)
826{
827 struct aa_profile *parent, *newest;
828
829 parent = rcu_dereference_protected(new->parent,
830 mutex_is_locked(&new->ns->lock));
831 newest = aa_get_newest_profile(parent);
832
833 /* parent replaced in this atomic set? */
834 if (newest != parent) {
835 aa_put_profile(parent);
836 rcu_assign_pointer(new->parent, newest);
837 } else
838 aa_put_profile(newest);
839
840 return newest;
841}
842
843/**
844 * aa_replace_profiles - replace profile(s) on the profile list
845 * @policy_ns: namespace load is occurring on
846 * @label: label that is attempting to load/replace policy
847 * @mask: permission mask
848 * @udata: serialized data stream (NOT NULL)
849 *
850 * unpack and replace a profile on the profile list and uses of that profile
851 * by any task creds via invalidating the old version of the profile, which
852 * tasks will notice to update their own cred. If the profile does not exist
853 * on the profile list it is added.
854 *
855 * Returns: size of data consumed else error code on failure.
856 */
857ssize_t aa_replace_profiles(struct aa_ns *policy_ns, struct aa_label *label,
858 u32 mask, struct aa_loaddata *udata)
859{
860 const char *ns_name = NULL, *info = NULL;
861 struct aa_ns *ns = NULL;
862 struct aa_load_ent *ent, *tmp;
863 struct aa_loaddata *rawdata_ent;
864 const char *op;
865 ssize_t count, error;
866 LIST_HEAD(lh);
867
868 op = mask & AA_MAY_REPLACE_POLICY ? OP_PROF_REPL : OP_PROF_LOAD;
869 aa_get_loaddata(udata);
870 /* released below */
871 error = aa_unpack(udata, &lh, &ns_name);
872 if (error)
873 goto out;
874
875 /* ensure that profiles are all for the same ns
876 * TODO: update locking to remove this constaint. All profiles in
877 * the load set must succeed as a set or the load will
878 * fail. Sort ent list and take ns locks in hierarchy order
879 */
880 count = 0;
881 list_for_each_entry(ent, &lh, list) {
882 if (ns_name) {
883 if (ent->ns_name &&
884 strcmp(ent->ns_name, ns_name) != 0) {
885 info = "policy load has mixed namespaces";
886 error = -EACCES;
887 goto fail;
888 }
889 } else if (ent->ns_name) {
890 if (count) {
891 info = "policy load has mixed namespaces";
892 error = -EACCES;
893 goto fail;
894 }
895 ns_name = ent->ns_name;
896 } else
897 count++;
898 }
899 if (ns_name) {
900 ns = aa_prepare_ns(policy_ns ? policy_ns : labels_ns(label),
901 ns_name);
902 if (IS_ERR(ns)) {
903 op = OP_PROF_LOAD;
904 info = "failed to prepare namespace";
905 error = PTR_ERR(ns);
906 ns = NULL;
907 ent = NULL;
908 goto fail;
909 }
910 } else
911 ns = aa_get_ns(policy_ns ? policy_ns : labels_ns(label));
912
913 mutex_lock_nested(&ns->lock, ns->level);
914 /* check for duplicate rawdata blobs: space and file dedup */
915 list_for_each_entry(rawdata_ent, &ns->rawdata_list, list) {
916 if (aa_rawdata_eq(rawdata_ent, udata)) {
917 struct aa_loaddata *tmp;
918
919 tmp = __aa_get_loaddata(rawdata_ent);
920 /* check we didn't fail the race */
921 if (tmp) {
922 aa_put_loaddata(udata);
923 udata = tmp;
924 break;
925 }
926 }
927 }
928 /* setup parent and ns info */
929 list_for_each_entry(ent, &lh, list) {
930 struct aa_policy *policy;
931
932 ent->new->rawdata = aa_get_loaddata(udata);
933 error = __lookup_replace(ns, ent->new->base.hname,
934 !(mask & AA_MAY_REPLACE_POLICY),
935 &ent->old, &info);
936 if (error)
937 goto fail_lock;
938
939 if (ent->new->rename) {
940 error = __lookup_replace(ns, ent->new->rename,
941 !(mask & AA_MAY_REPLACE_POLICY),
942 &ent->rename, &info);
943 if (error)
944 goto fail_lock;
945 }
946
947 /* released when @new is freed */
948 ent->new->ns = aa_get_ns(ns);
949
950 if (ent->old || ent->rename)
951 continue;
952
953 /* no ref on policy only use inside lock */
954 policy = __lookup_parent(ns, ent->new->base.hname);
955 if (!policy) {
956 struct aa_profile *p;
957 p = __list_lookup_parent(&lh, ent->new);
958 if (!p) {
959 error = -ENOENT;
960 info = "parent does not exist";
961 goto fail_lock;
962 }
963 rcu_assign_pointer(ent->new->parent, aa_get_profile(p));
964 } else if (policy != &ns->base) {
965 /* released on profile replacement or free_profile */
966 struct aa_profile *p = (struct aa_profile *) policy;
967 rcu_assign_pointer(ent->new->parent, aa_get_profile(p));
968 }
969 }
970
971 /* create new fs entries for introspection if needed */
972 if (!udata->dents[AAFS_LOADDATA_DIR]) {
973 error = __aa_fs_create_rawdata(ns, udata);
974 if (error) {
975 info = "failed to create raw_data dir and files";
976 ent = NULL;
977 goto fail_lock;
978 }
979 }
980 list_for_each_entry(ent, &lh, list) {
981 if (!ent->old) {
982 struct dentry *parent;
983 if (rcu_access_pointer(ent->new->parent)) {
984 struct aa_profile *p;
985 p = aa_deref_parent(ent->new);
986 parent = prof_child_dir(p);
987 } else
988 parent = ns_subprofs_dir(ent->new->ns);
989 error = __aafs_profile_mkdir(ent->new, parent);
990 }
991
992 if (error) {
993 info = "failed to create";
994 goto fail_lock;
995 }
996 }
997
998 /* Done with checks that may fail - do actual replacement */
999 __aa_bump_ns_revision(ns);
1000 __aa_loaddata_update(udata, ns->revision);
1001 list_for_each_entry_safe(ent, tmp, &lh, list) {
1002 list_del_init(&ent->list);
1003 op = (!ent->old && !ent->rename) ? OP_PROF_LOAD : OP_PROF_REPL;
1004
1005 if (ent->old && ent->old->rawdata == ent->new->rawdata) {
1006 /* dedup actual profile replacement */
1007 audit_policy(label, op, ns_name, ent->new->base.hname,
1008 "same as current profile, skipping",
1009 error);
1010 /* break refcount cycle with proxy. */
1011 aa_put_proxy(ent->new->label.proxy);
1012 ent->new->label.proxy = NULL;
1013 goto skip;
1014 }
1015
1016 /*
1017 * TODO: finer dedup based on profile range in data. Load set
1018 * can differ but profile may remain unchanged
1019 */
1020 audit_policy(label, op, ns_name, ent->new->base.hname, NULL,
1021 error);
1022
1023 if (ent->old) {
1024 share_name(ent->old, ent->new);
1025 __replace_profile(ent->old, ent->new);
1026 } else {
1027 struct list_head *lh;
1028
1029 if (rcu_access_pointer(ent->new->parent)) {
1030 struct aa_profile *parent;
1031
1032 parent = update_to_newest_parent(ent->new);
1033 lh = &parent->base.profiles;
1034 } else
1035 lh = &ns->base.profiles;
1036 __add_profile(lh, ent->new);
1037 }
1038 skip:
1039 aa_load_ent_free(ent);
1040 }
1041 __aa_labelset_update_subtree(ns);
1042 mutex_unlock(&ns->lock);
1043
1044out:
1045 aa_put_ns(ns);
1046 aa_put_loaddata(udata);
1047 kfree(ns_name);
1048
1049 if (error)
1050 return error;
1051 return udata->size;
1052
1053fail_lock:
1054 mutex_unlock(&ns->lock);
1055
1056 /* audit cause of failure */
1057 op = (ent && !ent->old) ? OP_PROF_LOAD : OP_PROF_REPL;
1058fail:
1059 audit_policy(label, op, ns_name, ent ? ent->new->base.hname : NULL,
1060 info, error);
1061 /* audit status that rest of profiles in the atomic set failed too */
1062 info = "valid profile in failed atomic policy load";
1063 list_for_each_entry(tmp, &lh, list) {
1064 if (tmp == ent) {
1065 info = "unchecked profile in failed atomic policy load";
1066 /* skip entry that caused failure */
1067 continue;
1068 }
1069 op = (!tmp->old) ? OP_PROF_LOAD : OP_PROF_REPL;
1070 audit_policy(label, op, ns_name, tmp->new->base.hname, info,
1071 error);
1072 }
1073 list_for_each_entry_safe(ent, tmp, &lh, list) {
1074 list_del_init(&ent->list);
1075 aa_load_ent_free(ent);
1076 }
1077
1078 goto out;
1079}
1080
1081/**
1082 * aa_remove_profiles - remove profile(s) from the system
1083 * @policy_ns: namespace the remove is being done from
1084 * @subj: label attempting to remove policy
1085 * @fqname: name of the profile or namespace to remove (NOT NULL)
1086 * @size: size of the name
1087 *
1088 * Remove a profile or sub namespace from the current namespace, so that
1089 * they can not be found anymore and mark them as replaced by unconfined
1090 *
1091 * NOTE: removing confinement does not restore rlimits to preconfinement values
1092 *
1093 * Returns: size of data consume else error code if fails
1094 */
1095ssize_t aa_remove_profiles(struct aa_ns *policy_ns, struct aa_label *subj,
1096 char *fqname, size_t size)
1097{
1098 struct aa_ns *ns = NULL;
1099 struct aa_profile *profile = NULL;
1100 const char *name = fqname, *info = NULL;
1101 const char *ns_name = NULL;
1102 ssize_t error = 0;
1103
1104 if (*fqname == 0) {
1105 info = "no profile specified";
1106 error = -ENOENT;
1107 goto fail;
1108 }
1109
1110 if (fqname[0] == ':') {
1111 size_t ns_len;
1112
1113 name = aa_splitn_fqname(fqname, size, &ns_name, &ns_len);
1114 /* released below */
1115 ns = aa_lookupn_ns(policy_ns ? policy_ns : labels_ns(subj),
1116 ns_name, ns_len);
1117 if (!ns) {
1118 info = "namespace does not exist";
1119 error = -ENOENT;
1120 goto fail;
1121 }
1122 } else
1123 /* released below */
1124 ns = aa_get_ns(policy_ns ? policy_ns : labels_ns(subj));
1125
1126 if (!name) {
1127 /* remove namespace - can only happen if fqname[0] == ':' */
1128 mutex_lock_nested(&ns->parent->lock, ns->level);
1129 __aa_bump_ns_revision(ns);
1130 __aa_remove_ns(ns);
1131 mutex_unlock(&ns->parent->lock);
1132 } else {
1133 /* remove profile */
1134 mutex_lock_nested(&ns->lock, ns->level);
1135 profile = aa_get_profile(__lookup_profile(&ns->base, name));
1136 if (!profile) {
1137 error = -ENOENT;
1138 info = "profile does not exist";
1139 goto fail_ns_lock;
1140 }
1141 name = profile->base.hname;
1142 __aa_bump_ns_revision(ns);
1143 __remove_profile(profile);
1144 __aa_labelset_update_subtree(ns);
1145 mutex_unlock(&ns->lock);
1146 }
1147
1148 /* don't fail removal if audit fails */
1149 (void) audit_policy(subj, OP_PROF_RM, ns_name, name, info,
1150 error);
1151 aa_put_ns(ns);
1152 aa_put_profile(profile);
1153 return size;
1154
1155fail_ns_lock:
1156 mutex_unlock(&ns->lock);
1157 aa_put_ns(ns);
1158
1159fail:
1160 (void) audit_policy(subj, OP_PROF_RM, ns_name, name, info,
1161 error);
1162 return error;
1163}