diff options
author | attilio <attilio@FreeBSD.org> | 2013-03-07 23:37:10 +0000 |
---|---|---|
committer | attilio <attilio@FreeBSD.org> | 2013-03-07 23:37:10 +0000 |
commit | 82aa86d64f200298024bc532c74e5e24a0710487 (patch) | |
tree | 0fa9893a54c56cca626dc9cba3ff7ce316a73a5f /sys/vm/vm_radix.c | |
parent | 63f0e495f057b1a8f9e351230b2a714e6cb2c55a (diff) | |
download | FreeBSD-src-82aa86d64f200298024bc532c74e5e24a0710487.zip FreeBSD-src-82aa86d64f200298024bc532c74e5e24a0710487.tar.gz |
Improve comments.
Sponsored by: EMC / Isilon storage division
Submitted by: mdf
Diffstat (limited to 'sys/vm/vm_radix.c')
-rw-r--r-- | sys/vm/vm_radix.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/sys/vm/vm_radix.c b/sys/vm/vm_radix.c index 55a6f83..1e31380 100644 --- a/sys/vm/vm_radix.c +++ b/sys/vm/vm_radix.c @@ -35,10 +35,10 @@ * of this code must achieve highest possible performance. * * The implementation takes into account the following rationale: - * - Size of the nodes might be as small as possible. + * - Size of the nodes should be as small as possible. * - There is no bias toward lookup operations over inserts or removes, * and vice-versa. - * - In average there are not many complete levels, than level + * - On average not many nodes are expected to be full, hence level * compression may just complicate things. */ @@ -222,7 +222,7 @@ vm_radix_keydiff(vm_pindex_t index1, vm_pindex_t index2) for (clev = 0; clev <= VM_RADIX_LIMIT ; clev++) if (vm_radix_slot(index1, clev)) return (clev); - panic("%s: it might have not reached this point", __func__); + panic("%s: cannot reach this point", __func__); return (0); } @@ -508,9 +508,9 @@ restart: * available bisection node, or to the smaller value * in the current domain (if the owner is bigger than the * search key). - * The search for a valid bisection node is helped through - * the use of maplevels array which should bring immediately - * a lower useful level, skipping holes. + * The maplevels array records any node has been seen + * at a given level. This aids the search for a valid + * bisection node. */ if (vm_radix_keybarr(rnode, index)) { difflev = vm_radix_keydiff(index, rnode->rn_owner); @@ -597,9 +597,9 @@ restart: * available bisection node, or to the higher value * in the current domain (if the owner is smaller than the * search key). - * The search for a valid bisection node is helped through - * the use of maplevels array which should bring immediately - * a lower useful level, skipping holes. + * The maplevels array records any node has been seen + * at a given level. This aids the search for a valid + * bisection node. */ if (vm_radix_keybarr(rnode, index)) { difflev = vm_radix_keydiff(index, rnode->rn_owner); |