2018-01-29 13:11:30 +00:00
|
|
|
/* SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
* Copyright 2015 6WIND S.A.
|
2018-03-20 19:20:35 +00:00
|
|
|
* Copyright 2015 Mellanox Technologies, Ltd
|
2015-10-30 18:52:30 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef RTE_PMD_MLX5_UTILS_H_
|
|
|
|
#define RTE_PMD_MLX5_UTILS_H_
|
|
|
|
|
|
|
|
#include <stddef.h>
|
2017-11-10 14:18:04 +00:00
|
|
|
#include <stdint.h>
|
2015-10-30 18:52:30 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <assert.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
#include "mlx5_defs.h"
|
|
|
|
|
2018-11-07 16:00:28 +00:00
|
|
|
/*
|
|
|
|
* Compilation workaround for PPC64 when AltiVec is fully enabled, e.g. std=c11.
|
|
|
|
* Otherwise there would be a type conflict between stdbool and altivec.
|
|
|
|
*/
|
|
|
|
#if defined(__PPC64__) && !defined(__APPLE_ALTIVEC__)
|
|
|
|
#undef bool
|
|
|
|
/* redefine as in stdbool.h */
|
|
|
|
#define bool _Bool
|
|
|
|
#endif
|
|
|
|
|
2015-10-30 18:52:30 +00:00
|
|
|
/* Bit-field manipulation. */
|
|
|
|
#define BITFIELD_DECLARE(bf, type, size) \
|
|
|
|
type bf[(((size_t)(size) / (sizeof(type) * CHAR_BIT)) + \
|
|
|
|
!!((size_t)(size) % (sizeof(type) * CHAR_BIT)))]
|
|
|
|
#define BITFIELD_DEFINE(bf, type, size) \
|
|
|
|
BITFIELD_DECLARE((bf), type, (size)) = { 0 }
|
|
|
|
#define BITFIELD_SET(bf, b) \
|
|
|
|
(assert((size_t)(b) < (sizeof(bf) * CHAR_BIT)), \
|
|
|
|
(void)((bf)[((b) / (sizeof((bf)[0]) * CHAR_BIT))] |= \
|
|
|
|
((size_t)1 << ((b) % (sizeof((bf)[0]) * CHAR_BIT)))))
|
|
|
|
#define BITFIELD_RESET(bf, b) \
|
|
|
|
(assert((size_t)(b) < (sizeof(bf) * CHAR_BIT)), \
|
|
|
|
(void)((bf)[((b) / (sizeof((bf)[0]) * CHAR_BIT))] &= \
|
|
|
|
~((size_t)1 << ((b) % (sizeof((bf)[0]) * CHAR_BIT)))))
|
|
|
|
#define BITFIELD_ISSET(bf, b) \
|
|
|
|
(assert((size_t)(b) < (sizeof(bf) * CHAR_BIT)), \
|
|
|
|
!!(((bf)[((b) / (sizeof((bf)[0]) * CHAR_BIT))] & \
|
|
|
|
((size_t)1 << ((b) % (sizeof((bf)[0]) * CHAR_BIT))))))
|
|
|
|
|
2017-11-10 14:18:04 +00:00
|
|
|
/* Convert a bit number to the corresponding 64-bit mask */
|
|
|
|
#define MLX5_BITSHIFT(v) (UINT64_C(1) << (v))
|
|
|
|
|
2015-10-30 18:52:30 +00:00
|
|
|
/* Save and restore errno around argument evaluation. */
|
|
|
|
#define ERRNO_SAFE(x) ((errno = (int []){ errno, ((x), 0) }[0]))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Helper macros to work around __VA_ARGS__ limitations in a C99 compliant
|
|
|
|
* manner.
|
|
|
|
*/
|
|
|
|
#define PMD_DRV_LOG_STRIP(a, b) a
|
|
|
|
#define PMD_DRV_LOG_OPAREN (
|
|
|
|
#define PMD_DRV_LOG_CPAREN )
|
|
|
|
#define PMD_DRV_LOG_COMMA ,
|
|
|
|
|
|
|
|
/* Return the file name part of a path. */
|
|
|
|
static inline const char *
|
|
|
|
pmd_drv_log_basename(const char *s)
|
|
|
|
{
|
|
|
|
const char *n = s;
|
|
|
|
|
|
|
|
while (*n)
|
|
|
|
if (*(n++) == '/')
|
|
|
|
s = n;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2018-03-13 09:23:56 +00:00
|
|
|
extern int mlx5_logtype;
|
|
|
|
|
|
|
|
#define PMD_DRV_LOG___(level, ...) \
|
|
|
|
rte_log(RTE_LOG_ ## level, \
|
|
|
|
mlx5_logtype, \
|
|
|
|
RTE_FMT(MLX5_DRIVER_NAME ": " \
|
|
|
|
RTE_FMT_HEAD(__VA_ARGS__,), \
|
|
|
|
RTE_FMT_TAIL(__VA_ARGS__,)))
|
|
|
|
|
2015-10-30 18:52:30 +00:00
|
|
|
/*
|
|
|
|
* When debugging is enabled (NDEBUG not defined), file, line and function
|
|
|
|
* information replace the driver name (MLX5_DRIVER_NAME) in log messages.
|
|
|
|
*/
|
|
|
|
#ifndef NDEBUG
|
|
|
|
|
|
|
|
#define PMD_DRV_LOG__(level, ...) \
|
|
|
|
PMD_DRV_LOG___(level, "%s:%u: %s(): " __VA_ARGS__)
|
|
|
|
#define PMD_DRV_LOG_(level, s, ...) \
|
|
|
|
PMD_DRV_LOG__(level, \
|
|
|
|
s "\n" PMD_DRV_LOG_COMMA \
|
|
|
|
pmd_drv_log_basename(__FILE__) PMD_DRV_LOG_COMMA \
|
|
|
|
__LINE__ PMD_DRV_LOG_COMMA \
|
|
|
|
__func__, \
|
|
|
|
__VA_ARGS__)
|
|
|
|
|
|
|
|
#else /* NDEBUG */
|
|
|
|
#define PMD_DRV_LOG__(level, ...) \
|
|
|
|
PMD_DRV_LOG___(level, __VA_ARGS__)
|
|
|
|
#define PMD_DRV_LOG_(level, s, ...) \
|
|
|
|
PMD_DRV_LOG__(level, s "\n", __VA_ARGS__)
|
|
|
|
|
|
|
|
#endif /* NDEBUG */
|
|
|
|
|
|
|
|
/* Generic printf()-like logging macro with automatic line feed. */
|
2018-03-13 09:23:56 +00:00
|
|
|
#define DRV_LOG(level, ...) \
|
2015-10-30 18:52:30 +00:00
|
|
|
PMD_DRV_LOG_(level, \
|
|
|
|
__VA_ARGS__ PMD_DRV_LOG_STRIP PMD_DRV_LOG_OPAREN, \
|
|
|
|
PMD_DRV_LOG_CPAREN)
|
|
|
|
|
2018-03-13 09:23:56 +00:00
|
|
|
/* claim_zero() does not perform any check when debugging is disabled. */
|
2015-10-30 18:52:30 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
|
2018-04-23 12:33:07 +00:00
|
|
|
#define DEBUG(...) DRV_LOG(DEBUG, __VA_ARGS__)
|
2015-10-30 18:52:30 +00:00
|
|
|
#define claim_zero(...) assert((__VA_ARGS__) == 0)
|
2017-10-09 14:44:50 +00:00
|
|
|
#define claim_nonzero(...) assert((__VA_ARGS__) != 0)
|
2015-10-30 18:52:30 +00:00
|
|
|
|
|
|
|
#else /* NDEBUG */
|
|
|
|
|
2018-04-23 12:33:07 +00:00
|
|
|
#define DEBUG(...) (void)0
|
2015-10-30 18:52:30 +00:00
|
|
|
#define claim_zero(...) (__VA_ARGS__)
|
2017-10-09 14:44:50 +00:00
|
|
|
#define claim_nonzero(...) (__VA_ARGS__)
|
2015-10-30 18:52:30 +00:00
|
|
|
|
|
|
|
#endif /* NDEBUG */
|
|
|
|
|
2018-04-23 12:33:07 +00:00
|
|
|
#define INFO(...) DRV_LOG(INFO, __VA_ARGS__)
|
|
|
|
#define WARN(...) DRV_LOG(WARNING, __VA_ARGS__)
|
|
|
|
#define ERROR(...) DRV_LOG(ERR, __VA_ARGS__)
|
|
|
|
|
2015-10-30 18:52:31 +00:00
|
|
|
/* Convenience macros for accessing mbuf fields. */
|
|
|
|
#define NEXT(m) ((m)->next)
|
|
|
|
#define DATA_LEN(m) ((m)->data_len)
|
|
|
|
#define PKT_LEN(m) ((m)->pkt_len)
|
|
|
|
#define DATA_OFF(m) ((m)->data_off)
|
|
|
|
#define SET_DATA_OFF(m, o) ((m)->data_off = (o))
|
|
|
|
#define NB_SEGS(m) ((m)->nb_segs)
|
|
|
|
#define PORT(m) ((m)->port)
|
|
|
|
|
2015-10-30 18:52:41 +00:00
|
|
|
/* Transpose flags. Useful to convert IBV to DPDK flags. */
|
|
|
|
#define TRANSPOSE(val, from, to) \
|
|
|
|
(((from) >= (to)) ? \
|
|
|
|
(((val) & (from)) / ((from) / (to))) : \
|
|
|
|
(((val) & (from)) * ((to) / (from))))
|
|
|
|
|
2015-10-30 18:52:30 +00:00
|
|
|
/* Allocate a buffer on the stack and fill it with a printf format string. */
|
|
|
|
#define MKSTR(name, ...) \
|
2019-12-11 06:49:25 +00:00
|
|
|
int mkstr_size_##name = snprintf(NULL, 0, "" __VA_ARGS__); \
|
|
|
|
char name[mkstr_size_##name + 1]; \
|
2015-10-30 18:52:30 +00:00
|
|
|
\
|
2019-12-11 06:49:25 +00:00
|
|
|
snprintf(name, sizeof(name), "" __VA_ARGS__)
|
2015-10-30 18:52:30 +00:00
|
|
|
|
2015-11-02 18:11:57 +00:00
|
|
|
/**
|
2019-11-06 13:07:56 +00:00
|
|
|
* Return logarithm of the nearest power of two above input value.
|
2015-11-02 18:11:57 +00:00
|
|
|
*
|
|
|
|
* @param v
|
|
|
|
* Input value.
|
|
|
|
*
|
|
|
|
* @return
|
2019-11-06 13:07:56 +00:00
|
|
|
* Logarithm of the nearest power of two above input value.
|
2015-11-02 18:11:57 +00:00
|
|
|
*/
|
|
|
|
static inline unsigned int
|
|
|
|
log2above(unsigned int v)
|
|
|
|
{
|
|
|
|
unsigned int l;
|
|
|
|
unsigned int r;
|
|
|
|
|
|
|
|
for (l = 0, r = 0; (v >> 1); ++l, v >>= 1)
|
|
|
|
r |= (v & 1);
|
2016-01-27 13:58:30 +00:00
|
|
|
return l + r;
|
2015-11-02 18:11:57 +00:00
|
|
|
}
|
|
|
|
|
2019-11-06 13:07:56 +00:00
|
|
|
/** Maximum size of string for naming the hlist table. */
|
|
|
|
#define MLX5_HLIST_NAMESIZE 32
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Structure of the entry in the hash list, user should define its own struct
|
|
|
|
* that contains this in order to store the data. The 'key' is 64-bits right
|
|
|
|
* now and its user's responsibility to guarantee there is no collision.
|
|
|
|
*/
|
|
|
|
struct mlx5_hlist_entry {
|
|
|
|
LIST_ENTRY(mlx5_hlist_entry) next; /* entry pointers in the list. */
|
|
|
|
uint64_t key; /* user defined 'key', could be the hash signature. */
|
|
|
|
};
|
|
|
|
|
|
|
|
/** Structure for hash head. */
|
|
|
|
LIST_HEAD(mlx5_hlist_head, mlx5_hlist_entry);
|
|
|
|
|
|
|
|
/** Type of function that is used to handle the data before freeing. */
|
|
|
|
typedef void (*mlx5_hlist_destroy_callback_fn)(void *p, void *ctx);
|
|
|
|
|
|
|
|
/** hash list table structure */
|
|
|
|
struct mlx5_hlist {
|
|
|
|
char name[MLX5_HLIST_NAMESIZE]; /**< Name of the hash list. */
|
|
|
|
/**< number of heads, need to be power of 2. */
|
|
|
|
uint32_t table_sz;
|
|
|
|
/**< mask to get the index of the list heads. */
|
|
|
|
uint32_t mask;
|
|
|
|
struct mlx5_hlist_head heads[]; /**< list head arrays. */
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a hash list table, the user can specify the list heads array size
|
|
|
|
* of the table, now the size should be a power of 2 in order to get better
|
|
|
|
* distribution for the entries. Each entry is a part of the whole data element
|
|
|
|
* and the caller should be responsible for the data element's allocation and
|
|
|
|
* cleanup / free. Key of each entry will be calculated with CRC in order to
|
|
|
|
* generate a little fairer distribution.
|
|
|
|
*
|
|
|
|
* @param name
|
|
|
|
* Name of the hash list(optional).
|
|
|
|
* @param size
|
|
|
|
* Heads array size of the hash list.
|
|
|
|
*
|
|
|
|
* @return
|
|
|
|
* Pointer of the hash list table created, NULL on failure.
|
|
|
|
*/
|
|
|
|
struct mlx5_hlist *mlx5_hlist_create(const char *name, uint32_t size);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Search an entry matching the key.
|
|
|
|
*
|
|
|
|
* @param h
|
|
|
|
* Pointer to the hast list table.
|
|
|
|
* @param key
|
|
|
|
* Key for the searching entry.
|
|
|
|
*
|
|
|
|
* @return
|
|
|
|
* Pointer of the hlist entry if found, NULL otherwise.
|
|
|
|
*/
|
|
|
|
struct mlx5_hlist_entry *mlx5_hlist_lookup(struct mlx5_hlist *h, uint64_t key);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Insert an entry to the hash list table, the entry is only part of whole data
|
|
|
|
* element and a 64B key is used for matching. User should construct the key or
|
|
|
|
* give a calculated hash signature and guarantee there is no collision.
|
|
|
|
*
|
|
|
|
* @param h
|
|
|
|
* Pointer to the hast list table.
|
|
|
|
* @param entry
|
|
|
|
* Entry to be inserted into the hash list table.
|
|
|
|
*
|
|
|
|
* @return
|
|
|
|
* - zero for success.
|
|
|
|
* - -EEXIST if the entry is already inserted.
|
|
|
|
*/
|
|
|
|
int mlx5_hlist_insert(struct mlx5_hlist *h, struct mlx5_hlist_entry *entry);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Remove an entry from the hash list table. User should guarantee the validity
|
|
|
|
* of the entry.
|
|
|
|
*
|
|
|
|
* @param h
|
|
|
|
* Pointer to the hast list table. (not used)
|
|
|
|
* @param entry
|
|
|
|
* Entry to be removed from the hash list table.
|
|
|
|
*/
|
|
|
|
void mlx5_hlist_remove(struct mlx5_hlist *h __rte_unused,
|
|
|
|
struct mlx5_hlist_entry *entry);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Destroy the hash list table, all the entries already inserted into the lists
|
|
|
|
* will be handled by the callback function provided by the user (including
|
|
|
|
* free if needed) before the table is freed.
|
|
|
|
*
|
|
|
|
* @param h
|
|
|
|
* Pointer to the hast list table.
|
|
|
|
* @param cb
|
|
|
|
* Callback function for each inserted entry when destroying the hash list.
|
|
|
|
* @param ctx
|
|
|
|
* Common context parameter used by callback function for each entry.
|
|
|
|
*/
|
|
|
|
void mlx5_hlist_destroy(struct mlx5_hlist *h,
|
|
|
|
mlx5_hlist_destroy_callback_fn cb, void *ctx);
|
|
|
|
|
2015-10-30 18:52:30 +00:00
|
|
|
#endif /* RTE_PMD_MLX5_UTILS_H_ */
|