sewardj | 267100d | 2005-04-24 12:33:12 +0000 | [diff] [blame] | 1 | |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 2 | /*--------------------------------------------------------------------*/ |
sewardj | 267100d | 2005-04-24 12:33:12 +0000 | [diff] [blame] | 3 | /*--- Take snapshots of client stacks. m_stacktrace.c ---*/ |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 4 | /*--------------------------------------------------------------------*/ |
| 5 | |
| 6 | /* |
| 7 | This file is part of Valgrind, a dynamic binary instrumentation |
| 8 | framework. |
| 9 | |
| 10 | Copyright (C) 2000-2005 Julian Seward |
| 11 | jseward@acm.org |
| 12 | |
| 13 | This program is free software; you can redistribute it and/or |
| 14 | modify it under the terms of the GNU General Public License as |
| 15 | published by the Free Software Foundation; either version 2 of the |
| 16 | License, or (at your option) any later version. |
| 17 | |
| 18 | This program is distributed in the hope that it will be useful, but |
| 19 | WITHOUT ANY WARRANTY; without even the implied warranty of |
| 20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 21 | General Public License for more details. |
| 22 | |
| 23 | You should have received a copy of the GNU General Public License |
| 24 | along with this program; if not, write to the Free Software |
| 25 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA |
| 26 | 02111-1307, USA. |
| 27 | |
| 28 | The GNU General Public License is contained in the file COPYING. |
| 29 | */ |
| 30 | |
njn | c7561b9 | 2005-06-19 01:24:32 +0000 | [diff] [blame] | 31 | #include "pub_core_basics.h" |
| 32 | #include "pub_core_threadstate.h" |
njn | 88c5148 | 2005-06-25 20:49:33 +0000 | [diff] [blame] | 33 | #include "pub_core_debuginfo.h" |
njn | 24a6efb | 2005-06-20 03:36:51 +0000 | [diff] [blame] | 34 | #include "pub_core_aspacemgr.h" // For VG_(is_addressable)() |
njn | 97405b2 | 2005-06-02 03:39:33 +0000 | [diff] [blame] | 35 | #include "pub_core_libcbase.h" |
njn | 132bfcc | 2005-06-04 19:16:06 +0000 | [diff] [blame] | 36 | #include "pub_core_libcassert.h" |
njn | 36a20fa | 2005-06-03 03:08:39 +0000 | [diff] [blame] | 37 | #include "pub_core_libcprint.h" |
njn | f536bbb | 2005-06-13 04:21:38 +0000 | [diff] [blame] | 38 | #include "pub_core_machine.h" |
njn | 2024234 | 2005-05-16 23:31:24 +0000 | [diff] [blame] | 39 | #include "pub_core_options.h" |
njn | 31513b4 | 2005-06-01 03:09:59 +0000 | [diff] [blame] | 40 | #include "pub_core_profile.h" |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 41 | #include "pub_core_stacktrace.h" |
njn | a7598f6 | 2005-06-18 03:27:58 +0000 | [diff] [blame] | 42 | #include "pub_core_trampoline.h" |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 43 | |
| 44 | /*------------------------------------------------------------*/ |
| 45 | /*--- Exported functions. ---*/ |
| 46 | /*------------------------------------------------------------*/ |
| 47 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 48 | /* Take a snapshot of the client's stack, putting the up to 'n_ips' |
| 49 | IPs into 'ips'. In order to be thread-safe, we pass in the |
| 50 | thread's IP SP, FP if that's meaningful, and LR if that's |
| 51 | meaningful. Returns number of IPs put in 'ips'. |
| 52 | */ |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 53 | UInt VG_(get_StackTrace2) ( Addr* ips, UInt n_ips, |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 54 | Addr ip, Addr sp, Addr fp, Addr lr, |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 55 | Addr fp_min, Addr fp_max_orig ) |
| 56 | { |
njn | 2a3b929 | 2005-08-24 01:56:15 +0000 | [diff] [blame] | 57 | #if defined(VGP_ppc32_linux) |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 58 | Bool lr_is_first_RA = False; /* ppc only */ |
njn | 2a3b929 | 2005-08-24 01:56:15 +0000 | [diff] [blame] | 59 | #endif |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 60 | Bool debug = False; |
| 61 | Int i; |
| 62 | Addr fp_max; |
| 63 | UInt n_found = 0; |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 64 | |
| 65 | VGP_PUSHCC(VgpExeContext); |
| 66 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 67 | vg_assert(sizeof(Addr) == sizeof(UWord)); |
| 68 | vg_assert(sizeof(Addr) == sizeof(void*)); |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 69 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 70 | /* Snaffle IPs from the client's stack into ips[0 .. n_ips-1], |
| 71 | putting zeroes in when the trail goes cold, which we guess to be |
| 72 | when FP is not a reasonable stack location. */ |
| 73 | |
| 74 | for (i = 0; i < n_ips; i++) |
| 75 | ips[i] = 0; |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 76 | |
| 77 | // JRS 2002-sep-17: hack, to round up fp_max to the end of the |
| 78 | // current page, at least. Dunno if it helps. |
| 79 | // NJN 2002-sep-17: seems to -- stack traces look like 1.0.X again |
sewardj | 45f4e7c | 2005-09-27 19:20:21 +0000 | [diff] [blame] | 80 | fp_max = VG_PGROUNDUP(fp_max_orig); |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 81 | fp_max -= sizeof(Addr); |
| 82 | |
| 83 | if (debug) |
| 84 | VG_(printf)("n_ips=%d fp_min=%p fp_max_orig=%p, fp_max=%p ip=%p fp=%p\n", |
| 85 | n_ips, fp_min, fp_max_orig, fp_max, ip, fp); |
| 86 | |
| 87 | /* Assertion broken before main() is reached in pthreaded programs; the |
| 88 | * offending stack traces only have one item. --njn, 2002-aug-16 */ |
| 89 | /* vg_assert(fp_min <= fp_max);*/ |
| 90 | |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 91 | if (fp_min + VG_(clo_max_stackframe) <= fp_max) { |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 92 | /* If the stack is ridiculously big, don't poke around ... but |
| 93 | don't bomb out either. Needed to make John Regehr's |
| 94 | user-space threads package work. JRS 20021001 */ |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 95 | ips[0] = ip; |
| 96 | VGP_POPCC(VgpExeContext); |
| 97 | return 1; |
| 98 | } |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 99 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 100 | /* Otherwise unwind the stack in a platform-specific way. Trying |
| 101 | to merge the x86, amd64 and ppc32 logic into a single piece of |
sewardj | 75ea798 | 2005-11-14 15:18:25 +0000 | [diff] [blame^] | 102 | code is just too confusing and difficult to performance-tune. */ |
njn | 88b5a98 | 2005-05-16 00:16:56 +0000 | [diff] [blame] | 103 | |
sewardj | 75ea798 | 2005-11-14 15:18:25 +0000 | [diff] [blame^] | 104 | # if defined(VGP_x86_linux) |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 105 | |
sewardj | 75ea798 | 2005-11-14 15:18:25 +0000 | [diff] [blame^] | 106 | /*--------------------- x86 ---------------------*/ |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 107 | |
sewardj | 75ea798 | 2005-11-14 15:18:25 +0000 | [diff] [blame^] | 108 | /* fp is %ebp. sp is %esp. ip is %eip. */ |
| 109 | |
| 110 | ips[0] = ip; |
| 111 | i = 1; |
| 112 | |
| 113 | /* Loop unwinding the stack. Note that the IP value we get on |
| 114 | * each pass (whether from CFI info or a stack frame) is a |
| 115 | * return address so is actually after the calling instruction |
| 116 | * in the calling function. |
| 117 | * |
| 118 | * Because of this we subtract one from the IP after each pass |
| 119 | * of the loop so that we find the right CFI block on the next |
| 120 | * pass - otherwise we can find the wrong CFI info if it happens |
| 121 | * to change after the calling instruction and that will mean |
| 122 | * that we will fail to unwind the next step. |
| 123 | * |
| 124 | * This most frequently happens at the end of a function when |
| 125 | * a tail call occurs and we wind up using the CFI info for the |
| 126 | * next function which is completely wrong. |
| 127 | */ |
| 128 | while (True) { |
| 129 | |
| 130 | if (i >= n_ips) |
| 131 | break; |
| 132 | |
| 133 | /* Try to derive a new (ip,sp,fp) triple from the current |
| 134 | set. */ |
| 135 | |
| 136 | /* On x86, first try the old-fashioned method of following the |
| 137 | %ebp-chain. Code which doesn't use this (that is, compiled |
| 138 | with -fomit-frame-pointer) is not ABI compliant and so |
| 139 | relatively rare. Besides, trying the CFI first almost always |
| 140 | fails, and is expensive. */ |
| 141 | /* Deal with frames resulting from functions which begin "pushl% |
| 142 | ebp ; movl %esp, %ebp" which is the ABI-mandated preamble. */ |
| 143 | if (fp_min <= fp && fp <= fp_max) { |
| 144 | /* fp looks sane, so use it. */ |
| 145 | ip = (((UWord*)fp)[1]); |
| 146 | sp = fp + sizeof(Addr) /*saved %ebp*/ |
| 147 | + sizeof(Addr) /*ra*/; |
| 148 | fp = (((UWord*)fp)[0]); |
| 149 | ips[i++] = ip; |
| 150 | if (debug) |
| 151 | VG_(printf)(" ipsF[%d]=%08p\n", i-1, ips[i-1]); |
| 152 | ip = ip - 1; |
| 153 | continue; |
| 154 | } |
| 155 | |
| 156 | /* That didn't work out, so see if there is any CFI info to hand |
| 157 | which can be used. */ |
| 158 | if ( VG_(use_CFI_info)( &ip, &sp, &fp, fp_min, fp_max ) ) { |
| 159 | ips[i++] = ip; |
| 160 | if (debug) |
| 161 | VG_(printf)(" ipsC[%d]=%08p\n", i-1, ips[i-1]); |
| 162 | ip = ip - 1; |
| 163 | continue; |
| 164 | } |
| 165 | |
| 166 | /* No luck. We have to give up. */ |
| 167 | break; |
| 168 | } |
| 169 | |
| 170 | # elif defined(VGP_amd64_linux) |
| 171 | |
| 172 | /*--------------------- amd64 ---------------------*/ |
| 173 | |
| 174 | /* fp is %rbp. sp is %rsp. ip is %rip. */ |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 175 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 176 | ips[0] = ip; |
| 177 | i = 1; |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 178 | |
tom | ac35f10 | 2005-11-05 00:17:21 +0000 | [diff] [blame] | 179 | /* Loop unwinding the stack. Note that the IP value we get on |
| 180 | * each pass (whether from CFI info or a stack frame) is a |
| 181 | * return address so is actually after the calling instruction |
| 182 | * in the calling function. |
| 183 | * |
| 184 | * Because of this we subtract one from the IP after each pass |
| 185 | * of the loop so that we find the right CFI block on the next |
| 186 | * pass - otherwise we can find the wrong CFI info if it happens |
| 187 | * to change after the calling instruction and that will mean |
| 188 | * that we will fail to unwind the next step. |
| 189 | * |
| 190 | * This most frequently happens at the end of a function when |
| 191 | * a tail call occurs and we wind up using the CFI info for the |
| 192 | * next function which is completely wrong. |
| 193 | */ |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 194 | while (True) { |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 195 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 196 | if (i >= n_ips) |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 197 | break; |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 198 | |
| 199 | /* Try to derive a new (ip,sp,fp) triple from the current |
| 200 | set. */ |
| 201 | |
| 202 | /* First off, see if there is any CFI info to hand which can |
| 203 | be used. */ |
| 204 | if ( VG_(use_CFI_info)( &ip, &sp, &fp, fp_min, fp_max ) ) { |
| 205 | ips[i++] = ip; |
| 206 | if (debug) |
| 207 | VG_(printf)(" ipsC[%d]=%08p\n", i-1, ips[i-1]); |
tom | 121d1d0 | 2005-11-04 11:31:33 +0000 | [diff] [blame] | 208 | ip = ip - 1; |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 209 | continue; |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 210 | } |
sewardj | 3516553 | 2005-04-30 18:47:48 +0000 | [diff] [blame] | 211 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 212 | /* If VG_(use_CFI_info) fails, it won't modify ip/sp/fp, so |
| 213 | we can safely try the old-fashioned method. */ |
| 214 | /* This bit is supposed to deal with frames resulting from |
sewardj | 75ea798 | 2005-11-14 15:18:25 +0000 | [diff] [blame^] | 215 | functions which begin "pushq %rbp ; movq %rsp, %rbp". |
| 216 | Unfortunately, since we can't (easily) look at the insns at |
| 217 | the start of the fn, like GDB does, there's no reliable way |
| 218 | to tell. Hence the hack of first trying out CFI, and if that |
| 219 | fails, then use this as a fallback. */ |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 220 | if (fp_min <= fp && fp <= fp_max) { |
| 221 | /* fp looks sane, so use it. */ |
| 222 | ip = (((UWord*)fp)[1]); |
sewardj | 75ea798 | 2005-11-14 15:18:25 +0000 | [diff] [blame^] | 223 | sp = fp + sizeof(Addr) /*saved %rbp*/ |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 224 | + sizeof(Addr) /*ra*/; |
| 225 | fp = (((UWord*)fp)[0]); |
| 226 | ips[i++] = ip; |
| 227 | if (debug) |
| 228 | VG_(printf)(" ipsF[%d]=%08p\n", i-1, ips[i-1]); |
tom | 121d1d0 | 2005-11-04 11:31:33 +0000 | [diff] [blame] | 229 | ip = ip - 1; |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 230 | continue; |
| 231 | } |
| 232 | |
| 233 | /* No luck there. We have to give up. */ |
| 234 | break; |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 235 | } |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 236 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 237 | # elif defined(VGP_ppc32_linux) |
| 238 | |
sewardj | 75ea798 | 2005-11-14 15:18:25 +0000 | [diff] [blame^] | 239 | /*--------------------- ppc32 ---------------------*/ |
| 240 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 241 | /* fp is %r1. ip is %cia. Note, ppc uses r1 as both the stack and |
| 242 | frame pointers. */ |
| 243 | |
| 244 | lr_is_first_RA = False; |
| 245 | { |
| 246 | # define M_VG_ERRTXT 1000 |
| 247 | UChar buf_lr[M_VG_ERRTXT], buf_ip[M_VG_ERRTXT]; |
| 248 | if (VG_(get_fnname_nodemangle) (lr, buf_lr, M_VG_ERRTXT)) |
| 249 | if (VG_(get_fnname_nodemangle) (ip, buf_ip, M_VG_ERRTXT)) |
| 250 | if (VG_(strncmp)(buf_lr, buf_ip, M_VG_ERRTXT)) |
| 251 | lr_is_first_RA = True; |
| 252 | # undef M_VG_ERRTXT |
| 253 | } |
| 254 | |
| 255 | ips[0] = ip; |
| 256 | i = 1; |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 257 | |
sewardj | 525e232 | 2005-11-13 02:41:35 +0000 | [diff] [blame] | 258 | if (fp_min <= fp && fp < fp_max-4+1) { |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 259 | |
sewardj | 525e232 | 2005-11-13 02:41:35 +0000 | [diff] [blame] | 260 | /* initial FP is sane; keep going */ |
| 261 | fp = (((UWord*)fp)[0]); |
| 262 | |
| 263 | while (True) { |
| 264 | |
| 265 | if (i >= n_ips) |
| 266 | break; |
| 267 | |
| 268 | /* Try to derive a new (ip,fp) pair from the current set. */ |
| 269 | |
| 270 | if (fp_min <= fp && fp <= fp_max) { |
| 271 | /* fp looks sane, so use it. */ |
| 272 | |
| 273 | if (i == 1 && lr_is_first_RA) |
| 274 | ip = lr; |
| 275 | else |
| 276 | ip = (((UWord*)fp)[1]); |
| 277 | |
| 278 | fp = (((UWord*)fp)[0]); |
| 279 | ips[i++] = ip; |
| 280 | if (debug) |
| 281 | VG_(printf)(" ipsF[%d]=%08p\n", i-1, ips[i-1]); |
| 282 | continue; |
| 283 | } |
| 284 | |
| 285 | /* No luck there. We have to give up. */ |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 286 | break; |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 287 | } |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 288 | } |
| 289 | |
| 290 | # else |
| 291 | # error "Unknown platform" |
| 292 | # endif |
| 293 | |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 294 | n_found = i; |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 295 | VGP_POPCC(VgpExeContext); |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 296 | return n_found; |
| 297 | } |
| 298 | |
| 299 | UInt VG_(get_StackTrace) ( ThreadId tid, StackTrace ips, UInt n_ips ) |
| 300 | { |
| 301 | /* thread in thread table */ |
njn | f536bbb | 2005-06-13 04:21:38 +0000 | [diff] [blame] | 302 | Addr ip = VG_(get_IP)(tid); |
| 303 | Addr fp = VG_(get_FP)(tid); |
| 304 | Addr sp = VG_(get_SP)(tid); |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 305 | Addr lr = VG_(get_LR)(tid); |
njn | f536bbb | 2005-06-13 04:21:38 +0000 | [diff] [blame] | 306 | Addr stack_highest_word = VG_(threads)[tid].client_stack_highest_word; |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 307 | |
sewardj | b9bce63 | 2005-06-21 01:41:34 +0000 | [diff] [blame] | 308 | # if defined(VGP_x86_linux) |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 309 | /* Nasty little hack to deal with sysinfo syscalls - if libc is |
| 310 | using the sysinfo page for syscalls (the TLS version does), then |
| 311 | ip will always appear to be in that page when doing a syscall, |
| 312 | not the actual libc function doing the syscall. This check sees |
| 313 | if IP is within the syscall code, and pops the return address |
| 314 | off the stack so that ip is placed within the library function |
| 315 | calling the syscall. This makes stack backtraces much more |
| 316 | useful. */ |
sewardj | b9bce63 | 2005-06-21 01:41:34 +0000 | [diff] [blame] | 317 | if (ip >= (Addr)&VG_(trampoline_stuff_start) |
| 318 | && ip < (Addr)&VG_(trampoline_stuff_end) |
sewardj | 45f4e7c | 2005-09-27 19:20:21 +0000 | [diff] [blame] | 319 | && VG_(am_is_valid_for_client)(sp, sizeof(Addr), VKI_PROT_READ)) { |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 320 | ip = *(Addr *)sp; |
| 321 | sp += sizeof(Addr); |
| 322 | } |
sewardj | b9bce63 | 2005-06-21 01:41:34 +0000 | [diff] [blame] | 323 | # endif |
| 324 | |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 325 | if (0) |
| 326 | VG_(printf)("tid %d: stack_highest=%p ip=%p sp=%p fp=%p\n", |
| 327 | tid, stack_highest_word, ip, sp, fp); |
| 328 | |
sewardj | acaec5f | 2005-08-19 16:02:59 +0000 | [diff] [blame] | 329 | return VG_(get_StackTrace2)(ips, n_ips, ip, sp, fp, lr, sp, stack_highest_word); |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 330 | } |
| 331 | |
| 332 | static void printIpDesc(UInt n, Addr ip) |
| 333 | { |
njn | 83f9e79 | 2005-06-11 05:04:09 +0000 | [diff] [blame] | 334 | #define BUF_LEN 4096 |
| 335 | |
| 336 | static UChar buf[BUF_LEN]; |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 337 | |
njn | 83f9e79 | 2005-06-11 05:04:09 +0000 | [diff] [blame] | 338 | VG_(describe_IP)(ip, buf, BUF_LEN); |
sewardj | 71bc3cb | 2005-05-19 00:25:45 +0000 | [diff] [blame] | 339 | |
| 340 | if (VG_(clo_xml)) { |
| 341 | VG_(message)(Vg_UserMsg, " %s", buf); |
| 342 | } else { |
| 343 | VG_(message)(Vg_UserMsg, " %s %s", ( n == 0 ? "at" : "by" ), buf); |
| 344 | } |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 345 | } |
| 346 | |
| 347 | /* Print a StackTrace. */ |
| 348 | void VG_(pp_StackTrace) ( StackTrace ips, UInt n_ips ) |
| 349 | { |
| 350 | vg_assert( n_ips > 0 ); |
sewardj | 71bc3cb | 2005-05-19 00:25:45 +0000 | [diff] [blame] | 351 | |
| 352 | if (VG_(clo_xml)) |
| 353 | VG_(message)(Vg_UserMsg, " <stack>"); |
| 354 | |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 355 | VG_(apply_StackTrace)( printIpDesc, ips, n_ips ); |
sewardj | 71bc3cb | 2005-05-19 00:25:45 +0000 | [diff] [blame] | 356 | |
| 357 | if (VG_(clo_xml)) |
| 358 | VG_(message)(Vg_UserMsg, " </stack>"); |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 359 | } |
| 360 | |
| 361 | /* Get and immediately print a StackTrace. */ |
| 362 | void VG_(get_and_pp_StackTrace) ( ThreadId tid, UInt n_ips ) |
| 363 | { |
| 364 | Addr ips[n_ips]; |
| 365 | VG_(get_StackTrace)(tid, ips, n_ips); |
| 366 | VG_(pp_StackTrace) ( ips, n_ips); |
| 367 | } |
| 368 | |
| 369 | |
| 370 | void VG_(apply_StackTrace)( void(*action)(UInt n, Addr ip), |
| 371 | StackTrace ips, UInt n_ips ) |
| 372 | { |
| 373 | #define MYBUF_LEN 10 // only needs to be long enough for "main" |
| 374 | |
| 375 | Bool main_done = False; |
| 376 | Char mybuf[MYBUF_LEN]; // ok to stack allocate mybuf[] -- it's tiny |
| 377 | Int i = 0; |
| 378 | |
| 379 | vg_assert(n_ips > 0); |
| 380 | do { |
| 381 | Addr ip = ips[i]; |
| 382 | if (i > 0) |
njn | af839f5 | 2005-06-23 03:27:57 +0000 | [diff] [blame] | 383 | ip -= VG_MIN_INSTR_SZB; // point to calling line |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 384 | |
| 385 | // Stop after "main"; if main() is recursive, stop after last main(). |
| 386 | if ( ! VG_(clo_show_below_main)) { |
| 387 | VG_(get_fnname_nodemangle)( ip, mybuf, MYBUF_LEN ); |
| 388 | if ( VG_STREQ("main", mybuf) ) |
| 389 | main_done = True; |
| 390 | else if (main_done) |
| 391 | break; |
| 392 | } |
| 393 | |
| 394 | // Act on the ip |
| 395 | action(i, ip); |
| 396 | |
| 397 | i++; |
| 398 | } while (i < n_ips && ips[i] != 0); |
| 399 | |
| 400 | #undef MYBUF_LEN |
| 401 | } |
| 402 | |
| 403 | |
| 404 | /*--------------------------------------------------------------------*/ |
njn | 24a6efb | 2005-06-20 03:36:51 +0000 | [diff] [blame] | 405 | /*--- end ---*/ |
njn | d01fef7 | 2005-03-25 23:35:48 +0000 | [diff] [blame] | 406 | /*--------------------------------------------------------------------*/ |