On Mon, Jul 27, 2026 at 09:01:32AM +0200, Jakub Jelinek wrote:
> Added to testsuite (also the other testcases from the thread).
> I think if we really wanted this lookup caching, either we'd need to create
> a vector, store the cached lookup results in there and pass it around
> to recursive calls, or we could create a vector, store there the original
> values, change the *->index to the lookup results and ensure (through RAII,
> we have way too many returns) to revert this back afterwards.
Actually, for the RAII cleanup, we could just remember the start (i.e.
d->cur from some point) and count how many need to be restored, the
old ones should be always IDENTIFIER_NODE and new ones FIELD_DECLs from
their lookup, so the cleanup could be just store there DECL_NAME of
the FIELD_DECLs.
Jakub
