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);
144 kref_init(&policy->count);
150 * policy_destroy - free the elements referenced by @policy
151 * @policy: policy that is to have its elements freed (NOT NULL)
153 static void policy_destroy(struct aa_policy *policy)
155 /* still contains profiles -- invalid */
156 if (on_list_rcu(&policy->profiles)) {
157 AA_ERROR("%s: internal error, "
158 "policy '%s' still contains profiles\n",
159 __func__, policy->name);
162 if (on_list_rcu(&policy->list)) {
163 AA_ERROR("%s: internal error, policy '%s' still on list\n",
164 __func__, policy->name);
168 /* don't free name as its a subset of hname */
169 kzfree(policy->hname);
173 * __policy_find - find a policy by @name on a policy list
174 * @head: list to search (NOT NULL)
175 * @name: name to search for (NOT NULL)
177 * Requires: rcu_read_lock be held
179 * Returns: unrefcounted policy that match @name or NULL if not found
181 static struct aa_policy *__policy_find(struct list_head *head, const char *name)
183 struct aa_policy *policy;
185 list_for_each_entry_rcu(policy, head, list) {
186 if (!strcmp(policy->name, name))
193 * __policy_strn_find - find a policy that's name matches @len chars of @str
194 * @head: list to search (NOT NULL)
195 * @str: string to search for (NOT NULL)
196 * @len: length of match required
198 * Requires: rcu_read_lock be held
200 * Returns: unrefcounted policy that match @str or NULL if not found
202 * if @len == strlen(@strlen) then this is equiv to __policy_find
203 * other wise it allows searching for policy by a partial match of name
205 static struct aa_policy *__policy_strn_find(struct list_head *head,
206 const char *str, int len)
208 struct aa_policy *policy;
210 list_for_each_entry_rcu(policy, head, list) {
211 if (aa_strneq(policy->name, str, len))
219 * Routines for AppArmor namespaces
222 static const char *hidden_ns_name = "---";
224 * aa_ns_visible - test if @view is visible from @curr
225 * @curr: namespace to treat as the parent (NOT NULL)
226 * @view: namespace to test if visible from @curr (NOT NULL)
228 * Returns: true if @view is visible from @curr else false
230 bool aa_ns_visible(struct aa_namespace *curr, struct aa_namespace *view)
235 for ( ; view; view = view->parent) {
236 if (view->parent == curr)
243 * aa_na_name - Find the ns name to display for @view from @curr
244 * @curr - current namespace (NOT NULL)
245 * @view - namespace attempting to view (NOT NULL)
247 * Returns: name of @view visible from @curr
249 const char *aa_ns_name(struct aa_namespace *curr, struct aa_namespace *view)
251 /* if view == curr then the namespace name isn't displayed */
255 if (aa_ns_visible(curr, view)) {
256 /* at this point if a ns is visible it is in a view ns
257 * thus the curr ns.hname is a prefix of its name.
258 * Only output the virtualized portion of the name
259 * Add + 2 to skip over // separating curr hname prefix
260 * from the visible tail of the views hname
262 return view->base.hname + strlen(curr->base.hname) + 2;
264 return hidden_ns_name;
268 * alloc_namespace - allocate, initialize and return a new namespace
269 * @prefix: parent namespace name (MAYBE NULL)
270 * @name: a preallocated name (NOT NULL)
272 * Returns: refcounted namespace or NULL on failure.
274 static struct aa_namespace *alloc_namespace(const char *prefix,
277 struct aa_namespace *ns;
279 ns = kzalloc(sizeof(*ns), GFP_KERNEL);
280 AA_DEBUG("%s(%p)\n", __func__, ns);
283 if (!policy_init(&ns->base, prefix, name))
286 INIT_LIST_HEAD(&ns->sub_ns);
287 mutex_init(&ns->lock);
289 /* released by free_namespace */
290 ns->unconfined = aa_alloc_profile("unconfined");
292 goto fail_unconfined;
294 ns->unconfined->flags = PFLAG_UNCONFINED | PFLAG_IX_ON_NAME_ERROR |
298 * released by free_namespace, however __remove_namespace breaks
299 * the cyclic references (ns->unconfined, and unconfined->ns) and
300 * replaces with refs to parent namespace unconfined
302 ns->unconfined->ns = aa_get_namespace(ns);
304 atomic_set(&ns->uniq_null, 0);
309 kzfree(ns->base.hname);
316 * free_namespace - free a profile namespace
317 * @ns: the namespace to free (MAYBE NULL)
319 * Requires: All references to the namespace must have been put, if the
320 * namespace was referenced by a profile confining a task,
322 static void free_namespace(struct aa_namespace *ns)
327 policy_destroy(&ns->base);
328 aa_put_namespace(ns->parent);
330 if (ns->unconfined && ns->unconfined->ns == ns)
331 ns->unconfined->ns = NULL;
333 aa_put_profile(ns->unconfined);
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)
341 void aa_free_namespace_kref(struct kref *kref)
343 free_namespace(container_of(kref, struct aa_namespace, base.count));
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)
351 * Returns: unrefcounted namespace
353 * Requires: rcu_read_lock be held
355 static struct aa_namespace *__aa_find_namespace(struct list_head *head,
358 return (struct aa_namespace *)__policy_find(head, name);
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)
366 * Returns: a refcounted namespace on the list, or NULL if no namespace
367 * called @name exists.
369 * refcount released by caller
371 struct aa_namespace *aa_find_namespace(struct aa_namespace *root,
374 struct aa_namespace *ns = NULL;
377 ns = aa_get_namespace(__aa_find_namespace(&root->sub_ns, name));
384 * aa_prepare_namespace - find an existing or create a new namespace of @name
385 * @name: the namespace to find or add (MAYBE NULL)
387 * Returns: refcounted namespace or NULL if failed to create one
389 static struct aa_namespace *aa_prepare_namespace(const char *name)
391 struct aa_namespace *ns, *root;
393 root = aa_current_profile()->ns;
395 mutex_lock(&root->lock);
397 /* if name isn't specified the profile is loaded to the current ns */
399 /* released by caller */
400 ns = aa_get_namespace(root);
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));
408 ns = alloc_namespace(root->base.hname, name);
412 ns->parent = aa_get_namespace(root);
413 list_add_rcu(&ns->base.list, &root->sub_ns);
415 aa_get_namespace(ns);
418 mutex_unlock(&root->lock);
425 * __list_add_profile - add a profile to a list
426 * @list: list to add it to (NOT NULL)
427 * @profile: the profile to add (NOT NULL)
429 * refcount @profile, should be put by __list_remove_profile
431 * Requires: namespace lock be held, or list not be shared
433 static void __list_add_profile(struct list_head *list,
434 struct aa_profile *profile)
436 list_add_rcu(&profile->base.list, list);
437 /* get list reference */
438 aa_get_profile(profile);
442 * __list_remove_profile - remove a profile from the list it is on
443 * @profile: the profile to remove (NOT NULL)
445 * remove a profile from the list, warning generally removal should
446 * be done with __replace_profile as most profile removals are
447 * replacements to the unconfined profile.
449 * put @profile list refcount
451 * Requires: namespace lock be held, or list not have been live
453 static void __list_remove_profile(struct aa_profile *profile)
455 list_del_rcu(&profile->base.list);
456 aa_put_profile(profile);
459 static void __profile_list_release(struct list_head *head);
462 * __remove_profile - remove old profile, and children
463 * @profile: profile to be replaced (NOT NULL)
465 * Requires: namespace list lock be held, or list not be shared
467 static void __remove_profile(struct aa_profile *profile)
469 /* release any children lists first */
470 __profile_list_release(&profile->base.profiles);
471 /* released by free_profile */
472 profile->replacedby = aa_get_profile(profile->ns->unconfined);
473 __list_remove_profile(profile);
477 * __profile_list_release - remove all profiles on the list and put refs
478 * @head: list of profiles (NOT NULL)
480 * Requires: namespace lock be held
482 static void __profile_list_release(struct list_head *head)
484 struct aa_profile *profile, *tmp;
485 list_for_each_entry_safe(profile, tmp, head, base.list)
486 __remove_profile(profile);
489 static void __ns_list_release(struct list_head *head);
492 * destroy_namespace - remove everything contained by @ns
493 * @ns: namespace to have it contents removed (NOT NULL)
495 static void destroy_namespace(struct aa_namespace *ns)
497 struct aa_profile *unconfined;
502 mutex_lock(&ns->lock);
503 /* release all profiles in this namespace */
504 __profile_list_release(&ns->base.profiles);
506 /* release all sub namespaces */
507 __ns_list_release(&ns->sub_ns);
509 unconfined = ns->unconfined;
511 * break the ns, unconfined profile cyclic reference and forward
512 * all new unconfined profiles requests to the parent namespace
513 * This will result in all confined tasks that have a profile
514 * being removed, inheriting the parent->unconfined profile.
517 ns->unconfined = aa_get_profile(ns->parent->unconfined);
519 /* release original ns->unconfined ref */
520 aa_put_profile(unconfined);
522 mutex_unlock(&ns->lock);
525 static void aa_put_ns_rcu(struct rcu_head *head)
527 struct aa_namespace *ns = container_of(head, struct aa_namespace,
529 /* release ns->base.list ref */
530 aa_put_namespace(ns);
534 * __remove_namespace - remove a namespace and all its children
535 * @ns: namespace to be removed (NOT NULL)
537 * Requires: ns->parent->lock be held and ns removed from parent.
539 static void __remove_namespace(struct aa_namespace *ns)
541 /* remove ns from namespace list */
542 list_del_rcu(&ns->base.list);
544 destroy_namespace(ns);
546 call_rcu(&ns->base.rcu, aa_put_ns_rcu);
550 * __ns_list_release - remove all profile namespaces on the list put refs
551 * @head: list of profile namespaces (NOT NULL)
553 * Requires: namespace lock be held
555 static void __ns_list_release(struct list_head *head)
557 struct aa_namespace *ns, *tmp;
558 list_for_each_entry_safe(ns, tmp, head, base.list)
559 __remove_namespace(ns);
564 * aa_alloc_root_ns - allocate the root profile namespace
566 * Returns: %0 on success else error
569 int __init aa_alloc_root_ns(void)
571 /* released by aa_free_root_ns - used as list ref*/
572 root_ns = alloc_namespace(NULL, "root");
580 * aa_free_root_ns - free the root profile namespace
582 void __init aa_free_root_ns(void)
584 struct aa_namespace *ns = root_ns;
587 destroy_namespace(ns);
588 aa_put_namespace(ns);
592 * free_profile - free a profile
593 * @profile: the profile to free (MAYBE NULL)
595 * Free a profile, its hats and null_profile. All references to the profile,
596 * its hats and null_profile must have been put.
598 * If the profile was referenced from a task context, free_profile() will
599 * be called from an rcu callback routine, so we must not sleep here.
601 static void free_profile(struct aa_profile *profile)
603 struct aa_profile *p;
605 AA_DEBUG("%s(%p)\n", __func__, profile);
610 /* free children profiles */
611 policy_destroy(&profile->base);
612 aa_put_profile(rcu_access_pointer(profile->parent));
614 aa_put_namespace(profile->ns);
615 kzfree(profile->rename);
617 aa_free_file_rules(&profile->file);
618 aa_free_cap_rules(&profile->caps);
619 aa_free_rlimit_rules(&profile->rlimits);
621 aa_put_dfa(profile->xmatch);
622 aa_put_dfa(profile->policy.dfa);
624 /* put the profile reference for replacedby, but not via
625 * put_profile(kref_put).
626 * replacedby can form a long chain that can result in cascading
627 * frees that blows the stack because kref_put makes a nested fn
628 * call (it looks like recursion, with free_profile calling
629 * free_profile) for each profile in the chain lp#1056078.
631 for (p = profile->replacedby; p; ) {
632 if (atomic_dec_and_test(&p->base.count.refcount)) {
633 /* no more refs on p, grab its replacedby */
634 struct aa_profile *next = p->replacedby;
635 /* break the chain */
636 p->replacedby = NULL;
637 /* now free p, chain is broken */
640 /* follow up with next profile in the chain */
650 * aa_free_profile_rcu - free aa_profile by rcu (called by aa_free_profile_kref)
651 * @head: rcu_head callback for freeing of a profile (NOT NULL)
653 static void aa_free_profile_rcu(struct rcu_head *head)
655 struct aa_profile *p = container_of(head, struct aa_profile, base.rcu);
660 * aa_free_profile_kref - free aa_profile by kref (called by aa_put_profile)
661 * @kr: kref callback for freeing of a profile (NOT NULL)
663 void aa_free_profile_kref(struct kref *kref)
665 struct aa_profile *p = container_of(kref, struct aa_profile,
667 call_rcu(&p->base.rcu, aa_free_profile_rcu);
671 * aa_alloc_profile - allocate, initialize and return a new profile
672 * @hname: name of the profile (NOT NULL)
674 * Returns: refcount profile or NULL on failure
676 struct aa_profile *aa_alloc_profile(const char *hname)
678 struct aa_profile *profile;
680 /* freed by free_profile - usually through aa_put_profile */
681 profile = kzalloc(sizeof(*profile), GFP_KERNEL);
685 if (!policy_init(&profile->base, NULL, hname)) {
690 /* refcount released by caller */
695 * aa_new_null_profile - create a new null-X learning profile
696 * @parent: profile that caused this profile to be created (NOT NULL)
697 * @hat: true if the null- learning profile is a hat
699 * Create a null- complain mode profile used in learning mode. The name of
700 * the profile is unique and follows the format of parent//null-<uniq>.
702 * null profiles are added to the profile list but the list does not
703 * hold a count on them so that they are automatically released when
706 * Returns: new refcounted profile else NULL on failure
708 struct aa_profile *aa_new_null_profile(struct aa_profile *parent, int hat)
710 struct aa_profile *profile = NULL;
712 int uniq = atomic_inc_return(&parent->ns->uniq_null);
715 name = kmalloc(strlen(parent->base.hname) + 2 + 7 + 8, GFP_KERNEL);
718 sprintf(name, "%s//null-%x", parent->base.hname, uniq);
720 profile = aa_alloc_profile(name);
725 profile->mode = APPARMOR_COMPLAIN;
726 profile->flags = PFLAG_NULL;
728 profile->flags |= PFLAG_HAT;
730 /* released on free_profile */
731 rcu_assign_pointer(profile->parent, aa_get_profile(parent));
732 profile->ns = aa_get_namespace(parent->ns);
734 mutex_lock(&profile->ns->lock);
735 __list_add_profile(&parent->base.profiles, profile);
736 mutex_unlock(&profile->ns->lock);
738 /* refcount released by caller */
745 /* TODO: profile accounting - setup in remove */
748 * __find_child - find a profile on @head list with a name matching @name
749 * @head: list to search (NOT NULL)
750 * @name: name of profile (NOT NULL)
752 * Requires: rcu_read_lock be held
754 * Returns: unrefcounted profile ptr, or NULL if not found
756 static struct aa_profile *__find_child(struct list_head *head, const char *name)
758 return (struct aa_profile *)__policy_find(head, name);
762 * __strn_find_child - find a profile on @head list using substring of @name
763 * @head: list to search (NOT NULL)
764 * @name: name of profile (NOT NULL)
765 * @len: length of @name substring to match
767 * Requires: rcu_read_lock be held
769 * Returns: unrefcounted profile ptr, or NULL if not found
771 static struct aa_profile *__strn_find_child(struct list_head *head,
772 const char *name, int len)
774 return (struct aa_profile *)__policy_strn_find(head, name, len);
778 * aa_find_child - find a profile by @name in @parent
779 * @parent: profile to search (NOT NULL)
780 * @name: profile name to search for (NOT NULL)
782 * Returns: a refcounted profile or NULL if not found
784 struct aa_profile *aa_find_child(struct aa_profile *parent, const char *name)
786 struct aa_profile *profile;
789 profile = aa_get_profile(__find_child(&parent->base.profiles, name));
792 /* refcount released by caller */
797 * __lookup_parent - lookup the parent of a profile of name @hname
798 * @ns: namespace to lookup profile in (NOT NULL)
799 * @hname: hierarchical profile name to find parent of (NOT NULL)
801 * Lookups up the parent of a fully qualified profile name, the profile
802 * that matches hname does not need to exist, in general this
803 * is used to load a new profile.
805 * Requires: rcu_read_lock be held
807 * Returns: unrefcounted policy or NULL if not found
809 static struct aa_policy *__lookup_parent(struct aa_namespace *ns,
812 struct aa_policy *policy;
813 struct aa_profile *profile = NULL;
818 for (split = strstr(hname, "//"); split;) {
819 profile = __strn_find_child(&policy->profiles, hname,
823 policy = &profile->base;
825 split = strstr(hname, "//");
829 return &profile->base;
833 * __lookup_profile - lookup the profile matching @hname
834 * @base: base list to start looking up profile name from (NOT NULL)
835 * @hname: hierarchical profile name (NOT NULL)
837 * Requires: rcu_read_lock be held
839 * Returns: unrefcounted profile pointer or NULL if not found
841 * Do a relative name lookup, recursing through profile tree.
843 static struct aa_profile *__lookup_profile(struct aa_policy *base,
846 struct aa_profile *profile = NULL;
849 for (split = strstr(hname, "//"); split;) {
850 profile = __strn_find_child(&base->profiles, hname,
855 base = &profile->base;
857 split = strstr(hname, "//");
860 profile = __find_child(&base->profiles, hname);
866 * aa_lookup_profile - find a profile by its full or partial name
867 * @ns: the namespace to start from (NOT NULL)
868 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
870 * Returns: refcounted profile or NULL if not found
872 struct aa_profile *aa_lookup_profile(struct aa_namespace *ns, const char *hname)
874 struct aa_profile *profile;
878 profile = __lookup_profile(&ns->base, hname);
879 } while (profile && !aa_get_profile_not0(profile));
882 /* the unconfined profile is not in the regular profile list */
883 if (!profile && strcmp(hname, "unconfined") == 0)
884 profile = aa_get_profile(ns->unconfined);
886 /* refcount released by caller */
891 * replacement_allowed - test to see if replacement is allowed
892 * @profile: profile to test if it can be replaced (MAYBE NULL)
893 * @noreplace: true if replacement shouldn't be allowed but addition is okay
894 * @info: Returns - info about why replacement failed (NOT NULL)
896 * Returns: %0 if replacement allowed else error code
898 static int replacement_allowed(struct aa_profile *profile, int noreplace,
902 if (profile->flags & PFLAG_IMMUTABLE) {
903 *info = "cannot replace immutible profile";
905 } else if (noreplace) {
906 *info = "profile already exists";
914 * aa_audit_policy - Do auditing of policy changes
915 * @op: policy operation being performed
916 * @gfp: memory allocation flags
917 * @name: name of profile being manipulated (NOT NULL)
918 * @info: any extra information to be audited (MAYBE NULL)
921 * Returns: the error to be returned after audit is done
923 static int audit_policy(int op, gfp_t gfp, const char *name, const char *info,
926 struct common_audit_data sa;
927 struct apparmor_audit_data aad = {0,};
928 sa.type = LSM_AUDIT_DATA_NONE;
935 return aa_audit(AUDIT_APPARMOR_STATUS, __aa_current_profile(), gfp,
940 * aa_may_manage_policy - can the current task manage policy
941 * @op: the policy manipulation operation being done
943 * Returns: true if the task is allowed to manipulate policy
945 bool aa_may_manage_policy(int op)
947 /* check if loading policy is locked out */
948 if (aa_g_lock_policy) {
949 audit_policy(op, GFP_KERNEL, NULL, "policy_locked", -EACCES);
953 if (!capable(CAP_MAC_ADMIN)) {
954 audit_policy(op, GFP_KERNEL, NULL, "not policy admin", -EACCES);
961 static struct aa_profile *__list_lookup_parent(struct list_head *lh,
962 struct aa_profile *profile)
964 const char *base = hname_tail(profile->base.hname);
965 long len = base - profile->base.hname;
966 struct aa_load_ent *ent;
968 /* parent won't have trailing // so remove from len */
973 list_for_each_entry(ent, lh, list) {
974 if (ent->new == profile)
976 if (strncmp(ent->new->base.hname, profile->base.hname, len) ==
977 0 && ent->new->base.hname[len] == 0)
985 * __replace_profile - replace @old with @new on a list
986 * @old: profile to be replaced (NOT NULL)
987 * @new: profile to replace @old with (NOT NULL)
989 * Will duplicate and refcount elements that @new inherits from @old
990 * and will inherit @old children.
992 * refcount @new for list, put @old list refcount
994 * Requires: namespace list lock be held, or list not be shared
996 static void __replace_profile(struct aa_profile *old, struct aa_profile *new)
998 struct aa_profile *child, *tmp;
1000 if (!list_empty(&old->base.profiles)) {
1002 list_splice_init_rcu(&old->base.profiles, &lh, synchronize_rcu);
1004 list_for_each_entry_safe(child, tmp, &lh, base.list) {
1005 struct aa_profile *p;
1007 list_del_init(&child->base.list);
1008 p = __find_child(&new->base.profiles, child->base.name);
1010 /* @p replaces @child */
1011 __replace_profile(child, p);
1015 /* inherit @child and its children */
1016 /* TODO: update hname of inherited children */
1017 /* list refcount transferred to @new */
1018 p = rcu_dereference_protected(child->parent,
1019 mutex_is_locked(&child->ns->lock));
1020 rcu_assign_pointer(child->parent, aa_get_profile(new));
1021 list_add_rcu(&child->base.list, &new->base.profiles);
1026 if (!rcu_access_pointer(new->parent)) {
1027 struct aa_profile *parent = rcu_dereference(old->parent);
1028 rcu_assign_pointer(new->parent, aa_get_profile(parent));
1030 /* released by free_profile */
1031 old->replacedby = aa_get_profile(new);
1033 if (list_empty(&new->base.list)) {
1034 /* new is not on a list already */
1035 list_replace_rcu(&old->base.list, &new->base.list);
1036 aa_get_profile(new);
1037 aa_put_profile(old);
1039 __list_remove_profile(old);
1043 * __lookup_replace - lookup replacement information for a profile
1044 * @ns - namespace the lookup occurs in
1045 * @hname - name of profile to lookup
1046 * @noreplace - true if not replacing an existing profile
1047 * @p - Returns: profile to be replaced
1048 * @info - Returns: info string on why lookup failed
1050 * Returns: profile to replace (no ref) on success else ptr error
1052 static int __lookup_replace(struct aa_namespace *ns, const char *hname,
1053 bool noreplace, struct aa_profile **p,
1056 *p = aa_get_profile(__lookup_profile(&ns->base, hname));
1058 int error = replacement_allowed(*p, noreplace, info);
1060 *info = "profile can not be replaced";
1069 * aa_replace_profiles - replace profile(s) on the profile list
1070 * @udata: serialized data stream (NOT NULL)
1071 * @size: size of the serialized data stream
1072 * @noreplace: true if only doing addition, no replacement allowed
1074 * unpack and replace a profile on the profile list and uses of that profile
1075 * by any aa_task_cxt. If the profile does not exist on the profile list
1078 * Returns: size of data consumed else error code on failure.
1080 ssize_t aa_replace_profiles(void *udata, size_t size, bool noreplace)
1082 const char *ns_name, *name = NULL, *info = NULL;
1083 struct aa_namespace *ns = NULL;
1084 struct aa_load_ent *ent, *tmp;
1085 int op = OP_PROF_REPL;
1089 /* released below */
1090 error = aa_unpack(udata, size, &lh, &ns_name);
1094 /* released below */
1095 ns = aa_prepare_namespace(ns_name);
1097 info = "failed to prepare namespace";
1103 mutex_lock(&ns->lock);
1104 /* setup parent and ns info */
1105 list_for_each_entry(ent, &lh, list) {
1106 struct aa_policy *policy;
1108 name = ent->new->base.hname;
1109 error = __lookup_replace(ns, ent->new->base.hname, noreplace,
1114 if (ent->new->rename) {
1115 error = __lookup_replace(ns, ent->new->rename,
1116 noreplace, &ent->rename,
1122 /* released when @new is freed */
1123 ent->new->ns = aa_get_namespace(ns);
1125 if (ent->old || ent->rename)
1128 /* no ref on policy only use inside lock */
1129 policy = __lookup_parent(ns, ent->new->base.hname);
1131 struct aa_profile *p;
1132 p = __list_lookup_parent(&lh, ent->new);
1135 info = "parent does not exist";
1136 name = ent->new->base.hname;
1139 rcu_assign_pointer(ent->new->parent, aa_get_profile(p));
1140 } else if (policy != &ns->base) {
1141 /* released on profile replacement or free_profile */
1142 struct aa_profile *p = (struct aa_profile *) policy;
1143 rcu_assign_pointer(ent->new->parent, aa_get_profile(p));
1147 /* do actual replacement */
1148 list_for_each_entry_safe(ent, tmp, &lh, list) {
1149 list_del_init(&ent->list);
1150 op = (!ent->old && !ent->rename) ? OP_PROF_LOAD : OP_PROF_REPL;
1152 audit_policy(op, GFP_ATOMIC, ent->new->base.name, NULL, error);
1155 __replace_profile(ent->old, ent->new);
1157 __replace_profile(ent->rename, ent->new);
1158 } else if (ent->rename) {
1159 __replace_profile(ent->rename, ent->new);
1160 } else if (ent->new->parent) {
1161 struct aa_profile *parent, *newest;
1162 parent = rcu_dereference_protected(ent->new->parent,
1163 mutex_is_locked(&ns->lock));
1164 newest = aa_newest_version(parent);
1166 /* parent replaced in this atomic set? */
1167 if (newest != parent) {
1168 aa_get_profile(newest);
1169 aa_put_profile(parent);
1170 rcu_assign_pointer(ent->new->parent, newest);
1172 __list_add_profile(&parent->base.profiles, ent->new);
1174 __list_add_profile(&ns->base.profiles, ent->new);
1176 aa_load_ent_free(ent);
1178 mutex_unlock(&ns->lock);
1181 aa_put_namespace(ns);
1188 mutex_unlock(&ns->lock);
1190 error = audit_policy(op, GFP_KERNEL, name, info, error);
1192 list_for_each_entry_safe(ent, tmp, &lh, list) {
1193 list_del_init(&ent->list);
1194 aa_load_ent_free(ent);
1201 * aa_remove_profiles - remove profile(s) from the system
1202 * @fqname: name of the profile or namespace to remove (NOT NULL)
1203 * @size: size of the name
1205 * Remove a profile or sub namespace from the current namespace, so that
1206 * they can not be found anymore and mark them as replaced by unconfined
1208 * NOTE: removing confinement does not restore rlimits to preconfinemnet values
1210 * Returns: size of data consume else error code if fails
1212 ssize_t aa_remove_profiles(char *fqname, size_t size)
1214 struct aa_namespace *root, *ns = NULL;
1215 struct aa_profile *profile = NULL;
1216 const char *name = fqname, *info = NULL;
1220 info = "no profile specified";
1225 root = aa_current_profile()->ns;
1227 if (fqname[0] == ':') {
1229 name = aa_split_fqname(fqname, &ns_name);
1230 /* released below */
1231 ns = aa_find_namespace(root, ns_name);
1233 info = "namespace does not exist";
1238 /* released below */
1239 ns = aa_get_namespace(root);
1242 /* remove namespace - can only happen if fqname[0] == ':' */
1243 mutex_lock(&ns->parent->lock);
1244 __remove_namespace(ns);
1245 mutex_unlock(&ns->parent->lock);
1247 /* remove profile */
1248 mutex_lock(&ns->lock);
1249 profile = aa_get_profile(__lookup_profile(&ns->base, name));
1252 info = "profile does not exist";
1255 name = profile->base.hname;
1256 __remove_profile(profile);
1257 mutex_unlock(&ns->lock);
1260 /* don't fail removal if audit fails */
1261 (void) audit_policy(OP_PROF_RM, GFP_KERNEL, name, info, error);
1262 aa_put_namespace(ns);
1263 aa_put_profile(profile);
1267 mutex_unlock(&ns->lock);
1268 aa_put_namespace(ns);
1271 (void) audit_policy(OP_PROF_RM, GFP_KERNEL, name, info, error);