Cleanup Edit Tags/Book/EngineList a bit

[xboard.git] / lists.c

diff --git a/lists.c b/lists.c
index 43c4278..68f1a5d 100644 (file)
--- a/lists.c
+++ b/lists.c
@@ -1,7 +1,10 @@
 /*
  * lists.c -- Functions to implement a double linked list XBoard
  *
 /*
  * lists.c -- Functions to implement a double linked list XBoard
  *

- * Copyright 1995,2009 Free Software Foundation, Inc.
+ * Copyright 1995, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Free
+ * Software Foundation, Inc.
+ *
+ * Enhancements Copyright 2005 Alessandro Scotti

  *
  * ------------------------------------------------------------------------
  *
  *
  * ------------------------------------------------------------------------
  *


@@ -41,8 +44,8 @@
 /* Check, if List l is empty; returns TRUE, if it is, FALSE
  * otherwise.
  */
 /* Check, if List l is empty; returns TRUE, if it is, FALSE
  * otherwise.
  */

-int ListEmpty(l)
-    List *l;
+int
+ListEmpty (List *l)

 {
     return(l->head == (ListNode *) &l->tail);
 }
 {
     return(l->head == (ListNode *) &l->tail);
 }


@@ -50,8 +53,8 @@ int ListEmpty(l)
 
 /* Initialize a list. Must be executed before list is used.
  */
 
 /* Initialize a list. Must be executed before list is used.
  */

-void ListNew(l)
-    List *l;
+void
+ListNew (List *l)

 {
     l->head = (ListNode *) &l->tail;
     l->tail = NULL;
 {
     l->head = (ListNode *) &l->tail;
     l->tail = NULL;


@@ -61,8 +64,8 @@ void ListNew(l)
 
 /* Remove node n from the list it is inside.
  */
 
 /* Remove node n from the list it is inside.
  */

-void ListRemove(n)
-    ListNode *n;
+void
+ListRemove (ListNode *n)

 {
     if (n->succ != NULL) {  /*  Be safe  */
        n->pred->succ = n->succ;
 {
     if (n->succ != NULL) {  /*  Be safe  */
        n->pred->succ = n->succ;


@@ -75,8 +78,8 @@ void ListRemove(n)
 
 /* Delete node n.
  */
 
 /* Delete node n.
  */

-void ListNodeFree(n)
-    ListNode *n;
+void
+ListNodeFree (ListNode *n)

 {
     if (n) {
        ListRemove(n);
 {
     if (n) {
        ListRemove(n);


@@ -87,8 +90,8 @@ void ListNodeFree(n)
 
 /* Create a list node with size s. Returns NULL, if out of memory.
  */
 
 /* Create a list node with size s. Returns NULL, if out of memory.
  */

-ListNode *ListNodeCreate(s)
-    size_t s;
+ListNode *
+ListNodeCreate (size_t s)

 {
     ListNode *n;
 
 {
     ListNode *n;
 


@@ -102,8 +105,8 @@ ListNode *ListNodeCreate(s)
 
 /* Insert node n into the list of node m after m.
  */
 
 /* Insert node n into the list of node m after m.
  */

-void ListInsert(m, n)
-    ListNode *m, *n;
+void
+ListInsert (ListNode *m, ListNode *n)

 {
     n->succ = m->succ;
     n->pred = m;
 {
     n->succ = m->succ;
     n->pred = m;


@@ -114,9 +117,8 @@ void ListInsert(m, n)
 
 /* Add node n to the head of list l.
  */
 
 /* Add node n to the head of list l.
  */

-void ListAddHead(l, n)
-    List *l;
-    ListNode *n;
+void
+ListAddHead (List *l, ListNode *n)

 {
     ListInsert((ListNode *) &l->head, n);
 }
 {
     ListInsert((ListNode *) &l->head, n);
 }


@@ -124,9 +126,8 @@ void ListAddHead(l, n)
 
 /* Add node n to the tail of list l.
  */
 
 /* Add node n to the tail of list l.
  */

-void ListAddTail(l, n)
-    List *l;
-    ListNode *n;
+void
+ListAddTail (List *l, ListNode *n)

 {
     ListInsert((ListNode *) l->tailPred, n);
 }
 {
     ListInsert((ListNode *) l->tailPred, n);
 }


@@ -135,9 +136,8 @@ void ListAddTail(l, n)
 /* Return element with number n of list l. (NULL, if n doesn't exist.)
  * Counting starts with 0.
  */
 /* Return element with number n of list l. (NULL, if n doesn't exist.)
  * Counting starts with 0.
  */

-ListNode *ListElem(l, n)
-    List *l;
-    int n;
+ListNode *
+ListElem (List *l, int n)

 {
     ListNode *ln;
 
 {
     ListNode *ln;