Chapter 15Memory Management MechanicsPaid chapter

The Allocator — Size Classes, the Tiny Allocator, and Scan vs Noscan

Understand how mallocgc places objects: size-class rounding, the tiny allocator, and why pointer-free allocations are cheaper for the GC — connecting allocation (Part I) to GC cost (Chapter 16).

Launch paywall

This chapter is part of the paid launch. The preview stays visible so readers can evaluate the exact scope before buying.

Included in

Core and Complete. Complete also includes the practical exam and free Go-version updates.

Preview

What this chapter teaches

Common belief

Allocating N bytes uses N bytes, and all allocations cost the GC the same.

What actually happens

mallocgc rounds every request up to a fixed size class, batches tiny pointer-free objects, and marks pointer-free (noscan) memory far more cheaply than pointer-containing memory.

Mechanisms covered
The tiny allocator packs multiple small (<16 B) pointer-free allocations into one block, reducing both allocation count and overhead.
Spans are marked scan or noscan. The GC must scan pointer-containing objects for references; pointer-free objects (e.g., []byte, []int) are noscan and skipped during marking — so they impose far less GC mark cost.
experimentbenchtrace
One-time purchase

Unlock Chapter 15 and the rest of the course.

Core unlocks every paid chapter and lab. Complete also includes the practical exam and future Go-version updates.

Core
$49

Full course access with the complete mechanics curriculum.

All paid chapters unlocked
One-time purchase
Perfect if you want the material only
Complete
$79
Best value

Best-value launch option with the exam and free Go-version course updates.

Everything in Core
Black Belt practical exam
Free Go-version updates

No subscription or account required. Access is tied to the email entered at Stripe Checkout and can be restored by email.

Free chapter
Escape Analysis — The Compiler's Fragile Decision
Understand how the compiler decides between stack and heap allocation, why the decision is fragile, and how to verify it.
Free chapter
Maps — Swiss Tables, Growth, and Permanent Memory
Understand the Go 1.24+ Swiss Table map layout, why maps don't shrink, and how to design for memory reclamation.