tree f2950b939592202a8dfbcfaa296dac8afccc6fb5
parent 460faadcc0661f0f1171ab268dbb8eae42c17f96
author philippe <philippe@a5019735-40e9-0310-863c-91ae7b9d1cf9> 1344035499 +0000
committer philippe <philippe@a5019735-40e9-0310-863c-91ae7b9d1cf9> 1344035499 +0000

fix 284540 (optimise suppression matching)
Before this patch, matching an error stack trace with many suppression
patterns was implying to repeating the translation of the IPs of the
stack trace to the function name or object name for each suppr pattern.

This patch introduces a "lazy input completer" in the generic match
so that an IP is (in the worst case) translated once to its function
name and once to its object name.

It is a "lazy" completer in the sense that only the needed IP to fun or obj
name are done.

On a artificial test case, has given a factor 3 in performance.
On another big (real) application, gave a factor 2 to 3.
(there was less matching to do, but probably more debug info to search).

match-overrun.supp completed to have non matching suppr first to
better exercise the lazy completer.


git-svn-id: svn://svn.valgrind.org/valgrind/trunk@12824 a5019735-40e9-0310-863c-91ae7b9d1cf9