96 			   n * sizeof(struct mr_cache_entry), 0, SOCKET_ID_ANY);  in mr_btree_expand()
128 	struct mr_cache_entry *lkp_tbl;  in mr_btree_lookup()
169 mr_btree_insert(struct mlx5_mr_btree *bt, struct mr_cache_entry *entry)  in mr_btree_insert()
171 	struct mr_cache_entry *lkp_tbl;  in mr_btree_insert()
195 	shift = (bt->len - idx) * sizeof(struct mr_cache_entry);  in mr_btree_insert()
230 				sizeof(struct mr_cache_entry) * n,  in mlx5_mr_btree_init()
241 	(*bt->table)[bt->len++] = (struct mr_cache_entry) {  in mlx5_mr_btree_init()
277 	struct mr_cache_entry *lkp_tbl;  in mlx5_mr_btree_dump()
283 		struct mr_cache_entry *entry = &lkp_tbl[idx];  in mlx5_mr_btree_dump()
335 mr_find_next_chunk(struct mlx5_mr *mr, struct mr_cache_entry *entry,  in mr_find_next_chunk()
405 		struct mr_cache_entry entry;  in mlx5_mr_insert_cache()
438 		    struct mr_cache_entry *entry, uintptr_t addr)  in mlx5_mr_lookup_list()
449 			struct mr_cache_entry ret;  in mlx5_mr_lookup_list()
478 		     struct mr_cache_entry *entry, uintptr_t addr)  in mlx5_mr_lookup_cache()
610 			 struct mr_cache_entry *entry, uintptr_t addr)  in mlx5_mr_create_secondary()
655 		       struct mr_cache_entry *entry, uintptr_t addr,  in mlx5_mr_create_primary()
806 		struct mr_cache_entry ret;  in mlx5_mr_create_primary()
896 	       struct mr_cache_entry *entry, uintptr_t addr)  in mlx5_mr_create()
931 		 struct mr_cache_entry *entry, uintptr_t addr)  in mr_lookup_caches()
993 	struct mr_cache_entry *repl = &mr_ctrl->cache[mr_ctrl->head];  in mlx5_mr_addr2mr_bh()
1186 		struct mr_cache_entry entry;  in mlx5_free_mr_by_addr()
1258 			struct mr_cache_entry ret = { 0, };  in mlx5_mr_dump_cache()
1830 			 struct mr_cache_entry *entry)  in mlx5_mempool_reg_addr2mr()
1868 			 struct mr_cache_entry *entry,  in mlx5_lookup_mempool_regs()
1934 		struct mr_cache_entry entry;  in mlx5_mr_mempool_populate_cache()
1972 	struct mr_cache_entry *repl = &mr_ctrl->cache[mr_ctrl->head];  in mlx5_mr_mempool2mr_bh()