Date: Mon, 18 Dec 2000 14:09:00 -0500 (EST)
From: "Richard B. Johnson" <[EMAIL PROTECTED]>
Well I just use free(), nothing more, nothing special, just like a
typical data-base program. Free should just set a new break
address after the reclaimed data falls below some watermarks it
On Mon, 18 Dec 2000, David S. Miller wrote:
>Date: Mon, 18 Dec 2000 13:54:56 -0500 (EST)
>From: "Richard B. Johnson" <[EMAIL PROTECTED]>
>
>6/ Deallocates all the buffers by running down the linked-list.
>
> ...
>
>If the program deallocates all the buffers, as in (6) abo
Date:Mon, 18 Dec 2000 13:54:56 -0500 (EST)
From: "Richard B. Johnson" <[EMAIL PROTECTED]>
6/ Deallocates all the buffers by running down the linked-list.
...
If the program deallocates all the buffers, as in (6) above, it will
take even up to 1 whole minute!! At this t
I have some memory-checker software. I will put it on my
server if anybody is interested.
I have discovered a VM performance problem that somebody should
look into.
The code:
1/ Allocates PAGE_SIZE buffers (using ordinary malloc()) until
the swap file starts being used (reading
4 matches
Mail list logo