summaryrefslogtreecommitdiff
path: root/fs/jffs2/jffs2_private.h
diff options
context:
space:
mode:
authorMark Tomlinson <mark.tomlinson@alliedtelesis.co.nz>2015-07-01 04:38:29 (GMT)
committerTom Rini <trini@konsulko.com>2015-08-13 00:47:32 (GMT)
commit10d3ac346f54ab9526cd352239a5906ee2b92fee (patch)
treec3dc2f4c0df60a876aba4de9b962bd84d6b570e5 /fs/jffs2/jffs2_private.h
parent54a883840be500cbcda4903118dd571e4532e83f (diff)
downloadu-boot-fsl-qoriq-10d3ac346f54ab9526cd352239a5906ee2b92fee.tar.xz
JFFS2: Use merge sort when parsing filesystem
When building the file system the existing code does an insertion into a linked list. It attempts to speed this up by keeping a pointer to where the last entry was inserted but it's still slow. Now the nodes are just inserted into the list without searching through for the correct place. This unsorted list is then sorted once using mergesort after all the entries have been added to the list. This speeds up the scanning of the flash file system considerably. Signed-off-by: Mark Tomlinson <mark.tomlinson@alliedtelesis.co.nz>
Diffstat (limited to 'fs/jffs2/jffs2_private.h')
-rw-r--r--fs/jffs2/jffs2_private.h4
1 files changed, 4 insertions, 0 deletions
diff --git a/fs/jffs2/jffs2_private.h b/fs/jffs2/jffs2_private.h
index 658b325..06b6ca2 100644
--- a/fs/jffs2/jffs2_private.h
+++ b/fs/jffs2/jffs2_private.h
@@ -98,4 +98,8 @@ data_crc(struct jffs2_raw_inode *node)
}
}
+#if defined(CONFIG_SYS_JFFS2_SORT_FRAGMENTS)
+/* External merge sort. */
+int sort_list(struct b_list *list);
+#endif
#endif /* jffs2_private.h */