UBIFS: fix numerous spelling mistakes (80736d41) · Commits · e / devices / android_kernel_fairphone_FP5

Documentation/filesystems/ubifs.txt

+3 −3

Original line number	Diff line number	Diff line
		@@ -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 a file can go unnoticed.
		chk_data_crc (*) do not skip checking CRCs on data nodes
		compr=none override defoult comressor and set it to "none"
		compr=lzo override defoult comressor and set it to "lzo"
		compr=zlib override defoult comressor and set it to "zlib"
		compr=none override default compressor and set it to "none"
		compr=lzo override default compressor and set it to "lzo"
		compr=zlib override default compressor and set it to "zlib"


		Quick usage instructions

fs/ubifs/budget.c

+7 −7

Original line number	Diff line number	Diff line
		@@ -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
		* (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
		* node and it has to write indexind nodes as well. This introduces additional
		* overhead, and UBIFS has to report sligtly less free space to meet the above
		* expectetions.
		* node and it has to write indexing nodes as well. This introduces additional
		* overhead, and UBIFS has to report slightly less free space to meet the above
		* expectations.
		*
		* 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
		@@ -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
		* as less than maximum fanout, we assume that each data node
		* 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 reserves thrice as more space
		* for the index.
		*/
		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)
		* This function calculates amount of free space to report to user-space.
		*
		* Because UBIFS may introduce substantial overhead (the index, node headers,
		* alighment, wastage at the end of eraseblocks, etc), it cannot report real
		* alignment, 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
		* reclamable, UBIFS does not actually know the real amount). If UBIFS did so,
		* it would bread user expectetion about what free space is. Users seem to
		* reclaimable, UBIFS does not actually know the real amount). If UBIFS did so,
		* it would bread user expectations about what free space is. Users seem to
		* 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
		* traditional file-systems, because they have way less overhead than UBIFS.

fs/ubifs/lpt_commit.c

+4 −4

Original line number	Diff line number	Diff line
		@@ -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
		* 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
		* 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)
		{
		@@ -1467,7 +1467,7 @@ void ubifs_lpt_free(struct ubifs_info *c, int wr_only)
		#ifdef CONFIG_UBIFS_FS_DEBUG

		/**
		* dbg_is_all_ff - determine if a buffer contains only 0xff bytes.
		* dbg_is_all_ff - determine if a buffer contains only 0xFF bytes.
		* @buf: buffer
		* @len: buffer length
		*/
		@@ -1492,7 +1492,7 @@ static int dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs)
		struct ubifs_nnode *nnode;
		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);
		for (; nnode; nnode = next_nnode(c, nnode, &hght)) {
		struct ubifs_nbranch *branch;
		@@ -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
		* 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
		* dump LPT area LEBs. Note, LPT has to be locked by the coller.
		* dump LPT area LEBs. Note, LPT has to be locked by the caller.
		*/
		static void dump_lpt_leb(const struct ubifs_info *c, int lnum)
		{

fs/ubifs/ubifs.h

+0 −1

Original line number	Diff line number	Diff line
		@@ -1168,7 +1168,6 @@ struct ubifs_debug_info;
		* @mount_opts: UBIFS-specific mount options
		*
		* @dbg: debugging-related information
		* @dfs: debugfs support-related information
		*/
		struct ubifs_info {
		struct super_block *vfs_sb;