C Struct Padding — 3-Byte Pad Corrupted 50% Packets

Every real-world program deals with grouped data. A game needs to track a player's name, health, score, and position together. A network driver needs to interpret the same 4 bytes as either an IPv4 address, a 32-bit integer, or four individual octets depending on context. Trying to manage all of that with loose individual variables is like trying to run a hospital with sticky notes instead of patient records — technically possible, catastrophically unmanageable. Structures and unions are C's answer to that chaos.

The problem they solve is fundamentally about organisation and memory semantics. A struct gives you a custom data type that bundles related variables under one name, each with its own guaranteed memory slot. A union takes that idea and flips the memory model — all members share the same block of memory, which means you get type-reinterpretation and memory efficiency at the cost of only being able to use one member at a time. These aren't just syntax features; they're tools that let you model the real world accurately in code.

By the end of this article you'll understand exactly how struct and union memory layouts work, when each is the right tool, how to combine them for practical patterns like tagged unions, and the exact mistakes that trip up even experienced C developers. You'll also be able to confidently answer the interview questions that separate candidates who've read about C from those who've actually used it.

How C Struct Padding Corrupts Your Data

C structs are composite data types that group related variables under one name. The core mechanic is that the compiler may insert unused bytes between members to satisfy alignment requirements of the target architecture. This padding ensures each member starts at an address that is a multiple of its size (e.g., a 4-byte int must start at an address divisible by 4). The result is that the in-memory layout of a struct is not simply the sum of its members' sizes — it can be larger, and the offsets are compiler- and platform-dependent.

When you define a struct with members of different sizes (e.g., char, int, short), the compiler aligns each member to its natural boundary. For example, a struct with a char followed by an int will have 3 bytes of padding after the char so the int starts at a 4-byte boundary. The total size becomes 8 bytes instead of 5. This padding is invisible in source code but critical when serializing structs to a buffer, sending over a network, or writing to a file. If you memcpy the struct directly, you copy the padding bytes — which may contain garbage or stale data.

Use struct padding consciously when you need to control memory layout for hardware registers, network protocols, or binary file formats. The __attribute__((packed)) directive (GCC) or #pragma pack(1) (MSVC) eliminates padding, but at the cost of potential misaligned access penalties on some architectures. In real systems, ignoring padding leads to buffer overruns, checksum mismatches, and corrupted packets — especially when crossing language boundaries (e.g., C struct sent to Java via JNI).

Structs: Grouping Related Data With Dedicated Memory

A struct (short for structure) lets you define a composite data type — a single named container that holds multiple members, each with its own type. The compiler allocates memory for every member independently, so all fields exist simultaneously and can be read or written in any order.

The real power isn't just convenience — it's that a struct becomes a first-class type. You can pass it to functions, return it, put it in arrays, and point to it. This lets you model domain concepts directly. A 'Player' struct isn't just three variables that happen to be related; it's a single coherent entity your code can reason about.

Under the hood, struct members are laid out sequentially in memory, but the compiler is allowed to insert padding bytes between members to satisfy alignment requirements of the target CPU. This means sizeof(struct Player) might be larger than you expect, and it's the first thing you need to internalise before you do anything serious with structs in systems programming or binary file I/O.

Use structs whenever you have data that naturally belongs together and needs all its fields present at the same time — think database records, configuration objects, game entities, or network packet headers.

#include <stdio.h>
#include <string.h>

/**
 * io.thecodeforge demonstration: Professional Struct Usage
 */
typedef struct {
    char  username[32];  
    int   health;        
    float position_x;   
    float position_y;   
    int   score;         
} Player;

void print_player_status(Player p) {
    printf("--- Player Status ---\n");
    printf("Username : %s\n",  p.username);
    printf("Health   : %d\n",  p.health);
    printf("Position : (%.1f, %.1f)\n", p.position_x, p.position_y);
    printf("Score    : %d\n",  p.score);
}

void apply_damage(Player *p, int damage_amount) {
    if (p == NULL) return;
    p->health -= damage_amount;
    if (p->health < 0) p->health = 0;
}

int main(void) {
    Player hero = {
        .username   = "Aria_Stormblade",
        .health     = 100,
        .position_x = 12.5f,
        .position_y = 7.0f,
        .score      = 0
    };

    apply_damage(&hero, 35);
    hero.score += 500;
    print_player_status(hero);

    printf("\nTotal struct footprint: %zu bytes\n", sizeof(Player));
    return 0;
}

Nested Structures: Structs Within Structs

Real-world data is rarely flat. A Person doesn't just have a name and age — they have an address, which itself has street, city, and zip code. C lets you model this naturally by placing one struct inside another as a member. This is called nesting, and it's how you build hierarchical data models without losing type safety.

