a couple of typos.

Submitted by:	 wosch
This commit is contained in:
Poul-Henning Kamp 1996-09-29 18:36:13 +00:00
parent ece15d78ea
commit 8e537d1686
Notes: svn2git 2020-12-20 02:59:44 +00:00
svn path=/head/; revision=18568
2 changed files with 4 additions and 4 deletions

View File

@ -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

View File

@ -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