An array of the primitive data-types, with their associated offsets, is constructed. If the given data-type is already primitive it is put in the array by itself. Otherwise if it is composite, its components are recursively added to the array. Boolean properties about the primitives encountered are recorded: - Are any of the primitives \b undefined - Are all the primitives properly aligned. If a
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected