uint32_t need_lock:1;
/* Lock is needed for multiple thread usage. */
uint32_t release_mem_en:1; /* Rlease trunk when it is free. */
+ uint32_t max_idx; /* The maximum index can be allocated. */
+ uint32_t per_core_cache;
+ /*
+ * Cache entry number per core for performance. Should not be
+ * set with release_mem_en.
+ */
const char *type; /* Memory allocate type name. */
void *(*malloc)(uint32_t flags, size_t size, unsigned int align,
int socket);
uint8_t data[] __rte_cache_aligned; /* Entry data start. */
};
+struct mlx5_indexed_cache {
+ struct mlx5_indexed_trunk **trunks;
+ volatile uint32_t n_trunk_valid; /* Trunks allocated. */
+ uint32_t n_trunk; /* Trunk pointer array size. */
+ uint32_t ref_cnt;
+ uint32_t len;
+ uint32_t idx[];
+};
+
+struct mlx5_ipool_per_lcore {
+ struct mlx5_indexed_cache *lc;
+ uint32_t len; /**< Current cache count. */
+ uint32_t idx[]; /**< Cache objects. */
+};
+
struct mlx5_indexed_pool {
struct mlx5_indexed_pool_config cfg; /* Indexed pool configuration. */
- rte_spinlock_t lock; /* Pool lock for multiple thread usage. */
- uint32_t n_trunk_valid; /* Trunks allocated. */
- uint32_t n_trunk; /* Trunk pointer array size. */
+ rte_spinlock_t rsz_lock; /* Pool lock for multiple thread usage. */
+ rte_spinlock_t lcore_lock;
/* Dim of trunk pointer array. */
- struct mlx5_indexed_trunk **trunks;
- uint32_t free_list; /* Index to first free trunk. */
+ union {
+ struct {
+ uint32_t n_trunk_valid; /* Trunks allocated. */
+ uint32_t n_trunk; /* Trunk pointer array size. */
+ struct mlx5_indexed_trunk **trunks;
+ uint32_t free_list; /* Index to first free trunk. */
+ };
+ struct {
+ struct mlx5_indexed_cache *gc;
+ /* Global cache. */
+ struct mlx5_ipool_per_lcore *cache[RTE_MAX_LCORE + 1];
+ /* Local cache. */
+ struct rte_bitmap *ibmp;
+ void *bmp_mem;
+ /* Allocate objects bitmap. Use during flush. */
+ };
+ };
#ifdef POOL_DEBUG
uint32_t n_entry;
uint32_t trunk_new;
return l + r;
}
-/************************ cache list *****************************/
-
-/** Maximum size of string for naming. */
-#define MLX5_NAME_SIZE 32
-
-struct mlx5_cache_list;
-
-/**
- * Structure of the entry in the cache list, user should define its own struct
- * that contains this in order to store the data.
- */
-struct mlx5_cache_entry {
- LIST_ENTRY(mlx5_cache_entry) next; /* Entry pointers in the list. */
- uint32_t ref_cnt; /* Reference count. */
-};
-
-/**
- * Type of callback function for entry removal.
- *
- * @param list
- * The cache list.
- * @param entry
- * The entry in the list.
- */
-typedef void (*mlx5_cache_remove_cb)(struct mlx5_cache_list *list,
- struct mlx5_cache_entry *entry);
-
-/**
- * Type of function for user defined matching.
- *
- * @param list
- * The cache list.
- * @param entry
- * The entry in the list.
- * @param ctx
- * The pointer to new entry context.
- *
- * @return
- * 0 if matching, non-zero number otherwise.
- */
-typedef int (*mlx5_cache_match_cb)(struct mlx5_cache_list *list,
- struct mlx5_cache_entry *entry, void *ctx);
-
-/**
- * Type of function for user defined cache list entry creation.
- *
- * @param list
- * The cache list.
- * @param entry
- * The new allocated entry, NULL if list entry size unspecified,
- * New entry has to be allocated in callback and return.
- * @param ctx
- * The pointer to new entry context.
- *
- * @return
- * Pointer of entry on success, NULL otherwise.
- */
-typedef struct mlx5_cache_entry *(*mlx5_cache_create_cb)
- (struct mlx5_cache_list *list,
- struct mlx5_cache_entry *entry,
- void *ctx);
-
-/**
- * Linked cache list structure.
- *
- * Entry in cache list could be reused if entry already exists,
- * reference count will increase and the existing entry returns.
- *
- * When destroy an entry from list, decrease reference count and only
- * destroy when no further reference.
- *
- * Linked list cache is designed for limited number of entries cache,
- * read mostly, less modification.
- *
- * For huge amount of entries cache, please consider hash list cache.
- *
- */
-struct mlx5_cache_list {
- char name[MLX5_NAME_SIZE]; /**< Name of the cache list. */
- uint32_t entry_sz; /**< Entry size, 0: use create callback. */
- rte_rwlock_t lock; /* read/write lock. */
- uint32_t gen_cnt; /* List modification will update generation count. */
- uint32_t count; /* number of entries in list. */
- void *ctx; /* user objects target to callback. */
- mlx5_cache_create_cb cb_create; /**< entry create callback. */
- mlx5_cache_match_cb cb_match; /**< entry match callback. */
- mlx5_cache_remove_cb cb_remove; /**< entry remove callback. */
- LIST_HEAD(mlx5_cache_head, mlx5_cache_entry) head;
-};
-
-/**
- * Initialize a cache list.
- *
- * @param list
- * Pointer to the hast list table.
- * @param name
- * Name of the cache list.
- * @param entry_size
- * Entry size to allocate, 0 to allocate by creation callback.
- * @param ctx
- * Pointer to the list context data.
- * @param cb_create
- * Callback function for entry create.
- * @param cb_match
- * Callback function for entry match.
- * @param cb_remove
- * Callback function for entry remove.
- * @return
- * 0 on success, otherwise failure.
- */
-int mlx5_cache_list_init(struct mlx5_cache_list *list,
- const char *name, uint32_t entry_size, void *ctx,
- mlx5_cache_create_cb cb_create,
- mlx5_cache_match_cb cb_match,
- mlx5_cache_remove_cb cb_remove);
-
-/**
- * Search an entry matching the key.
- *
- * Result returned might be destroyed by other thread, must use
- * this function only in main thread.
- *
- * @param list
- * Pointer to the cache list.
- * @param ctx
- * Common context parameter used by entry callback function.
- *
- * @return
- * Pointer of the cache entry if found, NULL otherwise.
- */
-struct mlx5_cache_entry *mlx5_cache_lookup(struct mlx5_cache_list *list,
- void *ctx);
-
-/**
- * Reuse or create an entry to the cache list.
- *
- * @param list
- * Pointer to the hast list table.
- * @param ctx
- * Common context parameter used by callback function.
- *
- * @return
- * registered entry on success, NULL otherwise
- */
-struct mlx5_cache_entry *mlx5_cache_register(struct mlx5_cache_list *list,
- void *ctx);
-
-/**
- * Remove an entry from the cache list.
- *
- * User should guarantee the validity of the entry.
- *
- * @param list
- * Pointer to the hast list.
- * @param entry
- * Entry to be removed from the cache list table.
- * @return
- * 0 on entry removed, 1 on entry still referenced.
- */
-int mlx5_cache_unregister(struct mlx5_cache_list *list,
- struct mlx5_cache_entry *entry);
-
-/**
- * Destroy the cache list.
- *
- * @param list
- * Pointer to the cache list.
- */
-void mlx5_cache_list_destroy(struct mlx5_cache_list *list);
-
-/**
- * Get entry number from the cache list.
- *
- * @param list
- * Pointer to the hast list.
- * @return
- * Cache list entry number.
- */
-uint32_t
-mlx5_cache_list_get_entry_num(struct mlx5_cache_list *list);
-
/********************************* indexed pool *************************/
/**
*/
void mlx5_ipool_dump(struct mlx5_indexed_pool *pool);
+/**
+ * This function flushes all the cache index back to pool trunk.
+ *
+ * @param pool
+ * Pointer to the index memory pool handler.
+ *
+ */
+
+void mlx5_ipool_flush_cache(struct mlx5_indexed_pool *pool);
+
+/**
+ * This function gets the available entry from pos.
+ *
+ * @param pool
+ * Pointer to the index memory pool handler.
+ * @param pos
+ * Pointer to the index position start from.
+ *
+ * @return
+ * - Pointer to the next available entry.
+ *
+ */
+void *mlx5_ipool_get_next(struct mlx5_indexed_pool *pool, uint32_t *pos);
+
/**
* This function allocates new empty Three-level table.
*
(entry); \
idx++, (entry) = mlx5_l3t_get_next((tbl), &idx))
+#define MLX5_IPOOL_FOREACH(ipool, idx, entry) \
+ for ((idx) = 0, mlx5_ipool_flush_cache((ipool)), \
+ (entry) = mlx5_ipool_get_next((ipool), &idx); \
+ (entry); idx++, (entry) = mlx5_ipool_get_next((ipool), &idx))
+
#endif /* RTE_PMD_MLX5_UTILS_H_ */
git.droids-corp.org / dpdk.git / blobdiff