INITIALISING POINTER VARIABLES; DYNAMIC VARIABLES; OPERATIONS ON POINTERS

Size: px

Start display at page:

Download "INITIALISING POINTER VARIABLES; DYNAMIC VARIABLES; OPERATIONS ON POINTERS"

Felicity Walton
6 years ago
Views:

1 INITIALISING POINTER VARIABLES; DYNAMIC VARIABLES; OPERATIONS ON POINTERS Pages 792 to 800 Anna Rakitianskaia, University of Pretoria

2 INITIALISING POINTER VARIABLES Pointer variables are declared by putting an asterisk between data type and variable name: int *p; The contents of an uninitialised pointer are undefined Values:??? Initialise your pointers to 0 or NULL: int *p = 0; Address: 350 int *p // initialise a null pointer int *p = NULL; // same thing: NULL is a macro = 0 Values: 0 Address: 350 int *p

3 DYNAMIC VARIABLES Memory Stack Heap Static variables Memory allocated at compile time Maximum size must be known beforehand Dynamic variables Memory allocated at run time Use as much memory as you need, and return it back to the heap when done

4 OPERATOR NEW In C++, dynamic variables can be created using pointers and the operator new Operator new is used to allocate either a single variable, or an array of variables: new datatype; // single variable new datatype[size]; // an array of variables Variables allocated using new have no names, and must be assigned to a pointer variable: datatype *p = new datatype; int *p = new int; There is no direct access to the dynamically allocated memory you can only use it through pointer variables

5 OPERATOR NEW Consider: int *p; int x = 42; p = &x; And: int *p = new int; *p = 42; In both examples, pointer p points to a memory location that stores the value 42 In the first example, 42 is stored on the stack and can be accessed through x and *p In the second example, 42 is stored on the heap and can be accessed only through *p

6 OPERATOR DELETE All memory allocated using new must be manually de-allocated using delete The deallocated memory can be reused by allocating it to new variables Operator delete is used to deallocate both single variables and arrays of variables: int *ptrvar = new int; // allocate a single int delete ptrvar; // deallocate a single variable int *ptrarr = new int[x]; // allocate array delete [] ptrarr; // deallocate an array The delete operator does not delete the pointer it deletes (deallocates) the memory that the pointer points to

7 OPERATOR DELETE : DANGLING POINTERS The delete operator does not delete the pointer it deletes the memory that the pointer points to Before delete p; Address: After delete p; int * p 500??? Address: int * p The heap memory is free, but p still stores an address

8 OPERATOR DELETE : DANGLING POINTERS A pointer that points to an address that is no longer valid is called a dangling pointer If you use a dangling pointer, you will either corrupt data on the heap, or your program will crash To avoid dangling pointers, explicitly set your pointers to NULL after you delete them: delete p; // deallocate heap memory p = 0; // set p to NULL NULL??? Address: int *p

9 POINTERS & MEMORY LEAKS What happens if you don t delete pointers? void dosomething() { int *p = new int; *p = 42; } When you exit dosomething(), p goes out of scope However, the memory allocated to p remains allocated (reserved) it can not be reused by other variables Dynamically allocated memory can only be accessed through p When p goes out of scope, the memory is still allocated, but is inaccessible This is called a memory leak You will eventually run out of memory if you do this!

10 POINTERS & MEMORY LEAKS Loosing the address of dynamically allocated memory results in a memory leak: int x = 5; int *p = new int; // allocate memory p = &x; // old address lost, memory leak results Memory leak can also result from a double allocation: int *p = new int; // allocate memory p = new int; // allocate memory again // old address lost, memory leak results Make sure not to lose the addresses of dynamically allocated memory Provide a delete for every new

11 OPERATIONS ON POINTERS Assignment and relational operations are allowed on pointers: int *p, *q; // declare two pointers p = new int; *p = 3; q = p; // both q and p now point to // the same memory location Pointers can be compared: if(q == p) { // true if both q and p point to // the same memory location } else if(q!= p) { // true if q and p point to // different memory locations }

12 POINTER ARITHMETIC Integer addition and subtraction is allowed on pointers If p points to an integer, p + 1 is the address of the next integer in memory after p p - 1 is the address of the previous integer before p When calculating the result of a pointer arithmetic expression, the compiler always multiplies the integer operand by the size of the object being pointed to This is called scaling Eg., p++; increments the address stored in p by 4 bytes if p is an int pointer increments the address stored in p by 1 byte if p is a char pointer Pointer arithmetic is dangerous: if you don t know what you re doing, you might access memory of other variables, mess up the data, and make your program crash

13 QUESTION TIME Next lecture: Dynamic arrays Functions & pointers Shallow versus deep copy & pointers

DYNAMIC ARRAYS; FUNCTIONS & POINTERS; SHALLOW VS DEEP COPY

DYNAMIC ARRAYS; FUNCTIONS & POINTERS; SHALLOW VS DEEP COPY Pages 800 to 809 Anna Rakitianskaia, University of Pretoria STATIC ARRAYS So far, we have only used static arrays The size of a static array must