| commit | f10770f5e56b4297701fd7c3e551b206f98d7ac2 | [log] [tgz] |
|---|---|---|
| author | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | Sun Mar 08 15:13:00 2009 +0200 |
| committer | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | Fri Mar 20 19:12:00 2009 +0200 |
| tree | 5fad34defa002857fca21dfde03e3813d68cfb4b | |
| parent | 7d4e9ccb435e51e013e63abd340b4f496428139c [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>