| vm_radix.c (247742) | vm_radix.c (247769) |
|---|---|
| 1/* 2 * Copyright (c) 2013 EMC Corp. 3 * Copyright (c) 2011 Jeffrey Roberson <jeff@freebsd.org> 4 * Copyright (c) 2008 Mayur Shardul <mayur.shardul@gmail.com> 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions --- 283 unchanged lines hidden (view full) --- 292 *idx = vm_radix_trimkey(*idx, ilev); 293 *idx |= VM_RADIX_UNITLEVEL(ilev) - 1; 294 *idx -= VM_RADIX_UNITLEVEL(ilev); 295 return (*idx > wrapidx); 296} 297 298/* 299 * Internal handwork for vm_radix_reclaim_allonodes() primitive. | 1/* 2 * Copyright (c) 2013 EMC Corp. 3 * Copyright (c) 2011 Jeffrey Roberson <jeff@freebsd.org> 4 * Copyright (c) 2008 Mayur Shardul <mayur.shardul@gmail.com> 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions --- 283 unchanged lines hidden (view full) --- 292 *idx = vm_radix_trimkey(*idx, ilev); 293 *idx |= VM_RADIX_UNITLEVEL(ilev) - 1; 294 *idx -= VM_RADIX_UNITLEVEL(ilev); 295 return (*idx > wrapidx); 296} 297 298/* 299 * Internal handwork for vm_radix_reclaim_allonodes() primitive. |
| 300 * This function is recrusive. | 300 * This function is recursive. |
| 301 */ 302static void 303vm_radix_reclaim_allnodes_int(struct vm_radix_node *rnode) 304{ 305 int slot; 306 307 for (slot = 0; slot < VM_RADIX_COUNT && rnode->rn_count != 0; slot++) { 308 if (rnode->rn_child[slot] == NULL) --- 442 unchanged lines hidden --- | 301 */ 302static void 303vm_radix_reclaim_allnodes_int(struct vm_radix_node *rnode) 304{ 305 int slot; 306 307 for (slot = 0; slot < VM_RADIX_COUNT && rnode->rn_count != 0; slot++) { 308 if (rnode->rn_child[slot] == NULL) --- 442 unchanged lines hidden --- |