I saw the following example in the C standard draft (n1570):
$3.14 paragraph 4 : A structure declared as:
struct
{
char a;
int b:5, c:11, :0, d:8;
struct
{
int ee:8;
} e;
}
So, What does :0
mean?
I know what a bit-field is, but :0
is without a name, which I do not understand.
What is the purpose of :0
without any identifier?
First of all, let's see chapter §6.7.2.1, Structure and union specifiers, P11. It says,
An implementation may allocate any addressable storage unit large enough to hold a bitfield. If enough space remains, a bit-field that immediately follows another bit-field in a structure shall be packed into adjacent bits of the same unit. [...]
But, in case, we explicitly want two consecutive bit-field members, which "might be" packed into a single memory location to reside on separate memory location (i.e., addressable storage unit ), the above is the way to force it.
The next paragraph, P12, mentions,
A bit-field declaration with no declarator, but only a colon and a width, indicates an unnamed bit-field.126) As a special case, a bit-field structure member with a width of 0 indicates that no further bit-field is to be packed into the unit in which the previous bit-field, if any, was placed.
following your example, this makes sure that the two bit-field members surrounding the :0
will be residing in separate memory location (not inside a single addressable storage unit, even if sufficient memory remains to pack them into one). This has the similar effect of having a non-bit-field member in between two bit-fields, to force the separation of the memory location.
Quoting C11
, chapter §3.14, NOTE 2
(emphasis mine)
A bit-field and an adjacent non-bit-field member are in separate memory locations. The same applies to two bit-fields, if one is declared inside a nested structure declaration and the other is not, or if the two are separated by a zero-length bit-field declaration, or if they are separated by a non-bit-field member declaration.
Also, regarding the usage ("why it is needed" part)
[...] The bit-fields
b
andc
cannot be concurrently modified, butb
anda
, for example, can be.
Addendum:
Regarding the concurrency part, from NOTE 1
Two threads of execution can update and access separate memory locations without interfering with each other.
and, from chapter §5.1.2.4/P1,
Under a hosted implementation, a program can have more than one thread of execution (or thread) running concurrently. [...]
So, this is a theoretically viable option, as per the standard.