d/freebsd-nq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

typos

Browse Source
This commit is contained in:
Wolfram Schneider 1996-10-04 14:01:55 +00:00
parent 46a7b8131d
commit 30548b45b9
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
share/doc/papers/malloc/implementation.ms
View File

@ -6,7 +6,7 @@
.\" this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
.\" ----------------------------------------------------------------------------
.\"
.\" $Id: implementation.ms,v 1.1 1996/04/13 08:30:13 phk Exp $
.\" $Id: implementation.ms,v 1.2 1996/09/29 18:36:11 phk Exp $
.\"
.ds RH Implementation
.NH
@ -119,7 +119,7 @@ It's not that surprising after all, it's the difference between
following the crowd or actively directing where it can go, in both
ways you can end up in the middle of it all.
.PP
The sideffect of this compromise is that it also uses less storage,
The side effect of this compromise is that it also uses less storage,
and the list never has to be reordered, all the ordering happens when
pages are added or deleted.
.PP

4
share/doc/papers/malloc/malloc.ms
View File

@ -6,7 +6,7 @@
.\" this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
.\" ----------------------------------------------------------------------------
.\"
.\" $Id: malloc.ms,v 1.1 1996/04/13 08:30:17 phk Exp $
.\" $Id: malloc.ms,v 1.2 1996/09/29 18:36:13 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 [Kernighan & Rich ie]
studied in the ``Old testament'', chapter 8 verse 7 [Kernighan & Ritchie]
.PP
Various optimisations can be applied to the above basic algorithm:
.IP