Searched refs:lkp_tbl (Results 1 – 4 of 4) sorted by relevance
104 mlx4_mr_lookup_cache(struct mlx4_mr_cache *lkp_tbl, uint16_t *cached_idx, in mlx4_mr_lookup_cache() argument109 if (likely(addr >= lkp_tbl[*cached_idx].start && in mlx4_mr_lookup_cache()110 addr < lkp_tbl[*cached_idx].end)) in mlx4_mr_lookup_cache()111 return lkp_tbl[*cached_idx].lkey; in mlx4_mr_lookup_cache()112 for (idx = 0; idx < n && lkp_tbl[idx].start != 0; ++idx) { in mlx4_mr_lookup_cache()113 if (addr >= lkp_tbl[idx].start && in mlx4_mr_lookup_cache()114 addr < lkp_tbl[idx].end) { in mlx4_mr_lookup_cache()117 return lkp_tbl[idx].lkey; in mlx4_mr_lookup_cache()
111 struct mlx4_mr_cache *lkp_tbl; in mr_btree_lookup() local116 lkp_tbl = *bt->table; in mr_btree_lookup()120 lkp_tbl[0].lkey == UINT32_MAX)); in mr_btree_lookup()134 if (addr < lkp_tbl[base].end) in mr_btree_lookup()135 return lkp_tbl[base].lkey; in mr_btree_lookup()154 struct mlx4_mr_cache *lkp_tbl; in mr_btree_insert() local161 lkp_tbl = *bt->table; in mr_btree_insert()179 memmove(&lkp_tbl[idx + 1], &lkp_tbl[idx], shift); in mr_btree_insert()180 lkp_tbl[idx] = *entry; in mr_btree_insert()255 struct mlx4_mr_cache *lkp_tbl; in mlx4_mr_btree_dump() local[all …]
107 mlx5_mr_lookup_lkey(struct mr_cache_entry *lkp_tbl, uint16_t *cached_idx, in mlx5_mr_lookup_lkey() argument112 if (likely(addr >= lkp_tbl[*cached_idx].start && in mlx5_mr_lookup_lkey()113 addr < lkp_tbl[*cached_idx].end)) in mlx5_mr_lookup_lkey()114 return lkp_tbl[*cached_idx].lkey; in mlx5_mr_lookup_lkey()115 for (idx = 0; idx < n && lkp_tbl[idx].start != 0; ++idx) { in mlx5_mr_lookup_lkey()116 if (addr >= lkp_tbl[idx].start && in mlx5_mr_lookup_lkey()117 addr < lkp_tbl[idx].end) { in mlx5_mr_lookup_lkey()120 return lkp_tbl[idx].lkey; in mlx5_mr_lookup_lkey()
84 struct mr_cache_entry *lkp_tbl; in mr_btree_lookup() local89 lkp_tbl = *bt->table; in mr_btree_lookup()93 lkp_tbl[0].lkey == UINT32_MAX)); in mr_btree_lookup()107 if (addr < lkp_tbl[base].end) in mr_btree_lookup()108 return lkp_tbl[base].lkey; in mr_btree_lookup()127 struct mr_cache_entry *lkp_tbl; in mr_btree_insert() local134 lkp_tbl = *bt->table; in mr_btree_insert()153 memmove(&lkp_tbl[idx + 1], &lkp_tbl[idx], shift); in mr_btree_insert()154 lkp_tbl[idx] = *entry; in mr_btree_insert()232 struct mr_cache_entry *lkp_tbl; in mlx5_mr_btree_dump() local[all …]