Programming in C Advanced Pointers.

Slides:



Advertisements
Similar presentations
Dynamic memory allocation
Advertisements

Chapter 6 Data Types
David Notkin Autumn 2009 CSE303 Lecture 13 This space for rent.
Unions The storage referenced by a union variable can hold data of different types subject to the restriction that at any one time, the storage holds data.
CS1061: C Programming Lecture 21: Dynamic Memory Allocation and Variations on struct A. O’Riordan, 2004, 2007 updated.
Programming in C Pointers and Arrays, malloc( ). 7/28/092 Dynamic memory In Java, objects are created on the heap using reference variables and the new.
Managing Memory Static and Dynamic Memory Type Casts Allocating Arrays of Dynamic Size Resizing Block of Memory Returning Memory from a Function Avoiding.
CSCI 171 Presentation 11 Pointers. Pointer Basics.
Managing Memory DCT 1063 PROGRAMMING 2 Mohd Nazri Bin Ibrahim Faculty of Computer, Media & Technology TATi University College
Growing Arrays in C By: Victoria Tielebein CS 265- Spring 2011.
Kernighan/Ritchie: Kelley/Pohl:
Memory allocation CSE 2451 Matt Boggus. sizeof The sizeof unary operator will return the number of bytes reserved for a variable or data type. Determine:
Discussion: Week 3/26. Structs: Used to hold associated data together Used to group together different types of variables under the same name struct Telephone{
Memory Arrangement Memory is arrange in a sequence of addressable units (usually bytes) –sizeof( ) return the number of units it takes to store a type.
1 CSE 303 Lecture 11 Heap memory allocation ( malloc, free ) reading: Programming in C Ch. 11, 17 slides created by Marty Stepp
Programming in C Pointer Basics.
CS 11 C track: lecture 5 Last week: pointers This week: Pointer arithmetic Arrays and pointers Dynamic memory allocation The stack and the heap.
17. ADVANCED USES OF POINTERS. Dynamic Storage Allocation Many programs require dynamic storage allocation: the ability to allocate storage as needed.
CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Tevfik Bultan Lecture 12: Pointers continued, C strings.
Stack and Heap Memory Stack resident variables include:
Chapter 0.2 – Pointers and Memory. Type Specifiers  const  may be initialised but not used in any subsequent assignment  common and useful  volatile.
David Notkin Autumn 2009 CSE303 Lecture 12 October 24, 2009: Space Needle.
Programming in C Advanced Pointers. Pointers to Pointers Since a pointer is a variable type, a pointer may point to another pointer.Since a pointer is.
1 Dynamic Memory Allocation –The need –malloc/free –Memory Leaks –Dangling Pointers and Garbage Collection Today’s Material.
1 CHAPTER 5 POINTER. 2 Pointers  Basic concept of pointers  Pointer declaration  Pointer operator (& and *)  Parameter passing by reference  Dynamic.
Pointers in C Computer Organization I 1 August 2009 © McQuain, Feng & Ribbens Memory and Addresses Memory is just a sequence of byte-sized.
ECE Application Programming Instructors: Dr. Michael Geiger & Nasibeh Nasiri Fall 2015 Lecture 31: Structures (cont.) Dynamic memory allocation.
1 Dynamic Memory Allocation. 2 In everything we have done so far, our variables have been declared at compile time. In these slides, we will see how to.
MORE POINTERS Plus: Memory Allocation Heap versus Stack.
CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Lucas Bang Lecture 11: Pointers.
C Tutorial - Pointers CS 537 – Introduction to Operating Systems.
BIL 104E Introduction to Scientific and Engineering Computing Lecture 9.
DYNAMIC MEMORY ALLOCATION. Disadvantages of ARRAYS MEMORY ALLOCATION OF ARRAY IS STATIC: Less resource utilization. For example: If the maximum elements.
Programming in C Advanced Pointers.
CSE 220 – C Programming malloc, calloc, realloc.
Dynamic Allocation in C
Stack and Heap Memory Stack resident variables include:
Dynamic Allocation Review Structure and list processing
2008/11/19: Lecture 18 CMSC 104, Section 0101 John Y. Park
2016.
CSCI206 - Computer Organization & Programming
Programming Languages and Paradigms
Lecture 6 C++ Programming
Programming in C Pointer Basics.
Pointers, Dynamic Data, and Reference Types
CSC215 Lecture Memory Management.
Dynamic Memory Allocation
Dynamic Memory Allocation
Memory Allocation CS 217.
Programming in C Pointer Basics.
Pointers.
Dynamic Memory Allocation
EECE.2160 ECE Application Programming
C What you Know* Objective: To introduce some of the features of C. This assumes that you are familiar with C++ or java and concentrates on the features.
Programming in C Miscellaneous Topics.
Dynamic Memory Allocation (and Multi-Dimensional Arrays)
Programming in C Pointer Basics.
Programming in C Miscellaneous Topics.
Dynamic Allocation in C
EENG212 – Algorithms & Data Structures Fall 07/08 – Lecture Notes # 5b
EECE.2160 ECE Application Programming
Programming in C Pointers and Arrays.
Programming in C Pointer Basics.
2008/11/19: Lecture 18 CMSC 104, Section 0101 John Y. Park
Dynamic Memory – A Review
Pointers, Dynamic Data, and Reference Types
Classes and Objects Object Creation
EECE.2160 ECE Application Programming
EECE.2160 ECE Application Programming
Module 13 Dynamic Memory.
Presentation transcript:

Programming in C Advanced Pointers

Reminder You can’t use a pointer until it points to something Just declaring a variable to be a pointer is not enough char *name; /* pointer declaration */ strcpy(name, “bobby”); scanf( “%s”, name); printf( “%s\n”, name); CMSC 313

Pointers to Pointers Since a pointer is a variable type, a pointer may point to another pointer. Consider the following declarations int age = 42; /* an int */ int *pAge = &age; /* a pointer to an int */ int **ppAge = &pAge; /* a pointer to a pointer to an int */ Draw a memory picture of these variable and their relationships What type and what value do each of the following represent? age, pAge, ppAge, *pAge, *ppAge, **ppAge CMSC 313

pointers2pointer.c int main ( ) { /* a double, a pointer to double, ** and a pointer to a pointer to a double */ double gpa = 3.25, *pGpa, **ppGpa; /* make pgpa point to the gpa */ pGpa = &gpa; /* make ppGpa point to pGpa (which points to gpa) */ ppGpa = &pGpa; // what is the output from this printf statement? printf( "%0.2f, %0.2f, %0.2f", gpa, *pGpa, **ppGpa); return 0; } 3.25, 3.25, 3.25 CMSC 313

Pointers to struct /* define a struct for related student data */ typedef struct student { char name[50]; char major [20]; double gpa; } STUDENT; STUDENT bob = {"Bob Smith", "Math", 3.77}; STUDENT sally = {"Sally", "CSEE", 4.0}; STUDENT *pStudent; /* pStudent is a "pointer to struct student" */ /* make pStudent point to bob */ pStudent = &bob; /* use -> to access the members */ printf ("Bob's name: %s\n", pStudent->name); printf ("Bob's gpa : %f\n", pStudent->gpa); /* make pStudent point to sally */ pStudent = &sally; printf ("Sally's name: %s\n", pStudent->name); printf ("Sally's gpa: %f\n", pStudent->gpa); CMSC 313

Pointer in a struct The data member of a struct can be any data type, including pointer. The struct person has a pointer to a struct name. #define FNSIZE 50 #define LNSIZE 40 typedef struct name { char first[ FNSIZE + 1 ]; char last [ LNSIZE + 1 ]; } NAME; typedef struct person NAME *pName; // pointer to NAME struct int age; double gpa; } PERSON; CMSC 313

Pointer in a struct (2) Given the declarations below, how do we access bob’s name, last name, and first name? Draw a picture of memory represented by these declarations NAME bobsName = {“Bob”, “Smith”}; PERSON bob; bob.age = 42; bob.gpa = 3.4; bob.pName = &bobsName; CMSC 313

Self-referencing structs Powerful data structures can be created when a data member of a struct is a pointer to a struct of the same kind. The simple example on the next slide illustrates the technique. CMSC 313

teammates.c typedef struct player { char name[20]; struct player *teammate; /* can’t use TEAMMATE yet */ } TEAMMATE; TEAMMATE *team, bob, harry, john; team = &bob; /* first player */ strncpy(bob.name, “bob”, 20); bob.teammate = &harry; /* next teammate */ strncpy(harry.name, “harry”, 20); harry.teammate = &john; /* next teammate */ strncpy(john.name, “bill”, 20); john.teammate = NULL: /* last teammate */ CMSC 313

teammates.c (cont’d) /* typical code to print a (linked) list */ /* follow the teammate pointers until ** NULL is encountered */ // start with first player TEAMMATE *t = team; // while there are more players... while (t != NULL) { printf(“%s\n”, t->name); // next player t = t->teammate; } CMSC 313

Dynamic Memory C allows us to allocate memory in which to store data during program execution. Dynamic memory has two primary applications Dynamically allocating an array based on some user input or file data Better than guessing and defining the array size in our code since it can’t be changed Dynamically allocating structs to hold data in some predetermined arrangement (a data stucture) Allows an “infinite” amount of data to be stored CMSC 313

Dynamic Memory Functions These functions are used to allocate and free dynamically allocated heap memory and are part of the standard C library. To use these functions, include <stdlib.h> . void *malloc( size_t nrBytes ); Returns a pointer to dynamically allocated memory on the heap of size nrBytes, or NULL if the request cannot be satisfied. The memory is uninitialized. void *calloc( int nrElements, size_t nrBytes ); Same as malloc( ), but the memory is initialized to zero Note that the parameter list is different void *realloc( void *p, size_t nrBytes); Changes the size of the memory pointed to by p to nrBytes. The contents will be unchanged up to the minimum of the old and new size. If the new size is larger, the new space is uninitialized. Returns a pointer to the new memory, or NULL if request cannot be satisfied in which case *p is unchanged. void free( void *p ) Deallocates the memory pointed to by p which must point to memory previously allocated by calling one of the functions above. Does nothing if p is NULL. CMSC 313

void* and size_t The void* type is C’s generic pointer. It may point to any kind of variable, but may not be dereferenced. Any other pointer type may be converted to void* and back again without loss of information. void* is often used as parameter types to, and return types from, library functions. size_t is an unsigned integral type that should be used (rather than int) when expressing “the size of something” (e.g. an int, array, string, or struct). It too is often used as a parameter to, or return type from, library functions. By definition, size_t is the type that is returned from the sizeof( ) operator. CMSC 313

malloc( ) for arrays malloc( ) returns a void pointer to uninitialized memory. Good programming practice is to cast the void* to the appropriate pointer type. Note the use of sizeof( ) for portable coding. As we’ve seen, the pointer can be used as an array name. int *p = (int *)malloc( 42 * sizeof(int)); for (k = 0; k < 42; k++) p[ k ] = k; printf(“%d\n”, p[ k ]; Exercise: rewrite this code using p as a pointer rather than an array name CMSC 313

calloc( ) for arrays calloc( ) returns a void pointer to memory that is initialized to zero. Note that the parameters to calloc( ) are different than the parameters for malloc( ) int *p = (int *)calloc( 42, sizeof(int)); for (k = 0; k < 42; k++) printf(“%d\n”, p[k]); Exercise: rewrite this code using p as a pointer rather than an array name CMSC 313

realloc( ) realloc( ) changes the size of a dynamically allocated memory previously created by malloc( ) or calloc( ) and returns a void pointer to the new memory The contents will be unchanged up to the minimum of the old and new size. If the new size is larger, the new space is uninitialized. int *p = (int *)malloc( 42 * sizeof(int)); for (k = 0; k < 42; k++) p[ k ] = k; p = (int *_)realloc( p, 99 * sizeof(int)); printf( “p[ %d ] = %d\n”, k, p[k]); for (k = 0; k < 99; k++) p[ k ] = k * 2; printf(“p[ %d ] = %d\n”, k, p[k]); CMSC 313

Testing the returned pointer malloc( ), calloc( ) and realloc( ) all return NULL if unable to fulfill the requested memory allocation. Good programming practice dictates that the pointer returned should be validated char *cp = malloc( 22 * sizeof( char ) ); if (cp == NULL) { fprintf( stderr, “malloc failed\n); exit( -12 ); } CMSC 313

assert( ) Since dynamic memory allocation shouldn’t fail unless there is a serious programming mistake, such failures are often fatal. Rather than using ‘if’ statements to check the return values from malloc( ), we can use the assert( ) function. To use assert( ), you must #include <assert.h> char *cp = malloc( 22 * sizeof( char ) ); assert( cp != NULL ); CMSC 313

How assert( ) works The parameter to assert is any Boolean expression -- assert( expression ); If the Boolean expression is true, nothing happens and execution continues on the next line If the Boolean expression is false, a message is output to stderr and your program terminates The message includes the name of the .c file and the line number of the assert( ) that failed assert( ) may be disabled with the preprocessor directive #define NDEBUG assert( ) may be used for any condition including Opening files Function parameter checking (preconditions) CMSC 313

free( ) free( ) is used to return dynamically allocated memory back to the heap to be reused by later calls to malloc( ), calloc( ) or realloc( ) The parameter to free( ) must be a pointer previously returned by one of malloc(), calloc() or realloc( ) Freeing a NULL pointer has no effect Failure to free memory is known as a “memory leak” and may lead to program crash when no more heap memory is available int *p = (int *)calloc(42, sizeof(int)); /* code that uses p */ free( p ); CMSC 313

Dynamic Memory for structs In C typedef struct person { char name[ 51 ]; int age; double gpa; /* memory allocation */ PERSON *pbob = (PERSON *)malloc(sizeof(PERSON)); pbob->age = 42; pbob->gpa = 3.5; strcpy( pbob->name, “bob”); ... /* explicitly freeing the memory */ free( pbob ); In JAVA public class Person { public int age; public double gpa; } // memory allocation Person bob = new Person( ); bob.age = 42; bob.gpa = 3.5; // bob is eventually freed // by garbage collector CMSC 313

Dynamic Teammates typedef struct player { char name[20]; struct player *teammate; } PLAYER; PLAYER *getPlayer( ) char *name = askUserForPlayerName( ); PLAYER *p = (PLAYER *)malloc(sizeof(PLAYER)); strncpy( p->name, name, 20 ); p->teammate = NULL; return p; } CMSC 313

Dynamic Teammates (2) int main ( ) { int nrPlayers, count = 0; PLAYER *pPlayer, *pTeam = NULL; nrPlayers = askUserForNumberOfPlayers( ); while (count < nrPlayers) pPlayer = getPlayer( ); pPlayer->teammate = pTeam; pTeam = pPlayer; ++count; } /* do other stuff with the PLAYERs */ /* Exercise -- write code to free ALL the PLAYERs */ return 0; CMSC 313

Dynamic Arrays As we noted, arrays cannot be returned from functions However, pointers to dynamically allocated arrays may be returned char *getCharArray( int size ) { char *cp = (char *)malloc( size * sizeof(char)); assert( cp != NULL); return cp; } CMSC 313