The branch main has been updated by kib: URL: https://cgit.FreeBSD.org/src/commit/?id=9da33e8d10736c255bf63d408837c6942bd28e04
commit 9da33e8d10736c255bf63d408837c6942bd28e04 Author: Konstantin Belousov <[email protected]> AuthorDate: 2023-08-10 05:01:39 +0000 Commit: Konstantin Belousov <[email protected]> CommitDate: 2023-08-10 06:01:26 +0000 Update comment describing struct vm_map There is no list connecting all entries any more, and correspondingly no order on the list entries. Reviewed by: dougm Sponsored by: The FreeBSD Foundation MFC after: 3 days Differential revision: https://reviews.freebsd.org/D41405 --- sys/vm/vm_map.h | 7 +++---- 1 file 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.
