Lines Matching defs:rlist

1035 #define SPLAY_LEFT_STEP(root, y, llist, rlist, test) do {		\
1048 vm_map_entry_max_free_right(root, rlist)), \
1051 max_free = vm_map_entry_max_free_right(root, rlist); \
1067 /* Copy right->max_free. Put root on rlist. */ \
1069 KASSERT(max_free == vm_map_entry_max_free_right(root, rlist), \
1071 root->left = rlist; \
1072 rlist = root; \
1076 #define SPLAY_RIGHT_STEP(root, y, llist, rlist, test) do { \
1089 vm_map_entry_max_free_right(root, rlist)), \
1091 if (max_free - 1 < vm_map_entry_max_free_right(root, rlist)) \
1093 if (y != rlist && (test)) { \
1114 root = y != rlist ? y : NULL; \
1120 * subtrees with root->max_free < length as empty trees. llist and rlist are
1122 * pointer and rlist linked by the left pointer in the vm_map_entry, and both
1129 vm_map_entry_t *llist, vm_map_entry_t *rlist)
1149 *rlist = right;
1154 vm_map_splay_findnext(vm_map_entry_t root, vm_map_entry_t *rlist)
1158 right = *rlist;
1165 *rlist = right;
1195 * subtrees of the root go at the bottom of llist and rlist.
1256 vm_map_entry_t tail, vm_size_t max_free, vm_map_entry_t rlist)
1260 * The max_free values of the children of rlist are in
1261 * rlist->max_free and max_free. Update with the
1264 rlist->max_free = max_free =
1265 vm_size_max(rlist->max_free, max_free);
1266 vm_map_entry_swap(&rlist->left, &tail);
1267 vm_map_entry_swap(&tail, &rlist);
1268 } while (rlist != header);
1274 * When rlist is known to be the succecessor of root.
1278 vm_map_entry_t rlist)
1282 max_free = rlist->start - root->end;
1283 if (rlist != header) {
1285 root, max_free, rlist);
1294 * When rlist may or may not be the succecessor of root.
1298 vm_map_entry_t rlist)
1302 max_free = vm_map_entry_max_free_right(root, rlist);
1303 if (rlist != header) {
1305 root->right == rlist ? root : root->right,
1306 max_free, rlist);
1339 vm_map_entry_t header, llist, rlist, root;
1343 root = vm_map_splay_split(map, addr, 0, &llist, &rlist);
1346 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1355 max_free_right = vm_map_splay_merge_succ(header, root, rlist);
1356 } else if (rlist != header) {
1361 root = rlist;
1362 rlist = root->left;
1364 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1387 vm_map_entry_t header, llist, rlist, root;
1396 root = vm_map_splay_split(map, entry->start, 0, &llist, &rlist);
1403 max_free_right = vm_map_splay_merge_succ(header, entry, rlist);
1420 vm_map_splay_merge_right(header, root, rlist));
1430 vm_map_splay_findnext(root, &rlist);
1437 max_free_right = vm_map_splay_merge_succ(header, entry, rlist);
1453 vm_map_entry_t header, llist, rlist, root;
1458 root = vm_map_splay_split(map, entry->start, 0, &llist, &rlist);
1463 vm_map_splay_findnext(root, &rlist);
1465 rlist->start = root->start;
1466 MPASS((rlist->eflags & MAP_ENTRY_STACK_GAP) == 0);
1467 rlist->offset = root->offset;
1473 max_free_right = vm_map_splay_merge_succ(header, root, rlist);
1474 } else if (rlist != header) {
1475 root = rlist;
1476 rlist = root->left;
1478 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1503 vm_map_entry_t header, llist, rlist, root;
1507 root = vm_map_splay_split(map, entry->start, 0, &llist, &rlist);
1509 vm_map_splay_findnext(root, &rlist);
1513 vm_map_splay_merge_succ(header, root, rlist));
1869 vm_map_entry_t header, llist, rlist, root, y;
1889 * of the following gap. If rlist is at the end of the gap containing
1895 root = vm_map_splay_split(map, start, length, &llist, &rlist);
1896 gap_end = rlist->start;
1899 if (root->right != rlist)
1902 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1903 } else if (rlist != header) {
1904 root = rlist;
1905 rlist = root->left;
1907 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1912 max_free_right = vm_map_splay_merge_succ(header, root, rlist);
1927 llist = rlist = header;
1931 SPLAY_LEFT_STEP(root, y, llist, rlist,
1934 SPLAY_RIGHT_STEP(root, y, llist, rlist,
1942 if (rlist == header) {
1944 vm_map_splay_merge_succ(header, root, rlist));
1946 y = rlist;
1947 rlist = y->left;
1950 vm_map_splay_merge_right(header, y, rlist));