2041 	struct list_head *nce_head;  in name_cache_insert()  local
2043 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_insert()
2045 	if (!nce_head) {  in name_cache_insert()
2046 		nce_head = kmalloc(sizeof(*nce_head), GFP_KERNEL);  in name_cache_insert()
2047 		if (!nce_head) {  in name_cache_insert()
2051 		INIT_LIST_HEAD(nce_head);  in name_cache_insert()
2053 		ret = radix_tree_insert(&sctx->name_cache, nce->ino, nce_head);  in name_cache_insert()
2055 			kfree(nce_head);  in name_cache_insert()
2060 	list_add_tail(&nce->radix_list, nce_head);  in name_cache_insert()
2070 	struct list_head *nce_head;  in name_cache_delete()  local
2072 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_delete()
2074 	if (!nce_head) {  in name_cache_delete()
2087 	if (nce_head && list_empty(nce_head)) {  in name_cache_delete()
2089 		kfree(nce_head);  in name_cache_delete()
2096 	struct list_head *nce_head;  in name_cache_search()  local
2099 	nce_head = radix_tree_lookup(&sctx->name_cache, (unsigned long)ino);  in name_cache_search()
2100 	if (!nce_head)  in name_cache_search()
2103 	list_for_each_entry(cur, nce_head, radix_list) {  in name_cache_search()