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
80736d41
Commit
80736d41
authored
Dec 30, 2008
by
Artem Bityutskiy
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
UBIFS: fix numerous spelling mistakes
Signed-off-by:
Artem Bityutskiy
<
Artem.Bityutskiy@nokia.com
>
parent
57a450e9
Changes
4
Show whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
14 additions
and
15 deletions
+14
-15
Documentation/filesystems/ubifs.txt
Documentation/filesystems/ubifs.txt
+3
-3
fs/ubifs/budget.c
fs/ubifs/budget.c
+7
-7
fs/ubifs/lpt_commit.c
fs/ubifs/lpt_commit.c
+4
-4
fs/ubifs/ubifs.h
fs/ubifs/ubifs.h
+0
-1
No files found.
Documentation/filesystems/ubifs.txt
View file @
80736d41
...
@@ -95,9 +95,9 @@ no_chk_data_crc skip checking of CRCs on data nodes in order to
...
@@ -95,9 +95,9 @@ no_chk_data_crc skip checking of CRCs on data nodes in order to
of this option is that corruption of the contents
of this option is that corruption of the contents
of a file can go unnoticed.
of a file can go unnoticed.
chk_data_crc (*) do not skip checking CRCs on data nodes
chk_data_crc (*) do not skip checking CRCs on data nodes
compr=none override def
oult com
ressor and set it to "none"
compr=none override def
ault comp
ressor and set it to "none"
compr=lzo override def
oult com
ressor and set it to "lzo"
compr=lzo override def
ault comp
ressor and set it to "lzo"
compr=zlib override def
oult com
ressor and set it to "zlib"
compr=zlib override def
ault comp
ressor and set it to "zlib"
Quick usage instructions
Quick usage instructions
...
...
fs/ubifs/budget.c
View file @
80736d41
...
@@ -652,9 +652,9 @@ void ubifs_release_dirty_inode_budget(struct ubifs_info *c,
...
@@ -652,9 +652,9 @@ void ubifs_release_dirty_inode_budget(struct ubifs_info *c,
* user-space. User-space application tend to expect that if the file-system
* user-space. User-space application tend to expect that if the file-system
* (e.g., via the 'statfs()' call) reports that it has N bytes available, they
* (e.g., via the 'statfs()' call) reports that it has N bytes available, they
* are able to write a file of size N. UBIFS attaches node headers to each data
* are able to write a file of size N. UBIFS attaches node headers to each data
* node and it has to write indexin
d
nodes as well. This introduces additional
* node and it has to write indexin
g
nodes as well. This introduces additional
* overhead, and UBIFS has to report sligtly less free space to meet the above
* overhead, and UBIFS has to report slig
h
tly less free space to meet the above
* expect
e
tions.
* expect
a
tions.
*
*
* This function assumes free space is made up of uncompressed data nodes and
* This function assumes free space is made up of uncompressed data nodes and
* full index nodes (one per data node, tripled because we always allow enough
* full index nodes (one per data node, tripled because we always allow enough
...
@@ -677,7 +677,7 @@ long long ubifs_reported_space(const struct ubifs_info *c, long long free)
...
@@ -677,7 +677,7 @@ long long ubifs_reported_space(const struct ubifs_info *c, long long free)
* of data nodes, f - fanout. Because effective UBIFS fanout is twice
* of data nodes, f - fanout. Because effective UBIFS fanout is twice
* as less than maximum fanout, we assume that each data node
* as less than maximum fanout, we assume that each data node
* introduces 3 * @c->max_idx_node_sz / (@c->fanout/2 - 1) bytes.
* introduces 3 * @c->max_idx_node_sz / (@c->fanout/2 - 1) bytes.
* Note, the multiplier 3 is because UBIFS reseves thrice as more space
* Note, the multiplier 3 is because UBIFS rese
r
ves thrice as more space
* for the index.
* for the index.
*/
*/
f
=
c
->
fanout
>
3
?
c
->
fanout
>>
1
:
2
;
f
=
c
->
fanout
>
3
?
c
->
fanout
>>
1
:
2
;
...
@@ -695,10 +695,10 @@ long long ubifs_reported_space(const struct ubifs_info *c, long long free)
...
@@ -695,10 +695,10 @@ long long ubifs_reported_space(const struct ubifs_info *c, long long free)
* This function calculates amount of free space to report to user-space.
* This function calculates amount of free space to report to user-space.
*
*
* Because UBIFS may introduce substantial overhead (the index, node headers,
* Because UBIFS may introduce substantial overhead (the index, node headers,
* alig
h
ment, wastage at the end of eraseblocks, etc), it cannot report real
* alig
n
ment, wastage at the end of eraseblocks, etc), it cannot report real
* amount of free flash space it has (well, because not all dirty space is
* amount of free flash space it has (well, because not all dirty space is
* reclamable, UBIFS does not actually know the real amount). If UBIFS did so,
* recla
i
mable, UBIFS does not actually know the real amount). If UBIFS did so,
* it would bread user expect
etion
about what free space is. Users seem to
* it would bread user expect
ations
about what free space is. Users seem to
* accustomed to assume that if the file-system reports N bytes of free space,
* accustomed to assume that if the file-system reports N bytes of free space,
* they would be able to fit a file of N bytes to the FS. This almost works for
* they would be able to fit a file of N bytes to the FS. This almost works for
* traditional file-systems, because they have way less overhead than UBIFS.
* traditional file-systems, because they have way less overhead than UBIFS.
...
...
fs/ubifs/lpt_commit.c
View file @
80736d41
...
@@ -753,7 +753,7 @@ static void lpt_tgc_start(struct ubifs_info *c)
...
@@ -753,7 +753,7 @@ static void lpt_tgc_start(struct ubifs_info *c)
* LPT trivial garbage collection is where a LPT LEB contains only dirty and
* LPT trivial garbage collection is where a LPT LEB contains only dirty and
* free space and so may be reused as soon as the next commit is completed.
* free space and so may be reused as soon as the next commit is completed.
* This function is called after the commit is completed (master node has been
* This function is called after the commit is completed (master node has been
* written) and unmaps LPT LEBs that were marked for trivial GC.
* written) and un
-
maps LPT LEBs that were marked for trivial GC.
*/
*/
static
int
lpt_tgc_end
(
struct
ubifs_info
*
c
)
static
int
lpt_tgc_end
(
struct
ubifs_info
*
c
)
{
{
...
@@ -1467,7 +1467,7 @@ void ubifs_lpt_free(struct ubifs_info *c, int wr_only)
...
@@ -1467,7 +1467,7 @@ void ubifs_lpt_free(struct ubifs_info *c, int wr_only)
#ifdef CONFIG_UBIFS_FS_DEBUG
#ifdef CONFIG_UBIFS_FS_DEBUG
/**
/**
* dbg_is_all_ff - determine if a buffer contains only 0x
ff
bytes.
* dbg_is_all_ff - determine if a buffer contains only 0x
FF
bytes.
* @buf: buffer
* @buf: buffer
* @len: buffer length
* @len: buffer length
*/
*/
...
@@ -1492,7 +1492,7 @@ static int dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs)
...
@@ -1492,7 +1492,7 @@ static int dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs)
struct
ubifs_nnode
*
nnode
;
struct
ubifs_nnode
*
nnode
;
int
hght
;
int
hght
;
/* Entire tree is in memory so first_nnode / next_nnode are
ok
*/
/* Entire tree is in memory so first_nnode / next_nnode are
OK
*/
nnode
=
first_nnode
(
c
,
&
hght
);
nnode
=
first_nnode
(
c
,
&
hght
);
for
(;
nnode
;
nnode
=
next_nnode
(
c
,
nnode
,
&
hght
))
{
for
(;
nnode
;
nnode
=
next_nnode
(
c
,
nnode
,
&
hght
))
{
struct
ubifs_nbranch
*
branch
;
struct
ubifs_nbranch
*
branch
;
...
@@ -1837,7 +1837,7 @@ int dbg_chk_lpt_sz(struct ubifs_info *c, int action, int len)
...
@@ -1837,7 +1837,7 @@ int dbg_chk_lpt_sz(struct ubifs_info *c, int action, int len)
* This function dumps an LEB from LPT area. Nodes in this area are very
* This function dumps an LEB from LPT area. Nodes in this area are very
* different to nodes in the main area (e.g., they do not have common headers,
* different to nodes in the main area (e.g., they do not have common headers,
* they do not have 8-byte alignments, etc), so we have a separate function to
* they do not have 8-byte alignments, etc), so we have a separate function to
* dump LPT area LEBs. Note, LPT has to be locked by the c
o
ller.
* dump LPT area LEBs. Note, LPT has to be locked by the c
a
ller.
*/
*/
static
void
dump_lpt_leb
(
const
struct
ubifs_info
*
c
,
int
lnum
)
static
void
dump_lpt_leb
(
const
struct
ubifs_info
*
c
,
int
lnum
)
{
{
...
...
fs/ubifs/ubifs.h
View file @
80736d41
...
@@ -1168,7 +1168,6 @@ struct ubifs_debug_info;
...
@@ -1168,7 +1168,6 @@ struct ubifs_debug_info;
* @mount_opts: UBIFS-specific mount options
* @mount_opts: UBIFS-specific mount options
*
*
* @dbg: debugging-related information
* @dbg: debugging-related information
* @dfs: debugfs support-related information
*/
*/
struct
ubifs_info
{
struct
ubifs_info
{
struct
super_block
*
vfs_sb
;
struct
super_block
*
vfs_sb
;
...
...
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