Compiler storage strategy for mutable discriminated types

Hello:

I am reading Barnes’s book and after reading the part on discriminants I have come to wonder how does the compiler approach the storage of unconstrained types with default constraints (hence mutable). I understand how if they are constrained on declaration they can be stored easily, since then the storage is known. However, in the case of being unconstrained, the only way I can think of is having it dynamically allocated or otherwise reserving the maximum space possible in the stack given the discriminant, which could be very large such as in the following example.

type Maybe_Big_Record (N : Integer) is
   record
      My_Name : String (1 .. N);
   end record;

Best regards.
zen