| /f-stack/freebsd/contrib/openzfs/module/zfs/ |
| H A D | zfs_rlock.c | 554 list_t *free_list) in zfs_rangelock_exit_reader() argument
572 list_insert_tail(free_list, remove); in zfs_rangelock_exit_reader()
604 list_insert_tail(free_list, lr); in zfs_rangelock_exit_reader()
618 list_t free_list; in zfs_rangelock_exit() local
629 list_create(&free_list, sizeof (zfs_locked_range_t), in zfs_rangelock_exit()
640 list_insert_tail(&free_list, lr); in zfs_rangelock_exit()
646 zfs_rangelock_exit_reader(rl, lr, &free_list); in zfs_rangelock_exit()
650 while ((free_lr = list_remove_head(&free_list)) != NULL) in zfs_rangelock_exit()
653 list_destroy(&free_list); in zfs_rangelock_exit()
|
| H A D | zvol.c | 1192 list_t free_list; in zvol_remove_minors_impl() local
1197 list_create(&free_list, sizeof (zvol_state_t), in zvol_remove_minors_impl()
1237 list_insert_head(&free_list, zv); in zvol_remove_minors_impl()
1245 while ((zv = list_head(&free_list)) != NULL) { in zvol_remove_minors_impl()
1246 list_remove(&free_list, zv); in zvol_remove_minors_impl()
|
| /f-stack/app/micro_thread/ |
| H A D | mt_cache.cpp | 93 TAILQ_INIT(&mng->free_list); in sk_buffer_mng_init()
103 TAILQ_FOREACH_SAFE(item, &mng->free_list, entry, tmp) in sk_buffer_mng_destroy()
105 TAILQ_REMOVE(&mng->free_list, item, entry); in sk_buffer_mng_destroy()
117 TSkBuffer* item = TAILQ_FIRST(&mng->free_list); in alloc_sk_buffer()
120 TAILQ_REMOVE(&mng->free_list, item, entry); in alloc_sk_buffer()
140 TAILQ_INSERT_TAIL(&mng->free_list, buff, entry); in free_sk_buffer()
152 TAILQ_FOREACH_SAFE(item, &mng->free_list, entry, tmp) in recycle_sk_buffer()
159 TAILQ_REMOVE(&mng->free_list, item, entry); in recycle_sk_buffer()
|
| H A D | mt_cache.h | 61 TSkBuffList free_list; member
|
| /f-stack/dpdk/drivers/net/mlx5/ |
| H A D | mlx5_utils.c | 469 pool->free_list = TRUNK_INVALID; in mlx5_ipool_create()
542 pool->free_list = idx; in mlx5_ipool_grow()
565 if (pool->free_list == TRUNK_INVALID) { in mlx5_ipool_malloc()
573 trunk = pool->trunks[pool->free_list]; in mlx5_ipool_malloc()
598 MLX5_ASSERT(pool->free_list == trunk->idx); in mlx5_ipool_malloc()
599 pool->free_list = trunk->next; in mlx5_ipool_malloc()
650 if (pool->free_list == trunk->idx) in mlx5_ipool_free()
651 pool->free_list = trunk->next; in mlx5_ipool_free()
671 trunk->next = pool->free_list; in mlx5_ipool_free()
673 if (pool->free_list != TRUNK_INVALID) in mlx5_ipool_free()
[all …]
|
| H A D | mlx5_utils.h | 231 uint32_t free_list; /* Index to first free trunk. */ member
|
| /f-stack/dpdk/lib/librte_eal/common/ |
| H A D | malloc_elem.c | 138 memset(&elem->free_list, 0, sizeof(elem->free_list)); in malloc_elem_init()
414 LIST_INSERT_HEAD(&elem->heap->free_head[idx], elem, free_list); in malloc_elem_free_list_insert()
423 LIST_REMOVE(elem, free_list); in malloc_elem_free_list_remove()
|
| H A D | malloc_elem.h | 27 LIST_ENTRY(malloc_elem) free_list;
|
| H A D | malloc_heap.c | 163 !!elem; elem = LIST_NEXT(elem, free_list)) { in find_suitable_element()
196 !!elem; elem = LIST_NEXT(elem, free_list)) { in find_biggest_element()
1044 !!elem; elem = LIST_NEXT(elem, free_list)) in malloc_heap_get_stats()
|
| /f-stack/dpdk/drivers/net/qede/base/ |
| H A D | ecore_hw.c | 36 osal_list_t free_list; member
57 OSAL_LIST_INIT(&p_pool->free_list); in ecore_ptt_pool_alloc()
69 &p_pool->free_list); in ecore_ptt_pool_alloc()
125 if (!OSAL_LIST_IS_EMPTY(&p_hwfn->p_ptt_pool->free_list)) { in ecore_ptt_acquire()
127 &p_hwfn->p_ptt_pool->free_list, in ecore_ptt_acquire()
130 &p_hwfn->p_ptt_pool->free_list); in ecore_ptt_acquire()
157 OSAL_LIST_PUSH_HEAD(&p_ptt->list_entry, &p_hwfn->p_ptt_pool->free_list); in ecore_ptt_release()
|
| /f-stack/dpdk/drivers/common/mlx5/ |
| H A D | mlx5_common_mr.c | 476 struct mlx5_mr_list free_list = LIST_HEAD_INITIALIZER(free_list); in mlx5_mr_garbage_collect() local
486 free_list = share_cache->mr_free_list; in mlx5_mr_garbage_collect()
490 mr_next = LIST_FIRST(&free_list); in mlx5_mr_garbage_collect()
|
| /f-stack/dpdk/drivers/net/mlx4/ |
| H A D | mlx4_mr.c | 490 struct mlx4_mr_list free_list = LIST_HEAD_INITIALIZER(free_list); in mlx4_mr_garbage_collect() local
500 free_list = priv->mr.mr_free_list; in mlx4_mr_garbage_collect()
504 mr_next = LIST_FIRST(&free_list); in mlx4_mr_garbage_collect()
|
| /f-stack/dpdk/drivers/net/ice/ |
| H A D | ice_ethdev.h | 197 struct res_list free_list; /* Available resource list */ member
|
| H A D | ice_ethdev.c | 624 LIST_INIT(&pool->free_list); in ice_res_pool_init()
630 LIST_INSERT_HEAD(&pool->free_list, entry, next); in ice_res_pool_init()
653 LIST_FOREACH(entry, &pool->free_list, next) { in ice_res_pool_alloc()
721 for (entry = LIST_FIRST(&pool->free_list); in ice_res_pool_destroy()
732 LIST_INIT(&pool->free_list); in ice_res_pool_destroy()
|
| /f-stack/dpdk/drivers/net/vhost/ |
| H A D | rte_eth_vhost.c | 1001 goto free_list; in vhost_driver_setup()
1042 free_list: in vhost_driver_setup()
|
| /f-stack/dpdk/drivers/net/i40e/ |
| H A D | i40e_ethdev.h | 433 struct res_list free_list; /* Available resource list */ member
|
| H A D | i40e_ethdev.c | 4955 LIST_INIT(&pool->free_list); in i40e_res_pool_init()
4961 LIST_INSERT_HEAD(&pool->free_list, entry, next); in i40e_res_pool_init()
4980 for (entry = LIST_FIRST(&pool->free_list); in i40e_res_pool_destroy()
4991 LIST_INIT(&pool->free_list); in i40e_res_pool_destroy()
5030 LIST_FOREACH(entry, &pool->free_list, next) { in i40e_res_pool_free()
5076 LIST_INSERT_HEAD(&pool->free_list, valid_entry, next); in i40e_res_pool_free()
5104 LIST_FOREACH(entry, &pool->free_list, next) { in i40e_res_pool_alloc()
|
| /f-stack/dpdk/doc/guides/prog_guide/ |
| H A D | env_abstraction_layer.rst | 865 * free_list - this is a structure pointing to previous and next elements in
897 The ``FREE`` element is then added to the ``free_list`` for the malloc heap.
910 The ``heap_alloc()`` function will scan the free_list of the heap, and attempt
|