On Wed, 28 Aug 2019 14:51:49 +0800
Bing Zhao wrote:
> +
> +/** Node element structure on the LIST of the link */
> +struct rte_hlist_node_entry {
> + LIST_ENTRY(rte_hlist_node_entry) next; /**< Next element pointer. */
> + /**< Data element inside this noed. */
> + struct rte_hlist_d
On Wed, 28 Aug 2019 14:51:49 +0800
Bing Zhao wrote:
> +#ifndef FALSE
> +#define FALSE 0
> +#endif
> +#ifndef TRUE
> +#define TRUE 1
> +#endif
Please use stdbool rather than reinventing boolean type.
On Wed, 28 Aug 2019 14:51:49 +0800
Bing Zhao wrote:
> +
> +/* To enable the deletion when iterating the list */
> +#ifndef LIST_FOREACH_SAFE
> +#define LIST_FOREACH_SAFE(var, head, field, tvar)\
> + for ((var) = ((head)->lh_first);\
> +
An extendible hash list library supporting add, delete, lookup action.
Extending when the elements number of any list reach the pre-set max
value, and splitting of the list is done passively when this list is
being accessed(add, del, lookup). Right now, it is not a multi-thread
safe implementation
4 matches
Mail list logo
