Lines Matching refs:cn
165 struct crush_name_node *cn; in alloc_crush_name() local
167 cn = kmalloc(sizeof(*cn) + name_len + 1, GFP_NOIO); in alloc_crush_name()
168 if (!cn) in alloc_crush_name()
171 RB_CLEAR_NODE(&cn->cn_node); in alloc_crush_name()
172 return cn; in alloc_crush_name()
175 static void free_crush_name(struct crush_name_node *cn) in free_crush_name() argument
177 WARN_ON(!RB_EMPTY_NODE(&cn->cn_node)); in free_crush_name()
179 kfree(cn); in free_crush_name()
190 struct crush_name_node *cn; in DEFINE_RB_FUNCS() local
198 cn = alloc_crush_name(name_len); in DEFINE_RB_FUNCS()
199 if (!cn) in DEFINE_RB_FUNCS()
202 cn->cn_id = id; in DEFINE_RB_FUNCS()
203 memcpy(cn->cn_name, *p, name_len); in DEFINE_RB_FUNCS()
204 cn->cn_name[name_len] = '\0'; in DEFINE_RB_FUNCS()
207 if (!__insert_crush_name(root, cn)) { in DEFINE_RB_FUNCS()
208 free_crush_name(cn); in DEFINE_RB_FUNCS()
222 struct crush_name_node *cn = in clear_crush_names() local
225 erase_crush_name(root, cn); in clear_crush_names()
226 free_crush_name(cn); in clear_crush_names()
3037 struct crush_name_node *type_cn, *cn; in get_immediate_parent() local
3046 cn = lookup_crush_name(&c->names, b->id); in get_immediate_parent()
3047 if (!cn || !is_valid_crush_name(cn->cn_name)) in get_immediate_parent()
3057 parent_loc->cl_name = cn->cn_name; in get_immediate_parent()