38 	struct _DL_LIST *pNext;  member
44 	{(pList)->pPrev = pList; (pList)->pNext = pList; }
49 	    (pList)->pNext = (pItem); \
50 	    (pItem)->pNext = (pList); \
55 				((pList)->pNext == (pList)))
56 #define DL_LIST_GET_ITEM_AT_HEAD(pList) (pList)->pNext
64 		for ((pTemp) = (pStart)->pNext; pTemp != (pStart); \
65 					(pTemp) = (pTemp)->pNext)
89 		{ pTemp = (pStart)->pNext; }			    \
92 			{ pTemp = pTemp->pNext; }			       \
95 #define ITERATE_RESET(pStart) { pTemp = (pStart)->pNext; }
106 	pAdd->pNext = pList;  in dl_list_insert_tail()
108 		pList->pPrev->pNext = pAdd;  in dl_list_insert_tail()
120 	pAdd->pNext = pList->pNext;  in dl_list_insert_head()
121 	pList->pNext->pPrev = pAdd;  in dl_list_insert_head()
122 	pList->pNext = pAdd;  in dl_list_insert_head()
132 	if (pDel->pNext)  in dl_list_remove()
133 		pDel->pNext->pPrev = pDel->pPrev;  in dl_list_remove()
135 		pDel->pPrev->pNext = pDel->pNext;  in dl_list_remove()
137 	pDel->pNext = pDel;  in dl_list_remove()
149 	if (pList->pNext != pList) {  in dl_list_remove_item_from_head()
150 		pItem = pList->pNext;  in dl_list_remove_item_from_head()
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()
181 		pSrc->pNext = 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()
194 		pDest->pNext = pSrc->pNext;  in dl_list_transfer_items_to_head()
197 		pSrc->pNext = pSrc;  in dl_list_transfer_items_to_head()