Since C++11 std::complex<T>[n]
is guaranteed to be aliasable as T[n*2]
, with well defined values. Which is exactly what one would expect for any mainstream architecture. Is this guarantee achievable with standard C++ for my own types, say struct vec3 { float x, y, z; }
or is it only possible with special support from the compiler?
TL;DR: The compiler must inspect reinterpret_cast
s and figure out that (standard library) specializations of std::complex
are involved. We cannot conformably mimic the semantics.
I think it's fairly clear that treating three distinct members as array elements is not going to work, since pointer arithmetic on pointers to them is extremely restricted (e.g. adding 1 yields a pointer past-the-end).
So let's assume vec3
contained an array of three int
s instead.
Even then, the underlying reinterpret_cast<int*>(&v)
you implicitly need (where v
is a vec3
) does not leave you with a pointer to the first element. See the exhaustive requirements on pointer-interconvertibility:
Two objects
a
andb
are pointer-interconvertible if:
they are the same object, or
one is a standard-layout union object and the other is a non-static data member of that object ([class.union]), or
one is a standard-layout class object and the other is the first non-static data member of that object, or, if the object has no non-static data members, the first base class subobject of that object ([class.mem]), or
there exists an object
c
such thata
andc
are pointer-interconvertible, andc
andb
are pointer-interconvertible.If two objects are pointer-interconvertible, then they have the same address, and it is possible to obtain a pointer to one from a pointer to the other via a
reinterpret_cast
. [ Note: An array object and its first element are not pointer-interconvertible, even though they have the same address. — end note ]
That's quite unequivocal; while we can get a pointer to the array (being the first member), and while pointer-interconvertibility is transitive, we cannot obtain a pointer to its first element.
And finally, even if you managed to obtain a pointer to the first element of your member array, if you had an array of vec3
s, you cannot traverse all the member arrays using simple pointer increments, since we get pointers past-the-end of the arrays in between. launder doesn't solve this problem either, because the objects that the pointers are associated with don't share any storage (cf [ptr.launder] for specifics).
It's only possible with special support from the compiler, mostly.
Unions don't get you there because the common approach actually has undefined behaviour, although there are exceptions for layout-compatible initial sequences, and you may inspect an object through an unsigned char*
as a special case. That's it, though.
Interestingly, unless we assume a broad and useless meaning of "below", the standard is technically contradictory in this regard:
[C++14: 5.2.10/1]:
[..] Conversions that can be performed explicitly using reinterpret_cast are listed below. No other conversion can be performed explicitly using reinterpret_cast.
The case for complex<T>
is then not mentioned. Finally the rule you're referring to is introduced much, much later, in [C++14: 26.4/4]
.
I think it would work for a single vec3
if your type contained float x[3]
instead, and you ensure sizeof(vec3) == 3*sizeof(float) && is_standard_layout_v<vec3>
. Given those conditions, the standard guarantees that the first member is at zero offset so the address of the first float
is the address of the object, and you can perform array arithmetic to get the other elements in the array:
struct vec3 { float x[3]; } v = { };
float* x = reinterpret_cast<float*>(&v); // points to first float
assert(x == v.x);
assert(&x[0] == &v.x[0]);
assert(&x[1] == &v.x[1]);
assert(&x[2] == &v.x[2]);
What you can't do is treat an array of vec3
as an array of floats three times the length. Array arithmetic on the array inside each vec3
won't allow you to access the array inside the next vec3
. CWG 2182 is relevant here.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With