summaryrefslogtreecommitdiffstats
path: root/lib/bust_spinlocks.c
diff options
context:
space:
mode:
authorkeios <keios.cn@gmail.com>2006-10-03 10:13:49 +0200
committerLinus Torvalds <torvalds@g5.osdl.org>2006-10-03 17:03:41 +0200
commitd3717bdf8f08a0e1039158c8bab2c24d20f492b6 (patch)
tree9c8617cb3f58faace4941a0aa09ea1820d287b7c /lib/bust_spinlocks.c
parent[PATCH] Create kallsyms_lookup_size_offset() (diff)
downloadlinux-d3717bdf8f08a0e1039158c8bab2c24d20f492b6.tar.xz
linux-d3717bdf8f08a0e1039158c8bab2c24d20f492b6.zip
[PATCH] low performance of lib/sort.c
It is a non-standard heap-sort algorithm implementation because the index of child node is wrong . The sort function still outputs right result, but the performance is O( n * ( log(n) + 1 ) ) , about 10% ~ 20% worse than standard algorithm. Signed-off-by: keios <keios.cn@gmail.com> Acked-by: Matt Mackall <mpm@selenic.com> Acked-by: Zou Nan hai <nanhai.zou@intel.com> Signed-off-by: Andrew Morton <akpm@osdl.org> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Diffstat (limited to 'lib/bust_spinlocks.c')
0 files changed, 0 insertions, 0 deletions