Skip to content
GitLab

storage · Changes

Page history
Edit Commentary/Rts/Storage authored by Simon Marlow's avatar Simon Marlow
Hide whitespace changes
Inline Side-by-side
commentary/rts/storage.md
View page @ 80618cc9
CONVERSION ERROR
Error: HttpError (HttpExceptionRequest Request {
host = "ghc.haskell.org"
port = 443
secure = True
requestHeaders = []
path = "/trac/ghc/wiki/Commentary/Rts/Storage"
queryString = "?version=7"
method = "GET"
proxy = Nothing
rawBody = False
redirectCount = 10
responseTimeout = ResponseTimeoutDefault
requestVersion = HTTP/1.1
}
(StatusCodeException (Response {responseStatus = Status {statusCode = 403, statusMessage = "Forbidden"}, responseVersion = HTTP/1.1, responseHeaders = [("Date","Sun, 10 Mar 2019 06:57:48 GMT"),("Server","Apache/2.2.22 (Debian)"),("Strict-Transport-Security","max-age=63072000; includeSubDomains"),("Vary","Accept-Encoding"),("Content-Encoding","gzip"),("Content-Length","260"),("Content-Type","text/html; charset=iso-8859-1")], responseBody = (), responseCookieJar = CJ {expose = []}, responseClose' = ResponseClose}) "<!DOCTYPE HTML PUBLIC \"-//IETF//DTD HTML 2.0//EN\">\n<html><head>\n<title>403 Forbidden</title>\n</head><body>\n<h1>Forbidden</h1>\n<p>You don't have permission to access /trac/ghc/wiki/Commentary/Rts/Storage\non this server.</p>\n<hr>\n<address>Apache/2.2.22 (Debian) Server at ghc.haskell.org Port 443</address>\n</body></html>\n"))
Original source:
```trac
= GHC Commentary: The Storage Manager =
GHC's storage manager is designed to be quite flexible: there are a large number of tunable parameters in the garbage collector, and partly the reason for this was because we wanted to experiment with tweaking these settings in the context of Haskell.
[[Image(sm-top.png)]]
== The Block Allocator ==
Source: [[GhcFile(includes/Block.h)]], [[GhcFile(rts/BlockAlloc.h)]], [[GhcFile(rts/BlockAlloc.c)]], [[GhcFile(rts/MBlock.h)]], [[GhcFile(rts/MBlock.c)]].
The block allocator is where the storage manager derives much of its flexibilty. Rather than keep our heap in a single contiguous region of memory, or one contiguous region per generation, we manage linked lists of memory blocks. Managing contiguous regions is difficult, especially when you want to change the size of some of the areas. A block-structured storage arrangement has several advantages:
* resizing areas of memory is easy: just chain more blocks onto the list.
* managing large objects without copying is easy: allocate each one a complete block, and use the block linkage to
chain them together.
* free memory can be recycled faster, because a block is a block.
The concept relies on the property that most data objects are significantly smaller than a block, and only rarely do we need to allocate objects that approach or exceed the size of a block.
=== Structure of blocks ===
We want to allocate memory in units of a small block (around 4k, say). Furthermore, we want each block to have an associated small structure called a ''block descriptor'', which contains information about the block: its link field, which generation it belongs to, and so on. This is similar to the well-known "BiBOP" (Big Bag of Pages) technique, where objects with similar tags are collected together on a page so as to avoid needing to store an individual tag with each object.
We want a function `Bdescr(p)`, that, given an arbitrary pointer into a block, returns the address of the block descriptor that corresponds to the block containing that pointer.
There are two options:
* Put the block descriptor at the start of the block. `Bdescr(p) = p & ~BLOCK_SIZE`. This option has problems if
we need to allocate a contiguous region larger than a single block (GHC does this occasionally when allocating
a large number of objects in one go).
* Allocate memory in larger units (a ''megablock''), divide the megablock into blocks, and put all the block
descriptors at the beginning. The megablock is aligned, so that the address of the block descriptor for
a block is a simple function of its address. The 'Bdescr' function is more complicated than the first
method, but it is easier to allocate contiguous regions (unless the contiguous region is larger than
a megablock...).
We adopt the second approach. The following diagram shows a megablock:
[[Image(sm-block.png)]]
We currently have megablocks of 1Mb in size (m = 20) with blocks of 4k in size (k = 12), and these sizes are easy to change ([[GhcFile(includes/Constants.h)]]).
Block descriptors are currently 32 or 64 bytes depending on the word size (d = 5 or 6). The block descriptor itself is
the structure `bdescr` defined in [[GhcFile(includes/Block.h)]], and that file also defines the `Bdescr()` macro.
The block allocator has a the following structure:
* At the bottom, talking to the OS, is the megablock allocator ([[GhcFile(rts/MBlock.c)]], [[GhcFile(rts/MBlock.h)]]).
It is responsible for delivering megablocks, correctly aligned, to the upper layers. It is also responsible for
implementing `HEAP_ALLOCED()`: the predicate that tests whether a pointer points to dynamically allocated memory
or not. This is implemented as a simple bitmap lookup on a 32-bit machine, and something more complex on
64-bit addressed machines. See [[GhcFile(rts/MBlock.h)]] for details.
[[br]][[br]]
Currently, megablocks are never freed back to the OS, except at the end of the program. This is a potential
improvement that could be made.
* Sitting on top of the megablock allocator is the block layer ([[GhcFile(includes/Block.h)]], [[GhcFile(rts/BlockAlloc.c)]]).
This layer is responsible for providing:
{{{
void *allocGroup(int)
void freeGroup(void *)
}}}
These functions allocate and deallocate a block ''group'': a contiguous sequence of blocks (the degenerate, and common, case
is a single block). The block allocator is responsible for keeping track of free blocks. Currently it does this by
maintaining an ordered (by address) list of free blocks, with contiguous blocks coallesced. However this is certanly
not optimal, and has been shown to be a bottleneck in certain cases - improving this allocation scheme would be good.
== The Garbage Collector ==
=== Copying Collection ===
=== Compacting Collection ===
```
# GHC Commentary: The Storage Manager
GHC's storage manager is designed to be quite flexible: there are a large number of tunable parameters in the garbage collector, and partly the reason for this was because we wanted to experiment with tweaking these settings in the context of Haskell.
[](/trac/ghc/attachment/wiki/Commentary/Rts/Storage/sm-top.png)
- [Layout of Heap Objects](commentary/rts/storage/heap-objects)
- [Layout of the Stack](commentary/rts/storage/stack)
- [Slop](commentary/rts/storage/slop)
- [The Block Allocator](commentary/rts/storage/block-alloc)
- [The Garbage Collector](commentary/rts/storage/gc)
- [Garbage Collecting CAFs](commentary/rts/storage/ca-fs)
## The Block Allocator
Source: [includes/Block.h](/trac/ghc/browser/ghc/includes/Block.h), [rts/BlockAlloc.h](/trac/ghc/browser/ghc/rts/BlockAlloc.h), [rts/BlockAlloc.c](/trac/ghc/browser/ghc/rts/BlockAlloc.c), [rts/MBlock.h](/trac/ghc/browser/ghc/rts/MBlock.h), [rts/MBlock.c](/trac/ghc/browser/ghc/rts/MBlock.c).
The block allocator is where the storage manager derives much of its flexibilty. Rather than keep our heap in a single contiguous region of memory, or one contiguous region per generation, we manage linked lists of memory blocks. Managing contiguous regions is difficult, especially when you want to change the size of some of the areas. A block-structured storage arrangement has several advantages:
- resizing areas of memory is easy: just chain more blocks onto the list.
- managing large objects without copying is easy: allocate each one a complete block, and use the block linkage to
chain them together.
- free memory can be recycled faster, because a block is a block.
The concept relies on the property that most data objects are significantly smaller than a block, and only rarely do we need to allocate objects that approach or exceed the size of a block.
### Structure of blocks
We want to allocate memory in units of a small block (around 4k, say). Furthermore, we want each block to have an associated small structure called a *block descriptor*, which contains information about the block: its link field, which generation it belongs to, and so on. This is similar to the well-known "BiBOP" (Big Bag of Pages) technique, where objects with similar tags are collected together on a page so as to avoid needing to store an individual tag with each object.
We want a function `Bdescr(p)`, that, given an arbitrary pointer into a block, returns the address of the block descriptor that corresponds to the block containing that pointer.
There are two options:
- Put the block descriptor at the start of the block. `Bdescr(p) = p & ~BLOCK_SIZE`. This option has problems if
we need to allocate a contiguous region larger than a single block (GHC does this occasionally when allocating
a large number of objects in one go).
- Allocate memory in larger units (a *megablock*), divide the megablock into blocks, and put all the block
descriptors at the beginning. The megablock is aligned, so that the address of the block descriptor for
a block is a simple function of its address. The 'Bdescr' function is more complicated than the first
method, but it is easier to allocate contiguous regions (unless the contiguous region is larger than
a megablock...).
We adopt the second approach. The following diagram shows a megablock:
not handled: Image
We currently have megablocks of 1Mb in size (m = 20) with blocks of 4k in size (k = 12), and these sizes are easy to change ([includes/Constants.h](/trac/ghc/browser/ghc/includes/Constants.h)).
Block descriptors are currently 32 or 64 bytes depending on the word size (d = 5 or 6). The block descriptor itself is
the structure `bdescr` defined in [includes/Block.h](/trac/ghc/browser/ghc/includes/Block.h), and that file also defines the `Bdescr()` macro.
The block allocator has a the following structure:
- At the bottom, talking to the OS, is the megablock allocator ([rts/MBlock.c](/trac/ghc/browser/ghc/rts/MBlock.c), [rts/MBlock.h](/trac/ghc/browser/ghc/rts/MBlock.h)).
It is responsible for delivering megablocks, correctly aligned, to the upper layers. It is also responsible for
implementing `HEAP_ALLOCED()`: the predicate that tests whether a pointer points to dynamically allocated memory
or not. This is implemented as a simple bitmap lookup on a 32-bit machine, and something more complex on
64-bit addressed machines. See [rts/MBlock.h](/trac/ghc/browser/ghc/rts/MBlock.h) for details.
Currently, megablocks are never freed back to the OS, except at the end of the program. This is a potential
improvement that could be made.
- Sitting on top of the megablock allocator is the block layer ([includes/Block.h](/trac/ghc/browser/ghc/includes/Block.h), [rts/BlockAlloc.c](/trac/ghc/browser/ghc/rts/BlockAlloc.c)).
This layer is responsible for providing:
```wiki
void *allocGroup(int)
void freeGroup(void *)
```
These functions allocate and deallocate a block *group*: a contiguous sequence of blocks (the degenerate, and common, case
is a single block). The block allocator is responsible for keeping track of free blocks. Currently it does this by
maintaining an ordered (by address) list of free blocks, with contiguous blocks coallesced. However this is certanly
not optimal, and has been shown to be a bottleneck in certain cases - improving this allocation scheme would be good.
## The Garbage Collector
### Copying Collection
### Compacting Collection
\ No newline at end of file