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()
392 static void label_free_or_put_new(struct aa_label *label, struct aa_label *new)  in label_free_or_put_new()  argument
394 	if (label != new)  in label_free_or_put_new()
396 		aa_label_free(new);  in label_free_or_put_new()
398 		aa_put_label(new);  in label_free_or_put_new()
420  * @proxy: proxy to use OR null if to allocate a new one
423  * Returns: new label
428 	struct aa_label *new;  in aa_label_alloc()  local
433 	new = kzalloc(sizeof(*new) + sizeof(struct aa_profile *) * (size + 1),  in aa_label_alloc()
435 	AA_DEBUG("%s (%p)\n", __func__, new);  in aa_label_alloc()
436 	if (!new)  in aa_label_alloc()
439 	if (!aa_label_init(new, size, gfp))  in aa_label_alloc()
443 		proxy = aa_alloc_proxy(new, gfp);  in aa_label_alloc()
448 	/* just set new's proxy, don't redirect proxy here if it was passed in*/  in aa_label_alloc()
449 	new->proxy = proxy;  in aa_label_alloc()
451 	return new;  in aa_label_alloc()
454 	kfree(new);  in aa_label_alloc()
558  * @new: label to redirect to
563 static bool __label_remove(struct aa_label *label, struct aa_label *new)  in __label_remove()  argument
571 	if (new)  in __label_remove()
572 		__aa_proxy_redirect(label, new);  in __label_remove()
587  * __label_replace - replace @old with @new in label set
589  * @new: label to replace @old with
592  *           valid ref count be held on @new
593  * Returns: true if @old was in set and replaced by @new
596  *       that @new directly replaces @old position in the set (ie.
599 static bool __label_replace(struct aa_label *old, struct aa_label *new)  in __label_replace()  argument
605 	AA_BUG(!new);  in __label_replace()
607 	AA_BUG(new->flags & FLAG_IN_TREE);  in __label_replace()
613 		rb_replace_node(&old->node, &new->node, &ls->root);  in __label_replace()
615 		new->flags |= FLAG_IN_TREE;  in __label_replace()
625  * @label: new label to insert (NOT NULL)
638 	struct rb_node **new, *parent = NULL;  in __label_insert()  local
646 	/* Figure out where to put new node */  in __label_insert()
647 	new = &ls->root.rb_node;  in __label_insert()
648 	while (*new) {  in __label_insert()
649 		struct aa_label *this = rb_entry(*new, struct aa_label, node);  in __label_insert()
652 		parent = *new;  in __label_insert()
667 			new = &((*new)->rb_left);  in __label_insert()
669 			new = &((*new)->rb_right);  in __label_insert()
672 	/* Add new node and rebalance tree. */  in __label_insert()
673 	rb_link_node(&label->node, parent, new);  in __label_insert()
758  * aa_label_replace - replace a label @old with a new version @new
760  * @new: label replacing @old
763  *     else @old was not in tree, and @new was not inserted
765 bool aa_label_replace(struct aa_label *old, struct aa_label *new)  in aa_label_replace()  argument
770 	if (name_is_shared(old, new) && labels_ns(old) == labels_ns(new)) {  in aa_label_replace()
772 		if (old->proxy != new->proxy)  in aa_label_replace()
773 			__proxy_share(old, new);  in aa_label_replace()
775 			__aa_proxy_redirect(old, new);  in aa_label_replace()
776 		res = __label_replace(old, new);  in aa_label_replace()
783 		res = __label_remove(old, new);  in aa_label_replace()
784 		if (labels_ns(old) != labels_ns(new)) {  in aa_label_replace()
786 			ls = labels_set(new);  in aa_label_replace()
789 		l = __label_insert(ls, new, true);  in aa_label_replace()
790 		res = (l == new);  in aa_label_replace()
831 	struct aa_label *new;  in vec_create_and_insert_label()  local
844 	new = aa_label_alloc(len, NULL, gfp);  in vec_create_and_insert_label()
845 	if (!new)  in vec_create_and_insert_label()
849 		new->vec[i] = aa_get_profile(vec[i]);  in vec_create_and_insert_label()
852 	label = __label_insert(ls, new, false);  in vec_create_and_insert_label()
854 	label_free_or_put_new(label, new);  in vec_create_and_insert_label()
1003  * label_merge_insert - create a new label by merging @a and @b
1004  * @new: preallocated label to merge into (NOT NULL)
1010  * Returns: ref counted label either @new if merge is unique
1014  * NOTE: will not use @new if the merge results in @new == @a or @b
1019 static struct aa_label *label_merge_insert(struct aa_label *new,  in label_merge_insert()  argument
1035 	AA_BUG(!new);  in label_merge_insert()
1036 	AA_BUG(new->size < a->size + b->size);  in label_merge_insert()
1041 			new->vec[k] = aa_get_newest_profile(next);  in label_merge_insert()
1042 			AA_BUG(!new->vec[k]->label.proxy);  in label_merge_insert()
1043 			AA_BUG(!new->vec[k]->label.proxy->label);  in label_merge_insert()
1044 			if (next->label.proxy != new->vec[k]->label.proxy)  in label_merge_insert()
1049 			new->vec[k++] = aa_get_profile(next);  in label_merge_insert()
1052 	new->size = k;  in label_merge_insert()
1053 	new->vec[k] = NULL;  in label_merge_insert()
1056 		new->size -= aa_vec_unique(&new->vec[0], new->size,  in label_merge_insert()
1059 		if (new->size == 1) {  in label_merge_insert()
1060 			label = aa_get_label(&new->vec[0]->label);  in label_merge_insert()
1066 		 * for new->size == a->size == b->size unless a == b  in label_merge_insert()
1073 	if (vec_unconfined(new->vec, new->size))  in label_merge_insert()
1074 		new->flags |= FLAG_UNCONFINED;  in label_merge_insert()
1075 	ls = labels_set(new);  in label_merge_insert()
1077 	label = __label_insert(labels_set(new), new, false);  in label_merge_insert()
1177  * aa_label_merge - attempt to insert new merged label of @a and @b
1186  * Returns: ref counted new label if successful in inserting merge of a & b
1208 		struct aa_label *new;  in aa_label_merge()  local
1216 		new = aa_label_alloc(a->size + b->size, NULL, gfp);  in aa_label_merge()
1217 		if (!new)  in aa_label_merge()
1220 		label = label_merge_insert(new, a, b);  in aa_label_merge()
1221 		label_free_or_put_new(label, new);  in aa_label_merge()
1894 		 * if component specified a new ns it becomes the new base  in aa_label_strn_parse()
2011  * Returns: new label that is up to date
2021 	struct aa_label *new, *tmp;  in __label_update()  local
2029 	new = aa_label_alloc(label->size, label->proxy, GFP_KERNEL);  in __label_update()
2030 	if (!new)  in __label_update()
2041 		new->vec[i] = aa_get_newest_profile(label->vec[i]);  in __label_update()
2042 		AA_BUG(!new->vec[i]);  in __label_update()
2043 		AA_BUG(!new->vec[i]->label.proxy);  in __label_update()
2044 		AA_BUG(!new->vec[i]->label.proxy->label);  in __label_update()
2045 		if (new->vec[i]->label.proxy != label->vec[i]->label.proxy)  in __label_update()
2051 		new->size -= aa_vec_unique(&new->vec[0], new->size,  in __label_update()
2054 		if (new->size == 1) {  in __label_update()
2055 			tmp = aa_get_label(&new->vec[0]->label);  in __label_update()
2059 		if (labels_set(label) != labels_set(new)) {  in __label_update()
2061 			tmp = aa_label_insert(labels_set(new), new);  in __label_update()
2066 		AA_BUG(labels_ns(label) != labels_ns(new));  in __label_update()
2068 	tmp = __label_insert(labels_set(label), new, true);  in __label_update()
2073 	label_free_or_put_new(tmp, new);  in __label_update()