HomeSort by: relevance | last modified time | path
    Searched defs:free_entry (Results 1 - 5 of 5) sorted by relevancy

  /src/external/gpl3/gcc.old/dist/libstdc++-v3/libsupc++/
eh_alloc.cc 95 struct free_entry { struct in class:__anon17203::pool
97 free_entry *next;
108 free_entry *first_free_entry;
133 first_free_entry = reinterpret_cast <free_entry *> (arena);
134 new (first_free_entry) free_entry;
147 if (size < sizeof (free_entry))
148 size = sizeof (free_entry);
155 free_entry **e;
163 if ((*e)->size - size >= sizeof (free_entry))
166 free_entry *f = reinterpret_cast <free_entry *
    [all...]
  /src/usr.bin/mail/
sig.c 69 * The routines alloc_entry() and free_entry() manage the queue
98 free_entry(q_entry_t *e) function
150 free_entry(e);
  /src/external/bsd/cron/dist/
entry.c 67 free_entry(entry *e) { function
  /src/external/gpl3/gcc/dist/libstdc++-v3/libsupc++/
eh_alloc.cc 153 struct free_entry { struct in class:__anon14811::pool
155 free_entry *next;
172 free_entry *first_free_entry = nullptr;
245 first_free_entry = reinterpret_cast <free_entry *> (arena);
246 new (first_free_entry) free_entry; variable
259 if (size < sizeof (free_entry))
260 size = sizeof (free_entry);
267 free_entry **e;
275 if ((*e)->size - size >= sizeof (free_entry))
278 free_entry *f = reinterpret_cast <free_entry *
282 new (f) free_entry; variable
317 new (f) free_entry; variable
328 new (f) free_entry; variable
359 new (f) free_entry; variable
    [all...]
  /src/crypto/external/bsd/heimdal/dist/lib/hdb/
hdb.h 98 void (*free_entry)(krb5_context, struct hdb_entry_ex *); member in struct:hdb_entry_ex

Completed in 27 milliseconds