* published by the Free Software Foundation.
*/
+#include <stddef.h>
+
struct cds_hlist_head
{
struct cds_hlist_node *next;
#define cds_hlist_entry(ptr, type, member) \
((type *) ((char *) (ptr) - (unsigned long) (&((type *) 0)->member)))
+/* Get first entry from a list. Assumes the hlist is not empty. */
+#define cds_hlist_first_entry(ptr, type, member) \
+ cds_list_entry((ptr)->next, type, member)
+
+static inline int cds_hlist_empty(struct cds_hlist_head *head)
+{
+ return !head->next;
+}
+
/* 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)
#define cds_hlist_for_each_entry(entry, pos, head, member) \
for (pos = (head)->next, \
- entry = cds_hlist_entry(pos, typeof(*entry), member); \
+ entry = cds_hlist_entry(pos, __typeof__(*entry), member); \
pos != NULL; \
pos = pos->next, \
- entry = cds_hlist_entry(pos, typeof(*entry), member))
+ 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); \
+ entry = cds_hlist_entry(pos, __typeof__(*entry), member); \
(pos != NULL) && ({ p = pos->next; 1;}); \
pos = p, \
- entry = cds_hlist_entry(pos, typeof(*entry), member))
+ entry = cds_hlist_entry(pos, __typeof__(*entry), member))
#endif /* _KCOMPAT_HLIST_H */