| /onnv/onnv-gate/usr/src/uts/common/syscall/ |
| sysconfig.c | 176 pgcnt_t cap, rss, free; local
193 free = cap - rss;
195 free = 0;
196 return (MIN(free, freemem));
|
| /onnv/onnv-gate/usr/src/stand/lib/sa/ |
| malloc.c | 73 free(oldaddr);
81 free(void *addr) function
|
| /onnv/onnv-gate/usr/src/cmd/cmd-inet/usr.sbin/snoop/ |
| fakewin.h | 45 #define free _ffree macro
|
| /onnv/onnv-gate/usr/src/cmd/man/src/util/nsgmls.src/lib/ |
| Allocator.cxx | 55 void Allocator::free(void *p) function in class:SP_NAMESPACE::Allocator
|
| /onnv/onnv-gate/usr/src/cmd/fs.d/autofs/ |
| debug_alloc.h | 73 #define free(a) my_free(a, __FILE__, __LINE__) macro
|
| /onnv/onnv-gate/usr/src/uts/common/io/1394/adapters/ |
| hci1394_tlabel.c | 123 * 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 list *
[all...] |
| /onnv/onnv-gate/usr/src/cmd/iscsi/iscsitgtd/ |
| t10_osd.c | 86 free(str);
88 free(o);
100 free(lu->l_dtype_params);
288 (void) trans_send_datain(cmd, (char *)data, sizeof (*data), 0, free, local
|
| /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/SDBM_File/sdbm/ |
| pair.c | 41 * calculating the offsets for free area: if the number
43 * the free area is the block size. Otherwise, it is the
52 register int free; local
56 free = off - (n + 1) * sizeof(short);
59 debug(("free %d need %d\n", free, need));
61 return need <= free;
173 debug(("free-up %d ", zoo));
|
| sdbm.h | 180 # define free Perl_mfree macro
|
| /onnv/onnv-gate/usr/src/lib/libumem/common/ |
| malloc.c | 230 * Pulls information out of a buffer pointer, and optionally free it.
231 * This is used by free() and realloc() to process buffers.
236 * Preserves errno, since free()'s semantics require it.
241 int do_free, /* free the buffer, or just get its size? */
340 message = "double-free or invalid buffer";
347 do_free? "free" : "realloc", buf_arg, message);
372 free(void *buf) function
393 free(buf_arg);
413 free(buf_arg);
|
| /onnv/onnv-gate/usr/src/uts/common/sys/ |
| vuid_queue.h | 50 struct vuid_q_node *free; /* input queue free list */ member in struct:vuid_queue
|
| /onnv/onnv-gate/usr/src/uts/i86pc/io/ioat/ |
| ioat_rs.c | 50 * 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 & ((uint64_t)1 << last)) != 0)
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/fs/pcfs/ |
| pc_alloc.c | 251 * Free file cluster chain after the first skipcl clusters.
327 * 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);
|
| /onnv/onnv-gate/usr/src/uts/common/os/ |
| group.c | 177 * copy the data, and free the old array.
232 uint_t i, j, free; local
234 free = (uint_t)-1;
237 if (set[i] == NULL && free == (uint_t)-1) {
239 * Found a new free slot.
242 free = i;
243 } else if (set[i] != NULL && free != (uint_t)-1) {
246 * an earlier free slot.
248 ASSERT(set[free] == NULL);
249 set[free] = set[i]
[all...] |
| /onnv/onnv-gate/usr/src/lib/libast/common/hash/ |
| hashlib.h | 48 Hash_free_f free; /* value free routine */ member in struct:__anon36
49 Hash_region_f region; /* region alloc/free routine */
|
| /onnv/onnv-gate/usr/src/cmd/sendmail/src/ |
| control.c | 366 long free; local
372 free = freediskspace(Queue[qgrp]->qg_qdir, &bsize);
379 if (free > 0)
380 free = (long)((double) free *
386 free, getla());
|
| /onnv/onnv-gate/usr/src/cmd/spell/ |
| malloc.c | 144 free(ap) function
214 free((char *)p);
|
| /onnv/onnv-gate/usr/src/lib/libbsdmalloc/common/ |
| malloc.bsd43.c | 32 * 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 list. First, check the most commo
[all...] |
| /onnv/onnv-gate/usr/src/lib/libldap4/common/ |
| open.c | 22 #include <stdlib.h> /* calloc(), free(), atoi() for Solaris */
138 free(srv->lsrv_host);
139 free((char *)srv);
156 int free = 0; local
215 free((char *)ld);
228 free((char *)ld);
|
| /onnv/onnv-gate/usr/src/lib/libmapmalloc/common/ |
| textmem.c | 36 * Simplified version of malloc(), free() and realloc(), to be linked with
47 * Freed blocks are joined in larger blocks. Free pages are unmapped.
76 #define FREE 0
122 if (block->status == FREE && block->size >= size)
145 block->status = FREE;
174 * Join block with next one if it is free
176 if (block->next && block->next->status == FREE) {
189 block->status = FREE;
196 free(void *ptr) function
206 block->status = FREE;
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sgs/rtld/common/ |
| malloc.c | 33 * Simplified version of malloc(), calloc() and free(), to be linked with
40 * Freed blocks are joined in larger blocks. Free pages are unmapped.
65 #define FREE 0
117 block2->status == FREE; block2 = block2->next) {
124 * If a page becomes free, leave it, and save the unmapping
128 * Free the defrag index.
144 newblock->status = FREE;
171 if ((block->status == FREE) && (block->size >= size))
193 block->status = FREE;
234 * Join block with next one if it is free
277 free(void *ptr) function
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sh/ |
| blok.c | 174 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);
|
| /onnv/onnv-gate/usr/src/uts/i86pc/io/ |
| iommu_rscs.c | 87 * allocation. rs_free_size is the free buffer size in bytes.
178 "Freeing a free IOMMU page: paddr=0x%" PRIx64,
218 * that min_val will be close to 0. Therefore, we will allocate the free
237 * to allocate an extra 64-bit word. alloc space for free buffer
253 /* Mark all resources as free */
298 uint64_t free; local
315 * Find a free resource. This will return out of the loop once it finds
316 * a free resource. There are a total of 'max'-'min'+1 resources.
322 free = rstruct->rs_free[array_idx];
325 /* if the next resource to check is free */
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/fibre-channel/fca/emlxs/ |
| emlxs_mem.c | 255 * This routine will free iocb/data buffer space
279 /* free the mapped address match area for each ring */
331 /* Free the nodes */
342 /* Free memory associated with all buffers on get buffer pool */
366 /* Free the memory segments */
434 /* Free the mp object */
526 uint32_t free; local
533 free = seg->fc_memget_cnt + seg->fc_memput_cnt;
534 if (free < seg->fc_numblks) {
537 seg->fc_label, free, seg->fc_numblks)
610 uint32_t free; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libc/port/gen/ |
| malloc.c | 33 * 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 block can be used *
854 free(void *old) function
[all...] |
