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

Similar documents
C Arrays, Strings, More Pointers Instructor: Steven Ho

CS 61c: Great Ideas in Computer Architecture

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

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

CS61C : Machine Structures

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

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

ECE 15B COMPUTER ORGANIZATION

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

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

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

More C Pointer Dangers

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

CS61C : Machine Structures

CS61C : Machine Structures

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

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

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

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

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?!

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

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

CS61C : Machine Structures

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

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

Arrays and Memory Management

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

Arrays and Pointers in C. Alan L. Cox

CS61C : Machine Structures

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

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

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

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

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

Lecture 2: C Programm

CS 102 Computer Architecture. Lecture 2: Introduction to C, Part I. Instructor: Sören Schwertfeger.

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

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

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

Lectures 5-6: Introduction to C

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

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

CS 61c: Great Ideas in Computer Architecture

Arrays and Pointers (part 1)

Intro to C: Pointers and Arrays

Arrays and Pointers. CSE 2031 Fall November 11, 2013

Arrays and Pointers (part 1)

Intermediate Programming, Spring 2017*

Homework #3 CS2255 Fall 2012

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

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

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

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

Lectures 5-6: Introduction to C

Arrays Arrays and pointers Loops and performance Array comparison Strings. John Edgar 2

Pointers in C/C++ 1 Memory Addresses 2

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

CS 61C: Great Ideas in Computer Architecture. MIPS Instruction Formats

C Review. MaxMSP Developers Workshop Summer 2009 CNMAT

CS 61C: Great Ideas in Computer Architecture. Memory Management and Usage

C Language Part 1 Digital Computer Concept and Practice Copyright 2012 by Jaejin Lee

Lecture 04 Introduction to pointers

CSCI-1200 Data Structures Fall 2017 Lecture 5 Pointers, Arrays, & Pointer Arithmetic

Array Initialization

CS 0449 Sample Midterm

Multidimension array, array of strings

CSCI-1200 Data Structures Spring 2017 Lecture 5 Pointers, Arrays, Pointer Arithmetic

CS 61C: Great Ideas in Computer Architecture. Lecture 2: Numbers & C Language. Krste Asanović & Randy Katz

C strings. (Reek, Ch. 9) 1 CS 3090: Safety Critical Programming in C

Lectures 13 & 14. memory management

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

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

CS2351 Data Structures. Lecture 7: A Brief Review of Pointers in C

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

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

CS 110 Computer Architecture. Lecture 2: Introduction to C, Part I. Instructor: Sören Schwertfeger.

CS 11 C track: lecture 5

CS 61C: Great Ideas in Computer Architecture Introduction to C

Pointers and Arrays 1

C++ for Java Programmers

Variables and literals

CS 61C: Great Ideas in Computer Architecture Introduction to C, Part III

FORM 1 (Please put your name and section number (001/10am or 002/2pm) on the scantron!!!!) CS 161 Exam II: True (A)/False(B) (2 pts each):

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

Agenda. CS 61C: Great Ideas in Computer Architecture. Lecture 2: Numbers & C Language 8/29/17. Recap: Binary Number Conversion

Fundamental of Programming (C)

CS113: Lecture 5. Topics: Pointers. Pointers and Activation Records

Memory, Arrays & Pointers

Problem 2 Add the two 2 s complement signed 8-bit values given below, and express your answer in decimal.

Programming. Pointers, Multi-dimensional Arrays and Memory Management

Kurt Schmidt. October 30, 2018

A brief introduction to C programming for Java programmers

CS 61C: Great Ideas in Computer Architecture Intro to Assembly Language, MIPS Intro

Lecture #6 Intro MIPS; Load & Store

Introduction to C. Robert Escriva. Cornell CS 4411, August 30, Geared toward programmers

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

CS 33. Introduction to C. Part 5. CS33 Intro to Computer Systems V 1 Copyright 2017 Thomas W. Doeppner. All rights reserved.

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

Transcription:

CS 61C: Great Ideas in Computer Architecture C Arrays, Strings, More Pointers Instructor: Justin Hsia 6/20/2012 Summer 2012 Lecture #3 1

