mirror of
https://github.com/Zenithsiz/ftmemsim-valgrind.git
synced 2026-02-04 02:18:37 +00:00
both wrapped up in XML tags (as before) but also in plain text in a sequence of CDATA blocks. Normally only one, but in the worst case the raw data will have ]]> in it, in which case it needs to be split across two CDATA blocks. This apparently simple change involved a lot of refactoring of the suppression printing machinery: * in the core-tool iface, change "print_extra_suppression_info" (which prints any auxiliary info) to "get_extra_suppression_info", which parks the text in a caller-supplied buffer. Adjust tools to match. * VG_(apply_StackTrace): accept a void* argument, which is passed to each invokation of the functional parameter (a poor man's closure implementation). * move PRINTF_CHECK into put_tool_basics.h, where it should have been all along * move private printf-into-an-XArray-of-character functions from m_debuginfo into m_xarray, and make them public * gen_suppression itself: use all the above changes. Basically we always generate the plaintext version into an XArray. In text mode that's just printed. In XML mode, we print the XMLery as before, but the plaintext version is dumped into a CDATA block too. * update the Protocol 4 specification to match all this. This still isn't 100% right in the sense that the CDATA block data needs to be split across multiple blocks if it should ever contain the CDATA end mark "]]>". The Protocol 4 spec has this right even though the implementation currently doesn't. Fixes #191189. git-svn-id: svn://svn.valgrind.org/valgrind/trunk@10822
88 lines
3.6 KiB
C
88 lines
3.6 KiB
C
/*--------------------------------------------------------------------*/
|
|
/*--- Stack traces: getting, traversing, printing. ---*/
|
|
/*--- tool_stacktrace.h ---*/
|
|
/*--------------------------------------------------------------------*/
|
|
|
|
/*
|
|
This file is part of Valgrind, a dynamic binary instrumentation
|
|
framework.
|
|
|
|
Copyright (C) 2000-2009 Julian Seward
|
|
jseward@acm.org
|
|
|
|
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_STACKTRACE_H
|
|
#define __PUB_TOOL_STACKTRACE_H
|
|
|
|
// The basic stack trace type: just an array of code addresses.
|
|
typedef Addr* StackTrace;
|
|
|
|
// Walks the stack to get instruction pointers from the top stack frames
|
|
// for thread 'tid'. Maximum of 'n_ips' addresses put into 'ips';
|
|
// 0 is the top of the stack, 1 is its caller, etc. Everything from
|
|
// ips[return_value] onwards is undefined and should not be read.
|
|
// 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.
|
|
|
|
extern UInt VG_(get_StackTrace) ( ThreadId tid,
|
|
/*OUT*/StackTrace ips, UInt n_ips,
|
|
/*OUT*/StackTrace sps,
|
|
/*OUT*/StackTrace fps,
|
|
Word first_ip_delta );
|
|
|
|
// Apply a function to every element in the StackTrace. The parameter
|
|
// 'n' gives the index of the passed ip. 'opaque' is an arbitrary
|
|
// pointer provided to each invokation of 'action' (a poor man's
|
|
// closure). Doesn't go below main() unless --show-below-main=yes is
|
|
// set.
|
|
extern void VG_(apply_StackTrace)(
|
|
void(*action)(UInt n, Addr ip, void* opaque),
|
|
void* opaque,
|
|
StackTrace ips, UInt n_ips
|
|
);
|
|
|
|
// Print a StackTrace.
|
|
extern void VG_(pp_StackTrace) ( StackTrace ips, UInt n_ips );
|
|
|
|
// Gets and immediately prints a StackTrace. Just a bit simpler than
|
|
// calling VG_(get_StackTrace)() then VG_(pp_StackTrace)().
|
|
extern void VG_(get_and_pp_StackTrace) ( ThreadId tid, UInt n_ips );
|
|
|
|
#endif // __PUB_TOOL_STACKTRACE_H
|
|
|
|
/*--------------------------------------------------------------------*/
|
|
/*--- end ---*/
|
|
/*--------------------------------------------------------------------*/
|