lgcosta/reiserfsprogs
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

cleanup: remove unused argument to reiserfs_invalidate_buffer

Browse Source 
reiserfs_invalidate_buffer contains an argument to specify whether a block
should be freed after being invalidated. It is always passed as 1, so
let's just get rid of it.

Signed-off-by: Jeff Mahoney <jeffm@suse.com>
This commit is contained in:
Jeff Mahoney committed 2013-08-26 17:21:08 -04:00
1 parent 863ef57982
commit d442d18969
3 files changed
+22 -38
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

reiserfscore/ibalance.c
+5 -5
View File
@@ -503,7 +503,7 @@ static void balance_internal_when_delete(struct tree_balance *tb,
tb->tb_fs->fs_dirt = 1;
/* mark buffer S[h] not uptodate and put it in free list */
reiserfs_invalidate_buffer(tb, tbSh, 1);
reiserfs_invalidate_buffer(tb, tbSh);
return;
}
return;
@@ -511,14 +511,14 @@ static void balance_internal_when_delete(struct tree_balance *tb,
if (tb->L[h] && tb->lnum[h] == -B_NR_ITEMS(tb->L[h]) - 1) { /* join S[h] with L[h] */
internal_shift_left(INTERNAL_SHIFT_FROM_S_TO_L, tb, h, n + 1); /*tb->L[h], tb->CFL[h], tb->lkey[h], tb->S[h], n+1); */
reiserfs_invalidate_buffer(tb, tbSh, 1); /* preserve not needed, internal, 1 mean free block */
reiserfs_invalidate_buffer(tb, tbSh); /* preserve not needed, internal, 1 mean free block */
return;
}
if (tb->R[h] && tb->rnum[h] == -B_NR_ITEMS(tb->R[h]) - 1) { /* join S[h] with R[h] */
internal_shift_right(INTERNAL_SHIFT_FROM_S_TO_R, tb, h, n + 1);
reiserfs_invalidate_buffer(tb, tbSh, 1);
reiserfs_invalidate_buffer(tb, tbSh);
return;
}
@@ -537,7 +537,7 @@ static void balance_internal_when_delete(struct tree_balance *tb,
internal_shift_left(INTERNAL_SHIFT_FROM_S_TO_L, tb, h, tb->lnum[h]); /*tb->L[h], tb->CFL[h], tb->lkey[h], tb->S[h], tb->lnum[h]); */
internal_shift_right(INTERNAL_SHIFT_FROM_S_TO_R, tb, h,
tb->rnum[h]);
reiserfs_invalidate_buffer(tb, tbSh, 1);
reiserfs_invalidate_buffer(tb, tbSh);
return;
}
@@ -724,7 +724,7 @@ int balance_internal(struct tree_balance *tb, /* tree_balance structure
/** Fill new node that appears instead of S[h] **/
if (!tb->blknum[h]) { /* node S[h] is empty now */
/* Mark buffer as invalid and put it to head of free list. */
reiserfs_invalidate_buffer(tb, tbSh, 1); /* do not preserve, internal node */
reiserfs_invalidate_buffer(tb, tbSh); /* do not preserve, internal node */
return order;
}