Fix multi-leg promotions

[xboard.git] / lists.h

diff --git a/lists.h b/lists.h
index b291894..fb46709 100644 (file)
--- a/lists.h
+++ b/lists.h
@@ -1,66 +1,71 @@
-/*\r
- * lists.c -- Includefile of lists.c\r
- * XBoard $Id: lists.h,v 2.1 2003/10/27 19:21:00 mann Exp $\r
- *\r
- * Copyright 1995 Free Software Foundation, Inc.\r
- *\r
- * ------------------------------------------------------------------------\r
- * This program is free software; you can redistribute it and/or modify\r
- * it under the terms of the GNU General Public License as published by\r
- * the Free Software Foundation; either version 2 of the License, or\r
- * (at your option) any later version.\r
- *\r
- * This program is distributed in the hope that it will be useful,\r
- * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\r
- * GNU General Public License for more details.\r
- *\r
- * You should have received a copy of the GNU General Public License\r
- * along with this program; if not, write to the Free Software\r
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111 USA.\r
- * ------------------------------------------------------------------------\r
- *\r
- * This file could well be a part of backend.c, but I prefer it this\r
- * way.\r
- */\r
-\r
-#ifndef _LISTS_H\r
-#define _LISTS_H\r
-\r
-\r
-/* Type definition: Node of a double linked list.\r
- */\r
-typedef struct _ListNode {\r
-    struct _ListNode *succ;\r
-    struct _ListNode *pred;\r
-} ListNode;\r
-\r
-\r
-/* Type definition: Double linked list.\r
- *\r
- * The list structure consists of two ListNode's: The pred entry of\r
- * the head being the succ entry of the tail. Thus a list is empty\r
- * if and only if it consists of 2 nodes. :-)\r
- */\r
-typedef struct {\r
-    struct _ListNode *head;     /*  The list structure consists of two  */\r
-    struct _ListNode *tail;     /*  ListNode's: The pred entry of the   */\r
-    struct _ListNode *tailPred; /*  head being the succ entry of the    */\r
-} List;                         /*  tail.                               */\r
-\r
-\r
-\r
-/* Function prototypes\r
- */\r
-extern int ListEmpty P((List *));\r
-void ListNew P((List *));\r
-void ListRemove P((ListNode *));\r
-void ListNodeFree P((ListNode *));\r
-ListNode *ListNodeCreate P((size_t));\r
-void ListInsert P((ListNode *, ListNode *));\r
-void ListAddHead P((List *, ListNode *));\r
-void ListAddTail P((List *, ListNode *));\r
-ListNode *ListElem P((List *, int));\r
-\r
-\r
-#endif\r
+/*
+ * lists.c -- Includefile of lists.c
+ *
+ * Copyright 1995, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Free
+ * Software Foundation, Inc.
+ *
+ * Enhancements Copyright 2005 Alessandro Scotti
+ *
+ * ------------------------------------------------------------------------
+ *
+ * GNU XBoard is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or (at
+ * your option) any later version.
+ *
+ * GNU XBoard is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see http://www.gnu.org/licenses/.  *
+ *
+ *------------------------------------------------------------------------
+ ** See the file ChangeLog for a revision history.  */
+
+/*
+ * This file could well be a part of backend.c, but I prefer it this
+ * way.
+ */
+
+#ifndef XB_LISTS
+#define XB_LISTS
+
+
+/* Type definition: Node of a double linked list.
+ */
+typedef struct XB_ListNode {
+    struct XB_ListNode *succ;
+    struct XB_ListNode *pred;
+} ListNode;
+
+
+/* Type definition: Double linked list.
+ *
+ * The list structure consists of two ListNode's: The pred entry of
+ * the head being the succ entry of the tail. Thus a list is empty
+ * if and only if it consists of 2 nodes. :-)
+ */
+typedef struct {
+    struct XB_ListNode *head;     /*  The list structure consists of two  */
+    struct XB_ListNode *tail;     /*  ListNode's: The pred entry of the   */
+    struct XB_ListNode *tailPred; /*  head being the succ entry of the    */
+} List;                         /*  tail.                               */
+
+
+
+/* Function prototypes
+ */
+extern int ListEmpty P((List *));
+void ListNew P((List *));
+void ListRemove P((ListNode *));
+void ListNodeFree P((ListNode *));
+ListNode *ListNodeCreate P((size_t));
+void ListInsert P((ListNode *, ListNode *));
+void ListAddHead P((List *, ListNode *));
+void ListAddTail P((List *, ListNode *));
+ListNode *ListElem P((List *, int));
+
+
+#endif