diff options
author | Josh Meredith <joshmeredith2008@gmail.com> | 2019-12-04 23:39:28 +1100 |
---|---|---|
committer | Josh Meredith <joshmeredith2008@gmail.com> | 2019-12-04 23:39:28 +1100 |
commit | a8435165b84c32fd2ebdd1281dd6ee077e07ad5a (patch) | |
tree | 791936d014aeaa26174c2dcbef34c14f3329dd04 /rts/linker/M32Alloc.c | |
parent | 7805441b4d5e22eb63a501e1e40383d10380dc92 (diff) | |
parent | f03a41d4bf9418ee028ecb51654c928b2da74edd (diff) | |
download | haskell-a8435165b84c32fd2ebdd1281dd6ee077e07ad5a.tar.gz |
Merge branch 'master' into wip/binary-readerTwip/binary-readerT
Diffstat (limited to 'rts/linker/M32Alloc.c')
-rw-r--r-- | rts/linker/M32Alloc.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/rts/linker/M32Alloc.c b/rts/linker/M32Alloc.c index dbba711df4..148a5043cf 100644 --- a/rts/linker/M32Alloc.c +++ b/rts/linker/M32Alloc.c @@ -96,7 +96,7 @@ life-cycle it is in: allocation) Allocation (in the case of a small request) consists of walking the nursery to -find a page that will accomodate the request. If none exists then we allocate a +find a page that will accommodate the request. If none exists then we allocate a new nursery page (flushing an existing one to the filled list if the nursery is full). |