| /openbsd-current/bin/ksh/ |
| H A D | alloc.c | 22 ap->freelist = NULL;
31 for (l = ap->freelist; l != NULL; l = l2) {
35 ap->freelist = NULL;
53 l->next = ap->freelist;
55 if (ap->freelist)
56 ap->freelist->prev = l;
57 ap->freelist = l;
104 ap->freelist = l2;
123 ap->freelist = l->next;
|
| H A D | sh.h | 53 struct link *freelist; /* free list */ member in struct:Area
|
| /openbsd-current/sys/arch/sparc64/stand/ofwboot/ |
| H A D | alloc.c | 89 LIST_HEAD(, ml) freelist = LIST_HEAD_INITIALIZER(freelist);
113 /* scan freelist */
114 LIST_FOREACH(f, &freelist, list)
120 /* scan freelist */
121 LIST_FOREACH(f, &freelist, list) {
134 /* no match in freelist if bestsize unchanged */
161 /* remove from freelist */
192 /* Remove from allocated list, place on freelist. */
194 LIST_INSERT_HEAD(&freelist,
[all...] |
| /openbsd-current/gnu/llvm/libcxxabi/src/ |
| H A D | fallback_malloc.cpp | 91 static heap_node* freelist = NULL; member in namespace:__anon271
117 freelist = getFirstAlignedNodeInHeap();
118 freelist->next_node = offset_from_node(list_end);
119 freelist->len = static_cast<heap_size>(list_end - freelist);
136 if (NULL == freelist)
140 for (p = freelist, prev = 0; p && p != list_end;
174 freelist = node_from_offset(p->next_node);
199 for (p = freelist, prev = 0; p && p != list_end;
219 freelist
[all...] |
| /openbsd-current/sys/arch/macppc/stand/ |
| H A D | alloc.c | 89 LIST_HEAD(, ml) freelist = LIST_HEAD_INITIALIZER(freelist);
113 /* scan freelist */
114 LIST_FOREACH(f, &freelist, list)
120 /* scan freelist */
121 LIST_FOREACH(f, &freelist, list) {
134 /* no match in freelist if bestsize unchanged */
161 /* remove from freelist */
192 /* Remove from allocated list, place on freelist. */
194 LIST_INSERT_HEAD(&freelist,
[all...] |
| /openbsd-current/gnu/gcc/libstdc++-v3/src/ |
| H A D | mt_allocator.cc | 60 // Ensure freelist is constructed first.
61 static __freelist freelist; member in namespace:__anon584
72 _Thread_record* __tr = &freelist._M_thread_freelist_array[_M_id - 1];
73 __tr->_M_next = freelist._M_thread_freelist;
74 freelist._M_thread_freelist = __tr;
262 // Calculate the number of records to remove from our freelist:
351 // directly to our own freelist (with us as owner).
502 if (!freelist._M_thread_freelist_array
503 || freelist._M_max_threads < _M_options._M_max_threads)
524 if (!freelist
[all...] |
| /openbsd-current/sys/lib/libsa/ |
| H A D | alloc.c | 118 } *freelist = NULL; variable in typeref:struct:fl
135 struct fl **f = &freelist, **bestf = NULL;
156 /* scan freelist */
171 /* no match in freelist if bestsize unchanged */
203 /* remove from freelist */
242 /* put into freelist */
243 f->next = freelist;
244 freelist = f;
|
| /openbsd-current/sys/uvm/ |
| H A D | uvm_km.h | 71 struct uvm_km_free_page *freelist; member in struct:uvm_km_pages
|
| H A D | uvm_km.c | 638 uvm_km_pages.freelist == NULL) {
643 fp = uvm_km_pages.freelist;
644 uvm_km_pages.freelist = NULL;
650 * If there was nothing on the freelist, then we
880 fp->next = uvm_km_pages.freelist;
881 uvm_km_pages.freelist = fp;
|
| /openbsd-current/usr.bin/less/ |
| H A D | linenum.c | 67 static struct linenum_info *freelist; /* Anchor of the unused entries */ variable in typeref:struct:linenum_info
90 freelist = pool;
145 if (freelist != NULL) {
150 new = freelist;
151 freelist = freelist->next;
|
| /openbsd-current/sbin/restore/ |
| H A D | symtab.c | 206 * Unused symbol table entries are linked together on a freelist
209 static struct entry *freelist = NULL; variable in typeref:struct:entry
219 if (freelist != NULL) {
220 np = freelist;
221 freelist = np->e_next;
298 ep->e_next = freelist;
299 freelist = ep;
|
| /openbsd-current/lib/libc/gdtoa/ |
| H A D | misc.c | 34 static Bigint *freelist[Kmax+1]; variable
64 if (k <= Kmax && (rv = freelist[k]) !=0) {
65 freelist[k] = rv->next;
111 v->next = freelist[v->k];
112 freelist[v->k] = v;
|
| /openbsd-current/sys/dev/fdt/ |
| H A D | if_mvpp.c | 111 uint32_t *freelist; member in struct:mvpp2_bm_pool
628 bm->freelist = mallocarray(MVPP2_BM_SIZE, sizeof(*bm->freelist),
640 bm->freelist[j] = (i << 16) | (j << 0);
648 KASSERT(bm->freelist[bm->free_cons] != -1);
649 virt = bm->freelist[bm->free_cons];
650 bm->freelist[bm->free_cons] = -1;
2208 KASSERT(bm->freelist[bm->free_prod] == -1);
2209 bm->freelist[bm->free_prod] = virt & 0xffffffff;
2241 while (bm->freelist[b
[all...] |