diff options
| author | phk <phk@FreeBSD.org> | 1996-09-29 18:36:13 +0000 |
|---|---|---|
| committer | phk <phk@FreeBSD.org> | 1996-09-29 18:36:13 +0000 |
| commit | 2f23ae9a7581d107dcf834182927fa39d9d8c194 (patch) | |
| tree | 08a20d9981f9fe30bbd809096b93eded9211002b /share/doc/papers | |
| parent | 1f72e7838967343b8e4780d6d3e5cb6913599344 (diff) | |
| download | FreeBSD-src-2f23ae9a7581d107dcf834182927fa39d9d8c194.zip FreeBSD-src-2f23ae9a7581d107dcf834182927fa39d9d8c194.tar.gz | |
a couple of typos.
Submitted by: wosch
Diffstat (limited to 'share/doc/papers')
| -rw-r--r-- | share/doc/papers/malloc/implementation.ms | 4 | ||||
| -rw-r--r-- | share/doc/papers/malloc/malloc.ms | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/share/doc/papers/malloc/implementation.ms b/share/doc/papers/malloc/implementation.ms index 3aba2c4..3641191 100644 --- a/share/doc/papers/malloc/implementation.ms +++ b/share/doc/papers/malloc/implementation.ms @@ -6,7 +6,7 @@ .\" this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp .\" ---------------------------------------------------------------------------- .\" -.\" $Id$ +.\" $Id: implementation.ms,v 1.1 1996/04/13 08:30:13 phk Exp $ .\" .ds RH Implementation .NH @@ -28,7 +28,7 @@ The value can be one of: .B MALLOC_NOT_MINE Another part of the code may call brk(2) to get a piece of the cake. Consequently we cannot rely on the memory we get from the kernel to -be one consequtive piece of memory and therefore we need a way to +be one consecutive piece of memory and therefore we need a way to mark such pages as "untouchable". .IP .B MALLOC_FREE diff --git a/share/doc/papers/malloc/malloc.ms b/share/doc/papers/malloc/malloc.ms index 0deb7ec..0bc40d9 100644 --- a/share/doc/papers/malloc/malloc.ms +++ b/share/doc/papers/malloc/malloc.ms @@ -6,7 +6,7 @@ .\" this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp .\" ---------------------------------------------------------------------------- .\" -.\" $Id$ +.\" $Id: malloc.ms,v 1.1 1996/04/13 08:30:17 phk Exp $ .\" .ds RH Malloc and free .NH @@ -50,7 +50,7 @@ put the small structure used to contain the next and previous pointers plus the state of the chunk right before the chunk itself. .PP As a matter of fact, the canonical malloc(3) implementation can be -studied in the ``Old testament'', chapter 8 verse 7 [Kernigan & Richie] +studied in the ``Old testament'', chapter 8 verse 7 [Kernighan & Rich ie] .PP Various optimisations can be applied to the above basic algorithm: .IP |
