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>
79 #include <linux/cred.h>
80 #include <linux/rculist.h>
81 #include <linux/user_namespace.h>
83 #include "include/apparmor.h"
84 #include "include/capability.h"
85 #include "include/context.h"
86 #include "include/file.h"
87 #include "include/ipc.h"
88 #include "include/match.h"
89 #include "include/path.h"
90 #include "include/policy.h"
91 #include "include/policy_ns.h"
92 #include "include/policy_unpack.h"
93 #include "include/resource.h"
95 int unprivileged_userns_apparmor_policy
= 1;
97 const char *const aa_profile_mode_names
[] = {
106 * __add_profile - add a profiles to list and label tree
107 * @list: list to add it to (NOT NULL)
108 * @profile: the profile to add (NOT NULL)
110 * refcount @profile, should be put by __list_remove_profile
112 * Requires: namespace lock be held, or list not be shared
114 static void __add_profile(struct list_head
*list
, struct aa_profile
*profile
)
120 AA_BUG(!profile
->ns
);
121 AA_BUG(!mutex_is_locked(&profile
->ns
->lock
));
123 list_add_rcu(&profile
->base
.list
, list
);
124 /* get list reference */
125 aa_get_profile(profile
);
126 l
= aa_label_insert(&profile
->ns
->labels
, &profile
->label
);
127 AA_BUG(l
!= &profile
->label
);
132 * __list_remove_profile - remove a profile from the list it is on
133 * @profile: the profile to remove (NOT NULL)
135 * remove a profile from the list, warning generally removal should
136 * be done with __replace_profile as most profile removals are
137 * replacements to the unconfined profile.
139 * put @profile list refcount
141 * Requires: namespace lock be held, or list not have been live
143 static void __list_remove_profile(struct aa_profile
*profile
)
146 AA_BUG(!profile
->ns
);
147 AA_BUG(!mutex_is_locked(&profile
->ns
->lock
));
149 list_del_rcu(&profile
->base
.list
);
150 aa_put_profile(profile
);
154 * __remove_profile - remove old profile, and children
155 * @profile: profile to be replaced (NOT NULL)
157 * Requires: namespace list lock be held, or list not be shared
159 static void __remove_profile(struct aa_profile
*profile
)
162 AA_BUG(!profile
->ns
);
163 AA_BUG(!mutex_is_locked(&profile
->ns
->lock
));
165 /* release any children lists first */
166 __aa_profile_list_release(&profile
->base
.profiles
);
167 /* released by free_profile */
168 aa_label_remove(&profile
->label
);
169 __aafs_profile_rmdir(profile
);
170 __list_remove_profile(profile
);
174 * __aa_profile_list_release - remove all profiles on the list and put refs
175 * @head: list of profiles (NOT NULL)
177 * Requires: namespace lock be held
179 void __aa_profile_list_release(struct list_head
*head
)
181 struct aa_profile
*profile
, *tmp
;
182 list_for_each_entry_safe(profile
, tmp
, head
, base
.list
)
183 __remove_profile(profile
);
187 * aa_free_data - free a data blob
191 static void aa_free_data(void *ptr
, void *arg
)
193 struct aa_data
*data
= ptr
;
201 * aa_free_profile - free a profile
202 * @profile: the profile to free (MAYBE NULL)
204 * Free a profile, its hats and null_profile. All references to the profile,
205 * its hats and null_profile must have been put.
207 * If the profile was referenced from a task context, free_profile() will
208 * be called from an rcu callback routine, so we must not sleep here.
210 void aa_free_profile(struct aa_profile
*profile
)
212 struct rhashtable
*rht
;
214 AA_DEBUG("%s(%p)\n", __func__
, profile
);
219 /* free children profiles */
220 aa_policy_destroy(&profile
->base
);
221 aa_put_profile(rcu_access_pointer(profile
->parent
));
223 aa_put_ns(profile
->ns
);
224 kzfree(profile
->rename
);
226 aa_free_file_rules(&profile
->file
);
227 aa_free_cap_rules(&profile
->caps
);
228 aa_free_rlimit_rules(&profile
->rlimits
);
230 kzfree(profile
->dirname
);
231 aa_put_dfa(profile
->xmatch
);
232 aa_put_dfa(profile
->policy
.dfa
);
236 profile
->data
= NULL
;
237 rhashtable_free_and_destroy(rht
, aa_free_data
, NULL
);
241 kzfree(profile
->hash
);
242 aa_put_loaddata(profile
->rawdata
);
248 * aa_alloc_profile - allocate, initialize and return a new profile
249 * @hname: name of the profile (NOT NULL)
250 * @gfp: allocation type
252 * Returns: refcount profile or NULL on failure
254 struct aa_profile
*aa_alloc_profile(const char *hname
, struct aa_proxy
*proxy
,
257 struct aa_profile
*profile
;
259 /* freed by free_profile - usually through aa_put_profile */
260 profile
= kzalloc(sizeof(*profile
) + sizeof(struct aa_profile
*) * 2,
265 if (!aa_policy_init(&profile
->base
, NULL
, hname
, gfp
))
267 if (!aa_label_init(&profile
->label
, 1))
270 /* update being set needed by fs interface */
272 proxy
= aa_alloc_proxy(&profile
->label
, gfp
);
277 profile
->label
.proxy
= proxy
;
279 profile
->label
.hname
= profile
->base
.hname
;
280 profile
->label
.flags
|= FLAG_PROFILE
;
281 profile
->label
.vec
[0] = profile
;
283 /* refcount released by caller */
287 aa_free_profile(profile
);
292 /* TODO: profile accounting - setup in remove */
295 * __strn_find_child - find a profile on @head list using substring of @name
296 * @head: list to search (NOT NULL)
297 * @name: name of profile (NOT NULL)
298 * @len: length of @name substring to match
300 * Requires: rcu_read_lock be held
302 * Returns: unrefcounted profile ptr, or NULL if not found
304 static struct aa_profile
*__strn_find_child(struct list_head
*head
,
305 const char *name
, int len
)
307 return (struct aa_profile
*)__policy_strn_find(head
, name
, len
);
311 * __find_child - find a profile on @head list with a name matching @name
312 * @head: list to search (NOT NULL)
313 * @name: name of profile (NOT NULL)
315 * Requires: rcu_read_lock be held
317 * Returns: unrefcounted profile ptr, or NULL if not found
319 static struct aa_profile
*__find_child(struct list_head
*head
, const char *name
)
321 return __strn_find_child(head
, name
, strlen(name
));
325 * aa_find_child - find a profile by @name in @parent
326 * @parent: profile to search (NOT NULL)
327 * @name: profile name to search for (NOT NULL)
329 * Returns: a refcounted profile or NULL if not found
331 struct aa_profile
*aa_find_child(struct aa_profile
*parent
, const char *name
)
333 struct aa_profile
*profile
;
337 profile
= __find_child(&parent
->base
.profiles
, name
);
338 } while (profile
&& !aa_get_profile_not0(profile
));
341 /* refcount released by caller */
346 * __lookup_parent - lookup the parent of a profile of name @hname
347 * @ns: namespace to lookup profile in (NOT NULL)
348 * @hname: hierarchical profile name to find parent of (NOT NULL)
350 * Lookups up the parent of a fully qualified profile name, the profile
351 * that matches hname does not need to exist, in general this
352 * is used to load a new profile.
354 * Requires: rcu_read_lock be held
356 * Returns: unrefcounted policy or NULL if not found
358 static struct aa_policy
*__lookup_parent(struct aa_ns
*ns
,
361 struct aa_policy
*policy
;
362 struct aa_profile
*profile
= NULL
;
367 for (split
= strstr(hname
, "//"); split
;) {
368 profile
= __strn_find_child(&policy
->profiles
, hname
,
372 policy
= &profile
->base
;
374 split
= strstr(hname
, "//");
378 return &profile
->base
;
382 * __lookupn_profile - lookup the profile matching @hname
383 * @base: base list to start looking up profile name from (NOT NULL)
384 * @hname: hierarchical profile name (NOT NULL)
385 * @n: length of @hname
387 * Requires: rcu_read_lock be held
389 * Returns: unrefcounted profile pointer or NULL if not found
391 * Do a relative name lookup, recursing through profile tree.
393 static struct aa_profile
*__lookupn_profile(struct aa_policy
*base
,
394 const char *hname
, size_t n
)
396 struct aa_profile
*profile
= NULL
;
399 for (split
= strnstr(hname
, "//", n
); split
;
400 split
= strnstr(hname
, "//", n
)) {
401 profile
= __strn_find_child(&base
->profiles
, hname
,
406 base
= &profile
->base
;
407 n
-= split
+ 2 - hname
;
412 return __strn_find_child(&base
->profiles
, hname
, n
);
416 static struct aa_profile
*__lookup_profile(struct aa_policy
*base
,
419 return __lookupn_profile(base
, hname
, strlen(hname
));
423 * aa_lookup_profile - find a profile by its full or partial name
424 * @ns: the namespace to start from (NOT NULL)
425 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
428 * Returns: refcounted profile or NULL if not found
430 struct aa_profile
*aa_lookupn_profile(struct aa_ns
*ns
, const char *hname
,
433 struct aa_profile
*profile
;
437 profile
= __lookupn_profile(&ns
->base
, hname
, n
);
438 } while (profile
&& !aa_get_profile_not0(profile
));
441 /* the unconfined profile is not in the regular profile list */
442 if (!profile
&& strncmp(hname
, "unconfined", n
) == 0)
443 profile
= aa_get_newest_profile(ns
->unconfined
);
445 /* refcount released by caller */
449 struct aa_profile
*aa_lookup_profile(struct aa_ns
*ns
, const char *hname
)
451 return aa_lookupn_profile(ns
, hname
, strlen(hname
));
454 struct aa_profile
*aa_fqlookupn_profile(struct aa_label
*base
,
455 const char *fqname
, size_t n
)
457 struct aa_profile
*profile
;
459 const char *name
, *ns_name
;
462 name
= aa_splitn_fqname(fqname
, n
, &ns_name
, &ns_len
);
464 ns
= aa_lookupn_ns(labels_ns(base
), ns_name
, ns_len
);
468 ns
= aa_get_ns(labels_ns(base
));
471 profile
= aa_lookupn_profile(ns
, name
, n
- (name
- fqname
));
473 /* default profile for ns, currently unconfined */
474 profile
= aa_get_newest_profile(ns
->unconfined
);
483 * aa_new_null_profile - create or find a null-X learning profile
484 * @parent: profile that caused this profile to be created (NOT NULL)
485 * @hat: true if the null- learning profile is a hat
486 * @base: name to base the null profile off of
487 * @gfp: type of allocation
489 * Find/Create a null- complain mode profile used in learning mode. The
490 * name of the profile is unique and follows the format of parent//null-XXX.
491 * where XXX is based on the @name or if that fails or is not supplied
494 * null profiles are added to the profile list but the list does not
495 * hold a count on them so that they are automatically released when
498 * Returns: new refcounted profile else NULL on failure
500 struct aa_profile
*aa_new_null_profile(struct aa_profile
*parent
, bool hat
,
501 const char *base
, gfp_t gfp
)
503 struct aa_profile
*p
, *profile
;
510 name
= kmalloc(strlen(parent
->base
.hname
) + 8 + strlen(base
),
513 sprintf(name
, "%s//null-%s", parent
->base
.hname
, base
);
516 /* fall through to try shorter uniq */
519 name
= kmalloc(strlen(parent
->base
.hname
) + 2 + 7 + 8, gfp
);
522 sprintf(name
, "%s//null-%x", parent
->base
.hname
,
523 atomic_inc_return(&parent
->ns
->uniq_null
));
526 /* lookup to see if this is a dup creation */
527 bname
= basename(name
);
528 profile
= aa_find_child(parent
, bname
);
532 profile
= aa_alloc_profile(name
, NULL
, gfp
);
536 profile
->mode
= APPARMOR_COMPLAIN
;
537 profile
->label
.flags
|= FLAG_NULL
;
539 profile
->label
.flags
|= FLAG_HAT
;
540 profile
->path_flags
= parent
->path_flags
;
542 /* released on free_profile */
543 rcu_assign_pointer(profile
->parent
, aa_get_profile(parent
));
544 profile
->ns
= aa_get_ns(parent
->ns
);
545 profile
->file
.dfa
= aa_get_dfa(nulldfa
);
546 profile
->policy
.dfa
= aa_get_dfa(nulldfa
);
548 mutex_lock(&profile
->ns
->lock
);
549 p
= __find_child(&parent
->base
.profiles
, bname
);
551 aa_free_profile(profile
);
552 profile
= aa_get_profile(p
);
554 __add_profile(&parent
->base
.profiles
, profile
);
556 mutex_unlock(&profile
->ns
->lock
);
558 /* refcount released by caller */
565 aa_free_profile(profile
);
570 * replacement_allowed - test to see if replacement is allowed
571 * @profile: profile to test if it can be replaced (MAYBE NULL)
572 * @noreplace: true if replacement shouldn't be allowed but addition is okay
573 * @info: Returns - info about why replacement failed (NOT NULL)
575 * Returns: %0 if replacement allowed else error code
577 static int replacement_allowed(struct aa_profile
*profile
, int noreplace
,
581 if (profile
->label
.flags
& FLAG_IMMUTIBLE
) {
582 *info
= "cannot replace immutible profile";
584 } else if (noreplace
) {
585 *info
= "profile already exists";
592 /* audit callback for net specific fields */
593 static void audit_cb(struct audit_buffer
*ab
, void *va
)
595 struct common_audit_data
*sa
= va
;
597 if (aad(sa
)->iface
.ns
) {
598 audit_log_format(ab
, " ns=");
599 audit_log_untrustedstring(ab
, aad(sa
)->iface
.ns
);
604 * audit_policy - Do auditing of policy changes
605 * @label: label to check if it can manage policy
606 * @op: policy operation being performed
607 * @ns_name: name of namespace being manipulated
608 * @name: name of profile being manipulated (NOT NULL)
609 * @info: any extra information to be audited (MAYBE NULL)
612 * Returns: the error to be returned after audit is done
614 static int audit_policy(struct aa_label
*label
, const char *op
,
615 const char *ns_name
, const char *name
,
616 const char *info
, int error
)
618 DEFINE_AUDIT_DATA(sa
, LSM_AUDIT_DATA_NONE
, op
);
620 aad(&sa
)->iface
.ns
= ns_name
;
621 aad(&sa
)->name
= name
;
622 aad(&sa
)->info
= info
;
623 aad(&sa
)->error
= error
;
624 aad(&sa
)->label
= label
;
626 aa_audit_msg(AUDIT_APPARMOR_STATUS
, &sa
, audit_cb
);
632 * policy_view_capable - check if viewing policy in at @ns is allowed
633 * ns: namespace being viewed by current task (may be NULL)
634 * Returns: true if viewing policy is allowed
636 * If @ns is NULL then the namespace being viewed is assumed to be the
637 * tasks current namespace.
639 bool policy_view_capable(struct aa_ns
*ns
)
641 struct user_namespace
*user_ns
= current_user_ns();
642 struct aa_ns
*view_ns
= aa_get_current_ns();
643 bool root_in_user_ns
= uid_eq(current_euid(), make_kuid(user_ns
, 0)) ||
644 in_egroup_p(make_kgid(user_ns
, 0));
645 bool response
= false;
649 if (root_in_user_ns
&& aa_ns_visible(view_ns
, ns
, true) &&
650 (user_ns
== &init_user_ns
||
651 (unprivileged_userns_apparmor_policy
!= 0 &&
652 user_ns
->level
== view_ns
->level
)))
659 bool policy_admin_capable(struct aa_ns
*ns
)
661 struct user_namespace
*user_ns
= current_user_ns();
662 bool capable
= ns_capable(user_ns
, CAP_MAC_ADMIN
);
664 AA_DEBUG("cap_mac_admin? %d\n", capable
);
665 AA_DEBUG("policy locked? %d\n", aa_g_lock_policy
);
667 return policy_view_capable(ns
) && capable
&& !aa_g_lock_policy
;
671 * aa_may_manage_policy - can the current task manage policy
672 * @label: label to check if it can manage policy
673 * @op: the policy manipulation operation being done
675 * Returns: 0 if the task is allowed to manipulate policy else error
677 int aa_may_manage_policy(struct aa_label
*label
, struct aa_ns
*ns
, u32 mask
)
681 if (mask
& AA_MAY_REMOVE_POLICY
)
683 else if (mask
& AA_MAY_REPLACE_POLICY
)
688 /* check if loading policy is locked out */
689 if (aa_g_lock_policy
)
690 return audit_policy(label
, op
, NULL
, NULL
, "policy_locked",
693 if (!policy_admin_capable(ns
))
694 return audit_policy(label
, op
, NULL
, NULL
, "not policy admin",
697 /* TODO: add fine grained mediation of policy loads */
701 static struct aa_profile
*__list_lookup_parent(struct list_head
*lh
,
702 struct aa_profile
*profile
)
704 const char *base
= basename(profile
->base
.hname
);
705 long len
= base
- profile
->base
.hname
;
706 struct aa_load_ent
*ent
;
708 /* parent won't have trailing // so remove from len */
713 list_for_each_entry(ent
, lh
, list
) {
714 if (ent
->new == profile
)
716 if (strncmp(ent
->new->base
.hname
, profile
->base
.hname
, len
) ==
717 0 && ent
->new->base
.hname
[len
] == 0)
725 * __replace_profile - replace @old with @new on a list
726 * @old: profile to be replaced (NOT NULL)
727 * @new: profile to replace @old with (NOT NULL)
728 * @share_proxy: transfer @old->proxy to @new
730 * Will duplicate and refcount elements that @new inherits from @old
731 * and will inherit @old children.
733 * refcount @new for list, put @old list refcount
735 * Requires: namespace list lock be held, or list not be shared
737 static void __replace_profile(struct aa_profile
*old
, struct aa_profile
*new)
739 struct aa_profile
*child
, *tmp
;
741 if (!list_empty(&old
->base
.profiles
)) {
743 list_splice_init_rcu(&old
->base
.profiles
, &lh
, synchronize_rcu
);
745 list_for_each_entry_safe(child
, tmp
, &lh
, base
.list
) {
746 struct aa_profile
*p
;
748 list_del_init(&child
->base
.list
);
749 p
= __find_child(&new->base
.profiles
, child
->base
.name
);
751 /* @p replaces @child */
752 __replace_profile(child
, p
);
756 /* inherit @child and its children */
757 /* TODO: update hname of inherited children */
758 /* list refcount transferred to @new */
759 p
= aa_deref_parent(child
);
760 rcu_assign_pointer(child
->parent
, aa_get_profile(new));
761 list_add_rcu(&child
->base
.list
, &new->base
.profiles
);
766 if (!rcu_access_pointer(new->parent
)) {
767 struct aa_profile
*parent
= aa_deref_parent(old
);
768 rcu_assign_pointer(new->parent
, aa_get_profile(parent
));
770 aa_label_replace(&old
->label
, &new->label
);
771 /* migrate dents must come after label replacement b/c update */
772 __aafs_profile_migrate_dents(old
, new);
774 if (list_empty(&new->base
.list
)) {
775 /* new is not on a list already */
776 list_replace_rcu(&old
->base
.list
, &new->base
.list
);
780 __list_remove_profile(old
);
784 * __lookup_replace - lookup replacement information for a profile
785 * @ns - namespace the lookup occurs in
786 * @hname - name of profile to lookup
787 * @noreplace - true if not replacing an existing profile
788 * @p - Returns: profile to be replaced
789 * @info - Returns: info string on why lookup failed
791 * Returns: profile to replace (no ref) on success else ptr error
793 static int __lookup_replace(struct aa_ns
*ns
, const char *hname
,
794 bool noreplace
, struct aa_profile
**p
,
797 *p
= aa_get_profile(__lookup_profile(&ns
->base
, hname
));
799 int error
= replacement_allowed(*p
, noreplace
, info
);
801 *info
= "profile can not be replaced";
809 static void share_name(struct aa_profile
*old
, struct aa_profile
*new)
811 aa_put_str(new->base
.hname
);
812 aa_get_str(old
->base
.hname
);
813 new->base
.hname
= old
->base
.hname
;
814 new->base
.name
= old
->base
.name
;
815 new->label
.hname
= old
->label
.hname
;
818 /* Update to newest version of parent after previous replacements
819 * Returns: unrefcount newest version of parent
821 static struct aa_profile
*update_to_newest_parent(struct aa_profile
*new)
823 struct aa_profile
*parent
, *newest
;
825 parent
= rcu_dereference_protected(new->parent
,
826 mutex_is_locked(&new->ns
->lock
));
827 newest
= aa_get_newest_profile(parent
);
829 /* parent replaced in this atomic set? */
830 if (newest
!= parent
) {
831 aa_put_profile(parent
);
832 rcu_assign_pointer(new->parent
, newest
);
834 aa_put_profile(newest
);
840 * aa_replace_profiles - replace profile(s) on the profile list
841 * @policy_ns: namespace load is occurring on
842 * @label: label that is attempting to load/replace policy
843 * @mask: permission mask
844 * @udata: serialized data stream (NOT NULL)
846 * unpack and replace a profile on the profile list and uses of that profile
847 * by any aa_task_ctx. If the profile does not exist on the profile list
850 * Returns: size of data consumed else error code on failure.
852 ssize_t
aa_replace_profiles(struct aa_ns
*policy_ns
, struct aa_label
*label
,
853 u32 mask
, struct aa_loaddata
*udata
)
855 const char *ns_name
, *info
= NULL
;
856 struct aa_ns
*ns
= NULL
;
857 struct aa_load_ent
*ent
, *tmp
;
858 struct aa_loaddata
*rawdata_ent
;
860 ssize_t count
, error
;
863 op
= mask
& AA_MAY_REPLACE_POLICY
? OP_PROF_REPL
: OP_PROF_LOAD
;
864 aa_get_loaddata(udata
);
866 error
= aa_unpack(udata
, &lh
, &ns_name
);
870 /* ensure that profiles are all for the same ns
871 * TODO: update locking to remove this constaint. All profiles in
872 * the load set must succeed as a set or the load will
873 * fail. Sort ent list and take ns locks in hierarchy order
876 list_for_each_entry(ent
, &lh
, list
) {
879 strcmp(ent
->ns_name
, ns_name
) != 0) {
880 info
= "policy load has mixed namespaces";
884 } else if (ent
->ns_name
) {
886 info
= "policy load has mixed namespaces";
890 ns_name
= ent
->ns_name
;
895 ns
= aa_prepare_ns(policy_ns
? policy_ns
: labels_ns(label
),
899 info
= "failed to prepare namespace";
906 ns
= aa_get_ns(policy_ns
? policy_ns
: labels_ns(label
));
908 mutex_lock(&ns
->lock
);
909 /* check for duplicate rawdata blobs: space and file dedup */
910 list_for_each_entry(rawdata_ent
, &ns
->rawdata_list
, list
) {
911 if (aa_rawdata_eq(rawdata_ent
, udata
)) {
912 struct aa_loaddata
*tmp
;
914 tmp
= __aa_get_loaddata(rawdata_ent
);
915 /* check we didn't fail the race */
917 aa_put_loaddata(udata
);
923 /* setup parent and ns info */
924 list_for_each_entry(ent
, &lh
, list
) {
925 struct aa_policy
*policy
;
927 ent
->new->rawdata
= aa_get_loaddata(udata
);
928 error
= __lookup_replace(ns
, ent
->new->base
.hname
,
929 !(mask
& AA_MAY_REPLACE_POLICY
),
934 if (ent
->new->rename
) {
935 error
= __lookup_replace(ns
, ent
->new->rename
,
936 !(mask
& AA_MAY_REPLACE_POLICY
),
937 &ent
->rename
, &info
);
942 /* released when @new is freed */
943 ent
->new->ns
= aa_get_ns(ns
);
945 if (ent
->old
|| ent
->rename
)
948 /* no ref on policy only use inside lock */
949 policy
= __lookup_parent(ns
, ent
->new->base
.hname
);
951 struct aa_profile
*p
;
952 p
= __list_lookup_parent(&lh
, ent
->new);
955 info
= "parent does not exist";
958 rcu_assign_pointer(ent
->new->parent
, aa_get_profile(p
));
959 } else if (policy
!= &ns
->base
) {
960 /* released on profile replacement or free_profile */
961 struct aa_profile
*p
= (struct aa_profile
*) policy
;
962 rcu_assign_pointer(ent
->new->parent
, aa_get_profile(p
));
966 /* create new fs entries for introspection if needed */
967 if (!udata
->dents
[AAFS_LOADDATA_DIR
]) {
968 error
= __aa_fs_create_rawdata(ns
, udata
);
970 info
= "failed to create raw_data dir and files";
975 list_for_each_entry(ent
, &lh
, list
) {
977 struct dentry
*parent
;
978 if (rcu_access_pointer(ent
->new->parent
)) {
979 struct aa_profile
*p
;
980 p
= aa_deref_parent(ent
->new);
981 parent
= prof_child_dir(p
);
983 parent
= ns_subprofs_dir(ent
->new->ns
);
984 error
= __aafs_profile_mkdir(ent
->new, parent
);
988 info
= "failed to create";
993 /* Done with checks that may fail - do actual replacement */
994 __aa_bump_ns_revision(ns
);
995 __aa_loaddata_update(udata
, ns
->revision
);
996 list_for_each_entry_safe(ent
, tmp
, &lh
, list
) {
997 list_del_init(&ent
->list
);
998 op
= (!ent
->old
&& !ent
->rename
) ? OP_PROF_LOAD
: OP_PROF_REPL
;
1000 if (ent
->old
&& ent
->old
->rawdata
== ent
->new->rawdata
) {
1001 /* dedup actual profile replacement */
1002 audit_policy(label
, op
, ns_name
, ent
->new->base
.hname
,
1003 "same as current profile, skipping",
1009 * TODO: finer dedup based on profile range in data. Load set
1010 * can differ but profile may remain unchanged
1012 audit_policy(label
, op
, ns_name
, ent
->new->base
.hname
, NULL
,
1016 share_name(ent
->old
, ent
->new);
1017 __replace_profile(ent
->old
, ent
->new);
1019 struct list_head
*lh
;
1021 if (rcu_access_pointer(ent
->new->parent
)) {
1022 struct aa_profile
*parent
;
1024 parent
= update_to_newest_parent(ent
->new);
1025 lh
= &parent
->base
.profiles
;
1027 lh
= &ns
->base
.profiles
;
1028 __add_profile(lh
, ent
->new);
1031 aa_load_ent_free(ent
);
1033 __aa_labelset_update_subtree(ns
);
1034 mutex_unlock(&ns
->lock
);
1038 aa_put_loaddata(udata
);
1045 mutex_unlock(&ns
->lock
);
1047 /* audit cause of failure */
1048 op
= (ent
&& !ent
->old
) ? OP_PROF_LOAD
: OP_PROF_REPL
;
1050 audit_policy(label
, op
, ns_name
, ent
? ent
->new->base
.hname
: NULL
,
1052 /* audit status that rest of profiles in the atomic set failed too */
1053 info
= "valid profile in failed atomic policy load";
1054 list_for_each_entry(tmp
, &lh
, list
) {
1056 info
= "unchecked profile in failed atomic policy load";
1057 /* skip entry that caused failure */
1060 op
= (!tmp
->old
) ? OP_PROF_LOAD
: OP_PROF_REPL
;
1061 audit_policy(label
, op
, ns_name
, tmp
->new->base
.hname
, info
,
1064 list_for_each_entry_safe(ent
, tmp
, &lh
, list
) {
1065 list_del_init(&ent
->list
);
1066 aa_load_ent_free(ent
);
1073 * aa_remove_profiles - remove profile(s) from the system
1074 * @policy_ns: namespace the remove is being done from
1075 * @subj: label attempting to remove policy
1076 * @fqname: name of the profile or namespace to remove (NOT NULL)
1077 * @size: size of the name
1079 * Remove a profile or sub namespace from the current namespace, so that
1080 * they can not be found anymore and mark them as replaced by unconfined
1082 * NOTE: removing confinement does not restore rlimits to preconfinemnet values
1084 * Returns: size of data consume else error code if fails
1086 ssize_t
aa_remove_profiles(struct aa_ns
*policy_ns
, struct aa_label
*subj
,
1087 char *fqname
, size_t size
)
1089 struct aa_ns
*ns
= NULL
;
1090 struct aa_profile
*profile
= NULL
;
1091 const char *name
= fqname
, *info
= NULL
;
1092 const char *ns_name
= NULL
;
1096 info
= "no profile specified";
1101 if (fqname
[0] == ':') {
1104 name
= aa_splitn_fqname(fqname
, size
, &ns_name
, &ns_len
);
1105 /* released below */
1106 ns
= aa_lookupn_ns(policy_ns
? policy_ns
: labels_ns(subj
),
1109 info
= "namespace does not exist";
1114 /* released below */
1115 ns
= aa_get_ns(policy_ns
? policy_ns
: labels_ns(subj
));
1118 /* remove namespace - can only happen if fqname[0] == ':' */
1119 mutex_lock(&ns
->parent
->lock
);
1121 __aa_bump_ns_revision(ns
);
1122 mutex_unlock(&ns
->parent
->lock
);
1124 /* remove profile */
1125 mutex_lock(&ns
->lock
);
1126 profile
= aa_get_profile(__lookup_profile(&ns
->base
, name
));
1129 info
= "profile does not exist";
1132 name
= profile
->base
.hname
;
1133 __remove_profile(profile
);
1134 __aa_labelset_update_subtree(ns
);
1135 __aa_bump_ns_revision(ns
);
1136 mutex_unlock(&ns
->lock
);
1139 /* don't fail removal if audit fails */
1140 (void) audit_policy(subj
, OP_PROF_RM
, ns_name
, name
, info
,
1143 aa_put_profile(profile
);
1147 mutex_unlock(&ns
->lock
);
1151 (void) audit_policy(subj
, OP_PROF_RM
, ns_name
, name
, info
,