The way this code was supposed to work was that it would scan the compiler-
generated type and all its descendants, record each generated type it found,
then fill in information for all of the found types. The way it actually
worked was that it would scan the descendants, record each generated type, then
try to fill in information *for all generated types found in the program*. This
is quadratic as you start adding types, as you rescan everything you've added
before. The fix is to record just the types from the current pass, and then
add them to the larger bag when everything's complete.

Recurisve generics with interface marking annotation used to cause stackoverflow in the linker.
The test now passes since the problem was fixed in #3073

…209.3 (#3159)

[main] Update dependencies from dotnet/arcade

Co-authored-by: dotnet-maestro[bot] <dotnet-maestro[bot]@users.noreply.github.com>

…223.1 (#3169)

[main] Update dependencies from dotnet/arcade

…230.1 (#3170)

[main] Update dependencies from dotnet/arcade

This was prompted by #3158
So I just added several tests for various shapes of type deconstructions. To make it symmetric I also added tests for what I call type construction (tuples, anonymous types, records).

LdToken acts basically as a reflection access and so it needs to warn about the returned member if that has annotations on it.

This reverts commit 19c7f53.

First encountered in dotnet/runtime#80235, so copying the change to dotnet/linker

To pick up RVA field fix