dlist.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	LIST_INIT(list)   ((list).head= (list).tail= 0)
#define	LINK_INIT(link)   ((link).next= (link).back= 0)
#define	LIST_UNLINK_PART(list, node, part)
#define	LIST_LINK_TAIL_PART(list, node, part)
#define	LIST_UNLINK(list, node)   LIST_UNLINK_PART(list,node,)
#define	LIST_LINK_TAIL(list, node)   LIST_LINK_TAIL_PART(list,node,)

Macro Definition Documentation

LINK_INIT

#define LINK_INIT

(

link

)

((link).next= (link).back= 0)

Definition at line 32 of file dlist.h.

LIST_INIT

#define LIST_INIT

(

list

)

((list).head= (list).tail= 0)

Definition at line 31 of file dlist.h.

LIST_LINK_TAIL

#define LIST_LINK_TAIL	(		list,
			node
	)		LIST_LINK_TAIL_PART(list,node,)

Definition at line 51 of file dlist.h.

LIST_LINK_TAIL_PART

#define LIST_LINK_TAIL_PART	(		list,
			node,
			part
	)

Value:

  do { \
    (node)->part next= 0; \
    (node)->part back= (list).tail; \
    if ((list).tail) (list).tail->part next= (node); else (list).head= (node); \
    (list).tail= (node); \
  } while(0)

Definition at line 42 of file dlist.h.

LIST_UNLINK

#define LIST_UNLINK	(		list,
			node
	)		LIST_UNLINK_PART(list,node,)

Definition at line 50 of file dlist.h.

LIST_UNLINK_PART

#define LIST_UNLINK_PART	(		list,
			node,
			part
	)

Value:

  do { \
    if ((node)->part back) (node)->part back->part next= (node)->part next; \
      else                                  (list).head= (node)->part next; \
    if ((node)->part next) (node)->part next->part back= (node)->part back; \
      else                                  (list).tail= (node)->part back; \
  } while(0)

Definition at line 34 of file dlist.h.