I believe I've found a way to achieve something like the well-known "struct hack" in portable C89. I'm curious if this really strictly conforms to C89.
The main idea is: I allocate memory large enough to hold an initial struct and the elements of the array. The exact size is (K + N) * sizeof(array_base_type)
, where K
is chosen so that K * sizeof(array_base_type) >= sizeof(the_struct)
and N
is the number of array elements.
First, I dereference the pointer that malloc()
returned to store the_struct
, then I use pointer arithmetic to obtain a pointer to the beginning of the array following the struct.
One line of code is worth more than a thousand words, so here is a minimal implementation:
typedef struct Header {
size_t length;
/* other members follow */
} Header;
typedef struct Value {
int type;
union {
int intval;
double fltval;
} v;
} Value;
/* round up to nearest multiple of sizeof(Value) so that a Header struct fits in */
size_t n_hdr = (sizeof(Header) + sizeof(Value) - 1) / sizeof(Value);
size_t n_arr = 42; /* arbitrary array size here */
void *frame = malloc((n_hdr + n_arr) * sizeof(Value));
if (!frame)
return NULL;
Header *hdr = frame;
Value *stack_bottom = (Value *)frame + n_hdr;
My main concern is that the last two assignments (using frame
as both a pointer to Header and a pointer to Value) may violate the strict aliasing rule. I do not, however, dereference hdr
as a pointer to Value - it's only pointer arithmetic that is performed on frame
in order to access the first element of the value array, so I don't effectively access the same object using pointers of different types.
So, is this approach any better than the classic struct hack (which has been officially deemed UB), or is it UB too?
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…