YOUR C LEARNING COMPANION

Kahan se padhein?

Learning path
Data ka designChapter 35 of 73

Padding, alignment aur layout

Logical fields aur representation alag rakhein; portable sizes ya bit patterns guess kiye bina layout query karein.

5 min readCore conceptsC17 baseline
Offline reading
Is chapter mein8 sections

Structure members ka order defined hai, lekin unke sizes ka sum hamesha structure size nahi hota. Implementation padding add kar sakti hai aur alignment require kar sakti hai. Object access aur external format design mein yeh rules important hain.

1. Member order aur possible gaps

Ordinary non-bit-field structure members mein later members declaration order ke according increasing addresses par hote hain. First member se pehle padding nahi hoti, lekin members ke beech ya end mein padding ho sakti hai. Tail padding structure arrays ke har element ki relevant alignment requirements satisfy karne mein help karti hai.

Possible layout pattern
first member
char mark
possible gap
padding
next member
int count
possible tail
padding
Sirf illustrative order: boxes measured bytes nahi aur har implementation mein gap required nahi.

Members reorder karne se padding aur exposed interface ka layout change ho sakta hai. Largest member first rakhna hamesha minimum size deta hai, aisa universal rule nahi. Members ki alignment requirements bhi hoti hain aur different implementations different permitted layouts choose kar sakti hain. Layout matter kare toh target implementation measure karein.

2. Size, offset aur alignment implementation se puchhein

size_t aur offsetof ke liye <stddef.h> include karein. sizeof padding samet object ka complete byte size deta hai. offsetof appropriate ordinary member ka byte offset deta hai. C17 ka _Alignof(type) type ki alignment requirement bytes mein query karta hai.

C17 · illustrative fragment
struct Sample { char mark; int count; };
size_t count_offset = offsetof(struct Sample, count);
size_t object_size = sizeof(struct Sample);
size_t required_alignment = _Alignof(struct Sample);

Code int ko four bytes ya particular structure ko eight bytes ka assume nahi karta. Bit-field par offsetof apply na karein aur uska address na lein. Member offset layout fact hai, invalid pointer banane ya arbitrary byte arithmetic se doosre type ko access karne ki permission nahi.

3. Alignment aur access type alag requirements hain

Alignment suitable objects ki location constrain karti hai. C17 ka _Alignas language restrictions ke under object alignment specify kar sakta hai; natural requirement weaken nahi kar sakta. Particular context mein extended alignment unsupported ho sakti hai. Ordinary allocation ki guarantees ko har over-aligned type tak generalize na karein.

C17 · illustrative fragment
_Alignas(int) unsigned char storage[sizeof(int)] = {0};
size_t capacity = sizeof storage;

Declaration int ke liye suitable alignment request karti hai, lekin object ab bhi declared unsigned char array hai. Alignment akela usko int object nahi banata aur arbitrary typed access valid nahi karta. Storage capacity, alignment, lifetime aur access-type rules separate checks rakhein.

4. Bit-fields small integer fields name karte hain, portable wire layout nahi

C17 · illustrative fragment
struct Flags { unsigned int enabled : 1; unsigned int mode : 2; };
struct Flags flags = {.enabled = 1, .mode = 2};

Bit-fields integer member ki permitted width declare karte hain. C17 ke standard base types mein _Bool, signed int aur unsigned int hain; doosre base types ka support aur plain int bit-field ki signedness implementation-defined hai. Allocation units mein bit order aur field ka unit boundary cross karna implementation par depend karta hai; kuch details guaranteed hone ke bajay unspecified hain. Example byte image predict kiye bina field values check karta hai. Hardware register mapping ko platform ABI, access aur device rules bhi chahiye; bit-field declaration akeli sufficient nahi.

5. Stable meaning ke liye explicit representation policy chahiye

Padding useful record field nahi. C17 initialization aur later member stores ordinary structure values ke liye generally canonical padding pattern provide nahi karte. {} se initialized aggregates aur unions ki padding C23 mein zero bits se initialize hoti hai; later stores padding ko unspecified chhod sakte hain. Doosri representations bhi matter karti hain. Semantic equality ke liye intended members compare karein; raw structure dump ko portable format samajhne ke bajay files/messages ki explicit encoding define karein.

Primary references aur aage padhne ke liye

Aage badhne se pehle

  • Alignment type ke liye suitable storage positions constrain karta hai.
  • Padding se structure sizeof member sizes ke sum se bada ho sakta hai.
  • Layout aur bit-field behavior ko implementation checks aur explicit external-format rules chahiye.
In ideas ko alag rakhein
Member values / Complete representation
Equal logical members se dono objects ke har padding byte ka equal hona required nahi.
Apne words mein samjhaayein

Poore structure bytes compare karna application ki desired equality express kyun nahi kar sakta?

Optional: bolkar samjhein ya note rakhein. Tayyar hon toh aage badh sakte hain.

Apni understanding check karein

Optional hai. Answers save ya send nahi hote; chapter kabhi lock nahi hota.

Structure ke meaningful member values equal hon to kya object bytes identical hona guaranteed hai?
Har choice ki explanation padhein
  1. Haan, har structure mein sirf meaningful values hoti hain, padding nahi.

    Implementation padding insert kar sakti hai; representations aisi general guarantee nahi deti.

  2. Nahi. Padding aur representations byte comparison ko value equality ke liye unsuitable bana sakti hain.

    ✓ Sahi reasoning. Program ki intended equality ke according meaningful members compare karein.

  3. memcmp hamesha member-by-member semantic comparison karta hai.

    memcmp bytes compare karta hai, structure members ke meanings nahi.

C17

Agla idea padhne ke liye tayyar?

Mark this chapter as read whenever you feel ready.

CHAPTER 35 / 73

Is chapter mein

Padding, alignment aur layout

Search all 73 chapters in both languages.EN + HG

Try “pointer”, “why int”, or “undefined behavior”.

Concepts connect. Follow your curiosity.↑ ↓ to explore · Enter to open
MAKE YOURSELF COMFORTABLE

Your reading space

Appearance

A clear canvas with balanced contrast.

Text size

100%
AA

Reading tools

Your data stays in this browser

Export a backup before changing browsers or replacing an older version of the reader.

YOUR PERSONAL MARGINS

My notebook

Saved on this device
A LITTLE CLARITY

The glossary

A starting meaning, then a chapter to go deeper.

A QUICK DEFINITION

A little clarity

Read the full explanation →

A thought worth keeping