37 	struct _DL_LIST *pPrev;  member
44 	{(pList)->pPrev = pList; (pList)->pNext = pList; }
48 	{   (pList)->pPrev = (pItem); \
51 	    (pItem)->pPrev = (pList); \
54 #define DL_LIST_IS_EMPTY(pList) (((pList)->pPrev == (pList)) && \
57 #define DL_LIST_GET_ITEM_AT_TAIL(pList) (pList)->pPrev
105 	pAdd->pPrev = pList->pPrev;  in dl_list_insert_tail()
107 	if (pList->pPrev)  in dl_list_insert_tail()
108 		pList->pPrev->pNext = pAdd;  in dl_list_insert_tail()
109 	pList->pPrev = pAdd;  in dl_list_insert_tail()
119 	pAdd->pPrev = pList;  in dl_list_insert_head()
121 	pList->pNext->pPrev = pAdd;  in dl_list_insert_head()
133 		pDel->pNext->pPrev = pDel->pPrev;  in dl_list_remove()
134 	if (pDel->pPrev)  in dl_list_remove()
135 		pDel->pPrev->pNext = pDel->pNext;  in dl_list_remove()
138 	pDel->pPrev = pDel;  in dl_list_remove()
161 	if (pList->pPrev != pList) {  in dl_list_remove_item_from_tail()
162 		pItem = pList->pPrev;  in dl_list_remove_item_from_tail()
175 		pSrc->pPrev->pNext = pDest;  in dl_list_transfer_items_to_tail()
176 		pSrc->pNext->pPrev = pDest->pPrev;  in dl_list_transfer_items_to_tail()
177 		pDest->pPrev->pNext = pSrc->pNext;  in dl_list_transfer_items_to_tail()
178 		pDest->pPrev = pSrc->pPrev;  in dl_list_transfer_items_to_tail()
180 		pSrc->pPrev = pSrc;  in dl_list_transfer_items_to_tail()
191 		pSrc->pNext->pPrev = pDest;  in dl_list_transfer_items_to_head()
192 		pDest->pNext->pPrev = pSrc->pPrev;  in dl_list_transfer_items_to_head()
193 		pSrc->pPrev->pNext = pDest->pNext;  in dl_list_transfer_items_to_head()
196 		pSrc->pPrev = pSrc;  in dl_list_transfer_items_to_head()