Searched defs:amount_needed (Results 1 - 3 of 3) sorted by relevance

/fs/reiserfs/
H A Dbitmap.c1011 int amount_needed)
1146 int amount_needed,
1149 int rest = amount_needed;
1183 return (amount_needed - rest);
1188 int amount_needed) {
1202 amount_needed, hint->inode->i_uid);
1206 dquot_alloc_block_nodirty(hint->inode, amount_needed);
1247 amount_needed +
1255 amount_needed + hint->prealloc_size -
1271 amount_needed
1010 determine_search_start(reiserfs_blocknr_hint_t * hint, int amount_needed) argument
1142 allocate_without_wrapping_disk(reiserfs_blocknr_hint_t * hint, b_blocknr_t * new_blocknrs, b_blocknr_t start, b_blocknr_t finish, int min, int amount_needed, int prealloc_size) argument
1186 blocknrs_and_prealloc_arrays_from_search_start(reiserfs_blocknr_hint_t * hint, b_blocknr_t * new_blocknrs, int amount_needed) argument
1302 use_preallocated_list_if_available(reiserfs_blocknr_hint_t * hint, b_blocknr_t * new_blocknrs, int amount_needed) argument
1326 reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *hint, b_blocknr_t *new_blocknrs, int amount_needed, int reserved_by_us) argument
[all...]
H A Dfix_node.c834 int amount_needed; /* number of needed empty blocks */ local
844 * is then restarted, amount_needed is the number needed by this
867 amount_needed = (Sh) ? (tb->blknum[h] - 1) : 1;
872 if (amount_needed > number_of_freeblk)
873 amount_needed -= number_of_freeblk;
882 amount_needed) == NO_DISK_SPACE)
887 counter < amount_needed; blocknr++, counter++) {
H A Dreiserfs.h3327 int amount_needed)
3337 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed,
3325 reiserfs_new_form_blocknrs(struct tree_balance *tb, b_blocknr_t * new_blocknrs, int amount_needed) argument

Completed in 16 milliseconds