You can subscribe to this list here.
| 2002 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(1) |
Oct
(122) |
Nov
(152) |
Dec
(69) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2003 |
Jan
(6) |
Feb
(25) |
Mar
(73) |
Apr
(82) |
May
(24) |
Jun
(25) |
Jul
(10) |
Aug
(11) |
Sep
(10) |
Oct
(54) |
Nov
(203) |
Dec
(182) |
| 2004 |
Jan
(307) |
Feb
(305) |
Mar
(430) |
Apr
(312) |
May
(187) |
Jun
(342) |
Jul
(487) |
Aug
(637) |
Sep
(336) |
Oct
(373) |
Nov
(441) |
Dec
(210) |
| 2005 |
Jan
(385) |
Feb
(480) |
Mar
(636) |
Apr
(544) |
May
(679) |
Jun
(625) |
Jul
(810) |
Aug
(838) |
Sep
(634) |
Oct
(521) |
Nov
(965) |
Dec
(543) |
| 2006 |
Jan
(494) |
Feb
(431) |
Mar
(546) |
Apr
(411) |
May
(406) |
Jun
(322) |
Jul
(256) |
Aug
(401) |
Sep
(345) |
Oct
(542) |
Nov
(308) |
Dec
(481) |
| 2007 |
Jan
(427) |
Feb
(326) |
Mar
(367) |
Apr
(255) |
May
(244) |
Jun
(204) |
Jul
(223) |
Aug
(231) |
Sep
(354) |
Oct
(374) |
Nov
(497) |
Dec
(362) |
| 2008 |
Jan
(322) |
Feb
(482) |
Mar
(658) |
Apr
(422) |
May
(476) |
Jun
(396) |
Jul
(455) |
Aug
(267) |
Sep
(280) |
Oct
(253) |
Nov
(232) |
Dec
(304) |
| 2009 |
Jan
(486) |
Feb
(470) |
Mar
(458) |
Apr
(423) |
May
(696) |
Jun
(461) |
Jul
(551) |
Aug
(575) |
Sep
(134) |
Oct
(110) |
Nov
(157) |
Dec
(102) |
| 2010 |
Jan
(226) |
Feb
(86) |
Mar
(147) |
Apr
(117) |
May
(107) |
Jun
(203) |
Jul
(193) |
Aug
(238) |
Sep
(300) |
Oct
(246) |
Nov
(23) |
Dec
(75) |
| 2011 |
Jan
(133) |
Feb
(195) |
Mar
(315) |
Apr
(200) |
May
(267) |
Jun
(293) |
Jul
(353) |
Aug
(237) |
Sep
(278) |
Oct
(611) |
Nov
(274) |
Dec
(260) |
| 2012 |
Jan
(303) |
Feb
(391) |
Mar
(417) |
Apr
(441) |
May
(488) |
Jun
(655) |
Jul
(590) |
Aug
(610) |
Sep
(526) |
Oct
(478) |
Nov
(359) |
Dec
(372) |
| 2013 |
Jan
(467) |
Feb
(226) |
Mar
(391) |
Apr
(281) |
May
(299) |
Jun
(252) |
Jul
(311) |
Aug
(352) |
Sep
(481) |
Oct
(571) |
Nov
(222) |
Dec
(231) |
| 2014 |
Jan
(185) |
Feb
(329) |
Mar
(245) |
Apr
(238) |
May
(281) |
Jun
(399) |
Jul
(382) |
Aug
(500) |
Sep
(579) |
Oct
(435) |
Nov
(487) |
Dec
(256) |
| 2015 |
Jan
(338) |
Feb
(357) |
Mar
(330) |
Apr
(294) |
May
(191) |
Jun
(108) |
Jul
(142) |
Aug
(261) |
Sep
(190) |
Oct
(54) |
Nov
(83) |
Dec
(22) |
| 2016 |
Jan
(49) |
Feb
(89) |
Mar
(33) |
Apr
(50) |
May
(27) |
Jun
(34) |
Jul
(53) |
Aug
(53) |
Sep
(98) |
Oct
(206) |
Nov
(93) |
Dec
(53) |
| 2017 |
Jan
(65) |
Feb
(82) |
Mar
(102) |
Apr
(86) |
May
(187) |
Jun
(67) |
Jul
(23) |
Aug
(93) |
Sep
(65) |
Oct
(45) |
Nov
(35) |
Dec
(17) |
| 2018 |
Jan
(26) |
Feb
(35) |
Mar
(38) |
Apr
(32) |
May
(8) |
Jun
(43) |
Jul
(27) |
Aug
(30) |
Sep
(43) |
Oct
(42) |
Nov
(38) |
Dec
(67) |
| 2019 |
Jan
(32) |
Feb
(37) |
Mar
(53) |
Apr
(64) |
May
(49) |
Jun
(18) |
Jul
(14) |
Aug
(53) |
Sep
(25) |
Oct
(30) |
Nov
(49) |
Dec
(31) |
| 2020 |
Jan
(87) |
Feb
(45) |
Mar
(37) |
Apr
(51) |
May
(99) |
Jun
(36) |
Jul
(11) |
Aug
(14) |
Sep
(20) |
Oct
(24) |
Nov
(40) |
Dec
(23) |
| 2021 |
Jan
(14) |
Feb
(53) |
Mar
(85) |
Apr
(15) |
May
(19) |
Jun
(3) |
Jul
(14) |
Aug
(1) |
Sep
(57) |
Oct
(73) |
Nov
(56) |
Dec
(22) |
| 2022 |
Jan
(3) |
Feb
(22) |
Mar
(6) |
Apr
(55) |
May
(46) |
Jun
(39) |
Jul
(15) |
Aug
(9) |
Sep
(11) |
Oct
(34) |
Nov
(20) |
Dec
(36) |
| 2023 |
Jan
(79) |
Feb
(41) |
Mar
(99) |
Apr
(169) |
May
(48) |
Jun
(16) |
Jul
(16) |
Aug
(57) |
Sep
(19) |
Oct
|
Nov
|
Dec
|
| S | M | T | W | T | F | S |
|---|---|---|---|---|---|---|
|
|
1
(12) |
2
(5) |
3
(12) |
4
(9) |
5
(4) |
6
(7) |
|
7
(6) |
8
(10) |
9
(5) |
10
(5) |
11
(4) |
12
(7) |
13
(19) |
|
14
(11) |
15
(9) |
16
(6) |
17
(21) |
18
(13) |
19
(12) |
20
(9) |
|
21
(22) |
22
(24) |
23
(21) |
24
(12) |
25
(6) |
26
(3) |
27
(4) |
|
28
(3) |
29
(5) |
30
(11) |
31
(7) |
|
|
|
|
From: <sv...@va...> - 2008-12-12 13:23:10
|
Author: sewardj
Date: 2008-12-12 13:23:03 +0000 (Fri, 12 Dec 2008)
New Revision: 8818
Log:
This commit subtly changes the meaning of the values obtained via the
stack unwind mechanism (the function VG_(record_ExeContext) et al),
clears up some associated kludges, and makes suppression matching work
more reliably.
Prior to this commit, a stack snapshot contained, at [0], the IP of
the relevant thread, and at all positions [1] and above, the return
addresses for the open calls.
When showing a snapshot to the user (in VG_(apply_StackTrace)), and
searching the stack for stack blocks (in VG_(get_data_description)), 1
is subtracted from positions [1] and above, so as to move these return
addresses back to the last byte of the calling instruction. This
subtraction is also done even in VG_(get_StackTrace_wrk) itself, in
order to make the stack unwinding work at all.
It turns out that suppression-vs-function-name matching requires the
same hack, and sometimes failed to match suppressions that should
match, because of this self-same problem.
So the commit changes the stack unwinder itself, so that entries [1]
and above point to the last byte of the call instruction, rather than
the return address. The associated kludges in VG_(apply_StackTrace)
and VG_(get_StackTrace_wrk) are removed, and suppression matching is
observed to work in a case where it failed before.
Modified:
trunk/coregrind/m_debuginfo/debuginfo.c
trunk/coregrind/m_stacktrace.c
trunk/include/pub_tool_execontext.h
trunk/include/pub_tool_stacktrace.h
Modified: trunk/coregrind/m_debuginfo/debuginfo.c
===================================================================
--- trunk/coregrind/m_debuginfo/debuginfo.c 2008-12-12 08:08:58 UTC (rev 8817)
+++ trunk/coregrind/m_debuginfo/debuginfo.c 2008-12-12 13:23:03 UTC (rev 8818)
@@ -2404,29 +2404,15 @@
frames, and for each frame, consider the local variables. */
n_frames = VG_(get_StackTrace)( tid, ips, N_FRAMES,
sps, fps, 0/*first_ip_delta*/ );
- /* Re ip_delta in the next loop: There's a subtlety in the meaning
- of the IP values in a stack obtained from VG_(get_StackTrace).
- The innermost value really is simply the thread's program
- counter at the time the snapshot was taken. However, all the
- other values are actually return addresses, and so point just
- after the call instructions. Hence they notionally reflect not
- what the program counters were at the time those calls were
- made, but what they will be when those calls return. This can
- be of significance should an address range happen to end at the
- end of a call instruction -- we may ignore the range when in
- fact it should be considered. Hence, back up the IPs by 1 for
- all non-innermost IPs. Note that VG_(get_StackTrace_wrk) itself
- has to use the same trick in order to use CFI data to unwind the
- stack (as documented therein in comments). */
+
/* As a result of KLUDGE above, starting the loop at j = 0
duplicates examination of the top frame and so isn't necessary.
Oh well. */
vg_assert(n_frames >= 0 && n_frames <= N_FRAMES);
for (j = 0; j < n_frames; j++) {
- Word ip_delta = j == 0 ? 0 : 1;
if (consider_vars_in_frame( dname1, dname2, n_dname,
data_addr,
- ips[j] - ip_delta,
+ ips[j],
sps[j], fps[j], tid, j )) {
dname1[n_dname-1] = dname2[n_dname-1] = 0;
return True;
@@ -2445,14 +2431,15 @@
amd64), the variable's location list does claim it exists
starting at the first byte of the first instruction after the
call instruction. So, call consider_vars_in_frame a second
- time, but this time don't subtract 1 from the IP. GDB
- handles this example with no difficulty, which leads me to
- believe that either (1) I misunderstood something, or (2) GDB
- has an equivalent kludge. */
- if (consider_vars_in_frame( dname1, dname2, n_dname,
- data_addr,
- ips[j],
- sps[j], fps[j], tid, j )) {
+ time, but this time add 1 to the IP. GDB handles this
+ example with no difficulty, which leads me to believe that
+ either (1) I misunderstood something, or (2) GDB has an
+ equivalent kludge. */
+ if (j > 0 /* this is a non-innermost frame */
+ && consider_vars_in_frame( dname1, dname2, n_dname,
+ data_addr,
+ ips[j] + 1,
+ sps[j], fps[j], tid, j )) {
dname1[n_dname-1] = dname2[n_dname-1] = 0;
return True;
}
Modified: trunk/coregrind/m_stacktrace.c
===================================================================
--- trunk/coregrind/m_stacktrace.c 2008-12-12 08:08:58 UTC (rev 8817)
+++ trunk/coregrind/m_stacktrace.c 2008-12-12 13:23:03 UTC (rev 8818)
@@ -140,11 +140,6 @@
* This most frequently happens at the end of a function when
* a tail call occurs and we wind up using the CFI info for the
* next function which is completely wrong.
- *
- * Note that VG_(get_data_description) (in m_debuginfo) has to take
- * this same problem into account when unwinding the stack to
- * examine local variable descriptions (as documented therein in
- * comments).
*/
while (True) {
@@ -170,10 +165,10 @@
fp = (((UWord*)fp)[0]);
if (sps) sps[i] = sp;
if (fps) fps[i] = fp;
- ips[i++] = ip;
+ ips[i++] = ip - 1; /* -1: refer to calling insn, not the RA */
if (debug)
VG_(printf)(" ipsF[%d]=0x%08lx\n", i-1, ips[i-1]);
- ip = ip - 1;
+ ip = ip - 1; /* as per comment at the head of this loop */
continue;
}
@@ -182,10 +177,10 @@
if ( VG_(use_CF_info)( &ip, &sp, &fp, fp_min, fp_max ) ) {
if (sps) sps[i] = sp;
if (fps) fps[i] = fp;
- ips[i++] = ip;
+ ips[i++] = ip - 1; /* -1: refer to calling insn, not the RA */
if (debug)
VG_(printf)(" ipsC[%d]=0x%08lx\n", i-1, ips[i-1]);
- ip = ip - 1;
+ ip = ip - 1; /* as per comment at the head of this loop */
continue;
}
@@ -218,11 +213,6 @@
* This most frequently happens at the end of a function when
* a tail call occurs and we wind up using the CFI info for the
* next function which is completely wrong.
- *
- * Note that VG_(get_data_description) (in m_debuginfo) has to take
- * this same problem into account when unwinding the stack to
- * examine local variable descriptions (as documented therein in
- * comments).
*/
while (True) {
@@ -237,10 +227,10 @@
if ( VG_(use_CF_info)( &ip, &sp, &fp, fp_min, fp_max ) ) {
if (sps) sps[i] = sp;
if (fps) fps[i] = fp;
- ips[i++] = ip;
+ ips[i++] = ip - 1; /* -1: refer to calling insn, not the RA */
if (debug)
VG_(printf)(" ipsC[%d]=%#08lx\n", i-1, ips[i-1]);
- ip = ip - 1;
+ ip = ip - 1; /* as per comment at the head of this loop */
continue;
}
@@ -264,10 +254,10 @@
fp = (((UWord*)fp)[0]);
if (sps) sps[i] = sp;
if (fps) fps[i] = fp;
- ips[i++] = ip;
+ ips[i++] = ip - 1; /* -1: refer to calling insn, not the RA */
if (debug)
VG_(printf)(" ipsF[%d]=%#08lx\n", i-1, ips[i-1]);
- ip = ip - 1;
+ ip = ip - 1; /* as per comment at the head of this loop */
continue;
}
@@ -287,10 +277,13 @@
ip = ((UWord*)sp)[0];
if (sps) sps[i] = sp;
if (fps) fps[i] = fp;
- ips[i++] = ip;
+ ips[i++] = ip == 0
+ ? 0 /* sp[0] == 0 ==> stuck at the bottom of a
+ thread stack */
+ : ip - 1; /* -1: refer to calling insn, not the RA */
if (debug)
VG_(printf)(" ipsH[%d]=%#08lx\n", i-1, ips[i-1]);
- ip = ip - 1;
+ ip = ip - 1; /* as per comment at the head of this loop */
sp += 8;
continue;
}
@@ -342,6 +335,8 @@
{
# define M_VG_ERRTXT 1000
UChar buf_lr[M_VG_ERRTXT], buf_ip[M_VG_ERRTXT];
+ /* The following conditional looks grossly inefficient and
+ surely could be majorly improved, with not much effort. */
if (VG_(get_fnname_nodemangle) (lr, buf_lr, M_VG_ERRTXT))
if (VG_(get_fnname_nodemangle) (ip, buf_ip, M_VG_ERRTXT))
if (VG_(strncmp)(buf_lr, buf_ip, M_VG_ERRTXT))
@@ -410,9 +405,12 @@
fp = (((UWord*)fp)[0]);
if (sps) sps[i] = fp; /* NB. not sp */
if (fps) fps[i] = fp;
- ips[i++] = ip;
+ ips[i++] = ip - 1; /* -1: refer to calling insn, not the RA */
if (debug)
VG_(printf)(" ipsF[%d]=%#08lx\n", i-1, ips[i-1]);
+ ip = ip - 1; /* ip is probably dead at this point, but
+ play safe, a la x86/amd64 above. See
+ extensive comments above. */
continue;
}
@@ -543,8 +541,6 @@
vg_assert(n_ips > 0);
do {
Addr ip = ips[i];
- if (i > 0)
- ip -= VG_MIN_INSTR_SZB; // point to calling line
// Stop after the first appearance of "main" or one of the other names
// (the appearance of which is a pretty good sign that we've gone past
Modified: trunk/include/pub_tool_execontext.h
===================================================================
--- trunk/include/pub_tool_execontext.h 2008-12-12 08:08:58 UTC (rev 8817)
+++ trunk/include/pub_tool_execontext.h 2008-12-12 13:23:03 UTC (rev 8818)
@@ -54,6 +54,9 @@
// ThreadId should be passed in by the core. The initial IP value to
// use is adjusted by first_ip_delta before the stack is unwound.
// A safe value to pass is zero.
+//
+// See comments in pub_tool_stacktrace.h for precise definition of
+// the meaning of the code addresses in the returned ExeContext.
extern
ExeContext* VG_(record_ExeContext) ( ThreadId tid, Word first_ip_delta );
Modified: trunk/include/pub_tool_stacktrace.h
===================================================================
--- trunk/include/pub_tool_stacktrace.h 2008-12-12 08:08:58 UTC (rev 8817)
+++ trunk/include/pub_tool_stacktrace.h 2008-12-12 13:23:03 UTC (rev 8818)
@@ -41,6 +41,18 @@
// The initial IP value to use is adjusted by first_ip_delta before
// the stack is unwound. A safe value to pass is zero.
//
+// The specific meaning of the returned addresses is:
+//
+// [0] is the IP of thread 'tid'
+// [1] points to the last byte of the call instruction that called [0].
+// [2] points to the last byte of the call instruction that called [1].
+// etc etc
+//
+// Hence ips[0 .. return_value-1] should all point to currently
+// 'active' (in the sense of a stack of unfinished function calls)
+// instructions. [0] points to the start of an arbitrary instruction.#
+// [1 ..] point to the last byte of a chain of call instructions.
+//
// If sps and fps are non-NULL, the corresponding frame-pointer and
// stack-pointer values for each frame are stored there.
|
|
From: <sv...@va...> - 2008-12-12 08:09:05
|
Author: sewardj
Date: 2008-12-12 08:08:58 +0000 (Fri, 12 Dec 2008)
New Revision: 8817
Log:
Fix format string warning in PRE(sys_eventfd2).
Modified:
trunk/coregrind/m_syswrap/syswrap-linux.c
Modified: trunk/coregrind/m_syswrap/syswrap-linux.c
===================================================================
--- trunk/coregrind/m_syswrap/syswrap-linux.c 2008-12-12 08:07:49 UTC (rev 8816)
+++ trunk/coregrind/m_syswrap/syswrap-linux.c 2008-12-12 08:08:58 UTC (rev 8817)
@@ -1113,7 +1113,7 @@
PRE(sys_eventfd2)
{
- PRINT("sys_eventfd2 ( %lu, %d )", ARG1,ARG2);
+ PRINT("sys_eventfd2 ( %lu, %ld )", ARG1,ARG2);
PRE_REG_READ2(long, "sys_eventfd2", unsigned int, count, int, flags);
}
POST(sys_eventfd2)
|
|
From: <sv...@va...> - 2008-12-12 08:07:56
|
Author: sewardj
Date: 2008-12-12 08:07:49 +0000 (Fri, 12 Dec 2008)
New Revision: 8816
Log:
Add a new module, m_seqmatch, which does very simple sequence (regexp)
matching, in the function VG_(generic_match). Patterns to be matched
against may contain only '*'-style wildcards (matches any number of
elements, we don't care what they are), '?' wildcards (matches exactly
one element, we don't care what it is) and literal elements.
It is totally abstractified, in the sense that the pattern and input
arrays may be arrays of anything. The caller provides enough
information so that VG_(generic_match) can step along both arrays, and
can ask the questions "is this pattern element a '*' ?", "is this
pattern element a '?' ?", and "does this pattern element match an
input element ?".
The existing function VG_(string_match) is reimplemented using
VG_(generic_match), although the ability to escape metacharacters in
the pattern string is removed -- I don't think it was ever used.
In m_errormgr, matching of suppression stacks (including wildcard
"..." lines) against error stacks is re-implemented using
VG_(generic_match).
Further detailed comments are in m_seqmatch.h and pub_tool_seqmatch.h.
A negative side effect is that VG_(string_match) will be much slower
than before, due to the abstractification. It may be necessary to
reimplement a specialised version later.
Added:
trunk/coregrind/m_seqmatch.c
trunk/coregrind/pub_core_seqmatch.h
trunk/include/pub_tool_seqmatch.h
Modified:
trunk/coregrind/Makefile.am
trunk/coregrind/m_debuginfo/debuginfo.c
trunk/coregrind/m_errormgr.c
trunk/coregrind/m_libcbase.c
trunk/coregrind/m_libcproc.c
trunk/coregrind/m_redir.c
trunk/include/Makefile.am
trunk/include/pub_tool_libcbase.h
Modified: trunk/coregrind/Makefile.am
===================================================================
--- trunk/coregrind/Makefile.am 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/coregrind/Makefile.am 2008-12-12 08:07:49 UTC (rev 8816)
@@ -121,6 +121,7 @@
pub_core_redir.h \
pub_core_replacemalloc.h\
pub_core_scheduler.h \
+ pub_core_seqmatch.h \
pub_core_sigframe.h \
pub_core_signals.h \
pub_core_sparsewa.h \
@@ -191,6 +192,7 @@
m_options.c \
m_oset.c \
m_redir.c \
+ m_seqmatch.c \
m_signals.c \
m_sparsewa.c \
m_stacks.c \
Modified: trunk/coregrind/m_debuginfo/debuginfo.c
===================================================================
--- trunk/coregrind/m_debuginfo/debuginfo.c 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/coregrind/m_debuginfo/debuginfo.c 2008-12-12 08:07:49 UTC (rev 8816)
@@ -43,6 +43,7 @@
#include "pub_core_libcassert.h"
#include "pub_core_libcprint.h"
#include "pub_core_libcfile.h"
+#include "pub_core_seqmatch.h"
#include "pub_core_options.h"
#include "pub_core_redir.h" // VG_(redir_notify_{new,delete}_SegInfo)
#include "pub_core_aspacemgr.h"
Modified: trunk/coregrind/m_errormgr.c
===================================================================
--- trunk/coregrind/m_errormgr.c 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/coregrind/m_errormgr.c 2008-12-12 08:07:49 UTC (rev 8816)
@@ -40,6 +40,7 @@
#include "pub_core_libcfile.h"
#include "pub_core_libcprint.h"
#include "pub_core_libcproc.h" // For VG_(getpid)()
+#include "pub_core_seqmatch.h"
#include "pub_core_mallocfree.h"
#include "pub_core_options.h"
#include "pub_core_stacktrace.h"
@@ -840,7 +841,7 @@
/*------------------------------------------------------------*/
-/*--- Standard suppressions ---*/
+/*--- Suppression parsing ---*/
/*------------------------------------------------------------*/
/* Get the next char from fd into *out_buf. Returns 1 if success,
@@ -939,8 +940,7 @@
/* Look for "tool" in a string like "tool1,tool2,tool3" */
-static __inline__
-Bool tool_name_present(Char *name, Char *names)
+static Bool tool_name_present(Char *name, Char *names)
{
Bool found;
Char *s = NULL; /* Shut gcc up */
@@ -1060,7 +1060,8 @@
}
if (VG_(needs).tool_errors &&
- !VG_TDICT_CALL(tool_read_extra_suppression_info, fd, buf, N_BUF, supp))
+ !VG_TDICT_CALL(tool_read_extra_suppression_info,
+ fd, buf, N_BUF, supp))
{
BOMB("bad or missing extra suppression info");
}
@@ -1160,6 +1161,100 @@
}
}
+
+/*------------------------------------------------------------*/
+/*--- Matching errors to suppressions ---*/
+/*------------------------------------------------------------*/
+
+/* Parameterising functions for the use of VG_(generic_match) in
+ suppression-vs-error matching. The suppression frames (SuppLoc)
+ play the role of 'pattern'-element, and the error frames (IPs,
+ hence simply Addrs) play the role of 'input'. In short then, we're
+ matching a sequence of Addrs against a pattern composed of a
+ sequence of SuppLocs.
+*/
+static Bool supploc_IsStar ( void* supplocV )
+{
+ SuppLoc* supploc = (SuppLoc*)supplocV;
+ return supploc->ty == DotDotDot;
+}
+
+static Bool supploc_IsQuery ( void* supplocV )
+{
+ return False; /* there's no '?' equivalent in the supp syntax */
+}
+
+static Bool supp_pattEQinp ( void* supplocV, void* addrV )
+{
+ SuppLoc* supploc = (SuppLoc*)supplocV; /* PATTERN */
+ Addr ip = *(Addr*)addrV; /* INPUT */
+
+ Char caller_name[ERRTXT_LEN];
+ caller_name[0] = 0;
+
+ /* So, does this IP address match this suppression-line? */
+ switch (supploc->ty) {
+ case DotDotDot:
+ /* supp_pattEQinp is a callback from VG_(generic_match). As
+ per the spec thereof (see include/pub_tool_seqmatch.h), we
+ should never get called with a pattern value for which the
+ _IsStar or _IsQuery function would return True. Hence
+ this can't happen. */
+ vg_assert(0);
+ case ObjName:
+ /* Get the object name into 'caller_name', or "???"
+ if unknown. */
+ if (!VG_(get_objname)(ip, caller_name, ERRTXT_LEN))
+ VG_(strcpy)(caller_name, "???");
+ break;
+ case FunName:
+ /* Get the function name into 'caller_name', or "???"
+ if unknown. */
+ // Nb: mangled names used in suppressions. Do, though,
+ // Z-demangle them, since otherwise it's possible to wind
+ // up comparing "malloc" in the suppression against
+ // "_vgrZU_libcZdsoZa_malloc" in the backtrace, and the
+ // two of them need to be made to match.
+ if (!VG_(get_fnname_Z_demangle_only)(ip, caller_name, ERRTXT_LEN))
+ VG_(strcpy)(caller_name, "???");
+ break;
+ default:
+ vg_assert(0);
+ }
+
+ /* So now we have the function or object name in caller_name, and
+ the pattern (at the character level) to match against is in
+ supploc->name. Hence (and leading to a re-entrant call of
+ VG_(generic_match)): */
+ return VG_(string_match)(supploc->name, caller_name);
+}
+
+/////////////////////////////////////////////////////
+
+static Bool supp_matches_callers(Error* err, Supp* su)
+{
+ /* Unwrap the args and set up the correct parameterisation of
+ VG_(generic_match), using supploc_IsStar, supploc_IsQuery and
+ supp_pattEQinp. */
+ /* note, StackTrace === Addr* */
+ StackTrace ips = VG_(get_ExeContext_StackTrace)(err->where);
+ UWord n_ips = VG_(get_ExeContext_n_ips)(err->where);
+ SuppLoc* supps = su->callers;
+ UWord n_supps = su->n_callers;
+ UWord szbPatt = sizeof(SuppLoc);
+ UWord szbInput = sizeof(Addr);
+ Bool matchAll = False; /* we just want to match a prefix */
+ return
+ VG_(generic_match)(
+ matchAll,
+ /*PATT*/supps, szbPatt, n_supps, 0/*initial Ix*/,
+ /*INPUT*/ips, szbInput, n_ips, 0/*initial Ix*/,
+ supploc_IsStar, supploc_IsQuery, supp_pattEQinp
+ );
+}
+
+/////////////////////////////////////////////////////
+
static
Bool supp_matches_error(Supp* su, Error* err)
{
@@ -1180,96 +1275,8 @@
}
}
+/////////////////////////////////////////////////////
-/* This function is recursive, in order to handle frame-level
- wildcards. */
-static
-Bool supp_matches_callers_WRK ( StackTrace trace, Int n_ips,
- SuppLoc *callers, Int n_callers )
-{
- Int i, j;
- static Char caller_name[ERRTXT_LEN]; /* NOT IN FRAME */
-
- vg_assert(n_ips > 0 && n_callers > 0);
- i = j = 0;
- while (i < n_callers) {
- Addr a = trace[j];
-
- switch (callers[i].ty) {
- case ObjName:
- if (!VG_(get_objname)(a, caller_name, ERRTXT_LEN))
- VG_(strcpy)(caller_name, "???");
- break;
- case FunName:
- // Nb: mangled names used in suppressions. Do, though,
- // Z-demangle them, since otherwise it's possible to wind
- // up comparing "malloc" in the suppression against
- // "_vgrZU_libcZdsoZa_malloc" in the backtrace, and the
- // two of them need to be made to match.
- if (!VG_(get_fnname_Z_demangle_only)(a, caller_name, ERRTXT_LEN))
- VG_(strcpy)(caller_name, "???");
- break;
- case DotDotDot:
- caller_name[0] = 0; /* precautionary */
- break;
- default:
- VG_(tool_panic)("supp_wildmatch_callers");
- }
- // If "..." is given in a suppression (either obj, or fun), then
- // use it as wildcard, and match as many callers as possible.
- if (callers[i].ty == DotDotDot) {
- /* Handle frame-level wildcard case */
- Char *lookahead;
-
- // collapse subsequent wildcards
- while (i < n_callers && callers[i].ty == DotDotDot)
- ++i;
- --i;
-
- if (i == n_callers-1)
- // wildcard at the top, doesn't matter
- return True;
-
- vg_assert(i >= 0 && i+1 < n_callers);
- lookahead = callers[i+1].name;
- while (j < n_ips) {
- static Char tmp[ERRTXT_LEN]; /* NOT IN FRAME */
-
- if (!VG_(get_fnname_Z_demangle_only)(trace[j], tmp, ERRTXT_LEN))
- VG_(strcpy)(tmp, "???");
- if (VG_(string_match)(lookahead, tmp)) {
- // found a possible continuation, try from there
- return supp_matches_callers_WRK(
- &trace[j], n_ips - j,
- &callers[i+1], n_callers - i - 1
- );
- }
- j++;
- }
- } else {
- /* Handle normal (obj: or fun:) case */
- if (!VG_(string_match)(callers[i].name, caller_name)) {
- return False;
- }
- }
- j++;
- i++;
- }
-
- /* If we reach here, it's a match */
- return True;
-}
-
-static
-Bool supp_matches_callers(Error* err, Supp* su)
-{
- /* Unwrap the args and pass them to the worker function. */
- StackTrace ips = VG_(get_ExeContext_StackTrace)(err->where);
- UInt n_ips = VG_(get_ExeContext_n_ips)(err->where);
- return supp_matches_callers_WRK(ips, n_ips, su->callers, su->n_callers);
-}
-
-
/* Does an error context match a suppression? ie is this a suppressible
error? If so, return a pointer to the Supp record, otherwise NULL.
Tries to minimise the number of symbol searches since they are expensive.
Modified: trunk/coregrind/m_libcbase.c
===================================================================
--- trunk/coregrind/m_libcbase.c 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/coregrind/m_libcbase.c 2008-12-12 08:07:49 UTC (rev 8816)
@@ -428,68 +428,6 @@
/* ---------------------------------------------------------------------
- A simple string matching routine, purloined from Hugs98.
- '*' matches any sequence of zero or more characters
- '?' matches any single character exactly
- '\c' matches the character c only (ignoring special chars)
- c matches the character c only
- ------------------------------------------------------------------ */
-
-/* Keep track of recursion depth. */
-static Int recDepth;
-
-// Nb: vg_assert disabled because we can't use it from this module...
-static Bool string_match_wrk ( const Char* pat, const Char* str )
-{
- //vg_assert(recDepth >= 0 && recDepth < 500);
- recDepth++;
- for (;;) {
- switch (*pat) {
- case '\0':recDepth--;
- return (*str=='\0');
- case '*': do {
- if (string_match_wrk(pat+1,str)) {
- recDepth--;
- return True;
- }
- } while (*str++);
- recDepth--;
- return False;
- case '?': if (*str++=='\0') {
- recDepth--;
- return False;
- }
- pat++;
- break;
- case '\\':if (*++pat == '\0') {
- recDepth--;
- return False; /* spurious trailing \ in pattern */
- }
- /* falls through to ... */
- default : if (*pat++ != *str++) {
- recDepth--;
- return False;
- }
- break;
- }
- }
-}
-
-Bool VG_(string_match) ( const Char* pat, const Char* str )
-{
- Bool b;
- recDepth = 0;
- b = string_match_wrk ( pat, str );
- //vg_assert(recDepth == 0);
- /*
- VG_(printf)("%s %s %s\n",
- b?"TRUE ":"FALSE", pat, str);
- */
- return b;
-}
-
-
-/* ---------------------------------------------------------------------
mem* functions
------------------------------------------------------------------ */
Modified: trunk/coregrind/m_libcproc.c
===================================================================
--- trunk/coregrind/m_libcproc.c 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/coregrind/m_libcproc.c 2008-12-12 08:07:49 UTC (rev 8816)
@@ -36,6 +36,7 @@
#include "pub_core_libcprint.h"
#include "pub_core_libcproc.h"
#include "pub_core_libcsignal.h"
+#include "pub_core_seqmatch.h"
#include "pub_core_mallocfree.h"
#include "pub_core_syscall.h"
#include "pub_core_xarray.h"
Modified: trunk/coregrind/m_redir.c
===================================================================
--- trunk/coregrind/m_redir.c 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/coregrind/m_redir.c 2008-12-12 08:07:49 UTC (rev 8816)
@@ -36,6 +36,7 @@
#include "pub_core_libcbase.h"
#include "pub_core_libcassert.h"
#include "pub_core_libcprint.h"
+#include "pub_core_seqmatch.h"
#include "pub_core_mallocfree.h"
#include "pub_core_options.h"
#include "pub_core_oset.h"
Added: trunk/coregrind/m_seqmatch.c
===================================================================
--- trunk/coregrind/m_seqmatch.c (rev 0)
+++ trunk/coregrind/m_seqmatch.c 2008-12-12 08:07:49 UTC (rev 8816)
@@ -0,0 +1,233 @@
+
+/*--------------------------------------------------------------------*/
+/*--- A simple sequence matching facility. ---*/
+/*--- m_seqmatch.c ---*/
+/*--------------------------------------------------------------------*/
+
+/*
+ This file is part of Valgrind, a dynamic binary instrumentation
+ framework.
+
+ Copyright (C) 2008-2008 OpenWorks Ltd
+ in...@op...
+
+ 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.
+*/
+
+#include "pub_core_basics.h"
+#include "pub_core_libcassert.h"
+#include "pub_core_libcbase.h" // VG_(strlen)
+#include "pub_core_seqmatch.h" // self
+
+/* ---------------------------------------------------------------------
+ A simple sequence matching facility
+ ------------------------------------------------------------------ */
+
+/* See detailed comment in include/pub_tool_seqmatch.h about this. */
+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*)
+ )
+{
+ /* This is the spec, written in my favourite formal specification
+ language. It specifies non-greedy matching of '*'s.
+
+ ma ('*':ps) (i:is) = ma ps (i:is) || ma ('*':ps) is
+ ma ('*':ps) [] = ma ps []
+
+ ma ('?':ps) (i:is) = ma ps is
+ ma ('?':ps) [] = False
+
+ ma (p:ps) (i:is) = p == i && ma ps is
+
+ ma (p:ps) [] = False
+ ma [] (i:is) = False -- m-all, True for m-prefix
+ ma [] [] = True
+ */
+ Bool havePatt, haveInput;
+ void *currPatt, *currInput;
+ tailcall:
+ vg_assert(nPatt >= 0 && nPatt < 1000000); /* arbitrary */
+ vg_assert(nInput >= 0 && nInput < 1000000); /* arbitrary */
+ vg_assert(ixPatt >= 0 && ixPatt <= nPatt);
+ vg_assert(ixInput >= 0 && ixInput <= nInput);
+
+ havePatt = ixPatt < nPatt;
+ haveInput = ixInput < nInput;
+
+ /* No specific need to set NULL when !have{Patt,Input}, but guards
+ against inadvertantly dereferencing an out of range pointer to
+ the pattern or input arrays. */
+ currPatt = havePatt ? ((Char*)patt) + szbPatt * ixPatt : NULL;
+ currInput = haveInput ? ((Char*)input) + szbInput * ixInput : NULL;
+
+ // Deal with the complex case first: wildcards. Do frugal
+ // matching. When encountering a '*', first skip no characters
+ // at all, and see if the rest of the match still works. Only if
+ // that fails do we then skip a character, and retry at the next
+ // position.
+ //
+ // ma ('*':ps) (i:is) = ma ps (i:is) || ma ('*':ps) is
+ //
+ // If we're out of input, check the rest of the pattern matches
+ // the empty input. This really means can only be be empty or
+ // composed entirely of '*'s.
+ //
+ // ma ('*':ps) [] = ma ps []
+ //
+ if (havePatt && pIsStar(currPatt)) {
+ if (haveInput) {
+ // ma ('*':ps) (i:is) = ma ps (i:is) || ma ('*':ps) is
+ // we unavoidably have to make a real recursive call for the
+ // first half of the OR, since this isn't straight tail-recursion.
+ if (VG_(generic_match)( matchAll,
+ patt, szbPatt, nPatt, ixPatt+1,
+ input,szbInput,nInput, ixInput+0,
+ pIsStar,pIsQuery,pattEQinp) ) {
+ return True;
+ }
+ // but we can tail-recurse for the second call
+ ixInput++; goto tailcall;
+ } else {
+ // ma ('*':ps) [] = ma ps []
+ ixPatt++; goto tailcall;
+ }
+ }
+
+ // simpler cases now. Deal with '?' wildcards.
+ //
+ // ma ('?':ps) (i:is) = ma ps is
+ // ma ('?':ps) [] = False
+ if (havePatt && pIsQuery(currPatt)) {
+ if (haveInput) {
+ ixPatt++; ixInput++; goto tailcall;
+ } else {
+ return False;
+ }
+ }
+
+ // obvious case with literal chars in the pattern
+ //
+ // ma (p:ps) (i:is) = p == i && ma ps is
+ if (havePatt && haveInput) {
+ if (!pattEQinp(currPatt,currInput)) return False;
+ ixPatt++; ixInput++; goto tailcall;
+ }
+
+ // if we run out of input before we run out of pattern, we must fail
+ // ma (p:ps) [] = False
+ if (havePatt && !haveInput) return False;
+
+ // if we run out of pattern before we run out of input, the
+ // verdict depends on the matching mode. If we are trying to
+ // match exactly (the pattern must consume the entire input)
+ // then the outcome is failure. However, if we're merely attempting
+ // to match some prefix of the input, then we have been successful.
+ //
+ // ma [] (i:is) = False -- m-all, True for m-prefix
+ if (!havePatt && haveInput) {
+ return matchAll ? False // match-all
+ : True; // match-prefix
+ }
+
+ // finally, if both sequence and input are both completely
+ // consumed, then we were successful, regardless of matching mode.
+ if (!havePatt && !haveInput) return True;
+
+ // end of cases
+ vg_assert(0);
+}
+
+
+/* And a parameterization of the above, to make it do
+ string matching.
+*/
+static Bool charIsStar ( void* pV ) { return *(Char*)pV == '*'; }
+static Bool charIsQuery ( void* pV ) { return *(Char*)pV == '?'; }
+static Bool char_p_EQ_i ( void* pV, void* cV ) {
+ Char p = *(Char*)pV;
+ Char c = *(Char*)cV;
+ vg_assert(p != '*' && p != '?');
+ return p == c;
+}
+Bool VG_(string_match) ( const Char* patt, const Char* input )
+{
+ return VG_(generic_match)(
+ True/* match-all */,
+ (void*)patt, sizeof(UChar), VG_(strlen)(patt), 0,
+ (void*)input, sizeof(UChar), VG_(strlen)(input), 0,
+ charIsStar, charIsQuery, char_p_EQ_i
+ );
+}
+
+
+// test cases for the matcher (in match-all mode)
+// typedef struct { char* patt; char* input; Bool xres; } Test;
+//
+//static Test tests[] =
+// {
+// { "" ,"" , True },
+// { "a" ,"" , False },
+// { "a" ,"b" , False },
+// { "a" ,"a" , True },
+// { "a" ,"aa" , False },
+// { "*" ,"" , True },
+// { "**" ,"" , True },
+// { "*" ,"abc", True },
+// { "*a" ,"abc", False },
+// { "*b" ,"abc", False },
+// { "*bc" ,"abc", True },
+// { "a*b" ,"abc", False },
+// { "a*c" ,"abc", True },
+// { "*c" ,"abc", True },
+// { "c*c" ,"abc", False },
+// { "abc*" ,"abc", True },
+// { "abc**" ,"abc", True },
+// { "**abc" ,"abc", True },
+// { "**a*b*c**" ,"abc", True },
+// { "**a*b*d**" ,"abc", False },
+// { "a?b" ,"abc", False },
+// { "a?c" ,"abc", True },
+// { "?" ,"" , False },
+// { "?" ,"a" , True },
+// { "?" ,"ab" , False },
+// { "abcd" ,"abc", False },
+// { "ab" ,"abc", False },
+// { NULL ,NULL , False }
+// };
+//
+//int main ( void )
+//{
+// Test* t;
+// for (t = tests; t->patt; t++) {
+// printf("%10s %6s %s\n",
+// t->patt, t->input,
+// match_string_all((UChar*)t->patt,(UChar*)t->input,True)
+// == t->xres
+// ? "pass" : "FAIL" );
+// }
+// return 0;
+//}
+
+/*--------------------------------------------------------------------*/
+/*--- end m_seqmatch.c ---*/
+/*--------------------------------------------------------------------*/
Added: trunk/coregrind/pub_core_seqmatch.h
===================================================================
--- trunk/coregrind/pub_core_seqmatch.h (rev 0)
+++ trunk/coregrind/pub_core_seqmatch.h 2008-12-12 08:07:49 UTC (rev 8816)
@@ -0,0 +1,51 @@
+
+/*--------------------------------------------------------------------*/
+/*--- A simple sequence matching facility. ---*/
+/*--- pub_core_seqmatch.h ---*/
+/*--------------------------------------------------------------------*/
+
+/*
+ This file is part of Valgrind, a dynamic binary instrumentation
+ framework.
+
+ Copyright (C) 2008-2008 OpenWorks Ltd
+ in...@op...
+
+ 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_CORE_SEQMATCH_H
+#define __PUB_CORE_SEQMATCH_H
+
+//--------------------------------------------------------------------
+// PURPOSE: Provides a simple generic sequence matching facility, with
+// '*' and '?' style wildcards. Also provides a parameterisation
+// thereof suitable for matching strings. See pub_tool_seqmatch.h
+// for details.
+//--------------------------------------------------------------------
+
+// No core-only exports; everything in this module is visible to both
+// the core and tools.
+
+#include "pub_tool_seqmatch.h"
+
+#endif // __PUB_CORE_SEQMATCH_H
+
+/*--------------------------------------------------------------------*/
+/*--- end pub_core_seqmatch.h ---*/
+/*--------------------------------------------------------------------*/
Modified: trunk/include/Makefile.am
===================================================================
--- trunk/include/Makefile.am 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/include/Makefile.am 2008-12-12 08:07:49 UTC (rev 8816)
@@ -26,6 +26,7 @@
pub_tool_oset.h \
pub_tool_redir.h \
pub_tool_replacemalloc.h \
+ pub_tool_seqmatch.h \
pub_tool_signals.h \
pub_tool_sparsewa.h \
pub_tool_stacktrace.h \
Modified: trunk/include/pub_tool_libcbase.h
===================================================================
--- trunk/include/pub_tool_libcbase.h 2008-12-10 09:28:56 UTC (rev 8815)
+++ trunk/include/pub_tool_libcbase.h 2008-12-12 08:07:49 UTC (rev 8816)
@@ -97,10 +97,6 @@
last character. */
extern void VG_(strncpy_safely) ( Char* dest, const Char* src, SizeT ndest );
-/* Mini-regexp function. Searches for 'pat' in 'str'. Supports
- * meta-symbols '*' and '?'. '\' escapes meta-symbols. */
-extern Bool VG_(string_match) ( const Char* pat, const Char* str );
-
/* ---------------------------------------------------------------------
mem* functions
------------------------------------------------------------------ */
Added: trunk/include/pub_tool_seqmatch.h
===================================================================
--- trunk/include/pub_tool_seqmatch.h (rev 0)
+++ trunk/include/pub_tool_seqmatch.h 2008-12-12 08:07:49 UTC (rev 8816)
@@ -0,0 +1,91 @@
+
+/*--------------------------------------------------------------------*/
+/*--- A simple sequence matching facility. ---*/
+/*--- pub_tool_seqmatch.h ---*/
+/*--------------------------------------------------------------------*/
+
+/*
+ This file is part of Valgrind, a dynamic binary instrumentation
+ framework.
+
+ Copyright (C) 2008-2008 OpenWorks Ltd
+ in...@op...
+
+ 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).
+*/
+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*)
+ );
+
+/* 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 ---*/
+/*--------------------------------------------------------------------*/
|
|
From: Tom H. <th...@cy...> - 2008-12-12 04:11:08
|
Nightly build on alvis ( i686, Red Hat 7.3 ) started at 2008-12-12 03:15:03 GMT Results unchanged from 24 hours ago Checking out valgrind source tree ... done Configuring valgrind ... done Building valgrind ... done Running regression tests ... failed Regression test results follow == 374 tests, 89 stderr failures, 1 stdout failure, 29 post failures == exp-ptrcheck/tests/bad_percentify (stderr) exp-ptrcheck/tests/base (stderr) exp-ptrcheck/tests/ccc (stderr) exp-ptrcheck/tests/fp (stderr) exp-ptrcheck/tests/globalerr (stderr) exp-ptrcheck/tests/hackedbz2 (stderr) exp-ptrcheck/tests/hp_bounds (stderr) exp-ptrcheck/tests/hp_dangle (stderr) exp-ptrcheck/tests/justify (stderr) exp-ptrcheck/tests/partial_bad (stderr) exp-ptrcheck/tests/partial_good (stderr) exp-ptrcheck/tests/preen_invars (stderr) exp-ptrcheck/tests/pth_create (stderr) exp-ptrcheck/tests/pth_specific (stderr) exp-ptrcheck/tests/realloc (stderr) exp-ptrcheck/tests/stackerr (stderr) exp-ptrcheck/tests/strcpy (stderr) exp-ptrcheck/tests/supp (stderr) exp-ptrcheck/tests/tricky (stderr) exp-ptrcheck/tests/unaligned (stderr) exp-ptrcheck/tests/zero (stderr) helgrind/tests/bar_bad (stderr) helgrind/tests/bar_trivial (stderr) helgrind/tests/hg01_all_ok (stderr) helgrind/tests/hg02_deadlock (stderr) helgrind/tests/hg03_inherit (stderr) helgrind/tests/hg04_race (stderr) helgrind/tests/hg05_race2 (stderr) helgrind/tests/hg06_readshared (stderr) helgrind/tests/pth_barrier1 (stderr) helgrind/tests/pth_barrier2 (stderr) helgrind/tests/pth_barrier3 (stderr) helgrind/tests/rwlock_race (stderr) helgrind/tests/rwlock_test (stderr) helgrind/tests/tc01_simple_race (stderr) helgrind/tests/tc02_simple_tls (stderr) helgrind/tests/tc03_re_excl (stderr) helgrind/tests/tc04_free_lock (stderr) helgrind/tests/tc05_simple_race (stderr) helgrind/tests/tc06_two_races (stderr) helgrind/tests/tc07_hbl1 (stderr) helgrind/tests/tc08_hbl2 (stderr) helgrind/tests/tc09_bad_unlock (stderr) helgrind/tests/tc11_XCHG (stderr) helgrind/tests/tc12_rwl_trivial (stderr) helgrind/tests/tc14_laog_dinphils (stderr) helgrind/tests/tc16_byterace (stderr) helgrind/tests/tc17_sembar (stderr) helgrind/tests/tc18_semabuse (stderr) helgrind/tests/tc19_shadowmem (stderr) helgrind/tests/tc20_verifywrap (stderr) helgrind/tests/tc21_pthonce (stderr) helgrind/tests/tc22_exit_w_lock (stderr) helgrind/tests/tc23_bogus_condwait (stderr) helgrind/tests/tc24_nonzero_sem (stderr) massif/tests/alloc-fns-A (post) massif/tests/alloc-fns-B (post) massif/tests/basic (post) massif/tests/basic2 (post) massif/tests/big-alloc (post) massif/tests/culling1 (stderr) massif/tests/culling2 (stderr) massif/tests/custom_alloc (post) massif/tests/deep-A (post) massif/tests/deep-B (stderr) massif/tests/deep-B (post) massif/tests/deep-C (stderr) massif/tests/deep-C (post) massif/tests/deep-D (post) massif/tests/ignoring (post) massif/tests/insig (post) massif/tests/long-names (post) massif/tests/long-time (post) massif/tests/new-cpp (post) massif/tests/null (post) massif/tests/one (post) massif/tests/overloaded-new (post) massif/tests/peak (post) massif/tests/peak2 (stderr) massif/tests/peak2 (post) massif/tests/realloc (stderr) massif/tests/realloc (post) massif/tests/thresholds_0_0 (post) massif/tests/thresholds_0_10 (post) massif/tests/thresholds_10_0 (post) massif/tests/thresholds_10_10 (post) massif/tests/thresholds_5_0 (post) massif/tests/thresholds_5_10 (post) massif/tests/zero1 (post) massif/tests/zero2 (post) memcheck/tests/leak-0 (stderr) memcheck/tests/leak-cycle (stderr) memcheck/tests/leak-regroot (stderr) memcheck/tests/leak-tree (stderr) memcheck/tests/long_namespace_xml (stderr) memcheck/tests/malloc_free_fill (stderr) memcheck/tests/mismatches (stderr) memcheck/tests/origin1-yes (stderr) memcheck/tests/origin4-many (stderr) memcheck/tests/origin5-bz2 (stderr) memcheck/tests/pointer-trace (stderr) memcheck/tests/stack_changes (stderr) memcheck/tests/varinfo1 (stderr) memcheck/tests/varinfo2 (stderr) memcheck/tests/varinfo3 (stderr) memcheck/tests/varinfo4 (stderr) memcheck/tests/varinfo5 (stderr) memcheck/tests/varinfo6 (stderr) memcheck/tests/x86/bug152022 (stderr) memcheck/tests/x86/scalar (stderr) memcheck/tests/x86/scalar_supp (stderr) memcheck/tests/x86/xor-undef-x86 (stderr) memcheck/tests/xml1 (stderr) none/tests/blockfault (stderr) none/tests/mremap2 (stdout) none/tests/shell (stderr) none/tests/shell_valid1 (stderr) none/tests/shell_valid2 (stderr) none/tests/shell_valid3 (stderr) |
|
From: Tom H. <th...@cy...> - 2008-12-12 03:58:09
|
Nightly build on lloyd ( x86_64, Fedora 7 ) started at 2008-12-12 03:05:04 GMT Results unchanged from 24 hours ago Checking out valgrind source tree ... done Configuring valgrind ... done Building valgrind ... done Running regression tests ... failed Regression test results follow == 471 tests, 24 stderr failures, 0 stdout failures, 0 post failures == exp-ptrcheck/tests/base (stderr) exp-ptrcheck/tests/ccc (stderr) exp-ptrcheck/tests/preen_invars (stderr) exp-ptrcheck/tests/pth_create (stderr) exp-ptrcheck/tests/pth_specific (stderr) helgrind/tests/bar_bad (stderr) helgrind/tests/hg03_inherit (stderr) helgrind/tests/hg04_race (stderr) helgrind/tests/hg05_race2 (stderr) helgrind/tests/pth_barrier1 (stderr) helgrind/tests/pth_barrier2 (stderr) helgrind/tests/pth_barrier3 (stderr) helgrind/tests/rwlock_race (stderr) helgrind/tests/tc01_simple_race (stderr) helgrind/tests/tc05_simple_race (stderr) helgrind/tests/tc06_two_races (stderr) helgrind/tests/tc09_bad_unlock (stderr) helgrind/tests/tc16_byterace (stderr) helgrind/tests/tc19_shadowmem (stderr) helgrind/tests/tc20_verifywrap (stderr) helgrind/tests/tc21_pthonce (stderr) helgrind/tests/tc22_exit_w_lock (stderr) memcheck/tests/x86/scalar (stderr) none/tests/blockfault (stderr) |
|
From: Tom H. <th...@cy...> - 2008-12-12 03:52:31
|
Nightly build on trojan ( x86_64, Fedora Core 6 ) started at 2008-12-12 03:25:05 GMT Results unchanged from 24 hours ago Checking out valgrind source tree ... done Configuring valgrind ... done Building valgrind ... done Running regression tests ... failed Regression test results follow == 475 tests, 23 stderr failures, 4 stdout failures, 0 post failures == exp-ptrcheck/tests/ccc (stderr) exp-ptrcheck/tests/preen_invars (stderr) exp-ptrcheck/tests/pth_create (stderr) exp-ptrcheck/tests/pth_specific (stderr) helgrind/tests/hg03_inherit (stderr) helgrind/tests/hg04_race (stderr) helgrind/tests/hg05_race2 (stderr) helgrind/tests/pth_barrier1 (stderr) helgrind/tests/pth_barrier2 (stderr) helgrind/tests/pth_barrier3 (stderr) helgrind/tests/rwlock_race (stderr) helgrind/tests/tc01_simple_race (stderr) helgrind/tests/tc05_simple_race (stderr) helgrind/tests/tc06_two_races (stderr) helgrind/tests/tc09_bad_unlock (stderr) helgrind/tests/tc16_byterace (stderr) helgrind/tests/tc19_shadowmem (stderr) helgrind/tests/tc20_verifywrap (stderr) helgrind/tests/tc21_pthonce (stderr) helgrind/tests/tc22_exit_w_lock (stderr) memcheck/tests/x86/bug133694 (stdout) memcheck/tests/x86/bug133694 (stderr) memcheck/tests/x86/scalar (stderr) none/tests/blockfault (stderr) none/tests/cmdline1 (stdout) none/tests/cmdline2 (stdout) none/tests/mremap2 (stdout) |
|
From: Tom H. <th...@cy...> - 2008-12-12 03:34:37
|
Nightly build on gill ( x86_64, Fedora Core 2 ) started at 2008-12-12 03:00:04 GMT Results unchanged from 24 hours ago Checking out valgrind source tree ... done Configuring valgrind ... done Building valgrind ... done Running regression tests ... failed Regression test results follow == 477 tests, 37 stderr failures, 3 stdout failures, 0 post failures == exp-ptrcheck/tests/ccc (stderr) exp-ptrcheck/tests/hackedbz2 (stderr) helgrind/tests/bar_bad (stderr) helgrind/tests/hg01_all_ok (stderr) helgrind/tests/hg02_deadlock (stderr) helgrind/tests/hg03_inherit (stderr) helgrind/tests/hg04_race (stderr) helgrind/tests/hg05_race2 (stderr) helgrind/tests/pth_barrier1 (stderr) helgrind/tests/pth_barrier2 (stderr) helgrind/tests/pth_barrier3 (stderr) helgrind/tests/rwlock_race (stderr) helgrind/tests/rwlock_test (stderr) helgrind/tests/tc01_simple_race (stderr) helgrind/tests/tc05_simple_race (stderr) helgrind/tests/tc06_two_races (stderr) helgrind/tests/tc09_bad_unlock (stderr) helgrind/tests/tc14_laog_dinphils (stderr) helgrind/tests/tc16_byterace (stderr) helgrind/tests/tc17_sembar (stderr) helgrind/tests/tc19_shadowmem (stderr) helgrind/tests/tc20_verifywrap (stderr) helgrind/tests/tc21_pthonce (stderr) helgrind/tests/tc22_exit_w_lock (stderr) helgrind/tests/tc23_bogus_condwait (stderr) memcheck/tests/malloc_free_fill (stderr) memcheck/tests/origin5-bz2 (stderr) memcheck/tests/stack_switch (stderr) memcheck/tests/varinfo6 (stderr) memcheck/tests/x86/scalar (stderr) memcheck/tests/x86/scalar_supp (stderr) none/tests/amd64/insn_ssse3 (stdout) none/tests/amd64/insn_ssse3 (stderr) none/tests/amd64/ssse3_misaligned (stderr) none/tests/blockfault (stderr) none/tests/fdleak_fcntl (stderr) none/tests/mremap2 (stdout) none/tests/x86/insn_ssse3 (stdout) none/tests/x86/insn_ssse3 (stderr) none/tests/x86/ssse3_misaligned (stderr) |