62 	struct aa_proxy *new;  in aa_alloc_proxy()  local
64 	new = kzalloc(sizeof(struct aa_proxy), gfp);  in aa_alloc_proxy()
65 	if (new) {  in aa_alloc_proxy()
66 		kref_init(&new->count);  in aa_alloc_proxy()
67 		rcu_assign_pointer(new->label, aa_get_label(label));  in aa_alloc_proxy()
69 	return new;  in aa_alloc_proxy()
73 void __aa_proxy_redirect(struct aa_label *orig, struct aa_label *new)  in __aa_proxy_redirect()  argument
78 	AA_BUG(!new);  in __aa_proxy_redirect()
83 	rcu_assign_pointer(orig->proxy->label, aa_get_label(new));  in __aa_proxy_redirect()
88 static void __proxy_share(struct aa_label *old, struct aa_label *new)  in __proxy_share()  argument
90 	struct aa_proxy *proxy = new->proxy;  in __proxy_share()
92 	new->proxy = aa_get_proxy(old->proxy);  in __proxy_share()
93 	__aa_proxy_redirect(old, new);  in __proxy_share()
201 static void accum_label_info(struct aa_label *new)  in accum_label_info()  argument
206 	AA_BUG(!new);  in accum_label_info()
209 	if (new->size == 1)  in accum_label_info()
212 	for (i = 0; i < new->size; i++) {  in accum_label_info()
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()
219 	new->flags |= u;  in accum_label_info()
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()
400 		aa_label_free(new);  in label_free_or_put_new()
402 		aa_put_label(new);  in label_free_or_put_new()
424  * @proxy: proxy to use OR null if to allocate a new one
427  * Returns: new label
432 	struct aa_label *new;  in aa_label_alloc()  local
437 	new = kzalloc(struct_size(new, vec, size + 1), gfp);  in aa_label_alloc()
438 	AA_DEBUG(DEBUG_LABEL, "%s (%p)\n", __func__, new);  in aa_label_alloc()
439 	if (!new)  in aa_label_alloc()
442 	if (!aa_label_init(new, size, gfp))  in aa_label_alloc()
446 		proxy = aa_alloc_proxy(new, gfp);  in aa_label_alloc()
451 	/* just set new's proxy, don't redirect proxy here if it was passed in*/  in aa_label_alloc()
452 	new->proxy = proxy;  in aa_label_alloc()
454 	return new;  in aa_label_alloc()
457 	kfree(new);  in aa_label_alloc()
594  * @new: label to redirect to
599 static bool __label_remove(struct aa_label *label, struct aa_label *new)  in __label_remove()  argument
607 	if (new)  in __label_remove()
608 		__aa_proxy_redirect(label, new);  in __label_remove()
623  * __label_replace - replace @old with @new in label set
625  * @new: label to replace @old with
628  *           valid ref count be held on @new
629  * Returns: true if @old was in set and replaced by @new
632  *       that @new directly replaces @old position in the set (ie.
635 static bool __label_replace(struct aa_label *old, struct aa_label *new)  in __label_replace()  argument
641 	AA_BUG(!new);  in __label_replace()
643 	AA_BUG(new->flags & FLAG_IN_TREE);  in __label_replace()
649 		rb_replace_node(&old->node, &new->node, &ls->root);  in __label_replace()
651 		new->flags |= FLAG_IN_TREE;  in __label_replace()
652 		accum_label_info(new);  in __label_replace()
662  * @label: new label to insert (NOT NULL)
675 	struct rb_node **new, *parent = NULL;  in __label_insert()  local
683 	/* Figure out where to put new node */  in __label_insert()
684 	new = &ls->root.rb_node;  in __label_insert()
685 	while (*new) {  in __label_insert()
686 		struct aa_label *this = rb_entry(*new, struct aa_label, node);  in __label_insert()
689 		parent = *new;  in __label_insert()
704 			new = &((*new)->rb_left);  in __label_insert()
706 			new = &((*new)->rb_right);  in __label_insert()
709 	/* Add new node and rebalance tree. */  in __label_insert()
710 	rb_link_node(&label->node, parent, new);  in __label_insert()
796  * aa_label_replace - replace a label @old with a new version @new
798  * @new: label replacing @old
801  *     else @old was not in tree, and @new was not inserted
803 bool aa_label_replace(struct aa_label *old, struct aa_label *new)  in aa_label_replace()  argument
808 	if (name_is_shared(old, new) && labels_ns(old) == labels_ns(new)) {  in aa_label_replace()
810 		if (old->proxy != new->proxy)  in aa_label_replace()
811 			__proxy_share(old, new);  in aa_label_replace()
813 			__aa_proxy_redirect(old, new);  in aa_label_replace()
814 		res = __label_replace(old, new);  in aa_label_replace()
821 		res = __label_remove(old, new);  in aa_label_replace()
822 		if (labels_ns(old) != labels_ns(new)) {  in aa_label_replace()
824 			ls = labels_set(new);  in aa_label_replace()
827 		l = __label_insert(ls, new, true);  in aa_label_replace()
828 		res = (l == new);  in aa_label_replace()
869 	struct aa_label *new;  in vec_create_and_insert_label()  local
882 	new = aa_label_alloc(len, NULL, gfp);  in vec_create_and_insert_label()
883 	if (!new)  in vec_create_and_insert_label()
887 		new->vec[i] = aa_get_profile(vec[i]);  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()
1024  * label_merge_insert - create a new label by merging @a and @b
1025  * @new: preallocated label to merge into (NOT NULL)
1031  * Returns: ref counted label either @new if merge is unique
1035  * NOTE: will not use @new if the merge results in @new == @a or @b
1040 static struct aa_label *label_merge_insert(struct aa_label *new,  in label_merge_insert()  argument
1056 	AA_BUG(!new);  in label_merge_insert()
1057 	AA_BUG(new->size < a->size + b->size);  in label_merge_insert()
1062 			new->vec[k] = aa_get_newest_profile(next);  in label_merge_insert()
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()
1070 			new->vec[k++] = aa_get_profile(next);  in label_merge_insert()
1073 	new->size = k;  in label_merge_insert()
1074 	new->vec[k] = NULL;  in label_merge_insert()
1077 		new->size -= aa_vec_unique(&new->vec[0], new->size,  in label_merge_insert()
1080 		if (new->size == 1) {  in label_merge_insert()
1081 			label = aa_get_label(&new->vec[0]->label);  in label_merge_insert()
1087 		 * for new->size == a->size == b->size unless a == b  in label_merge_insert()
1094 	ls = labels_set(new);  in label_merge_insert()
1096 	label = __label_insert(labels_set(new), new, false);  in label_merge_insert()
1196  * aa_label_merge - attempt to insert new merged label of @a and @b
1204  * Returns: ref counted new label if successful in inserting merge of a & b
1226 		struct aa_label *new;  in aa_label_merge()  local
1234 		new = aa_label_alloc(a->size + b->size, NULL, gfp);  in aa_label_merge()
1235 		if (!new)  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()
1899 		 * if component specified a new ns it becomes the new base  in aa_label_strn_parse()
2016  * Returns: new label that is up to date
2026 	struct aa_label *new, *tmp;  in __label_update()  local
2034 	new = aa_label_alloc(label->size, label->proxy, GFP_KERNEL);  in __label_update()
2035 	if (!new)  in __label_update()
2046 		new->vec[i] = aa_get_newest_profile(label->vec[i]);  in __label_update()
2047 		AA_BUG(!new->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()
2056 		new->size -= aa_vec_unique(&new->vec[0], new->size,  in __label_update()
2059 		if (new->size == 1) {  in __label_update()
2060 			tmp = aa_get_label(&new->vec[0]->label);  in __label_update()
2064 		if (labels_set(label) != labels_set(new)) {  in __label_update()
2066 			tmp = aa_label_insert(labels_set(new), 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()
2078 	label_free_or_put_new(tmp, new);  in __label_update()