/illumos-gate/usr/src/uts/common/avs/ns/nsctl/ |
H A D | nsc_ncallio.c | 149 int found, free; local 155 free = 0; 174 free = 1; 179 if (free)
|
/illumos-gate/usr/src/uts/common/xen/io/ |
H A D | xnbo.c | 218 mblk_t *next, *keep, *keep_head, *free, *free_head; local 220 keep = keep_head = free = free_head = NULL; 236 ADD(free, mp); 252 ADD(free, mp);
|
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...] |
/illumos-gate/usr/src/uts/common/io/nge/ |
H A D | nge_tx.c | 154 uint32_t free; local 177 free = srp->tx_free; 184 used = nslots - free - used; 186 ASSERT(slot == NEXT_INDEX(next, free, nslots)); 208 for (free = 0; used-- != 0; slot = NEXT(slot, nslots), ++free) { 233 * there must always be at least one free place 234 * at this point, there must be at least one place NOT free 235 * we're not about to free more places than were claimed! 238 if (free [all...] |
/illumos-gate/usr/src/lib/libast/amd64/include/ast/ |
H A D | vmalloc.h | 48 int n_free; /* number of free blocks */ 50 size_t s_free; /* total amount of free space */ 52 size_t m_free; /* largest free piece */ 188 extern void free _ARG_(( Void_t* )); 237 #undef free macro 246 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro 258 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) ) 274 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) ) 286 #define cfree(d) free( [all...] |
/illumos-gate/usr/src/lib/libast/common/include/ |
H A D | vmalloc.h | 48 int n_free; /* number of free blocks */ 50 size_t s_free; /* total amount of free space */ 52 size_t m_free; /* largest free piece */ 188 extern void free _ARG_(( Void_t* )); 237 #undef free macro 246 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro 258 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) ) 274 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) ) 286 #define cfree(d) free( [all...] |
/illumos-gate/usr/src/lib/libast/i386/include/ast/ |
H A D | vmalloc.h | 48 int n_free; /* number of free blocks */ 50 size_t s_free; /* total amount of free space */ 52 size_t m_free; /* largest free piece */ 188 extern void free _ARG_(( Void_t* )); 237 #undef free macro 246 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro 258 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) ) 274 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) ) 286 #define cfree(d) free( [all...] |
/illumos-gate/usr/src/lib/libast/sparc/include/ast/ |
H A D | vmalloc.h | 48 int n_free; /* number of free blocks */ 50 size_t s_free; /* total amount of free space */ 52 size_t m_free; /* largest free piece */ 188 extern void free _ARG_(( Void_t* )); 237 #undef free macro 246 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro 258 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) ) 274 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) ) 286 #define cfree(d) free( [all...] |
/illumos-gate/usr/src/lib/libast/sparcv9/include/ast/ |
H A D | vmalloc.h | 48 int n_free; /* number of free blocks */ 50 size_t s_free; /* total amount of free space */ 52 size_t m_free; /* largest free piece */ 188 extern void free _ARG_(( Void_t* )); 237 #undef free macro 246 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro 258 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) ) 274 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) ) 286 #define cfree(d) free( [all...] |
/illumos-gate/usr/src/lib/libbc/libc/gen/common/ |
H A D | malloc.c | 36 * nodes are ordered by ascending addresses (thus minimizing free 59 static bool morecore(uint); /* get more memory into free space */ 63 #define free_t void /* ANSI says void free(ptr_t ptr) */ 67 #define free_t int /* BSD says int free(ptr_t ptr) */ 84 Freehdr _root = NIL; /* root of free space list */ 88 /* free header list management */ 133 * Inserts a new node in the free space tree, placing it 516 * remainder of the block goes back to free space. 528 * the free space list. 535 * this because free() doe 564 free(ptr_t ptr) function [all...] |
/illumos-gate/usr/src/cmd/nscd/ |
H A D | nscd_switch.h | 83 int free; member in struct:__anon1025
|
/illumos-gate/usr/src/cmd/sgs/include/ |
H A D | sgs.h | 209 #define free libld_free macro
|
/illumos-gate/usr/src/cmd/keyserv/ |
H A D | keyserv_cache.c | 98 struct cachekey_disklist *free; member in struct:cachekey_header 186 /* Number of records in use or on free list */ 300 INVALID_ADDRESS(ch->free, ch)) { 343 ch->free = 0; 368 ch->free = &(ch->array[0]); 412 INVALID_ADDRESS(ch->free, ch)) { 418 ch->free = MOVE_ADDR(ch->free, offset); 518 list_remove(fcd, &(ch->free), 0, 563 /* If extending the file, add new records to the free lis 584 int i, inuse, inuse_err, free, free_err; local [all...] |
/illumos-gate/usr/src/uts/common/fs/udfs/ |
H A D | udf_alloc.c | 732 * mark the blocks as free blocks 1268 * of l_len == 0, meaning free to end of file. 1271 * maintain a contiguous free list much longer than FIFO. 1358 int32_t error, index, free = 0; local 1382 free = 1; 1388 if (free) {
|
/illumos-gate/usr/src/lib/watchmalloc/common/ |
H A D | malloc.c | 33 * Memory management: malloc(), realloc(), free(), memalign(). 45 * free elts maintained in a self-adjusting binary tree. Each list 53 * are free and used as follows: 55 * BIT0: 1 for busy (block is in use), 0 for free. 57 * preceding block in contiguous memory is free. 65 static TREE *Root; /* root of the free tree */ 66 static TREE *Bottom; /* the last free chunk in the arena */ 263 /* if the leftover is enough for a new free piece */ 394 /* the previous block may be free */ 426 * If the previous block is free an 1076 free(void *old) function [all...] |
/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/lib/libast/common/vmalloc/ |
H A D | malloc.c | 58 #define free _ast_free macro 108 ** region if Vmregion==Vmbest then block free verifies 149 #undef free macro 319 extern void free(reg Void_t* data) function 321 extern void free(data) 326 #undef free macro 328 extern void free(Void_t*); 330 extern void free(); 344 free(data); 352 free(dat 577 #undef free macro 578 #define free macro 677 #undef free macro 730 #define free macro [all...] |
H A D | vmprofile.c | 43 #define PFFREE(pf) ((pf)->data.data.free) 58 Vmulong_t nfree; /* number of free calls */ 59 Vmulong_t free; /* amount freed */ member in struct:_pfdata_s 191 /* free all records related to region vm */ 363 reg Vmulong_t nalloc, alloc, nfree, free; local 377 alloc = free = nalloc = nfree = 0; 399 free += PFFREE(pf); 408 bufp = pfsummary(bufp,nalloc,alloc,nfree,free,0,0); 427 alloc = free = nalloc = nfree = 0; 434 free [all...] |
/illumos-gate/usr/src/lib/libsasl/include/ |
H A D | saslplug.h | 80 sasl_free_t *free; member in struct:sasl_utils 402 * free all global space used by mechanism 630 * free global state for mechanism 771 /* free global state for plugin */ 842 /* free global state for plugin (OPTIONAL) */
|
/illumos-gate/usr/src/lib/libsasl/lib/ |
H A D | saslint.h | 332 sasl_free_t *free; member in struct:sasl_allocation_utils 339 sasl_mutex_free_t *free; member in struct:sasl_mutex_utils 466 #define sasl_FREE(__ptr__) (gctx->sasl_allocation_utils.free((__ptr__))) 470 #define sasl_sun_FREE(__ptr__) (free((__ptr__))) 476 #define sasl_MUTEX_FREE(__mutex__) (gctx->sasl_mutex_utils.free((__mutex__))) 483 #define sasl_FREE(__ptr__) (_sasl_allocation_utils.free((__ptr__))) 489 (_sasl_mutex_utils.free((__mutex__))) 752 /* Private functions to create, free, and use a private context */
|
/illumos-gate/usr/src/lib/libresolv2/common/isc/ |
H A D | eventlib_p.h | 174 struct { struct evEvent_p *next; } free; member in union:evEvent_p::__anon3871
|
/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/sendmail/db/include/ |
H A D | db_page.h | 55 u_int32_t free; /* 32-35: Free list page number. */ member in struct:_btmeta 116 * | index | free --> | 120 * | <-- free | item | 137 db_indx_t hf_offset; /* 22-23: High free byte page offset. */ 215 /* First free byte. */
|
/illumos-gate/usr/src/cmd/fs.d/ufs/df/ |
H A D | df.c | 104 int bflag = 0; /* print only number of kilobytes free */ 105 int eflag = 0; /* print only number of file entries free */ 166 case 'b': /* print only number of kilobytes free */ 171 eflag++; /* print only number of file entries free */ 308 free(cp); 318 free(devnames[j]); 319 free(devnames); 320 free(argstat); 331 free(cp); 374 free(c 470 fsblkcnt64_t totalblks, availblks, avail, free, used; local 592 fsblkcnt64_t totalblks, avail, free, used, reserved; local 635 show_inode_usage(fsfilcnt64_t total, fsfilcnt64_t free) argument [all...] |
/illumos-gate/usr/src/uts/common/fs/ufs/ |
H A D | ufs_alloc.c | 238 * following the current allocation were not free. The extra 251 (void) free(ip, bno + numfrags(fs, nsize), 375 * Check if we really got a free inode, if not then complain 409 "%s: free inode %d had size 0x%llx, run fsck(1M)%s", 459 * the current cg if it has more than 25% free inodes and more 460 * than 25% free blocks. Otherwise the cgs are searched from 468 * above the average number of free inodes, the one with the smallest 517 * average number of free blocks. An appropriate cylinder group is found 522 * of free blocks is found. If the allocation is for the first block in an 619 * free ma 623 free(struct inode *ip, daddr_t bno, off_t size, int flags) function [all...] |