Has there been an update to ANSI C? Lecture #3 C Pointers Yes! It s called the C99 or C9x std

Similar documents
CS61C : Machine Structures

CS61C : Machine Structures

HW1 due Monday by 9:30am Assignment online, submission details to come

CS61C : Machine Structures

More C Pointer Dangers

Number Review. Lecture #3 More C intro, C Strings, Arrays, & Malloc Variables. Clarification about counting down

CS61C Machine Structures. Lecture 4 C Pointers and Arrays. 1/25/2006 John Wawrzynek. www-inst.eecs.berkeley.edu/~cs61c/

Reference slides! C Strings! A string in C is just an array of characters.!!!char string[] = "abc";! How do you tell how long a string is?!

Review! * follows a pointer to its value! & gets the address of a variable! Pearce, Summer 2010 UCB! ! int x = 1000; Pearce, Summer 2010 UCB!

CS61C : Machine Structures

Reference slides! Garcia, Fall 2011 UCB! CS61C L04 Introduction to C (pt 2) (1)!

Agenda. Peer Instruction Question 1. Peer Instruction Answer 1. Peer Instruction Question 2 6/22/2011

CS61C : Machine Structures

review Pointers and arrays are virtually same C knows how to increment pointers C is an efficient language, with little protection

Review: C Strings. A string in C is just an array of characters. Lecture #4 C Strings, Arrays, & Malloc

ECE 15B COMPUTER ORGANIZATION

CS61C : Machine Structures

CS61C : Machine Structures

review Pointers and arrays are virtually same C knows how to increment pointers C is an efficient language, with little protection

CS61C : Machine Structures

CS61C Machine Structures. Lecture 5 C Structs & Memory Mangement. 1/27/2006 John Wawrzynek. www-inst.eecs.berkeley.edu/~cs61c/

How about them A s!! Go Oaktown!! CS61C - Machine Structures. Lecture 4 C Structures Memory Management Dan Garcia.

CS61C Machine Structures. Lecture 4 C Structs & Memory Management. 9/5/2007 John Wawrzynek. www-inst.eecs.berkeley.edu/~cs61c/

IT 252 Computer Organization and Architecture Introduction to the C Programming Language

CS 61C: Great Ideas in Computer Architecture. C Arrays, Strings, More Pointers

Lecture 4: Outline. Arrays. I. Pointers II. III. Pointer arithmetic IV. Strings

CS 61C: Great Ideas in Computer Architecture C Pointers. Instructors: Vladimir Stojanovic & Nicholas Weaver

CS 61c: Great Ideas in Computer Architecture

Instructor: Randy H. Katz hbp://inst.eecs.berkeley.edu/~cs61c/fa13. Fall Lecture #4. Agenda

Review Pointers and arrays are virtually same C knows how to increment pointers C is an efficient language, with little protection

C Arrays, Strings, More Pointers Instructor: Steven Ho

Agenda. Address vs. Value Consider memory to be a single huge array. Review. Pointer Syntax. Pointers 9/9/12

CS 61C: Great Ideas in Computer Architecture. Lecture 3: Pointers. Bernhard Boser & Randy Katz

Agenda. Components of a Computer. Computer Memory Type Name Addr Value. Pointer Type. Pointers. CS 61C: Great Ideas in Computer Architecture

CS 61C: Great Ideas in Computer Architecture. Lecture 3: Pointers. Krste Asanović & Randy Katz

Lecture 8: Pointer Arithmetic (review) Endianness Functions and pointers

Lecture 2: C Programm

CS 61C: Great Ideas in Computer Architecture Introduc)on to C, Part II

THE GOOD, BAD AND UGLY ABOUT POINTERS. Problem Solving with Computers-I

Two s Complement Review. Two s Complement Review. Agenda. Agenda 6/21/2011

Arrays and Memory Management

Intro to C: Pointers and Arrays

CS 61C: Great Ideas in Computer Architecture Introduc)on to C, Part II. Control. Consider memory to be a single huge array

CS61C : Machine Structures

Pointers, Arrays, Memory: AKA the cause of those Segfaults

Number review... Lecture 3 Introduction to the C Programming Language (pt 1) Has there been an update to ANSI C?

Lectures 13 & 14. memory management

CS61C : Machine Structures

