BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

529Automatic storage duration on the stack
530Stack frame lifecycle and local variables
531Understanding stack overflow
532Introduction to the Heap segment
533Manual vs automatic memory management
534Scope of heap-allocated data
535Stack pointers vs Heap pointers
536Header file stdlib.h for allocation
537The malloc function signature
538Calculating size with sizeof
539Checking for NULL return values
540Casting malloc return in C vs C++
541The free function signature
542Why freeing NULL is safe
543Contiguous allocation with calloc
544Difference between malloc and calloc
545Zero-initialization overhead
546Resizing blocks with realloc
547Handling realloc failure safely
548Reallocating to a smaller size
549Using realloc as malloc or free
550Definition of a memory leak
551Losing the last pointer to a block
552Leaking in loops and recursion
553The 'Free after use' rule
554Double-freeing a pointer
555Invalid pointer increments before free
556Impact of leaks on long-running processes
557What is a dangling pointer
558Returning addresses of local variables
559Setting pointers to NULL after free
560Reading from uninitialized memory
561Heap buffer overflows
562Use-after-free vulnerabilities
563Out-of-bounds array access on heap
564Installing Valgrind Memcheck
565Running a program under Valgrind
566Reading 'definitely lost' reports
567Identifying 'indirectly lost' memory
568Finding invalid reads and writes
569Detecting uninitialized value usage
570Suppressing known tool warnings
571CPU word size and alignment
572The alignof operator
573Struct padding for alignment
574Performance cost of unaligned access
575Manual padding in structures
576The aligned_alloc function
577Using __attribute__((packed))
578Motivation for custom allocators
579Building a simple free list
580Managing a static memory pool
581The concept of memory fragmentation
582Internal vs External fragmentation
583Allocation strategies: First-fit
584Allocation strategies: Best-fit
585What is a Memory Arena
586Linear or Bump allocators
587Resetting an arena in one step
588Arena allocation for frame-based tasks
589Handling alignment within an arena
590Growing an arena with virtual memory
591Trade-offs of arena vs malloc
592Introduction to brk and sbrk
593Using mmap for large allocations
594Anonymous memory mappings
595Memory protection constants (PROT_READ)
596The munmap function
597Virtual memory pages and offsets
598Page faults and resident set size

529Automatic storage duration on the stack
530Stack frame lifecycle and local variables
531Understanding stack overflow
532Introduction to the Heap segment
533Manual vs automatic memory management
534Scope of heap-allocated data
535Stack pointers vs Heap pointers
536Header file stdlib.h for allocation
537The malloc function signature
538Calculating size with sizeof
539Checking for NULL return values
540Casting malloc return in C vs C++
541The free function signature
542Why freeing NULL is safe
543Contiguous allocation with calloc
544Difference between malloc and calloc
545Zero-initialization overhead
546Resizing blocks with realloc
547Handling realloc failure safely
548Reallocating to a smaller size
549Using realloc as malloc or free
550Definition of a memory leak
551Losing the last pointer to a block
552Leaking in loops and recursion
553The 'Free after use' rule
554Double-freeing a pointer
555Invalid pointer increments before free
556Impact of leaks on long-running processes
557What is a dangling pointer
558Returning addresses of local variables
559Setting pointers to NULL after free
560Reading from uninitialized memory
561Heap buffer overflows
562Use-after-free vulnerabilities
563Out-of-bounds array access on heap
564Installing Valgrind Memcheck
565Running a program under Valgrind
566Reading 'definitely lost' reports
567Identifying 'indirectly lost' memory
568Finding invalid reads and writes
569Detecting uninitialized value usage
570Suppressing known tool warnings
571CPU word size and alignment
572The alignof operator
573Struct padding for alignment
574Performance cost of unaligned access
575Manual padding in structures
576The aligned_alloc function
577Using __attribute__((packed))
578Motivation for custom allocators
579Building a simple free list
580Managing a static memory pool
581The concept of memory fragmentation
582Internal vs External fragmentation
583Allocation strategies: First-fit
584Allocation strategies: Best-fit
585What is a Memory Arena
586Linear or Bump allocators
587Resetting an arena in one step
588Arena allocation for frame-based tasks
589Handling alignment within an arena
590Growing an arena with virtual memory
591Trade-offs of arena vs malloc
592Introduction to brk and sbrk
593Using mmap for large allocations
594Anonymous memory mappings
595Memory protection constants (PROT_READ)
596The munmap function
597Virtual memory pages and offsets
598Page faults and resident set size

Lesson 590 of 1,219·8. Memory ManagementPro lesson

Growing an arena with virtual memory

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course