Lines Matching refs:new
66 struct aa_proxy *new; in aa_alloc_proxy() local
68 new = kzalloc(sizeof(struct aa_proxy), gfp); in aa_alloc_proxy()
69 if (new) { in aa_alloc_proxy()
70 kref_init(&new->count); in aa_alloc_proxy()
71 rcu_assign_pointer(new->label, aa_get_label(label)); in aa_alloc_proxy()
73 return new; in aa_alloc_proxy()
77 void __aa_proxy_redirect(struct aa_label *orig, struct aa_label *new) in __aa_proxy_redirect() argument
82 AA_BUG(!new); in __aa_proxy_redirect()
87 rcu_assign_pointer(orig->proxy->label, aa_get_label(new)); in __aa_proxy_redirect()
92 static void __proxy_share(struct aa_label *old, struct aa_label *new) in __proxy_share() argument
94 struct aa_proxy *proxy = new->proxy; in __proxy_share()
96 new->proxy = aa_get_proxy(old->proxy); in __proxy_share()
97 __aa_proxy_redirect(old, new); in __proxy_share()
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()
432 struct aa_label *new; in aa_label_alloc() local
437 new = kzalloc(sizeof(*new) + sizeof(struct aa_profile *) * (size + 1), in aa_label_alloc()
439 AA_DEBUG("%s (%p)\n", __func__, new); in aa_label_alloc()
440 if (!new) in aa_label_alloc()
443 if (!aa_label_init(new, size, gfp)) in aa_label_alloc()
447 proxy = aa_alloc_proxy(new, gfp); in aa_label_alloc()
453 new->proxy = proxy; in aa_label_alloc()
455 return new; in aa_label_alloc()
458 kfree(new); in aa_label_alloc()
567 static bool __label_remove(struct aa_label *label, struct aa_label *new) in __label_remove() argument
575 if (new) in __label_remove()
576 __aa_proxy_redirect(label, new); in __label_remove()
603 static bool __label_replace(struct aa_label *old, struct aa_label *new) in __label_replace() argument
609 AA_BUG(!new); in __label_replace()
611 AA_BUG(new->flags & FLAG_IN_TREE); in __label_replace()
617 rb_replace_node(&old->node, &new->node, &ls->root); in __label_replace()
619 new->flags |= FLAG_IN_TREE; in __label_replace()
642 struct rb_node **new, *parent = NULL; in __label_insert() local
651 new = &ls->root.rb_node; in __label_insert()
652 while (*new) { in __label_insert()
653 struct aa_label *this = rb_entry(*new, struct aa_label, node); in __label_insert()
656 parent = *new; in __label_insert()
671 new = &((*new)->rb_left); in __label_insert()
673 new = &((*new)->rb_right); in __label_insert()
677 rb_link_node(&label->node, parent, new); in __label_insert()
769 bool aa_label_replace(struct aa_label *old, struct aa_label *new) in aa_label_replace() argument
774 if (name_is_shared(old, new) && labels_ns(old) == labels_ns(new)) { in aa_label_replace()
776 if (old->proxy != new->proxy) in aa_label_replace()
777 __proxy_share(old, new); in aa_label_replace()
779 __aa_proxy_redirect(old, new); in aa_label_replace()
780 res = __label_replace(old, new); in aa_label_replace()
787 res = __label_remove(old, new); in aa_label_replace()
788 if (labels_ns(old) != labels_ns(new)) { in aa_label_replace()
790 ls = labels_set(new); in aa_label_replace()
793 l = __label_insert(ls, new, true); in aa_label_replace()
794 res = (l == new); in aa_label_replace()
835 struct aa_label *new; in vec_create_and_insert_label() local
848 new = aa_label_alloc(len, NULL, gfp); in vec_create_and_insert_label()
849 if (!new) in vec_create_and_insert_label()
853 new->vec[i] = aa_get_profile(vec[i]); in vec_create_and_insert_label()
856 label = __label_insert(ls, new, false); in vec_create_and_insert_label()
858 label_free_or_put_new(label, new); in vec_create_and_insert_label()
1023 static struct aa_label *label_merge_insert(struct aa_label *new, in label_merge_insert() argument
1039 AA_BUG(!new); in label_merge_insert()
1040 AA_BUG(new->size < a->size + b->size); in label_merge_insert()
1045 new->vec[k] = aa_get_newest_profile(next); in label_merge_insert()
1046 AA_BUG(!new->vec[k]->label.proxy); in label_merge_insert()
1047 AA_BUG(!new->vec[k]->label.proxy->label); in label_merge_insert()
1048 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1053 new->vec[k++] = aa_get_profile(next); in label_merge_insert()
1056 new->size = k; in label_merge_insert()
1057 new->vec[k] = NULL; in label_merge_insert()
1060 new->size -= aa_vec_unique(&new->vec[0], new->size, in label_merge_insert()
1063 if (new->size == 1) { in label_merge_insert()
1064 label = aa_get_label(&new->vec[0]->label); in label_merge_insert()
1077 if (vec_unconfined(new->vec, new->size)) in label_merge_insert()
1078 new->flags |= FLAG_UNCONFINED; in label_merge_insert()
1079 ls = labels_set(new); in label_merge_insert()
1081 label = __label_insert(labels_set(new), new, false); in label_merge_insert()
1212 struct aa_label *new; in aa_label_merge() local
1220 new = aa_label_alloc(a->size + b->size, NULL, gfp); in aa_label_merge()
1221 if (!new) in aa_label_merge()
1224 label = label_merge_insert(new, a, b); in aa_label_merge()
1225 label_free_or_put_new(label, new); in aa_label_merge()
2025 struct aa_label *new, *tmp; in __label_update() local
2033 new = aa_label_alloc(label->size, label->proxy, GFP_KERNEL); in __label_update()
2034 if (!new) in __label_update()
2045 new->vec[i] = aa_get_newest_profile(label->vec[i]); in __label_update()
2046 AA_BUG(!new->vec[i]); in __label_update()
2047 AA_BUG(!new->vec[i]->label.proxy); in __label_update()
2048 AA_BUG(!new->vec[i]->label.proxy->label); in __label_update()
2049 if (new->vec[i]->label.proxy != label->vec[i]->label.proxy) in __label_update()
2055 new->size -= aa_vec_unique(&new->vec[0], new->size, in __label_update()
2058 if (new->size == 1) { in __label_update()
2059 tmp = aa_get_label(&new->vec[0]->label); in __label_update()
2063 if (labels_set(label) != labels_set(new)) { in __label_update()
2065 tmp = aa_label_insert(labels_set(new), new); in __label_update()
2070 AA_BUG(labels_ns(label) != labels_ns(new)); in __label_update()
2072 tmp = __label_insert(labels_set(label), new, true); in __label_update()
2077 label_free_or_put_new(tmp, new); in __label_update()