2 * AppArmor security module
4 * This file contains AppArmor policy manipulation functions
6 * Copyright (C) 1998-2008 Novell/SUSE
7 * Copyright 2009-2010 Canonical Ltd.
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
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.
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.
24 * Namespace and profile names can be written together in either
26 * :namespace:profile - used by kernel interfaces for easy detection
27 * namespace://profile - used by policy
29 * Profile names can not start with : or @ or ^ and may not contain \0
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
36 * Namespace names may not start with / or @ and may not contain \0 or :
37 * Reserved namespace names
38 * user-XXXX - user defined profiles
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.
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
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
67 * An fqname is a name that may contain both namespace and profile hnames.
68 * eg. :ns:/bin/bash//bin/ls
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
76 #include <linux/slab.h>
77 #include <linux/spinlock.h>
78 #include <linux/string.h>
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"
92 /* root profile namespace */
93 struct aa_namespace *root_ns;
95 const char *const profile_mode_names[] = {
102 * hname_tail - find the last component of an hname
103 * @name: hname to find the base profile name component of (NOT NULL)
105 * Returns: the tail (base profile name) name component of an hname
107 static const char *hname_tail(const char *hname)
110 hname = strim((char *)hname);
111 for (split = strstr(hname, "//"); split; split = strstr(hname, "//"))
118 * policy_init - initialize a policy structure
119 * @policy: policy to initialize (NOT NULL)
120 * @prefix: prefix name if any is required. (MAYBE NULL)
121 * @name: name of the policy, init will make a copy of it (NOT NULL)
123 * Note: this fn creates a copy of strings passed in
125 * Returns: true if policy init successful
127 static bool policy_init(struct aa_policy *policy, const char *prefix,
130 /* freed by policy_free */
132 policy->hname = kmalloc(strlen(prefix) + strlen(name) + 3,
135 sprintf(policy->hname, "%s//%s", prefix, name);
137 policy->hname = kstrdup(name, GFP_KERNEL);
140 /* base.name is a substring of fqname */
141 policy->name = (char *)hname_tail(policy->hname);
142 INIT_LIST_HEAD(&policy->list);
143 INIT_LIST_HEAD(&policy->profiles);
149 * policy_destroy - free the elements referenced by @policy
150 * @policy: policy that is to have its elements freed (NOT NULL)
152 static void policy_destroy(struct aa_policy *policy)
154 /* still contains profiles -- invalid */
155 if (on_list_rcu(&policy->profiles)) {
156 AA_ERROR("%s: internal error, "
157 "policy '%s' still contains profiles\n",
158 __func__, policy->name);
161 if (on_list_rcu(&policy->list)) {
162 AA_ERROR("%s: internal error, policy '%s' still on list\n",
163 __func__, policy->name);
167 /* don't free name as its a subset of hname */
168 kzfree(policy->hname);
172 * __policy_find - find a policy by @name on a policy list
173 * @head: list to search (NOT NULL)
174 * @name: name to search for (NOT NULL)
176 * Requires: rcu_read_lock be held
178 * Returns: unrefcounted policy that match @name or NULL if not found
180 static struct aa_policy *__policy_find(struct list_head *head, const char *name)
182 struct aa_policy *policy;
184 list_for_each_entry_rcu(policy, head, list) {
185 if (!strcmp(policy->name, name))
192 * __policy_strn_find - find a policy that's name matches @len chars of @str
193 * @head: list to search (NOT NULL)
194 * @str: string to search for (NOT NULL)
195 * @len: length of match required
197 * Requires: rcu_read_lock be held
199 * Returns: unrefcounted policy that match @str or NULL if not found
201 * if @len == strlen(@strlen) then this is equiv to __policy_find
202 * other wise it allows searching for policy by a partial match of name
204 static struct aa_policy *__policy_strn_find(struct list_head *head,
205 const char *str, int len)
207 struct aa_policy *policy;
209 list_for_each_entry_rcu(policy, head, list) {
210 if (aa_strneq(policy->name, str, len))
218 * Routines for AppArmor namespaces
221 static const char *hidden_ns_name = "---";
223 * aa_ns_visible - test if @view is visible from @curr
224 * @curr: namespace to treat as the parent (NOT NULL)
225 * @view: namespace to test if visible from @curr (NOT NULL)
227 * Returns: true if @view is visible from @curr else false
229 bool aa_ns_visible(struct aa_namespace *curr, struct aa_namespace *view)
234 for ( ; view; view = view->parent) {
235 if (view->parent == curr)
242 * aa_na_name - Find the ns name to display for @view from @curr
243 * @curr - current namespace (NOT NULL)
244 * @view - namespace attempting to view (NOT NULL)
246 * Returns: name of @view visible from @curr
248 const char *aa_ns_name(struct aa_namespace *curr, struct aa_namespace *view)
250 /* if view == curr then the namespace name isn't displayed */
254 if (aa_ns_visible(curr, view)) {
255 /* at this point if a ns is visible it is in a view ns
256 * thus the curr ns.hname is a prefix of its name.
257 * Only output the virtualized portion of the name
258 * Add + 2 to skip over // separating curr hname prefix
259 * from the visible tail of the views hname
261 return view->base.hname + strlen(curr->base.hname) + 2;
263 return hidden_ns_name;
267 * alloc_namespace - allocate, initialize and return a new namespace
268 * @prefix: parent namespace name (MAYBE NULL)
269 * @name: a preallocated name (NOT NULL)
271 * Returns: refcounted namespace or NULL on failure.
273 static struct aa_namespace *alloc_namespace(const char *prefix,
276 struct aa_namespace *ns;
278 ns = kzalloc(sizeof(*ns), GFP_KERNEL);
279 AA_DEBUG("%s(%p)\n", __func__, ns);
282 if (!policy_init(&ns->base, prefix, name))
285 INIT_LIST_HEAD(&ns->sub_ns);
286 mutex_init(&ns->lock);
288 /* released by free_namespace */
289 ns->unconfined = aa_alloc_profile("unconfined");
291 goto fail_unconfined;
293 ns->unconfined->flags = PFLAG_UNCONFINED | PFLAG_IX_ON_NAME_ERROR |
294 PFLAG_IMMUTABLE | PFLAG_NS_COUNT;
296 /* ns and ns->unconfined share ns->unconfined refcount */
297 ns->unconfined->ns = ns;
299 atomic_set(&ns->uniq_null, 0);
304 kzfree(ns->base.hname);
311 * free_namespace - free a profile namespace
312 * @ns: the namespace to free (MAYBE NULL)
314 * Requires: All references to the namespace must have been put, if the
315 * namespace was referenced by a profile confining a task,
317 static void free_namespace(struct aa_namespace *ns)
322 policy_destroy(&ns->base);
323 aa_put_namespace(ns->parent);
325 ns->unconfined->ns = NULL;
326 aa_free_profile(ns->unconfined);
331 * __aa_find_namespace - find a namespace on a list by @name
332 * @head: list to search for namespace on (NOT NULL)
333 * @name: name of namespace to look for (NOT NULL)
335 * Returns: unrefcounted namespace
337 * Requires: rcu_read_lock be held
339 static struct aa_namespace *__aa_find_namespace(struct list_head *head,
342 return (struct aa_namespace *)__policy_find(head, name);
346 * aa_find_namespace - look up a profile namespace on the namespace list
347 * @root: namespace to search in (NOT NULL)
348 * @name: name of namespace to find (NOT NULL)
350 * Returns: a refcounted namespace on the list, or NULL if no namespace
351 * called @name exists.
353 * refcount released by caller
355 struct aa_namespace *aa_find_namespace(struct aa_namespace *root,
358 struct aa_namespace *ns = NULL;
361 ns = aa_get_namespace(__aa_find_namespace(&root->sub_ns, name));
368 * aa_prepare_namespace - find an existing or create a new namespace of @name
369 * @name: the namespace to find or add (MAYBE NULL)
371 * Returns: refcounted namespace or NULL if failed to create one
373 static struct aa_namespace *aa_prepare_namespace(const char *name)
375 struct aa_namespace *ns, *root;
377 root = aa_current_profile()->ns;
379 mutex_lock(&root->lock);
381 /* if name isn't specified the profile is loaded to the current ns */
383 /* released by caller */
384 ns = aa_get_namespace(root);
388 /* try and find the specified ns and if it doesn't exist create it */
389 /* released by caller */
390 ns = aa_get_namespace(__aa_find_namespace(&root->sub_ns, name));
392 ns = alloc_namespace(root->base.hname, name);
396 ns->parent = aa_get_namespace(root);
397 list_add_rcu(&ns->base.list, &root->sub_ns);
399 aa_get_namespace(ns);
402 mutex_unlock(&root->lock);
409 * __list_add_profile - add a profile to a list
410 * @list: list to add it to (NOT NULL)
411 * @profile: the profile to add (NOT NULL)
413 * refcount @profile, should be put by __list_remove_profile
415 * Requires: namespace lock be held, or list not be shared
417 static void __list_add_profile(struct list_head *list,
418 struct aa_profile *profile)
420 list_add_rcu(&profile->base.list, list);
421 /* get list reference */
422 aa_get_profile(profile);
426 * __list_remove_profile - remove a profile from the list it is on
427 * @profile: the profile to remove (NOT NULL)
429 * remove a profile from the list, warning generally removal should
430 * be done with __replace_profile as most profile removals are
431 * replacements to the unconfined profile.
433 * put @profile list refcount
435 * Requires: namespace lock be held, or list not have been live
437 static void __list_remove_profile(struct aa_profile *profile)
439 list_del_rcu(&profile->base.list);
440 aa_put_profile(profile);
443 static void __profile_list_release(struct list_head *head);
446 * __remove_profile - remove old profile, and children
447 * @profile: profile to be replaced (NOT NULL)
449 * Requires: namespace list lock be held, or list not be shared
451 static void __remove_profile(struct aa_profile *profile)
453 /* release any children lists first */
454 __profile_list_release(&profile->base.profiles);
455 /* released by free_profile */
456 __aa_update_replacedby(profile, profile->ns->unconfined);
457 __list_remove_profile(profile);
461 * __profile_list_release - remove all profiles on the list and put refs
462 * @head: list of profiles (NOT NULL)
464 * Requires: namespace lock be held
466 static void __profile_list_release(struct list_head *head)
468 struct aa_profile *profile, *tmp;
469 list_for_each_entry_safe(profile, tmp, head, base.list)
470 __remove_profile(profile);
473 static void __ns_list_release(struct list_head *head);
476 * destroy_namespace - remove everything contained by @ns
477 * @ns: namespace to have it contents removed (NOT NULL)
479 static void destroy_namespace(struct aa_namespace *ns)
484 mutex_lock(&ns->lock);
485 /* release all profiles in this namespace */
486 __profile_list_release(&ns->base.profiles);
488 /* release all sub namespaces */
489 __ns_list_release(&ns->sub_ns);
492 __aa_update_replacedby(ns->unconfined, ns->parent->unconfined);
493 mutex_unlock(&ns->lock);
497 * __remove_namespace - remove a namespace and all its children
498 * @ns: namespace to be removed (NOT NULL)
500 * Requires: ns->parent->lock be held and ns removed from parent.
502 static void __remove_namespace(struct aa_namespace *ns)
504 /* remove ns from namespace list */
505 list_del_rcu(&ns->base.list);
506 destroy_namespace(ns);
507 aa_put_namespace(ns);
511 * __ns_list_release - remove all profile namespaces on the list put refs
512 * @head: list of profile namespaces (NOT NULL)
514 * Requires: namespace lock be held
516 static void __ns_list_release(struct list_head *head)
518 struct aa_namespace *ns, *tmp;
519 list_for_each_entry_safe(ns, tmp, head, base.list)
520 __remove_namespace(ns);
525 * aa_alloc_root_ns - allocate the root profile namespace
527 * Returns: %0 on success else error
530 int __init aa_alloc_root_ns(void)
532 /* released by aa_free_root_ns - used as list ref*/
533 root_ns = alloc_namespace(NULL, "root");
541 * aa_free_root_ns - free the root profile namespace
543 void __init aa_free_root_ns(void)
545 struct aa_namespace *ns = root_ns;
548 destroy_namespace(ns);
549 aa_put_namespace(ns);
553 static void free_replacedby(struct aa_replacedby *r)
556 aa_put_profile(rcu_dereference(r->profile));
562 void aa_free_replacedby_kref(struct kref *kref)
564 struct aa_replacedby *r = container_of(kref, struct aa_replacedby,
570 * aa_free_profile - free a profile
571 * @profile: the profile to free (MAYBE NULL)
573 * Free a profile, its hats and null_profile. All references to the profile,
574 * its hats and null_profile must have been put.
576 * If the profile was referenced from a task context, free_profile() will
577 * be called from an rcu callback routine, so we must not sleep here.
579 void aa_free_profile(struct aa_profile *profile)
581 AA_DEBUG("%s(%p)\n", __func__, profile);
586 /* free children profiles */
587 policy_destroy(&profile->base);
588 aa_put_profile(rcu_access_pointer(profile->parent));
590 aa_put_namespace(profile->ns);
591 kzfree(profile->rename);
593 aa_free_file_rules(&profile->file);
594 aa_free_cap_rules(&profile->caps);
595 aa_free_rlimit_rules(&profile->rlimits);
597 aa_put_dfa(profile->xmatch);
598 aa_put_dfa(profile->policy.dfa);
599 aa_put_replacedby(profile->replacedby);
605 * aa_free_profile_rcu - free aa_profile by rcu (called by aa_free_profile_kref)
606 * @head: rcu_head callback for freeing of a profile (NOT NULL)
608 static void aa_free_profile_rcu(struct rcu_head *head)
610 struct aa_profile *p = container_of(head, struct aa_profile, rcu);
611 if (p->flags & PFLAG_NS_COUNT)
612 free_namespace(p->ns);
618 * aa_free_profile_kref - free aa_profile by kref (called by aa_put_profile)
619 * @kr: kref callback for freeing of a profile (NOT NULL)
621 void aa_free_profile_kref(struct kref *kref)
623 struct aa_profile *p = container_of(kref, struct aa_profile, count);
624 call_rcu(&p->rcu, aa_free_profile_rcu);
628 * aa_alloc_profile - allocate, initialize and return a new profile
629 * @hname: name of the profile (NOT NULL)
631 * Returns: refcount profile or NULL on failure
633 struct aa_profile *aa_alloc_profile(const char *hname)
635 struct aa_profile *profile;
637 /* freed by free_profile - usually through aa_put_profile */
638 profile = kzalloc(sizeof(*profile), GFP_KERNEL);
642 profile->replacedby = kzalloc(sizeof(struct aa_replacedby), GFP_KERNEL);
643 if (!profile->replacedby)
645 kref_init(&profile->replacedby->count);
647 if (!policy_init(&profile->base, NULL, hname))
649 kref_init(&profile->count);
651 /* refcount released by caller */
655 kzfree(profile->replacedby);
662 * aa_new_null_profile - create a new null-X learning profile
663 * @parent: profile that caused this profile to be created (NOT NULL)
664 * @hat: true if the null- learning profile is a hat
666 * Create a null- complain mode profile used in learning mode. The name of
667 * the profile is unique and follows the format of parent//null-<uniq>.
669 * null profiles are added to the profile list but the list does not
670 * hold a count on them so that they are automatically released when
673 * Returns: new refcounted profile else NULL on failure
675 struct aa_profile *aa_new_null_profile(struct aa_profile *parent, int hat)
677 struct aa_profile *profile = NULL;
679 int uniq = atomic_inc_return(&parent->ns->uniq_null);
682 name = kmalloc(strlen(parent->base.hname) + 2 + 7 + 8, GFP_KERNEL);
685 sprintf(name, "%s//null-%x", parent->base.hname, uniq);
687 profile = aa_alloc_profile(name);
692 profile->mode = APPARMOR_COMPLAIN;
693 profile->flags = PFLAG_NULL;
695 profile->flags |= PFLAG_HAT;
697 /* released on free_profile */
698 rcu_assign_pointer(profile->parent, aa_get_profile(parent));
699 profile->ns = aa_get_namespace(parent->ns);
701 mutex_lock(&profile->ns->lock);
702 __list_add_profile(&parent->base.profiles, profile);
703 mutex_unlock(&profile->ns->lock);
705 /* refcount released by caller */
712 /* TODO: profile accounting - setup in remove */
715 * __find_child - find a profile on @head list with a name matching @name
716 * @head: list to search (NOT NULL)
717 * @name: name of profile (NOT NULL)
719 * Requires: rcu_read_lock be held
721 * Returns: unrefcounted profile ptr, or NULL if not found
723 static struct aa_profile *__find_child(struct list_head *head, const char *name)
725 return (struct aa_profile *)__policy_find(head, name);
729 * __strn_find_child - find a profile on @head list using substring of @name
730 * @head: list to search (NOT NULL)
731 * @name: name of profile (NOT NULL)
732 * @len: length of @name substring to match
734 * Requires: rcu_read_lock be held
736 * Returns: unrefcounted profile ptr, or NULL if not found
738 static struct aa_profile *__strn_find_child(struct list_head *head,
739 const char *name, int len)
741 return (struct aa_profile *)__policy_strn_find(head, name, len);
745 * aa_find_child - find a profile by @name in @parent
746 * @parent: profile to search (NOT NULL)
747 * @name: profile name to search for (NOT NULL)
749 * Returns: a refcounted profile or NULL if not found
751 struct aa_profile *aa_find_child(struct aa_profile *parent, const char *name)
753 struct aa_profile *profile;
756 profile = aa_get_profile(__find_child(&parent->base.profiles, name));
759 /* refcount released by caller */
764 * __lookup_parent - lookup the parent of a profile of name @hname
765 * @ns: namespace to lookup profile in (NOT NULL)
766 * @hname: hierarchical profile name to find parent of (NOT NULL)
768 * Lookups up the parent of a fully qualified profile name, the profile
769 * that matches hname does not need to exist, in general this
770 * is used to load a new profile.
772 * Requires: rcu_read_lock be held
774 * Returns: unrefcounted policy or NULL if not found
776 static struct aa_policy *__lookup_parent(struct aa_namespace *ns,
779 struct aa_policy *policy;
780 struct aa_profile *profile = NULL;
785 for (split = strstr(hname, "//"); split;) {
786 profile = __strn_find_child(&policy->profiles, hname,
790 policy = &profile->base;
792 split = strstr(hname, "//");
796 return &profile->base;
800 * __lookup_profile - lookup the profile matching @hname
801 * @base: base list to start looking up profile name from (NOT NULL)
802 * @hname: hierarchical profile name (NOT NULL)
804 * Requires: rcu_read_lock be held
806 * Returns: unrefcounted profile pointer or NULL if not found
808 * Do a relative name lookup, recursing through profile tree.
810 static struct aa_profile *__lookup_profile(struct aa_policy *base,
813 struct aa_profile *profile = NULL;
816 for (split = strstr(hname, "//"); split;) {
817 profile = __strn_find_child(&base->profiles, hname,
822 base = &profile->base;
824 split = strstr(hname, "//");
827 profile = __find_child(&base->profiles, hname);
833 * aa_lookup_profile - find a profile by its full or partial name
834 * @ns: the namespace to start from (NOT NULL)
835 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
837 * Returns: refcounted profile or NULL if not found
839 struct aa_profile *aa_lookup_profile(struct aa_namespace *ns, const char *hname)
841 struct aa_profile *profile;
845 profile = __lookup_profile(&ns->base, hname);
846 } while (profile && !aa_get_profile_not0(profile));
849 /* the unconfined profile is not in the regular profile list */
850 if (!profile && strcmp(hname, "unconfined") == 0)
851 profile = aa_get_newest_profile(ns->unconfined);
853 /* refcount released by caller */
858 * replacement_allowed - test to see if replacement is allowed
859 * @profile: profile to test if it can be replaced (MAYBE NULL)
860 * @noreplace: true if replacement shouldn't be allowed but addition is okay
861 * @info: Returns - info about why replacement failed (NOT NULL)
863 * Returns: %0 if replacement allowed else error code
865 static int replacement_allowed(struct aa_profile *profile, int noreplace,
869 if (profile->flags & PFLAG_IMMUTABLE) {
870 *info = "cannot replace immutible profile";
872 } else if (noreplace) {
873 *info = "profile already exists";
881 * aa_audit_policy - Do auditing of policy changes
882 * @op: policy operation being performed
883 * @gfp: memory allocation flags
884 * @name: name of profile being manipulated (NOT NULL)
885 * @info: any extra information to be audited (MAYBE NULL)
888 * Returns: the error to be returned after audit is done
890 static int audit_policy(int op, gfp_t gfp, const char *name, const char *info,
893 struct common_audit_data sa;
894 struct apparmor_audit_data aad = {0,};
895 sa.type = LSM_AUDIT_DATA_NONE;
902 return aa_audit(AUDIT_APPARMOR_STATUS, __aa_current_profile(), gfp,
907 * aa_may_manage_policy - can the current task manage policy
908 * @op: the policy manipulation operation being done
910 * Returns: true if the task is allowed to manipulate policy
912 bool aa_may_manage_policy(int op)
914 /* check if loading policy is locked out */
915 if (aa_g_lock_policy) {
916 audit_policy(op, GFP_KERNEL, NULL, "policy_locked", -EACCES);
920 if (!capable(CAP_MAC_ADMIN)) {
921 audit_policy(op, GFP_KERNEL, NULL, "not policy admin", -EACCES);
928 static struct aa_profile *__list_lookup_parent(struct list_head *lh,
929 struct aa_profile *profile)
931 const char *base = hname_tail(profile->base.hname);
932 long len = base - profile->base.hname;
933 struct aa_load_ent *ent;
935 /* parent won't have trailing // so remove from len */
940 list_for_each_entry(ent, lh, list) {
941 if (ent->new == profile)
943 if (strncmp(ent->new->base.hname, profile->base.hname, len) ==
944 0 && ent->new->base.hname[len] == 0)
952 * __replace_profile - replace @old with @new on a list
953 * @old: profile to be replaced (NOT NULL)
954 * @new: profile to replace @old with (NOT NULL)
955 * @share_replacedby: transfer @old->replacedby to @new
957 * Will duplicate and refcount elements that @new inherits from @old
958 * and will inherit @old children.
960 * refcount @new for list, put @old list refcount
962 * Requires: namespace list lock be held, or list not be shared
964 static void __replace_profile(struct aa_profile *old, struct aa_profile *new,
965 bool share_replacedby)
967 struct aa_profile *child, *tmp;
969 if (!list_empty(&old->base.profiles)) {
971 list_splice_init_rcu(&old->base.profiles, &lh, synchronize_rcu);
973 list_for_each_entry_safe(child, tmp, &lh, base.list) {
974 struct aa_profile *p;
976 list_del_init(&child->base.list);
977 p = __find_child(&new->base.profiles, child->base.name);
979 /* @p replaces @child */
980 __replace_profile(child, p, share_replacedby);
984 /* inherit @child and its children */
985 /* TODO: update hname of inherited children */
986 /* list refcount transferred to @new */
987 p = rcu_dereference_protected(child->parent,
988 mutex_is_locked(&child->ns->lock));
989 rcu_assign_pointer(child->parent, aa_get_profile(new));
990 list_add_rcu(&child->base.list, &new->base.profiles);
995 if (!rcu_access_pointer(new->parent)) {
996 struct aa_profile *parent = rcu_dereference(old->parent);
997 rcu_assign_pointer(new->parent, aa_get_profile(parent));
999 __aa_update_replacedby(old, new);
1000 if (share_replacedby) {
1001 aa_put_replacedby(new->replacedby);
1002 new->replacedby = aa_get_replacedby(old->replacedby);
1005 if (list_empty(&new->base.list)) {
1006 /* new is not on a list already */
1007 list_replace_rcu(&old->base.list, &new->base.list);
1008 aa_get_profile(new);
1009 aa_put_profile(old);
1011 __list_remove_profile(old);
1015 * __lookup_replace - lookup replacement information for a profile
1016 * @ns - namespace the lookup occurs in
1017 * @hname - name of profile to lookup
1018 * @noreplace - true if not replacing an existing profile
1019 * @p - Returns: profile to be replaced
1020 * @info - Returns: info string on why lookup failed
1022 * Returns: profile to replace (no ref) on success else ptr error
1024 static int __lookup_replace(struct aa_namespace *ns, const char *hname,
1025 bool noreplace, struct aa_profile **p,
1028 *p = aa_get_profile(__lookup_profile(&ns->base, hname));
1030 int error = replacement_allowed(*p, noreplace, info);
1032 *info = "profile can not be replaced";
1041 * aa_replace_profiles - replace profile(s) on the profile list
1042 * @udata: serialized data stream (NOT NULL)
1043 * @size: size of the serialized data stream
1044 * @noreplace: true if only doing addition, no replacement allowed
1046 * unpack and replace a profile on the profile list and uses of that profile
1047 * by any aa_task_cxt. If the profile does not exist on the profile list
1050 * Returns: size of data consumed else error code on failure.
1052 ssize_t aa_replace_profiles(void *udata, size_t size, bool noreplace)
1054 const char *ns_name, *name = NULL, *info = NULL;
1055 struct aa_namespace *ns = NULL;
1056 struct aa_load_ent *ent, *tmp;
1057 int op = OP_PROF_REPL;
1061 /* released below */
1062 error = aa_unpack(udata, size, &lh, &ns_name);
1066 /* released below */
1067 ns = aa_prepare_namespace(ns_name);
1069 info = "failed to prepare namespace";
1075 mutex_lock(&ns->lock);
1076 /* setup parent and ns info */
1077 list_for_each_entry(ent, &lh, list) {
1078 struct aa_policy *policy;
1080 name = ent->new->base.hname;
1081 error = __lookup_replace(ns, ent->new->base.hname, noreplace,
1086 if (ent->new->rename) {
1087 error = __lookup_replace(ns, ent->new->rename,
1088 noreplace, &ent->rename,
1094 /* released when @new is freed */
1095 ent->new->ns = aa_get_namespace(ns);
1097 if (ent->old || ent->rename)
1100 /* no ref on policy only use inside lock */
1101 policy = __lookup_parent(ns, ent->new->base.hname);
1103 struct aa_profile *p;
1104 p = __list_lookup_parent(&lh, ent->new);
1107 info = "parent does not exist";
1108 name = ent->new->base.hname;
1111 rcu_assign_pointer(ent->new->parent, aa_get_profile(p));
1112 } else if (policy != &ns->base) {
1113 /* released on profile replacement or free_profile */
1114 struct aa_profile *p = (struct aa_profile *) policy;
1115 rcu_assign_pointer(ent->new->parent, aa_get_profile(p));
1119 /* do actual replacement */
1120 list_for_each_entry_safe(ent, tmp, &lh, list) {
1121 list_del_init(&ent->list);
1122 op = (!ent->old && !ent->rename) ? OP_PROF_LOAD : OP_PROF_REPL;
1124 audit_policy(op, GFP_ATOMIC, ent->new->base.name, NULL, error);
1127 __replace_profile(ent->old, ent->new, 1);
1129 __replace_profile(ent->rename, ent->new, 0);
1130 } else if (ent->rename) {
1131 __replace_profile(ent->rename, ent->new, 0);
1132 } else if (ent->new->parent) {
1133 struct aa_profile *parent, *newest;
1134 parent = rcu_dereference_protected(ent->new->parent,
1135 mutex_is_locked(&ns->lock));
1136 newest = aa_get_newest_profile(parent);
1138 /* parent replaced in this atomic set? */
1139 if (newest != parent) {
1140 aa_get_profile(newest);
1141 aa_put_profile(parent);
1142 rcu_assign_pointer(ent->new->parent, newest);
1144 aa_put_profile(newest);
1145 __list_add_profile(&parent->base.profiles, ent->new);
1147 __list_add_profile(&ns->base.profiles, ent->new);
1149 aa_load_ent_free(ent);
1151 mutex_unlock(&ns->lock);
1154 aa_put_namespace(ns);
1161 mutex_unlock(&ns->lock);
1163 error = audit_policy(op, GFP_KERNEL, name, info, error);
1165 list_for_each_entry_safe(ent, tmp, &lh, list) {
1166 list_del_init(&ent->list);
1167 aa_load_ent_free(ent);
1174 * aa_remove_profiles - remove profile(s) from the system
1175 * @fqname: name of the profile or namespace to remove (NOT NULL)
1176 * @size: size of the name
1178 * Remove a profile or sub namespace from the current namespace, so that
1179 * they can not be found anymore and mark them as replaced by unconfined
1181 * NOTE: removing confinement does not restore rlimits to preconfinemnet values
1183 * Returns: size of data consume else error code if fails
1185 ssize_t aa_remove_profiles(char *fqname, size_t size)
1187 struct aa_namespace *root, *ns = NULL;
1188 struct aa_profile *profile = NULL;
1189 const char *name = fqname, *info = NULL;
1193 info = "no profile specified";
1198 root = aa_current_profile()->ns;
1200 if (fqname[0] == ':') {
1202 name = aa_split_fqname(fqname, &ns_name);
1203 /* released below */
1204 ns = aa_find_namespace(root, ns_name);
1206 info = "namespace does not exist";
1211 /* released below */
1212 ns = aa_get_namespace(root);
1215 /* remove namespace - can only happen if fqname[0] == ':' */
1216 mutex_lock(&ns->parent->lock);
1217 __remove_namespace(ns);
1218 mutex_unlock(&ns->parent->lock);
1220 /* remove profile */
1221 mutex_lock(&ns->lock);
1222 profile = aa_get_profile(__lookup_profile(&ns->base, name));
1225 info = "profile does not exist";
1228 name = profile->base.hname;
1229 __remove_profile(profile);
1230 mutex_unlock(&ns->lock);
1233 /* don't fail removal if audit fails */
1234 (void) audit_policy(OP_PROF_RM, GFP_KERNEL, name, info, error);
1235 aa_put_namespace(ns);
1236 aa_put_profile(profile);
1240 mutex_unlock(&ns->lock);
1241 aa_put_namespace(ns);
1244 (void) audit_policy(OP_PROF_RM, GFP_KERNEL, name, info, error);