[ViewVC] Diff of: cvs/ermyth/include/dlink.h

Comparing ermyth/include/dlink.h (file contents):
Revision 1.2 by pippijn, Sat Jul 21 01:29:07 2007 UTC vs.
Revision 1.3 by pippijn, Tue Aug 28 17:08:06 2007 UTC

 /*
- * Copyright © 2005 William Pitcock, et al.
+ * Copyright Â© 2005 William Pitcock, et al.
  * Rights to this code are as documented in doc/pod/license.pod.
  *
  * Data structures and macros for manipulating linked lists.
  *
- * $Id: dlink.h,v 1.2 2007/07/21 01:29:07 pippijn Exp $
+ * $Id: dlink.h,v 1.3 2007/08/28 17:08:06 pippijn Exp $
  */
 #ifndef NODE_H
 #define NODE_H
+#include <common/memory.h>
 /* macros for linked lists */
 #define LIST_FOREACH(n, head) for (n = (head); n; n = n->next)
 #define LIST_FOREACH_NEXT(n, head) for (n = (head); n->next; n = n->next)
 #define LIST_FOREACH_PREV(n, tail) for (n = (tail); n; n = n->prev)
 #define LIST_LENGTH(list) (list)->count
 #define LIST_FOREACH_SAFE(n, tn, head) for (n = (head), tn = n ? n->next : NULL; n != NULL; n = tn, tn = n ? n->next : NULL)
 /* list node struct */
-struct node_t
+struct node_t : zero_initialised
 {
-  node_t *next, *prev;
+  node_t *next;
+  node_t *prev;
   void *data;			/* pointer to real structure */
 };
 /* node list struct */
-struct list_t
+struct list_t : zero_initialised
 {
-  node_t *head, *tail;
+  node_t *head;
+  node_t *tail;
   unsigned int count;		/* how many entries in the list */
+  list_t ()
+  : head (0), tail (0), count (0)
+  {
+  }
 };
 E node_t *node_create (void);
 E void node_free (node_t *n);
 E void node_add (void *data, node_t *n, list_t *l);

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines