1968 	struct list_head *nce_head;  in name_cache_insert()  local
1970 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_insert()
1972 	if (!nce_head) {  in name_cache_insert()
1973 		nce_head = kmalloc(sizeof(*nce_head), GFP_NOFS);  in name_cache_insert()
1974 		if (!nce_head) {  in name_cache_insert()
1978 		INIT_LIST_HEAD(nce_head);  in name_cache_insert()
1980 		ret = radix_tree_insert(&sctx->name_cache, nce->ino, nce_head);  in name_cache_insert()
1982 			kfree(nce_head);  in name_cache_insert()
1987 	list_add_tail(&nce->radix_list, nce_head);  in name_cache_insert()
1997 	struct list_head *nce_head;  in name_cache_delete()  local
1999 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_delete()
2001 	if (!nce_head) {  in name_cache_delete()
2014 	if (nce_head && list_empty(nce_head)) {  in name_cache_delete()
2016 		kfree(nce_head);  in name_cache_delete()
2023 	struct list_head *nce_head;  in name_cache_search()  local
2026 	nce_head = radix_tree_lookup(&sctx->name_cache, (unsigned long)ino);  in name_cache_search()
2027 	if (!nce_head)  in name_cache_search()
2030 	list_for_each_entry(cur, nce_head, radix_list) {  in name_cache_search()