]> bbs.cooldavid.org Git - net-next-2.6.git/commit
git://bbs.cooldavid.org / net-next-2.6.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 7d4e9cc) | patch
UBIFS: fully sort GCed nodes
authorArtem Bityutskiy <Artem.Bityutskiy@nokia.com>
Sun, 8 Mar 2009 13:13:00 +0000 (15:13 +0200)
committerArtem Bityutskiy <Artem.Bityutskiy@nokia.com>
Fri, 20 Mar 2009 17:12:00 +0000 (19:12 +0200)
commitf10770f5e56b4297701fd7c3e551b206f98d7ac2
tree5fad34defa002857fca21dfde03e3813d68cfb4btree | snapshot (tar.bz2 tar.gz zip)
parent7d4e9ccb435e51e013e63abd340b4f496428139ccommit | diff
UBIFS: fully sort GCed nodes

The 'joinup()' function cannot deal with situations when nodes
go in reverse order - it just leaves them in this order. This
patch implement full nodes sorting using n*log(n) algorithm.
It sorts data nodes for bulk-read, and direntry nodes for
readdir().

Signed-off-by: Artem Bityutskiy <Artem.Bityutskiy@nokia.com>
fs/ubifs/gc.c diff | blob | blame | history
Clone of davem's net-next-2.6 tree