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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#define log_int(n) printf("%s == %d\n", #n, n)
#define log_long(n) printf("%s == %ld\n", #n, n)
#define log_addr(n) printf("%s == %p\n", #n, (void*)(n))
int main(int argc, char* argv[]) {
// address of a stack allocated int
int n = 9;
int* a_stack_num = &n;
log_int(*a_stack_num);
log_addr(a_stack_num);
// use malloc to make a heal allocated int
int* a_heap_num = malloc(sizeof(*a_heap_num));
*a_heap_num = 10;
log_int(*a_heap_num);
log_addr(a_heap_num);
free(a_heap_num);
// for safety: make sure I do not accidently use
// a_heap_num after I freed it
a_heap_num = NULL;
// BAD CODE QUALITY 1: malloc with type
// if I change the type, malloc does not auto update
//int* a_heap_num = malloc(sizeof(int));
// BAD CODE QUALITY 2: constant type
// always use sizeof, even if you know the size
//int* a_heap_num = malloc(4);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2023 Alexander J. Quinn, David J. Burnett This content is protected and may not be shared, uploaded, or distributed.