Lines Matching full:label
5 * This file contains AppArmor label definitions
16 #include "include/label.h"
27 * code - will take a ref count on a label if it needs the label
29 * profiles - each profile is a label
30 * secids - a pinned secid will keep a refcount of the label it is
34 * Labels are not ref counted by the label set, so they maybe removed and
45 /* p->label will not updated any more as p is dead */ in free_proxy()
46 aa_put_label(rcu_dereference_protected(proxy->label, true)); in free_proxy()
48 RCU_INIT_POINTER(proxy->label, (struct aa_label *)PROXY_POISON); in free_proxy()
60 struct aa_proxy *aa_alloc_proxy(struct aa_label *label, gfp_t gfp) in aa_alloc_proxy() argument
67 rcu_assign_pointer(new->label, aa_get_label(label)); in aa_alloc_proxy()
81 tmp = rcu_dereference_protected(orig->proxy->label, in __aa_proxy_redirect()
83 rcu_assign_pointer(orig->proxy->label, aa_get_label(new)); in __aa_proxy_redirect()
99 * ns_cmp - compare ns for label set ordering
156 * vec_cmp - label comparison for set ordering
213 u |= new->vec[i]->label.flags & (FLAG_DEBUG1 | FLAG_DEBUG2 | in accum_label_info()
215 if (!(u & new->vec[i]->label.flags & FLAG_UNCONFINED)) in accum_label_info()
217 new->mediates |= new->vec[i]->label.mediates; in accum_label_info()
321 void aa_label_destroy(struct aa_label *label) in aa_label_destroy() argument
323 AA_BUG(!label); in aa_label_destroy()
325 if (!label_isprofile(label)) { in aa_label_destroy()
329 aa_put_str(label->hname); in aa_label_destroy()
331 label_for_each(i, label, profile) { in aa_label_destroy()
333 label->vec[i.i] = (struct aa_profile *) in aa_label_destroy()
338 if (label->proxy) { in aa_label_destroy()
339 if (rcu_dereference_protected(label->proxy->label, true) == label) in aa_label_destroy()
340 rcu_assign_pointer(label->proxy->label, NULL); in aa_label_destroy()
341 aa_put_proxy(label->proxy); in aa_label_destroy()
343 aa_free_secid(label->secid); in aa_label_destroy()
345 label->proxy = (struct aa_proxy *) PROXY_POISON + 1; in aa_label_destroy()
348 void aa_label_free(struct aa_label *label) in aa_label_free() argument
350 if (!label) in aa_label_free()
353 aa_label_destroy(label); in aa_label_free()
354 kfree(label); in aa_label_free()
357 static void label_free_switch(struct aa_label *label) in label_free_switch() argument
359 if (label->flags & FLAG_NS_COUNT) in label_free_switch()
360 aa_free_ns(labels_ns(label)); in label_free_switch()
361 else if (label_isprofile(label)) in label_free_switch()
362 aa_free_profile(labels_profile(label)); in label_free_switch()
364 aa_label_free(label); in label_free_switch()
369 struct aa_label *label = container_of(head, struct aa_label, rcu); in label_free_rcu() local
371 if (label->flags & FLAG_IN_TREE) in label_free_rcu()
372 (void) aa_label_remove(label); in label_free_rcu()
373 label_free_switch(label); in label_free_rcu()
378 struct aa_label *label = container_of(kref, struct aa_label, count); in aa_label_kref() local
379 struct aa_ns *ns = labels_ns(label); in aa_label_kref()
383 label_free_switch(label); in aa_label_kref()
387 AA_BUG(label_isprofile(label) && in aa_label_kref()
388 on_list_rcu(&label->vec[0]->base.profiles)); in aa_label_kref()
389 AA_BUG(label_isprofile(label) && in aa_label_kref()
390 on_list_rcu(&label->vec[0]->base.list)); in aa_label_kref()
392 /* TODO: if compound label and not stale add to reclaim cache */ in aa_label_kref()
393 call_rcu(&label->rcu, label_free_rcu); in aa_label_kref()
396 static void label_free_or_put_new(struct aa_label *label, struct aa_label *new) in label_free_or_put_new() argument
398 if (label != new) in label_free_or_put_new()
405 bool aa_label_init(struct aa_label *label, int size, gfp_t gfp) in aa_label_init() argument
407 AA_BUG(!label); in aa_label_init()
410 if (aa_alloc_secid(label, gfp) < 0) in aa_label_init()
413 label->size = size; /* doesn't include null */ in aa_label_init()
414 label->vec[size] = NULL; /* null terminate */ in aa_label_init()
415 kref_init(&label->count); in aa_label_init()
416 RB_CLEAR_NODE(&label->node); in aa_label_init()
422 * aa_label_alloc - allocate a label with a profile vector of @size length
423 * @size: size of profile vector in the label
427 * Returns: new label
464 * label_cmp - label comparison for set ordering
465 * @a: label to compare (NOT NULL)
466 * @b: label to compare (NOT NULL)
483 int aa_label_next_confined(struct aa_label *label, int i) in aa_label_next_confined() argument
485 AA_BUG(!label); in aa_label_next_confined()
488 for (; i < label->size; i++) { in aa_label_next_confined()
489 if (!profile_unconfined(label->vec[i])) in aa_label_next_confined()
498 * @I: label iterator
499 * @set: label to test against
500 * @sub: label to if is subset of @set
537 * @set: label to test against
538 * @sub: label to test if is subset of @set
558 * @set: label to test against
559 * @sub: label to test if is subset of @set
592 * __label_remove - remove @label from the label set
593 * @label: label to remove
594 * @new: label to redirect to
596 * Requires: labels_set(@label)->lock write_lock
597 * Returns: true if the label was in the tree and removed
599 static bool __label_remove(struct aa_label *label, struct aa_label *new) in __label_remove() argument
601 struct aa_labelset *ls = labels_set(label); in __label_remove()
604 AA_BUG(!label); in __label_remove()
608 __aa_proxy_redirect(label, new); in __label_remove()
610 if (!label_is_stale(label)) in __label_remove()
611 __label_make_stale(label); in __label_remove()
613 if (label->flags & FLAG_IN_TREE) { in __label_remove()
614 rb_erase(&label->node, &ls->root); in __label_remove()
615 label->flags &= ~FLAG_IN_TREE; in __label_remove()
623 * __label_replace - replace @old with @new in label set
624 * @old: label to remove from label set
625 * @new: label to replace @old with
631 * Note: current implementation requires label set be order in such a way
633 * using pointer comparison of the label address would not work)
660 * __label_insert - attempt to insert @l into a label set
662 * @label: new label to insert (NOT NULL)
669 * else ref counted equivalent label that is already in the set,
673 struct aa_label *label, bool replace) in __label_insert() argument
678 AA_BUG(!label); in __label_insert()
679 AA_BUG(labels_set(label) != ls); in __label_insert()
681 AA_BUG(label->flags & FLAG_IN_TREE); in __label_insert()
687 int result = label_cmp(label, this); in __label_insert()
692 * so replace in place, however the label has in __label_insert()
700 __proxy_share(this, label); in __label_insert()
701 AA_BUG(!__label_replace(this, label)); in __label_insert()
702 return aa_get_label(label); in __label_insert()
710 rb_link_node(&label->node, parent, new); in __label_insert()
711 rb_insert_color(&label->node, &ls->root); in __label_insert()
712 label->flags |= FLAG_IN_TREE; in __label_insert()
713 accum_label_info(label); in __label_insert()
715 return aa_get_label(label); in __label_insert()
719 * __vec_find - find label that matches @vec in label set
720 * @vec: vec of profiles to find matching label for (NOT NULL)
726 * Returns: ref counted @label if matching label is in tree
727 * ref counted label that is equiv to @l in tree
755 * __label_find - find label @label in label set
756 * @label: label to find (NOT NULL)
758 * Requires: labels_set(@label)->lock held
761 * Returns: ref counted @label if @label is in tree OR
762 * ref counted label that is equiv to @label in tree
763 * else NULL if @label or equiv is not in tree
765 static struct aa_label *__label_find(struct aa_label *label) in __label_find() argument
767 AA_BUG(!label); in __label_find()
769 return __vec_find(label->vec, label->size); in __label_find()
774 * aa_label_remove - remove a label from the labelset
775 * @label: label to remove
777 * Returns: true if @label was removed from the tree
778 * else @label was not in tree so it could not be removed
780 bool aa_label_remove(struct aa_label *label) in aa_label_remove() argument
782 struct aa_labelset *ls = labels_set(label); in aa_label_remove()
789 res = __label_remove(label, ns_unconfined(labels_ns(label))); in aa_label_remove()
796 * aa_label_replace - replace a label @old with a new version @new
797 * @old: label to replace
798 * @new: label replacing @old
837 * vec_find - find label @l in label set
838 * @vec: array of profiles to find equiv label for (NOT NULL)
841 * Returns: refcounted label if @vec equiv is in tree
847 struct aa_label *label; in vec_find() local
856 label = __vec_find(vec, n); in vec_find()
859 return label; in vec_find()
866 struct aa_label *label = NULL; in vec_create_and_insert_label() local
875 return aa_get_label(&vec[0]->label); in vec_create_and_insert_label()
877 ls = labels_set(&vec[len - 1]->label); in vec_create_and_insert_label()
880 * check if label exists before taking locks in vec_create_and_insert_label()
890 label = __label_insert(ls, new, false); in vec_create_and_insert_label()
892 label_free_or_put_new(label, new); in vec_create_and_insert_label()
894 return label; in vec_create_and_insert_label()
900 struct aa_label *label = vec_find(vec, len); in aa_vec_find_or_create_label() local
902 if (label) in aa_vec_find_or_create_label()
903 return label; in aa_vec_find_or_create_label()
910 * aa_label_insert - insert label @label into @ls or return existing label
911 * @ls: labelset to insert @label into
912 * @label: label to insert
914 * Requires: caller to hold a valid ref on @label
916 * Returns: ref counted @label if successful in inserting @label
917 * else ref counted equivalent label that is already in the set
919 struct aa_label *aa_label_insert(struct aa_labelset *ls, struct aa_label *label) in aa_label_insert() argument
925 AA_BUG(!label); in aa_label_insert()
927 /* check if label exists before taking lock */ in aa_label_insert()
928 if (!label_is_stale(label)) { in aa_label_insert()
930 l = __label_find(label); in aa_label_insert()
937 l = __label_insert(ls, label, false); in aa_label_insert()
946 * @I: label iterator
947 * @a: label to merge
948 * @b: label to merge
986 * @a: label to merge then compare (NOT NULL)
987 * @b: label to merge then compare (NOT NULL)
988 * @z: label to compare merge against (NOT NULL)
1024 * label_merge_insert - create a new label by merging @a and @b
1025 * @new: preallocated label to merge into (NOT NULL)
1026 * @a: label to merge with @b (NOT NULL)
1027 * @b: label to merge with @a (NOT NULL)
1031 * Returns: ref counted label either @new if merge is unique
1044 struct aa_label *label; in label_merge_insert() local
1063 AA_BUG(!new->vec[k]->label.proxy); in label_merge_insert()
1064 AA_BUG(!new->vec[k]->label.proxy->label); in label_merge_insert()
1065 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1081 label = aa_get_label(&new->vec[0]->label); in label_merge_insert()
1082 return label; in label_merge_insert()
1096 label = __label_insert(labels_set(new), new, false); in label_merge_insert()
1099 return label; in label_merge_insert()
1103 * labelset_of_merge - find which labelset a merged label should be inserted
1104 * @a: label to merge and insert
1105 * @b: label to merge and insert
1107 * Returns: labelset that the merged label should be inserted into
1121 * __label_find_merge - find label that is equiv to merge of @a and @b
1123 * @a: label to merge with @b (NOT NULL)
1124 * @b: label to merge with @a (NOT NULL)
1128 * Returns: ref counted label that is equiv to merge of @a and @b
1163 * aa_label_find_merge - find label that is equiv to merge of @a and @b
1164 * @a: label to merge with @b (NOT NULL)
1165 * @b: label to merge with @a (NOT NULL)
1169 * Returns: ref counted label that is equiv to merge of @a and @b
1175 struct aa_label *label, *ar = NULL, *br = NULL; in aa_label_find_merge() local
1187 label = __label_find_merge(ls, a, b); in aa_label_find_merge()
1192 return label; in aa_label_find_merge()
1196 * aa_label_merge - attempt to insert new merged label of @a and @b
1197 * @a: label to merge with @b (NOT NULL)
1198 * @b: label to merge with @a (NOT NULL)
1204 * Returns: ref counted new label if successful in inserting merge of a & b
1205 * else ref counted equivalent label that is already in the set.
1206 * else NULL if could not create label (-ENOMEM)
1211 struct aa_label *label = NULL; in aa_label_merge() local
1220 * check if label exists before taking locks in aa_label_merge()
1222 label = aa_label_find_merge(a, b); in aa_label_merge()
1225 if (!label) { in aa_label_merge()
1238 label = label_merge_insert(new, a, b); in aa_label_merge()
1239 label_free_or_put_new(label, new); in aa_label_merge()
1245 return label; in aa_label_merge()
1272 * label_compound_match - find perms for full compound label
1275 * @label: label to check access permissions for
1283 * For the label A//&B//&C this does the perm match for A//&B//&C
1289 struct aa_label *label, in label_compound_match() argument
1297 label_for_each(i, label, tp) { in label_compound_match()
1311 label_for_each_cont(i, label, tp) { in label_compound_match()
1332 * label_components_match - find perms for all subcomponents of a label
1335 * @label: label to check access permissions for
1343 * For the label A//&B//&C this does the perm match for each of A and B and C
1349 struct aa_label *label, aa_state_t start, in label_components_match() argument
1359 label_for_each(i, label, tp) { in label_components_match()
1375 label_for_each_cont(i, label, tp) { in label_components_match()
1397 * aa_label_match - do a multi-component label match
1400 * @label: label to match (NOT NULL)
1409 struct aa_label *label, aa_state_t state, bool subns, in aa_label_match() argument
1412 int error = label_compound_match(profile, rules, label, state, subns, in aa_label_match()
1418 return label_components_match(profile, rules, label, state, subns, in aa_label_match()
1424 * aa_update_label_name - update a label to have a stored name
1426 * @label: label to update (NOT NULL)
1429 * Requires: labels_set(label) not locked in caller
1431 * note: only updates the label name if it does not have a name already
1434 bool aa_update_label_name(struct aa_ns *ns, struct aa_label *label, gfp_t gfp) in aa_update_label_name() argument
1442 AA_BUG(!label); in aa_update_label_name()
1444 if (label->hname || labels_ns(label) != ns) in aa_update_label_name()
1447 if (aa_label_acntsxprint(&name, ns, label, FLAGS_NONE, gfp) < 0) in aa_update_label_name()
1450 ls = labels_set(label); in aa_update_label_name()
1452 if (!label->hname && label->flags & FLAG_IN_TREE) { in aa_update_label_name()
1453 label->hname = name; in aa_update_label_name()
1463 * cached label name is present and visible
1464 * @label->hname only exists if label is namespace hierarchical
1466 static inline bool use_label_hname(struct aa_ns *ns, struct aa_label *label, in use_label_hname() argument
1469 if (label->hname && (!ns || labels_ns(label) == ns) && in use_label_hname()
1543 static const char *label_modename(struct aa_ns *ns, struct aa_label *label, in label_modename() argument
1550 label_for_each(i, label, profile) { in label_modename()
1575 /* if any visible label is not unconfined the display_mode returns true */
1576 static inline bool display_mode(struct aa_ns *ns, struct aa_label *label, in display_mode() argument
1583 label_for_each(i, label, profile) { in display_mode()
1597 * aa_label_snxprint - print a label name to a string buffer
1601 * @label: label to view (NOT NULL)
1610 * label is not visible it will just be excluded. And if none
1611 * of the label is visible "---" will be used.
1614 struct aa_label *label, int flags) in aa_label_snxprint() argument
1623 AA_BUG(!label); in aa_label_snxprint()
1630 ns = labels_ns(label); in aa_label_snxprint()
1633 label_for_each(i, label, profile) { in aa_label_snxprint()
1656 if (display_mode(ns, label, flags)) { in aa_label_snxprint()
1658 label_modename(ns, label, flags)); in aa_label_snxprint()
1667 * aa_label_asxprint - allocate a string buffer and print label into it
1668 * @strp: Returns - the allocated buffer with the label name. (NOT NULL)
1670 * @label: label to view (NOT NULL)
1671 * @flags: flags controlling what label info is printed
1677 int aa_label_asxprint(char **strp, struct aa_ns *ns, struct aa_label *label, in aa_label_asxprint() argument
1683 AA_BUG(!label); in aa_label_asxprint()
1685 size = aa_label_snxprint(NULL, 0, ns, label, flags); in aa_label_asxprint()
1692 return aa_label_snxprint(*strp, size + 1, ns, label, flags); in aa_label_asxprint()
1696 * aa_label_acntsxprint - allocate a __counted string buffer and print label
1699 * @label: label to view (NOT NULL)
1700 * @flags: flags controlling what label info is printed
1707 struct aa_label *label, int flags, gfp_t gfp) in aa_label_acntsxprint() argument
1712 AA_BUG(!label); in aa_label_acntsxprint()
1714 size = aa_label_snxprint(NULL, 0, ns, label, flags); in aa_label_acntsxprint()
1721 return aa_label_snxprint(*strp, size + 1, ns, label, flags); in aa_label_acntsxprint()
1726 struct aa_label *label, int flags, gfp_t gfp) in aa_label_xaudit() argument
1733 AA_BUG(!label); in aa_label_xaudit()
1735 if (!use_label_hname(ns, label, flags) || in aa_label_xaudit()
1736 display_mode(ns, label, flags)) { in aa_label_xaudit()
1737 len = aa_label_asxprint(&name, ns, label, flags, gfp); in aa_label_xaudit()
1739 AA_DEBUG(DEBUG_LABEL, "label print error"); in aa_label_xaudit()
1744 str = (char *) label->hname; in aa_label_xaudit()
1756 struct aa_label *label, int flags, gfp_t gfp) in aa_label_seq_xprint() argument
1759 AA_BUG(!label); in aa_label_seq_xprint()
1761 if (!use_label_hname(ns, label, flags)) { in aa_label_seq_xprint()
1765 len = aa_label_asxprint(&str, ns, label, flags, gfp); in aa_label_seq_xprint()
1767 AA_DEBUG(DEBUG_LABEL, "label print error"); in aa_label_seq_xprint()
1772 } else if (display_mode(ns, label, flags)) in aa_label_seq_xprint()
1773 seq_printf(f, "%s (%s)", label->hname, in aa_label_seq_xprint()
1774 label_modename(ns, label, flags)); in aa_label_seq_xprint()
1776 seq_puts(f, label->hname); in aa_label_seq_xprint()
1779 void aa_label_xprintk(struct aa_ns *ns, struct aa_label *label, int flags, in aa_label_xprintk() argument
1782 AA_BUG(!label); in aa_label_xprintk()
1784 if (!use_label_hname(ns, label, flags)) { in aa_label_xprintk()
1788 len = aa_label_asxprint(&str, ns, label, flags, gfp); in aa_label_xprintk()
1790 AA_DEBUG(DEBUG_LABEL, "label print error"); in aa_label_xprintk()
1795 } else if (display_mode(ns, label, flags)) in aa_label_xprintk()
1796 pr_info("%s (%s)", label->hname, in aa_label_xprintk()
1797 label_modename(ns, label, flags)); in aa_label_xprintk()
1799 pr_info("%s", label->hname); in aa_label_xprintk()
1802 void aa_label_printk(struct aa_label *label, gfp_t gfp) in aa_label_printk() argument
1806 aa_label_xprintk(ns, label, FLAG_VIEW_SUBNS, gfp); in aa_label_printk()
1848 * aa_label_strn_parse - parse, validate and convert a text string to a label
1849 * @base: base label to use for lookups (NOT NULL)
1856 * Returns: the matching refcounted label if present
1864 struct aa_label *label, *currbase = base; in aa_label_strn_parse() local
1874 base != &root_ns->unconfined->label)) in aa_label_strn_parse()
1903 currbase = &vec[i]->label; in aa_label_strn_parse()
1915 return &vec[0]->label; in aa_label_strn_parse()
1920 label = aa_get_label(&vec[0]->label); in aa_label_strn_parse()
1925 label = aa_vec_find_or_create_label(vec, len, gfp); in aa_label_strn_parse()
1927 label = vec_find(vec, len); in aa_label_strn_parse()
1928 if (!label) in aa_label_strn_parse()
1934 return label; in aa_label_strn_parse()
1937 label = ERR_PTR(-ENOENT); in aa_label_strn_parse()
1949 * aa_labelset_destroy - remove all labels from the label set
1950 * @ls: label set to cleanup (NOT NULL)
1988 struct aa_label *label; in labelset_next_stale() local
1997 label = rb_entry(node, struct aa_label, node); in labelset_next_stale()
1998 if ((label_is_stale(label) || in labelset_next_stale()
1999 vec_is_stale(label->vec, label->size)) && in labelset_next_stale()
2000 __aa_get_label(label)) in labelset_next_stale()
2004 label = NULL; in labelset_next_stale()
2009 return label; in labelset_next_stale()
2013 * __label_update - insert updated version of @label into labelset
2014 * @label: the label to update/replace
2016 * Returns: new label that is up to date
2021 * Note: worst case is the stale @label does not get updated and has
2024 static struct aa_label *__label_update(struct aa_label *label) in __label_update() argument
2031 AA_BUG(!label); in __label_update()
2032 AA_BUG(!mutex_is_locked(&labels_ns(label)->lock)); in __label_update()
2034 new = aa_label_alloc(label->size, label->proxy, GFP_KERNEL); in __label_update()
2040 * and label updates, label merging and removal can be occurring in __label_update()
2042 ls = labels_set(label); in __label_update()
2044 for (i = 0; i < label->size; i++) { in __label_update()
2045 AA_BUG(!label->vec[i]); in __label_update()
2046 new->vec[i] = aa_get_newest_profile(label->vec[i]); in __label_update()
2048 AA_BUG(!new->vec[i]->label.proxy); in __label_update()
2049 AA_BUG(!new->vec[i]->label.proxy->label); in __label_update()
2050 if (new->vec[i]->label.proxy != label->vec[i]->label.proxy) in __label_update()
2054 /* updated stale label by being removed/renamed from labelset */ in __label_update()
2060 tmp = aa_get_label(&new->vec[0]->label); in __label_update()
2061 AA_BUG(tmp == label); in __label_update()
2064 if (labels_set(label) != labels_set(new)) { in __label_update()
2071 AA_BUG(labels_ns(label) != labels_ns(new)); in __label_update()
2073 tmp = __label_insert(labels_set(label), new, true); in __label_update()
2075 /* ensure label is removed, and redirected correctly */ in __label_update()
2076 __label_remove(label, tmp); in __label_update()
2090 * Any label that has a stale component is marked stale and replaced and
2098 struct aa_label *label; in __labelset_update() local
2104 label = labelset_next_stale(&ns->labels); in __labelset_update()
2105 if (label) { in __labelset_update()
2106 struct aa_label *l = __label_update(label); in __labelset_update()
2109 aa_put_label(label); in __labelset_update()
2111 } while (label); in __labelset_update()