git: 79757c0a33ca - stable/13 - Update comment describing struct vm_map

The branch stable/13 has been updated by kib:

URL: https://cgit.FreeBSD.org/src/commit/?id=79757c0a33ca0da0f079c7250b820c81520649d9

commit 79757c0a33ca0da0f079c7250b820c81520649d9
Author:     Konstantin Belousov <kib@FreeBSD.org>
AuthorDate: 2023-08-10 05:01:39 +0000
Commit:     Konstantin Belousov <kib@FreeBSD.org>
CommitDate: 2023-08-13 04:35:41 +0000

    Update comment describing struct vm_map
    
    (cherry picked from commit 9da33e8d10736c255bf63d408837c6942bd28e04)
---
 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 7854a91f36a9..21f9b48e9b4e 100644
--- a/sys/vm/vm_map.h
+++ b/sys/vm/vm_map.h
@@ -179,12 +179,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.