When you nest a struct, the inner struct's fields are laid out as a contiguous block inside the outer struct, subject to alignment rules. The total size of the outer struct includes the full size of the inner struct, plus any padding needed after it. Accessing a nested member requires multiple dot operators: person.address.zip. You can also use designated initializers with nested structs: .address.city = "Boston" — but each nested level must be initialized in a separate brace-enclosed block or with the dot notation.

Nested structs appear everywhere: database records with sub-objects, network packet headers with inner protocol fields, and configuration trees. They are also the foundation of the tagged union pattern when combined with unions.

One common pitfall is assuming the inner struct's fields are laid out continuously from the start of the outer struct. They are not — the compiler may skip padding after the previous member before placing the inner struct, depending on alignment. Always check sizeof and offsets if you rely on binary layout.

#include <stdio.h>
#include <stddef.h>

typedef struct {
    char street[64];
    char city[32];
    int  zip;
} Address;

typedef struct {
    char    name[50];
    int     age;
    Address addr;   // nested struct
} Person;

int main(void) {
    Person p = {
        .name = "Alice",
        .age  = 30,
        .addr.street = "123 Oak St",
        .addr.city   = "Springfield",
        .addr.zip    = 12345
    };

    printf("Name: %s\n", p.name);
    printf("Address: %s, %s %d\n", p.addr.street, p.addr.city, p.addr.zip);

    printf("sizeof(Person)   = %zu\n", sizeof(Person));
    printf("offset of addr   = %zu\n", offsetof(Person, addr));
    printf("offset of zip    = %zu\n", offsetof(Person, addr.zip));
    return 0;
}

Pointer to Structure and the Arrow Operator

When you work with large structs in production C, you almost never pass them by value. Copying a 100-byte struct on the stack is expensive and unnecessary. Instead, you pass a pointer to the struct — typically a 4 or 8-byte value — and access members through that pointer. This is where the arrow operator -> comes in.

The arrow operator is syntactic sugar. ptr->member is exactly equivalent to (ptr).member. But it's not just about saving two keystrokes — it makes pointer semantics explicit and reduces the chance of precedence errors (. binds tighter than , so *ptr.member would dereference the wrong thing).

Using pointers to structs is essential for dynamic allocation (malloc(sizeof(MyStruct))), linked lists, trees, and any function that needs to modify the original struct. When you pass a struct by value, the function works on a copy — modifications are lost. When you pass by pointer with ->, the function can mutate the original.

Always check for NULL before dereferencing a struct pointer. A null pointer dereference crashes instantly. Use if (p != NULL) { p->field; } religiously.

One advanced pattern: you can have pointers to nested struct members. For example, Address *a = &person.addr; then a->zip = 90210; modifies the original. This is how you build flexible hierarchical APIs.

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct {
    char name[32];
    int  level;
    int  health;
} Character;

// Modifies the original struct via pointer
void take_damage(Character *c, int dmg) {\n    if (c != NULL) {\n        c->health -= dmg;\n        if (c->health < 0) c->health = 0;\n    }
}

Character* create_character(const char *name, int level) {\n    Character *c = malloc(sizeof(Character));\n    if (c != NULL) {\n        strncpy(c->name, name, sizeof(c->name) - 1);\n        c->name[sizeof(c->name) - 1] = '\\\0';\n        c->level  = level;\n        c->health = 100;\n    }
    return c;
}

int main(void) {
    Character *hero = create_character("Thorn", 5);
    if (hero == NULL) return 1;

    printf("Before: %s has %d health\n", hero->name, hero->health);
    take_damage(hero, 40);
    printf("After:  %s has %d health\n", hero->name, hero->health);

    // Access nested? not nested but pointer to struct member is common
    int *health_ptr = &hero->health;
    *health_ptr = 200;
    printf("After pointer set: %d\n", hero->health);

    free(hero);
    return 0;
}

Memory Layout and Padding — Why sizeof Surprises You

This is the section most tutorials skip, and it's the one that causes the most real-world bugs. CPUs are picky about alignment — a 4-byte int wants to live at a memory address that's divisible by 4. A double wants an address divisible by 8. When the compiler lays out struct members sequentially, it inserts invisible padding bytes to honour these constraints.

Consider a struct with a char (1 byte) followed by an int (4 bytes). The char sits at offset 0, but the int needs to start at offset 4 — so 3 bytes of padding are inserted silently. The struct's total size also gets padded at the end so that arrays of the struct keep every element aligned.

This matters enormously in three situations: serialising structs to binary files or network packets (padding bytes contain garbage), computing offsets manually, and squeezing memory in embedded systems. The fix in the first two cases is either reordering your members largest-to-smallest (which often eliminates padding naturally) or using __attribute__((packed)) / #pragma pack — but only when you truly need it, because unaligned access is slower on most architectures and outright illegal on some.

