Make mlist a separate component.

Mlist is now made available as a separate component instead of
being a part of skygw_utils.

server/include/mlist.h

@@ -0,0 +1,84 @@
+#ifndef _MLIST_H
+#define _MLIST_H
+/*
+ * This file is distributed as part of the MariaDB Corporation MaxScale.  It 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,
+ * version 2.
+ *
+ * This program 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, write to the Free Software Foundation, Inc., 51
+ * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Copyright MariaDB Corporation Ab 2016
+ */
+
+#include <skygw_utils.h>
+
+EXTERN_C_BLOCK_BEGIN
+
+typedef struct mlist_node_st mlist_node_t;
+
+typedef struct mlist_st
+{
+    skygw_chk_t    mlist_chk_top;
+    char*          mlist_name;
+    void (*mlist_datadel)(void *);  /**< clean-up function for data */
+    simple_mutex_t mlist_mutex; /**< protect node updates and clean-up */
+    bool           mlist_uselock;
+    bool           mlist_islocked;
+    bool           mlist_deleted;
+    size_t         mlist_nodecount;
+    size_t         mlist_nodecount_max; /**< size limit. 0 == no limit */
+    size_t         mlist_versno;
+    bool           mlist_flat;
+    mlist_node_t*  mlist_first;
+    mlist_node_t*  mlist_last;
+    skygw_chk_t    mlist_chk_tail;
+} mlist_t;
+
+typedef struct mlist_cursor_st
+{
+    skygw_chk_t   mlcursor_chk_top;
+    mlist_t*      mlcursor_list;
+    mlist_node_t* mlcursor_pos;
+    pthread_t*    mlcursor_owner_thr;
+    skygw_chk_t   mlcursor_chk_tail;
+} mlist_cursor_t;
+
+struct mlist_node_st
+{
+    skygw_chk_t   mlnode_chk_top;
+    mlist_t*      mlnode_list;
+    mlist_node_t* mlnode_next;
+    void*         mlnode_data;
+    bool          mlnode_deleted;
+    skygw_chk_t   mlnode_chk_tail;
+};
+
+
+mlist_t*      mlist_init(mlist_t*         mlist,
+                         mlist_cursor_t** cursor,
+                         char*            name,
+                         void           (*datadel)(void*),
+                         int              maxnodes);
+void          mlist_done(mlist_t* list);
+bool          mlist_add_data_nomutex(mlist_t* list, void* data);
+bool          mlist_add_node_nomutex(mlist_t* list, mlist_node_t* newnode);
+mlist_node_t* mlist_detach_first(mlist_t* ml);
+mlist_node_t* mlist_detach_nodes(mlist_t* ml);
+void*         mlist_node_get_data(mlist_node_t* node);
+void          mlist_node_done(mlist_node_t* n);
+
+mlist_cursor_t* mlist_cursor_init(mlist_t* ml);
+void*           mlist_cursor_get_data_nomutex(mlist_cursor_t* c);
+bool            mlist_cursor_move_to_first(mlist_cursor_t* c);
+
+EXTERN_C_BLOCK_END
+
+#endif