This is the mail archive of the
gdb-patches@sourceware.org
mailing list for the GDB project.
Re: [PATCH] Fix wrong assertions
- From: Jan Kratochvil <jan dot kratochvil at redhat dot com>
- To: Yao Qi <qiyaoltc at gmail dot com>
- Cc: Andreas Schwab <schwab at linux-m68k dot org>, gdb-patches at sourceware dot org
- Date: Fri, 29 May 2015 16:10:27 +0200
- Subject: Re: [PATCH] Fix wrong assertions
- Authentication-results: sourceware.org; auth=none
- References: <87vbg1eg08 dot fsf at igel dot home> <20150513140106 dot GB3023 at host1 dot jankratochvil dot net> <86bnh3pw61 dot fsf at gmail dot com> <20150529113101 dot GA15460 at host1 dot jankratochvil dot net> <86382fpki0 dot fsf at gmail dot com>
On Fri, 29 May 2015 15:43:19 +0200, Yao Qi wrote:
> Jan Kratochvil <jan.kratochvil@redhat.com> writes:
> > The terminology seems bogus there.
> >
> > "partially ambiguous" was meant the chain:
> > main -> a -> <???> -> d
> > An intersection of all possible chains.
>
> Sounds like "partially ambiguous" is equivalent to "ambiguous".
Yes, probably, I am not sure how to call it all myself.
> If that is right, the assert below is too strict, isn't?
Yes, it is too strict, this is why I agree with the fix by Andreas.
> /* See call_site_find_chain_1 why there is no way to reach the bottom callee
> PC again. In such case there must be two different code paths to reach
> it, therefore some of the former determined intermediate PCs must differ
> and the unambiguous chain gets shortened. */
> gdb_assert (result->callers + result->callees < result->length);
>
> > but that doe snot matter). Consequently its elements from the middle are
> > being removed and there remains only some few unambiguous top and
> > bottom ones.
>
> If there is no call sites removed from the chain during the intersection,
> CALLERS + CALLEES == LENGTH, right?
Just I expected there always has to be some site removed from the chain.
I do not find obvious it does not have to. But maybe someone else finds it
obvious.
> in function chain_candidate,
> result->length is set by the length of a chain. If this chain is the
> shortest one, CALLERS + CALLEES == LENGTH otherwise,
> CALLERS + CALLEES < LENGTH. Is it right?
It is right now. But when one does not think about self-tail-calls then even
the shortest one will get one frame removed.
> If so, we need to relax the
> condition in the assert and update the comments.
Yes, attached with updated comment.
> > I did not realize that there can be self-tail-call:
> > main(0x100) -> a(0x200) -> d(0x400)
> > main(0x100) -> a(0x280) -> a(0x200) -> d(0x400)
> > which intersects to:
> > main(0x100) -> <???>? -> a(0x200) -> d(0x400)
> > And so if the first chain was chosen the
> > main(0x100) -> a(0x200) -> d(0x400)
> > then the final intersection has callers+callees==length.
>
> What are the definitions of CALLERS, CALLEES, top and bottom? given this example?
top=CALLERS=main(0x100), therefore 1
bottom=CALLEES=d(0x400), therefore 1
top = topmost, where you can go by GDB "up" commands, also called "prev" in
struct frame_info.
bottom = bottommost, where you can go by GDB "down" commands, also called
"next" in struct frame_info.
Jan
2015-05-29 Andreas Schwab <schwab@linux-m68k.org>
Jan Kratochvil <jan.kratochvil@redhat.com>
PR symtab/18392
* dwarf2-frame-tailcall.c (pretended_chain_levels): Correct
assertion.
* dwarf2loc.c (chain_candidate): Likewise.
diff --git a/gdb/dwarf2-frame-tailcall.c b/gdb/dwarf2-frame-tailcall.c
index b412a5b..f964ab2 100644
--- a/gdb/dwarf2-frame-tailcall.c
+++ b/gdb/dwarf2-frame-tailcall.c
@@ -197,7 +197,7 @@ pretended_chain_levels (struct call_site_chain *chain)
return chain->length;
chain_levels = chain->callers + chain->callees;
- gdb_assert (chain_levels < chain->length);
+ gdb_assert (chain_levels <= chain->length);
return chain_levels;
}
diff --git a/gdb/dwarf2loc.c b/gdb/dwarf2loc.c
index 3aa8ddd..68d6cb4 100644
--- a/gdb/dwarf2loc.c
+++ b/gdb/dwarf2loc.c
@@ -825,9 +825,9 @@ chain_candidate (struct gdbarch *gdbarch, struct call_site_chain **resultp,
/* See call_site_find_chain_1 why there is no way to reach the bottom callee
PC again. In such case there must be two different code paths to reach
- it, therefore some of the former determined intermediate PCs must differ
- and the unambiguous chain gets shortened. */
- gdb_assert (result->callers + result->callees < result->length);
+ it. Still it may CALLERS+CALLEES==LENGTH in the case of optional
+ tail-call calling itself. */
+ gdb_assert (result->callers + result->callees <= result->length);
}
/* Create and return call_site_chain for CALLER_PC and CALLEE_PC. All the