Objects aur memory
Addresses se pehle object, value, representation aur physical implementation ka difference samjhein.
Is chapter mein9 sections
C programs aise objects se kaam karte hain jo storage occupy karte hain. Object ko uske bytes, size aur address se jodenge, bina yeh assume kiye ki har machine memory ek tarah arrange karti hai. Diagrams reasoning ke liye relationships dikhate hain.
1. Object lifetime wali storage hai
C ka object data storage ka region hai jiske contents values represent kar sakte hain. int count = 4; mein count object ka naam hai, int type deta hai aur 4 initial value hai. Value change karna naya named object create karna nahi. Function C object nahi hai, chahe implementation executable instructions bhi kahin store kare.
Labeled container imagine karein. Label refer karne mein help karta hai; container ki capacity aur allowed interpretation hoti hai; contents change ho sakte hain. Analogy ki limit: C objects unnamed bhi ho sakte hain, aur optimizer ko har source-level object ke liye separate physical container dena zaroori nahi. Language valid program ke observable behavior ko describe karti hai.
2. C byte ek unit hai, universal picture nahi
Neeche fragment ke size_t ke liye <stddef.h> include karein. Storage sizes C bytes mein measure hoti hain. sizeof(char) hamesha 1 hai; <limits.h> ka CHAR_BIT ek C byte mein bits batata hai aur kam se kam eight hai. Eight-bit bytes common hain, definition nahi. sizeof(int) universally four nahi, aur sizeof ka result size_t type ka hota hai.
int count = 4;
size_t object_bytes = sizeof count;
size_t character_bytes = sizeof(char);
Program assumed byte count likhne ke bajay implementation se sizes puchhta hai. Size decimal digits ki count nahi, aur type ke har possible value ka complete description bhi nahi. Types ke ranges, alignment requirements aur operations ke rules bhi hote hain. Capacity aur meaning dono saath samjhein.
3. Value copy karne se independent contents milte hain
int original = 4;
int copy = original;
copy = 9;
Dono objects shuru mein equal integer values hold karte hain. copy ko 9 assign karne se original ab bhi 4 hold karta hai. Doosra naam pehle object ki alternative spelling nahi hai. Aage pointers se do expressions same object designate kar sakengi; woh integer copy karne se alag relationship hai.
4. Representation aur value ek cheez nahi
Object representation object ko represent karne wali bytes ki sequence hai. Type un bytes ko meaning deta hai. Kuch types mein padding ya aisi representations ho sakti hain jinhe ordinary value ki tarah read nahi karna chahiye. Equal values ke bytes identical honge, ya arbitrary bytes har type ki valid value banayenge, yeh assume na karein.
Optional: pointers ke baad byte view dobara dekhein
unsigned int value = 1;
const unsigned char *bytes = (const unsigned char *)&value;
unsigned char first_byte = bytes[0];
Character-type access rule object ki representation ko unsigned char ke through inspect karne deta hai. First-byte example jaan-bujhkar koi numeric result promise nahi karta: byte order aur representation implementation par depend karte hain. Cast value ka declared type change nahi karta. Pointer ko unrelated type mein cast karna generally invalid access ko legal nahi banata.
5. Addresses usable relationships batate hain
Ordinary cases mein address-of operator, jaise &count, object ka pointer deta hai. Pointer ko ordinary integer ya physical RAM number ke roop mein specify nahi kiya gaya. Common hosted operating systems virtual addresses use karte hain; C khud us operating-system model ko require nahi karti. Numeric address guess kiye bina “is object ko point karta hai” par reason kar sakte hain.
Object pointer ko printf se print karte waqt %p ko void * argument chahiye, jaise printf("%p", (void *)&count). Displayed form implementation-defined hai. Ek run ka address debugging observation hai, memorize karne wali portable fact nahi.
6. Stack aur heap implementation models hain
Kai systems code, static data, call frames aur allocated storage ko familiar regions mein organize karte hain. Stack aur heap diagrams un systems ko samjhane mein useful hain. Woh C storage duration ko define nahi karte. Automatic object register mein ho sakta hai ya optimize away ho sakta hai, aur allocator multiple mechanisms se storage la sakta hai. Diagram ko apni assumptions batani chahiye, har program ke liye ek layout impose nahi karni chahiye.
- Object
- Type aur representation
- Valid access
- Observable value
Primary references aur aage padhne ke liye
- WG14 N1570 — public C11 committee draft: 3.6, 6.2.4–6.2.8, 6.5p7, 6.5.3.4, 7.21.6.1. Yeh stable rules C17 baseline ko support karte hain; yeh draft final ISO publication nahi hai.
Aage badhne se pehle
- Objects storage occupy karte hain aur unke types, representations aur lifetimes hain.
- sizeof C bytes measure karta hai; CHAR_BIT ek C byte ke bits batata hai.
- Conceptual memory diagram relationships samjhata hai; ek physical machine layout fix nahi karta.
In ideas ko alag rakhein
- Object value / Object bytes
- Character view representation bytes inspect kar sakta hai; har byte pattern har type ki valid value nahi ban jaati.
Object ke kaun-se facts C guarantee karti hai aur kaunsi details target implementation par check karenge?
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.
Har choice ki explanation padhein
- Haan, fixed stack layout har C object ke type ka part hai.
Type universal machine stack layout prescribe nahi karta.
- Nahi. Storage-duration aur lifetime rules woh physical arrangement mandate nahi karte.
✓ Sahi reasoning. Call stack useful common implementation model hai; uski limits batani chahiye.
- Koi local object optimize nahi ho sakta.
Implementation required program behavior preserve karte hue optimize kar sakti hai.
C17
Earlier edition ka quick reference
Existing section links aur saved passages ke liye retained. Connected learning sequence ke liye upar expanded explanation padhein.
Table conventional hosted systems ka common model hai, C ka required layout nahi. Embedded/freestanding implementations, linker choices aur optimizations doosre arrangements use kar sakte hain. Automatic storage duration se physical stack allocation guaranteed nahi hoti.
| Region | Contents |
|---|---|
| Text (code) segment | Compiled machine instructions, typically read-only |
| Initialized data segment | Typically nonzero initialization wale writable static-storage objects; exact placement implementation-specific |
| BSS segment | Typically zero-initialized static-storage objects; kuch explicit zero initializers wale bhi |
| Heap | malloc/calloc/realloc se milne wali memory; allocation released storage reuse kar sakti hai, isliye har request par memory region grow hona zaroori nahi |
| Stack | Commonly call bookkeeping aur kuch automatic objects; objects optimize-away ya registers mein bhi ho sakte hain |
static local object ki value isliye retain hoti hai kyunki lifetime poori execution hai, chahe kisi bhi segment mein ho. Typical systems mein deep recursion ya large automatic arrays limited automatic-storage resources exhaust kar sakte hain. Leak allocated storage retain karta hai jise usefully release nahi kar pa rahe; actual heap growth/layout allocator aur environment par depend karte hain.
Agla idea padhne ke liye tayyar?
Mark this chapter as read whenever you feel ready.