Artem Bityutskiy debf12d541 UBIFS: substitute the replay tree with a replay list
This patch simplifies replay even further - it removes the replay tree and
adds the replay list instead. Indeed, we just do not need to use a tree here -
all we need to do is to add all nodes to the list and then sort it. Using
RB-tree is an overkill - more code and slower. And since we replay buds in
order, we expect the nodes to follow in _mostly_ sorted order, so the merge
sort becomes much cheaper in average than an RB-tree.

Signed-off-by: Artem Bityutskiy <Artem.Bityutskiy@nokia.com>
2011-05-16 10:31:40 +03:00
..
2011-05-13 19:23:55 +03:00
2011-05-16 10:31:39 +03:00
2011-05-16 10:31:40 +03:00
2011-05-13 19:23:54 +03:00
2011-05-13 19:23:53 +03:00
2011-05-16 10:31:39 +03:00
2011-05-13 19:23:53 +03:00