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

1234

/illumos-gate/usr/src/boot/lib/libstand/
H A Dstand.h252 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 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/cmd/cmd-inet/usr.sbin/snoop/
H A Dfakewin.h45 #define free _ffree macro
/illumos-gate/usr/src/cmd/cron/
H A Dcron.c179 void (*free)(void *obj); /* routine that will free obj */ member in struct:shared
265 static char *cte_lp; /* Next free line in cte_text */
524 free(e->cmd);
526 free(e);
658 free(e->cmd);
659 free(e);
959 free(u->home);
1060 free(u->home);
1218 free(
[all...]
/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/cmd/fs.d/ufs/df/
H A Ddf.c104 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/cmd/keyserv/
H A Dkeyserv_cache.c98 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/cmd/mandoc/
H A Dcompat_ohash.h31 void (*free)(void *, void *); member in struct:ohash_info
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dtypegraph.c258 struct tg_buildstate *tgbs_next; /* next stacked or free */
265 struct tg_poststate *tgps_next; /* next stacked or free */
1203 tg_buildstate_t *state = NULL, *new_state, *free = NULL; local
1282 if (free != NULL) {
1283 new_state = free;
1284 free = free->tgbs_next;
1307 * free our buffer, and update our "resident" counter accordingly.
1325 state->tgbs_next = free;
1326 free
1603 tg_todo_t *first = NULL, *last = NULL, *free = NULL, *this = NULL; local
2114 tg_poststate_t *free = NULL, *stack = NULL, *state; local
[all...]
/illumos-gate/usr/src/cmd/mdb/common/modules/zfs/
H A Dzfs.c660 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/nscd/
H A Dnscd_switch.h83 int free; member in struct:__anon1025
/illumos-gate/usr/src/cmd/sendmail/db/include/
H A Ddb_page.h55 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/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());
H A Dqueue.c177 ** Used to keep track of how much free space is available
186 long fs_avail; /* number of free blocks available */
307 ** G free (was: queue delay algorithm if _FFR_QUEUEDELAY)
322 ** X free (was: character set if _FFR_SAVE_CHARSET)
323 ** Y free (was: current delay if _FFR_QUEUEDELAY)
2287 /* free memory allocated by newenvelope() above */
3110 /* free the rest of the list */
5736 ** NOQDIR if no queue directory in qg has enough free space to
6410 ** free space available in a set of queue directories.
6457 ** FILESYS_UPDATE -- update amount of free spac
6573 long free; local
[all...]
/illumos-gate/usr/src/cmd/sgs/include/
H A Dsgs.h209 #define free libld_free macro
/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/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbtree.h96 indx_t lower; /* lower bound of free space on page */
97 indx_t upper; /* upper bound of free space on page */
311 u_int32_t free; /* page number of first free page */ member in struct:_btmeta
344 db_pgno_t bt_free; /* next free page */
/illumos-gate/usr/src/lib/libast/amd64/include/ast/
H A Dast_map.h426 #undef free macro
427 #define free _ast_free macro
428 extern __MANGLE__ void free __PROTO__((__V_*));
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 */
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/amd64/src/lib/libast/
H A Dast_map.h405 #undef free macro
406 #define free _ast_free macro
407 extern __MANGLE__ void free __PROTO__((__V_*));
/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/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 */
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/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...]

Completed in 220 milliseconds

1234