Bit field structures in Embedded C - Step-by-Step Execution

Concept Flow - Bit field structures

Define struct with bit fields

↓

Declare variable of struct type

↓

Assign values to bit fields

↓

Store values in memory (packed bits)

↓

Access bit fields individually

↓

Use bit fields in logic or output

Bit field structures let you store small pieces of data in specific bits inside a struct, saving memory and allowing easy access.

Execution Sample

Embedded C

struct Flags {
  unsigned int a:1;
  unsigned int b:3;
  unsigned int c:4;
};

struct Flags f = {1, 5, 10};
printf("a=%u b=%u c=%u", f.a, f.b, f.c);

Defines a struct with 3 bit fields, assigns values, and prints each field.

Execution Table

Step	Action	Bit Field	Value Assigned	Memory Bits	Output
1	Define struct with bit fields	-	-	-	-
2	Declare variable f	-	-	00000000 (initial)	-
3	Assign f.a = 1	a (1 bit)	1	00000001	-
4	Assign f.b = 5	b (3 bits)	5 (binary 101)	0010101	-
5	Assign f.c = 10	c (4 bits)	10 (binary 1010)	10101011	-
6	Print values	-	-	-	a=1 b=5 c=10
7	End	-	-	-	Program ends

💡 All bit fields assigned and printed; program ends.

Variable Tracker

Variable	Start	After Step 3	After Step 4	After Step 5	Final
f.a	0	1	1	1	1
f.b	0	0	5	5	5
f.c	0	0	0	10	10
Memory bits	00000000	00000001	0010101	10101011	10101011

Key Moments - 3 Insights

Why does assigning 5 to f.b (3 bits) work even though 5 is larger than 3?

The 3 bits can hold values from 0 to 7 (2^3-1). Since 5 is within this range, it fits correctly as shown in step 4 of the execution_table.

What happens if we assign a value larger than the bit field can hold?

Values larger than the bit field size get truncated to fit the bits. For example, if f.b had 3 bits and we assigned 10, only the lowest 3 bits (010) would be stored, causing unexpected values.

How are multiple bit fields packed in memory?

Bit fields are packed next to each other in the order declared, filling bits from least significant to more significant as shown in the Memory bits column in the execution_table.

Visual Quiz - 3 Questions

Look at the execution_table at step 4. What is the binary value stored in memory after assigning f.b = 5?

A 00000101

B 00001011

C 00000001

D 10101001

💡 Hint

Check the Memory Bits column at step 4 in the execution_table.

At which step does the bit field f.c get its value assigned?

A Step 5

B Step 4

C Step 3

D Step 6

💡 Hint

Look at the Action and Bit Field columns in the execution_table.

If we assign f.a = 2, what will happen to the stored value?

A It stores 2 correctly in 1 bit

B It stores 1 because 2 is truncated to 1 bit

C It stores 0 because 2 is truncated to 1 bit

D It causes a compile error

💡 Hint

Recall that 1 bit can only store 0 or 1; values are truncated to fit as explained in key_moments.

Concept Snapshot

Bit field structures let you store small integers in specific bits inside a struct.
Syntax: unsigned int name : number_of_bits;
Values assigned fit in the bits or get truncated.
Bit fields are packed in memory in declaration order.
Access each bit field like a normal struct member.
Useful for saving memory in embedded systems.

Full Transcript

This visual execution trace shows how bit field structures work in embedded C. First, a struct with three bit fields is defined: a with 1 bit, b with 3 bits, and c with 4 bits. Then a variable f of this struct type is declared and initialized with values 1, 5, and 10 respectively. Each assignment updates the memory bits accordingly, packing the bits next to each other. The output prints the values stored in each bit field. Key moments explain how values fit or truncate in bit fields and how bits are packed. The quizzes test understanding of memory representation and bit truncation. This helps beginners see how bit fields store data efficiently and how to use them safely.