[urcu.git] / urcu / hlist.h

#ifndef _KCOMPAT_HLIST_H
#define _KCOMPAT_HLIST_H

/*
 * Kernel sourcecode compatible lightweight single pointer list head useful
 * for implementing hash tables
 *
 * Copyright (C) 2009 Novell Inc.
 *
 * Author: Jan Blunck <jblunck@suse.de>
 *
 * Copyright (C) 2010-2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License version 2.1 as
 * published by the Free  Software Foundation.
 */

#include <stddef.h>

struct cds_hlist_head {
	struct cds_hlist_node *next;
};

struct cds_hlist_node {
	struct cds_hlist_node *next, *prev;
};

/* Initialize a new list head. */
static inline
void CDS_INIT_HLIST_HEAD(struct cds_hlist_head *ptr)
{
	ptr->next = NULL;
}

/* Get typed element from list at a given position. */
#define cds_hlist_entry(ptr, type, member) \
	((type *) ((char *) (ptr) - (unsigned long) (&((type *) 0)->member)))

/* Add new element at the head of the list. */
static inline
void cds_hlist_add_head(struct cds_hlist_node *newp,
		struct cds_hlist_head *head)
{
	if (head->next)
		head->next->prev = newp;
	newp->next = head->next;
	newp->prev = (struct cds_hlist_node *) head;
	head->next = newp;
}

/* Remove element from list. */
static inline
void cds_hlist_del(struct cds_hlist_node *elem)
{
	if (elem->next)
		elem->next->prev = elem->prev;
	elem->prev->next = elem->next;
}

#define cds_hlist_for_each_entry(entry, pos, head, member) \
	for (pos = (head)->next, \
			entry = cds_hlist_entry(pos, __typeof__(*entry), member); \
		pos != NULL; \
		pos = pos->next, \
			entry = cds_hlist_entry(pos, __typeof__(*entry), member))

#define cds_hlist_for_each_entry_safe(entry, pos, p, head, member) \
	for (pos = (head)->next, \
			entry = cds_hlist_entry(pos, __typeof__(*entry), member); \
		(pos != NULL) && ({ p = pos->next; 1;}); \
		pos = p, \
			entry = cds_hlist_entry(pos, __typeof__(*entry), member))

#endif	/* _KCOMPAT_HLIST_H */
Commit	Line	Data
	1	#ifndef _KCOMPAT_HLIST_H
	2	#define _KCOMPAT_HLIST_H
	3
	4	/*
	5	* Kernel sourcecode compatible lightweight single pointer list head useful
	6	* for implementing hash tables
	7	*
	8	* Copyright (C) 2009 Novell Inc.
	9	*
	10	* Author: Jan Blunck <jblunck@suse.de>
	11	*
	12	* Copyright (C) 2010-2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
	13	*
	14	* This program is free software; you can redistribute it and/or modify it
	15	* under the terms of the GNU Lesser General Public License version 2.1 as
	16	* published by the Free Software Foundation.
	17	*/
	18
	19	#include <stddef.h>
	20
	21	struct cds_hlist_head {
	22	struct cds_hlist_node *next;
	23	};
	24
	25	struct cds_hlist_node {
	26	struct cds_hlist_node next, prev;
	27	};
	28
	29	/* Initialize a new list head. */
	30	static inline
	31	void CDS_INIT_HLIST_HEAD(struct cds_hlist_head *ptr)
	32	{
	33	ptr->next = NULL;
	34	}
	35
	36	/* Get typed element from list at a given position. */
	37	#define cds_hlist_entry(ptr, type, member) \
	38	((type ) ((char ) (ptr) - (unsigned long) (&((type *) 0)->member)))
	39
	40	/* Add new element at the head of the list. */
	41	static inline
	42	void cds_hlist_add_head(struct cds_hlist_node *newp,
	43	struct cds_hlist_head *head)
	44	{
	45	if (head->next)
	46	head->next->prev = newp;
	47	newp->next = head->next;
	48	newp->prev = (struct cds_hlist_node *) head;
	49	head->next = newp;
	50	}
	51
	52	/* Remove element from list. */
	53	static inline
	54	void cds_hlist_del(struct cds_hlist_node *elem)
	55	{
	56	if (elem->next)
	57	elem->next->prev = elem->prev;
	58	elem->prev->next = elem->next;
	59	}
	60
	61	#define cds_hlist_for_each_entry(entry, pos, head, member) \
	62	for (pos = (head)->next, \
	63	entry = cds_hlist_entry(pos, __typeof__(*entry), member); \
	64	pos != NULL; \
	65	pos = pos->next, \
	66	entry = cds_hlist_entry(pos, __typeof__(*entry), member))
	67
	68	#define cds_hlist_for_each_entry_safe(entry, pos, p, head, member) \
	69	for (pos = (head)->next, \
	70	entry = cds_hlist_entry(pos, __typeof__(*entry), member); \
	71	(pos != NULL) && ({ p = pos->next; 1;}); \
	72	pos = p, \
	73	entry = cds_hlist_entry(pos, __typeof__(*entry), member))
	74
	75	#endif /* _KCOMPAT_HLIST_H */