| /dpdk/drivers/net/bnxt/tf_core/ |
| H A D | dpool.c | 88 struct dpool_free_list *free_list; in dpool_defrag() local
113 if (free_list == NULL) { in dpool_defrag()
137 free_list->size = 0; in dpool_defrag()
149 free_list->entry[free_list->size].index = index; in dpool_defrag()
150 free_list->entry[free_list->size].size = count; in dpool_defrag()
153 largest_free_index = free_list->size; in dpool_defrag()
157 free_list->size++; in dpool_defrag()
162 if (free_list->size == 0) in dpool_defrag()
239 for (i = 0; i < free_list->size; i++) { in dpool_defrag()
255 tfp_free(free_list); in dpool_defrag()
[all …]
|
| /dpdk/drivers/net/mlx5/ |
| H A D | mlx5_utils.c | 116 pool->free_list = TRUNK_INVALID; in mlx5_ipool_create()
180 MLX5_ASSERT(pool->free_list == TRUNK_INVALID); in mlx5_ipool_grow()
181 pool->free_list = idx; in mlx5_ipool_grow()
523 if (pool->free_list == TRUNK_INVALID) { in mlx5_ipool_malloc()
531 trunk = pool->trunks[pool->free_list]; in mlx5_ipool_malloc()
557 pool->free_list = trunk->next; in mlx5_ipool_malloc()
612 if (pool->free_list == trunk->idx) in mlx5_ipool_free()
613 pool->free_list = trunk->next; in mlx5_ipool_free()
633 trunk->next = pool->free_list; in mlx5_ipool_free()
635 if (pool->free_list != TRUNK_INVALID) in mlx5_ipool_free()
[all …]
|
| H A D | mlx5_utils.h | 258 uint32_t free_list; /* Index to first free trunk. */ member
|
| /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()
|
| /dpdk/lib/eal/common/ |
| H A D | malloc_elem.c | 132 memset(&elem->free_list, 0, sizeof(elem->free_list)); in malloc_elem_init()
409 LIST_INSERT_HEAD(&elem->heap->free_head[idx], elem, free_list); in malloc_elem_free_list_insert()
418 LIST_REMOVE(elem, free_list); in malloc_elem_free_list_remove()
|
| H A D | malloc_elem.h | 29 LIST_ENTRY(malloc_elem) free_list;
|
| H A D | malloc_heap.c | 159 !!elem; elem = LIST_NEXT(elem, free_list)) { in find_suitable_element()
192 !!elem; elem = LIST_NEXT(elem, free_list)) { in find_biggest_element()
1113 !!elem; elem = LIST_NEXT(elem, free_list)) in malloc_heap_get_stats()
|
| /dpdk/drivers/net/mlx4/ |
| H A D | mlx4_mr.c | 489 struct mlx4_mr_list free_list = LIST_HEAD_INITIALIZER(free_list); in mlx4_mr_garbage_collect() local
499 free_list = priv->mr.mr_free_list; in mlx4_mr_garbage_collect()
503 mr_next = LIST_FIRST(&free_list); in mlx4_mr_garbage_collect()
|
| /dpdk/drivers/common/mlx5/ |
| H A D | mlx5_common_mr.c | 548 struct mlx5_mr_list free_list = LIST_HEAD_INITIALIZER(free_list); in mlx5_mr_garbage_collect() local
558 free_list = share_cache->mr_free_list; in mlx5_mr_garbage_collect()
562 mr_next = LIST_FIRST(&free_list); in mlx5_mr_garbage_collect()
|
| /dpdk/drivers/net/ice/ |
| H A D | ice_ethdev.h | 243 struct res_list free_list; /* Available resource list */ member
|
| H A D | ice_ethdev.c | 682 LIST_INIT(&pool->free_list); in ice_res_pool_init()
688 LIST_INSERT_HEAD(&pool->free_list, entry, next); in ice_res_pool_init()
711 LIST_FOREACH(entry, &pool->free_list, next) { in ice_res_pool_alloc()
779 for (entry = LIST_FIRST(&pool->free_list); in ice_res_pool_destroy()
790 LIST_INIT(&pool->free_list); in ice_res_pool_destroy()
|
| /dpdk/drivers/net/vhost/ |
| H A D | rte_eth_vhost.c | 1016 goto free_list; in vhost_driver_setup()
1057 free_list: in vhost_driver_setup()
|
| /dpdk/drivers/net/i40e/ |
| H A D | i40e_ethdev.h | 444 struct res_list free_list; /* Available resource list */ member
|
| H A D | i40e_ethdev.c | 4915 LIST_INIT(&pool->free_list); in i40e_res_pool_init()
4921 LIST_INSERT_HEAD(&pool->free_list, entry, next); in i40e_res_pool_init()
4940 for (entry = LIST_FIRST(&pool->free_list); in i40e_res_pool_destroy()
4951 LIST_INIT(&pool->free_list); in i40e_res_pool_destroy()
4990 LIST_FOREACH(entry, &pool->free_list, next) { in i40e_res_pool_free()
5036 LIST_INSERT_HEAD(&pool->free_list, valid_entry, next); in i40e_res_pool_free()
5064 LIST_FOREACH(entry, &pool->free_list, next) { in i40e_res_pool_alloc()
|
| /dpdk/doc/guides/prog_guide/ |
| H A D | env_abstraction_layer.rst | 955 * free_list - this is a structure pointing to previous and next elements in
992 The ``FREE`` element is then added to the ``free_list`` for the malloc heap.
1005 The ``heap_alloc()`` function will scan the free_list of the heap, and attempt
|