Home
last modified time | relevance | path

Searched refs:amount_needed (Results 1 – 3 of 3) sorted by relevance

/fs/reiserfs/
Dbitmap.c962 int amount_needed) in determine_search_start() argument
1086 int amount_needed, in allocate_without_wrapping_disk() argument
1089 int rest = amount_needed; in allocate_without_wrapping_disk()
1120 return (amount_needed - rest); in allocate_without_wrapping_disk()
1125 int amount_needed) { in blocknrs_and_prealloc_arrays_from_search_start() argument
1138 amount_needed, hint->inode->i_uid); in blocknrs_and_prealloc_arrays_from_search_start()
1141 dquot_alloc_block_nodirty(hint->inode, amount_needed); in blocknrs_and_prealloc_arrays_from_search_start()
1178 amount_needed + in blocknrs_and_prealloc_arrays_from_search_start()
1185 amount_needed + hint->prealloc_size - in blocknrs_and_prealloc_arrays_from_search_start()
1200 amount_needed - in blocknrs_and_prealloc_arrays_from_search_start()
[all …]
Dfix_node.c784 int counter, number_of_freeblk, amount_needed, /* number of needed empty blocks */ in get_empty_nodes() local
812 amount_needed = (Sh) ? (tb->blknum[h] - 1) : 1; in get_empty_nodes()
814 if (amount_needed > number_of_freeblk) in get_empty_nodes()
815 amount_needed -= number_of_freeblk; in get_empty_nodes()
821 amount_needed) == NO_DISK_SPACE) in get_empty_nodes()
826 counter < amount_needed; blocknr++, counter++) { in get_empty_nodes()
Dreiserfs.h2851 int amount_needed) in reiserfs_new_form_blocknrs() argument
2861 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed, in reiserfs_new_form_blocknrs()