Searched defs:free (Results 1 - 25 of 88) sorted by relevance

1234

/illumos-gate/usr/src/uts/common/syscall/
H A Dsysconfig.c188 pgcnt_t cap, rss, free; local
205 free = cap - rss;
207 free = 0;
208 return (MIN(free, freemem));
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/snoop/
H A Dfakewin.h45 #define free _ffree macro
/illumos-gate/usr/src/stand/lib/sa/
H A Dmalloc.c73 free(oldaddr);
81 free(void *addr) function
/illumos-gate/usr/src/cmd/mandoc/
H A Dcompat_ohash.h31 void (*free)(void *, void *); member in struct:ohash_info
/illumos-gate/usr/src/cmd/fs.d/autofs/
H A Ddebug_alloc.h73 #define free(a) my_free(a, __FILE__, __LINE__) macro
/illumos-gate/usr/src/uts/common/io/1394/adapters/
H A Dhci1394_tlabel.c123 * bad tlabel's are free to be used again.
132 uint64_t free; local
162 free = tlabel_handle->tb_free[node_number];
169 * node id back into the free list
176 /* add the bad tlabels back into the free list */
177 free |= bad;
189 * Find a free tlabel. This will break out of the loop once it finds a
196 /* if the next tlabel to check is free */
197 if ((free & ((uint64_t)1 << last)) != 0) {
206 /* take it out of the free lis
[all...]
/illumos-gate/usr/src/uts/common/sys/
H A Dvuid_queue.h50 struct vuid_q_node *free; /* input queue free list */ member in struct:vuid_queue
H A Dpg.h87 void (*free)(struct pg *); member in struct:pg_ops
/illumos-gate/usr/src/uts/i86pc/io/ioat/
H A Dioat_rs.c50 * allocation. rs_free_size is the free buffer size in bytes.
70 * that min_val will be close to 0. Therefore, we will allocate the free
90 * to allocate an extra 64-bit word. alloc space for free buffer
107 /* Mark all resources as free */
152 uint64_t free; local
169 * Find a free resource. This will return out of the loop once it finds
170 * a free resource. There are a total of 'max'-'min'+1 resources.
176 free = rstruct->rs_free[array_idx];
179 /* if the next resource to check is free */
180 if ((free
[all...]
/illumos-gate/usr/src/lib/libast/common/hash/
H A Dhashlib.h48 Hash_free_f free; /* value free routine */ member in struct:__anon2616
49 Hash_region_f region; /* region alloc/free routine */
/illumos-gate/usr/src/boot/lib/libstand/
H A Dzalloc_malloc.c50 #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/lib/libumem/common/
H A Dmalloc.c57 #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);
/illumos-gate/usr/src/lib/libbsdmalloc/common/
H A Dmalloc.bsd43.c32 * number of different sizes, and keeps free lists of each size. Blocks that
46 * The overhead on a block is at least 4 bytes. When free, this space
47 * contains a pointer to the next free block, and the bottom two bits must
55 union overhead *ov_next; /* when free */
77 * nextf[i] is the pointer to the next free block of size 2^(i+EXP).
222 * free list for this hash bucket.
234 free(void *cp) function
254 * back. We have to search all the free lists for the block in order
281 * Already free, doing "compaction".
284 * free lis
[all...]
/illumos-gate/usr/src/lib/libmapmalloc/common/
H A Dtextmem.c36 * Simplified version of malloc(), free() and realloc(), to be linked with
174 * Join block with next one if it is free
196 free(void *ptr) function
/illumos-gate/usr/src/cmd/sendmail/src/
H A Dcontrol.c366 long free; local
372 free = freediskspace(Queue[qgrp]->qg_qdir, &bsize);
379 if (free > 0)
380 free = (long)((double) free *
386 free, getla());
/illumos-gate/usr/src/cmd/sgs/rtld/common/
H A Dmalloc.c33 * 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/cmd/sh/
H A Dblok.c174 free(ap) function
296 * with alloc() and free(). I really hate having to do things like this,
329 free(pp);
336 free(pp);
340 } else { /* free excess */
343 free(pp);
360 free(pp);
364 } else { /* free excess */
367 free(pp);
/illumos-gate/usr/src/cmd/spell/
H A Dmalloc.c144 free(ap) function
214 free((char *)p);
/illumos-gate/usr/src/uts/common/fs/pcfs/
H A Dpc_alloc.c327 * Return the number of free blocks in the filesystem.
333 int free = 0; local
344 free++;
350 fsp->pcfs_fsinfo.fs_free_clusters = free;
352 return (free);
/illumos-gate/usr/src/man/man3malloc/
H A DMakefile31 free.3malloc \
46 free.3malloc := LINKSRC = malloc.3malloc
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dbptree.c171 * 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 Dbpobj.c205 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/lib/libc/port/gen/
H A Dmalloc.c33 * Memory management: malloc(), realloc(), free().
47 * free elts maintained in a self-adjusting binary tree. Each list
55 * are free and used as follows:
57 * BIT0: 1 for busy (block is in use), 0 for free.
59 * preceding block in contiguous memory is free.
81 static TREE *Root, /* root of the free tree */
82 *Bottom, /* the last free chunk in the arena */
94 #define FREESIZE (1<<5) /* size for preserving free blocks until next malloc */
98 static int freeidx; /* index of free blocks in flist % FREESIZE */
197 /* see if the last free bloc
854 free(void *old) function
[all...]
/illumos-gate/usr/src/uts/common/os/
H A Dgroup.c178 * 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...]
/illumos-gate/usr/src/lib/libmalloc/common/
H A Dmalloc.c56 * 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...]

Completed in 193 milliseconds

1234