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
157 * @a: label to compare (NOT NULL)
312 void aa_label_destroy(struct aa_label *label) in aa_label_destroy() argument
314 AA_BUG(!label); in aa_label_destroy()
316 if (!label_isprofile(label)) { in aa_label_destroy()
320 aa_put_str(label->hname); in aa_label_destroy()
322 label_for_each(i, label, profile) { in aa_label_destroy()
324 label->vec[i.i] = (struct aa_profile *) in aa_label_destroy()
329 if (label->proxy) { in aa_label_destroy()
330 if (rcu_dereference_protected(label->proxy->label, true) == label) in aa_label_destroy()
331 rcu_assign_pointer(label->proxy->label, NULL); in aa_label_destroy()
332 aa_put_proxy(label->proxy); in aa_label_destroy()
334 aa_free_secid(label->secid); in aa_label_destroy()
336 label->proxy = (struct aa_proxy *) PROXY_POISON + 1; in aa_label_destroy()
339 void aa_label_free(struct aa_label *label) in aa_label_free() argument
341 if (!label) in aa_label_free()
344 aa_label_destroy(label); in aa_label_free()
345 kfree(label); in aa_label_free()
348 static void label_free_switch(struct aa_label *label) in label_free_switch() argument
350 if (label->flags & FLAG_NS_COUNT) in label_free_switch()
351 aa_free_ns(labels_ns(label)); in label_free_switch()
352 else if (label_isprofile(label)) in label_free_switch()
353 aa_free_profile(labels_profile(label)); in label_free_switch()
355 aa_label_free(label); in label_free_switch()
360 struct aa_label *label = container_of(head, struct aa_label, rcu); in label_free_rcu() local
362 if (label->flags & FLAG_IN_TREE) in label_free_rcu()
363 (void) aa_label_remove(label); in label_free_rcu()
364 label_free_switch(label); in label_free_rcu()
369 struct aa_label *label = container_of(kref, struct aa_label, count); in aa_label_kref() local
370 struct aa_ns *ns = labels_ns(label); in aa_label_kref()
374 label_free_switch(label); in aa_label_kref()
378 AA_BUG(label_isprofile(label) && in aa_label_kref()
379 on_list_rcu(&label->vec[0]->base.profiles)); in aa_label_kref()
380 AA_BUG(label_isprofile(label) && in aa_label_kref()
381 on_list_rcu(&label->vec[0]->base.list)); in aa_label_kref()
383 /* TODO: if compound label and not stale add to reclaim cache */ in aa_label_kref()
384 call_rcu(&label->rcu, label_free_rcu); in aa_label_kref()
387 static void label_free_or_put_new(struct aa_label *label, struct aa_label *new) in label_free_or_put_new() argument
389 if (label != new) in label_free_or_put_new()
396 bool aa_label_init(struct aa_label *label, int size, gfp_t gfp) in aa_label_init() argument
398 AA_BUG(!label); in aa_label_init()
401 if (aa_alloc_secid(label, gfp) < 0) in aa_label_init()
404 label->size = size; /* doesn't include null */ in aa_label_init()
405 label->vec[size] = NULL; /* null terminate */ in aa_label_init()
406 kref_init(&label->count); in aa_label_init()
407 RB_CLEAR_NODE(&label->node); in aa_label_init()
413 * aa_label_alloc - allocate a label with a profile vector of @size length
414 * @size: size of profile vector in the label
418 * Returns: new label
456 * label_cmp - label comparison for set ordering
457 * @a: label to compare (NOT NULL)
458 * @b: label to compare (NOT NULL)
475 int aa_label_next_confined(struct aa_label *label, int i) in aa_label_next_confined() argument
477 AA_BUG(!label); in aa_label_next_confined()
480 for (; i < label->size; i++) { in aa_label_next_confined()
481 if (!profile_unconfined(label->vec[i])) in aa_label_next_confined()
490 * @I: label iterator
491 * @set: label to test against
492 * @sub: label to if is subset of @set
529 * @set: label to test against
530 * @sub: label to test if is subset of @set
550 * @set: label to test against
551 * @sub: label to test if is subset of @set
584 * __label_remove - remove @label from the label set
585 * @l: label to remove
586 * @new: label to redirect to
588 * Requires: labels_set(@label)->lock write_lock
589 * Returns: true if the label was in the tree and removed
591 static bool __label_remove(struct aa_label *label, struct aa_label *new) in __label_remove() argument
593 struct aa_labelset *ls = labels_set(label); in __label_remove()
596 AA_BUG(!label); in __label_remove()
600 __aa_proxy_redirect(label, new); in __label_remove()
602 if (!label_is_stale(label)) in __label_remove()
603 __label_make_stale(label); in __label_remove()
605 if (label->flags & FLAG_IN_TREE) { in __label_remove()
606 rb_erase(&label->node, &ls->root); in __label_remove()
607 label->flags &= ~FLAG_IN_TREE; in __label_remove()
615 * __label_replace - replace @old with @new in label set
616 * @old: label to remove from label set
617 * @new: label to replace @old with
623 * Note: current implementation requires label set be order in such a way
625 * using pointer comparison of the label address would not work)
651 * __label_insert - attempt to insert @l into a label set
653 * @label: new label to insert (NOT NULL)
660 * else ref counted equivalent label that is already in the set,
664 struct aa_label *label, bool replace) in __label_insert() argument
669 AA_BUG(!label); in __label_insert()
670 AA_BUG(labels_set(label) != ls); in __label_insert()
672 AA_BUG(label->flags & FLAG_IN_TREE); in __label_insert()
678 int result = label_cmp(label, this); in __label_insert()
683 * so replace in place, however the label has in __label_insert()
691 __proxy_share(this, label); in __label_insert()
692 AA_BUG(!__label_replace(this, label)); in __label_insert()
693 return aa_get_label(label); in __label_insert()
701 rb_link_node(&label->node, parent, new); in __label_insert()
702 rb_insert_color(&label->node, &ls->root); in __label_insert()
703 label->flags |= FLAG_IN_TREE; in __label_insert()
705 return aa_get_label(label); in __label_insert()
709 * __vec_find - find label that matches @vec in label set
710 * @vec: vec of profiles to find matching label for (NOT NULL)
716 * Returns: ref counted @label if matching label is in tree
717 * ref counted label that is equiv to @l in tree
745 * __label_find - find label @label in label set
746 * @label: label to find (NOT NULL)
748 * Requires: labels_set(@label)->lock held
751 * Returns: ref counted @label if @label is in tree OR
752 * ref counted label that is equiv to @label in tree
753 * else NULL if @label or equiv is not in tree
755 static struct aa_label *__label_find(struct aa_label *label) in __label_find() argument
757 AA_BUG(!label); in __label_find()
759 return __vec_find(label->vec, label->size); in __label_find()
764 * aa_label_remove - remove a label from the labelset
765 * @label: label to remove
767 * Returns: true if @label was removed from the tree
768 * else @label was not in tree so it could not be removed
770 bool aa_label_remove(struct aa_label *label) in aa_label_remove() argument
772 struct aa_labelset *ls = labels_set(label); in aa_label_remove()
779 res = __label_remove(label, ns_unconfined(labels_ns(label))); in aa_label_remove()
786 * aa_label_replace - replace a label @old with a new version @new
787 * @old: label to replace
788 * @new: label replacing @old
827 * vec_find - find label @l in label set
828 * @vec: array of profiles to find equiv label for (NOT NULL)
831 * Returns: refcounted label if @vec equiv is in tree
837 struct aa_label *label; in vec_find() local
846 label = __vec_find(vec, n); in vec_find()
849 return label; in vec_find()
856 struct aa_label *label = NULL; in vec_create_and_insert_label() local
865 return aa_get_label(&vec[0]->label); in vec_create_and_insert_label()
867 ls = labels_set(&vec[len - 1]->label); in vec_create_and_insert_label()
870 * check if label exists before taking locks in vec_create_and_insert_label()
880 label = __label_insert(ls, new, false); in vec_create_and_insert_label()
882 label_free_or_put_new(label, new); in vec_create_and_insert_label()
884 return label; in vec_create_and_insert_label()
890 struct aa_label *label = vec_find(vec, len); in aa_vec_find_or_create_label() local
892 if (label) in aa_vec_find_or_create_label()
893 return label; in aa_vec_find_or_create_label()
899 * aa_label_find - find label @label in label set
900 * @label: label to find (NOT NULL)
904 * Returns: refcounted @label if @label is in tree
905 * refcounted label that is equiv to @label in tree
906 * else NULL if @label or equiv is not in tree
908 struct aa_label *aa_label_find(struct aa_label *label) in aa_label_find() argument
910 AA_BUG(!label); in aa_label_find()
912 return vec_find(label->vec, label->size); in aa_label_find()
917 * aa_label_insert - insert label @label into @ls or return existing label
918 * @ls - labelset to insert @label into
919 * @label - label to insert
921 * Requires: caller to hold a valid ref on @label
923 * Returns: ref counted @label if successful in inserting @label
924 * else ref counted equivalent label that is already in the set
926 struct aa_label *aa_label_insert(struct aa_labelset *ls, struct aa_label *label) in aa_label_insert() argument
932 AA_BUG(!label); in aa_label_insert()
934 /* check if label exists before taking lock */ in aa_label_insert()
935 if (!label_is_stale(label)) { in aa_label_insert()
937 l = __label_find(label); in aa_label_insert()
944 l = __label_insert(ls, label, false); in aa_label_insert()
953 * @I: label iterator
954 * @a: label to merge
955 * @b: label to merge
993 * @a: label to merge then compare (NOT NULL)
994 * @b: label to merge then compare (NOT NULL)
995 * @z: label to compare merge against (NOT NULL)
1031 * label_merge_insert - create a new label by merging @a and @b
1032 * @new: preallocated label to merge into (NOT NULL)
1033 * @a: label to merge with @b (NOT NULL)
1034 * @b: label to merge with @a (NOT NULL)
1038 * Returns: ref counted label either @new if merge is unique
1051 struct aa_label *label; in label_merge_insert() local
1070 AA_BUG(!new->vec[k]->label.proxy); in label_merge_insert()
1071 AA_BUG(!new->vec[k]->label.proxy->label); in label_merge_insert()
1072 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1088 label = aa_get_label(&new->vec[0]->label); in label_merge_insert()
1089 return label; in label_merge_insert()
1105 label = __label_insert(labels_set(new), new, false); in label_merge_insert()
1108 return label; in label_merge_insert()
1112 * labelset_of_merge - find which labelset a merged label should be inserted
1113 * @a: label to merge and insert
1114 * @b: label to merge and insert
1116 * Returns: labelset that the merged label should be inserted into
1130 * __label_find_merge - find label that is equiv to merge of @a and @b
1132 * @a: label to merge with @b (NOT NULL)
1133 * @b: label to merge with @a (NOT NULL)
1137 * Returns: ref counted label that is equiv to merge of @a and @b
1172 * aa_label_find_merge - find label that is equiv to merge of @a and @b
1173 * @a: label to merge with @b (NOT NULL)
1174 * @b: label to merge with @a (NOT NULL)
1178 * Returns: ref counted label that is equiv to merge of @a and @b
1184 struct aa_label *label, *ar = NULL, *br = NULL; in aa_label_find_merge() local
1196 label = __label_find_merge(ls, a, b); in aa_label_find_merge()
1201 return label; in aa_label_find_merge()
1205 * aa_label_merge - attempt to insert new merged label of @a and @b
1206 * @ls: set of labels to insert label into (NOT NULL)
1207 * @a: label to merge with @b (NOT NULL)
1208 * @b: label to merge with @a (NOT NULL)
1214 * Returns: ref counted new label if successful in inserting merge of a & b
1215 * else ref counted equivalent label that is already in the set.
1216 * else NULL if could not create label (-ENOMEM)
1221 struct aa_label *label = NULL; in aa_label_merge() local
1230 * check if label exists before taking locks in aa_label_merge()
1232 label = aa_label_find_merge(a, b); in aa_label_merge()
1235 if (!label) { in aa_label_merge()
1248 label = label_merge_insert(new, a, b); in aa_label_merge()
1249 label_free_or_put_new(label, new); in aa_label_merge()
1255 return label; in aa_label_merge()
1259 struct aa_label *label) in label_is_visible() argument
1261 return aa_ns_visible(profile->ns, labels_ns(label), true); in label_is_visible()
1287 * label_compound_match - find perms for full compound label
1289 * @label: label to check access permissions for
1297 * For the label A//&B//&C this does the perm match for A//&B//&C
1302 struct aa_label *label, in label_compound_match() argument
1310 label_for_each(i, label, tp) { in label_compound_match()
1324 label_for_each_cont(i, label, tp) { in label_compound_match()
1345 * label_components_match - find perms for all subcomponents of a label
1347 * @label: label to check access permissions for
1355 * For the label A//&B//&C this does the perm match for each of A and B and C
1360 struct aa_label *label, unsigned int start, in label_components_match() argument
1370 label_for_each(i, label, tp) { in label_components_match()
1386 label_for_each_cont(i, label, tp) { in label_components_match()
1408 * aa_label_match - do a multi-component label match
1410 * @label: label to match (NOT NULL)
1418 int aa_label_match(struct aa_profile *profile, struct aa_label *label, in aa_label_match() argument
1422 int error = label_compound_match(profile, label, state, subns, request, in aa_label_match()
1428 return label_components_match(profile, label, state, subns, request, in aa_label_match()
1434 * aa_update_label_name - update a label to have a stored name
1436 * @label: label to update (NOT NULL)
1439 * Requires: labels_set(label) not locked in caller
1441 * note: only updates the label name if it does not have a name already
1444 bool aa_update_label_name(struct aa_ns *ns, struct aa_label *label, gfp_t gfp) in aa_update_label_name() argument
1452 AA_BUG(!label); in aa_update_label_name()
1454 if (label->hname || labels_ns(label) != ns) in aa_update_label_name()
1457 if (aa_label_acntsxprint(&name, ns, label, FLAGS_NONE, gfp) == -1) in aa_update_label_name()
1460 ls = labels_set(label); in aa_update_label_name()
1462 if (!label->hname && label->flags & FLAG_IN_TREE) { in aa_update_label_name()
1463 label->hname = name; in aa_update_label_name()
1473 * cached label name is present and visible
1474 * @label->hname only exists if label is namespace hierachical
1476 static inline bool use_label_hname(struct aa_ns *ns, struct aa_label *label, in use_label_hname() argument
1479 if (label->hname && (!ns || labels_ns(label) == ns) && in use_label_hname()
1553 static const char *label_modename(struct aa_ns *ns, struct aa_label *label, in label_modename() argument
1560 label_for_each(i, label, profile) { in label_modename()
1585 /* if any visible label is not unconfined the display_mode returns true */
1586 static inline bool display_mode(struct aa_ns *ns, struct aa_label *label, in display_mode() argument
1593 label_for_each(i, label, profile) { in display_mode()
1607 * aa_label_snxprint - print a label name to a string buffer
1611 * @label: label to view (NOT NULL)
1620 * label is not visible it will just be excluded. And if none
1621 * of the label is visible "---" will be used.
1624 struct aa_label *label, int flags) in aa_label_snxprint() argument
1633 AA_BUG(!label); in aa_label_snxprint()
1640 ns = labels_ns(label); in aa_label_snxprint()
1643 label_for_each(i, label, profile) { in aa_label_snxprint()
1666 if (display_mode(ns, label, flags)) { in aa_label_snxprint()
1668 label_modename(ns, label, flags)); in aa_label_snxprint()
1677 * aa_label_asxprint - allocate a string buffer and print label into it
1678 * @strp: Returns - the allocated buffer with the label name. (NOT NULL)
1680 * @label: label to view (NOT NULL)
1681 * @flags: flags controlling what label info is printed
1687 int aa_label_asxprint(char **strp, struct aa_ns *ns, struct aa_label *label, in aa_label_asxprint() argument
1693 AA_BUG(!label); in aa_label_asxprint()
1695 size = aa_label_snxprint(NULL, 0, ns, label, flags); in aa_label_asxprint()
1702 return aa_label_snxprint(*strp, size + 1, ns, label, flags); in aa_label_asxprint()
1706 * aa_label_acntsxprint - allocate a __counted string buffer and print label
1709 * @label: label to view (NOT NULL)
1710 * @flags: flags controlling what label info is printed
1717 struct aa_label *label, int flags, gfp_t gfp) in aa_label_acntsxprint() argument
1722 AA_BUG(!label); in aa_label_acntsxprint()
1724 size = aa_label_snxprint(NULL, 0, ns, label, flags); in aa_label_acntsxprint()
1731 return aa_label_snxprint(*strp, size + 1, ns, label, flags); in aa_label_acntsxprint()
1736 struct aa_label *label, int flags, gfp_t gfp) in aa_label_xaudit() argument
1743 AA_BUG(!label); in aa_label_xaudit()
1745 if (!use_label_hname(ns, label, flags) || in aa_label_xaudit()
1746 display_mode(ns, label, flags)) { in aa_label_xaudit()
1747 len = aa_label_asxprint(&name, ns, label, flags, gfp); in aa_label_xaudit()
1749 AA_DEBUG("label print error"); in aa_label_xaudit()
1754 str = (char *) label->hname; in aa_label_xaudit()
1766 struct aa_label *label, int flags, gfp_t gfp) in aa_label_seq_xprint() argument
1769 AA_BUG(!label); in aa_label_seq_xprint()
1771 if (!use_label_hname(ns, label, flags)) { in aa_label_seq_xprint()
1775 len = aa_label_asxprint(&str, ns, label, flags, gfp); in aa_label_seq_xprint()
1777 AA_DEBUG("label print error"); in aa_label_seq_xprint()
1782 } else if (display_mode(ns, label, flags)) in aa_label_seq_xprint()
1783 seq_printf(f, "%s (%s)", label->hname, in aa_label_seq_xprint()
1784 label_modename(ns, label, flags)); in aa_label_seq_xprint()
1786 seq_puts(f, label->hname); in aa_label_seq_xprint()
1789 void aa_label_xprintk(struct aa_ns *ns, struct aa_label *label, int flags, in aa_label_xprintk() argument
1792 AA_BUG(!label); in aa_label_xprintk()
1794 if (!use_label_hname(ns, label, flags)) { in aa_label_xprintk()
1798 len = aa_label_asxprint(&str, ns, label, flags, gfp); in aa_label_xprintk()
1800 AA_DEBUG("label print error"); in aa_label_xprintk()
1805 } else if (display_mode(ns, label, flags)) in aa_label_xprintk()
1806 pr_info("%s (%s)", label->hname, in aa_label_xprintk()
1807 label_modename(ns, label, flags)); in aa_label_xprintk()
1809 pr_info("%s", label->hname); in aa_label_xprintk()
1812 void aa_label_audit(struct audit_buffer *ab, struct aa_label *label, gfp_t gfp) in aa_label_audit() argument
1816 aa_label_xaudit(ab, ns, label, FLAG_VIEW_SUBNS, gfp); in aa_label_audit()
1820 void aa_label_seq_print(struct seq_file *f, struct aa_label *label, gfp_t gfp) in aa_label_seq_print() argument
1824 aa_label_seq_xprint(f, ns, label, FLAG_VIEW_SUBNS, gfp); in aa_label_seq_print()
1828 void aa_label_printk(struct aa_label *label, gfp_t gfp) in aa_label_printk() argument
1832 aa_label_xprintk(ns, label, FLAG_VIEW_SUBNS, gfp); in aa_label_printk()
1874 * aa_label_strn_parse - parse, validate and convert a text string to a label
1875 * @base: base label to use for lookups (NOT NULL)
1882 * Returns: the matching refcounted label if present
1890 struct aa_label *label, *currbase = base; in aa_label_strn_parse() local
1899 if (str == NULL || (*str == '=' && base != &root_ns->unconfined->label)) in aa_label_strn_parse()
1928 currbase = &vec[i]->label; in aa_label_strn_parse()
1940 return &vec[0]->label; in aa_label_strn_parse()
1945 label = aa_get_label(&vec[0]->label); in aa_label_strn_parse()
1950 label = aa_vec_find_or_create_label(vec, len, gfp); in aa_label_strn_parse()
1952 label = vec_find(vec, len); in aa_label_strn_parse()
1953 if (!label) in aa_label_strn_parse()
1959 return label; in aa_label_strn_parse()
1962 label = ERR_PTR(-ENOENT); in aa_label_strn_parse()
1974 * aa_labelset_destroy - remove all labels from the label set
1975 * @ls: label set to cleanup (NOT NULL)
2013 struct aa_label *label; in labelset_next_stale() local
2022 label = rb_entry(node, struct aa_label, node); in labelset_next_stale()
2023 if ((label_is_stale(label) || in labelset_next_stale()
2024 vec_is_stale(label->vec, label->size)) && in labelset_next_stale()
2025 __aa_get_label(label)) in labelset_next_stale()
2029 label = NULL; in labelset_next_stale()
2034 return label; in labelset_next_stale()
2038 * __label_update - insert updated version of @label into labelset
2039 * @label - the label to update/replace
2041 * Returns: new label that is up to date
2046 * Note: worst case is the stale @label does not get updated and has
2049 static struct aa_label *__label_update(struct aa_label *label) in __label_update() argument
2056 AA_BUG(!label); in __label_update()
2057 AA_BUG(!mutex_is_locked(&labels_ns(label)->lock)); in __label_update()
2059 new = aa_label_alloc(label->size, label->proxy, GFP_KERNEL); in __label_update()
2065 * and label updates, label merging and removal can be occurring in __label_update()
2067 ls = labels_set(label); in __label_update()
2069 for (i = 0; i < label->size; i++) { in __label_update()
2070 AA_BUG(!label->vec[i]); in __label_update()
2071 new->vec[i] = aa_get_newest_profile(label->vec[i]); in __label_update()
2073 AA_BUG(!new->vec[i]->label.proxy); in __label_update()
2074 AA_BUG(!new->vec[i]->label.proxy->label); in __label_update()
2075 if (new->vec[i]->label.proxy != label->vec[i]->label.proxy) in __label_update()
2079 /* updated stale label by being removed/renamed from labelset */ in __label_update()
2085 tmp = aa_get_label(&new->vec[0]->label); in __label_update()
2086 AA_BUG(tmp == label); in __label_update()
2089 if (labels_set(label) != labels_set(new)) { in __label_update()
2096 AA_BUG(labels_ns(label) != labels_ns(new)); in __label_update()
2098 tmp = __label_insert(labels_set(label), new, true); in __label_update()
2100 /* ensure label is removed, and redirected correctly */ in __label_update()
2101 __label_remove(label, tmp); in __label_update()
2115 * Any label that has a stale component is marked stale and replaced and
2123 struct aa_label *label; in __labelset_update() local
2129 label = labelset_next_stale(&ns->labels); in __labelset_update()
2130 if (label) { in __labelset_update()
2131 struct aa_label *l = __label_update(label); in __labelset_update()
2134 aa_put_label(label); in __labelset_update()
2136 } while (label); in __labelset_update()