https://gcc.gnu.org/bugzilla/show_bug.cgi?id=124285
--- Comment #7 from GCC Commits <cvs-commit at gcc dot gnu.org> --- The releases/gcc-13 branch has been updated by Eric Botcazou <[email protected]>: https://gcc.gnu.org/g:2ea66c62d4dcab1521299812ab8f9777693fd9bc commit r13-10107-g2ea66c62d4dcab1521299812ab8f9777693fd9bc Author: Eric Botcazou <[email protected]> Date: Sat Feb 28 19:48:23 2026 +0100 Ada: Fix infinite recursion on unchecked union with representation clause This is a regression present on all active branches: the compiler enters an infinite recursion when it is generating the initialization procedure of an unchecked union type with a representation clause, because the layout it has done for it is problematic. This comes from an old kludge added to support aggregates for such types, so the fix is to further tweak this kludge. gcc/ada/ PR ada/124285 * gcc-interface/decl.cc (components_to_record): Force a packed layout for the innermost variant of an unchecked union type with fixed part and full representation clause. gcc/testsuite/ * gnat.dg/specs/unchecked_union3.ads: New test.
