52 			   n * sizeof(struct mr_cache_entry), 0, SOCKET_ID_ANY);  in mr_btree_expand()
84 	struct mr_cache_entry *lkp_tbl;  in mr_btree_lookup()
125 mr_btree_insert(struct mlx5_mr_btree *bt, struct mr_cache_entry *entry)  in mr_btree_insert()
127 	struct mr_cache_entry *lkp_tbl;  in mr_btree_insert()
151 	shift = (bt->len - idx) * sizeof(struct mr_cache_entry);  in mr_btree_insert()
186 				sizeof(struct mr_cache_entry) * n,  in mlx5_mr_btree_init()
196 	(*bt->table)[bt->len++] = (struct mr_cache_entry) {  in mlx5_mr_btree_init()
232 	struct mr_cache_entry *lkp_tbl;  in mlx5_mr_btree_dump()
238 		struct mr_cache_entry *entry = &lkp_tbl[idx];  in mlx5_mr_btree_dump()
262 mr_find_next_chunk(struct mlx5_mr *mr, struct mr_cache_entry *entry,  in mr_find_next_chunk()
332 		struct mr_cache_entry entry;  in mlx5_mr_insert_cache()
365 		    struct mr_cache_entry *entry, uintptr_t addr)  in mlx5_mr_lookup_list()
376 			struct mr_cache_entry ret;  in mlx5_mr_lookup_list()
405 		     struct mr_cache_entry *entry, uintptr_t addr)  in mlx5_mr_lookup_cache()
541 			 struct mr_cache_entry *entry, uintptr_t addr,  in mlx5_mr_create_secondary()
588 		       struct mr_cache_entry *entry, uintptr_t addr,  in mlx5_mr_create_primary()
738 		struct mr_cache_entry ret;  in mlx5_mr_create_primary()
828 	       struct mr_cache_entry *entry, uintptr_t addr,  in mlx5_mr_create()
871 		 struct mr_cache_entry *entry, uintptr_t addr,  in mr_lookup_caches()
936 	struct mr_cache_entry *repl = &mr_ctrl->cache[mr_ctrl->head];  in mlx5_mr_addr2mr_bh()
1088 			struct mr_cache_entry ret = { 0, };  in mlx5_mr_dump_cache()