Home
last modified time | relevance | path

Searched refs:elem (Results 1 – 25 of 34) sorted by relevance

12

/dpdk/lib/eal/common/
H A Dmalloc_elem.c33 malloc_elem_find_max_iova_contig(struct malloc_elem *elem, size_t align) in malloc_elem_find_max_iova_contig() argument
43 page_sz = (size_t)elem->msl->page_sz; in malloc_elem_find_max_iova_contig()
44 data_start = RTE_PTR_ADD(elem, MALLOC_ELEM_HEADER_LEN); in malloc_elem_find_max_iova_contig()
45 data_end = RTE_PTR_ADD(elem, elem->size - MALLOC_ELEM_TRAILER_LEN); in malloc_elem_find_max_iova_contig()
58 if (!elem->msl->external && in malloc_elem_find_max_iova_contig()
65 ms = rte_mem_virt2memseg(cur_page, elem->msl); in malloc_elem_find_max_iova_contig()
93 ms = rte_mem_virt2memseg(contig_seg_start, elem->msl); in malloc_elem_find_max_iova_contig()
124 malloc_elem_init(struct malloc_elem *elem, struct malloc_heap *heap, in malloc_elem_init() argument
128 elem->heap = heap; in malloc_elem_init()
129 elem->msl = msl; in malloc_elem_init()
[all …]
H A Dmalloc_elem.h64 malloc_elem_cookies_ok(const struct malloc_elem *elem){ return elem != NULL; } in malloc_elem_cookies_ok() argument
68 set_header(struct malloc_elem *elem __rte_unused){ } in set_header()
72 set_trailer(struct malloc_elem *elem __rte_unused){ } in set_trailer()
82 #define MALLOC_ELEM_TRAILER(elem) (*((uint64_t*)RTE_PTR_ADD(elem, \ argument
83 elem->size - MALLOC_ELEM_TRAILER_LEN)))
84 #define MALLOC_ELEM_HEADER(elem) (elem->header_cookie) argument
87 set_header(struct malloc_elem *elem) in set_header() argument
89 if (elem != NULL) in set_header()
90 MALLOC_ELEM_HEADER(elem) = MALLOC_HEADER_COOKIE; in set_header()
94 set_trailer(struct malloc_elem *elem) in set_trailer() argument
[all …]
H A Dmalloc_heap.c93 struct malloc_elem *elem = start; in malloc_heap_add_memory() local
95 malloc_elem_init(elem, heap, msl, len, elem, len, dirty); in malloc_heap_add_memory()
97 malloc_elem_insert(elem); in malloc_heap_add_memory()
99 elem = malloc_elem_join_adjacent_free(elem); in malloc_heap_add_memory()
101 malloc_elem_free_list_insert(elem); in malloc_heap_add_memory()
103 return elem; in malloc_heap_add_memory()
154 struct malloc_elem *elem, *alt_elem = NULL; in find_suitable_element() local
158 for (elem = LIST_FIRST(&heap->free_head[idx]); in find_suitable_element()
159 !!elem; elem = LIST_NEXT(elem, free_list)) { in find_suitable_element()
160 if (malloc_elem_can_hold(elem, size, align, bound, in find_suitable_element()
[all …]
H A Drte_malloc.c114 struct malloc_elem *elem = malloc_elem_from_data(ptr); in rte_zmalloc_socket() local
116 if (elem->dirty) { in rte_zmalloc_socket()
172 struct malloc_elem *elem = malloc_elem_from_data(ptr); in rte_realloc_socket() local
173 if (elem == NULL) { in rte_realloc_socket()
186 (unsigned int)socket == elem->heap->socket_id) && in rte_realloc_socket()
188 malloc_heap_resize(elem, size) == 0) { in rte_realloc_socket()
191 asan_set_redzone(elem, user_size); in rte_realloc_socket()
204 const size_t old_size = old_malloc_size(elem); in rte_realloc_socket()
224 const struct malloc_elem *elem = malloc_elem_from_data(ptr); in rte_malloc_validate() local
225 if (!malloc_elem_cookies_ok(elem)) in rte_malloc_validate()
[all …]
H A Deal_common_memory.c1451 struct malloc_elem *elem; in handle_eal_element_list_request()
1495 elem = heap->first; in handle_eal_element_list_request()
1496 while (elem) { in handle_eal_element_list_request()
1497 elem_start_addr = (uint64_t)elem; in handle_eal_element_list_request()
1499 (uint64_t)RTE_PTR_ADD(elem_start_addr, elem->size); in handle_eal_element_list_request()
1504 elem = elem->next; in handle_eal_element_list_request()
1521 struct malloc_elem *elem; in handle_eal_element_info_request()
1574 elem = heap->first; in handle_eal_element_info_request()
1575 while (elem) { in handle_eal_element_info_request()
1449 struct malloc_elem *elem; handle_eal_element_list_request() local
1519 struct malloc_elem *elem; handle_eal_element_info_request() local
[all...]
H A Deal_common_memzone.c192 /* no size constraints were placed, so use malloc elem len */ in memzone_reserve_aligned_thread_unsafe()
206 struct malloc_elem *elem = malloc_elem_from_data(mz_addr); in memzone_reserve_aligned_thread_unsafe() local
220 malloc_heap_free(elem); in memzone_reserve_aligned_thread_unsafe()
229 elem->size - elem->pad - MALLOC_ELEM_OVERHEAD : in memzone_reserve_aligned_thread_unsafe()
231 mz->hugepage_sz = elem->msl->page_sz; in memzone_reserve_aligned_thread_unsafe()
232 mz->socket_id = elem->msl->socket_id; in memzone_reserve_aligned_thread_unsafe()
H A Dmalloc_heap.h69 malloc_heap_free(struct malloc_elem *elem);
72 malloc_heap_resize(struct malloc_elem *elem, size_t size);
H A Dmalloc_mp.c50 struct malloc_elem *elem; member
223 struct malloc_elem *elem; in handle_alloc_request() local
266 elem = alloc_pages_on_heap(heap, ar->page_sz, ar->elt_size, ar->socket, in handle_alloc_request()
270 if (elem == NULL) in handle_alloc_request()
286 req->alloc_state.elem = elem; in handle_alloc_request()
506 rollback_expand_heap(state->ms, state->ms_len, state->elem, in handle_sync_response()
/dpdk/lib/node/
H A Dethdev_ctrl.c72 ethdev_rx_node_elem_t *elem; in rte_node_eth_config() local
83 elem = malloc(sizeof(ethdev_rx_node_elem_t)); in rte_node_eth_config()
84 if (elem == NULL) in rte_node_eth_config()
86 memset(elem, 0, sizeof(ethdev_rx_node_elem_t)); in rte_node_eth_config()
87 elem->ctx.port_id = port_id; in rte_node_eth_config()
88 elem->ctx.queue_id = j; in rte_node_eth_config()
89 elem->ctx.cls_next = ETHDEV_RX_NEXT_PKT_CLS; in rte_node_eth_config()
90 elem->nid = id; in rte_node_eth_config()
91 elem->next = rx_node_data->head; in rte_node_eth_config()
92 rx_node_data->head = elem; in rte_node_eth_config()
[all …]
H A Dip4_reassembly.c133 ip4_reassembly_elem_t *elem; in rte_node_ip4_reassembly_configure()
137 elem = malloc(sizeof(ip4_reassembly_elem_t)); in rte_node_ip4_reassembly_configure()
138 if (elem == NULL) in rte_node_ip4_reassembly_configure()
140 elem->ctx.dr = cfg[i].dr; in rte_node_ip4_reassembly_configure()
141 elem->ctx.tbl = cfg[i].tbl; in rte_node_ip4_reassembly_configure()
142 elem->node_id = cfg[i].node_id; in rte_node_ip4_reassembly_configure()
143 elem->next = ip4_reassembly_main.head; in rte_node_ip4_reassembly_configure()
144 ip4_reassembly_main.head = elem; in rte_node_ip4_reassembly_configure()
154 ip4_reassembly_elem_t *elem = ip4_reassembly_main.head; in ip4_reassembly_node_init()
157 while (elem) { in ip4_reassembly_node_init()
132 ip4_reassembly_elem_t *elem; rte_node_ip4_reassembly_configure() local
153 ip4_reassembly_elem_t *elem = ip4_reassembly_main.head; ip4_reassembly_node_init() local
[all...]
H A Dethdev_rx.c182 ethdev_rx_node_elem_t *elem = ethdev_rx_main.head; in ethdev_rx_node_init() local
186 while (elem) { in ethdev_rx_node_init()
187 if (elem->nid == node->id) { in ethdev_rx_node_init()
189 memcpy(ctx, &elem->ctx, sizeof(ethdev_rx_node_ctx_t)); in ethdev_rx_node_init()
192 elem = elem->next; in ethdev_rx_node_init()
195 RTE_VERIFY(elem != NULL); in ethdev_rx_node_init()
H A Dkernel_rx.c194 kernel_rx_node_elem_t *elem = rx_node_main->head; in kernel_rx_node_init() local
198 while (elem) { in kernel_rx_node_init()
199 if (elem->nid == node->id) { in kernel_rx_node_init()
201 memcpy(ctx, &elem->ctx, sizeof(kernel_rx_node_ctx_t)); in kernel_rx_node_init()
204 elem = elem->next; in kernel_rx_node_init()
207 RTE_VERIFY(elem != NULL); in kernel_rx_node_init()
/dpdk/lib/member/
H A Drte_member_heap.h43 struct node *elem; member
116 if (memcmp(hp->elem[hp_idx].key, key, hp->key_len) == 0) in hash_table_lookup()
149 if (hash_table_insert(hp->elem[i].key, in resize_hash_table()
175 heap->elem = rte_zmalloc_socket(NULL, sizeof(struct node) * size, in rte_member_minheap_init()
177 if (heap->elem == NULL) { in rte_member_minheap_init()
193 rte_free(heap->elem); in rte_member_minheap_init()
220 hp->elem[LCHILD(idx)].count < hp->elem[idx].count) in rte_member_heapify()
226 hp->elem[RCHILD(idx)].count < hp->elem[smallest].count) in rte_member_heapify()
230 rte_member_heap_swap(&(hp->elem[idx]), &(hp->elem[smallest])); in rte_member_heapify()
233 if (hash_table_update(hp->elem[smallest].key, idx + 1, smallest + 1, in rte_member_heapify()
[all …]
H A Drte_member_sketch.c335 uint64_t count = ss->sketch_lookup(ss, runtime_var->heap.elem[i].key); in rte_member_update_heap()
337 runtime_var->heap.elem[i].count = count; in rte_member_update_heap()
367 if (runtime_var->heap.size > 0 && count >= runtime_var->heap.elem[0].count) in rte_member_lookup_sketch()
430 if (key_cnt > runtime_var->heap.elem[0].count) { in heap_update()
434 if (runtime_var->heap.elem[found].count < key_cnt) in heap_update()
437 runtime_var->heap.elem[found].count = key_cnt; in heap_update()
447 if (runtime_var->heap.elem[found].count < key_cnt) in heap_update()
450 runtime_var->heap.elem[found].count = key_cnt; in heap_update()
/dpdk/drivers/net/mlx5/hws/
H A Dmlx5dr_pool.c323 struct mlx5dr_pool_elements *elem; in mlx5dr_pool_element_create_new_elem() local
328 elem = simple_calloc(1, sizeof(*elem)); in mlx5dr_pool_element_create_new_elem()
329 if (!elem) { in mlx5dr_pool_element_create_new_elem()
339 elem->bitmap = mlx5dr_pool_create_and_init_bitmap(alloc_size - order); in mlx5dr_pool_element_create_new_elem()
340 if (!elem->bitmap) { in mlx5dr_pool_element_create_new_elem()
353 pool->db.element_manager->elements[idx] = elem; in mlx5dr_pool_element_create_new_elem()
355 return elem; in mlx5dr_pool_element_create_new_elem()
358 rte_free(elem->bitmap); in mlx5dr_pool_element_create_new_elem()
360 simple_free(elem); in mlx5dr_pool_element_create_new_elem()
364 static int mlx5dr_pool_element_find_seg(struct mlx5dr_pool_elements *elem, int *seg) in mlx5dr_pool_element_find_seg() argument
[all …]
/dpdk/drivers/net/qede/base/
H A Decore_spq.c134 OSAL_LE32_TO_CPU(p_ent->elem.hdr.cid), in ecore_spq_block()
135 p_ent->elem.hdr.cmd_id, p_ent->elem.hdr.protocol_id, in ecore_spq_block()
136 OSAL_LE16_TO_CPU(p_ent->elem.hdr.echo)); in ecore_spq_block()
175 p_ent->elem.hdr.cid, p_ent->elem.hdr.cmd_id, in ecore_spq_fill_entry()
176 p_ent->elem.hdr.protocol_id, in ecore_spq_fill_entry()
177 p_ent->elem.data_ptr.hi, p_ent->elem.data_ptr.lo, in ecore_spq_fill_entry()
258 struct slow_path_element *elem; in ecore_spq_hw_post() local
260 p_ent->elem.hdr.echo = OSAL_CPU_TO_LE16(echo); in ecore_spq_hw_post()
261 elem = ecore_chain_produce(p_chain); in ecore_spq_hw_post()
262 if (!elem) { in ecore_spq_hw_post()
[all …]
/dpdk/drivers/net/bnx2x/
H A Decore_sp.c61 struct ecore_exeq_elem *elem) in ecore_exe_queue_free_elem() argument
64 ECORE_FREE(sc, elem, sizeof(*elem)); in ecore_exe_queue_free_elem()
69 struct ecore_exeq_elem *elem; in ecore_exe_queue_length() local
74 ECORE_LIST_FOR_EACH_ENTRY(elem, &o->exe_queue, link, in ecore_exe_queue_length()
94 struct ecore_exeq_elem *elem, int restore) in ecore_exe_queue_add() argument
102 rc = o->optimize(sc, o->owner, elem); in ecore_exe_queue_add()
107 rc = o->validate(sc, o->owner, elem); in ecore_exe_queue_add()
115 ECORE_LIST_PUSH_TAIL(&elem->link, &o->exe_queue); in ecore_exe_queue_add()
122 ecore_exe_queue_free_elem(sc, elem); in ecore_exe_queue_add()
132 struct ecore_exeq_elem *elem; in __ecore_exe_queue_reset_pending() local
[all …]
/dpdk/lib/table/
H A Drte_swx_table_selector.c317 struct rte_swx_table_selector_member *elem; in group_check() local
323 TAILQ_FOREACH(elem, &group->members, node) { in group_check()
332 if (elem->member_id >= t->params.n_members_per_group_max || in group_check()
333 !elem->member_weight) in group_check()
338 if (e->member_id == elem->member_id) in group_check()
355 struct rte_swx_table_selector_member *elem; in members_read() local
361 TAILQ_FOREACH(elem, &group->members, node) { in members_read()
366 m->member_id = elem->member_id; in members_read()
367 m->member_weight = elem->member_weight; in members_read()
368 m->member_weight_normalized = elem->member_weight; in members_read()
/dpdk/lib/pipeline/
H A Drte_swx_pipeline.c100 struct struct_type *elem; in struct_type_find() local
102 TAILQ_FOREACH(elem, &p->struct_types, node) in struct_type_find()
103 if (strcmp(elem->name, name) == 0) in struct_type_find()
104 return elem; in struct_type_find()
225 struct struct_type *elem; in struct_free() local
227 elem = TAILQ_FIRST(&p->struct_types); in struct_free()
228 if (!elem) in struct_free()
231 TAILQ_REMOVE(&p->struct_types, elem, node); in struct_free()
232 free(elem->fields); in struct_free()
233 free(elem); in struct_free()
[all …]
/dpdk/lib/eal/linux/include/
H A Drte_os.h21 #define RTE_TAILQ_NEXT(elem, field) TAILQ_NEXT(elem, field)
25 RTE_TAILQ_NEXT(elem,field) global() argument
/dpdk/lib/eal/freebsd/include/
H A Drte_os.h21 #define RTE_TAILQ_NEXT(elem, field) TAILQ_NEXT(elem, field)
25 RTE_TAILQ_NEXT(elem,field) global() argument
/dpdk/lib/rcu/
H A Drcu_qsbr_pvt.h55 uint8_t elem[]; /**< Pointer to user element */ member
/dpdk/drivers/net/ionic/
H A Dionic_rxtx.c345 ionic_tx_tso_next(struct ionic_tx_qcq *txq, struct ionic_txq_sg_elem **elem) in ionic_tx_tso_next() argument
353 *elem = sg_desc->elems; in ionic_tx_tso_next()
363 struct ionic_txq_sg_elem *elem; in ionic_tx_tso() local
402 desc = ionic_tx_tso_next(txq, &elem); in ionic_tx_tso()
420 elem->addr = next_addr; in ionic_tx_tso()
421 elem->len = rte_cpu_to_le_16(len); in ionic_tx_tso()
422 elem++; in ionic_tx_tso()
446 desc = ionic_tx_tso_next(txq, &elem); in ionic_tx_tso()
H A Dionic_rxtx_sg.c86 struct ionic_txq_sg_elem *elem; in ionic_tx_sg() local
140 elem = sg_desc->elems; in ionic_tx_sg()
149 elem->len = rte_cpu_to_le_16(txm_seg->data_len); in ionic_tx_sg()
150 elem->addr = rte_cpu_to_le_64(data_iova); in ionic_tx_sg()
151 elem++; in ionic_tx_sg()
/dpdk/lib/eal/windows/include/sys/
H A Dqueue.h112 #define QMD_TRACE_ELEM(elem) do { \ argument
113 (elem)->trace.prevline = (elem)->trace.lastline; \
114 (elem)->trace.prevfile = (elem)->trace.lastfile; \
115 (elem)->trace.lastline = __LINE__; \
116 (elem)->trace.lastfile = __FILE__; \
120 #define QMD_TRACE_ELEM(elem) argument

12