Home
last modified time | relevance | path

Searched refs:queues_n (Results 1 – 7 of 7) sorted by relevance

/f-stack/dpdk/drivers/net/mlx5/
H A Dmlx5_rxq.c1902 return (ind_tbl->queues_n == queues_n) && in mlx5_ind_table_obj_match_queues()
1922 uint32_t queues_n) in mlx5_ind_table_obj_get() argument
1928 if ((ind_tbl->queues_n == queues_n) && in mlx5_ind_table_obj_get()
2019 uint32_t queues_n = ind_tbl->queues_n; in mlx5_ind_table_obj_setup() local
2024 log2above(queues_n) : in mlx5_ind_table_obj_setup()
2076 ind_tbl->queues_n = queues_n; in mlx5_ind_table_obj_new()
2116 log2above(queues_n) : in mlx5_ind_table_obj_modify()
2144 ind_tbl->queues_n = queues_n; in mlx5_ind_table_obj_modify()
2236 queues_n = hash_fields ? queues_n : 1; in mlx5_hrxq_modify()
2238 queues, queues_n)) { in mlx5_hrxq_modify()
[all …]
H A Dmlx5_devx.c713 const uint32_t queues_n) in mlx5_devx_ind_table_create_rqt_attr() argument
730 for (i = 0; i != queues_n; ++i) { in mlx5_devx_ind_table_create_rqt_attr()
766 ind_tbl->queues_n); in mlx5_devx_ind_table_new()
795 const uint16_t *queues, const uint32_t queues_n, in mlx5_devx_ind_table_modify() argument
804 queues_n); in mlx5_devx_ind_table_modify()
861 for (i = 0; i < ind_tbl->queues_n; ++i) { in mlx5_devx_tir_attr_set()
H A Dmlx5_rxtx.h351 uint32_t queues_n);
359 uint16_t *queues, const uint32_t queues_n,
385 const uint16_t *queues, uint32_t queues_n);
H A Dmlx5.h834 uint32_t queues_n; /**< Number of queues in the list. */ member
913 const uint16_t *queues, const uint32_t queues_n,
H A Dmlx5_flow.c1013 for (i = 0; i != hrxq->ind_table->queues_n; ++i) { in flow_drv_rxq_flags_set()
1096 for (i = 0; i != hrxq->ind_table->queues_n; ++i) { in flow_drv_rxq_flags_trim()
H A Dmlx5_flow_dv.c11471 shared_action->ind_tbl->queues_n = rss->queue_num; in __flow_dv_action_rss_create()
/f-stack/dpdk/drivers/net/mlx5/linux/
H A Dmlx5_verbs.c528 for (i = 0; i != ind_tbl->queues_n; ++i) { in mlx5_ibv_ind_table_new()