CS 61C L04 C Pointers (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.

Slides:



Advertisements
Similar presentations
CS61CL L01 Introduction (1) Huddleston, Summer 2009 © UCB Introduction to C Jeremy Huddleston inst.eecs.berkeley.edu/~cs61c.
Advertisements

An introduction to pointers in c
Programming and Data Structure
What is a pointer? First of all, it is a variable, just like other variables you studied So it has type, storage etc. Difference: it can only store the.
Kernighan/Ritchie: Kelley/Pohl:
1 Pointers A pointer variable holds an address We may add or subtract an integer to get a different address. Adding an integer k to a pointer p with base.
CS61C L04 Introduction to C (pt 2) (1) Garcia, Fall 2011 © UCB Reference slides You ARE responsible for the material on these slides (they’re just taken.
CS61C L03 Introduction to C (pt 2) (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L05 C Structures, Memory Management (1) Garcia, Spring 2005 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS 61C L04 C Pointers (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L04 Introduction to C (pt 2) (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L3 C Pointers (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS 61C L02 Number Representation (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L3 C Pointers (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #3 – C Strings,
CS61C L04 Introduction to C (pt 2) (1) Garcia, Fall 2011 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS 61C L2 Introduction to C (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 2: Introduction To C
Copyright © 2008 Pearson Addison-Wesley. All rights reserved. Chapter 9 Pointers and Dynamic Arrays.
CS 61C L4 Structs (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #4: Strings & Structs
CS61C L04 Introduction to C (pt 2) (1) Garcia, Spring 2008 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS 61C L03 C Arrays (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #3: C Pointers & Arrays
CS 61C L03 C Pointers (1)Garcia / Patterson Fall 2002 © UCB CS61C - Machine Structures Lecture 3 C pointers  Dan Garcia (
CS61C L03 Introduction to C (pt 1) (1) Garcia, Fall 2011 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L3 C Pointers (1) Chae, Summer 2008 © UCB Albert Chae Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #3 – More C intro,
CS 61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61CL L01 Introduction (1) Huddleston, Summer 2009 © UCB Jeremy Huddleston inst.eecs.berkeley.edu/~cs61c CS61CL : Machine Structures Lecture #2 - C Pointers.
Adapted from Dr. Craig Chase, The University of Texas at Austin.
CS 61C L03 C Arrays (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/ CS61C : Machine Structures Lecture #3: C Pointers & Arrays
C Arrays. One-Dimensional Arrays Proper ways of declare an array in C: int hours[ 24]; double Temp [24]; int test_score [15] = { 77, 88, 99, 100, 87,
CS 61C L04 C Structures, Memory Management (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L4 C Pointers (1) Chae, Summer 2008 © UCB Albert Chae Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #4 –C Strings,
Arrays and Pointers in C Alan L. Cox
Instructor: Justin Hsia 6/26/2013Summer Lecture #31 CS 61C: Great Ideas in Computer Architecture C Arrays, Strings, More Pointers.
CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Tevfik Bultan Lecture 12: Pointers continued, C strings.
1 C - Memory Simple Types Arrays Pointers Pointer to Pointer Multi-dimensional Arrays Dynamic Memory Allocation.
CSC 2400 Computer Systems I Lecture 5 Pointers and Arrays.
Computer Science and Software Engineering University of Wisconsin - Platteville 2. Pointer Yan Shi CS/SE2630 Lecture Notes.
C++ Programming: From Problem Analysis to Program Design, Second Edition1 Objectives In this chapter you will: Learn about the pointer data type and pointer.
1 Pointers and Arrays. 2 When an array is declared,  The compiler allocates sufficient amount of storage to contain all the elements of the array in.
CS 61C: Great Ideas in Computer Architecture Introduction to C, Part II Instructors: John Wawrzynek & Vladimir Stojanovic
1 Pointers and Strings Chapter 5 2 What You Will Learn...  How to use pointers Passing arguments to functions with pointers See relationship of pointers.
Pointers: Basics. 2 What is a pointer? First of all, it is a variable, just like other variables you studied  So it has type, storage etc. Difference:
IT 252 Computer Organization and Architecture Introduction to the C Programming Language Richard Helps (developed from slides from C. Teng and textbook.
Topic 3: C Basics CSE 30: Computer Organization and Systems Programming Winter 2011 Prof. Ryan Kastner Dept. of Computer Science and Engineering University.
1 Homework HW4 due today HW5 is on-line Starting K&R Chapter 5 –Skipping sections for now –Not covering section 5.12.
Computer Organization and Design Pointers, Arrays and Strings in C Montek Singh Sep 18, 2015 Lab 5 supplement.
C++ Programming: From Problem Analysis to Program Design, Third Edition Chapter 14: Pointers.
Topic 4: C Data Structures CSE 30: Computer Organization and Systems Programming Winter 2011 Prof. Ryan Kastner Dept. of Computer Science and Engineering.
POINTERS Introduction to Systems Programming - COMP 1002, 1402.
Pointers in C++. Topics Covered  Introduction to Pointers  Pointers and arrays  Character Pointers, Arrays and Strings  Examples.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 9 Pointers and Dynamic Arrays.
Copyright © 2014 Pearson Addison-Wesley. All rights reserved. Chapter 9 Pointers and Dynamic Arrays.
CS 61C: Great Ideas in Computer Architecture Introduction to C, Part II Instructors: Krste Asanovic & Vladimir Stojanovic
1  Lecture 12 – Pointer FTMK, UTeM – Sem /2014.
CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Lucas Bang Lecture 11: Pointers.
Chapter 16 Pointers and Arrays Pointers and Arrays We've seen examples of both of these in our LC-3 programs; now we'll see them in C. Pointer Address.
C Tutorial - Pointers CS 537 – Introduction to Operating Systems.
Instructor: Justin Hsia 6/20/2012Summer Lecture #31 CS 61C: Great Ideas in Computer Architecture C Arrays, Strings, More Pointers.
Pointers: Basics. 2 Address vs. Value Each memory cell has an address associated with it
CS 61C: Great Ideas in Computer Architecture C Pointers Instructors: Vladimir Stojanovic & Nicholas Weaver 1.
CS61C L04 Introduction to C (pt 2) (1) Garcia, Spring 2010 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
EGR 2261 Unit 11 Pointers and Dynamic Variables
Computer Organization and Design Pointers, Arrays and Strings in C
IT 252 Computer Organization and Architecture
Arrays in C.
C help session: Tonight 306 Soda
CS61C - Machine Structures Lecture 4 C Structures Memory Management
File I/O in C Lecture 7 Narrator: Lecture 7: File I/O in C.
Pointers The C programming language gives us the ability to directly manipulate the contents of memory addresses via pointers. Unfortunately, this power.
Chapter 16 Pointers and Arrays
March, 2006 Saeid Nooshabadi
Presentation transcript:

CS 61C L04 C Pointers (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 4 – C Pointers Mars! 

CS 61C L04 C Pointers (2) Garcia, Spring 2004 © UCB Corrections to Monday’s lecture void main(); { int *p, x=5, y; // init y = *(p = &x) + 10; int z; flip-sign(p); printf("x=%d,y=%d,p=%d\n",x,y,p); } flip-sign(int *n){*n = -(*n)} How many syntax errors? #Errors (1)0 1.p is not a syntax error below. The %d will print out the memory address as a signed #, but addresses are unsigned. User error, but not a syntax error. 2. A successful return code is 0. You can remember this because there’s only one success (0), but there can be many failure modes: 1, 2, …

CS 61C L04 C Pointers (3) Garcia, Spring 2004 © UCB 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… (next time)

CS 61C L04 C Pointers (4) Garcia, Spring 2004 © UCB 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 ? var2 ? 55 ?

CS 61C L04 C Pointers (5) Garcia, Spring 2004 © UCB More C Pointer Dangers 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; }

CS 61C L04 C Pointers (6) Garcia, Spring 2004 © UCB Arrays (1/6) 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.

CS 61C L04 C Pointers (7) Garcia, Spring 2004 © UCB 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.

CS 61C L04 C Pointers (8) Garcia, Spring 2004 © UCB Arrays (3/6) Consequences: ar is a pointer 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

CS 61C L04 C Pointers (9) Garcia, Spring 2004 © UCB Arrays (4/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

CS 61C L04 C Pointers (10) Garcia, Spring 2004 © UCB Arrays (5/6) 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

CS 61C L04 C Pointers (11) Garcia, Spring 2004 © UCB Arrays (6/6) 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…

CS 61C L04 C Pointers (12) Garcia, Spring 2004 © UCB Pointer Arithmetic (1/3) Since a pointer is just a memory address, we can add to it to traverse an array. ptr+1 will return a pointer to the next array element. (*ptr)+1 vs. *ptr++ vs. *(ptr+1) ? What if we have an array of large structs (objects)? C takes care of it: In reality, ptr+1 doesn’t add 1 to the memory address, it adds the size of the array element.

CS 61C L04 C Pointers (13) Garcia, Spring 2004 © UCB Pointer Arithmetic (2/3) 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

CS 61C L04 C Pointers (14) Garcia, Spring 2004 © UCB int get(int array[], int n) { return (array[n]); /* OR */ return *(array + n); } Pointer Arithmetic (3/3) C knows the size of the thing a pointer points to – every addition or subtraction moves that many bytes. So the following are equivalent:

CS 61C L04 C Pointers (15) Garcia, Spring 2004 © UCB 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)

CS 61C L04 C Pointers (16) Garcia, Spring 2004 © UCB 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?

CS 61C L04 C Pointers (17) Garcia, Spring 2004 © UCB Administrivia Read K&R 6 for Friday There is a language called D! Thanks to Mehershad for the tip… Is Unicode really 16-bits? Yes and No “The size of it … may be 8 bits (for UTF- 8) [perfect ASCII map], 16 bits (for UTF- 16), or 32 bits (for UTF-32). (UTF = Unicode Transformation Format) Thanks to Chema for the correction…

CS 61C L04 C Pointers (18) Garcia, Spring 2004 © UCB C Strings 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; }

CS 61C L04 C Pointers (19) Garcia, Spring 2004 © UCB C Strings Headaches 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?

CS 61C L04 C Pointers (20) Garcia, Spring 2004 © UCB Common C Errors 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!

CS 61C L04 C Pointers (21) Garcia, Spring 2004 © UCB Pointer Arithmetic Peer Instruction Q 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)0

CS 61C L04 C Pointers (22) Garcia, Spring 2004 © UCB Buffer Page Reading Quiz Answers Signed & Unsigned Integers Why do computers and the C language have BOTH signed and unsigned integers? What would be wrong with JUST having signed integers in the computer? in C? Given that Moore's Law doubles the number of transistors every 18 months, someone could build a decimal number computer. What would be the advantages and disadvantages of such a computer? What might a normal computer-user notice about a decimal computer? What might a programmer notice?

CS 61C L04 C Pointers (23) Garcia, Spring 2004 © UCB Buffer Page Reading Quiz Answers Complete the program segment below so that the contents of intPtr and n before return agree with the diagram. int main ( ) { ____intPtr; ____n; intPtr = ____ ; n = ____ ; return 0; } intPtr n | *-|--->| 5 | +---+

CS 61C L04 C Pointers (24) Garcia, Spring 2004 © UCB Buffer Page Reading Quiz Answers Write a void function named SetTo5 that multiplies the value of an int variable used in the calling program by 5. Here's a framework for a main program in which SetTo5 is used: #include int main ( ) { int n = 27; SetTo5 ( ______ ); printf ("n = %d\n", n); /* n=5 */ return 0; } void SetTo5 ( int ___ ) { ___ = 5; }

CS 61C L04 C Pointers (25) Garcia, Spring 2004 © UCB 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 Pointer Arithmetic Peer Instruction A ptr ptr ptr + ptr ptr ptr ptr - ptr ptr1 == ptr2 ptr == 1 ptr == NULL #invalid (1)0

CS 61C L04 C Pointers (26) Garcia, Spring 2004 © UCB “And in Conclusion…” 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!”

CS 61C L04 C Pointers (27) Garcia, Spring 2004 © UCB Bonus Slide (near end): Arrays/Pointers 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; } int strlen(char *s) { int n = 0; while (s[n] != 0) n++; return n; } Could be written: while (s[n])

CS 61C L04 C Pointers (28) Garcia, Spring 2004 © UCB Bonus Slide (near end): Pointer Arithmetic We can use pointer arithmetic to “walk” through memory: °C automatically adjusts the pointer by the right amount each time (i.e., 1 byte for a char, 4 bytes for an int, etc.) void copy(int *from, int *to, int n) { int i; for (i=0; i<n; i++) { *to++ = *from++; }