CS61C : Machine Structures

C++ ARRAYS POINTERS POINTER ARITHMETIC. Problem Solving with Computers-I

CS 31: Intro to Systems Pointers and Memory. Kevin Webb Swarthmore College October 2, 2018

Processor. Lecture #2 Number Rep & Intro to C classic components of all computers Control Datapath Memory Input Output }

Numbers: positional notation. CS61C Machine Structures. Faux Midterm Review Jaein Jeong Cheng Tien Ee. www-inst.eecs.berkeley.

CS61C : Machine Structures

CS61C Machine Structures. Lecture 3 Introduction to the C Programming Language. 1/23/2006 John Wawrzynek. www-inst.eecs.berkeley.

In Java we have the keyword null, which is the value of an uninitialized reference type

C'Programming' data'separate'from'methods/functions' Low'memory'overhead'compared'to'Java'

CS61C : Machine Structures

CSC C69: OPERATING SYSTEMS

Arrays and Pointers in C. Alan L. Cox

Processor. Lecture #2 Number Rep & Intro to C classic components of all computers Control Datapath Memory Input Output

Brought to you by CalLUG (UC Berkeley GNU/Linux User Group). Tuesday, September 20, 6-8 PM in 100 GPB.

Lecture #6 Intro MIPS; Load & Store Assembly Variables: Registers (1/4) Review. Unlike HLL like C or Java, assembly cannot use variables

Chapter 16. Pointers and Arrays. Address vs. Value. Another Need for Addresses

CS61, Fall 2012 Section 2 Notes

C++ for Java Programmers

Pointers (part 1) What are pointers? EECS We have seen pointers before. scanf( %f, &inches );! 25 September 2017

Intermediate Programming, Spring 2017*

Pointer Basics. Lecture 13 COP 3014 Spring March 28, 2018

Topics Introduction to Microprocessors

C Review. MaxMSP Developers Workshop Summer 2009 CNMAT

Announcements. assign0 due tonight. Labs start this week. No late submissions. Very helpful for assign1

First of all, it is a variable, just like other variables you studied

CS61C : Machine Structures

CS 61c: Great Ideas in Computer Architecture

Pointers in C/C++ 1 Memory Addresses 2

Dynamic memory allocation (malloc)

CS 31: Intro to Systems Pointers and Memory. Martin Gagne Swarthmore College February 16, 2016

CS 11 C track: lecture 5

Arrays and Pointers. CSE 2031 Fall November 11, 2013

Multidimension array, array of strings

CS24 Week 2 Lecture 1

Agenda. Pointer Arithmetic. Pointer Arithmetic pointer + number, pointer number 6/23/2011. Pointer Arithmetic: Peer Instruction Question

Memory, Data, & Addressing II

Homework #3 CS2255 Fall 2012

A brief introduction to C programming for Java programmers

CS107 Handout 08 Spring 2007 April 9, 2007 The Ins and Outs of C Arrays

CS61C : Machine Structures

Lecture 5: Outline. I. Multi- dimensional arrays II. Multi- level arrays III. Structures IV. Data alignment V. Linked Lists

Arrays and Pointers. Arrays. Arrays: Example. Arrays: Definition and Access. Arrays Stored in Memory. Initialization. EECS 2031 Fall 2014.

Arrays in C C Programming and Software Tools. N.C. State Department of Computer Science

Pointers and Arrays 1

Lecture 16 CSE July 1992

C: Introduction, Pointers Instructors: Steven Ho, Nick Riasanovsky

Arrays and Pointers (part 1)

QUIZ. What is wrong with this code that uses default arguments?

So far, system calls have had easy syntax. Integer, character string, and structure arguments.

CSCI 171 Chapter Outlines

CMSC 341 Lecture 2 Dynamic Memory and Pointers

CS 1313 Spring 2000 Lecture Outline

Transcription:

