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 __aa_update_replacedby(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 static void free_replacedby(struct aa_replacedby
*r
)
595 aa_put_profile(rcu_dereference(r
->profile
));
601 void aa_free_replacedby_kref(struct kref
*kref
)
603 struct aa_replacedby
*r
= container_of(kref
, struct aa_replacedby
,
609 * free_profile - free a profile
610 * @profile: the profile to free (MAYBE NULL)
612 * Free a profile, its hats and null_profile. All references to the profile,
613 * its hats and null_profile must have been put.
615 * If the profile was referenced from a task context, free_profile() will
616 * be called from an rcu callback routine, so we must not sleep here.
618 static void free_profile(struct aa_profile
*profile
)
620 AA_DEBUG("%s(%p)\n", __func__
, profile
);
625 /* free children profiles */
626 policy_destroy(&profile
->base
);
627 aa_put_profile(rcu_access_pointer(profile
->parent
));
629 aa_put_namespace(profile
->ns
);
630 kzfree(profile
->rename
);
632 aa_free_file_rules(&profile
->file
);
633 aa_free_cap_rules(&profile
->caps
);
634 aa_free_rlimit_rules(&profile
->rlimits
);
636 aa_put_dfa(profile
->xmatch
);
637 aa_put_dfa(profile
->policy
.dfa
);
638 aa_put_replacedby(profile
->replacedby
);
644 * aa_free_profile_rcu - free aa_profile by rcu (called by aa_free_profile_kref)
645 * @head: rcu_head callback for freeing of a profile (NOT NULL)
647 static void aa_free_profile_rcu(struct rcu_head
*head
)
649 struct aa_profile
*p
= container_of(head
, struct aa_profile
, base
.rcu
);
654 * aa_free_profile_kref - free aa_profile by kref (called by aa_put_profile)
655 * @kr: kref callback for freeing of a profile (NOT NULL)
657 void aa_free_profile_kref(struct kref
*kref
)
659 struct aa_profile
*p
= container_of(kref
, struct aa_profile
,
661 call_rcu(&p
->base
.rcu
, aa_free_profile_rcu
);
665 * aa_alloc_profile - allocate, initialize and return a new profile
666 * @hname: name of the profile (NOT NULL)
668 * Returns: refcount profile or NULL on failure
670 struct aa_profile
*aa_alloc_profile(const char *hname
)
672 struct aa_profile
*profile
;
674 /* freed by free_profile - usually through aa_put_profile */
675 profile
= kzalloc(sizeof(*profile
), GFP_KERNEL
);
679 profile
->replacedby
= kzalloc(sizeof(struct aa_replacedby
), GFP_KERNEL
);
680 if (!profile
->replacedby
)
682 kref_init(&profile
->replacedby
->count
);
684 if (!policy_init(&profile
->base
, NULL
, hname
))
687 /* refcount released by caller */
691 kzfree(profile
->replacedby
);
698 * aa_new_null_profile - create a new null-X learning profile
699 * @parent: profile that caused this profile to be created (NOT NULL)
700 * @hat: true if the null- learning profile is a hat
702 * Create a null- complain mode profile used in learning mode. The name of
703 * the profile is unique and follows the format of parent//null-<uniq>.
705 * null profiles are added to the profile list but the list does not
706 * hold a count on them so that they are automatically released when
709 * Returns: new refcounted profile else NULL on failure
711 struct aa_profile
*aa_new_null_profile(struct aa_profile
*parent
, int hat
)
713 struct aa_profile
*profile
= NULL
;
715 int uniq
= atomic_inc_return(&parent
->ns
->uniq_null
);
718 name
= kmalloc(strlen(parent
->base
.hname
) + 2 + 7 + 8, GFP_KERNEL
);
721 sprintf(name
, "%s//null-%x", parent
->base
.hname
, uniq
);
723 profile
= aa_alloc_profile(name
);
728 profile
->mode
= APPARMOR_COMPLAIN
;
729 profile
->flags
= PFLAG_NULL
;
731 profile
->flags
|= PFLAG_HAT
;
733 /* released on free_profile */
734 rcu_assign_pointer(profile
->parent
, aa_get_profile(parent
));
735 profile
->ns
= aa_get_namespace(parent
->ns
);
737 mutex_lock(&profile
->ns
->lock
);
738 __list_add_profile(&parent
->base
.profiles
, profile
);
739 mutex_unlock(&profile
->ns
->lock
);
741 /* refcount released by caller */
748 /* TODO: profile accounting - setup in remove */
751 * __find_child - find a profile on @head list with a name matching @name
752 * @head: list to search (NOT NULL)
753 * @name: name of profile (NOT NULL)
755 * Requires: rcu_read_lock be held
757 * Returns: unrefcounted profile ptr, or NULL if not found
759 static struct aa_profile
*__find_child(struct list_head
*head
, const char *name
)
761 return (struct aa_profile
*)__policy_find(head
, name
);
765 * __strn_find_child - find a profile on @head list using substring of @name
766 * @head: list to search (NOT NULL)
767 * @name: name of profile (NOT NULL)
768 * @len: length of @name substring to match
770 * Requires: rcu_read_lock be held
772 * Returns: unrefcounted profile ptr, or NULL if not found
774 static struct aa_profile
*__strn_find_child(struct list_head
*head
,
775 const char *name
, int len
)
777 return (struct aa_profile
*)__policy_strn_find(head
, name
, len
);
781 * aa_find_child - find a profile by @name in @parent
782 * @parent: profile to search (NOT NULL)
783 * @name: profile name to search for (NOT NULL)
785 * Returns: a refcounted profile or NULL if not found
787 struct aa_profile
*aa_find_child(struct aa_profile
*parent
, const char *name
)
789 struct aa_profile
*profile
;
792 profile
= aa_get_profile(__find_child(&parent
->base
.profiles
, name
));
795 /* refcount released by caller */
800 * __lookup_parent - lookup the parent of a profile of name @hname
801 * @ns: namespace to lookup profile in (NOT NULL)
802 * @hname: hierarchical profile name to find parent of (NOT NULL)
804 * Lookups up the parent of a fully qualified profile name, the profile
805 * that matches hname does not need to exist, in general this
806 * is used to load a new profile.
808 * Requires: rcu_read_lock be held
810 * Returns: unrefcounted policy or NULL if not found
812 static struct aa_policy
*__lookup_parent(struct aa_namespace
*ns
,
815 struct aa_policy
*policy
;
816 struct aa_profile
*profile
= NULL
;
821 for (split
= strstr(hname
, "//"); split
;) {
822 profile
= __strn_find_child(&policy
->profiles
, hname
,
826 policy
= &profile
->base
;
828 split
= strstr(hname
, "//");
832 return &profile
->base
;
836 * __lookup_profile - lookup the profile matching @hname
837 * @base: base list to start looking up profile name from (NOT NULL)
838 * @hname: hierarchical profile name (NOT NULL)
840 * Requires: rcu_read_lock be held
842 * Returns: unrefcounted profile pointer or NULL if not found
844 * Do a relative name lookup, recursing through profile tree.
846 static struct aa_profile
*__lookup_profile(struct aa_policy
*base
,
849 struct aa_profile
*profile
= NULL
;
852 for (split
= strstr(hname
, "//"); split
;) {
853 profile
= __strn_find_child(&base
->profiles
, hname
,
858 base
= &profile
->base
;
860 split
= strstr(hname
, "//");
863 profile
= __find_child(&base
->profiles
, hname
);
869 * aa_lookup_profile - find a profile by its full or partial name
870 * @ns: the namespace to start from (NOT NULL)
871 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
873 * Returns: refcounted profile or NULL if not found
875 struct aa_profile
*aa_lookup_profile(struct aa_namespace
*ns
, const char *hname
)
877 struct aa_profile
*profile
;
881 profile
= __lookup_profile(&ns
->base
, hname
);
882 } while (profile
&& !aa_get_profile_not0(profile
));
885 /* the unconfined profile is not in the regular profile list */
886 if (!profile
&& strcmp(hname
, "unconfined") == 0)
887 profile
= aa_get_profile(ns
->unconfined
);
889 /* refcount released by caller */
894 * replacement_allowed - test to see if replacement is allowed
895 * @profile: profile to test if it can be replaced (MAYBE NULL)
896 * @noreplace: true if replacement shouldn't be allowed but addition is okay
897 * @info: Returns - info about why replacement failed (NOT NULL)
899 * Returns: %0 if replacement allowed else error code
901 static int replacement_allowed(struct aa_profile
*profile
, int noreplace
,
905 if (profile
->flags
& PFLAG_IMMUTABLE
) {
906 *info
= "cannot replace immutible profile";
908 } else if (noreplace
) {
909 *info
= "profile already exists";
917 * aa_audit_policy - Do auditing of policy changes
918 * @op: policy operation being performed
919 * @gfp: memory allocation flags
920 * @name: name of profile being manipulated (NOT NULL)
921 * @info: any extra information to be audited (MAYBE NULL)
924 * Returns: the error to be returned after audit is done
926 static int audit_policy(int op
, gfp_t gfp
, const char *name
, const char *info
,
929 struct common_audit_data sa
;
930 struct apparmor_audit_data aad
= {0,};
931 sa
.type
= LSM_AUDIT_DATA_NONE
;
938 return aa_audit(AUDIT_APPARMOR_STATUS
, __aa_current_profile(), gfp
,
943 * aa_may_manage_policy - can the current task manage policy
944 * @op: the policy manipulation operation being done
946 * Returns: true if the task is allowed to manipulate policy
948 bool aa_may_manage_policy(int op
)
950 /* check if loading policy is locked out */
951 if (aa_g_lock_policy
) {
952 audit_policy(op
, GFP_KERNEL
, NULL
, "policy_locked", -EACCES
);
956 if (!capable(CAP_MAC_ADMIN
)) {
957 audit_policy(op
, GFP_KERNEL
, NULL
, "not policy admin", -EACCES
);
964 static struct aa_profile
*__list_lookup_parent(struct list_head
*lh
,
965 struct aa_profile
*profile
)
967 const char *base
= hname_tail(profile
->base
.hname
);
968 long len
= base
- profile
->base
.hname
;
969 struct aa_load_ent
*ent
;
971 /* parent won't have trailing // so remove from len */
976 list_for_each_entry(ent
, lh
, list
) {
977 if (ent
->new == profile
)
979 if (strncmp(ent
->new->base
.hname
, profile
->base
.hname
, len
) ==
980 0 && ent
->new->base
.hname
[len
] == 0)
988 * __replace_profile - replace @old with @new on a list
989 * @old: profile to be replaced (NOT NULL)
990 * @new: profile to replace @old with (NOT NULL)
991 * @share_replacedby: transfer @old->replacedby to @new
993 * Will duplicate and refcount elements that @new inherits from @old
994 * and will inherit @old children.
996 * refcount @new for list, put @old list refcount
998 * Requires: namespace list lock be held, or list not be shared
1000 static void __replace_profile(struct aa_profile
*old
, struct aa_profile
*new,
1001 bool share_replacedby
)
1003 struct aa_profile
*child
, *tmp
;
1005 if (!list_empty(&old
->base
.profiles
)) {
1007 list_splice_init_rcu(&old
->base
.profiles
, &lh
, synchronize_rcu
);
1009 list_for_each_entry_safe(child
, tmp
, &lh
, base
.list
) {
1010 struct aa_profile
*p
;
1012 list_del_init(&child
->base
.list
);
1013 p
= __find_child(&new->base
.profiles
, child
->base
.name
);
1015 /* @p replaces @child */
1016 __replace_profile(child
, p
, share_replacedby
);
1020 /* inherit @child and its children */
1021 /* TODO: update hname of inherited children */
1022 /* list refcount transferred to @new */
1023 p
= rcu_dereference_protected(child
->parent
,
1024 mutex_is_locked(&child
->ns
->lock
));
1025 rcu_assign_pointer(child
->parent
, aa_get_profile(new));
1026 list_add_rcu(&child
->base
.list
, &new->base
.profiles
);
1031 if (!rcu_access_pointer(new->parent
)) {
1032 struct aa_profile
*parent
= rcu_dereference(old
->parent
);
1033 rcu_assign_pointer(new->parent
, aa_get_profile(parent
));
1035 __aa_update_replacedby(old
, new);
1036 if (share_replacedby
) {
1037 aa_put_replacedby(new->replacedby
);
1038 new->replacedby
= aa_get_replacedby(old
->replacedby
);
1041 if (list_empty(&new->base
.list
)) {
1042 /* new is not on a list already */
1043 list_replace_rcu(&old
->base
.list
, &new->base
.list
);
1044 aa_get_profile(new);
1045 aa_put_profile(old
);
1047 __list_remove_profile(old
);
1051 * __lookup_replace - lookup replacement information for a profile
1052 * @ns - namespace the lookup occurs in
1053 * @hname - name of profile to lookup
1054 * @noreplace - true if not replacing an existing profile
1055 * @p - Returns: profile to be replaced
1056 * @info - Returns: info string on why lookup failed
1058 * Returns: profile to replace (no ref) on success else ptr error
1060 static int __lookup_replace(struct aa_namespace
*ns
, const char *hname
,
1061 bool noreplace
, struct aa_profile
**p
,
1064 *p
= aa_get_profile(__lookup_profile(&ns
->base
, hname
));
1066 int error
= replacement_allowed(*p
, noreplace
, info
);
1068 *info
= "profile can not be replaced";
1077 * aa_replace_profiles - replace profile(s) on the profile list
1078 * @udata: serialized data stream (NOT NULL)
1079 * @size: size of the serialized data stream
1080 * @noreplace: true if only doing addition, no replacement allowed
1082 * unpack and replace a profile on the profile list and uses of that profile
1083 * by any aa_task_cxt. If the profile does not exist on the profile list
1086 * Returns: size of data consumed else error code on failure.
1088 ssize_t
aa_replace_profiles(void *udata
, size_t size
, bool noreplace
)
1090 const char *ns_name
, *name
= NULL
, *info
= NULL
;
1091 struct aa_namespace
*ns
= NULL
;
1092 struct aa_load_ent
*ent
, *tmp
;
1093 int op
= OP_PROF_REPL
;
1097 /* released below */
1098 error
= aa_unpack(udata
, size
, &lh
, &ns_name
);
1102 /* released below */
1103 ns
= aa_prepare_namespace(ns_name
);
1105 info
= "failed to prepare namespace";
1111 mutex_lock(&ns
->lock
);
1112 /* setup parent and ns info */
1113 list_for_each_entry(ent
, &lh
, list
) {
1114 struct aa_policy
*policy
;
1116 name
= ent
->new->base
.hname
;
1117 error
= __lookup_replace(ns
, ent
->new->base
.hname
, noreplace
,
1122 if (ent
->new->rename
) {
1123 error
= __lookup_replace(ns
, ent
->new->rename
,
1124 noreplace
, &ent
->rename
,
1130 /* released when @new is freed */
1131 ent
->new->ns
= aa_get_namespace(ns
);
1133 if (ent
->old
|| ent
->rename
)
1136 /* no ref on policy only use inside lock */
1137 policy
= __lookup_parent(ns
, ent
->new->base
.hname
);
1139 struct aa_profile
*p
;
1140 p
= __list_lookup_parent(&lh
, ent
->new);
1143 info
= "parent does not exist";
1144 name
= ent
->new->base
.hname
;
1147 rcu_assign_pointer(ent
->new->parent
, aa_get_profile(p
));
1148 } else if (policy
!= &ns
->base
) {
1149 /* released on profile replacement or free_profile */
1150 struct aa_profile
*p
= (struct aa_profile
*) policy
;
1151 rcu_assign_pointer(ent
->new->parent
, aa_get_profile(p
));
1155 /* do actual replacement */
1156 list_for_each_entry_safe(ent
, tmp
, &lh
, list
) {
1157 list_del_init(&ent
->list
);
1158 op
= (!ent
->old
&& !ent
->rename
) ? OP_PROF_LOAD
: OP_PROF_REPL
;
1160 audit_policy(op
, GFP_ATOMIC
, ent
->new->base
.name
, NULL
, error
);
1163 __replace_profile(ent
->old
, ent
->new, 1);
1165 __replace_profile(ent
->rename
, ent
->new, 0);
1166 } else if (ent
->rename
) {
1167 __replace_profile(ent
->rename
, ent
->new, 0);
1168 } else if (ent
->new->parent
) {
1169 struct aa_profile
*parent
, *newest
;
1170 parent
= rcu_dereference_protected(ent
->new->parent
,
1171 mutex_is_locked(&ns
->lock
));
1172 newest
= aa_get_newest_profile(parent
);
1174 /* parent replaced in this atomic set? */
1175 if (newest
!= parent
) {
1176 aa_get_profile(newest
);
1177 aa_put_profile(parent
);
1178 rcu_assign_pointer(ent
->new->parent
, newest
);
1180 aa_put_profile(newest
);
1181 __list_add_profile(&parent
->base
.profiles
, ent
->new);
1183 __list_add_profile(&ns
->base
.profiles
, ent
->new);
1185 aa_load_ent_free(ent
);
1187 mutex_unlock(&ns
->lock
);
1190 aa_put_namespace(ns
);
1197 mutex_unlock(&ns
->lock
);
1199 error
= audit_policy(op
, GFP_KERNEL
, name
, info
, error
);
1201 list_for_each_entry_safe(ent
, tmp
, &lh
, list
) {
1202 list_del_init(&ent
->list
);
1203 aa_load_ent_free(ent
);
1210 * aa_remove_profiles - remove profile(s) from the system
1211 * @fqname: name of the profile or namespace to remove (NOT NULL)
1212 * @size: size of the name
1214 * Remove a profile or sub namespace from the current namespace, so that
1215 * they can not be found anymore and mark them as replaced by unconfined
1217 * NOTE: removing confinement does not restore rlimits to preconfinemnet values
1219 * Returns: size of data consume else error code if fails
1221 ssize_t
aa_remove_profiles(char *fqname
, size_t size
)
1223 struct aa_namespace
*root
, *ns
= NULL
;
1224 struct aa_profile
*profile
= NULL
;
1225 const char *name
= fqname
, *info
= NULL
;
1229 info
= "no profile specified";
1234 root
= aa_current_profile()->ns
;
1236 if (fqname
[0] == ':') {
1238 name
= aa_split_fqname(fqname
, &ns_name
);
1239 /* released below */
1240 ns
= aa_find_namespace(root
, ns_name
);
1242 info
= "namespace does not exist";
1247 /* released below */
1248 ns
= aa_get_namespace(root
);
1251 /* remove namespace - can only happen if fqname[0] == ':' */
1252 mutex_lock(&ns
->parent
->lock
);
1253 __remove_namespace(ns
);
1254 mutex_unlock(&ns
->parent
->lock
);
1256 /* remove profile */
1257 mutex_lock(&ns
->lock
);
1258 profile
= aa_get_profile(__lookup_profile(&ns
->base
, name
));
1261 info
= "profile does not exist";
1264 name
= profile
->base
.hname
;
1265 __remove_profile(profile
);
1266 mutex_unlock(&ns
->lock
);
1269 /* don't fail removal if audit fails */
1270 (void) audit_policy(OP_PROF_RM
, GFP_KERNEL
, name
, info
, error
);
1271 aa_put_namespace(ns
);
1272 aa_put_profile(profile
);
1276 mutex_unlock(&ns
->lock
);
1277 aa_put_namespace(ns
);
1280 (void) audit_policy(OP_PROF_RM
, GFP_KERNEL
, name
, info
, error
);
This page took 0.059044 seconds and 5 git commands to generate.