aboutsummaryrefslogtreecommitdiff
path: root/net/unix/af_unix.c
diff options
context:
space:
mode:
authorThomas Gleixner <[email protected]>2010-11-30 17:49:33 +0000
committerArnaldo Carvalho de Melo <[email protected]>2010-11-30 19:52:36 -0200
commita1225decc43849a73f7e4c333c3fdbbb8a9c1e65 (patch)
treed08e7f7aaec99038f592176923cc1990767c69f2 /net/unix/af_unix.c
parentc320c7b7d380e630f595de1236d9d085b035d5b4 (diff)
perf session: Fix list sort algorithm
The homebrewn sort algorithm fails to sort in time order. One of the problem spots is that it fails to deal with equal timestamps correctly. My first gut reaction was to replace the fancy list with an rbtree, but the performance is 3 times worse. Rewrite it so it works. Cc: Ingo Molnar <[email protected]> Cc: Peter Zijlstra <[email protected]> Cc: Frederic Weisbecker <[email protected]> LKML-Reference: <[email protected]> Signed-off-by: Thomas Gleixner <[email protected]> Signed-off-by: Arnaldo Carvalho de Melo <[email protected]>
Diffstat (limited to 'net/unix/af_unix.c')
0 files changed, 0 insertions, 0 deletions