This is the mail archive of the mailing list for the GDB project.

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]

Re: RFC: partial symbol table address range generalization

On Thu, Nov 01, 2001 at 05:29:53PM -0500, Jim Blandy wrote:
> I've been using words badly.
> A heuristic is some computational process which is expected to yield
> correct answers most of the time, but not always.  Heuristics need to
> be used with code that can check their answers, or in contexts where
> inaccuracy is tolerable.
> Daniel's suggested change isn't a heuristic; I agree that, if you
> can't find a function containing the PC, it's almost certainly
> pointless to look for line number info for that PC.
> What irks me is that Daniel's change is a sanity check for the
> procedure of searching through psymtabs' address ranges.  In other
> words, the necessity of the change suggests that searching psymtabs'
> address ranges is the heuristic here.  I really hate that.  Those
> ranges really ought to be accurate.
> But the fact is, they're not accurate, and it'll take a lot of work to
> make them so.  Checking that a PC falls in a psymtab's address range
> is, indeed, only a heuristic.

Yeah.  See my other message last night about stabs for deleted
sections; then they're *really* inaccurate, and I can't for the life of
me figure out what to do about it.

> So I'm going to commit Peter Schauer's change, as Daniel suggested.


Daniel Jacobowitz                           Carnegie Mellon University
MontaVista Software                         Debian GNU/Linux Developer

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]