Lines Matching +full:right +full:- +full:aligned

1 /*-
2  * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
8  * The Mach Operating System project at Carnegie-Mellon University.
35  * Copyright (c) 1987, 1990 Carnegie-Mellon University.
55  *  Pittsburgh PA 15213-3890
74  *	vm_map_t		the high-level address map data structure.
83  *	another map (called a "sharing map") which denotes read-write
94  *	and user-exported inheritance and protection information.
103 	struct vm_map_entry *right;	/* right child or next entry */  member
114 	uint8_t read_ahead;		/* pages in the read-ahead window */
141 #define	MAP_ENTRY_GROWS_DOWN		0x00001000	/* top-down stacks */
142 #define	MAP_ENTRY_GROWS_UP		0x00002000	/* bottom-up stacks */
155 	(((entry)->eflags & MAP_ENTRY_SPLIT_BOUNDARY_MASK) >>	\
162 	return (entry->eflags & MAP_ENTRY_BEHAV_MASK);  in vm_map_entry_behavior()
168 	if (entry->eflags & MAP_ENTRY_USER_WIRED)  in vm_map_entry_user_wired_count()
176 	return (entry->wired_count - vm_map_entry_user_wired_count(entry));  in vm_map_entry_system_wired_count()
188  *	Sleator and Tarjan's top-down splay algorithm is employed to
191  *	The map's min offset value is stored in map->header.end, and
192  *	its max offset value is stored in map->header.start.  These
194  *	scan of the list.  The right and left fields of the map
247 	return (map->header.start);  in vm_map_max()
254 	return (map->header.end);  in vm_map_min()
260 	return (map->pmap);  in vm_map_pmap()
266 	map->flags = (map->flags | set) & ~clear;  in vm_map_modflags()
298 	vm_offset_t vm_stacktop; /* top of the stack, may not be page-aligned */
302 	 * Keep the PMAP last, so that CPU-specific variations of that
304 	 * variations of the machine-independent fields in the vmspace.
313 	return &vmspace->vm_pmap;  in vmspace_pmap()
365  * Copy-on-write flags for vm_map operations
405 #define	VM_FAULT_READ_AHEAD_MAX		min(atop(maxphys) - 1, UINT8_MAX)
416 #define	VMFS_SUPER_SPACE	3	/* find a superpage-aligned range */
440  * This function is made available to user-space code that needs to traverse
450 	after = clone->right;  in vm_map_entry_read_succ()
451 	start = clone->start;  in vm_map_entry_read_succ()
454 	backup = clone->left;  in vm_map_entry_read_succ()
457 	if (clone->start > start) {  in vm_map_entry_read_succ()
460 			backup = clone->left;  in vm_map_entry_read_succ()
463 		} while (clone->start != start);  in vm_map_entry_read_succ()
499 	return (map->header.right);  in vm_map_entry_first()
507 	after = entry->right;  in vm_map_entry_succ()
508 	if (after->left->start > entry->start) {  in vm_map_entry_succ()
510 			after = after->left;  in vm_map_entry_succ()
511 		while (after->left != entry);  in vm_map_entry_succ()
518 	    (it) != &(map)->header;		\