{
struct rb_node *node, *next;
- ntfs_free(wnd->free_bits);
+ kfree(wnd->free_bits);
run_close(&wnd->run);
node = rb_first(&wnd->start_tree);
if (!wnd->bits_last)
wnd->bits_last = wbits;
- wnd->free_bits = ntfs_zalloc(wnd->nwnd * sizeof(u16));
+ wnd->free_bits = kzalloc(wnd->nwnd * sizeof(u16), GFP_NOFS);
if (!wnd->free_bits)
return -ENOMEM;
new_last = wbits;
if (new_wnd != wnd->nwnd) {
- new_free = ntfs_malloc(new_wnd * sizeof(u16));
+ new_free = kmalloc(new_wnd * sizeof(u16), GFP_NOFS);
if (!new_free)
return -ENOMEM;
wnd->nwnd * sizeof(short));
memset(new_free + wnd->nwnd, 0,
(new_wnd - wnd->nwnd) * sizeof(short));
- ntfs_free(wnd->free_bits);
+ kfree(wnd->free_bits);
wnd->free_bits = new_free;
}