365 	struct e_node *e, *e3;  in wnd_remove_free_ext()  local
395 			e3 = rb_entry(n3, struct e_node, start.node);  in wnd_remove_free_ext()
396 			if (e3->start.key >= end_in)  in wnd_remove_free_ext()
399 			if (e3->count.key == wnd->extent_max)  in wnd_remove_free_ext()
402 			end3 = e3->start.key + e3->count.key;  in wnd_remove_free_ext()
404 				e3->start.key = end_in;  in wnd_remove_free_ext()
405 				rb_erase(&e3->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
406 				e3->count.key = end3 - end_in;  in wnd_remove_free_ext()
407 				rb_insert_count(&wnd->count_tree, e3);  in wnd_remove_free_ext()
412 			rb_erase(&e3->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
413 			rb_erase(&e3->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
415 			kmem_cache_free(ntfs_enode_cachep, e3);  in wnd_remove_free_ext()
436 			e3 = rb_entry(n3, struct e_node, count.node);  in wnd_remove_free_ext()
437 			wnd->extent_max = max(e3->count.key, max_new_len);  in wnd_remove_free_ext()
715 	size_t iw = bit >> (sb->s_blocksize_bits + 3);  in wnd_set_free()
764 	size_t iw = bit >> (sb->s_blocksize_bits + 3);  in wnd_set_used()
852 	size_t iw = bit >> (sb->s_blocksize_bits + 3);  in wnd_is_free_hlp()
928 	size_t iw = bit >> (sb->s_blocksize_bits + 3);  in wnd_is_used()
1142 	log2_bits = sb->s_blocksize_bits + 3;  in wnd_find()
1371 	for (iw = old_bits >> (sb->s_blocksize_bits + 3); bits; iw += 1) {  in wnd_extend()
1439 	size_t iw = lcn_from >> (sb->s_blocksize_bits + 3);  in ntfs_trim_fs()