Lines Matching refs:prev
88 #define _PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*)(to);… argument
96 #define _PREVASGN(elt,list,to,prev) ((elt)->prev)=(to) argument
169 DL_SORT2(list, cmp, prev, next)
171 #define DL_SORT2(list, cmp, prev, next) \ argument
215 _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \
220 _CASTASGN(list->prev, _ls_tail); \
231 CDL_SORT2(list, cmp, prev, next)
233 #define CDL_SORT2(list, cmp, prev, next) \ argument
290 _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \
295 _CASTASGN(list->prev,_ls_tail); \
505 DL_PREPEND2(head,add,prev,next)
507 #define DL_PREPEND2(head,add,prev,next) \ argument
511 (add)->prev = (head)->prev; \
512 (head)->prev = (add); \
514 (add)->prev = (add); \
520 DL_APPEND2(head,add,prev,next)
522 #define DL_APPEND2(head,add,prev,next) \ argument
525 (add)->prev = (head)->prev; \
526 (head)->prev->next = (add); \
527 (head)->prev = (add); \
531 (head)->prev = (head); \
537 DL_CONCAT2(head1,head2,prev,next)
539 #define DL_CONCAT2(head1,head2,prev,next) \ argument
544 _tmp = (head2)->prev; \
545 (head2)->prev = (head1)->prev; \
546 (head1)->prev->next = (head2); \
547 (head1)->prev = _tmp; \
555 DL_DELETE2(head,del,prev,next)
557 #define DL_DELETE2(head,del,prev,next) \ argument
559 assert((del)->prev != NULL); \
560 if ((del)->prev == (del)) { \
563 (del)->next->prev = (del)->prev; \
566 (del)->prev->next = (del)->next; \
568 (del)->next->prev = (del)->prev; \
570 (head)->prev = (del)->prev; \
612 (add)->prev = (add); \
614 (add)->prev = (el)->prev; \
615 (add)->next->prev = (add); \
619 (add)->prev = (el)->prev; \
620 (add)->prev->next = (add); \
622 (head)->prev = (add); \
624 (add)->next->prev = (add); \
635 (add)->prev = (el)->prev; \
636 (el)->prev = (add); \
640 (add)->prev->next = (add); \
649 CDL_PREPEND2(head,add,prev,next)
651 #define CDL_PREPEND2(head,add,prev,next) \ argument
654 (add)->prev = (head)->prev; \
656 (head)->prev = (add); \
657 (add)->prev->next = (add); \
659 (add)->prev = (add); \
666 CDL_DELETE2(head,del,prev,next)
668 #define CDL_DELETE2(head,del,prev,next) \ argument
673 (del)->next->prev = (del)->prev; \
674 (del)->prev->next = (del)->next; \
695 CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next)
697 #define CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next) \ argument
698 for((el)=(head), ((tmp1)=(head)?((head)->prev):NULL); \
729 (add)->prev = (add); \
733 (add)->prev = (el)->prev; \
734 (add)->next->prev = (add); \
735 (add)->prev->next = (add); \
748 (add)->prev = (el)->prev; \
749 (el)->prev = (add); \
750 (add)->prev->next = (add); \