1 // SPDX-License-Identifier: GPL-2.0-only
3 * AppArmor security module
5 * This file contains AppArmor policy manipulation functions
7 * Copyright (C) 1998-2008 Novell/SUSE
8 * Copyright 2009-2010 Canonical Ltd.
10 * AppArmor policy is based around profiles, which contain the rules a
11 * task is confined by. Every task in the system has a profile attached
12 * to it determined either by matching "unconfined" tasks against the
13 * visible set of profiles or by following a profiles attachment rules.
15 * Each profile exists in a profile namespace which is a container of
16 * visible profiles. Each namespace contains a special "unconfined" profile,
17 * which doesn't enforce any confinement on a task beyond DAC.
19 * Namespace and profile names can be written together in either
21 * :namespace:profile - used by kernel interfaces for easy detection
22 * namespace://profile - used by policy
24 * Profile names can not start with : or @ or ^ and may not contain \0
26 * Reserved profile names
27 * unconfined - special automatically generated unconfined profile
28 * inherit - special name to indicate profile inheritance
29 * null-XXXX-YYYY - special automatically generated learning profiles
31 * Namespace names may not start with / or @ and may not contain \0 or :
32 * Reserved namespace names
33 * user-XXXX - user defined profiles
35 * a // in a profile or namespace name indicates a hierarchical name with the
36 * name before the // being the parent and the name after the child.
38 * Profile and namespace hierarchies serve two different but similar purposes.
39 * The namespace contains the set of visible profiles that are considered
40 * for attachment. The hierarchy of namespaces allows for virtualizing
41 * the namespace so that for example a chroot can have its own set of profiles
42 * which may define some local user namespaces.
43 * The profile hierarchy severs two distinct purposes,
44 * - it allows for sub profiles or hats, which allows an application to run
45 * subprograms under its own profile with different restriction than it
46 * self, and not have it use the system profile.
47 * eg. if a mail program starts an editor, the policy might make the
48 * restrictions tighter on the editor tighter than the mail program,
49 * and definitely different than general editor restrictions
50 * - it allows for binary hierarchy of profiles, so that execution history
51 * is preserved. This feature isn't exploited by AppArmor reference policy
52 * but is allowed. NOTE: this is currently suboptimal because profile
53 * aliasing is not currently implemented so that a profile for each
54 * level must be defined.
55 * eg. /bin/bash///bin/ls as a name would indicate /bin/ls was started
58 * A profile or namespace name that can contain one or more // separators
59 * is referred to as an hname (hierarchical).
60 * eg. /bin/bash//bin/ls
62 * An fqname is a name that may contain both namespace and profile hnames.
63 * eg. :ns:/bin/bash//bin/ls
66 * - locking of profile lists is currently fairly coarse. All profile
67 * lists within a namespace use the namespace lock.
68 * FIXME: move profile lists to using rcu_lists
71 #include <linux/slab.h>
72 #include <linux/spinlock.h>
73 #include <linux/string.h>
74 #include <linux/cred.h>
75 #include <linux/rculist.h>
76 #include <linux/user_namespace.h>
78 #include "include/apparmor.h"
79 #include "include/capability.h"
80 #include "include/cred.h"
81 #include "include/file.h"
82 #include "include/ipc.h"
83 #include "include/match.h"
84 #include "include/path.h"
85 #include "include/policy.h"
86 #include "include/policy_ns.h"
87 #include "include/policy_unpack.h"
88 #include "include/resource.h"
90 int unprivileged_userns_apparmor_policy
= 1;
92 const char *const aa_profile_mode_names
[] = {
101 * __add_profile - add a profiles to list and label tree
102 * @list: list to add it to (NOT NULL)
103 * @profile: the profile to add (NOT NULL)
105 * refcount @profile, should be put by __list_remove_profile
107 * Requires: namespace lock be held, or list not be shared
109 static void __add_profile(struct list_head
*list
, struct aa_profile
*profile
)
115 AA_BUG(!profile
->ns
);
116 AA_BUG(!mutex_is_locked(&profile
->ns
->lock
));
118 list_add_rcu(&profile
->base
.list
, list
);
119 /* get list reference */
120 aa_get_profile(profile
);
121 l
= aa_label_insert(&profile
->ns
->labels
, &profile
->label
);
122 AA_BUG(l
!= &profile
->label
);
127 * __list_remove_profile - remove a profile from the list it is on
128 * @profile: the profile to remove (NOT NULL)
130 * remove a profile from the list, warning generally removal should
131 * be done with __replace_profile as most profile removals are
132 * replacements to the unconfined profile.
134 * put @profile list refcount
136 * Requires: namespace lock be held, or list not have been live
138 static void __list_remove_profile(struct aa_profile
*profile
)
141 AA_BUG(!profile
->ns
);
142 AA_BUG(!mutex_is_locked(&profile
->ns
->lock
));
144 list_del_rcu(&profile
->base
.list
);
145 aa_put_profile(profile
);
149 * __remove_profile - remove old profile, and children
150 * @profile: profile to be replaced (NOT NULL)
152 * Requires: namespace list lock be held, or list not be shared
154 static void __remove_profile(struct aa_profile
*profile
)
157 AA_BUG(!profile
->ns
);
158 AA_BUG(!mutex_is_locked(&profile
->ns
->lock
));
160 /* release any children lists first */
161 __aa_profile_list_release(&profile
->base
.profiles
);
162 /* released by free_profile */
163 aa_label_remove(&profile
->label
);
164 __aafs_profile_rmdir(profile
);
165 __list_remove_profile(profile
);
169 * __aa_profile_list_release - remove all profiles on the list and put refs
170 * @head: list of profiles (NOT NULL)
172 * Requires: namespace lock be held
174 void __aa_profile_list_release(struct list_head
*head
)
176 struct aa_profile
*profile
, *tmp
;
177 list_for_each_entry_safe(profile
, tmp
, head
, base
.list
)
178 __remove_profile(profile
);
182 * aa_free_data - free a data blob
186 static void aa_free_data(void *ptr
, void *arg
)
188 struct aa_data
*data
= ptr
;
190 kfree_sensitive(data
->data
);
191 kfree_sensitive(data
->key
);
192 kfree_sensitive(data
);
196 * aa_free_profile - free a profile
197 * @profile: the profile to free (MAYBE NULL)
199 * Free a profile, its hats and null_profile. All references to the profile,
200 * its hats and null_profile must have been put.
202 * If the profile was referenced from a task context, free_profile() will
203 * be called from an rcu callback routine, so we must not sleep here.
205 void aa_free_profile(struct aa_profile
*profile
)
207 struct rhashtable
*rht
;
210 AA_DEBUG("%s(%p)\n", __func__
, profile
);
215 /* free children profiles */
216 aa_policy_destroy(&profile
->base
);
217 aa_put_profile(rcu_access_pointer(profile
->parent
));
219 aa_put_ns(profile
->ns
);
220 kfree_sensitive(profile
->rename
);
222 aa_free_file_rules(&profile
->file
);
223 aa_free_cap_rules(&profile
->caps
);
224 aa_free_rlimit_rules(&profile
->rlimits
);
226 for (i
= 0; i
< profile
->xattr_count
; i
++)
227 kfree_sensitive(profile
->xattrs
[i
]);
228 kfree_sensitive(profile
->xattrs
);
229 for (i
= 0; i
< profile
->secmark_count
; i
++)
230 kfree_sensitive(profile
->secmark
[i
].label
);
231 kfree_sensitive(profile
->secmark
);
232 kfree_sensitive(profile
->dirname
);
233 aa_put_dfa(profile
->xmatch
);
234 aa_put_dfa(profile
->policy
.dfa
);
238 profile
->data
= NULL
;
239 rhashtable_free_and_destroy(rht
, aa_free_data
, NULL
);
240 kfree_sensitive(rht
);
243 kfree_sensitive(profile
->hash
);
244 aa_put_loaddata(profile
->rawdata
);
245 aa_label_destroy(&profile
->label
);
247 kfree_sensitive(profile
);
251 * aa_alloc_profile - allocate, initialize and return a new profile
252 * @hname: name of the profile (NOT NULL)
253 * @gfp: allocation type
255 * Returns: refcount profile or NULL on failure
257 struct aa_profile
*aa_alloc_profile(const char *hname
, struct aa_proxy
*proxy
,
260 struct aa_profile
*profile
;
262 /* freed by free_profile - usually through aa_put_profile */
263 profile
= kzalloc(sizeof(*profile
) + sizeof(struct aa_profile
*) * 2,
268 if (!aa_policy_init(&profile
->base
, NULL
, hname
, gfp
))
270 if (!aa_label_init(&profile
->label
, 1, gfp
))
273 /* update being set needed by fs interface */
275 proxy
= aa_alloc_proxy(&profile
->label
, gfp
);
280 profile
->label
.proxy
= proxy
;
282 profile
->label
.hname
= profile
->base
.hname
;
283 profile
->label
.flags
|= FLAG_PROFILE
;
284 profile
->label
.vec
[0] = profile
;
286 /* refcount released by caller */
290 aa_free_profile(profile
);
295 /* TODO: profile accounting - setup in remove */
298 * __strn_find_child - find a profile on @head list using substring of @name
299 * @head: list to search (NOT NULL)
300 * @name: name of profile (NOT NULL)
301 * @len: length of @name substring to match
303 * Requires: rcu_read_lock be held
305 * Returns: unrefcounted profile ptr, or NULL if not found
307 static struct aa_profile
*__strn_find_child(struct list_head
*head
,
308 const char *name
, int len
)
310 return (struct aa_profile
*)__policy_strn_find(head
, name
, len
);
314 * __find_child - find a profile on @head list with a name matching @name
315 * @head: list to search (NOT NULL)
316 * @name: name of profile (NOT NULL)
318 * Requires: rcu_read_lock be held
320 * Returns: unrefcounted profile ptr, or NULL if not found
322 static struct aa_profile
*__find_child(struct list_head
*head
, const char *name
)
324 return __strn_find_child(head
, name
, strlen(name
));
328 * aa_find_child - find a profile by @name in @parent
329 * @parent: profile to search (NOT NULL)
330 * @name: profile name to search for (NOT NULL)
332 * Returns: a refcounted profile or NULL if not found
334 struct aa_profile
*aa_find_child(struct aa_profile
*parent
, const char *name
)
336 struct aa_profile
*profile
;
340 profile
= __find_child(&parent
->base
.profiles
, name
);
341 } while (profile
&& !aa_get_profile_not0(profile
));
344 /* refcount released by caller */
349 * __lookup_parent - lookup the parent of a profile of name @hname
350 * @ns: namespace to lookup profile in (NOT NULL)
351 * @hname: hierarchical profile name to find parent of (NOT NULL)
353 * Lookups up the parent of a fully qualified profile name, the profile
354 * that matches hname does not need to exist, in general this
355 * is used to load a new profile.
357 * Requires: rcu_read_lock be held
359 * Returns: unrefcounted policy or NULL if not found
361 static struct aa_policy
*__lookup_parent(struct aa_ns
*ns
,
364 struct aa_policy
*policy
;
365 struct aa_profile
*profile
= NULL
;
370 for (split
= strstr(hname
, "//"); split
;) {
371 profile
= __strn_find_child(&policy
->profiles
, hname
,
375 policy
= &profile
->base
;
377 split
= strstr(hname
, "//");
381 return &profile
->base
;
385 * __lookupn_profile - lookup the profile matching @hname
386 * @base: base list to start looking up profile name from (NOT NULL)
387 * @hname: hierarchical profile name (NOT NULL)
388 * @n: length of @hname
390 * Requires: rcu_read_lock be held
392 * Returns: unrefcounted profile pointer or NULL if not found
394 * Do a relative name lookup, recursing through profile tree.
396 static struct aa_profile
*__lookupn_profile(struct aa_policy
*base
,
397 const char *hname
, size_t n
)
399 struct aa_profile
*profile
= NULL
;
402 for (split
= strnstr(hname
, "//", n
); split
;
403 split
= strnstr(hname
, "//", n
)) {
404 profile
= __strn_find_child(&base
->profiles
, hname
,
409 base
= &profile
->base
;
410 n
-= split
+ 2 - hname
;
415 return __strn_find_child(&base
->profiles
, hname
, n
);
419 static struct aa_profile
*__lookup_profile(struct aa_policy
*base
,
422 return __lookupn_profile(base
, hname
, strlen(hname
));
426 * aa_lookup_profile - find a profile by its full or partial name
427 * @ns: the namespace to start from (NOT NULL)
428 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
431 * Returns: refcounted profile or NULL if not found
433 struct aa_profile
*aa_lookupn_profile(struct aa_ns
*ns
, const char *hname
,
436 struct aa_profile
*profile
;
440 profile
= __lookupn_profile(&ns
->base
, hname
, n
);
441 } while (profile
&& !aa_get_profile_not0(profile
));
444 /* the unconfined profile is not in the regular profile list */
445 if (!profile
&& strncmp(hname
, "unconfined", n
) == 0)
446 profile
= aa_get_newest_profile(ns
->unconfined
);
448 /* refcount released by caller */
452 struct aa_profile
*aa_lookup_profile(struct aa_ns
*ns
, const char *hname
)
454 return aa_lookupn_profile(ns
, hname
, strlen(hname
));
457 struct aa_profile
*aa_fqlookupn_profile(struct aa_label
*base
,
458 const char *fqname
, size_t n
)
460 struct aa_profile
*profile
;
462 const char *name
, *ns_name
;
465 name
= aa_splitn_fqname(fqname
, n
, &ns_name
, &ns_len
);
467 ns
= aa_lookupn_ns(labels_ns(base
), ns_name
, ns_len
);
471 ns
= aa_get_ns(labels_ns(base
));
474 profile
= aa_lookupn_profile(ns
, name
, n
- (name
- fqname
));
476 /* default profile for ns, currently unconfined */
477 profile
= aa_get_newest_profile(ns
->unconfined
);
486 * aa_new_null_profile - create or find a null-X learning profile
487 * @parent: profile that caused this profile to be created (NOT NULL)
488 * @hat: true if the null- learning profile is a hat
489 * @base: name to base the null profile off of
490 * @gfp: type of allocation
492 * Find/Create a null- complain mode profile used in learning mode. The
493 * name of the profile is unique and follows the format of parent//null-XXX.
494 * where XXX is based on the @name or if that fails or is not supplied
497 * null profiles are added to the profile list but the list does not
498 * hold a count on them so that they are automatically released when
501 * Returns: new refcounted profile else NULL on failure
503 struct aa_profile
*aa_new_null_profile(struct aa_profile
*parent
, bool hat
,
504 const char *base
, gfp_t gfp
)
506 struct aa_profile
*p
, *profile
;
513 name
= kmalloc(strlen(parent
->base
.hname
) + 8 + strlen(base
),
516 sprintf(name
, "%s//null-%s", parent
->base
.hname
, base
);
519 /* fall through to try shorter uniq */
522 name
= kmalloc(strlen(parent
->base
.hname
) + 2 + 7 + 8, gfp
);
525 sprintf(name
, "%s//null-%x", parent
->base
.hname
,
526 atomic_inc_return(&parent
->ns
->uniq_null
));
529 /* lookup to see if this is a dup creation */
530 bname
= basename(name
);
531 profile
= aa_find_child(parent
, bname
);
535 profile
= aa_alloc_profile(name
, NULL
, gfp
);
539 profile
->mode
= APPARMOR_COMPLAIN
;
540 profile
->label
.flags
|= FLAG_NULL
;
542 profile
->label
.flags
|= FLAG_HAT
;
543 profile
->path_flags
= parent
->path_flags
;
545 /* released on free_profile */
546 rcu_assign_pointer(profile
->parent
, aa_get_profile(parent
));
547 profile
->ns
= aa_get_ns(parent
->ns
);
548 profile
->file
.dfa
= aa_get_dfa(nulldfa
);
549 profile
->policy
.dfa
= aa_get_dfa(nulldfa
);
551 mutex_lock_nested(&profile
->ns
->lock
, profile
->ns
->level
);
552 p
= __find_child(&parent
->base
.profiles
, bname
);
554 aa_free_profile(profile
);
555 profile
= aa_get_profile(p
);
557 __add_profile(&parent
->base
.profiles
, profile
);
559 mutex_unlock(&profile
->ns
->lock
);
561 /* refcount released by caller */
569 aa_free_profile(profile
);
574 * replacement_allowed - test to see if replacement is allowed
575 * @profile: profile to test if it can be replaced (MAYBE NULL)
576 * @noreplace: true if replacement shouldn't be allowed but addition is okay
577 * @info: Returns - info about why replacement failed (NOT NULL)
579 * Returns: %0 if replacement allowed else error code
581 static int replacement_allowed(struct aa_profile
*profile
, int noreplace
,
585 if (profile
->label
.flags
& FLAG_IMMUTIBLE
) {
586 *info
= "cannot replace immutable profile";
588 } else if (noreplace
) {
589 *info
= "profile already exists";
596 /* audit callback for net specific fields */
597 static void audit_cb(struct audit_buffer
*ab
, void *va
)
599 struct common_audit_data
*sa
= va
;
601 if (aad(sa
)->iface
.ns
) {
602 audit_log_format(ab
, " ns=");
603 audit_log_untrustedstring(ab
, aad(sa
)->iface
.ns
);
608 * audit_policy - Do auditing of policy changes
609 * @label: label to check if it can manage policy
610 * @op: policy operation being performed
611 * @ns_name: name of namespace being manipulated
612 * @name: name of profile being manipulated (NOT NULL)
613 * @info: any extra information to be audited (MAYBE NULL)
616 * Returns: the error to be returned after audit is done
618 static int audit_policy(struct aa_label
*label
, const char *op
,
619 const char *ns_name
, const char *name
,
620 const char *info
, int error
)
622 DEFINE_AUDIT_DATA(sa
, LSM_AUDIT_DATA_NONE
, op
);
624 aad(&sa
)->iface
.ns
= ns_name
;
625 aad(&sa
)->name
= name
;
626 aad(&sa
)->info
= info
;
627 aad(&sa
)->error
= error
;
628 aad(&sa
)->label
= label
;
630 aa_audit_msg(AUDIT_APPARMOR_STATUS
, &sa
, audit_cb
);
636 * policy_view_capable - check if viewing policy in at @ns is allowed
637 * ns: namespace being viewed by current task (may be NULL)
638 * Returns: true if viewing policy is allowed
640 * If @ns is NULL then the namespace being viewed is assumed to be the
641 * tasks current namespace.
643 bool policy_view_capable(struct aa_ns
*ns
)
645 struct user_namespace
*user_ns
= current_user_ns();
646 struct aa_ns
*view_ns
= aa_get_current_ns();
647 bool root_in_user_ns
= uid_eq(current_euid(), make_kuid(user_ns
, 0)) ||
648 in_egroup_p(make_kgid(user_ns
, 0));
649 bool response
= false;
653 if (root_in_user_ns
&& aa_ns_visible(view_ns
, ns
, true) &&
654 (user_ns
== &init_user_ns
||
655 (unprivileged_userns_apparmor_policy
!= 0 &&
656 user_ns
->level
== view_ns
->level
)))
663 bool policy_admin_capable(struct aa_ns
*ns
)
665 struct user_namespace
*user_ns
= current_user_ns();
666 bool capable
= ns_capable(user_ns
, CAP_MAC_ADMIN
);
668 AA_DEBUG("cap_mac_admin? %d\n", capable
);
669 AA_DEBUG("policy locked? %d\n", aa_g_lock_policy
);
671 return policy_view_capable(ns
) && capable
&& !aa_g_lock_policy
;
675 * aa_may_manage_policy - can the current task manage policy
676 * @label: label to check if it can manage policy
677 * @op: the policy manipulation operation being done
679 * Returns: 0 if the task is allowed to manipulate policy else error
681 int aa_may_manage_policy(struct aa_label
*label
, struct aa_ns
*ns
, u32 mask
)
685 if (mask
& AA_MAY_REMOVE_POLICY
)
687 else if (mask
& AA_MAY_REPLACE_POLICY
)
692 /* check if loading policy is locked out */
693 if (aa_g_lock_policy
)
694 return audit_policy(label
, op
, NULL
, NULL
, "policy_locked",
697 if (!policy_admin_capable(ns
))
698 return audit_policy(label
, op
, NULL
, NULL
, "not policy admin",
701 /* TODO: add fine grained mediation of policy loads */
705 static struct aa_profile
*__list_lookup_parent(struct list_head
*lh
,
706 struct aa_profile
*profile
)
708 const char *base
= basename(profile
->base
.hname
);
709 long len
= base
- profile
->base
.hname
;
710 struct aa_load_ent
*ent
;
712 /* parent won't have trailing // so remove from len */
717 list_for_each_entry(ent
, lh
, list
) {
718 if (ent
->new == profile
)
720 if (strncmp(ent
->new->base
.hname
, profile
->base
.hname
, len
) ==
721 0 && ent
->new->base
.hname
[len
] == 0)
729 * __replace_profile - replace @old with @new on a list
730 * @old: profile to be replaced (NOT NULL)
731 * @new: profile to replace @old with (NOT NULL)
732 * @share_proxy: transfer @old->proxy to @new
734 * Will duplicate and refcount elements that @new inherits from @old
735 * and will inherit @old children.
737 * refcount @new for list, put @old list refcount
739 * Requires: namespace list lock be held, or list not be shared
741 static void __replace_profile(struct aa_profile
*old
, struct aa_profile
*new)
743 struct aa_profile
*child
, *tmp
;
745 if (!list_empty(&old
->base
.profiles
)) {
747 list_splice_init_rcu(&old
->base
.profiles
, &lh
, synchronize_rcu
);
749 list_for_each_entry_safe(child
, tmp
, &lh
, base
.list
) {
750 struct aa_profile
*p
;
752 list_del_init(&child
->base
.list
);
753 p
= __find_child(&new->base
.profiles
, child
->base
.name
);
755 /* @p replaces @child */
756 __replace_profile(child
, p
);
760 /* inherit @child and its children */
761 /* TODO: update hname of inherited children */
762 /* list refcount transferred to @new */
763 p
= aa_deref_parent(child
);
764 rcu_assign_pointer(child
->parent
, aa_get_profile(new));
765 list_add_rcu(&child
->base
.list
, &new->base
.profiles
);
770 if (!rcu_access_pointer(new->parent
)) {
771 struct aa_profile
*parent
= aa_deref_parent(old
);
772 rcu_assign_pointer(new->parent
, aa_get_profile(parent
));
774 aa_label_replace(&old
->label
, &new->label
);
775 /* migrate dents must come after label replacement b/c update */
776 __aafs_profile_migrate_dents(old
, new);
778 if (list_empty(&new->base
.list
)) {
779 /* new is not on a list already */
780 list_replace_rcu(&old
->base
.list
, &new->base
.list
);
784 __list_remove_profile(old
);
788 * __lookup_replace - lookup replacement information for a profile
789 * @ns - namespace the lookup occurs in
790 * @hname - name of profile to lookup
791 * @noreplace - true if not replacing an existing profile
792 * @p - Returns: profile to be replaced
793 * @info - Returns: info string on why lookup failed
795 * Returns: profile to replace (no ref) on success else ptr error
797 static int __lookup_replace(struct aa_ns
*ns
, const char *hname
,
798 bool noreplace
, struct aa_profile
**p
,
801 *p
= aa_get_profile(__lookup_profile(&ns
->base
, hname
));
803 int error
= replacement_allowed(*p
, noreplace
, info
);
805 *info
= "profile can not be replaced";
813 static void share_name(struct aa_profile
*old
, struct aa_profile
*new)
815 aa_put_str(new->base
.hname
);
816 aa_get_str(old
->base
.hname
);
817 new->base
.hname
= old
->base
.hname
;
818 new->base
.name
= old
->base
.name
;
819 new->label
.hname
= old
->label
.hname
;
822 /* Update to newest version of parent after previous replacements
823 * Returns: unrefcount newest version of parent
825 static struct aa_profile
*update_to_newest_parent(struct aa_profile
*new)
827 struct aa_profile
*parent
, *newest
;
829 parent
= rcu_dereference_protected(new->parent
,
830 mutex_is_locked(&new->ns
->lock
));
831 newest
= aa_get_newest_profile(parent
);
833 /* parent replaced in this atomic set? */
834 if (newest
!= parent
) {
835 aa_put_profile(parent
);
836 rcu_assign_pointer(new->parent
, newest
);
838 aa_put_profile(newest
);
844 * aa_replace_profiles - replace profile(s) on the profile list
845 * @policy_ns: namespace load is occurring on
846 * @label: label that is attempting to load/replace policy
847 * @mask: permission mask
848 * @udata: serialized data stream (NOT NULL)
850 * unpack and replace a profile on the profile list and uses of that profile
851 * by any task creds via invalidating the old version of the profile, which
852 * tasks will notice to update their own cred. If the profile does not exist
853 * on the profile list it is added.
855 * Returns: size of data consumed else error code on failure.
857 ssize_t
aa_replace_profiles(struct aa_ns
*policy_ns
, struct aa_label
*label
,
858 u32 mask
, struct aa_loaddata
*udata
)
860 const char *ns_name
= NULL
, *info
= NULL
;
861 struct aa_ns
*ns
= NULL
;
862 struct aa_load_ent
*ent
, *tmp
;
863 struct aa_loaddata
*rawdata_ent
;
865 ssize_t count
, error
;
868 op
= mask
& AA_MAY_REPLACE_POLICY
? OP_PROF_REPL
: OP_PROF_LOAD
;
869 aa_get_loaddata(udata
);
871 error
= aa_unpack(udata
, &lh
, &ns_name
);
875 /* ensure that profiles are all for the same ns
876 * TODO: update locking to remove this constaint. All profiles in
877 * the load set must succeed as a set or the load will
878 * fail. Sort ent list and take ns locks in hierarchy order
881 list_for_each_entry(ent
, &lh
, list
) {
884 strcmp(ent
->ns_name
, ns_name
) != 0) {
885 info
= "policy load has mixed namespaces";
889 } else if (ent
->ns_name
) {
891 info
= "policy load has mixed namespaces";
895 ns_name
= ent
->ns_name
;
900 ns
= aa_prepare_ns(policy_ns
? policy_ns
: labels_ns(label
),
904 info
= "failed to prepare namespace";
911 ns
= aa_get_ns(policy_ns
? policy_ns
: labels_ns(label
));
913 mutex_lock_nested(&ns
->lock
, ns
->level
);
914 /* check for duplicate rawdata blobs: space and file dedup */
915 list_for_each_entry(rawdata_ent
, &ns
->rawdata_list
, list
) {
916 if (aa_rawdata_eq(rawdata_ent
, udata
)) {
917 struct aa_loaddata
*tmp
;
919 tmp
= __aa_get_loaddata(rawdata_ent
);
920 /* check we didn't fail the race */
922 aa_put_loaddata(udata
);
928 /* setup parent and ns info */
929 list_for_each_entry(ent
, &lh
, list
) {
930 struct aa_policy
*policy
;
932 ent
->new->rawdata
= aa_get_loaddata(udata
);
933 error
= __lookup_replace(ns
, ent
->new->base
.hname
,
934 !(mask
& AA_MAY_REPLACE_POLICY
),
939 if (ent
->new->rename
) {
940 error
= __lookup_replace(ns
, ent
->new->rename
,
941 !(mask
& AA_MAY_REPLACE_POLICY
),
942 &ent
->rename
, &info
);
947 /* released when @new is freed */
948 ent
->new->ns
= aa_get_ns(ns
);
950 if (ent
->old
|| ent
->rename
)
953 /* no ref on policy only use inside lock */
954 policy
= __lookup_parent(ns
, ent
->new->base
.hname
);
956 struct aa_profile
*p
;
957 p
= __list_lookup_parent(&lh
, ent
->new);
960 info
= "parent does not exist";
963 rcu_assign_pointer(ent
->new->parent
, aa_get_profile(p
));
964 } else if (policy
!= &ns
->base
) {
965 /* released on profile replacement or free_profile */
966 struct aa_profile
*p
= (struct aa_profile
*) policy
;
967 rcu_assign_pointer(ent
->new->parent
, aa_get_profile(p
));
971 /* create new fs entries for introspection if needed */
972 if (!udata
->dents
[AAFS_LOADDATA_DIR
]) {
973 error
= __aa_fs_create_rawdata(ns
, udata
);
975 info
= "failed to create raw_data dir and files";
980 list_for_each_entry(ent
, &lh
, list
) {
982 struct dentry
*parent
;
983 if (rcu_access_pointer(ent
->new->parent
)) {
984 struct aa_profile
*p
;
985 p
= aa_deref_parent(ent
->new);
986 parent
= prof_child_dir(p
);
988 parent
= ns_subprofs_dir(ent
->new->ns
);
989 error
= __aafs_profile_mkdir(ent
->new, parent
);
993 info
= "failed to create";
998 /* Done with checks that may fail - do actual replacement */
999 __aa_bump_ns_revision(ns
);
1000 __aa_loaddata_update(udata
, ns
->revision
);
1001 list_for_each_entry_safe(ent
, tmp
, &lh
, list
) {
1002 list_del_init(&ent
->list
);
1003 op
= (!ent
->old
&& !ent
->rename
) ? OP_PROF_LOAD
: OP_PROF_REPL
;
1005 if (ent
->old
&& ent
->old
->rawdata
== ent
->new->rawdata
) {
1006 /* dedup actual profile replacement */
1007 audit_policy(label
, op
, ns_name
, ent
->new->base
.hname
,
1008 "same as current profile, skipping",
1010 /* break refcount cycle with proxy. */
1011 aa_put_proxy(ent
->new->label
.proxy
);
1012 ent
->new->label
.proxy
= NULL
;
1017 * TODO: finer dedup based on profile range in data. Load set
1018 * can differ but profile may remain unchanged
1020 audit_policy(label
, op
, ns_name
, ent
->new->base
.hname
, NULL
,
1024 share_name(ent
->old
, ent
->new);
1025 __replace_profile(ent
->old
, ent
->new);
1027 struct list_head
*lh
;
1029 if (rcu_access_pointer(ent
->new->parent
)) {
1030 struct aa_profile
*parent
;
1032 parent
= update_to_newest_parent(ent
->new);
1033 lh
= &parent
->base
.profiles
;
1035 lh
= &ns
->base
.profiles
;
1036 __add_profile(lh
, ent
->new);
1039 aa_load_ent_free(ent
);
1041 __aa_labelset_update_subtree(ns
);
1042 mutex_unlock(&ns
->lock
);
1046 aa_put_loaddata(udata
);
1054 mutex_unlock(&ns
->lock
);
1056 /* audit cause of failure */
1057 op
= (ent
&& !ent
->old
) ? OP_PROF_LOAD
: OP_PROF_REPL
;
1059 audit_policy(label
, op
, ns_name
, ent
? ent
->new->base
.hname
: NULL
,
1061 /* audit status that rest of profiles in the atomic set failed too */
1062 info
= "valid profile in failed atomic policy load";
1063 list_for_each_entry(tmp
, &lh
, list
) {
1065 info
= "unchecked profile in failed atomic policy load";
1066 /* skip entry that caused failure */
1069 op
= (!tmp
->old
) ? OP_PROF_LOAD
: OP_PROF_REPL
;
1070 audit_policy(label
, op
, ns_name
, tmp
->new->base
.hname
, info
,
1073 list_for_each_entry_safe(ent
, tmp
, &lh
, list
) {
1074 list_del_init(&ent
->list
);
1075 aa_load_ent_free(ent
);
1082 * aa_remove_profiles - remove profile(s) from the system
1083 * @policy_ns: namespace the remove is being done from
1084 * @subj: label attempting to remove policy
1085 * @fqname: name of the profile or namespace to remove (NOT NULL)
1086 * @size: size of the name
1088 * Remove a profile or sub namespace from the current namespace, so that
1089 * they can not be found anymore and mark them as replaced by unconfined
1091 * NOTE: removing confinement does not restore rlimits to preconfinement values
1093 * Returns: size of data consume else error code if fails
1095 ssize_t
aa_remove_profiles(struct aa_ns
*policy_ns
, struct aa_label
*subj
,
1096 char *fqname
, size_t size
)
1098 struct aa_ns
*ns
= NULL
;
1099 struct aa_profile
*profile
= NULL
;
1100 const char *name
= fqname
, *info
= NULL
;
1101 const char *ns_name
= NULL
;
1105 info
= "no profile specified";
1110 if (fqname
[0] == ':') {
1113 name
= aa_splitn_fqname(fqname
, size
, &ns_name
, &ns_len
);
1114 /* released below */
1115 ns
= aa_lookupn_ns(policy_ns
? policy_ns
: labels_ns(subj
),
1118 info
= "namespace does not exist";
1123 /* released below */
1124 ns
= aa_get_ns(policy_ns
? policy_ns
: labels_ns(subj
));
1127 /* remove namespace - can only happen if fqname[0] == ':' */
1128 mutex_lock_nested(&ns
->parent
->lock
, ns
->level
);
1129 __aa_bump_ns_revision(ns
);
1131 mutex_unlock(&ns
->parent
->lock
);
1133 /* remove profile */
1134 mutex_lock_nested(&ns
->lock
, ns
->level
);
1135 profile
= aa_get_profile(__lookup_profile(&ns
->base
, name
));
1138 info
= "profile does not exist";
1141 name
= profile
->base
.hname
;
1142 __aa_bump_ns_revision(ns
);
1143 __remove_profile(profile
);
1144 __aa_labelset_update_subtree(ns
);
1145 mutex_unlock(&ns
->lock
);
1148 /* don't fail removal if audit fails */
1149 (void) audit_policy(subj
, OP_PROF_RM
, ns_name
, name
, info
,
1152 aa_put_profile(profile
);
1156 mutex_unlock(&ns
->lock
);
1160 (void) audit_policy(subj
, OP_PROF_RM
, ns_name
, name
, info
,