tree e9687bcbbce6e91db66881fb9c8d0e1adf7f94ea
parent 3c38be4dc8f9e159fda558b42ed26af1fb322b63
author Nathan Sidwell <nathan@acm.org> 1643142661 -0800
committer Copybara-Service <copybara-worker@google.com> 1645014941 -0800

[demangler] Reorder parseNestedName loop

parseNestedName's main loop allowed parsing a grammar that was more
flexible than the actual grammar.  This refactors that to rule out
some more incorrect manglings.

1) The 'L' extension only applies to unqualified-name components, so
check it just there.

2) The 'M' suffix is, AFAICT, removed from the grammar.  Rather than
eliminate it, let's parse it after we've parsed a component.

Added some additional bad mangling tests, which are now rejected.

I don't break the 'T' and 'D[tT]' cases out of the loop, even though
they can only appear at first position, as it seems simpler to just
check there is nothing SoFar.

Reviewed By: ChuanqiXu

Differential Revision: https://reviews.llvm.org/D119542

GitOrigin-RevId: 6244730e29f66ae3d0ba80c2341f9f17c7eb78d3