]> git.ipfire.org Git - thirdparty/valgrind.git/commit
projects / thirdparty / valgrind.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 22f4d50) | patch
Reimplement pszB_to_listNo using a binary search rather than a linear search.
authorJulian Seward <jseward@acm.org>
Fri, 5 Aug 2016 14:54:27 +0000 (14:54 +0000)
committerJulian Seward <jseward@acm.org>
Fri, 5 Aug 2016 14:54:27 +0000 (14:54 +0000)
commit1a2f71d6ffd99b92b64875115e29a94bf184b250
treed2aaa46c94a6672af728542f1e61cf2c7af93a1dtree
parent22f4d5081d32dad660a68d483d6d130e38972fd6commit | diff
Reimplement pszB_to_listNo using a binary search rather than a linear search.
Unlikely as it seems, this saves a considerable number of instructions (2% of total)
on very heap-intensive code (perf/heap.c).

git-svn-id: svn://svn.valgrind.org/valgrind/trunk@15926
coregrind/m_mallocfree.c diff | blob | blame | history
Mirror of https://sourceware.org/git/valgrind.git