| implementation.ms (15230) | implementation.ms (18568) |
|---|---|
| 1.\" 2.\" ---------------------------------------------------------------------------- 3.\" "THE BEER-WARE LICENSE" (Revision 42): 4.\" <phk@login.dknet.dk> wrote this file. As long as you retain this notice you 5.\" can do whatever you want with this stuff. If we meet some day, and you think 6.\" this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp 7.\" ---------------------------------------------------------------------------- 8.\" | 1.\" 2.\" ---------------------------------------------------------------------------- 3.\" "THE BEER-WARE LICENSE" (Revision 42): 4.\" <phk@login.dknet.dk> wrote this file. As long as you retain this notice you 5.\" can do whatever you want with this stuff. If we meet some day, and you think 6.\" this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp 7.\" ---------------------------------------------------------------------------- 8.\" |
| 9.\" $Id$ | 9.\" $Id: implementation.ms,v 1.1 1996/04/13 08:30:13 phk Exp $ |
| 10.\" 11.ds RH Implementation 12.NH 13Implementation 14.PP 15A new malloc(3) implementation was written to meet the goals, 16and to the extent possible to address the shortcomings listed previously. 17.PP --- 5 unchanged lines hidden (view full) --- 23which contains a 24.B void* 25for each page we have control over. 26The value can be one of: 27.IP 28.B MALLOC_NOT_MINE 29Another part of the code may call brk(2) to get a piece of the cake. 30Consequently we cannot rely on the memory we get from the kernel to | 10.\" 11.ds RH Implementation 12.NH 13Implementation 14.PP 15A new malloc(3) implementation was written to meet the goals, 16and to the extent possible to address the shortcomings listed previously. 17.PP --- 5 unchanged lines hidden (view full) --- 23which contains a 24.B void* 25for each page we have control over. 26The value can be one of: 27.IP 28.B MALLOC_NOT_MINE 29Another part of the code may call brk(2) to get a piece of the cake. 30Consequently we cannot rely on the memory we get from the kernel to |
| 31be one consequtive piece of memory and therefore we need a way to | 31be one consecutive piece of memory and therefore we need a way to |
| 32mark such pages as "untouchable". 33.IP 34.B MALLOC_FREE 35This is a free page. 36.IP 37.B MALLOC_FIRST 38This is the first page in a (multi-)page allocation. 39.IP --- 183 unchanged lines hidden --- | 32mark such pages as "untouchable". 33.IP 34.B MALLOC_FREE 35This is a free page. 36.IP 37.B MALLOC_FIRST 38This is the first page in a (multi-)page allocation. 39.IP --- 183 unchanged lines hidden --- |