Lines Matching refs:new
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()
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()
391 aa_label_free(new); in label_free_or_put_new()
393 aa_put_label(new); in label_free_or_put_new()
423 struct aa_label *new; in aa_label_alloc() local
428 new = kzalloc(struct_size(new, vec, size + 1), gfp); in aa_label_alloc()
429 AA_DEBUG("%s (%p)\n", __func__, new); in aa_label_alloc()
430 if (!new) in aa_label_alloc()
433 if (!aa_label_init(new, size, gfp)) in aa_label_alloc()
437 proxy = aa_alloc_proxy(new, gfp); in aa_label_alloc()
443 new->proxy = proxy; in aa_label_alloc()
445 return new; in aa_label_alloc()
448 kfree(new); in aa_label_alloc()
590 static bool __label_remove(struct aa_label *label, struct aa_label *new) in __label_remove() argument
598 if (new) in __label_remove()
599 __aa_proxy_redirect(label, new); in __label_remove()
626 static bool __label_replace(struct aa_label *old, struct aa_label *new) in __label_replace() argument
632 AA_BUG(!new); in __label_replace()
634 AA_BUG(new->flags & FLAG_IN_TREE); in __label_replace()
640 rb_replace_node(&old->node, &new->node, &ls->root); in __label_replace()
642 new->flags |= FLAG_IN_TREE; in __label_replace()
665 struct rb_node **new, *parent = NULL; in __label_insert() local
674 new = &ls->root.rb_node; in __label_insert()
675 while (*new) { in __label_insert()
676 struct aa_label *this = rb_entry(*new, struct aa_label, node); in __label_insert()
679 parent = *new; in __label_insert()
694 new = &((*new)->rb_left); in __label_insert()
696 new = &((*new)->rb_right); in __label_insert()
700 rb_link_node(&label->node, parent, new); in __label_insert()
792 bool aa_label_replace(struct aa_label *old, struct aa_label *new) in aa_label_replace() argument
797 if (name_is_shared(old, new) && labels_ns(old) == labels_ns(new)) { in aa_label_replace()
799 if (old->proxy != new->proxy) in aa_label_replace()
800 __proxy_share(old, new); in aa_label_replace()
802 __aa_proxy_redirect(old, new); in aa_label_replace()
803 res = __label_replace(old, new); in aa_label_replace()
810 res = __label_remove(old, new); in aa_label_replace()
811 if (labels_ns(old) != labels_ns(new)) { in aa_label_replace()
813 ls = labels_set(new); in aa_label_replace()
816 l = __label_insert(ls, new, true); in aa_label_replace()
817 res = (l == new); in aa_label_replace()
858 struct aa_label *new; in vec_create_and_insert_label() local
871 new = aa_label_alloc(len, NULL, gfp); in vec_create_and_insert_label()
872 if (!new) in vec_create_and_insert_label()
876 new->vec[i] = aa_get_profile(vec[i]); in vec_create_and_insert_label()
879 label = __label_insert(ls, new, false); in vec_create_and_insert_label()
881 label_free_or_put_new(label, new); in vec_create_and_insert_label()
1046 static struct aa_label *label_merge_insert(struct aa_label *new, in label_merge_insert() argument
1062 AA_BUG(!new); in label_merge_insert()
1063 AA_BUG(new->size < a->size + b->size); in label_merge_insert()
1068 new->vec[k] = aa_get_newest_profile(next); in label_merge_insert()
1069 AA_BUG(!new->vec[k]->label.proxy); in label_merge_insert()
1070 AA_BUG(!new->vec[k]->label.proxy->label); in label_merge_insert()
1071 if (next->label.proxy != new->vec[k]->label.proxy) in label_merge_insert()
1076 new->vec[k++] = aa_get_profile(next); in label_merge_insert()
1079 new->size = k; in label_merge_insert()
1080 new->vec[k] = NULL; in label_merge_insert()
1083 new->size -= aa_vec_unique(&new->vec[0], new->size, in label_merge_insert()
1086 if (new->size == 1) { in label_merge_insert()
1087 label = aa_get_label(&new->vec[0]->label); in label_merge_insert()
1100 if (vec_unconfined(new->vec, new->size)) in label_merge_insert()
1101 new->flags |= FLAG_UNCONFINED; in label_merge_insert()
1102 ls = labels_set(new); in label_merge_insert()
1104 label = __label_insert(labels_set(new), new, false); in label_merge_insert()
1235 struct aa_label *new; in aa_label_merge() local
1243 new = aa_label_alloc(a->size + b->size, NULL, gfp); in aa_label_merge()
1244 if (!new) in aa_label_merge()
1247 label = label_merge_insert(new, a, b); in aa_label_merge()
1248 label_free_or_put_new(label, new); in aa_label_merge()
2050 struct aa_label *new, *tmp; in __label_update() local
2058 new = aa_label_alloc(label->size, label->proxy, GFP_KERNEL); in __label_update()
2059 if (!new) in __label_update()
2070 new->vec[i] = aa_get_newest_profile(label->vec[i]); in __label_update()
2071 AA_BUG(!new->vec[i]); in __label_update()
2072 AA_BUG(!new->vec[i]->label.proxy); in __label_update()
2073 AA_BUG(!new->vec[i]->label.proxy->label); in __label_update()
2074 if (new->vec[i]->label.proxy != label->vec[i]->label.proxy) in __label_update()
2080 new->size -= aa_vec_unique(&new->vec[0], new->size, in __label_update()
2083 if (new->size == 1) { in __label_update()
2084 tmp = aa_get_label(&new->vec[0]->label); in __label_update()
2088 if (labels_set(label) != labels_set(new)) { in __label_update()
2090 tmp = aa_label_insert(labels_set(new), new); in __label_update()
2095 AA_BUG(labels_ns(label) != labels_ns(new)); in __label_update()
2097 tmp = __label_insert(labels_set(label), new, true); in __label_update()
2102 label_free_or_put_new(tmp, new); in __label_update()