diff options
| author | Konstantin Belousov <kib@FreeBSD.org> | 2023-08-10 05:01:39 +0000 |
|---|---|---|
| committer | Konstantin Belousov <kib@FreeBSD.org> | 2023-08-10 06:01:26 +0000 |
| commit | 9da33e8d10736c255bf63d408837c6942bd28e04 (patch) | |
| tree | c1f85193536a307bf8fbf565214b20c681603f46 /sys | |
| parent | 811e0a31acafd6ab21f89bec8ba0fb8c09f258d2 (diff) | |
| download | src-9da33e8d10736c255bf63d408837c6942bd28e04.tar.gz src-9da33e8d10736c255bf63d408837c6942bd28e04.zip | |
Diffstat (limited to 'sys')
| -rw-r--r-- | sys/vm/vm_map.h | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/sys/vm/vm_map.h b/sys/vm/vm_map.h index b974f52e51ed..82320196b98b 100644 --- a/sys/vm/vm_map.h +++ b/sys/vm/vm_map.h @@ -183,12 +183,11 @@ vm_map_entry_system_wired_count(vm_map_entry_t entry) /* * A map is a set of map entries. These map entries are - * organized as a threaded binary search tree. Both structures - * are ordered based upon the start and end addresses contained + * organized as a threaded binary search tree. The tree is + * ordered based upon the start and end addresses contained * within each map entry. The largest gap between an entry in a * subtree and one of its neighbors is saved in the max_free - * field, and that field is updated when the tree is - * restructured. + * field, and that field is updated when the tree is restructured. * * Sleator and Tarjan's top-down splay algorithm is employed to * control height imbalance in the binary search tree. |