528 	for (iw = 0; iw < wnd->nwnd; iw++) {  in wnd_rescan()
529 		if (iw + 1 == wnd->nwnd)  in wnd_rescan()
674 	wnd->nwnd = bytes_to_block(sb, ntfs3_bitmap_size(nbits));  in wnd_init()
680 		kvmalloc_array(wnd->nwnd, sizeof(u16), GFP_KERNEL | __GFP_ZERO);  in wnd_init()
736 	for (; iw < wnd->nwnd && bits; iw++, bit += op, bits -= op, wbit = 0) {  in wnd_set_free()
737 		if (iw + 1 == wnd->nwnd)  in wnd_set_free()
778 	for (; iw < wnd->nwnd && bits; iw++, bit += op, bits -= op, wbit = 0) {  in wnd_set_used()
779 		if (unlikely(iw + 1 == wnd->nwnd))  in wnd_set_used()
858 	for (; iw < wnd->nwnd && bits; iw++, bits -= op, wbit = 0) {  in wnd_is_free_hlp()
859 		if (unlikely(iw + 1 == wnd->nwnd))  in wnd_is_free_hlp()
944 	for (; iw < wnd->nwnd && bits; iw++, bits -= op, wbit = 0) {  in wnd_is_used()
945 		if (unlikely(iw + 1 == wnd->nwnd))  in wnd_is_used()
982 	size_t iw, prev_tail, nwnd, wbit, ebit, zbit, zend;  in wnd_find()  local
1144 		nwnd = wnd->nwnd;  in wnd_find()
1148 		nwnd = likely(t > max_alloc) ? (t >> log2_bits) : wnd->nwnd;  in wnd_find()
1152 	for (; iw < nwnd; iw++) {  in wnd_find()
1167 		if (unlikely(iw + 1 == nwnd)) {  in wnd_find()
1344 	if (new_wnd != wnd->nwnd) {  in wnd_extend()
1349 		memcpy(new_free, wnd->free_bits, wnd->nwnd * sizeof(short));  in wnd_extend()
1350 		memset(new_free + wnd->nwnd, 0,  in wnd_extend()
1351 		       (new_wnd - wnd->nwnd) * sizeof(short));  in wnd_extend()
1398 	wnd->nwnd = new_wnd;  in wnd_extend()
1443 	for (; iw < wnd->nwnd; iw++, wbit = 0) {  in ntfs_trim_fs()
1453 		if (iw + 1 == wnd->nwnd)  in ntfs_trim_fs()