• A
    UBIFS: substitute the replay tree with a replay list · debf12d5
    Artem Bityutskiy 提交于
    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: NArtem Bityutskiy <Artem.Bityutskiy@nokia.com>
    debf12d5
ubifs.h 60.3 KB