tree c3dc2f4c0df60a876aba4de9b962bd84d6b570e5
parent 56a7f4861401f6d2c81afc832c2dfa549907a06c
author Mark Tomlinson <mark.tomlinson@alliedtelesis.co.nz> 1435725509 +1200
committer Tom Rini <trini@konsulko.com> 1439426852 -0400

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>