519 	for (iw = 0; iw < wnd->nwnd; iw++) {  in wnd_rescan()
520 		if (iw + 1 == wnd->nwnd)  in wnd_rescan()
657 	wnd->nwnd = bytes_to_block(sb, ntfs3_bitmap_size(nbits));  in wnd_init()
663 		kvmalloc_array(wnd->nwnd, sizeof(u16), GFP_KERNEL | __GFP_ZERO);  in wnd_init()
719 	for (; iw < wnd->nwnd && bits; iw++, bit += op, bits -= op, wbit = 0) {  in wnd_set_free()
720 		if (iw + 1 == wnd->nwnd)  in wnd_set_free()
761 	for (; iw < wnd->nwnd && bits; iw++, bit += op, bits -= op, wbit = 0) {  in wnd_set_used()
762 		if (unlikely(iw + 1 == wnd->nwnd))  in wnd_set_used()
841 	for (; iw < wnd->nwnd && bits; iw++, bits -= op, wbit = 0) {  in wnd_is_free_hlp()
842 		if (unlikely(iw + 1 == wnd->nwnd))  in wnd_is_free_hlp()
927 	for (; iw < wnd->nwnd && bits; iw++, bits -= op, wbit = 0) {  in wnd_is_used()
928 		if (unlikely(iw + 1 == wnd->nwnd))  in wnd_is_used()
965 	size_t iw, prev_tail, nwnd, wbit, ebit, zbit, zend;  in wnd_find()  local
1127 		nwnd = wnd->nwnd;  in wnd_find()
1131 		nwnd = likely(t > max_alloc) ? (t >> log2_bits) : wnd->nwnd;  in wnd_find()
1135 	for (; iw < nwnd; iw++) {  in wnd_find()
1150 		if (unlikely(iw + 1 == nwnd)) {  in wnd_find()
1327 	if (new_wnd != wnd->nwnd) {  in wnd_extend()
1332 		memcpy(new_free, wnd->free_bits, wnd->nwnd * sizeof(short));  in wnd_extend()
1333 		memset(new_free + wnd->nwnd, 0,  in wnd_extend()
1334 		       (new_wnd - wnd->nwnd) * sizeof(short));  in wnd_extend()
1380 	wnd->nwnd = new_wnd;  in wnd_extend()
1425 	for (; iw < wnd->nwnd; iw++, wbit = 0) {  in ntfs_trim_fs()
1435 		if (iw + 1 == wnd->nwnd)  in ntfs_trim_fs()