• Mark Tomlinson's avatar
    JFFS2: Use merge sort when parsing filesystem · 10d3ac34
    Mark Tomlinson authored
    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: default avatarMark Tomlinson <mark.tomlinson@alliedtelesis.co.nz>
    10d3ac34
Name
Last commit
Last update
..
Kconfig Loading commit data...
LICENCE Loading commit data...
Makefile Loading commit data...
compr_lzo.c Loading commit data...
compr_rtime.c Loading commit data...
compr_rubin.c Loading commit data...
compr_zlib.c Loading commit data...
jffs2_1pass.c Loading commit data...
jffs2_nand_1pass.c Loading commit data...
jffs2_nand_private.h Loading commit data...
jffs2_private.h Loading commit data...
mergesort.c Loading commit data...
mini_inflate.c Loading commit data...
summary.h Loading commit data...