* limitations under the License.
*/
-#ifndef __LIST_H__
-#define __LIST_H__
+#ifndef __LIBCOMMON_LIST_H__
+#define __LIBCOMMON_LIST_H__
#include <glib.h>
-typedef GList list;
-#define LIST_PREPEND(a, b) \
+#define SYS_G_LIST_PREPEND(a, b) \
a = g_list_prepend(a, (gpointer)b)
-#define LIST_APPEND(a, b) \
+#define SYS_G_LIST_APPEND(a, b) \
a = g_list_append(a, (gpointer)b)
-#define LIST_REMOVE(a, b) \
+#define SYS_G_LIST_REMOVE(a, b) \
a = g_list_remove(a, (gpointer)b)
-#define LIST_REMOVE_LIST(a, b) \
+#define SYS_G_LIST_REMOVE_LIST(a, b) \
a = g_list_delete_link(a, b)
-#define LIST_LENGTH(a) \
+#define SYS_G_LIST_LENGTH(a) \
g_list_length(a)
-#define LIST_NTH(a, b) \
+#define SYS_G_LIST_NTH(a, b) \
g_list_nth_data(a, b)
-#define LIST_FIND(a, b) \
+#define SYS_G_LIST_FIND(a, b) \
g_list_find(a, (gpointer)b)
-#define LIST_FREE_LIST(a) \
+#define SYS_G_LIST_FREE_LIST(a) \
g_list_free(a)
-#define LIST_FOREACH(head, elem, node) \
+#define SYS_G_LIST_FOREACH(head, elem, node) \
for (elem = head, node = NULL; \
elem && ((node = elem->data) != NULL); \
elem = elem->next, node = NULL)
-#define LIST_FOREACH_SAFE(head, elem, elem_next, node) \
+#define SYS_G_LIST_FOREACH_SAFE(head, elem, elem_next, node) \
for (elem = head, elem_next = g_list_next(elem), node = NULL; \
elem && ((node = elem->data) != NULL); \
elem = elem_next, elem_next = g_list_next(elem), node = NULL)
-#define LIST_REVERSE_FOREACH(head, elem, node) \
+#define SYS_G_LIST_REVERSE_FOREACH(head, elem, node) \
for (elem = g_list_last(head), node = NULL; \
elem && ((node = elem->data) != NULL); \
elem = g_list_previous(elem), node = NULL)
-#define LIST_REVERSE_FOREACH_SAFE(head, elem, elem_next, node) \
+#define SYS_G_LIST_REVERSE_FOREACH_SAFE(head, elem, elem_next, node) \
for (elem = g_list_last(head), elem_next = g_list_previous(elem), node = NULL; \
elem && ((node = elem->data) != NULL); \
elem = elem_next, elem_next = g_list_previous(elem), node = NULL)
-#define LIST_NEXT(a) \
+#define SYS_G_LIST_NEXT(a) \
g_list_next(a)
#endif