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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#include <stddef.h>
typedef struct {
int* numbers;
size_t size;
} Integers;
Integers* malloc_integers(size_t size) {
Integers* a_numbers = malloc(sizeof(*a_numbers));
*a_numbers = (Integers) { .size = size };
a_numbers->numbers = malloc(sizeof(*(a_numbers->numbers)) * size);
return a_numbers;
}
int main(int argc, char* argv[]) {
Integers* a_numbers = malloc(sizeof(*a_numbers));
a_numbers->numbers = malloc(sizeof(*(a_numbers->numbers)) * 5);
a_numbers->size = 5;
a_numbers->numbers[0] = 100;
a_numbers->numbers[1] = 4314;
a_numbers->numbers[2] = 34123;
a_numbers->numbers[3] = 545;
a_numbers->numbers[4] = 75645;
for (int i = 0; i < a_numbers->size; i++) {
printf("array[%d] = %d\n", i, a_numbers->numbers[i]);
}
// first, free data inside the struct
free(a_numbers->numbers);
// finally, free the struct itself
free(a_numbers);
// do not try to free/access the data after the struct itself was freed
//free(a_numbers->numbers);
a_numbers = malloc_integers(2);
a_numbers->numbers[0] = 434;
a_numbers->numbers[1] = 765;
for (int i = 0; i < a_numbers->size; i++) {
printf("array[%d] = %d\n", i, a_numbers->numbers[i]);
}
free(a_numbers->numbers);
free(a_numbers);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2024 Alexander J. Quinn & David Burnett This content is protected and may not be shared, uploaded, or distributed.