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[] = {
102 * __add_profile - add a profiles to list and label tree
103 * @list: list to add it to (NOT NULL)
104 * @profile: the profile to add (NOT NULL)
106 * refcount @profile, should be put by __list_remove_profile
108 * Requires: namespace lock be held, or list not be shared
110 static void __add_profile(struct list_head *list, struct aa_profile *profile)
116 AA_BUG(!profile->ns);
117 AA_BUG(!mutex_is_locked(&profile->ns->lock));
119 list_add_rcu(&profile->base.list, list);
120 /* get list reference */
121 aa_get_profile(profile);
122 l = aa_label_insert(&profile->ns->labels, &profile->label);
123 AA_BUG(l != &profile->label);
128 * __list_remove_profile - remove a profile from the list it is on
129 * @profile: the profile to remove (NOT NULL)
131 * remove a profile from the list, warning generally removal should
132 * be done with __replace_profile as most profile removals are
133 * replacements to the unconfined profile.
135 * put @profile list refcount
137 * Requires: namespace lock be held, or list not have been live
139 static void __list_remove_profile(struct aa_profile *profile)
142 AA_BUG(!profile->ns);
143 AA_BUG(!mutex_is_locked(&profile->ns->lock));
145 list_del_rcu(&profile->base.list);
146 aa_put_profile(profile);
150 * __remove_profile - remove old profile, and children
151 * @profile: profile to be replaced (NOT NULL)
153 * Requires: namespace list lock be held, or list not be shared
155 static void __remove_profile(struct aa_profile *profile)
158 AA_BUG(!profile->ns);
159 AA_BUG(!mutex_is_locked(&profile->ns->lock));
161 /* release any children lists first */
162 __aa_profile_list_release(&profile->base.profiles);
163 /* released by free_profile */
164 aa_label_remove(&profile->label);
165 __aafs_profile_rmdir(profile);
166 __list_remove_profile(profile);
170 * __aa_profile_list_release - remove all profiles on the list and put refs
171 * @head: list of profiles (NOT NULL)
173 * Requires: namespace lock be held
175 void __aa_profile_list_release(struct list_head *head)
177 struct aa_profile *profile, *tmp;
178 list_for_each_entry_safe(profile, tmp, head, base.list)
179 __remove_profile(profile);
183 * aa_free_data - free a data blob
187 static void aa_free_data(void *ptr, void *arg)
189 struct aa_data *data = ptr;
191 kfree_sensitive(data->data);
192 kfree_sensitive(data->key);
193 kfree_sensitive(data);
196 static void free_attachment(struct aa_attachment *attach)
200 for (i = 0; i < attach->xattr_count; i++)
201 kfree_sensitive(attach->xattrs[i]);
202 kfree_sensitive(attach->xattrs);
203 aa_destroy_policydb(&attach->xmatch);
206 static void free_ruleset(struct aa_ruleset *rules)
210 aa_destroy_policydb(&rules->file);
211 aa_destroy_policydb(&rules->policy);
212 aa_free_cap_rules(&rules->caps);
213 aa_free_rlimit_rules(&rules->rlimits);
215 for (i = 0; i < rules->secmark_count; i++)
216 kfree_sensitive(rules->secmark[i].label);
217 kfree_sensitive(rules->secmark);
220 struct aa_ruleset *aa_alloc_ruleset(gfp_t gfp)
222 struct aa_ruleset *rules;
224 rules = kzalloc(sizeof(*rules), gfp);
226 INIT_LIST_HEAD(&rules->list);
232 * aa_free_profile - free a profile
233 * @profile: the profile to free (MAYBE NULL)
235 * Free a profile, its hats and null_profile. All references to the profile,
236 * its hats and null_profile must have been put.
238 * If the profile was referenced from a task context, free_profile() will
239 * be called from an rcu callback routine, so we must not sleep here.
241 void aa_free_profile(struct aa_profile *profile)
243 struct aa_ruleset *rule, *tmp;
244 struct rhashtable *rht;
246 AA_DEBUG("%s(%p)\n", __func__, profile);
251 /* free children profiles */
252 aa_policy_destroy(&profile->base);
253 aa_put_profile(rcu_access_pointer(profile->parent));
255 aa_put_ns(profile->ns);
256 kfree_sensitive(profile->rename);
258 free_attachment(&profile->attach);
261 * at this point there are no tasks that can have a reference
264 list_for_each_entry_safe(rule, tmp, &profile->rules, list) {
265 list_del_init(&rule->list);
268 kfree_sensitive(profile->dirname);
272 profile->data = NULL;
273 rhashtable_free_and_destroy(rht, aa_free_data, NULL);
274 kfree_sensitive(rht);
277 kfree_sensitive(profile->hash);
278 aa_put_loaddata(profile->rawdata);
279 aa_label_destroy(&profile->label);
281 kfree_sensitive(profile);
285 * aa_alloc_profile - allocate, initialize and return a new profile
286 * @hname: name of the profile (NOT NULL)
287 * @gfp: allocation type
289 * Returns: refcount profile or NULL on failure
291 struct aa_profile *aa_alloc_profile(const char *hname, struct aa_proxy *proxy,
294 struct aa_profile *profile;
295 struct aa_ruleset *rules;
297 /* freed by free_profile - usually through aa_put_profile */
298 profile = kzalloc(struct_size(profile, label.vec, 2), gfp);
302 if (!aa_policy_init(&profile->base, NULL, hname, gfp))
304 if (!aa_label_init(&profile->label, 1, gfp))
307 INIT_LIST_HEAD(&profile->rules);
309 /* allocate the first ruleset, but leave it empty */
310 rules = aa_alloc_ruleset(gfp);
313 list_add(&rules->list, &profile->rules);
315 /* update being set needed by fs interface */
317 proxy = aa_alloc_proxy(&profile->label, gfp);
322 profile->label.proxy = proxy;
324 profile->label.hname = profile->base.hname;
325 profile->label.flags |= FLAG_PROFILE;
326 profile->label.vec[0] = profile;
328 /* refcount released by caller */
332 aa_free_profile(profile);
337 /* TODO: profile accounting - setup in remove */
340 * __strn_find_child - find a profile on @head list using substring of @name
341 * @head: list to search (NOT NULL)
342 * @name: name of profile (NOT NULL)
343 * @len: length of @name substring to match
345 * Requires: rcu_read_lock be held
347 * Returns: unrefcounted profile ptr, or NULL if not found
349 static struct aa_profile *__strn_find_child(struct list_head *head,
350 const char *name, int len)
352 return (struct aa_profile *)__policy_strn_find(head, name, len);
356 * __find_child - find a profile on @head list with a name matching @name
357 * @head: list to search (NOT NULL)
358 * @name: name of profile (NOT NULL)
360 * Requires: rcu_read_lock be held
362 * Returns: unrefcounted profile ptr, or NULL if not found
364 static struct aa_profile *__find_child(struct list_head *head, const char *name)
366 return __strn_find_child(head, name, strlen(name));
370 * aa_find_child - find a profile by @name in @parent
371 * @parent: profile to search (NOT NULL)
372 * @name: profile name to search for (NOT NULL)
374 * Returns: a refcounted profile or NULL if not found
376 struct aa_profile *aa_find_child(struct aa_profile *parent, const char *name)
378 struct aa_profile *profile;
382 profile = __find_child(&parent->base.profiles, name);
383 } while (profile && !aa_get_profile_not0(profile));
386 /* refcount released by caller */
391 * __lookup_parent - lookup the parent of a profile of name @hname
392 * @ns: namespace to lookup profile in (NOT NULL)
393 * @hname: hierarchical profile name to find parent of (NOT NULL)
395 * Lookups up the parent of a fully qualified profile name, the profile
396 * that matches hname does not need to exist, in general this
397 * is used to load a new profile.
399 * Requires: rcu_read_lock be held
401 * Returns: unrefcounted policy or NULL if not found
403 static struct aa_policy *__lookup_parent(struct aa_ns *ns,
406 struct aa_policy *policy;
407 struct aa_profile *profile = NULL;
412 for (split = strstr(hname, "//"); split;) {
413 profile = __strn_find_child(&policy->profiles, hname,
417 policy = &profile->base;
419 split = strstr(hname, "//");
423 return &profile->base;
427 * __create_missing_ancestors - create place holders for missing ancestores
428 * @ns: namespace to lookup profile in (NOT NULL)
429 * @hname: hierarchical profile name to find parent of (NOT NULL)
430 * @gfp: type of allocation.
432 * Returns: NULL on error, parent profile on success
434 * Requires: ns mutex lock held
436 * Returns: unrefcounted parent policy or NULL if error creating
437 * place holder profiles.
439 static struct aa_policy *__create_missing_ancestors(struct aa_ns *ns,
443 struct aa_policy *policy;
444 struct aa_profile *parent, *profile = NULL;
452 for (split = strstr(hname, "//"); split;) {
454 profile = __strn_find_child(&policy->profiles, hname,
457 const char *name = kstrndup(hname, split - hname,
461 profile = aa_alloc_null(parent, name, gfp);
466 profile->ns = aa_get_ns(ns);
468 policy = &profile->base;
470 split = strstr(hname, "//");
474 return &profile->base;
478 * __lookupn_profile - lookup the profile matching @hname
479 * @base: base list to start looking up profile name from (NOT NULL)
480 * @hname: hierarchical profile name (NOT NULL)
481 * @n: length of @hname
483 * Requires: rcu_read_lock be held
485 * Returns: unrefcounted profile pointer or NULL if not found
487 * Do a relative name lookup, recursing through profile tree.
489 static struct aa_profile *__lookupn_profile(struct aa_policy *base,
490 const char *hname, size_t n)
492 struct aa_profile *profile = NULL;
495 for (split = strnstr(hname, "//", n); split;
496 split = strnstr(hname, "//", n)) {
497 profile = __strn_find_child(&base->profiles, hname,
502 base = &profile->base;
503 n -= split + 2 - hname;
508 return __strn_find_child(&base->profiles, hname, n);
512 static struct aa_profile *__lookup_profile(struct aa_policy *base,
515 return __lookupn_profile(base, hname, strlen(hname));
519 * aa_lookupn_profile - find a profile by its full or partial name
520 * @ns: the namespace to start from (NOT NULL)
521 * @hname: name to do lookup on. Does not contain namespace prefix (NOT NULL)
524 * Returns: refcounted profile or NULL if not found
526 struct aa_profile *aa_lookupn_profile(struct aa_ns *ns, const char *hname,
529 struct aa_profile *profile;
533 profile = __lookupn_profile(&ns->base, hname, n);
534 } while (profile && !aa_get_profile_not0(profile));
537 /* the unconfined profile is not in the regular profile list */
538 if (!profile && strncmp(hname, "unconfined", n) == 0)
539 profile = aa_get_newest_profile(ns->unconfined);
541 /* refcount released by caller */
545 struct aa_profile *aa_lookup_profile(struct aa_ns *ns, const char *hname)
547 return aa_lookupn_profile(ns, hname, strlen(hname));
550 struct aa_profile *aa_fqlookupn_profile(struct aa_label *base,
551 const char *fqname, size_t n)
553 struct aa_profile *profile;
555 const char *name, *ns_name;
558 name = aa_splitn_fqname(fqname, n, &ns_name, &ns_len);
560 ns = aa_lookupn_ns(labels_ns(base), ns_name, ns_len);
564 ns = aa_get_ns(labels_ns(base));
567 profile = aa_lookupn_profile(ns, name, n - (name - fqname));
569 /* default profile for ns, currently unconfined */
570 profile = aa_get_newest_profile(ns->unconfined);
579 struct aa_profile *aa_alloc_null(struct aa_profile *parent, const char *name,
582 struct aa_profile *profile;
583 struct aa_ruleset *rules;
585 profile = aa_alloc_profile(name, NULL, gfp);
589 /* TODO: ideally we should inherit abi from parent */
590 profile->label.flags |= FLAG_NULL;
591 rules = list_first_entry(&profile->rules, typeof(*rules), list);
592 rules->file.dfa = aa_get_dfa(nulldfa);
593 rules->policy.dfa = aa_get_dfa(nulldfa);
596 profile->path_flags = parent->path_flags;
598 /* released on free_profile */
599 rcu_assign_pointer(profile->parent, aa_get_profile(parent));
600 profile->ns = aa_get_ns(parent->ns);
607 * aa_new_learning_profile - create or find a null-X learning profile
608 * @parent: profile that caused this profile to be created (NOT NULL)
609 * @hat: true if the null- learning profile is a hat
610 * @base: name to base the null profile off of
611 * @gfp: type of allocation
613 * Find/Create a null- complain mode profile used in learning mode. The
614 * name of the profile is unique and follows the format of parent//null-XXX.
615 * where XXX is based on the @name or if that fails or is not supplied
618 * null profiles are added to the profile list but the list does not
619 * hold a count on them so that they are automatically released when
622 * Returns: new refcounted profile else NULL on failure
624 struct aa_profile *aa_new_learning_profile(struct aa_profile *parent, bool hat,
625 const char *base, gfp_t gfp)
627 struct aa_profile *p, *profile;
634 name = kmalloc(strlen(parent->base.hname) + 8 + strlen(base),
637 sprintf(name, "%s//null-%s", parent->base.hname, base);
640 /* fall through to try shorter uniq */
643 name = kmalloc(strlen(parent->base.hname) + 2 + 7 + 8, gfp);
646 sprintf(name, "%s//null-%x", parent->base.hname,
647 atomic_inc_return(&parent->ns->uniq_null));
650 /* lookup to see if this is a dup creation */
651 bname = basename(name);
652 profile = aa_find_child(parent, bname);
656 profile = aa_alloc_null(parent, name, gfp);
659 profile->mode = APPARMOR_COMPLAIN;
661 profile->label.flags |= FLAG_HAT;
663 mutex_lock_nested(&profile->ns->lock, profile->ns->level);
664 p = __find_child(&parent->base.profiles, bname);
666 aa_free_profile(profile);
667 profile = aa_get_profile(p);
669 __add_profile(&parent->base.profiles, profile);
671 mutex_unlock(&profile->ns->lock);
673 /* refcount released by caller */
681 aa_free_profile(profile);
686 * replacement_allowed - test to see if replacement is allowed
687 * @profile: profile to test if it can be replaced (MAYBE NULL)
688 * @noreplace: true if replacement shouldn't be allowed but addition is okay
689 * @info: Returns - info about why replacement failed (NOT NULL)
691 * Returns: %0 if replacement allowed else error code
693 static int replacement_allowed(struct aa_profile *profile, int noreplace,
697 if (profile->label.flags & FLAG_IMMUTIBLE) {
698 *info = "cannot replace immutable profile";
700 } else if (noreplace) {
701 *info = "profile already exists";
708 /* audit callback for net specific fields */
709 static void audit_cb(struct audit_buffer *ab, void *va)
711 struct common_audit_data *sa = va;
713 if (aad(sa)->iface.ns) {
714 audit_log_format(ab, " ns=");
715 audit_log_untrustedstring(ab, aad(sa)->iface.ns);
720 * audit_policy - Do auditing of policy changes
721 * @label: label to check if it can manage policy
722 * @op: policy operation being performed
723 * @ns_name: name of namespace being manipulated
724 * @name: name of profile being manipulated (NOT NULL)
725 * @info: any extra information to be audited (MAYBE NULL)
728 * Returns: the error to be returned after audit is done
730 static int audit_policy(struct aa_label *label, const char *op,
731 const char *ns_name, const char *name,
732 const char *info, int error)
734 DEFINE_AUDIT_DATA(sa, LSM_AUDIT_DATA_NONE, AA_CLASS_NONE, op);
736 aad(&sa)->iface.ns = ns_name;
737 aad(&sa)->name = name;
738 aad(&sa)->info = info;
739 aad(&sa)->error = error;
740 aad(&sa)->label = label;
742 aa_audit_msg(AUDIT_APPARMOR_STATUS, &sa, audit_cb);
747 /* don't call out to other LSMs in the stack for apparmor policy admin
750 static int policy_ns_capable(struct aa_label *label,
751 struct user_namespace *userns, int cap)
755 /* check for MAC_ADMIN cap in cred */
756 err = cap_capable(current_cred(), userns, cap, CAP_OPT_NONE);
758 err = aa_capable(label, cap, CAP_OPT_NONE);
764 * aa_policy_view_capable - check if viewing policy in at @ns is allowed
765 * label: label that is trying to view policy in ns
766 * ns: namespace being viewed by @label (may be NULL if @label's ns)
767 * Returns: true if viewing policy is allowed
769 * If @ns is NULL then the namespace being viewed is assumed to be the
770 * tasks current namespace.
772 bool aa_policy_view_capable(struct aa_label *label, struct aa_ns *ns)
774 struct user_namespace *user_ns = current_user_ns();
775 struct aa_ns *view_ns = labels_view(label);
776 bool root_in_user_ns = uid_eq(current_euid(), make_kuid(user_ns, 0)) ||
777 in_egroup_p(make_kgid(user_ns, 0));
778 bool response = false;
782 if (root_in_user_ns && aa_ns_visible(view_ns, ns, true) &&
783 (user_ns == &init_user_ns ||
784 (unprivileged_userns_apparmor_policy != 0 &&
785 user_ns->level == view_ns->level)))
791 bool aa_policy_admin_capable(struct aa_label *label, struct aa_ns *ns)
793 struct user_namespace *user_ns = current_user_ns();
794 bool capable = policy_ns_capable(label, user_ns, CAP_MAC_ADMIN) == 0;
796 AA_DEBUG("cap_mac_admin? %d\n", capable);
797 AA_DEBUG("policy locked? %d\n", aa_g_lock_policy);
799 return aa_policy_view_capable(label, ns) && capable &&
803 bool aa_current_policy_view_capable(struct aa_ns *ns)
805 struct aa_label *label;
808 label = __begin_current_label_crit_section();
809 res = aa_policy_view_capable(label, ns);
810 __end_current_label_crit_section(label);
815 bool aa_current_policy_admin_capable(struct aa_ns *ns)
817 struct aa_label *label;
820 label = __begin_current_label_crit_section();
821 res = aa_policy_admin_capable(label, ns);
822 __end_current_label_crit_section(label);
828 * aa_may_manage_policy - can the current task manage policy
829 * @label: label to check if it can manage policy
830 * @op: the policy manipulation operation being done
832 * Returns: 0 if the task is allowed to manipulate policy else error
834 int aa_may_manage_policy(struct aa_label *label, struct aa_ns *ns, u32 mask)
838 if (mask & AA_MAY_REMOVE_POLICY)
840 else if (mask & AA_MAY_REPLACE_POLICY)
845 /* check if loading policy is locked out */
846 if (aa_g_lock_policy)
847 return audit_policy(label, op, NULL, NULL, "policy_locked",
850 if (!aa_policy_admin_capable(label, ns))
851 return audit_policy(label, op, NULL, NULL, "not policy admin",
854 /* TODO: add fine grained mediation of policy loads */
858 static struct aa_profile *__list_lookup_parent(struct list_head *lh,
859 struct aa_profile *profile)
861 const char *base = basename(profile->base.hname);
862 long len = base - profile->base.hname;
863 struct aa_load_ent *ent;
865 /* parent won't have trailing // so remove from len */
870 list_for_each_entry(ent, lh, list) {
871 if (ent->new == profile)
873 if (strncmp(ent->new->base.hname, profile->base.hname, len) ==
874 0 && ent->new->base.hname[len] == 0)
882 * __replace_profile - replace @old with @new on a list
883 * @old: profile to be replaced (NOT NULL)
884 * @new: profile to replace @old with (NOT NULL)
885 * @share_proxy: transfer @old->proxy to @new
887 * Will duplicate and refcount elements that @new inherits from @old
888 * and will inherit @old children.
890 * refcount @new for list, put @old list refcount
892 * Requires: namespace list lock be held, or list not be shared
894 static void __replace_profile(struct aa_profile *old, struct aa_profile *new)
896 struct aa_profile *child, *tmp;
898 if (!list_empty(&old->base.profiles)) {
900 list_splice_init_rcu(&old->base.profiles, &lh, synchronize_rcu);
902 list_for_each_entry_safe(child, tmp, &lh, base.list) {
903 struct aa_profile *p;
905 list_del_init(&child->base.list);
906 p = __find_child(&new->base.profiles, child->base.name);
908 /* @p replaces @child */
909 __replace_profile(child, p);
913 /* inherit @child and its children */
914 /* TODO: update hname of inherited children */
915 /* list refcount transferred to @new */
916 p = aa_deref_parent(child);
917 rcu_assign_pointer(child->parent, aa_get_profile(new));
918 list_add_rcu(&child->base.list, &new->base.profiles);
923 if (!rcu_access_pointer(new->parent)) {
924 struct aa_profile *parent = aa_deref_parent(old);
925 rcu_assign_pointer(new->parent, aa_get_profile(parent));
927 aa_label_replace(&old->label, &new->label);
928 /* migrate dents must come after label replacement b/c update */
929 __aafs_profile_migrate_dents(old, new);
931 if (list_empty(&new->base.list)) {
932 /* new is not on a list already */
933 list_replace_rcu(&old->base.list, &new->base.list);
937 __list_remove_profile(old);
941 * __lookup_replace - lookup replacement information for a profile
942 * @ns - namespace the lookup occurs in
943 * @hname - name of profile to lookup
944 * @noreplace - true if not replacing an existing profile
945 * @p - Returns: profile to be replaced
946 * @info - Returns: info string on why lookup failed
948 * Returns: profile to replace (no ref) on success else ptr error
950 static int __lookup_replace(struct aa_ns *ns, const char *hname,
951 bool noreplace, struct aa_profile **p,
954 *p = aa_get_profile(__lookup_profile(&ns->base, hname));
956 int error = replacement_allowed(*p, noreplace, info);
958 *info = "profile can not be replaced";
966 static void share_name(struct aa_profile *old, struct aa_profile *new)
968 aa_put_str(new->base.hname);
969 aa_get_str(old->base.hname);
970 new->base.hname = old->base.hname;
971 new->base.name = old->base.name;
972 new->label.hname = old->label.hname;
975 /* Update to newest version of parent after previous replacements
976 * Returns: unrefcount newest version of parent
978 static struct aa_profile *update_to_newest_parent(struct aa_profile *new)
980 struct aa_profile *parent, *newest;
982 parent = rcu_dereference_protected(new->parent,
983 mutex_is_locked(&new->ns->lock));
984 newest = aa_get_newest_profile(parent);
986 /* parent replaced in this atomic set? */
987 if (newest != parent) {
988 aa_put_profile(parent);
989 rcu_assign_pointer(new->parent, newest);
991 aa_put_profile(newest);
997 * aa_replace_profiles - replace profile(s) on the profile list
998 * @policy_ns: namespace load is occurring on
999 * @label: label that is attempting to load/replace policy
1000 * @mask: permission mask
1001 * @udata: serialized data stream (NOT NULL)
1003 * unpack and replace a profile on the profile list and uses of that profile
1004 * by any task creds via invalidating the old version of the profile, which
1005 * tasks will notice to update their own cred. If the profile does not exist
1006 * on the profile list it is added.
1008 * Returns: size of data consumed else error code on failure.
1010 ssize_t aa_replace_profiles(struct aa_ns *policy_ns, struct aa_label *label,
1011 u32 mask, struct aa_loaddata *udata)
1013 const char *ns_name = NULL, *info = NULL;
1014 struct aa_ns *ns = NULL;
1015 struct aa_load_ent *ent, *tmp;
1016 struct aa_loaddata *rawdata_ent;
1018 ssize_t count, error;
1021 op = mask & AA_MAY_REPLACE_POLICY ? OP_PROF_REPL : OP_PROF_LOAD;
1022 aa_get_loaddata(udata);
1023 /* released below */
1024 error = aa_unpack(udata, &lh, &ns_name);
1028 /* ensure that profiles are all for the same ns
1029 * TODO: update locking to remove this constaint. All profiles in
1030 * the load set must succeed as a set or the load will
1031 * fail. Sort ent list and take ns locks in hierarchy order
1034 list_for_each_entry(ent, &lh, list) {
1037 strcmp(ent->ns_name, ns_name) != 0) {
1038 info = "policy load has mixed namespaces";
1042 } else if (ent->ns_name) {
1044 info = "policy load has mixed namespaces";
1048 ns_name = ent->ns_name;
1053 ns = aa_prepare_ns(policy_ns ? policy_ns : labels_ns(label),
1057 info = "failed to prepare namespace";
1058 error = PTR_ERR(ns);
1064 ns = aa_get_ns(policy_ns ? policy_ns : labels_ns(label));
1066 mutex_lock_nested(&ns->lock, ns->level);
1067 /* check for duplicate rawdata blobs: space and file dedup */
1068 if (!list_empty(&ns->rawdata_list)) {
1069 list_for_each_entry(rawdata_ent, &ns->rawdata_list, list) {
1070 if (aa_rawdata_eq(rawdata_ent, udata)) {
1071 struct aa_loaddata *tmp;
1073 tmp = __aa_get_loaddata(rawdata_ent);
1074 /* check we didn't fail the race */
1076 aa_put_loaddata(udata);
1083 /* setup parent and ns info */
1084 list_for_each_entry(ent, &lh, list) {
1085 struct aa_policy *policy;
1086 struct aa_profile *p;
1088 if (aa_g_export_binary)
1089 ent->new->rawdata = aa_get_loaddata(udata);
1090 error = __lookup_replace(ns, ent->new->base.hname,
1091 !(mask & AA_MAY_REPLACE_POLICY),
1096 if (ent->new->rename) {
1097 error = __lookup_replace(ns, ent->new->rename,
1098 !(mask & AA_MAY_REPLACE_POLICY),
1099 &ent->rename, &info);
1104 /* released when @new is freed */
1105 ent->new->ns = aa_get_ns(ns);
1107 if (ent->old || ent->rename)
1110 /* no ref on policy only use inside lock */
1112 policy = __lookup_parent(ns, ent->new->base.hname);
1114 /* first check for parent in the load set */
1115 p = __list_lookup_parent(&lh, ent->new);
1118 * fill in missing parent with null
1119 * profile that doesn't have
1120 * permissions. This allows for
1121 * individual profile loading where
1122 * the child is loaded before the
1123 * parent, and outside of the current
1124 * atomic set. This unfortunately can
1125 * happen with some userspaces. The
1126 * null profile will be replaced once
1127 * the parent is loaded.
1129 policy = __create_missing_ancestors(ns,
1130 ent->new->base.hname,
1134 info = "parent does not exist";
1139 if (!p && policy != &ns->base)
1140 /* released on profile replacement or free_profile */
1141 p = (struct aa_profile *) policy;
1142 rcu_assign_pointer(ent->new->parent, aa_get_profile(p));
1145 /* create new fs entries for introspection if needed */
1146 if (!udata->dents[AAFS_LOADDATA_DIR] && aa_g_export_binary) {
1147 error = __aa_fs_create_rawdata(ns, udata);
1149 info = "failed to create raw_data dir and files";
1154 list_for_each_entry(ent, &lh, list) {
1156 struct dentry *parent;
1157 if (rcu_access_pointer(ent->new->parent)) {
1158 struct aa_profile *p;
1159 p = aa_deref_parent(ent->new);
1160 parent = prof_child_dir(p);
1162 parent = ns_subprofs_dir(ent->new->ns);
1163 error = __aafs_profile_mkdir(ent->new, parent);
1167 info = "failed to create";
1172 /* Done with checks that may fail - do actual replacement */
1173 __aa_bump_ns_revision(ns);
1174 if (aa_g_export_binary)
1175 __aa_loaddata_update(udata, ns->revision);
1176 list_for_each_entry_safe(ent, tmp, &lh, list) {
1177 list_del_init(&ent->list);
1178 op = (!ent->old && !ent->rename) ? OP_PROF_LOAD : OP_PROF_REPL;
1180 if (ent->old && ent->old->rawdata == ent->new->rawdata &&
1181 ent->new->rawdata) {
1182 /* dedup actual profile replacement */
1183 audit_policy(label, op, ns_name, ent->new->base.hname,
1184 "same as current profile, skipping",
1186 /* break refcount cycle with proxy. */
1187 aa_put_proxy(ent->new->label.proxy);
1188 ent->new->label.proxy = NULL;
1193 * TODO: finer dedup based on profile range in data. Load set
1194 * can differ but profile may remain unchanged
1196 audit_policy(label, op, ns_name, ent->new->base.hname, NULL,
1200 share_name(ent->old, ent->new);
1201 __replace_profile(ent->old, ent->new);
1203 struct list_head *lh;
1205 if (rcu_access_pointer(ent->new->parent)) {
1206 struct aa_profile *parent;
1208 parent = update_to_newest_parent(ent->new);
1209 lh = &parent->base.profiles;
1211 lh = &ns->base.profiles;
1212 __add_profile(lh, ent->new);
1215 aa_load_ent_free(ent);
1217 __aa_labelset_update_subtree(ns);
1218 mutex_unlock(&ns->lock);
1222 aa_put_loaddata(udata);
1230 mutex_unlock(&ns->lock);
1232 /* audit cause of failure */
1233 op = (ent && !ent->old) ? OP_PROF_LOAD : OP_PROF_REPL;
1235 audit_policy(label, op, ns_name, ent ? ent->new->base.hname : NULL,
1237 /* audit status that rest of profiles in the atomic set failed too */
1238 info = "valid profile in failed atomic policy load";
1239 list_for_each_entry(tmp, &lh, list) {
1241 info = "unchecked profile in failed atomic policy load";
1242 /* skip entry that caused failure */
1245 op = (!tmp->old) ? OP_PROF_LOAD : OP_PROF_REPL;
1246 audit_policy(label, op, ns_name, tmp->new->base.hname, info,
1249 list_for_each_entry_safe(ent, tmp, &lh, list) {
1250 list_del_init(&ent->list);
1251 aa_load_ent_free(ent);
1258 * aa_remove_profiles - remove profile(s) from the system
1259 * @policy_ns: namespace the remove is being done from
1260 * @subj: label attempting to remove policy
1261 * @fqname: name of the profile or namespace to remove (NOT NULL)
1262 * @size: size of the name
1264 * Remove a profile or sub namespace from the current namespace, so that
1265 * they can not be found anymore and mark them as replaced by unconfined
1267 * NOTE: removing confinement does not restore rlimits to preconfinement values
1269 * Returns: size of data consume else error code if fails
1271 ssize_t aa_remove_profiles(struct aa_ns *policy_ns, struct aa_label *subj,
1272 char *fqname, size_t size)
1274 struct aa_ns *ns = NULL;
1275 struct aa_profile *profile = NULL;
1276 const char *name = fqname, *info = NULL;
1277 const char *ns_name = NULL;
1281 info = "no profile specified";
1286 if (fqname[0] == ':') {
1289 name = aa_splitn_fqname(fqname, size, &ns_name, &ns_len);
1290 /* released below */
1291 ns = aa_lookupn_ns(policy_ns ? policy_ns : labels_ns(subj),
1294 info = "namespace does not exist";
1299 /* released below */
1300 ns = aa_get_ns(policy_ns ? policy_ns : labels_ns(subj));
1303 /* remove namespace - can only happen if fqname[0] == ':' */
1304 mutex_lock_nested(&ns->parent->lock, ns->parent->level);
1305 __aa_bump_ns_revision(ns);
1307 mutex_unlock(&ns->parent->lock);
1309 /* remove profile */
1310 mutex_lock_nested(&ns->lock, ns->level);
1311 profile = aa_get_profile(__lookup_profile(&ns->base, name));
1314 info = "profile does not exist";
1317 name = profile->base.hname;
1318 __aa_bump_ns_revision(ns);
1319 __remove_profile(profile);
1320 __aa_labelset_update_subtree(ns);
1321 mutex_unlock(&ns->lock);
1324 /* don't fail removal if audit fails */
1325 (void) audit_policy(subj, OP_PROF_RM, ns_name, name, info,
1328 aa_put_profile(profile);
1332 mutex_unlock(&ns->lock);
1336 (void) audit_policy(subj, OP_PROF_RM, ns_name, name, info,