Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
L
linux
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
nexedi
linux
Commits
3a13252c
Commit
3a13252c
authored
Jul 30, 2008
by
Adrian Hunter
Committed by
Artem Bityutskiy
Aug 13, 2008
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
UBIFS: correct spelling of "thrice".
Signed-off-by:
Adrian Hunter
<
ext-adrian.hunter@nokia.com
>
parent
22bc7fa8
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
3 additions
and
3 deletions
+3
-3
fs/ubifs/budget.c
fs/ubifs/budget.c
+2
-2
fs/ubifs/find.c
fs/ubifs/find.c
+1
-1
No files found.
fs/ubifs/budget.c
View file @
3a13252c
...
...
@@ -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
;
/* And make sure we have trice the index size of space reserved */
/* And make sure we have t
h
rice the index size of space reserved */
idx_size
=
idx_size
+
(
idx_size
<<
1
);
/*
...
...
@@ -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
* and data.
*
* When budgeting index space, UBIFS reserves t
rice as more
LEBs as the index
* When budgeting index space, UBIFS reserves t
hrice as many
LEBs as the index
* 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
* be able to commit dirty index. So this function basically adds amount of
...
...
fs/ubifs/find.c
View file @
3a13252c
...
...
@@ -290,7 +290,7 @@ int ubifs_find_dirty_leb(struct ubifs_info *c, struct ubifs_lprops *ret_lp,
idx_lp
=
idx_heap
->
arr
[
0
];
sum
=
idx_lp
->
free
+
idx_lp
->
dirty
;
/*
* Since we reserve t
rice as more
space for the index than it
* Since we reserve t
hrice as much
space for the index than it
* actually takes, it does not make sense to pick indexing LEBs
* with less than, say, half LEB of dirty space. May be half is
* not the optimal boundary - this should be tested and
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment