🚀 go-pugleaf

"(A handle is a pointer to a pointer; it is
used for memory management purposes)"

It's more than just a pointer to a pointer. A handle's a pointer to a "master 
pointer", that points to a relocatable block in the Mac's heap. The memory 
manager can move this relocatable block at its leisure (unless the application 
explicitly requests that it stay in one place), and whenever it moves this 
relocatable block, it simply updates the master pointer. Since the pointer in 
your program always points to this master pointer, doing a double indirection 
will always get you to your data.

It's also worth noting that these master pointers aren't randomly scattered 
through memory, either; they're grouped into "master pointer blocks"; in the 
system heap, a master pointer block contains 32 master pointers; in the 
application heap, a master ptr block contains 64 master pointers.

In a Unix environment, I suspect, the memory management is not based on 
relocatable chunks of memory; rather, chunks are swapped in and out, and the 
memory manager keeps track of where they get swapped to and never moves them. 
(This is known as demand paging, I think.)

I don't know how small non-Unix 68000 systems behave. On the Intel machines 
such as the IBM PC, the memory is "segmented" into 64K pages. I'm not sure how 
dynamic memory management is handled, though...

		--Rich