dlist.h

changeset 62
aae5facf9fc5
parent 58
789df543d0c3
child 87
95553f8ea540
--- a/dlist.h	Mon Feb 16 18:09:03 2004 +0100
+++ b/dlist.h	Mon Feb 16 18:50:28 2004 +0100
@@ -11,66 +11,66 @@
 #define LIBTU_DLIST_H
 
 #define LINK_ITEM(LIST, ITEM, NEXT, PREV) \
-	(ITEM)->NEXT=NULL;                    \
-	if((LIST)==NULL){                     \
-		(LIST)=(ITEM);                    \
-		(ITEM)->PREV=(ITEM);              \
-	}else{                                \
-		(ITEM)->PREV=(LIST)->PREV;        \
-		(ITEM)->PREV->NEXT=(ITEM);        \
-		(LIST)->PREV=(ITEM);              \
-	}
+    (ITEM)->NEXT=NULL;                    \
+    if((LIST)==NULL){                     \
+        (LIST)=(ITEM);                    \
+        (ITEM)->PREV=(ITEM);              \
+    }else{                                \
+        (ITEM)->PREV=(LIST)->PREV;        \
+        (ITEM)->PREV->NEXT=(ITEM);        \
+        (LIST)->PREV=(ITEM);              \
+    }
 
 
 #define LINK_ITEM_FIRST(LIST, ITEM, NEXT, PREV) \
-	(ITEM)->NEXT=(LIST);                        \
-	if((LIST)==NULL){                           \
-		(ITEM)->PREV=(ITEM);                    \
-	}else{                                      \
-		(ITEM)->PREV=(LIST)->PREV;              \
-		(LIST)->PREV=(ITEM);                    \
-	}                                           \
-	(LIST)=(ITEM);
+    (ITEM)->NEXT=(LIST);                        \
+    if((LIST)==NULL){                           \
+        (ITEM)->PREV=(ITEM);                    \
+    }else{                                      \
+        (ITEM)->PREV=(LIST)->PREV;              \
+        (LIST)->PREV=(ITEM);                    \
+    }                                           \
+    (LIST)=(ITEM);
 
 
 #define LINK_ITEM_LIST LINK_ITEM
 
 
 #define LINK_ITEM_BEFORE(LIST, BEFORE, ITEM, NEXT, PREV) \
-	(ITEM)->NEXT=(BEFORE);                               \
-	(ITEM)->PREV=(BEFORE)->PREV;                         \
-	(BEFORE)->PREV=(ITEM);                               \
-	if((BEFORE)==(LIST))                                 \
-		(LIST)=(ITEM);                                   \
-	else                                                 \
-		(ITEM)->PREV->NEXT=(ITEM)
+    (ITEM)->NEXT=(BEFORE);                               \
+    (ITEM)->PREV=(BEFORE)->PREV;                         \
+    (BEFORE)->PREV=(ITEM);                               \
+    if((BEFORE)==(LIST))                                 \
+        (LIST)=(ITEM);                                   \
+    else                                                 \
+        (ITEM)->PREV->NEXT=(ITEM)
 
 
 #define LINK_ITEM_AFTER(LIST, AFTER, ITEM, NEXT, PREV) \
-	(ITEM)->NEXT=(AFTER)->NEXT;                        \
-	(ITEM)->PREV=(AFTER);                              \
-	(AFTER)->NEXT=(ITEM);                              \
-	if((ITEM)->NEXT==NULL)                             \
-		(LIST)->PREV=(ITEM);                           \
-	else                                               \
-		(ITEM)->NEXT->PREV=ITEM;
+    (ITEM)->NEXT=(AFTER)->NEXT;                        \
+    (ITEM)->PREV=(AFTER);                              \
+    (AFTER)->NEXT=(ITEM);                              \
+    if((ITEM)->NEXT==NULL)                             \
+        (LIST)->PREV=(ITEM);                           \
+    else                                               \
+        (ITEM)->NEXT->PREV=ITEM;
 
 
 #define UNLINK_ITEM(LIST, ITEM, NEXT, PREV)  \
-	if((ITEM)->PREV!=NULL){                  \
-		if((ITEM)==(LIST)){                  \
-			(LIST)=(ITEM)->NEXT;             \
-			if((LIST)!=NULL)                 \
-				(LIST)->PREV=(ITEM)->PREV;   \
-		}else if((ITEM)->NEXT==NULL){        \
-			(ITEM)->PREV->NEXT=NULL;         \
-			(LIST)->PREV=(ITEM)->PREV;       \
-		}else{                               \
-			(ITEM)->PREV->NEXT=(ITEM)->NEXT; \
-			(ITEM)->NEXT->PREV=(ITEM)->PREV; \
-		}                                    \
-	}                                        \
-	(ITEM)->NEXT=NULL;                       \
-	(ITEM)->PREV=NULL;
+    if((ITEM)->PREV!=NULL){                  \
+        if((ITEM)==(LIST)){                  \
+            (LIST)=(ITEM)->NEXT;             \
+            if((LIST)!=NULL)                 \
+                (LIST)->PREV=(ITEM)->PREV;   \
+        }else if((ITEM)->NEXT==NULL){        \
+            (ITEM)->PREV->NEXT=NULL;         \
+            (LIST)->PREV=(ITEM)->PREV;       \
+        }else{                               \
+            (ITEM)->PREV->NEXT=(ITEM)->NEXT; \
+            (ITEM)->NEXT->PREV=(ITEM)->PREV; \
+        }                                    \
+    }                                        \
+    (ITEM)->NEXT=NULL;                       \
+    (ITEM)->PREV=NULL;
 
 #endif /* LIBTU_DLIST_H */

mercurial