816 	unsigned int nfound;  in gang_lookup_scan()  local
836 	nfound = 0;  in gang_lookup_scan()
858 			results[nfound] = entry_ptr(*vpp);  in gang_lookup_scan()
859 			nfound++;  in gang_lookup_scan()
860 			if (nfound == maxresults) {  in gang_lookup_scan()
861 				return nfound;  in gang_lookup_scan()
864 			return nfound;  in gang_lookup_scan()
885 				return nfound;  in gang_lookup_scan()
913 	return nfound;  in gang_lookup_scan()
1578 		unsigned int nfound;  in test2()  local
1583 		while ((nfound = radix_tree_gang_lookup_node(t, nextidx,  in test2()
1585 			nextidx = results[nfound - 1]->idx + 1;  in test2()
1586 			total += nfound;  in test2()
1600 		unsigned int nfound;  in test2()  local
1605 		while ((nfound = radix_tree_gang_lookup_node_reverse(t, nextidx,  in test2()
1607 			nextidx = results[nfound - 1]->idx - 1;  in test2()
1608 			total += nfound;  in test2()
1625 			unsigned int nfound;  in test2()  local
1628 			while ((nfound = radix_tree_gang_lookup_tagged_node(t,  in test2()
1631 				nextidx = results[nfound - 1]->idx + 1;  in test2()
1632 				total += nfound;  in test2()
1648 			unsigned int nfound;  in test2()  local
1651 			while ((nfound =  in test2()
1655 				nextidx = results[nfound - 1]->idx - 1;  in test2()
1656 				total += nfound;  in test2()
1679 			unsigned int nfound;  in test2()  local
1682 			while ((nfound = radix_tree_gang_lookup_tagged_node(t,  in test2()
1685 				for (i = 0; i < nfound; i++) {  in test2()
1689 				nextidx = results[nfound - 1]->idx + 1;  in test2()
1690 				total += nfound;  in test2()
1711 		unsigned int nfound;  in test2()  local
1716 		while ((nfound = radix_tree_gang_lookup_node(t, nextidx,  in test2()
1718 			for (i = 0; i < nfound; i++) {  in test2()
1722 			nextidx = results[nfound - 1]->idx + 1;  in test2()
1723 			total += nfound;  in test2()