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

- Fix typos s/(more|less) then|\1 than/

Browse Source 
Submitted by:	Davide Italiano <davide.italiano@gmail.com>
Approved by:	brucec
MFC after:	3 days
This commit is contained in:
Eitan Adler 2011-12-03 15:41:37 +00:00
parent 87812fcec3
commit f565f395c6
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
sys/kern/subr_blist.c
View File

@ -29,7 +29,7 @@
* *
* This module implements a general bitmap allocator/deallocator. The * This module implements a general bitmap allocator/deallocator. The
* allocator eats around 2 bits per 'block'. The module does not * allocator eats around 2 bits per 'block'. The module does not
* try to interpret the meaning of a 'block' other then to return * try to interpret the meaning of a 'block' other than to return
* SWAPBLK_NONE on an allocation failure. * SWAPBLK_NONE on an allocation failure.
* *
* A radix tree is used to maintain the bitmap. Two radix constants are * A radix tree is used to maintain the bitmap. Two radix constants are
@ -57,7 +57,7 @@
* the memory subsystem. In contrast, the rlist code may allocate memory * the memory subsystem. In contrast, the rlist code may allocate memory
* on an rlist_free() call. The non-blocking features of the blist code * on an rlist_free() call. The non-blocking features of the blist code
* are used to great advantage in the swap code (vm/nswap_pager.c). The * are used to great advantage in the swap code (vm/nswap_pager.c). The
* rlist code uses a little less overall memory then the blist code (but * rlist code uses a little less overall memory than the blist code (but
* due to swap interleaving not all that much less), but the blist code * due to swap interleaving not all that much less), but the blist code
* scales much, much better. * scales much, much better.
* *
@ -72,7 +72,7 @@
* to cover the number of blocks requested at creation time even if it * to cover the number of blocks requested at creation time even if it
* must be encompassed in larger root-node radix. * must be encompassed in larger root-node radix.
* *
* NOTE: the allocator cannot currently allocate more then * NOTE: the allocator cannot currently allocate more than
* BLIST_BMAP_RADIX blocks per call. It will panic with 'allocation too * BLIST_BMAP_RADIX blocks per call. It will panic with 'allocation too
* large' if you try. This is an area that could use improvement. The * large' if you try. This is an area that could use improvement. The
* radix is large enough that this restriction does not effect the swap * radix is large enough that this restriction does not effect the swap
@ -152,7 +152,7 @@ static MALLOC_DEFINE(M_SWAP, "SWAP", "Swap space");
* blist_create() - create a blist capable of handling up to the specified * blist_create() - create a blist capable of handling up to the specified
* number of blocks * number of blocks
* *
* blocks - must be greater then 0 * blocks - must be greater than 0
* flags - malloc flags * flags - malloc flags
* *
* The smallest blist consists of a single leaf node capable of * The smallest blist consists of a single leaf node capable of
@ -841,7 +841,7 @@ blst_meta_fill(
* *
* Initialize our meta structures and bitmaps and calculate the exact * Initialize our meta structures and bitmaps and calculate the exact
* amount of space required to manage 'count' blocks - this space may * amount of space required to manage 'count' blocks - this space may
* be considerably less then the calculated radix due to the large * be considerably less than the calculated radix due to the large
* RADIX values we use. * RADIX values we use.
*/ */