Submit Search
Upload
Clanguage
•
Download as PPT, PDF
•
1 like
•
578 views
Abhishek Khune
Follow
this ppt containing all chapters in c language
Read less
Read more
Education
Technology
Report
Share
Report
Share
1 of 65
Download now
Recommended
Introduction to HDLs
Introduction to HDLs
IndiraPriyadarshini30
Â
C language
C language
Robo India
Â
Verilog HDL- 2
Verilog HDL- 2
Prabhavathi P
Â
VHDL- data types
VHDL- data types
VandanaPagar1
Â
Verilog presentation final
Verilog presentation final
Ankur Gupta
Â
Verilogspk1
Verilogspk1
supriya kurlekar
Â
Verilog tutorial
Verilog tutorial
Abhiraj Bohra
Â
Chapter Eight(3)
Chapter Eight(3)
bolovv
Â
Recommended
Introduction to HDLs
Introduction to HDLs
IndiraPriyadarshini30
Â
C language
C language
Robo India
Â
Verilog HDL- 2
Verilog HDL- 2
Prabhavathi P
Â
VHDL- data types
VHDL- data types
VandanaPagar1
Â
Verilog presentation final
Verilog presentation final
Ankur Gupta
Â
Verilogspk1
Verilogspk1
supriya kurlekar
Â
Verilog tutorial
Verilog tutorial
Abhiraj Bohra
Â
Chapter Eight(3)
Chapter Eight(3)
bolovv
Â
Compiler Construction | Lecture 12 | Virtual Machines
Compiler Construction | Lecture 12 | Virtual Machines
Eelco Visser
Â
Compiler Construction | Lecture 13 | Code Generation
Compiler Construction | Lecture 13 | Code Generation
Eelco Visser
Â
VHDL- gate level modelling
VHDL- gate level modelling
VandanaPagar1
Â
Verilog tutorial
Verilog tutorial
raju reddy
Â
Hardware Description Language
Hardware Description Language
Prachi Pandey
Â
C language
C language
spatidar0
Â
Chapter Seven(2)
Chapter Seven(2)
bolovv
Â
Verilog hdl
Verilog hdl
dennis gookyi
Â
An Introductory course on Verilog HDL-Verilog hdl ppr
An Introductory course on Verilog HDL-Verilog hdl ppr
Prabhavathi P
Â
Digital Circuit Verification Hardware Descriptive Language Verilog
Digital Circuit Verification Hardware Descriptive Language Verilog
Abhiraj Bohra
Â
Introduction of flex
Introduction of flex
vip_du
Â
CS4200 2019 | Lecture 4 | Syntactic Services
CS4200 2019 | Lecture 4 | Syntactic Services
Eelco Visser
Â
Compiler Construction | Lecture 10 | Data-Flow Analysis
Compiler Construction | Lecture 10 | Data-Flow Analysis
Eelco Visser
Â
Coding verilog
Coding verilog
umarjamil10000
Â
Ch4c
Ch4c
kinnarshah8888
Â
Yacc (yet another compiler compiler)
Yacc (yet another compiler compiler)
omercomail
Â
Lexyacc
Lexyacc
Hina Tahir
Â
Yacc lex
Yacc lex
915086731
Â
Dr archana dhawan bajaj - csharp fundamentals slides
Dr archana dhawan bajaj - csharp fundamentals slides
Dr-archana-dhawan-bajaj
Â
C language
C language
SMS2007
Â
Introduction to c language and its application.ppt
Introduction to c language and its application.ppt
ParilittleAngel
Â
Clanguage
Clanguage
Vidyacenter
Â
More Related Content
What's hot
Compiler Construction | Lecture 12 | Virtual Machines
Compiler Construction | Lecture 12 | Virtual Machines
Eelco Visser
Â
Compiler Construction | Lecture 13 | Code Generation
Compiler Construction | Lecture 13 | Code Generation
Eelco Visser
Â
VHDL- gate level modelling
VHDL- gate level modelling
VandanaPagar1
Â
Verilog tutorial
Verilog tutorial
raju reddy
Â
Hardware Description Language
Hardware Description Language
Prachi Pandey
Â
C language
C language
spatidar0
Â
Chapter Seven(2)
Chapter Seven(2)
bolovv
Â
Verilog hdl
Verilog hdl
dennis gookyi
Â
An Introductory course on Verilog HDL-Verilog hdl ppr
An Introductory course on Verilog HDL-Verilog hdl ppr
Prabhavathi P
Â
Digital Circuit Verification Hardware Descriptive Language Verilog
Digital Circuit Verification Hardware Descriptive Language Verilog
Abhiraj Bohra
Â
Introduction of flex
Introduction of flex
vip_du
Â
CS4200 2019 | Lecture 4 | Syntactic Services
CS4200 2019 | Lecture 4 | Syntactic Services
Eelco Visser
Â
Compiler Construction | Lecture 10 | Data-Flow Analysis
Compiler Construction | Lecture 10 | Data-Flow Analysis
Eelco Visser
Â
Coding verilog
Coding verilog
umarjamil10000
Â
Ch4c
Ch4c
kinnarshah8888
Â
Yacc (yet another compiler compiler)
Yacc (yet another compiler compiler)
omercomail
Â
Lexyacc
Lexyacc
Hina Tahir
Â
Yacc lex
Yacc lex
915086731
Â
Dr archana dhawan bajaj - csharp fundamentals slides
Dr archana dhawan bajaj - csharp fundamentals slides
Dr-archana-dhawan-bajaj
Â
C language
C language
SMS2007
Â
What's hot
(20)
Compiler Construction | Lecture 12 | Virtual Machines
Compiler Construction | Lecture 12 | Virtual Machines
Â
Compiler Construction | Lecture 13 | Code Generation
Compiler Construction | Lecture 13 | Code Generation
Â
VHDL- gate level modelling
VHDL- gate level modelling
Â
Verilog tutorial
Verilog tutorial
Â
Hardware Description Language
Hardware Description Language
Â
C language
C language
Â
Chapter Seven(2)
Chapter Seven(2)
Â
Verilog hdl
Verilog hdl
Â
An Introductory course on Verilog HDL-Verilog hdl ppr
An Introductory course on Verilog HDL-Verilog hdl ppr
Â
Digital Circuit Verification Hardware Descriptive Language Verilog
Digital Circuit Verification Hardware Descriptive Language Verilog
Â
Introduction of flex
Introduction of flex
Â
CS4200 2019 | Lecture 4 | Syntactic Services
CS4200 2019 | Lecture 4 | Syntactic Services
Â
Compiler Construction | Lecture 10 | Data-Flow Analysis
Compiler Construction | Lecture 10 | Data-Flow Analysis
Â
Coding verilog
Coding verilog
Â
Ch4c
Ch4c
Â
Yacc (yet another compiler compiler)
Yacc (yet another compiler compiler)
Â
Lexyacc
Lexyacc
Â
Yacc lex
Yacc lex
Â
Dr archana dhawan bajaj - csharp fundamentals slides
Dr archana dhawan bajaj - csharp fundamentals slides
Â
C language
C language
Â
Similar to Clanguage
Introduction to c language and its application.ppt
Introduction to c language and its application.ppt
ParilittleAngel
Â
Clanguage
Clanguage
Vidyacenter
Â
C language
C language
VAIRA MUTHU
Â
C language introduction
C language introduction
musrath mohammad
Â
Theory1&2
Theory1&2
Dr.M.Karthika parthasarathy
Â
Csdfsadf
Csdfsadf
Atul Setu
Â
C
C
Anuja Lad
Â
C
C
Khan Rahimeen
Â
Introduction to c
Introduction to c
amol_chavan
Â
Interm codegen
Interm codegen
Anshul Sharma
Â
programming language in c&c++
programming language in c&c++
Haripritha
Â
Android RenderScript
Android RenderScript
Jungsoo Nam
Â
A Replay Approach to Software Validation
A Replay Approach to Software Validation
James Pascoe
Â
Return of c++
Return of c++
Yongwei Wu
Â
Lex tool manual
Lex tool manual
Sami Said
Â
C# programming
C# programming
umesh patil
Â
C++tutorial
C++tutorial
dips17
Â
Reduce course notes class xii
Reduce course notes class xii
Syed Zaid Irshad
Â
Brief introduction to the c programming language
Brief introduction to the c programming language
Kumar Gaurav
Â
Xtext Webinar
Xtext Webinar
Sven Efftinge
Â
Similar to Clanguage
(20)
Introduction to c language and its application.ppt
Introduction to c language and its application.ppt
Â
Clanguage
Clanguage
Â
C language
C language
Â
C language introduction
C language introduction
Â
Theory1&2
Theory1&2
Â
Csdfsadf
Csdfsadf
Â
C
C
Â
C
C
Â
Introduction to c
Introduction to c
Â
Interm codegen
Interm codegen
Â
programming language in c&c++
programming language in c&c++
Â
Android RenderScript
Android RenderScript
Â
A Replay Approach to Software Validation
A Replay Approach to Software Validation
Â
Return of c++
Return of c++
Â
Lex tool manual
Lex tool manual
Â
C# programming
C# programming
Â
C++tutorial
C++tutorial
Â
Reduce course notes class xii
Reduce course notes class xii
Â
Brief introduction to the c programming language
Brief introduction to the c programming language
Â
Xtext Webinar
Xtext Webinar
Â
More from Abhishek Khune
07 java collection
07 java collection
Abhishek Khune
Â
Java Notes
Java Notes
Abhishek Khune
Â
Threads
Threads
Abhishek Khune
Â
Sorting
Sorting
Abhishek Khune
Â
Slide8appletv2 091028110313-phpapp01
Slide8appletv2 091028110313-phpapp01
Abhishek Khune
Â
Packages in java
Packages in java
Abhishek Khune
Â
Week0 introduction
Week0 introduction
Abhishek Khune
Â
Binary trees
Binary trees
Abhishek Khune
Â
Applets
Applets
Abhishek Khune
Â
Clanguage
Clanguage
Abhishek Khune
Â
06 abstract-classes
06 abstract-classes
Abhishek Khune
Â
Java unit3
Java unit3
Abhishek Khune
Â
Java unit2
Java unit2
Abhishek Khune
Â
Linux introduction
Linux introduction
Abhishek Khune
Â
Shared memory
Shared memory
Abhishek Khune
Â
Lecture 14 (inheritance basics)
Lecture 14 (inheritance basics)
Abhishek Khune
Â
More from Abhishek Khune
(16)
07 java collection
07 java collection
Â
Java Notes
Java Notes
Â
Threads
Threads
Â
Sorting
Sorting
Â
Slide8appletv2 091028110313-phpapp01
Slide8appletv2 091028110313-phpapp01
Â
Packages in java
Packages in java
Â
Week0 introduction
Week0 introduction
Â
Binary trees
Binary trees
Â
Applets
Applets
Â
Clanguage
Clanguage
Â
06 abstract-classes
06 abstract-classes
Â
Java unit3
Java unit3
Â
Java unit2
Java unit2
Â
Linux introduction
Linux introduction
Â
Shared memory
Shared memory
Â
Lecture 14 (inheritance basics)
Lecture 14 (inheritance basics)
Â
Recently uploaded
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.Compdf
UmakantAnnand
Â
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
iammrhaywood
Â
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953056974 Low Rate Call Girls In Saket, Delhi NCR
Â
mini mental status format.docx
mini mental status format.docx
PoojaSen20
Â
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Celine George
Â
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
heathfieldcps1
Â
Class 11 Legal Studies Ch-1 Concept of State .pdf
Class 11 Legal Studies Ch-1 Concept of State .pdf
akmcokerachita
Â
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
GeoBlogs
Â
call girls in Kamla Market (DELHI) 🔝 >༒9953330565🔝 genuine Escort Service 🔝✔️✔️
call girls in Kamla Market (DELHI) 🔝 >༒9953330565🔝 genuine Escort Service 🔝✔️✔️
9953056974 Low Rate Call Girls In Saket, Delhi NCR
Â
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
Sarwono Sutikno, Dr.Eng.,CISA,CISSP,CISM,CSX-F
Â
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
anshu789521
Â
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
iammrhaywood
Â
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Krashi Coaching
Â
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
Marc Dusseiller Dusjagr
Â
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media Component
InMediaRes1
Â
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
SoniaTolstoy
Â
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
pboyjonauth
Â
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
NirmalaLoungPoorunde1
Â
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
JhengPantaleon
Â
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
Chameera Dedduwage
Â
Recently uploaded
(20)
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.Compdf
Â
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
ECONOMIC CONTEXT - LONG FORM TV DRAMA - PPT
Â
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
Â
mini mental status format.docx
mini mental status format.docx
Â
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Â
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
Â
Class 11 Legal Studies Ch-1 Concept of State .pdf
Class 11 Legal Studies Ch-1 Concept of State .pdf
Â
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
Â
call girls in Kamla Market (DELHI) 🔝 >༒9953330565🔝 genuine Escort Service 🔝✔️✔️
call girls in Kamla Market (DELHI) 🔝 >༒9953330565🔝 genuine Escort Service 🔝✔️✔️
Â
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
Â
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
Â
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
Â
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Â
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
Â
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media Component
Â
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
Â
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
Â
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
Â
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
Â
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
Â
Clanguage
1.
Copyright © 2001
Stephen A. Edwards All rights reserved The C Language Prof. Stephen A. Edwards
2.
Copyright © 2001
Stephen A. Edwards All rights reserved The C Language  Currently, the most commonly-used language for embedded systems  “High-level assembly”  Very portable: compilers exist for virtually every processor  Easy-to-understand compilation  Produces efficient code  Fairly concise
3.
Copyright © 2001
Stephen A. Edwards All rights reserved C History  Developed between 1969 and 1973 along with Unix  Due mostly to Dennis Ritchie  Designed for systems programming • Operating systems • Utility programs • Compilers • Filters  Evolved from B, which evolved from BCPL
4.
Copyright © 2001
Stephen A. Edwards All rights reserved BCPL  Designed by Martin Richards (Cambridge) in 1967  Typeless • Everything an n-bit integer (a machine word) • Pointers (addresses) and integers identical  Memory is an undifferentiated array of words  Natural model for word-addressed machines  Local variables depend on frame-pointer-relative addressing: dynamically-sized automatic objects not permitted  Strings awkward • Routines expand and pack bytes to/from word arrays
5.
Copyright © 2001
Stephen A. Edwards All rights reserved C History  Original machine (DEC PDP-11) was very small • 24K bytes of memory, 12K used for operating system  Written when computers were big, capital equipment • Group would get one, develop new language, OS
6.
Copyright © 2001
Stephen A. Edwards All rights reserved C History  Many language features designed to reduce memory • Forward declarations required for everything • Designed to work in one pass: must know everything • No function nesting  PDP-11 was byte-addressed • Now standard • Meant BCPL’s word-based model was insufficient
7.
Copyright © 2001
Stephen A. Edwards All rights reserved Hello World in C #include <stdio.h> void main() { printf(“Hello, world!n”); } Preprocessor used to share information among source files - Clumsy + Cheaply implemented + Very flexible
8.
Copyright © 2001
Stephen A. Edwards All rights reserved Hello World in C #include <stdio.h> void main() { printf(“Hello, world!n”); } Program mostly a collection of functions “main” function special: the entry point “void” qualifier indicates function does not return anything I/O performed by a library function: not included in the language
9.
Copyright © 2001
Stephen A. Edwards All rights reserved Euclid’s algorithm in C int gcd(int m, int n) { int r; while ( (r = m % n) != 0) { m = n; n = r; } return n; } “New Style” function declaration lists number and type of arguments Originally only listed return type. Generated code did not care how many arguments were actually passed. Arguments are call- by-value
10.
Copyright © 2001
Stephen A. Edwards All rights reserved Euclid’s algorithm in C int gcd(int m, int n) { int r; while ( (r = m % n) != 0) { m = n; n = r; } return n; } Automatic variable Storage allocated on stack when function entered, released when it returns. All parameters, automatic variables accessed w.r.t. frame pointer. Extra storage needed while evaluating large expressions also placed on the stack n m ret. addr. r Frame pointer Stack pointer Excess arguments simply ignored
11.
Copyright © 2001
Stephen A. Edwards All rights reserved Euclid’s algorithm in C int gcd(int m, int n) { int r; while ( (r = m % n) != 0) { m = n; n = r; } return n; } Expression: C’s basic type of statement. Arithmetic and logical Assignment (=) returns a value, so can be used in expressions % is remainder != is not equal
12.
Copyright © 2001
Stephen A. Edwards All rights reserved Euclid’s algorithm in C int gcd(int m, int n) { int r; while ( (r = m % n) != 0) { m = n; n = r; } return n; } High-level control-flow statement. Ultimately becomes a conditional branch. Supports “structured programming” Each function returns a single value, usually an integer. Returned through a specific register by convention.
13.
Copyright © 2001
Stephen A. Edwards All rights reserved Euclid Compiled on PDP-11 .globl _gcd r0-r7 .text PC is r7, SP is r6, FP is r5 _gcd: jsr r5,rsave save sp in frame pointer r5 L2:mov 4(r5),r1 r1 = n sxt r0 sign extend div 6(r5),r0 m / n = r0,r1 mov r1,-10(r5) r = m % n jeq L3 mov 6(r5),4(r5) m = n mov -10(r5),6(r5) n = r jbr L2 L3:mov 6(r5),r0 return n in r0 jbr L1 L1:jmp rretrn restore sp ptr, return int gcd(int m, int n) { int r; while ( (r = m % n) != 0) { m = n; n = r; } return n; }
14.
Copyright © 2001
Stephen A. Edwards All rights reserved Euclid Compiled on PDP-11 .globl _gcd .text _gcd: jsr r5,rsave L2:mov 4(r5),r1 sxt r0 div 6(r5),r0 mov r1,-10(r5) jeq L3 mov 6(r5),4(r5) mov -10(r5),6(r5) jbr L2 L3:mov 6(r5),r0 jbr L1 L1:jmp rretrn Very natural mapping from C into PDP-11 instructions. Complex addressing modes make frame-pointer-relative accesses easy. Another idiosyncrasy: registers were memory-mapped, so taking address of a variable in a register is straightforward.
15.
Copyright © 2001
Stephen A. Edwards All rights reserved Pieces of C  Types and Variables • Definitions of data in memory  Expressions • Arithmetic, logical, and assignment operators in an infix notation  Statements • Sequences of conditional, iteration, and branching instructions  Functions • Groups of statements and variables invoked recursively
16.
Copyright © 2001
Stephen A. Edwards All rights reserved C Types  Basic types: char, int, float, and double  Meant to match the processor’s native types • Natural translation into assembly • Fundamentally nonportable  Declaration syntax: string of specifiers followed by a declarator  Declarator’s notation matches that in an expression  Access a symbol using its declarator and get the basic type back
17.
Copyright © 2001
Stephen A. Edwards All rights reserved C Type Examples int i; int *j, k; unsigned char *ch; float f[10]; char nextChar(int, char*); int a[3][5][10]; int *func1(float); int (*func2)(void); Integer j: pointer to integer, int k ch: pointer to unsigned char Array of 10 floats 2-arg function Array of three arrays of five … function returning int * pointer to function returning int
18.
Copyright © 2001
Stephen A. Edwards All rights reserved C Typedef  Type declarations recursive, complicated.  Name new types with typedef  Instead of int (*func2)(void) use typedef int func2t(void); func2t *func2;
19.
Copyright © 2001
Stephen A. Edwards All rights reserved C Structures  A struct is an object with named fields: struct { char *name; int x, y; int h, w; } box;  Accessed using “dot” notation: box.x = 5; box.y = 2;
20.
Copyright © 2001
Stephen A. Edwards All rights reserved Struct bit-fields  Way to aggressively pack data in memory struct { unsigned int baud : 5; unsigned int div2 : 1; unsigned int use_external_clock : 1; } flags;  Compiler will pack these fields into words  Very implementation dependent: no guarantees of ordering, packing, etc.  Usually less efficient • Reading a field requires masking and shifting
21.
Copyright © 2001
Stephen A. Edwards All rights reserved C Unions  Can store objects of different types at different times union { int ival; float fval; char *sval; };  Useful for arrays of dissimilar objects  Potentially very dangerous  Good example of C’s philosophy • Provide powerful mechanisms that can be abused
22.
Copyright © 2001
Stephen A. Edwards All rights reserved Alignment of data in structs  Most processors require n-byte objects to be in memory at address n*k  Side effect of wide memory busses  E.g., a 32-bit memory bus  Read from address 3 requires two accesses, shifting 4 3 2 1 4 3 2 1
23.
Copyright © 2001
Stephen A. Edwards All rights reserved Alignment of data in structs  Compilers add “padding” to structs to ensure proper alignment, especially for arrays  Pad to ensure alignment of largest object (with biggest requirement) struct { char a; int b; char c; }  Moral: rearrange to save memory a bbbb c a bbbb c Pad
24.
Copyright © 2001
Stephen A. Edwards All rights reserved C Storage Classes #include <stdlib.h> int global_static; static int file_static; void foo(int auto_param) { static int func_static; int auto_i, auto_a[10]; double *auto_d = malloc(sizeof(double)*5); } Linker-visible. Allocated at fixed location Visible within file. Allocated at fixed location. Visible within func. Allocated at fixed location.
25.
Copyright © 2001
Stephen A. Edwards All rights reserved C Storage Classes #include <stdlib.h> int global_static; static int file_static; void foo(int auto_param) { static int func_static; int auto_i, auto_a[10]; double *auto_d = malloc(sizeof(double)*5); } Space allocated on stack by function. Space allocated on stack by caller. Space allocated on heap by library routine.
26.
Copyright © 2001
Stephen A. Edwards All rights reserved malloc() and free()  Library routines for managing the heap int *a; a = (int *) malloc(sizeof(int) * k); a[5] = 3; free(a);  Allocate and free arbitrary-sized chunks of memory in any order
27.
Copyright © 2001
Stephen A. Edwards All rights reserved malloc() and free()  More flexible than automatic variables (stacked)  More costly in time and space • malloc() and free() use complicated non-constant-time algorithms • Each block generally consumes two additional words of memory  Pointer to next empty block  Size of this block  Common source of errors • Using uninitialized memory • Using freed memory • Not allocating enough • Neglecting to free disused blocks (memory leaks)
28.
Copyright © 2001
Stephen A. Edwards All rights reserved malloc() and free()  Memory usage errors so pervasive, entire successful company (Pure Software) founded to sell tool to track them down  Purify tool inserts code that verifies each memory access  Reports accesses of uninitialized memory, unallocated memory, etc.  Publicly-available Electric Fence tool does something similar
29.
Copyright © 2001
Stephen A. Edwards All rights reserved Dynamic Storage Allocation  What are malloc() and free() actually doing?  Pool of memory segments: Free malloc( )
30.
Copyright © 2001
Stephen A. Edwards All rights reserved Dynamic Storage Allocation  Rules: • Each segment contiguous in memory (no holes) • Segments do not move once allocated  malloc() • Find memory area large enough for segment • Mark that memory is allocated  free() • Mark the segment as unallocated
31.
Copyright © 2001
Stephen A. Edwards All rights reserved Dynamic Storage Allocation  Three issues:  How to maintain information about free memory  The algorithm for locating a suitable block  The algorithm for freeing an allocated block
32.
Copyright © 2001
Stephen A. Edwards All rights reserved Simple Dynamic Storage Allocation  Three issues:  How to maintain information about free memory • Linked list  The algorithm for locating a suitable block • First-fit  The algorithm for freeing an allocated block • Coalesce adjacent free blocks
33.
Copyright © 2001
Stephen A. Edwards All rights reserved Simple Dynamic Storage Allocation Next Size Next SizeSize Free block Allocated block malloc( ) First large-enough free block selected Free block divided into two Previous next pointer updated Newly-allocated region begins with a size value
34.
Copyright © 2001
Stephen A. Edwards All rights reserved Simple Dynamic Storage Allocation free(a) Appropriate position in free list identified Newly-freed region added to adjacent free regions
35.
Copyright © 2001
Stephen A. Edwards All rights reserved Dynamic Storage Allocation  Many, many variants  Other “fit” algorithms  Segregation of objects by sizes • 8-byte objects in one region, 16 in another, etc.  More intelligent list structures
36.
Copyright © 2001
Stephen A. Edwards All rights reserved Memory Pools  An alternative: Memory pools  Separate management policy for each pool  Stack-based pool: can only free whole pool at once • Very cheap operation • Good for build-once data structures (e.g., compilers)  Pool for objects of a single size • Useful in object-oriented programs  Not part of the C standard library
37.
Copyright © 2001
Stephen A. Edwards All rights reserved Arrays  Array: sequence of identical objects in memory  int a[10]; means space for ten integers Filippo Brunelleschi, Ospdale degli Innocenti, Firenze, Italy, 1421  By itself, a is the address of the first integer  *a and a[0] mean the same thing  The address of a is not stored in memory: the compiler inserts code to compute it when it appears  Ritchie calls this interpretation the biggest conceptual jump from BCPL to C
38.
Copyright © 2001
Stephen A. Edwards All rights reserved Multidimensional Arrays  Array declarations read right-to-left  int a[10][3][2];  “an array of ten arrays of three arrays of two ints”  In memory 2 2 2 3 2 2 2 3 2 2 2 3 ... 10 Seagram Building, Ludwig Mies van der Rohe,1957
39.
Copyright © 2001
Stephen A. Edwards All rights reserved Multidimensional Arrays  Passing a multidimensional array as an argument requires all but the first dimension int a[10][3][2]; void examine( a[][3][2] ) { … }  Address for an access such as a[i][j][k] is a + k + 2*(j + 3*i)
40.
Copyright © 2001
Stephen A. Edwards All rights reserved Multidimensional Arrays  Use arrays of pointers for variable-sized multidimensional arrays  You need to allocate space for and initialize the arrays of pointers int ***a;  a[3][5][4] expands to *(*(*(a+3)+5)+4) The value int ** int * int int ***a
41.
Copyright © 2001
Stephen A. Edwards All rights reserved C Expressions  Traditional mathematical expressions y = a*x*x + b*x + c;  Very rich set of expressions  Able to deal with arithmetic and bit manipulation
42.
Copyright © 2001
Stephen A. Edwards All rights reserved C Expression Classes  arithmetic: + – * / %  comparison: == != < <= > >=  bitwise logical: & | ^ ~  shifting: << >>  lazy logical: && || !  conditional: ? :  assignment: = += -=  increment/decrement: ++ --  sequencing: ,  pointer: * -> & []
43.
Copyright © 2001
Stephen A. Edwards All rights reserved Bitwise operators  and: & or: | xor: ^ not: ~ left shift: << right shift: >>  Useful for bit-field manipulations #define MASK 0x040 if (a & MASK) { … } /* Check bits */ c |= MASK; /* Set bits */ c &= ~MASK; /* Clear bits */ d = (a & MASK) >> 4; /* Select field */
44.
Copyright © 2001
Stephen A. Edwards All rights reserved Lazy Logical Operators  “Short circuit” tests save time if ( a == 3 && b == 4 && c == 5 ) { … } equivalent to if (a == 3) { if (b ==4) { if (c == 5) { … } } }  Evaluation order (left before right) provides safety if ( i <= SIZE && a[i] == 0 ) { … }
45.
Copyright © 2001
Stephen A. Edwards All rights reserved Conditional Operator  c = a < b ? a + 1 : b – 1;  Evaluate first expression. If true, evaluate second, otherwise evaluate third.  Puts almost statement-like behavior in expressions.  BCPL allowed code in an expression: a := 5 + valof{ int i, s = 0; for (i = 0 ; i < 10 ; i++) s += a[I]; return s; }
46.
Copyright © 2001
Stephen A. Edwards All rights reserved Side-effects in expressions  Evaluating an expression often has side-effects a++ increment a afterwards a = 5 changes the value of a a = foo() function foo may have side-effects
47.
Copyright © 2001
Stephen A. Edwards All rights reserved Pointer Arithmetic  From BCPL’s view of the world  Pointer arithmetic is natural: everything’s an integer int *p, *q; *(p+5) equivalent to p[5]  If p and q point into same array, p – q is number of elements between p and q.  Accessing fields of a pointed-to structure has a shorthand: p->field means (*p).field
48.
Copyright © 2001
Stephen A. Edwards All rights reserved C Statements  Expression  Conditional • if (expr) { … } else {…} • switch (expr) { case c1: case c2: … }  Iteration • while (expr) { … } zero or more iterations • do … while (expr) at least one iteration • for ( init ; valid ; next ) { … }  Jump • goto label • continue; go to start of loop • break; exit loop or switch • return expr; return from function
49.
Copyright © 2001
Stephen A. Edwards All rights reserved The Switch Statement  Performs multi-way branches switch (expr) { case 1: … break; case 5: case 6: … break; default: … break; } tmp = expr; if (tmp == 1) goto L1 else if (tmp == 5) goto L5 else if (tmp == 6) goto L6 else goto Default; L1: … goto Break; L5:; L6: … goto Break; Default: … goto Break; Break:
50.
Copyright © 2001
Stephen A. Edwards All rights reserved Switch Generates Interesting Code  Sparse case labels tested sequentially if (e == 1) goto L1; else if (e == 10) goto L2; else if (e == 100) goto L3;  Dense cases use a jump table table = { L1, L2, Default, L4, L5 }; if (e >= 1 and e <= 5) goto table[e];  Clever compilers may combine these
51.
Copyright © 2001
Stephen A. Edwards All rights reserved setjmp/longjmp  A way to exit from deeply nested functions  A hack now a formal part of the standard library #include <setjmp.h> jmp_buf jmpbuf; void top(void) { switch (setjmp(jmpbuf)) { case 0: child(); break; case 1: /* longjmp called */ break; } } void deeplynested() { longjmp(jmpbuf, 1); } Space for a return address and registers (including stack pointer, frame pointer) Stores context, returns 0 Returns to context, making it appear setjmp() returned 1
52.
Copyright © 2001
Stephen A. Edwards All rights reserved The Macro Preprocessor  Relatively late and awkward addition to the language  Symbolic constants #define PI 3.1415926535  Macros with arguments for emulating inlining #define min(x,y) ((x) < (y) ? (x) : (y))  Conditional compilation #ifdef __STDC__  File inclusion for sharing of declarations #include “myheaders.h”
53.
Copyright © 2001
Stephen A. Edwards All rights reserved Macro Preprocessor Pitfalls  Header file dependencies usually form a directed acyclic graph (DAG)  How do you avoid defining things twice?  Convention: surround each header (.h) file with a conditional: #ifndef __MYHEADER_H__ #define __MYHEADER_H__ /* Declarations */ #endif
54.
Copyright © 2001
Stephen A. Edwards All rights reserved Macro Preprocessor Pitfalls  Macros with arguments do not have function call semantics  Function Call: • Each argument evaluated once, in undefined order, before function is called  Macro: • Each argument evaluated once every time it appears in expansion text
55.
Copyright © 2001
Stephen A. Edwards All rights reserved Macro Preprocessor pitfalls  Example: the “min” function int min(int a, int b) { if (a < b) return a; else return b; } #define min(a,b) ((a) < (b) ? (a) : (b))  Identical for min(5,x)  Different when evaluating expression has side-effect: min(a++,b) • min function increments a once • min macro may increment a twice if a < b
56.
Copyright © 2001
Stephen A. Edwards All rights reserved Macro Preprocessor Pitfalls  Text substitution can expose unexpected groupings #define mult(a,b) a*b mult(5+3,2+4)  Expands to 5 + 3 * 2 + 4  Operator precedence evaluates this as 5 + (3*2) + 4 = 15 not (5+3) * (2+4) = 48 as intended  Moral: By convention, enclose each macro argument in parenthesis: #define mult(a,b) (a)*(b)
57.
Copyright © 2001
Stephen A. Edwards All rights reserved Nondeterminism in C  Library routines • malloc() returns a nondeterministically-chosen address • Address used as a hash key produces nondeterministic results  Argument evaluation order • myfunc( func1(), func2(), func3() ) • func1, func2, and func3 may be called in any order  Word sizes int a; a = 1 << 16; /* Might be zero */ a = 1 << 32; /* Might be zero */
58.
Copyright © 2001
Stephen A. Edwards All rights reserved Nondeterminism in C  Uninitialized variables • Automatic variables may take values from stack • Global variables left to the whims of the OS  Reading the wrong value from a union • union { int a; float b; } u; u.a = 10; printf(“%g”, u.b);  Pointer dereference • *a undefined unless it points within an allocated array and has been initialized • Very easy to violate these rules • Legal: int a[10]; a[-1] = 3; a[10] = 2; a[11] = 5; • int *a, *b; a - b only defined if a and b point into the same array
59.
Copyright © 2001
Stephen A. Edwards All rights reserved Nondeterminism in C  How to deal with nondeterminism? • Caveat programmer  Studiously avoid nondeterministic constructs • Compilers, lint, etc. don’t really help  Philosophy of C: get out of the programmer’s way  “C treats you like a consenting adult” • Created by a systems programmer (Ritchie)  “Pascal treats you like a misbehaving child” • Created by an educator (Wirth)  “Ada treats you like a criminal” • Created by the Department of Defense
60.
Copyright © 2001
Stephen A. Edwards All rights reserved Summary  C evolved from the typeless languages BCPL and B  Array-of-bytes model of memory permeates the language  Original weak type system strengthened over time  C programs built from • Variable and type declarations • Functions • Statements • Expressions
61.
Copyright © 2001
Stephen A. Edwards All rights reserved Summary of C types  Built from primitive types that match processor types  char, int, float, double, pointers  Struct and union aggregate heterogeneous objects  Arrays build sequences of identical objects  Alignment restrictions ensured by compiler  Multidimensional arrays  Three storage classes • global, static (address fixed at compile time) • automatic (on stack) • heap (provided by malloc() and free() library calls)
62.
Copyright © 2001
Stephen A. Edwards All rights reserved Summary of C expressions  Wide variety of operators • Arithmetic + - * / • Logical && || (lazy) • Bitwise & | • Comparison < <= • Assignment = += *= • Increment/decrement ++ -- • Conditional ? :  Expressions may have side-effects
63.
Copyright © 2001
Stephen A. Edwards All rights reserved Summary of C statements  Expression  Conditional • if-else switch  Iteration • while do-while for(;;)  Branching • goto break continue return  Awkward setjmp, longjmp library routines for non- local goto
64.
Copyright © 2001
Stephen A. Edwards All rights reserved Summary of C  Preprocessor • symbolic constants • inline-like functions • conditional compilation • file inclusion  Sources of nondeterminsm • library functions, evaluation order, variable sizes
65.
Copyright © 2001
Stephen A. Edwards All rights reserved The Main Points  Like a high-level assembly language  Array-of-cells model of memory  Very efficient code generation follows from close semantic match  Language lets you do just about everything  Very easy to make mistakes
Download now