33 #define CDBL_LIST_ADD_REAR(first, newp) \  argument
38     if (unlikely ((first) == NULL))					      \
39       (first) = _newp->next = _newp->previous = _newp;			      \
42 	_newp->next = (first);						      \
43 	_newp->previous = (first)->previous;				      \
49 #define CDBL_LIST_DEL(first, elem) \  argument
53     assert (first != NULL && _elem != NULL				      \
54 	    && (first != elem						      \
55 		|| ({ __typeof (elem) _runp = first->next;		      \
56 		      while (_runp != first)				      \
63       first = NULL;							      \
68 	if (unlikely (first == _elem))					      \
69 	  first = _elem->next;						      \
76 #define SNGL_LIST_PUSH(first, newp) \  argument
80     _newp->next = first;						      \
81     first = _newp;							      \
86 #define CSNGL_LIST_ADD_REAR(first, newp) \  argument
90     if (unlikely ((first) == NULL))					      \
91       (first) = _newp->next = _newp;					      \
94 	_newp->next = (first)->next;					      \
95 	(first) = (first)->next = _newp;				      \