#include <stdio.h>
#include <stddef.h> 

typedef struct {
    char   is_active;    // 1 byte
    // 3 bytes padding
    int    user_id;      // 4 bytes
    char   grade;        // 1 byte
    // 7 bytes padding
    double score;        // 8 bytes
} StudentUnoptimised;    // 24 bytes total

typedef struct {
    double score;        // 8 bytes
    int    user_id;      // 4 bytes
    char   is_active;    // 1 byte
    char   grade;        // 1 byte
    // 2 bytes padding at end
} StudentOptimised;      // 16 bytes total

int main(void) {
    printf("Unoptimised size: %zu bytes\n", sizeof(StudentUnoptimised));
    printf("Optimised size:   %zu bytes\n", sizeof(StudentOptimised));
    printf("Memory saved:     %zu bytes per instance\n", 
           sizeof(StudentUnoptimised) - sizeof(StudentOptimised));
    return 0;
}

Unions: One Memory Location, Many Interpretations

A union looks syntactically identical to a struct but operates on a completely different principle: all members share the same starting address and the same block of memory. The union's size equals the size of its largest member. Writing to one member and reading from a different one reinterprets the raw bytes — which is either a powerful tool or a disaster, depending on whether you do it intentionally.

The classic legitimate use cases are: type-punning (reinterpreting the raw bytes of a float as a uint32_t, for example), memory-mapped hardware registers where the same address has different meanings, and building tagged unions (also called discriminated unions) where a type tag tells you which member is currently valid.

The illegitimate use — writing member A and reading member B expecting a meaningful 'conversion' — is undefined behaviour in C for most type combinations. The exception is char/unsigned char, which you're always allowed to use to inspect raw bytes.

#include <stdio.h>
#include <stdint.h>

typedef union {
    uint32_t as_integer;
    uint8_t  octets[4];
} IPv4Address;

typedef enum { TEMP, PRESS, HUMID } SensorType;

typedef struct {\n    SensorType type;\n    union {\n        float   celsius;\n        float   hpa;\n        uint8_t percent;\n    } reading;
} SensorReading;

int main(void) {
    IPv4Address addr;
    addr.as_integer = 0xC0A80101; // 192.168.1.1

    printf("IP: %u.%u.%u.%u\n", addr.octets[3], addr.octets[2], addr.octets[1], addr.octets[0]);
    
    SensorReading s = { .type = TEMP, .reading.celsius = 25.5f };
    printf("Reading: %.1f C\n", s.reading.celsius);
    
    return 0;
}

Combining Structs and Unions — Building Real Data Structures

In production C code, structs and unions almost always appear together. A pure union with no tag is hard to use safely. A struct with no unions is sometimes wasteful. Combine them and you get expressive, memory-efficient data models.

A common real-world pattern is a variant record — a struct that represents one of several possible entity types, where the correct interpretation depends on a discriminator field. This pattern powers everything from protocol buffer implementations to expression trees in compilers.

Another key pattern is bit fields inside structs, which let you pack boolean flags and small integers into individual bits rather than full bytes. This is critical in embedded systems where a microcontroller might have only 2KB of RAM.

#include <stdio.h>
#include <stdlib.h>

typedef enum { NODE_NUM, NODE_OP } NodeType;

typedef struct ExprNode ExprNode;
struct ExprNode {\n    NodeType type;\n    union {\n        int val;\n        struct {\n            char op;\n            ExprNode *left;\n            ExprNode *right;\n        } bin;
    } data;
};

ExprNode* make_num(int n) {
    ExprNode *node = malloc(sizeof(ExprNode));
    node->type = NODE_NUM; node->data.val = n;
    return node;
}

int eval(ExprNode *n) {
    if (n->type == NODE_NUM) return n->data.val;
    int l = eval(n->data.bin.left), r = eval(n->data.bin.right);
    return (n->data.bin.op == '+') ? l + r : l * r;
}

int main(void) {
    // (2 + 3) * 4
    ExprNode *add = malloc(sizeof(ExprNode));
    add->type = NODE_OP; add->data.bin.op = '+';
    add->data.bin.left = make_num(2); add->data.bin.right = make_num(3);

    ExprNode *root = malloc(sizeof(ExprNode));
    root->type = NODE_OP; root->data.bin.op = '*';
    root->data.bin.left = add; root->data.bin.right = make_num(4);

    printf("Result: %d\n", eval(root));
    return 0;
}

Bit Fields and Packed Structs: Fine-Grained Control of Memory Layout

Bit fields let you specify the exact number of bits each member occupies. They're invaluable for hardware register maps, protocol flags, and any scenario where every byte counts. The syntax unsigned int flag : 1; declares a 1-bit field. Multiple bit fields can be packed into the same underlying storage unit.

