/freebsd-13-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-13-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
|
H A D | ecore_hw.c | 68 osal_list_t free_list; member in struct:ecore_ptt_pool 89 OSAL_LIST_INIT(&p_pool->free_list); 101 &p_pool->free_list); 144 if (!OSAL_LIST_IS_EMPTY(&p_hwfn->p_ptt_pool->free_list)) { 145 p_ptt = OSAL_LIST_FIRST_ENTRY(&p_hwfn->p_ptt_pool->free_list, 148 &p_hwfn->p_ptt_pool->free_list); 172 OSAL_LIST_PUSH_HEAD(&p_ptt->list_entry, &p_hwfn->p_ptt_pool->free_list);
|
/freebsd-13-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-13-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-13-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...] |
H A D | ib_iwcm.c | 72 struct list_head free_list; member in struct:iwcm_work 108 free_list); 109 list_del_init(&work->free_list); 115 list_add(&work->free_list, &work->cm_id->work_free_list); 123 kfree(list_entry(e, struct iwcm_work, free_list));
|
/freebsd-13-stable/usr.bin/du/ |
H A D | du.c | 371 static struct links_entry *free_list; local 398 if (new_buckets == NULL && free_list != NULL) { 399 while (free_list != NULL) { 400 le = free_list; 401 free_list = le->next; 454 le->next = free_list; 455 free_list = le; 466 if (free_list != NULL) { 468 le = free_list; 469 free_list [all...] |
/freebsd-13-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-13-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-13-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-13-stable/sys/contrib/openzfs/module/zfs/ |
H A D | zfs_rlock.c | 554 list_t *free_list) 572 list_insert_tail(free_list, remove); 604 list_insert_tail(free_list, lr); 618 list_t free_list; local 629 list_create(&free_list, sizeof (zfs_locked_range_t), 640 list_insert_tail(&free_list, lr); 646 zfs_rangelock_exit_reader(rl, lr, &free_list); 650 while ((free_lr = list_remove_head(&free_list)) != NULL) 653 list_destroy(&free_list); 553 zfs_rangelock_exit_reader(zfs_rangelock_t *rl, zfs_locked_range_t *remove, list_t *free_list) argument
|
H A D | zvol.c | 1206 list_t free_list; local 1211 list_create(&free_list, sizeof (zvol_state_t), 1251 list_insert_head(&free_list, zv); 1259 while ((zv = list_head(&free_list)) != NULL) { 1260 list_remove(&free_list, zv);
|
/freebsd-13-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-13-stable/sys/dev/isci/scil/ |
H A D | sci_abstract_list.h | 187 struct SCI_ABSTRACT_ELEMENT_LIST free_list; member in struct:SCI_ABSTRACT_ELEMENT_POOL 855 private_push_front(&(free_pool)->free_list, (alElement_p)); \ 866 alElement_p = private_pop_front(&(free_pool)->free_list); \
|
H A D | sci_abstract_list.c | 579 private_push_front(&(free_pool)->free_list, (alElement_p)); 592 alElement_p = private_pop_front(&(free_pool)->free_list);
|
/freebsd-13-stable/bin/ps/ |
H A D | ps.c | 152 static void free_list(struct listinfo *); 730 free_list(&gidlist); 731 free_list(&jidlist); 732 free_list(&pidlist); 733 free_list(&pgrplist); 734 free_list(&ruidlist); 735 free_list(&sesslist); 736 free_list(&ttylist); 737 free_list(&uidlist); 1159 free_list(struc function [all...] |
/freebsd-13-stable/sys/dev/drm2/ttm/ |
H A D | ttm_page_alloc_dma.c | 88 * @lock: Protects the inuse_list and free_list from concurrnet access. Must be 93 * @free_list: Pool of pages that are free to be used. No order requirements. 110 struct list_head free_list; member in struct:dma_pool 448 list_for_each_entry_safe_reverse(dma_p, tmp, &pool->free_list, 599 INIT_LIST_HEAD(&pool->free_list); 811 list_splice(&d_pages, &pool->free_list); 825 list_splice_tail(&d_pages, &pool->free_list); 850 d_page = list_first_entry(&pool->free_list, struct dma_page, page_list); 968 list_splice(&ttm_dma->pages_list, &pool->free_list);
|
/freebsd-13-stable/contrib/dialog/ |
H A D | fselect.c | 126 free_list(LIST * list, int reinit) function 468 free_list(d_list, TRUE); 469 free_list(f_list, TRUE); 916 free_list(&d_list, FALSE); 917 free_list(&f_list, FALSE);
|
H A D | editbox.c | 124 free_list(char ***list, int *rows) function 758 free_list(&list, &rows);
|
/freebsd-13-stable/sys/dev/vmware/pvscsi/ |
H A D | pvscsi.c | 203 SLIST_HEAD(, pvscsi_hcb) free_list; 366 hcb = SLIST_FIRST(&sc->free_list); 368 SLIST_REMOVE_HEAD(&sc->free_list, links); 382 SLIST_INSERT_HEAD(&sc->free_list, hcb, links); 606 SLIST_INIT(&sc->free_list); 609 SLIST_INSERT_HEAD(&sc->free_list, hcb, links);
|
/freebsd-13-stable/sys/dev/esp/ |
H A D | ncr53c9xvar.h | 383 TAILQ_HEAD(,ncr53c9x_ecb) free_list; member in struct:ncr53c9x_softc
|
H A D | ncr53c9x.c | 385 TAILQ_INIT(&sc->free_list); 398 TAILQ_INSERT_HEAD(&sc->free_list, ecb, free_links); 946 TAILQ_INSERT_TAIL(&sc->free_list, ecb, free_links); 956 ecb = TAILQ_FIRST(&sc->free_list); 960 TAILQ_REMOVE(&sc->free_list, ecb, free_links);
|