1982 	struct list_head *nce_head;  in name_cache_insert()  local
1984 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_insert()
1986 	if (!nce_head) {  in name_cache_insert()
1987 		nce_head = kmalloc(sizeof(*nce_head), GFP_NOFS);  in name_cache_insert()
1988 		if (!nce_head) {  in name_cache_insert()
1992 		INIT_LIST_HEAD(nce_head);  in name_cache_insert()
1994 		ret = radix_tree_insert(&sctx->name_cache, nce->ino, nce_head);  in name_cache_insert()
1996 			kfree(nce_head);  in name_cache_insert()
2001 	list_add_tail(&nce->radix_list, nce_head);  in name_cache_insert()
2011 	struct list_head *nce_head;  in name_cache_delete()  local
2013 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_delete()
2015 	if (!nce_head) {  in name_cache_delete()
2028 	if (nce_head && list_empty(nce_head)) {  in name_cache_delete()
2030 		kfree(nce_head);  in name_cache_delete()
2037 	struct list_head *nce_head;  in name_cache_search()  local
2040 	nce_head = radix_tree_lookup(&sctx->name_cache, (unsigned long)ino);  in name_cache_search()
2041 	if (!nce_head)  in name_cache_search()
2044 	list_for_each_entry(cur, nce_head, radix_list) {  in name_cache_search()