CS61C L3 C Pointers (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #3 C Pointers 2005-09-07 There is one handout today at the front and back of the room! Lecturer PSOE, new dad Dan Garcia www.cs.berkeley.edu/~ddgarcia Paper display! Philips Polymer Vision has demonstrated a prototype rollable, paperlike display: Readius. Cool! www.polymervision.com Has there been an update to ANSI C? Yes! It s called the C99 or C9x std Thanks to Jason Spence for the tip References http://en.wikipedia.org/wiki/standard_c_library http://home.tiscalinet.ch/t_wolf/tw/c/c9x_changes.html Highlights <inttypes.h>: convert integer types (#38) <stdbool.h> for boolean logic def s (#35) restrict keyword for optimizations (#30) Named initializers (#17) for aggregate objs CS61C L3 C Pointers (3) Pointers & Allocation (1/2) After declaring a pointer: int *ptr; ptr doesn t actually point to anything yet. We can either: make it point to something that already exists, or allocate room in memory for something new that it will point to (later) Pointers & Allocation (2/2) Pointing to something that already exists: int *ptr, var1, var2; var1 = 5; ptr = &var1; var2 = *ptr; var1 and var2 have room implicitly allocated for them. ptr? var1? 5 var2? 5 CS61C L3 C Pointers (4) CS61C L3 C Pointers (5) More C Pointer Dangers Arrays (1/6) Declaring a pointer just allocates space to hold the pointer it does not allocate something to be pointed to! Local variables in C are not initialized, they may contain anything. What does the following code do? void f() int *ptr; *ptr = 5; Declaration: int ar[2]; declares a 2-element integer array. int ar[] = 795, 635; declares and fills a 2-elt integer array. Accessing elements: ar[num]; returns the num th element. CS61C L3 C Pointers (6) CS61C L3 C Pointers (7)

CS61C L3 C Pointers (8) Arrays (2/6) Arrays are (almost) identical to pointers char *string and char string[] are nearly identical declarations They differ in very subtle ways: incrementing, declaration of filled arrays Key Concept: An array variable is a pointer to the first element. Arrays (3/6) Consequences: ar is an array variable but looks like a pointer in many respects (though not all) ar[0] is the same as *ar ar[2] is the same as *(ar+2) We can use pointer arithmetic to access arrays more conveniently. Declared arrays are only allocated while the scope is valid char *foo() char string[32];...; return string; is incorrect CS61C L3 C Pointers (9) Arrays (4/6) Arrays (5/6) Array size n; want to access from 0 to n-1, but test for exit by comparing to address one element past the array int ar[10], *p, *q, sum = 0;... p = &ar[0]; q = &ar[10]; while (p!= q) /* sum = sum + *p; p = p + 1; */ sum += *p++; Is this legal? C defines that one element past end of array must be a valid address, i.e., not cause an bus error or address error Array size n; want to access from 0 to n-1, so you should use counter AND utilize a constant for declaration & incr Wrong int i, ar[10]; for(i = 0; i < 10; i++)... Right #define ARRAY_SIZE 10 int i, a[array_size]; for(i = 0; i < ARRAY_SIZE; i++)... Why? SINGLE SOURCE OF TRUTH You re utilizing indirection and avoiding maintaining two copies of the number 10 CS61C L3 C Pointers (10) CS61C L3 C Pointers (11) Arrays (6/6) Pointer Arithmetic (1/4) Pitfall: An array in C does not know its own length, & bounds not checked! Consequence: We can accidentally access off the end of an array. Consequence: We must pass the array and its size to a procedure which is going to traverse it. Segmentation faults and bus errors: These are VERY difficult to find; be careful! (You ll learn how to debug these in lab ) Since a pointer is just a mem address, we can add to it to traverse an array. p+1 returns a ptr to the next array elt. *p++ vs (*p)++? x = *p++ x = *p ; p = p + 1; x = (*p)++ x = *p ; *p = *p + 1; What if we have an array of large structs (objects)? C takes care of it: In reality, p+1 doesn t add 1 to the memory address, it adds the size of the array element. CS61C L3 C Pointers (12) CS61C L3 C Pointers (13)

CS61C L3 C Pointers (14) Pointer Arithmetic (2/4) So what s valid pointer arithmetic? Add an integer to a pointer. Subtract 2 pointers (in the same array). Compare pointers (<, <=, ==,!=, >, >=) Compare pointer to NULL (indicates that the pointer points to nothing). Everything else is illegal since it makes no sense: adding two pointers multiplying pointers subtract pointer from integer Pointer Arithmetic (3/4) C knows the size of the thing a pointer points to every addition or subtraction moves that many bytes. 1 byte for a char, 4 bytes for an int, etc. So the following are equivalent: int get(int array[], int n) return (array[n]); /* OR */ return *(array + n); CS61C L3 C Pointers (15) Pointer Arithmetic (4/4) We can use pointer arithmetic to walk through memory: void copy(int *from, int *to, int n) int i; for (i=0; i<n; i++) *to++ = *from++; Pointers in C Why use pointers? If we want to pass a huge struct or array, it s easier to pass a pointer than the whole thing. In general, pointers allow cleaner, more compact code. So what are the drawbacks? Pointers are probably the single largest source of bugs in software, so be careful anytime you deal with them. Dangling reference (premature free) Memory leaks (tardy free) CS61C L3 C Pointers (16) CS61C L3 C Pointers (17) C Pointer Dangers Unlike Java, C lets you cast a value of any type to any other type without performing any checking. int x = 1000; int *p = x; /* invalid */ int *q = (int *) x; /* valid */ The first pointer declaration is invalid since the types do not match. The second declaration is valid C but is almost certainly wrong Is it ever correct? CS61C L3 C Pointers (18) Segmentation Fault vs Bus Error? http://www.hyperdictionary.com/ Bus Error A fatal failure in the execution of a machine language instruction resulting from the processor detecting an anomalous condition on its bus. Such conditions include invalid address alignment (accessing a multi-byte number at an odd address), accessing a physical address that does not correspond to any device, or some other device-specific hardware error. A bus error triggers a processor-level exception which Unix translates into a SIGBUS signal which, if not caught, will terminate the current process. Segmentation Fault An error in which a running Unix program attempts to access memory not allocated to it and terminates with a segmentation violation error and usually a core dump. CS61C L3 C Pointers (19)

CS61C L3 C Pointers (20) Administrivia Administrivia Read K&R 6 by the next lecture There is a language called D! www.digitalmars.com/d/ Answers to the reading quizzes? Ask your TA in discussion Homework expectations Readers don t have time to fix your programs which have to run on lab machines. Code that doesn t compile or fails all of the autograder tests 0 Slip days You get 3 slip days per year to use for any homework assignment or project They are used at 1-day increments. Thus 1 minute late = 1 slip day used. They re recorded automatically (by checking submission time) so you don t need to tell us when you re using them Once you ve used all of your slip days, when a project/hw is late, it s 0 points. If you submit twice, we ALWAYS grade the latter, and deduct slip days appropriately You no longer need to tell anyone how your dog ate your computer. You should really save for a rainy day we all get sick and/or have family emergencies! CS61C L3 C Pointers (21) C Strings Arrays vs. Pointers A string in C is just an array of characters. char string[] = "abc"; How do you tell how long a string is? Last character is followed by a 0 byte (null terminator) int strlen(char s[]) int n = 0; while (s[n]!= 0) n++; return n; CS61C L3 C Pointers (22) An array name is a read-only pointer to the 0 th element of the array. An array parameter can be declared as an array or a pointer; an array argument can be passed as a pointer. int strlen(char s[]) int n = 0; while (s[n]!= 0) n++; return n; CS61C L3 C Pointers (23) Could be written: while (s[n]) int strlen(char *s) int n = 0; while (s[n]!= 0) n++; return n; C Strings Headaches Common C Errors One common mistake is to forget to allocate an extra byte for the null terminator. More generally, C requires the programmer to manage memory manually (unlike Java or C++). When creating a long string by concatenating several smaller strings, the programmer must insure there is enough space to store the full string! What if you don t know ahead of time how big your string will be? Buffer overrun security holes! CS61C L3 C Pointers (24) There is a difference between assignment and equality a = b is assignment a == b is an equality test This is one of the most common errors for beginning C programmers! CS61C L3 C Pointers (25)

CS61C L3 C Pointers (26) Pointer Arithmetic Peer Instruction Q Kilo, Mega, Giga, Tera, Peta, Exa, Zetta, Yotta How many of the following are invalid? I. pointer + integer II. integer + pointer III. pointer + pointer IV. pointer integer V. integer pointer VI. pointer pointer VII. compare pointer to pointer VIII. compare pointer to integer IX. compare pointer to 0 X. compare pointer to NULL #invalid 1 2 3 4 5 6 7 8 9 (1)0 1. Kim s melodious giddiness terrifies people, excepting zealous yodelers 2. Kirby Messed Gigglypuff Terribly, (then) Perfectly Exterminated Zelda and Yoshi 3. Killed meat gives teeth peace except zebra yogurt 4. Kind Men Give Tense People Extra Zeal (for) Yoga 5. Killing melee gives terror; peace exhibits Zen yoga 6. Killing messengers gives terrible people exactly zero, yo 7. Kindergarten means giving teachers perfect examples (of) zeal (&) youth 8. Kissing mediocre girls/guys teaches people (to) expect zero (from) you 9. Kinky Mean Girls Teach Penis-Extending Zen Yoga 10. Kissing Mel Gibson, Teddy Pendergrass exclaimed: Zesty, yo! CS61C L3 C Pointers (27) Pointer Arithmetic Summary x = *(p+1)? x = *(p+1) ; x = *p+1? x = (*p) + 1 ; x = (*p)++? x = *p ; *p = *p + 1; x = *p++? (*p++)? *(p)++? *(p++)? x = *p ; p = p + 1; x = *++p? p = p + 1 ; x = *p ; Lesson? Using anything but the standard *p++, (*p)++ causes more problems than it solves! CS61C L3 C Pointers (29) C String Standard Functions int strlen(char *string); compute the length of string int strcmp(char *str1, char *str2); return 0 if str1 and str2 are identical (how is this different from str1 == str2?) char *strcpy(char *dst, char *src); copy the contents of string src to the memory at dst. The caller must ensure that dst has enough memory to hold the data to be copied. CS61C L3 C Pointers (30) Pointers to pointers (1/4) review Pointers to pointers (2/4) review Sometimes you want to have a procedure increment a variable? What gets printed? Solved by passing in a pointer to our subroutine. Now what gets printed? void AddOne(int x) x = x + 1; y = 5 void AddOne(int *p) *p = *p + 1; y = 6 int y = 5; AddOne( y); printf( y = %d\n, y); int y = 5; AddOne(&y); printf( y = %d\n, y); CS61C L3 C Pointers (31) CS61C L3 C Pointers (32)

CS61C L3 C Pointers (33) Pointers to pointers (3/4) But what if what you want changed is a pointer? What gets printed? Pointers to pointers (4/4) Solution! Pass a pointer to a pointer, called a handle, declared as **h Now what gets printed? void IncrementPtr(int *p) p = p + 1; *q = 50 A q void IncrementPtr(int **h) *h = *h + 1; *q = 60 A q q int A[3] = 50, 60, 70; int *q = A; IncrementPtr( q); printf( *q = %d\n, *q); 50 60 70 int A[3] = 50, 60, 70; int *q = A; IncrementPtr(&q); printf( *q = %d\n, *q); 50 60 70 CS61C L3 C Pointers (34) Dynamic Memory Allocation (1/3) C has operator sizeof() which gives size in bytes (of type or variable) Assume size of objects can be misleading & is bad style, so use sizeof(type) Many years ago an int was 16 bits, and programs assumed it was 2 bytes CS61C L3 C Pointers (35) Dynamic Memory Allocation (2/3) To allocate room for something new to point to, use malloc() (with the help of a typecast and sizeof): ptr = (int *) malloc (sizeof(int)); Now, ptr points to a space somewhere in memory of size (sizeof(int)) in bytes. (int *) simply tells the compiler what will go into that space (called a typecast). malloc is almost never used for 1 var ptr = (int *) malloc (n*sizeof(int)); This allocates an array of n integers. CS61C L3 C Pointers (36) Dynamic Memory Allocation (3/3) Once malloc() is called, the memory location contains garbage, so don t use it until you ve set its value. After dynamically allocating space, we must dynamically free it: free(ptr); Use this command to clean up. CS61C L3 C Pointers (37) And in Conclusion C99 is the update to the language Pointers and arrays are virtually same C knows how to increment pointers C is an efficient language, with little protection Array bounds not checked Variables not automatically initialized (Beware) The cost of efficiency is more overhead for the programmer. C gives you a lot of extra rope but be careful not to hang yourself with it! Use handles to change pointers CS61C L3 C Pointers (39)