mirror of
https://github.com/Zenithsiz/ftmemsim-valgrind.git
synced 2026-02-03 18:13:01 +00:00
08c619389b
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
99 lines
4.0 KiB
C
99 lines
4.0 KiB
C
|
|
/*--------------------------------------------------------------------*/
|
|
/*--- A simple sequence matching facility. ---*/
|
|
/*--- pub_tool_seqmatch.h ---*/
|
|
/*--------------------------------------------------------------------*/
|
|
|
|
/*
|
|
This file is part of Valgrind, a dynamic binary instrumentation
|
|
framework.
|
|
|
|
Copyright (C) 2008-2011 OpenWorks Ltd
|
|
info@open-works.co.uk
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License as
|
|
published by the Free Software Foundation; either version 2 of the
|
|
License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful, but
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
02111-1307, USA.
|
|
|
|
The GNU General Public License is contained in the file COPYING.
|
|
*/
|
|
|
|
#ifndef __PUB_TOOL_SEQMATCH_H
|
|
#define __PUB_TOOL_SEQMATCH_H
|
|
|
|
/* Perform totally abstractified sequence matching, of an input
|
|
sequence against a pattern sequence. The pattern sequence may
|
|
include '*' elements (matches any number of anything) and '?'
|
|
elements (matches exactly one element). '*' patterns are matched
|
|
frugally, meaning that they are "assigned" the minimum amount of
|
|
input needed to make the match work.
|
|
|
|
This routine is recursive. The recursion depth is equal to the
|
|
number of '*' elements in the pattern. There is no guard against
|
|
excessive recursion. This function has no global state and so is
|
|
thread-safe and re-entrant. (It needs to be, since m_errormgr will
|
|
effectively construct two simultaneous calls to it, once to match
|
|
at the frame level, and whilst that is happening, once at the
|
|
function/object-name level.)
|
|
|
|
When matchAll is True, the entire input sequence must match the
|
|
pattern, else the match fails. When False, it's ok for some tail
|
|
of the input sequence to be unused -- so we're only matching a
|
|
prefix.
|
|
|
|
The pattern array is starts at 'patt' and consists of 'nPatt'
|
|
elements each of size 'szbPatt'. For the initial call, pass a
|
|
value of zero to 'ixPatt'.
|
|
|
|
Ditto for input/nInput/szbInput/ixInput.
|
|
|
|
pIsStar should return True iff the pointed-to pattern element is
|
|
conceptually a '*'.
|
|
|
|
pIsQuery should return True iff the pointed-to-pattern element is
|
|
conceptually a '?'.
|
|
|
|
pattEQinp takes a pointer to a pattern element and a pointer to an
|
|
input element. It should return True iff they are considered
|
|
equal. Note that the pattern element is guaranteed to be neither
|
|
(conceptually) '*' nor '?', so it must be a literal (in the sense
|
|
that all the input sequence elements are literal).
|
|
|
|
input might be lazily constructed when pattEQinp is called.
|
|
For lazily constructing the input element, the two last arguments
|
|
of pattEQinp are the inputCompleter and the index of the input
|
|
element to complete.
|
|
inputCompleter can be NULL.
|
|
*/
|
|
Bool VG_(generic_match) (
|
|
Bool matchAll,
|
|
void* patt, SizeT szbPatt, UWord nPatt, UWord ixPatt,
|
|
void* input, SizeT szbInput, UWord nInput, UWord ixInput,
|
|
Bool (*pIsStar)(void*),
|
|
Bool (*pIsQuery)(void*),
|
|
Bool (*pattEQinp)(void*,void*,void*,UWord),
|
|
void* inputCompleter
|
|
);
|
|
|
|
/* Mini-regexp function. Searches for 'pat' in 'str'. Supports
|
|
meta-symbols '*' and '?'. There is no way to escape meta-symbols
|
|
in the pattern. */
|
|
Bool VG_(string_match) ( const Char* pat, const Char* str );
|
|
|
|
#endif // __PUB_TOOL_SEQMATCH_H
|
|
|
|
/*--------------------------------------------------------------------*/
|
|
/*--- end pub_tool_seqmatch.h ---*/
|
|
/*--------------------------------------------------------------------*/
|