uma_int.h (242152) | uma_int.h (243998) |
---|---|
1/*- 2 * Copyright (c) 2002-2005, 2009 Jeffrey Roberson <jeff@FreeBSD.org> 3 * Copyright (c) 2004, 2005 Bosko Milekic <bmilekic@FreeBSD.org> 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: --- 10 unchanged lines hidden (view full) --- 19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 * | 1/*- 2 * Copyright (c) 2002-2005, 2009 Jeffrey Roberson <jeff@FreeBSD.org> 3 * Copyright (c) 2004, 2005 Bosko Milekic <bmilekic@FreeBSD.org> 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: --- 10 unchanged lines hidden (view full) --- 19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 * |
27 * $FreeBSD: head/sys/vm/uma_int.h 242152 2012-10-26 17:51:05Z mdf $ | 27 * $FreeBSD: head/sys/vm/uma_int.h 243998 2012-12-07 22:27:13Z pjd $ |
28 * 29 */ 30 31/* 32 * This file includes definitions, structures, prototypes, and inlines that 33 * should not be used outside of the actual implementation of UMA. 34 */ 35 --- 290 unchanged lines hidden (view full) --- 326 327 u_int64_t uz_allocs UMA_ALIGN; /* Total number of allocations */ 328 u_int64_t uz_frees; /* Total number of frees */ 329 u_int64_t uz_fails; /* Total number of alloc failures */ 330 u_int64_t uz_sleeps; /* Total number of alloc sleeps */ 331 uint16_t uz_fills; /* Outstanding bucket fills */ 332 uint16_t uz_count; /* Highest value ub_ptr can have */ 333 | 28 * 29 */ 30 31/* 32 * This file includes definitions, structures, prototypes, and inlines that 33 * should not be used outside of the actual implementation of UMA. 34 */ 35 --- 290 unchanged lines hidden (view full) --- 326 327 u_int64_t uz_allocs UMA_ALIGN; /* Total number of allocations */ 328 u_int64_t uz_frees; /* Total number of frees */ 329 u_int64_t uz_fails; /* Total number of alloc failures */ 330 u_int64_t uz_sleeps; /* Total number of alloc sleeps */ 331 uint16_t uz_fills; /* Outstanding bucket fills */ 332 uint16_t uz_count; /* Highest value ub_ptr can have */ 333 |
334 /* The next three fields are used to print a rate-limited warnings. */ 335 const char *uz_warning; /* Warning to print on failure */ 336 struct timeval uz_ratecheck; /* Warnings rate-limiting */ 337 |
|
334 /* 335 * This HAS to be the last item because we adjust the zone size 336 * based on NCPU and then allocate the space for the zones. 337 */ 338 struct uma_cache uz_cpu[1]; /* Per cpu caches */ 339}; 340 341/* --- 110 unchanged lines hidden --- | 338 /* 339 * This HAS to be the last item because we adjust the zone size 340 * based on NCPU and then allocate the space for the zones. 341 */ 342 struct uma_cache uz_cpu[1]; /* Per cpu caches */ 343}; 344 345/* --- 110 unchanged lines hidden --- |