Home
last modified time | relevance | path

Searched refs:bt (Results 1 – 6 of 6) sorted by relevance

/dpdk/drivers/net/mlx4/
H A Dmlx4_mr.c88 bt->size = n; in mr_btree_expand()
117 n = bt->len; in mr_btree_lookup()
159 MLX4_ASSERT(bt->len <= bt->size); in mr_btree_insert()
171 if (unlikely(bt->len == bt->size)) { in mr_btree_insert()
181 bt->len++; in mr_btree_insert()
208 memset(bt, 0, sizeof(*bt)); in mlx4_mr_btree_init()
220 (*bt->table)[bt->len++] = (struct mlx4_mr_cache) { in mlx4_mr_btree_init()
224 (void *)bt, (void *)bt->table); in mlx4_mr_btree_init()
241 memset(bt, 0, sizeof(*bt)); in mlx4_mr_btree_free()
1025 if (unlikely(bt->len == bt->size)) in mlx4_mr_lookup_dev()
[all …]
H A Dmlx4_mr.h72 #define mlx4_mr_btree_len(bt) ((bt)->len - 1) argument
74 int mlx4_mr_btree_init(struct mlx4_mr_btree *bt, int n, int socket);
75 void mlx4_mr_btree_free(struct mlx4_mr_btree *bt);
76 void mlx4_mr_btree_dump(struct mlx4_mr_btree *bt);
/dpdk/drivers/common/mlx5/
H A Dmlx5_common_mr.c176 MLX5_ASSERT(bt->len <= bt->size); in mr_btree_insert()
189 if (unlikely(bt->len == bt->size)) { in mr_btree_insert()
227 MLX5_ASSERT(!bt->table && !bt->size); in mlx5_mr_btree_init()
228 memset(bt, 0, sizeof(*bt)); in mlx5_mr_btree_init()
245 (void *)bt, (void *)bt->table); in mlx5_mr_btree_init()
261 (void *)bt, (void *)bt->table); in mlx5_mr_btree_free()
263 memset(bt, 0, sizeof(*bt)); in mlx5_mr_btree_free()
943 if (unlikely(bt->len == bt->size)) in mr_lookup_caches()
944 mr_btree_expand(bt, bt->size << 1); in mr_lookup_caches()
1879 if (unlikely(bt->len == bt->size)) in mlx5_lookup_mempool_regs()
[all …]
H A Dmlx5_common_mr.h216 void mlx5_mr_btree_free(struct mlx5_mr_btree *bt);
217 void mlx5_mr_btree_dump(struct mlx5_mr_btree *bt __rte_unused);
/dpdk/app/dumpcap/
H A Dmain.c707 static unsigned int bt; in show_count() local
709 for (i = 0; i < bt; i++) in show_count()
712 bt = fprintf(stderr, "%"PRIu64" ", count); in show_count()
/dpdk/drivers/net/mlx5/
H A Dmlx5_rx.h31 #define mlx5_mr_btree_len(bt) ((bt)->len - 1) argument