/illumos-gate/usr/src/uts/common/dtrace/ |
H A D | dtrace.c | 202 * probe context is lock-free -- synchronization is handled via the 1695 * dtrace_dynvar(): if a free dynamic variable appears 1756 dtrace_dynvar_t *free, *new_free, *next, *dvar, *start, *prev = NULL; local 1954 * Now set the hash value to indicate that it's free. 2046 free = dcpu->dtdsc_free; 2048 if (free == NULL) { 2107 * move the clean list to the free list; we start by 2116 * free list by another CPU. 2122 * just reattempt the free list allocation. 2130 * Now we'll move the clean list to our free lis [all...] |
/illumos-gate/usr/src/boot/lib/libstand/ |
H A D | stand.h | 252 extern void free(void *ptr); 253 /*#define free(p) {CHK("free %p", p); free(p);} */ /* use for catching guard violations */ 304 #define EV_DYNAMIC (1<<0) /* value was dynamically allocated, free if changed/unset */ 414 #define free(x) Free(x, __FILE__, __LINE__) macro 419 #define free(x) Free(x, NULL, 0) macro
|
H A D | zalloc_malloc.c | 50 #undef free macro 100 printf("free: duplicate free @ %p from %s:%d\n", ptr, file, line); 104 panic("free: guard1 fail @ %p from %s:%d", ptr, file, line); 109 printf("free: duplicate2 free @ %p from %s:%d\n", ptr, file, line); 113 panic("free: guard2 fail @ %p + %zu from %s:%d", ptr, res->ga_Bytes - MALLOCALIGN, file, line); 143 * realloc() - I could be fancier here and free the old buffer before
|
/illumos-gate/usr/src/cmd/mdb/common/modules/zfs/ |
H A D | zfs.c | 660 mdb_printf(" %u: free; lf_next = %u\n", 1130 * Prints free space histogram for a device class 1359 char free[NICENUM_BUFLEN]; local 1370 mdb_nicenum(ms.ms_size - sm.sm_alloc, free); 1373 ms.ms_start, free); 2719 strcpy(typename, "deferred free");
|
/illumos-gate/usr/src/cmd/mandoc/ |
H A D | compat_ohash.h | 31 void (*free)(void *, void *); member in struct:ohash_info
|
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | bptree.c | 171 * If "free" is set: 179 * If "free" is not set, traversal will stop and return an error if 187 bptree_iterate(objset_t *os, uint64_t obj, boolean_t free, bptree_itor_t func, argument 196 ASSERT(!free || dmu_tx_is_syncing(tx)); 202 if (free) 206 ba.ba_free = free; 234 if (free) { 282 ASSERT(!free || err != 0 || ioerr || 285 /* if all blocks are free there should be no used space */
|
H A D | bpobj.c | 205 boolean_t free) 215 if (free) 243 if (free) { 259 if (free) { 301 if (free) { 309 err = bpobj_iterate_impl(&sublist, func, arg, tx, free); 310 if (free) { 323 if (free) { 336 if (free) { 204 bpobj_iterate_impl(bpobj_t *bpo, bpobj_itor_t func, void *arg, dmu_tx_t *tx, boolean_t free) argument
|
/illumos-gate/usr/src/man/man3c/ |
H A D | Makefile | 811 free.3c \ 1923 free.3c := LINKSRC = malloc.3c
|
/illumos-gate/usr/src/uts/common/io/drm/ |
H A D | drmP.h | 11 * Permission is hereby granted, free of charge, to any person obtaining a 367 struct drm_buf *next; /* Kernel-only: used for free list */ 387 uint32_t count; /* Number of free buffers */ 423 ddi_umem_cookie_t drm_umem_cookie; /* For SAREA alloc and free */ 593 int free; member in struct:drm_mm_node
|
/illumos-gate/usr/src/uts/common/os/ |
H A D | sunndi.c | 399 * free the buffer containing the packed nvlist 410 * free all space allocated to a handle. 1231 * free the ndi event handle 1238 ndi_event_cookie_t *free; local 1250 free = cookie; 1253 kmem_free(free, sizeof (ndi_event_cookie_t)); 1264 /* free event handle */ 1544 /* free the cookie */
|
H A D | group.c | 178 * copy the data, and free the old array. 233 uint_t i, j, free; local 235 free = (uint_t)-1; 238 if (set[i] == NULL && free == (uint_t)-1) { 240 * Found a new free slot. 243 free = i; 244 } else if (set[i] != NULL && free != (uint_t)-1) { 247 * an earlier free slot. 249 ASSERT(set[free] == NULL); 250 set[free] [all...] |
H A D | clock.c | 779 * but allowed to free run. this allows NTP to sync. 835 pgcnt_t maxswap, resv, free; local 843 free = k_anoninfo.ani_free + avail; 850 if (maxswap < free) 851 cmn_err(CE_WARN, "clock: maxswap < free"); 855 vminfo.swap_alloc += maxswap - free; 857 vminfo.swap_free += free;
|
/illumos-gate/usr/src/uts/common/xen/io/ |
H A D | xpvtap.c | 1334 /* free up the user ring id */ 1403 * that min_val will be close to 0. Therefore, we will allocate the free 1422 * to allocate an extra 64-bit word. alloc space for free buffer 1439 /* Mark all resources as free */ 1484 uint64_t free; local 1501 * Find a free resource. This will return out of the loop once it finds 1502 * a free resource. There are a total of 'max'-'min'+1 resources. 1508 free = rstruct->rs_free[array_idx]; 1511 /* if the next resource to check is free */ 1512 if ((free 1594 uint64_t free; local [all...] |
H A D | xnb.c | 646 mblk_t *free = mp, *prev = NULL; local 661 * 7. free mp. 850 freemsgchain(free); 963 mblk_t *free = mp, *mp_prev = NULL, *saved_mp = mp; local 1059 if (free == ml) 1060 free = ml_new; 1212 freemsgchain(free);
|
/illumos-gate/usr/src/uts/common/sys/ |
H A D | flock_impl.h | 175 #define DELETED_LOCK 0x0800 /* deleted - free at earliest */ 471 int free; /* number of free slots in the list */ member in struct:proc_graph
|
/illumos-gate/usr/src/uts/common/vm/ |
H A D | seg.h | 120 void (*free)(struct seg *); member in struct:seg_ops 215 #define SEGOP_FREE(s) (*(s)->s_ops->free)((s))
|
/illumos-gate/usr/src/uts/common/io/bnxe/577xx/drivers/common/lm/l4/include/ |
H A D | lm_l4st.h | 163 u8_t * free; /* Pointer to the start of the remaining free space of the block */ member in struct:_lm_tcp_mem_block_t 165 u32_t left; /* free bytes left in the block */ 175 u8_t * free; /* Pointer to the start of the remaining free space of the block */ member in struct:_lm_tcp_phy_mem_block_t 177 u32_t left; /* free bytes left in the block */ 211 d_list_t dpc_peninsula_list; /* accessed lock-free only in dpc */ 689 from the original phys addr, and use it when when we free the gen buf */
|
/illumos-gate/usr/src/uts/common/disp/ |
H A D | fss.c | 2076 int free = 0; local 2107 free = 1; 2113 if (free) { 2126 * desirable to exit as soon as possible to free resources. 2812 int free = 0; local 2885 free = 1; 2894 if (free) {
|
/illumos-gate/usr/src/uts/common/fs/sockfs/ |
H A D | nl7curi.c | 437 * free all resources contained in the uri_desc_t. Note, the uri_desc_t 448 uri_rd_t *free = NULL; local 458 if (free != NULL) { 459 kmem_cache_free(nl7c_uri_rd_kmc, free); 461 free = rdp; 712 * migrated, if so free cur hash and make new hash cur. 718 * check again and to see if still need to do the free. 733 * Lookup a uri_desc_t in the URI hash, if found free the request uri_desc_t 1536 * last kmem free the uri_desb_t.
|
/illumos-gate/usr/src/uts/common/inet/sctp/ |
H A D | sctp.c | 475 /* Stop and free the timers */ 578 * If 'free' is true, then delete the streams as well. 581 sctp_instream_cleanup(sctp_t *sctp, boolean_t free) argument 602 if (free) {
|
/illumos-gate/usr/src/uts/common/io/fibre-channel/fca/emlxs/ |
H A D | emlxs_solaris.c | 2814 uint32_t free; local 2857 free = *count; 2864 free = *count / 2; /* Hold 50% for normal use */ 2865 free_resv = *count - free; /* Reserve 50% for RSCN use */ 2942 new_pool->pool_free = free; 3192 "fca_ub_release: Buffer already free! ubp=%p " 3206 /* Mark the buffer free */ 3383 /* Now free the pool memory */ 10570 /* Adjust free counts based on availablity */ 10571 /* The free reserv [all...] |
/illumos-gate/usr/src/lib/libmalloc/common/ |
H A D | malloc.c | 56 * use level memory allocater (malloc, free, realloc) 58 * -malloc, free, realloc and mallopt form a memory allocator 59 * similar to malloc, free, and realloc. The routines 67 * 1. A free block. This is a block not in use by the 69 * of the free queue.) 81 * free list. 85 * head of the free queue, which prevents bunching of small 88 * -Compaction is performed at free time of any blocks immediately 91 * Since a freed block is added at the front of the free queue, 94 * a block with a contiguious preceding block that is free i 640 free(void *ptr) function [all...] |
/illumos-gate/usr/src/lib/libmtmalloc/common/ |
H A D | mtmalloc.c | 65 * bucket the allocation should be satisfied from. The management of free 66 * buckets is done via a bitmask. A free bucket is represented by a 1. The 67 * first free bit represents the first free bucket. The position of the bit, 72 * This cache control address is used during free() to mark the buffer free 171 #define FREEPATTERN 0xdeadbeef /* debug fill pattern for free buf */ 261 free(ptr); 317 free(ptr); 325 free(pt 357 free(void * ptr) function [all...] |
/illumos-gate/usr/src/cmd/sgs/rtld/common/ |
H A D | malloc.c | 33 * Simplified version of malloc(), calloc() and free(), to be linked with 124 * If a page becomes free, leave it, and save the unmapping 246 * Join block with next one if it is free 269 * Add the free block to the free APlist for later defragmentation. 271 * free APlist. The APlist can't be allowed to grow, as the growth 273 * infinite loop. If the free APlist is full, defrag() now. This 274 * defragmentation might not be able to collapse any free space, but 275 * the free APlist will be cleared as part of the processing, ensuring 285 * Replace both free() an 289 free(void *ptr) function [all...] |
/illumos-gate/usr/src/lib/libumem/common/ |
H A D | malloc.c | 57 #pragma weak free = umem_malloc_free macro 237 * Pulls information out of a buffer pointer, and optionally free it. 238 * This is used by free() and realloc() to process buffers. 243 * Preserves errno, since free()'s semantics require it. 248 int do_free, /* free the buffer, or just get its size? */ 347 message = "double-free or invalid buffer"; 354 do_free? "free" : "realloc", buf_arg, message); 400 free(buf_arg); 420 free(buf_arg);
|