Review of Last Lecture C Basics Variables, Functions, Flow Control, Types, and Structs Only 0 and NULL evaluate to FALSE Pointers hold addresses Address vs. Value Allow for efficient code, but prone to errors C functions pass by value Passing pointers circumvents this 6/20/2012 Summer 2012 Lecture #3 2

Question: What is the result from executing the following code? #include <stdio.h> int main() { int *p; *p = 5; printf( %d\n,*p); } Prints 5 Prints garbage Always crashes 3

Great Idea #1: Levels of Representation/Interpretation Higher Level Language Program (e.g. C) Assembly Language Program (e.g. MIPS) Machine Language Program (MIPS) Machine Interpretation Hardware Architecture Description (e.g. block diagrams) Architecture Implementation Compiler Assembler Logic Circuit Description (Circuit Schematic Diagrams) temp = v[k]; v[k] = v[k+1]; v[k+1] = temp; lw $t0, 0($2) lw $t1, 4($2) sw $t1, 0($2) sw $t0, 4($2) We are here_ 0000 1001 1100 0110 1010 1111 0101 1000 1010 1111 0101 1000 0000 1001 1100 0110 1100 0110 1010 1111 0101 1000 0000 1001 0101 1000 0000 1001 1100 0110 1010 1111 6/20/2012 Summer 2012 Lecture #3 4

Agenda Miscellaneous C Syntax Arrays Administrivia Strings More Pointers Pointer Arithmetic Pointer Misc 6/20/2012 Summer 2012 Lecture #3 5

Assignment and Equality One of the most common errors for beginning C programmers a = b a == b is assignment is equality test When comparing with a constant, can avoid this by putting the variable on the right! if (3 == a) {... } Correct if (3 = a) {... } Won t compile Comparisons use assigned value if (a=b) is true if a 0 after assignment (b 0) 6/20/2012 Summer 2012 Lecture #3 6

Operator Precedence 6/20/2012 Summer 2012 Lecture #3 7

Operator Precedence For precedence/order of execution, see Table 2 1 on p. 53 of K&R Use parentheses to manipulate Equality test (==) binds more tightly than logic (&,, &&, ) x&1==0 means x&(1==0) instead of (x&1)==0 *p++ means get value at address pointed to by p, then increment p *--p means decrement p to point to the previous data item and then use that value 6/20/2012 Summer 2012 Lecture #3 8

Question: What is the output of the following code? char blocks[3] = { 6, 1, C }; char *ptr = blocks, temp; temp = *++ptr; printf( 1: %c\n, temp); temp = *ptr++; printf( 2: %c\n, temp); 1 7 2 8 7 1 1 1 9

Agenda Miscellaneous C Syntax Arrays Administrivia Strings More Pointers Pointer Arithmetic Pointer Misc 6/20/2012 Summer 2012 Lecture #3 10

Array Basics Declaration: int ar[2]; declares a 2 element integer array (just a block of memory) int ar[] = {795, 635}; declares and initializes a 2 element integer array Accessing elements: ar[num] returns the num th element Zero indexed 6/20/2012 Summer 2012 Lecture #3 11

Arrays Basics Pitfall: An array in C does not know its own length, and its bounds are not checked! We can accidentally access off the end of an array We must pass the array and its size to any procedure that is going to manipulate it Mistakes with array bounds cause segmentation faults and bus errors Be careful! These are VERY difficult to find (You ll learn how to debug these in lab) 6/20/2012 Summer 2012 Lecture #3 12

Accessing an Array Array size n: access entries 0 to n 1 Use separate variable for declaration & bound Bad Pattern Better Pattern Bad pattern int i, ar[10]; for(i=0; i<10; i++) {...} Better pattern int ARRAY_SIZE = 10 Single source of truth! int i, ar[array_size]; for(i=0; i<array_size; i++) {...} 6/20/2012 Summer 2012 Lecture #3 13

Arrays and Pointers Arrays are (almost) identical to pointers char *string and char string[] are nearly identical declarations Differ in subtle ways: initialization, sizeof(), etc. Key Concept: An array variable looks like a pointer to the first (0 th ) element ar[0] same as *ar; ar[2] same as *(ar+2) We can use pointer arithmetic to conveniently access arrays An array variable is read only (no assignment) (i.e. cannot use ar = [anything] ) 6/20/2012 Summer 2012 Lecture #3 14

