| To: | Atsushi Nemoto <anemo@mba.ocn.ne.jp> |
|---|---|
| Subject: | Re: [PATCH] dump_stack() based on prologue code analysis |
| From: | David Daney <ddaney@avtrex.com> |
| Date: | Fri, 28 Jul 2006 10:05:48 -0700 |
| Cc: | ths@networkno.de, vagabon.xyz@gmail.com, linux-mips@linux-mips.org, ralf@linux-mips.org |
| In-reply-to: | <20060728.233842.41629448.anemo@mba.ocn.ne.jp> |
| Original-recipient: | rfc822;linux-mips@linux-mips.org |
| References: | <20060727170305.GB4505@networkno.de> <cda58cb80607271151n2dcfe64cn4cb1ecca3ece6b1e@mail.gmail.com> <20060727191245.GD4505@networkno.de> <20060728.233842.41629448.anemo@mba.ocn.ne.jp> |
| Sender: | linux-mips-bounce@linux-mips.org |
| User-agent: | Mozilla Thunderbird 1.0.7-1.1.fc3 (X11/20050929) |
Atsushi Nemoto wrote: On Thu, 27 Jul 2006 20:12:45 +0100, Thiemo Seufer <ths@networkno.de> wrote:IOW, binary analysis can't be expected to provide full accuracy, but we can live with a reasonable approximation, I think.Yes, this is a starting point. The patch (and current mips get_wchan() implementation) tries to do is what I used to do to analyze stack dump by hand. 1. Determine PC and SP. 2. Disassemble a function containing the PC address. 3. If the function is leaf, make use RA for new PC. This was always the tricky part for me. How do you know if the function is a leaf? . . . David Daney |
| Previous by Date: | Re: [PATCH] Use compat code to translate siginfo_t for N32, Peter Watkins |
|---|---|
| Next by Date: | Re: [PATCH] dump_stack() based on prologue code analysis, Nigel Stephens |
| Previous by Thread: | Re: [PATCH] dump_stack() based on prologue code analysis, Atsushi Nemoto |
| Next by Thread: | Re: [PATCH] dump_stack() based on prologue code analysis, Nigel Stephens |
| Indexes: | [Date] [Thread] [Top] [All Lists] |