iedowse
6d68eec474
When searching for a suitable block of memory on the free list, ...
skip blocks that are too big by a factor of two or greater. This
avoids some cases of extremely inefficient memory use that can occur
when large (e.g. 64k) blocks on the free list get used when allocating
a 4k chunk of 64-byte fragments. Because fragments have their own
free list, the 60k difference got lost forever every time.
2004-08-02 13:59:02 +00:00
2004-08-01 18:51:44 +00:00
2004-08-02 02:07:20 +00:00
2004-08-02 12:24:18 +00:00
2004-08-02 03:06:21 +00:00
2004-07-18 05:39:14 +00:00
2004-07-30 22:08:52 +00:00
2004-08-01 21:15:29 +00:00
2004-08-01 13:00:04 +00:00
2004-07-28 06:14:44 +00:00
2004-06-14 00:38:54 +00:00
2004-07-28 08:59:08 +00:00
2004-08-02 13:59:02 +00:00
2004-07-11 16:13:57 +00:00
2004-07-30 22:08:52 +00:00
2004-07-10 17:47:22 +00:00
2004-08-02 00:37:40 +00:00
2004-07-30 22:08:52 +00:00
2004-07-18 20:13:31 +00:00
2004-08-01 19:37:34 +00:00
2004-08-01 18:51:44 +00:00
2004-07-30 00:59:40 +00:00
2004-07-30 22:08:52 +00:00
2004-08-02 01:38:27 +00:00
2004-07-27 22:32:01 +00:00
2004-08-01 11:40:54 +00:00
2004-07-28 06:59:55 +00:00
2004-07-27 23:20:45 +00:00
2004-07-19 17:18:58 +00:00
2004-07-28 06:59:55 +00:00
2004-08-01 20:39:33 +00:00
2004-07-28 13:03:07 +00:00
2004-07-28 13:03:07 +00:00
2004-06-23 01:58:22 +00:00
2004-07-28 06:58:23 +00:00
2004-06-21 00:20:43 +00:00
2004-06-24 03:11:29 +00:00
2004-06-16 09:47:26 +00:00
2004-07-28 06:59:55 +00:00
2004-04-07 05:00:01 +00:00
2004-07-30 22:08:52 +00:00
2004-07-30 22:08:52 +00:00
2004-07-24 02:32:27 +00:00
2004-07-22 18:35:43 +00:00
2004-08-01 13:01:36 +00:00
2004-06-16 09:47:26 +00:00
2004-08-02 10:08:28 +00:00
2004-08-02 11:08:48 +00:00
2004-07-15 22:21:25 +00:00
2004-08-02 00:18:36 +00:00
2004-08-01 11:40:54 +00:00
2004-08-02 01:49:22 +00:00
2004-07-11 16:14:24 +00:00
2004-07-30 22:08:52 +00:00
2004-08-02 03:31:05 +00:00
2004-05-16 00:19:12 +00:00
6d68eec474