Commit 3a13252c authored by Adrian Hunter's avatar Adrian Hunter Committed by Artem Bityutskiy

UBIFS: correct spelling of "thrice".

Signed-off-by: default avatarAdrian Hunter <ext-adrian.hunter@nokia.com>
parent 22bc7fa8
...@@ -263,7 +263,7 @@ int ubifs_calc_min_idx_lebs(struct ubifs_info *c) ...@@ -263,7 +263,7 @@ int ubifs_calc_min_idx_lebs(struct ubifs_info *c)
idx_size = c->old_idx_sz + c->budg_idx_growth + c->budg_uncommitted_idx; idx_size = c->old_idx_sz + c->budg_idx_growth + c->budg_uncommitted_idx;
/* And make sure we have trice the index size of space reserved */ /* And make sure we have thrice the index size of space reserved */
idx_size = idx_size + (idx_size << 1); idx_size = idx_size + (idx_size << 1);
/* /*
...@@ -388,7 +388,7 @@ static int can_use_rp(struct ubifs_info *c) ...@@ -388,7 +388,7 @@ static int can_use_rp(struct ubifs_info *c)
* This function makes sure UBIFS has enough free eraseblocks for index growth * This function makes sure UBIFS has enough free eraseblocks for index growth
* and data. * and data.
* *
* When budgeting index space, UBIFS reserves trice as more LEBs as the index * When budgeting index space, UBIFS reserves thrice as many LEBs as the index
* would take if it was consolidated and written to the flash. This guarantees * would take if it was consolidated and written to the flash. This guarantees
* that the "in-the-gaps" commit method always succeeds and UBIFS will always * that the "in-the-gaps" commit method always succeeds and UBIFS will always
* be able to commit dirty index. So this function basically adds amount of * be able to commit dirty index. So this function basically adds amount of
......
...@@ -290,7 +290,7 @@ int ubifs_find_dirty_leb(struct ubifs_info *c, struct ubifs_lprops *ret_lp, ...@@ -290,7 +290,7 @@ int ubifs_find_dirty_leb(struct ubifs_info *c, struct ubifs_lprops *ret_lp,
idx_lp = idx_heap->arr[0]; idx_lp = idx_heap->arr[0];
sum = idx_lp->free + idx_lp->dirty; sum = idx_lp->free + idx_lp->dirty;
/* /*
* Since we reserve trice as more space for the index than it * Since we reserve thrice as much space for the index than it
* actually takes, it does not make sense to pick indexing LEBs * actually takes, it does not make sense to pick indexing LEBs
* with less than, say, half LEB of dirty space. May be half is * with less than, say, half LEB of dirty space. May be half is
* not the optimal boundary - this should be tested and * not the optimal boundary - this should be tested and
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment