1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#include <stdio.h>
#include <stdlib.h>

// EXAMPLE from Section 2 (12:30pm) - part 2

int main(int argc, char* argv[]) {
    int n = 2;
    char* s = malloc(n * sizeof(*s));
    s[0] = '!';
    s[1] = 'F';

    int* a_n = &n;
    int* a_m = malloc( sizeof(*a_m) );
    *a_m = 5;
    *a_n = *a_m; // printf("*a_m == %d\n", *a_m);
    // *a_n = 5; // store 5 at address a_n
    *a_m = *a_n; // printf("*a_n == %d\n", *a_n);

    a_n  = a_m;  // After this, a_n is an address on the heap

    free(a_n);   // WILL THIS WORK????????????   YES  ... like free(402)
    free(a_m);   // OKAY?????  NO, because this is like free(402)
    // Either one is fine.  Do not free same block twice.

    // OOPS.... forgot to free s!!!!
        
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */

© Copyright 2019 Alexander J. Quinn         This content is protected and may not be shared, uploaded, or distributed.