Array and Pointer Example ar[i] is treated as *(ar+i) To zero an array, the following three ways are equivalent: 1) for(i=0; i<size; i++) ar[i] = 0; 2) for(i=0; i<size; i++) *(ar+i) = 0; 3) for(p=ar; p<ar+size; p++) *p = 0; These use pointer arithmetic, which we will get to shortly 6/20/2012 Summer 2012 Lecture #3 15

Arrays Stored Differently Than Pointers void foo() { int *p, a[4], x; p = &x; } *p = 1; // or p[0] printf("*p:%u, p:%u, &p:%u\n",*p,p,&p); *a = 2; // or a[0] printf("*a:%u, a:%u, &a:%u\n",*a,a,&a); 0 4 8 12 16 20 24 28 32 36 40 44 48 40 2 1 p x...???...? 24 a *p:1, p:40, &p:20 *a:2, a:24, &a:24 K&R: An array. name is not a variable. 6/20/2012 Summer 2012 Lecture #3 16

Arrays and Functions Declared arrays only allocated while the scope is valid: char *foo() { char string[32];...; return string; } An array is passed to a function as a pointer: Really int *ar int foo(int ar[], unsigned int size) {... ar[size-1]... } Must explicitly pass the size! 6/20/2012 Summer 2012 Lecture #3 17

Arrays and Functions Array size gets lost when passed to a function What prints in the following code: int foo(int array[], unsigned int size) {... printf( %d\n, sizeof(array)); } sizeof(int??? *) int main(void) { int a[10], b[5];... foo(a, 10)... printf( %d\n, sizeof(a)); } 10*sizeof(int)??? 6/20/2012 Summer 2012 Lecture #3 18

Agenda Miscellaneous C Syntax Arrays Administrivia Strings More Pointers Pointer Arithmetic Pointer Misc 6/20/2012 Summer 2012 Lecture #3 19

Administrivia HW1 due Sunday night Lab 2 is up don t forget about extra credit Switching sections how are things going? Section 104 has room! Sections 101 and 102 are crowded Website updates: Discussion sheets & solutions in calendar Staff HW0s (click on photos) 6/20/2012 Summer 2012 Lecture #3 20

Agenda Miscellaneous C Syntax Arrays Administrivia Strings More Pointers Pointer Arithmetic Pointer Misc 6/20/2012 Summer 2012 Lecture #3 21

C Strings 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 ( \0 ) (a.k.a. null terminator ) Array size here is 4 int strlen(char s[]) { int n = 0; while (s[n]!= 0) n++; return n; } This means you need an extra space in your array!!! 6/20/2012 Summer 2012 Lecture #3 22

C String Standard Functions Accessible with #include <string.h> int strlen(char *string); Returns the length of string (not including null term) 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 contents of string src to the memory at dst. Caller must ensure that dst has enough memory to hold the data to be copied Note: dst = src only copies pointers 6/20/2012 Summer 2012 Lecture #3 23

String Examples #include <stdio.h> #include <string.h> int main () { char s1[10], s2[10], s3[]= hello, *s4= hola ; strcpy(s1, hi ); strcpy(s2, hi ); } Value of the following expressions? sizeof(s1) 10 strlen(s1) 2 s1==s2 0 Point to different locations! strcmp(s1,s2) 0 strcmp(s1,s3) 4 strcmp(s1,s4) 6 6/20/2012 Summer 2012 Lecture #3 24 (s1 > s3) (s1 < s4)

Question: What does this function do when called? void foo(char *s, char *t) { while (*s) s++; while (*s++ = *t++) ; } Throws an error Changes characters in string t to the next character in the string s Copies a string at address t to the string at address s 25

Agenda Miscellaneous C Syntax Arrays Administrivia Strings More Pointers Pointer Arithmetic Pointer Misc 6/20/2012 Summer 2012 Lecture #3 26

Pointer Arithmetic pointer ± number e.g. pointer + 1 adds 1 something to the address Compare what happens: (assume a at address 100) char *p; char a; int *p; int a; p = &a; printf( %u %u\n,p,p+1); 100 101 100 104 Adds 1*sizeof(char) Adds 1*sizeof(int) Pointer arithmetic should be used cautiously 6/20/2012 Summer 2012 Lecture #3 27