However, bit fields are highly implementation-defined. The compiler decides whether fields are allocated from left to right or right to left, whether they span storage unit boundaries, and whether int bit fields are signed or unsigned. This makes them non-portable across compilers and even across compiler versions.

Packed structs (__attribute__((packed)) or #pragma pack(1)) force the compiler to remove all padding. They guarantee byte-exact layout, which is essential for wire protocols and binary file formats. The cost: every member access becomes an unaligned memory access. On x86 this is slow; on ARM prior to v6 it crashes. Always benchmark before deploying packed structs in hot paths.

#include <stdio.h>
#include <stdint.h>

// Hardware register flags — exact bit layout required
typedef struct {
    unsigned int enable  : 1;
    unsigned int mode    : 3;  // 0-7
    unsigned int status  : 4;  // 0-15
    // total 8 bits, but compiler may pad to 16 or 32
} __attribute__((packed)) ControlReg;

// Packed struct for a 4-byte IP header fragment field
typedef struct {
    uint16_t offset : 13;   // fragment offset
    uint16_t more   : 1;    // more fragments flag
    uint16_t dont   : 1;    // don't fragment flag
    uint16_t resv   : 1;    // reserved (zero)
} __attribute__((packed)) FragmentField;

int main(void) {
    printf("sizeof(ControlReg): %zu (expected 1 if packed)\n", sizeof(ControlReg));
    ControlReg reg = { .enable = 1, .mode = 5, .status = 12 };
    printf("Control: enable=%u, mode=%u, status=%u\n", reg.enable, reg.mode, reg.status);

    FragmentField frag = { .offset = 1234, .more = 1, .dont = 0, .resv = 0 };
    uint16_t raw;
    // memcpy to avoid strict-aliasing violation
    __builtin_memcpy(&raw, &frag, sizeof(raw));
    printf("Raw fragment word: 0x%04x\n", raw);
    return 0;
}

Creating a Union: One Memory Slot, Many Hats

You define a union like a struct, but every member shares the same memory address. The compiler sizes the union to the largest member. That's it. No separate slots. This isn't a bug — it's a deliberate tool for memory multiplexing.

When you write to one union member, you overwrite all others. There's no magic safety net. The last write wins. This is brilliant for protocol buffers, variant types, or register maps where you need to reinterpret the same bytes differently at different times.

Here's the production grade pattern: wrap the union in a struct with a discriminator field. That enum tells you which member is currently valid. Without that tag, you're gambling on runtime state. Don't gamble.

Declare with union Tag { ... };. Access with dot operator. Pay attention to alignment — unions don't escape padding rules.

// io.thecodeforge — c-cpp tutorial

#include <cstdint>
#include <cstdio>

union SensorReading {
    uint32_t raw;
    float    voltage;
    struct {
        uint16_t adc_value;
        uint8_t  channel;
        uint8_t  flags;
    } fields;
};

int main() {
    SensorReading reading;
    reading.raw = 0x41A00000;  // bit pattern for 20.0f
    printf("As float: %.1f\n", reading.voltage);
    reading.fields.adc_value = 1023;
    reading.fields.channel = 3;
    reading.fields.flags = 0x01;
    printf("After field write, voltage: %.1f\n", reading.voltage);
    // output shows corruption - last write wins
    return 0;
}

Enumeration: Named Constants That Don't Suck

Enums are integer constants with names. They replace magic numbers with something a human can read six months later. In C++, enum class gives you type safety — no implicit conversion to int, no accidental pollution of the enclosing namespace.

Plain enum leaks into the parent scope. That means enum Color { RED, GREEN, BLUE }; puts RED at file scope. Two enums can't share a name without colliding. enum class fixes that: enum class Color { RED, GREEN, BLUE }; requires Color::RED to access.

Use enums for state machines, error codes, configuration flags. They compile down to integers — zero runtime cost. But watch the underlying type. By default it's int. For embedded work or packed structures, specify the type: enum class Flag : uint8_t { ... };.

Don't use enums for bitmask combinations. That's what constexpr or using with bitwise operators is for. Enums are for mutually exclusive choices.

// io.thecodeforge — c-cpp tutorial

#include <cstdio>

enum class ConnectionState : uint8_t {
    DISCONNECTED,
    CONNECTING,
    CONNECTED,
    ERROR
};

const char* state_name(ConnectionState s) {
    switch (s) {
        case ConnectionState::DISCONNECTED: return "DISCONNECTED";
        case ConnectionState::CONNECTING:   return "CONNECTING";
        case ConnectionState::CONNECTED:    return "CONNECTED";
        case ConnectionState::ERROR:        return "ERROR";
    }
    return "UNKNOWN";
}

int main() {
    ConnectionState current = ConnectionState::CONNECTING;
    printf("State: %s (underlying value: %d)\n", 
           state_name(current), static_cast<int>(current));
    return 0;
}