The algorithm for C initialization as described in the standard and implemented in gcc allow this.
struct X{
int a,b,c;
};
int main()
{
struct X x = {.a=1,2,3,.a=1, 2, 3};
}
https://godbolt.org/z/7naedbEM6
Basically, when a designed initializer is found the "cursor" goes to
that member and the following members are initialized in order.
On 2024-10-13, Thiago Adams <thiago.adams@gmail.com> wrote:
The algorithm for C initialization as described in the standard
and implemented in gcc allow this.
struct X{
int a,b,c;
};
int main()
{
struct X x = {.a=1,2,3,.a=1, 2, 3};
}
https://godbolt.org/z/7naedbEM6
Basically, when a designed initializer is found the "cursor" goes
to that member and the following members are initialized in
order.
I do not suspect that therw is an observable order. I.e. as
in a required order considered observable behavior.
int main() {Forgot to say that I didn't find this part on the standard.
struct X x = {.i = f(), .i = f() };
}
https://godbolt.org/z/rf984cGMM
There is a warning in this sample and f is called just once.
I think initialization is also very superficial on books.
| Sysop: | Keyop |
|---|---|
| Location: | Huddersfield, West Yorkshire, UK |
| Users: | 546 |
| Nodes: | 16 (2 / 14) |
| Uptime: | 148:29:12 |
| Calls: | 10,383 |
| Calls today: | 8 |
| Files: | 14,054 |
| D/L today: |
2 files (1,861K bytes) |
| Messages: | 6,417,747 |