commit | 7137ff50b68a48bc28270c91b1c313259ab0c1c4 | [log] [tgz] |
---|---|---|
author | Davidlohr Bueso <dave@stgolabs.net> | Thu Dec 06 11:18:17 2018 -0800 |
committer | Arnaldo Carvalho de Melo <acme@redhat.com> | Fri Jan 25 15:12:10 2019 +0100 |
tree | 9af6b7fc0ae471e61d9a9d177f1f12d33e790d2b | |
parent | ca2270292e6c3415102242bf9dc3d05f622b7b28 [diff] |
perf symbols: Use cached rbtrees At the cost of an extra pointer, we can avoid the O(logN) cost of finding the first element in the tree (smallest node). Signed-off-by: Davidlohr Bueso <dbueso@suse.de> Tested-by: Arnaldo Carvalho de Melo <acme@redhat.com> Cc: Jiri Olsa <jolsa@kernel.org> Cc: Namhyung Kim <namhyung@kernel.org> Link: http://lkml.kernel.org/r/20181206191819.30182-6-dave@stgolabs.net Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>