Pointer Arithmetic A pointer is just a memory address, so we can add to/subtract from it to move through an array p+1 correctly increments p by sizeof(*p) i.e. moves pointer to the next array element What about an array of large structs (objects)? Struct declaration tells C the size to use, so handled like basic types 6/20/2012 Summer 2012 Lecture #3 28

Pointer Arithmetic What is 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 6/20/2012 Summer 2012 Lecture #3 29

Pointer Arithmetic to Copy Memory 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++; } This works due to } operator precedence We have to pass the size (n) to copy 6/20/2012 Summer 2012 Lecture #3 30

Question: The first printf outputs 100 5 5 10. What will the next two printf output? int main(void){ int A[] = {5,10}; int *p = A; 5 10 A[0] A[1] p } printf( %u %d %d %d\n, p, *p, A[0], A[1]); p = p + 1; printf( %u %d %d %d\n, p, *p, A[0], A[1]); *p = *p + 1; printf( %u %d %d %d\n, p, *p, A[0], A[1]); 101 10 5 10 then 101 11 5 11 104 10 5 10 then 104 11 5 11 100 6 6 10 then 101 6 6 10 31

Get to Know Your Staff Category: Cal 6/20/2012 Summer 2012 Lecture #3 32

Agenda Miscellaneous C Syntax Arrays Administrivia Strings More Pointers Pointer Arithmetic Pointer Misc 6/20/2012 Summer 2012 Lecture #3 33

Pointers and Allocation When you declare a pointer (e.g. int *ptr;), it doesn t actually point to anything yet It points somewhere (garbage; don t know where) Dereferencing will usually cause an error Option 1: Point to something that already exists int *ptr,var; var = 5; ptr = &var1; var has space implicitly allocated for it (declaration) Option 2: Allocate room in memory for new thing to point to (next lecture) 6/20/2012 Summer 2012 Lecture #3 34

Pointers and Arrays Want to access all of array of size n and 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? Yes! C defines that one element past end of array must be a valid address, i.e. will not cause an bus error or address error 6/20/2012 Summer 2012 Lecture #3 35

Pointers and Structures Variable declarations: struct Point { int x; int y; struct Point *p; }; Point pt1; Point pt2; Point *ptaddr; Valid operations: /* dot notation */ int h = pt1.x; pt2.y = pt1.y; Cannot contain an instance of itself, but can point to one /* arrow notation */ int h = ptaddr->x; int h = (*ptaddr).x; /* This works too */ pt1 = pt2; Copies contents 6/20/2012 Summer 2012 Lecture #3 36

Pointers to Pointers Pointer to a pointer, declared as **h Example: void IncrementPtr(int **h) { *h = *h + 1; } A q q int A[3] = {50, 60, 70}; int *q = A; IncrementPtr(&q); 50 60 70 printf( *q = %d\n, *q); *q = 60 6/20/2012 Summer 2012 Lecture #3 37

Question: Struct and Pointer Practice Assuming everything is properly initialized, what do the following expressions evaluate to? struct node { char *name; struct node *next; data }; struct node *ar[5]; struct node **p = ar;... /* fill ar with initialized structs */ address invalid 1) &p 2) p->name 3) p[7]->next 4) *((*p) + 2) 5) *(p[0]->next) 6) (*p)->next->name 38

Answers: Struct and Pointer Practice 1) &p address (ptr to ptr to ptr) address of operator returns an address 2) p->name invalid Attempt to access field of a pointer 3) p[7]->next invalid Increment p into unknown memory, then dereference 4) *((*p) + 2) data (struct node) Access array, move along it, then access struct 5) *(p[0]->next) data (struct node) This is tricky. p[0] = *(p + 0) is valid and accesses the array of pointers, where -> operator correctly accesses field of struct, and dereference leaves us at another struct. 6) (*p)->next->name address (char array) next field points to struct, access name field, which is, itself, a pointer (string) 39

Summary Pointers and array variables are very similar Can use pointer or array syntax to index into arrays Strings are null terminated arrays of characters Pointer arithmetic moves the pointer by the size of the thing it s pointing to Pointers are the source of many bugs in C, so handle with care 6/20/2012 Summer 2012 Lecture #3 40