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

12

/osnet-11/usr/src/grub/grub2/grub-core/lib/posix_wrap/
H A Dstdlib.h5 * GRUB is free software: you can redistribute it and/or modify
26 free (void *ptr) function
/osnet-11/usr/src/lib/libast/common/hash/
H A Dhashlib.h48 Hash_free_f free; /* value free routine */ member in struct:__anon1135
49 Hash_region_f region; /* region alloc/free routine */
/osnet-11/usr/src/lib/libldap4/common/
H A Dopen.c22 #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);
/osnet-11/usr/src/lib/libmapmalloc/common/
H A Dtextmem.c33 * Simplified version of malloc(), free() and realloc(), to be linked with
161 free(ptr);
175 * Join block with next one if it is free
197 free(void *ptr) function
/osnet-11/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());
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/SDBM_File/sdbm/
H A Dpair.c41 * 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));
H A Dsdbm.h180 # define free Perl_mfree macro
/osnet-11/usr/src/lib/libbsdmalloc/common/
H A Dmalloc.bsd43.c30 * number of different sizes, and keeps free lists of each size. Blocks that
44 * The overhead on a block is at least 4 bytes. When free, this space
45 * contains a pointer to the next free block, and the bottom two bits must
53 union overhead *ov_next; /* when free */
75 * nextf[i] is the pointer to the next free block of size 2^(i+EXP).
220 * free list for this hash bucket.
232 free(void *cp) function
252 * back. We have to search all the free lists for the block in order
271 free(cp);
283 * Already free, doin
[all...]
/osnet-11/usr/src/lib/libumem/common/
H A Dmalloc.c227 * Pulls information out of a buffer pointer, and optionally free it.
228 * This is used by free() and realloc() to process buffers.
233 * Preserves errno, since free()'s semantics require it.
238 int do_free, /* free the buffer, or just get its size? */
337 message = "double-free or invalid buffer";
344 do_free? "free" : "realloc", buf_arg, message);
369 free(void *buf) function
387 free(buf_arg);
410 free(buf_arg);
/osnet-11/usr/src/lib/libc/port/gen/
H A Dmalloc.c31 * Memory management: malloc(), realloc(), free().
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.
79 static TREE *Root, /* root of the free tree */
80 *Bottom, /* the last free chunk in the arena */
92 #define FREESIZE (1<<5) /* size for preserving free blocks until next malloc */
96 static int freeidx; /* index of free blocks in flist % FREESIZE */
195 /* see if the last free bloc
856 free(void *old) function
[all...]
/osnet-11/usr/src/lib/libmalloc/common/
H A Dmalloc.c55 * use level memory allocater (malloc, free, realloc)
57 * -malloc, free, realloc and mallopt form a memory allocator
58 * similar to malloc, free, and realloc. The routines
66 * 1. A free block. This is a block not in use by the
68 * of the free queue.)
80 * free list.
84 * head of the free queue, which prevents bunching of small
87 * -Compaction is performed at free time of any blocks immediately
90 * Since a freed block is added at the front of the free queue,
93 * a block with a contiguious preceding block that is free i
639 free(void *ptr) function
[all...]
/osnet-11/usr/src/lib/libparted/common/include/parted/
H A Ddisk.h5 This program is free software; you can redistribute it and/or modify
146 allocated to represent free space, or disk
155 partitions (and free space and metadata within the extended
185 int update_mode; /**< mode without free/metadata
196 void (*free) (PedDisk* disk); member in struct:_PedDiskOps
/osnet-11/usr/src/grub/grub2/grub-core/gnulib/
H A Dalloca.c35 # undef free macro
36 # define free EMACS_FREE macro
177 free (hp); /* Collect garbage. */
/osnet-11/usr/src/grub/grub2/grub-core/normal/
H A Dterm.c6 * GRUB is free software: you can redistribute it and/or modify
37 void *free; member in struct:term_state
699 grub_free (state->free);
700 state->free = NULL;
715 grub_free (state->free);
716 state->free = NULL;
789 state->free = visual;
/osnet-11/usr/src/lib/libast/amd64/include/ast/
H A Dvmalloc.h48 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 */
189 extern void free _ARG_(( Void_t* ));
240 #undef free macro
249 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro
261 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) )
277 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) )
289 #define cfree(d) free(
[all...]
/osnet-11/usr/src/lib/libast/common/include/
H A Dvmalloc.h48 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 */
189 extern void free _ARG_(( Void_t* ));
240 #undef free macro
249 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro
261 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) )
277 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) )
289 #define cfree(d) free(
[all...]
/osnet-11/usr/src/lib/libast/common/vmalloc/
H A Dmalloc.c58 #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 Dvmprofile.c43 #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...]
/osnet-11/usr/src/lib/libast/i386/include/ast/
H A Dvmalloc.h48 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 */
189 extern void free _ARG_(( Void_t* ));
240 #undef free macro
249 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro
261 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) )
277 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) )
289 #define cfree(d) free(
[all...]
/osnet-11/usr/src/lib/libast/sparc/include/ast/
H A Dvmalloc.h48 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 */
189 extern void free _ARG_(( Void_t* ));
240 #undef free macro
249 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro
261 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) )
277 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) )
289 #define cfree(d) free(
[all...]
/osnet-11/usr/src/lib/libast/sparcv9/include/ast/
H A Dvmalloc.h48 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 */
189 extern void free _ARG_(( Void_t* ));
240 #undef free macro
249 #define free(d) (_VMFL_(Vmregion), _ast_free((Void_t*)(d)) ) macro
261 #define free(d) ( _VMFL_(Vmregion), (free)((Void_t*)(d)) )
277 #define free(d) ( _VMFL_(Vmregion), _VMNM_(fre,/,*,*,/,e)((Void_t*)(d)) )
289 #define cfree(d) free(
[all...]
/osnet-11/usr/src/lib/watchmalloc/common/
H A Dmalloc.c30 * Memory management: malloc(), realloc(), free(), memalign().
42 * free elts maintained in a self-adjusting binary tree. Each list
50 * are free and used as follows:
52 * BIT0: 1 for busy (block is in use), 0 for free.
54 * preceding block in contiguous memory is free.
62 static TREE *Root; /* root of the free tree */
63 static TREE *Bottom; /* the last free chunk in the arena */
260 /* if the leftover is enough for a new free piece */
291 free(old);
395 /* the previous block may be free */
1077 free(void *old) function
[all...]
/osnet-11/usr/src/lib/libresolv2/common/isc/
H A Deventlib_p.h174 struct { struct evEvent_p *next; } free; member in union:evEvent_p::__anon2431
/osnet-11/usr/src/lib/libsasl/include/
H A Dsaslplug.h77 sasl_free_t *free; member in struct:sasl_utils
399 * free all global space used by mechanism
627 * free global state for mechanism
768 /* free global state for plugin */
839 /* free global state for plugin (OPTIONAL) */
/osnet-11/usr/src/lib/libsasl/lib/
H A Dsaslint.h345 sasl_free_t *free; member in struct:sasl_allocation_utils
352 sasl_mutex_free_t *free; member in struct:sasl_mutex_utils
479 #define sasl_FREE(__ptr__) (gctx->sasl_allocation_utils.free((__ptr__)))
483 #define sasl_sun_FREE(__ptr__) (free((__ptr__)))
489 #define sasl_MUTEX_FREE(__mutex__) (gctx->sasl_mutex_utils.free((__mutex__)))
496 #define sasl_FREE(__ptr__) (_sasl_allocation_utils.free((__ptr__)))
502 (_sasl_mutex_utils.free((__mutex__)))
765 /* Private functions to create, free, and use a private context */

Completed in 66 milliseconds

12