diff options
| author | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | 2011-05-15 11:05:54 +0200 |
|---|---|---|
| committer | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | 2011-05-16 09:31:40 +0200 |
| commit | debf12d54182b324a01c4276b003669c94b7b531 (patch) | |
| tree | 972640a41690e8946bd89636765cbaa6a5aa63f5 /crypto/api.c | |
| parent | UBIFS: simplify replay (diff) | |
| download | linux-debf12d54182b324a01c4276b003669c94b7b531.tar.xz linux-debf12d54182b324a01c4276b003669c94b7b531.zip | |
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>
Diffstat (limited to '')
0 files changed, 0 insertions, 0 deletions