View source code
Display the source code in std/experimental/allocator/building_blocks/bitmapped_block.d from which this page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.
BitmappedBlock implements a simple heap consisting of one contiguous area
of memory organized in blocks, each of size
theBlockSize. A block is a unit
of allocation. A bitmap serves as bookkeeping data, more precisely one bit per
block indicating whether that block is currently allocated or not.
BitmappedBlock with additional structure for supporting
To that end,
BitmappedBlockWithInternalPointers adds a
bitmap (one bit per block) that marks object starts. The bitmap itself has
variable size and is allocated together with regular allocations.
|The threadsafe version of the
The semantics of the
SharedBitmappedBlock are identical to the regular