2000 	struct list_head *nce_head;  in name_cache_insert()  local
2002 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_insert()
2004 	if (!nce_head) {  in name_cache_insert()
2005 		nce_head = kmalloc(sizeof(*nce_head), GFP_KERNEL);  in name_cache_insert()
2006 		if (!nce_head) {  in name_cache_insert()
2010 		INIT_LIST_HEAD(nce_head);  in name_cache_insert()
2012 		ret = radix_tree_insert(&sctx->name_cache, nce->ino, nce_head);  in name_cache_insert()
2014 			kfree(nce_head);  in name_cache_insert()
2019 	list_add_tail(&nce->radix_list, nce_head);  in name_cache_insert()
2029 	struct list_head *nce_head;  in name_cache_delete()  local
2031 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_delete()
2033 	if (!nce_head) {  in name_cache_delete()
2046 	if (nce_head && list_empty(nce_head)) {  in name_cache_delete()
2048 		kfree(nce_head);  in name_cache_delete()
2055 	struct list_head *nce_head;  in name_cache_search()  local
2058 	nce_head = radix_tree_lookup(&sctx->name_cache, (unsigned long)ino);  in name_cache_search()
2059 	if (!nce_head)  in name_cache_search()
2062 	list_for_each_entry(cur, nce_head, radix_list) {  in name_cache_search()