2004 	struct list_head *nce_head;  in name_cache_insert()  local
2006 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_insert()
2008 	if (!nce_head) {  in name_cache_insert()
2009 		nce_head = kmalloc(sizeof(*nce_head), GFP_KERNEL);  in name_cache_insert()
2010 		if (!nce_head) {  in name_cache_insert()
2014 		INIT_LIST_HEAD(nce_head);  in name_cache_insert()
2016 		ret = radix_tree_insert(&sctx->name_cache, nce->ino, nce_head);  in name_cache_insert()
2018 			kfree(nce_head);  in name_cache_insert()
2023 	list_add_tail(&nce->radix_list, nce_head);  in name_cache_insert()
2033 	struct list_head *nce_head;  in name_cache_delete()  local
2035 	nce_head = radix_tree_lookup(&sctx->name_cache,  in name_cache_delete()
2037 	if (!nce_head) {  in name_cache_delete()
2050 	if (nce_head && list_empty(nce_head)) {  in name_cache_delete()
2052 		kfree(nce_head);  in name_cache_delete()
2059 	struct list_head *nce_head;  in name_cache_search()  local
2062 	nce_head = radix_tree_lookup(&sctx->name_cache, (unsigned long)ino);  in name_cache_search()
2063 	if (!nce_head)  in name_cache_search()
2066 	list_for_each_entry(cur, nce_head, radix_list) {  in name_cache_search()