utlist.h File Reference

Go to the source code of this file.

Macros
#define	UTLIST_VERSION   1.8
#define	LL_SORT(list, cmp)
#define	DL_SORT(list, cmp)
#define	CDL_SORT(list, cmp)
#define	LL_PREPEND(head, add)
#define	LL_APPEND(head, add)
#define	LL_DELETE(head, del)
#define	LL_FOREACH(head, el)   for(el=head;el;el=el->next)
#define	DL_PREPEND(head, add)
#define	DL_APPEND(head, add)
#define	DL_DELETE(head, del)
#define	DL_FOREACH(head, el)   for(el=head;el;el=el->next)
#define	CDL_PREPEND(head, add)
#define	CDL_DELETE(head, del)
#define	CDL_FOREACH(head, el)   for(el=head;el;el= (el->next==head ? 0L : el->next))

Macro Definition Documentation

#define CDL_DELETE	(		head,
			del
	)

Value:

do {                                                                             \
  if ( ((head)==(del)) && ((head)->next == (head))) {                            \
      (head) = 0L;                                                               \
  } else {                                                                       \
     (del)->next->prev = (del)->prev;                                            \
     (del)->prev->next = (del)->next;                                            \
     if ((del) == (head)) (head)=(del)->next;                                    \
  }                                                                              \
} while (0);

Definition at line 333 of file utlist.h.

#define CDL_FOREACH	(		head,
			el
	)		for(el=head;el;el= (el->next==head ? 0L : el->next))

Definition at line 344 of file utlist.h.

#define CDL_PREPEND	(		head,
			add
	)

Value:

do {                                                                             \
 if (head) {                                                                     \
   (add)->prev = (head)->prev;                                                   \
   (add)->next = (head);                                                         \
   (head)->prev = (add);                                                         \
   (add)->prev->next = (add);                                                    \
 } else {                                                                        \
   (add)->prev = (add);                                                          \
   (add)->next = (add);                                                          \
 }                                                                               \
(head)=(add);                                                                    \
} while (0)

Definition at line 319 of file utlist.h.

#define CDL_SORT	(		list,
			cmp
	)

Definition at line 168 of file utlist.h.

#define DL_APPEND	(		head,
			add
	)

Value:

do {                                                                             \
  if (head) {                                                                    \
      (add)->prev = (head)->prev;                                                \
      (head)->prev->next = (add);                                                \
      (head)->prev = (add);                                                      \
      (add)->next = NULL;                                                        \
  } else {                                                                       \
      (head)=(add);                                                              \
      (head)->prev = (head);                                                     \
      (head)->next = NULL;                                                       \
  }                                                                              \
} while (0);

Definition at line 281 of file utlist.h.

#define DL_DELETE	(		head,
			del
	)

Value:

do {                                                                             \
  if ((del)->prev == (del)) {                                                    \
      (head)=NULL;                                                               \
  } else if ((del)==(head)) {                                                    \
      (del)->next->prev = (del)->prev;                                           \
      (head) = (del)->next;                                                      \
  } else {                                                                       \
      (del)->prev->next = (del)->next;                                           \
      if ((del)->next) {                                                         \
          (del)->next->prev = (del)->prev;                                       \
      } else {                                                                   \
          (head)->prev = (del)->prev;                                            \
      }                                                                          \
  }                                                                              \
} while (0);

Definition at line 295 of file utlist.h.

#define DL_FOREACH	(		head,
			el
	)		for(el=head;el;el=el->next)

Definition at line 313 of file utlist.h.

#define DL_PREPEND	(		head,
			add
	)

Value:

do {                                                                             \
 (add)->next = head;                                                             \
 if (head) {                                                                     \
   (add)->prev = (head)->prev;                                                   \
   (head)->prev = (add);                                                         \
 } else {                                                                        \
   (add)->prev = (add);                                                          \
 }                                                                               \
 (head) = (add);                                                                 \
} while (0)

Definition at line 269 of file utlist.h.

#define DL_SORT	(		list,
			cmp
	)

Definition at line 115 of file utlist.h.

#define LL_APPEND	(		head,
			add
	)

Value:

do {                                                                             \
  __typeof__(head) _tmp;                                                         \
  (add)->next=NULL;                                                              \
  if (head) {                                                                    \
    _tmp = head;                                                                 \
    while (_tmp->next) { _tmp = _tmp->next; }         \
    _tmp->next=(add);                                         \
  } else {                                                                       \
    (head)=(add);                                                                \
  }                                                                              \
} while (0)

Definition at line 234 of file utlist.h.

#define LL_DELETE	(		head,
			del
	)

Value:

do {                                                                             \
  __typeof__(head) _tmp;                                                         \
  if ((head) == (del)) {                                                         \
    (head)=(head)->next;                                                         \
  } else {                                                                       \
    _tmp = head;                                                                 \
    while (_tmp->next && (_tmp->next != (del))) { \
      _tmp = _tmp->next;                                         \
    }                                                                            \
    if (_tmp->next) {                                                \
      _tmp->next = ((del)->next);                             \
    }                                                                            \
  }                                                                              \
} while (0)

Definition at line 247 of file utlist.h.

#define LL_FOREACH	(		head,
			el
	)		for(el=head;el;el=el->next)

Definition at line 263 of file utlist.h.

#define LL_PREPEND	(		head,
			add
	)

Value:

do {                                                                             \
  (add)->next = head;                                                            \
  head = add;                                                                    \
} while (0)

Definition at line 228 of file utlist.h.

#define LL_SORT	(		list,
			cmp
	)

Definition at line 64 of file utlist.h.

#define UTLIST_VERSION   1.8

Definition at line 27 of file utlist.h.