/freebsd-11-stable/contrib/ofed/librdmacm/ |
H A D | indexer.c | 69 entry[IDX_ENTRY_SIZE - 1].next = idx->free_list; 77 idx->free_list = start_index; 91 if ((index = idx->free_list) == 0) { 97 idx->free_list = entry[idx_entry_index(index)].next; 109 entry[idx_entry_index(index)].next = idx->free_list; 110 idx->free_list = index;
|
H A D | indexer.h | 44 * indexer by setting free_list and size to 0. 61 int free_list; member in struct:indexer
|
/freebsd-11-stable/contrib/libstdc++/src/ |
H A D | bitmap_allocator.cc | 47 free_list::_LT_pointer_compare); 51 free_list:: 106 free_list::
|
/freebsd-11-stable/contrib/binutils/gas/ |
H A D | sb.c | 51 } free_list; variable in typeref:struct:__anon362 63 e = free_list.size[size]; 68 e->next = free_list.size[size]; 70 free_list.size[size] = e; 75 free_list.size[size] = e->next; 96 ptr->item->next = free_list.size[ptr->pot]; 97 free_list.size[ptr->pot] = ptr->item;
|
/freebsd-11-stable/contrib/gcc/ |
H A D | alloc-pool.h | 40 alloc_pool_list free_list; member in struct:alloc_pool_def
|
H A D | alloc-pool.c | 164 pool->free_list = NULL; 236 if (!pool->free_list) 263 header->next = pool->free_list; 264 pool->free_list = header; 274 header = pool->free_list; 275 pool->free_list = header->next; 308 header->next = pool->free_list; 309 pool->free_list = header;
|
H A D | lists.c | 30 static void free_list (rtx *, rtx *); 50 free_list (rtx *listp, rtx *unused_listp) function 189 free_list (listp, &unused_expr_list); 198 free_list (listp, &unused_insn_list); 207 free_list (listp, &unused_deps_list);
|
H A D | tree-dump.h | 74 dump_queue_p free_list; member in struct:dump_info
|
/freebsd-11-stable/contrib/ofed/opensm/include/complib/ |
H A D | cl_qcomppool.h | 296 cl_qlist_t free_list; member in struct:_cl_qcpool 329 * free_list 546 return (cl_qlist_count(&p_pool->free_list)); 615 cl_qlist_insert_head(&p_pool->free_list, &p_pool_item->list_item); 672 cl_qlist_insert_list_head(&p_pool->free_list, p_list);
|
/freebsd-11-stable/sys/dev/qlnx/qlnxe/ |
H A D | ecore_fcoe.h | 42 osal_list_t free_list; member in struct:ecore_fcoe_info
|
H A D | ecore_iscsi.h | 45 osal_list_t free_list; member in struct:ecore_iscsi_info
|
/freebsd-11-stable/contrib/groff/src/libs/libgroff/ |
H A D | color.cpp | 49 color *color::free_list = 0; member in class:color 54 if (!free_list) { 56 free_list = (color *)new char[sizeof(color)*BLOCK]; 58 free_list[i].next = free_list + i + 1; 59 free_list[BLOCK-1].next = 0; 61 color *p = free_list; 62 free_list = (color *)(free_list->next); 70 ((color *)p)->next = free_list; [all...] |
/freebsd-11-stable/contrib/ofed/opensm/complib/ |
H A D | cl_pool.c | 144 cl_qlist_init(&p_pool->free_list); 184 while (!cl_is_qlist_empty(&p_pool->free_list)) { 187 free_list), 191 cl_qlist_remove_all(&p_pool->free_list); 302 cl_qlist_insert_head(&p_pool->free_list, 321 if (cl_is_qlist_empty(&p_pool->free_list)) { 335 if (cl_is_qlist_empty(&p_pool->free_list)) 339 p_list_item = cl_qlist_remove_head(&p_pool->free_list); 341 CL_ASSERT(p_list_item != cl_qlist_end(&p_pool->free_list)); 352 if (cl_is_qlist_empty(&p_pool->free_list)) { [all...] |
/freebsd-11-stable/sys/kern/ |
H A D | subr_mbpool.c | 88 SLIST_HEAD(, mbfree) free_list; /* free list */ 141 SLIST_INIT(&(*pp)->free_list); 228 SLIST_INSERT_HEAD(&p->free_list, f, link); 244 if ((cf = SLIST_FIRST(&p->free_list)) == NULL) { 246 cf = SLIST_FIRST(&p->free_list); 252 SLIST_REMOVE_HEAD(&p->free_list, link); 276 SLIST_INSERT_HEAD(&p->free_list, (struct mbfree *)ptr, link); 309 SLIST_INSERT_HEAD(&p->free_list, cf, link); 339 SLIST_FOREACH(cf, &p->free_list, link)
|
/freebsd-11-stable/sys/ofed/drivers/infiniband/core/ |
H A D | ib_fmr_pool.c | 62 * its pool's free_list (if the FMR can be mapped again; that is, 67 * either free_list or dirty_list. 73 * either free_list or dirty_list as appropriate. However, it is not 77 * free_list/dirty_list. 79 * Before we remap an FMR from free_list, we remove it from the cache 96 struct list_head free_list; member in struct:ib_fmr_pool 178 list_splice(&unmap_list, &pool->free_list); 247 INIT_LIST_HEAD(&pool->free_list); 314 list_add_tail(&fmr->list, &pool->free_list); 351 list_for_each_entry_safe(fmr, tmp, &pool->free_list, lis [all...] |
/freebsd-11-stable/usr.bin/du/ |
H A D | du.c | 369 static struct links_entry *free_list; local 396 if (new_buckets == NULL && free_list != NULL) { 397 while (free_list != NULL) { 398 le = free_list; 399 free_list = le->next; 452 le->next = free_list; 453 free_list = le; 464 if (free_list != NULL) { 466 le = free_list; 467 free_list [all...] |
/freebsd-11-stable/contrib/subversion/subversion/libsvn_delta/ |
H A D | compose_delta.c | 106 alloc_block(apr_pool_t *pool, alloc_block_t **free_list) 109 if (*free_list == NULL) 113 block = *free_list; 114 *free_list = block->next_free; 121 free_block(void *ptr, alloc_block_t **free_list) 125 block->next_free = *free_list; 126 *free_list = block; 222 alloc_block_t *free_list; 233 ndx->free_list = NULL; 244 range_index_node_t *const node = alloc_block(ndx->pool, &ndx->free_list); 105 alloc_block(apr_pool_t *pool, alloc_block_t **free_list) argument 120 free_block(void *ptr, alloc_block_t **free_list) argument 219 alloc_block_t *free_list; member in struct:range_index_t [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_allocator_primary32.h | 171 if (sci->free_list.empty()) { 174 DCHECK(!sci->free_list.empty()); 176 TransferBatch *b = sci->free_list.front(); 177 sci->free_list.pop_front(); 187 sci->free_list.push_front(b); 280 IntrusiveList<TransferBatch> free_list; variable 332 sci->free_list.push_back(b); 373 sci->free_list.push_back(b);
|
/freebsd-11-stable/contrib/groff/src/include/ |
H A D | color.h | 36 static color *free_list; member in class:color
|
/freebsd-11-stable/contrib/apr-util/misc/ |
H A D | apr_reslist.c | 56 apr_resring_t free_list; member in struct:apr_reslist_t 95 if (!APR_RING_EMPTY(&reslist->free_list, apr_res_t, link)) { 96 res = APR_RING_FIRST(&reslist->free_list); 109 APR_RING_INSERT_TAIL(&reslist->free_list, container, apr_res_t, link); 291 APR_RING_INIT(&rl->free_list, apr_res_t, link);
|
/freebsd-11-stable/contrib/groff/src/devices/grotty/ |
H A D | tty.cpp | 155 static glyph *free_list; member in class:glyph 171 glyph *glyph::free_list = 0; member in class:glyph 175 if (!free_list) { 177 free_list = (glyph *)new char[sizeof(glyph) * BLOCK]; 179 free_list[i].next = free_list + i + 1; 180 free_list[BLOCK - 1].next = 0; 182 glyph *p = free_list; 183 free_list = free_list [all...] |
/freebsd-11-stable/crypto/heimdal/lib/krb5/ |
H A D | keytab_any.c | 43 free_list (krb5_context context, struct any_data *a) function 94 free_list (context, a0); 115 free_list (context, a);
|
/freebsd-11-stable/sys/dev/isci/scil/ |
H A D | sci_abstract_list.h | 185 struct SCI_ABSTRACT_ELEMENT_LIST free_list; member in struct:SCI_ABSTRACT_ELEMENT_POOL 853 private_push_front(&(free_pool)->free_list, (alElement_p)); \ 864 alElement_p = private_pop_front(&(free_pool)->free_list); \
|
H A D | sci_abstract_list.c | 577 private_push_front(&(free_pool)->free_list, (alElement_p)); 590 alElement_p = private_pop_front(&(free_pool)->free_list);
|
/freebsd-11-stable/bin/ps/ |
H A D | ps.c | 150 static void free_list(struct listinfo *); 714 free_list(&gidlist); 715 free_list(&jidlist); 716 free_list(&pidlist); 717 free_list(&pgrplist); 718 free_list(&ruidlist); 719 free_list(&sesslist); 720 free_list(&ttylist); 721 free_list(&uidlist); 1143 free_list(struc function [all...] |