Mercurial > hg > xemacs-beta
comparison src/ralloc.c @ 2:ac2d302a0011 r19-15b2
Import from CVS: tag r19-15b2
author | cvs |
---|---|
date | Mon, 13 Aug 2007 08:46:35 +0200 |
parents | 376386a54a3c |
children | 0293115a14e9 |
comparison
equal
deleted
inserted
replaced
1:c0c6a60d29db | 2:ac2d302a0011 |
---|---|
907 keep fragmenting the large empty block until it finds an address | 907 keep fragmenting the large empty block until it finds an address |
908 which can be successfully mmapped, or until there are no free | 908 which can be successfully mmapped, or until there are no free |
909 blocks of the given size left. | 909 blocks of the given size left. |
910 | 910 |
911 Note that this scheme, given it's first-fit strategy, is prone to | 911 Note that this scheme, given it's first-fit strategy, is prone to |
912 fragmentation of the the first part of memory earmarked for this | 912 fragmentation of the first part of memory earmarked for this |
913 purpose. [ACP Vol I]. We can't use the workaround of using a | 913 purpose. [ACP Vol I]. We can't use the workaround of using a |
914 randomized first fit because we don't want to presume too much | 914 randomized first fit because we don't want to presume too much |
915 about the memory map. Instead, we try to coalesce empty or | 915 about the memory map. Instead, we try to coalesce empty or |
916 unavailable blocks at any available opportunity. */ | 916 unavailable blocks at any available opportunity. */ |
917 | 917 |