4 * Copyright (c) 2012 - 2013 Samsung Electronics Co., Ltd. All rights reserved.
6 * Licensed under the Apache License, Version 2.0 (the "License");
7 * you may not use this file except in compliance with the License.
8 * You may obtain a copy of the License at
10 * http://www.apache.org/licenses/LICENSE-2.0
12 * Unless required by applicable law or agreed to in writing, software
13 * distributed under the License is distributed on an "AS IS" BASIS,
14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15 * See the License for the specific language governing permissions and
16 * limitations under the License.
25 #define EINA_LIST_APPEND(a, b) \
26 a = eina_list_append(a, b)
28 #define EINA_LIST_REMOVE(a, b) \
29 a = eina_list_remove(a, b)
31 #define EINA_LIST_REMOVE_LIST(a, b) \
32 a = eina_list_remove_list(a, b)
34 #define EINA_LIST_FREE_LIST(a) \
37 #define EINA_LIST_PROMOTE_LIST(a, b) \
38 a = eina_list_promote_list(a, b)
41 typedef Eina_List dd_list;
42 #define DD_LIST_PREPEND(a, b) \
43 a = eina_list_prepend(a, b)
44 #define DD_LIST_APPEND(a, b) \
45 a = eina_list_append(a, b)
46 #define DD_LIST_REMOVE(a, b) \
47 a = eina_list_remove(a, b)
48 #define DD_LIST_LENGTH(a) \
50 #define DD_LIST_NTH(a, b) \
52 #define DD_LIST_FREE_LIST(a) \
54 #define DD_LIST_FOREACH(head, elem, node) \
55 EINA_LIST_FOREACH(head, elem, node)
56 #define DD_LIST_FOREACH_SAFE(head, elem, elem_next, node) \
57 EINA_LIST_FOREACH_SAFE(head, elem, elem_next, node)
61 typedef GList dd_list;
64 cover crash from corrupted double linked list under the glib 2.36.4
65 if glib version upper than 2.36.3, exchange it to g_list_remove
67 static inline GList* g_list_check_remove(GList* list, gpointer data)
73 while (temp != NULL) {
74 if (temp->data != data)
77 if (temp->prev != NULL && temp->prev->next == temp)
78 temp->prev->next = temp->next;
79 if (temp->next != NULL && temp->next->prev == temp)
80 temp->next->prev = temp->prev;
93 #define DD_LIST_PREPEND(a, b) \
94 a = g_list_prepend(a, (gpointer)b)
95 #define DD_LIST_APPEND(a, b) \
96 a = g_list_append(a, (gpointer)b)
97 #define DD_LIST_REMOVE(a, b) \
98 a = g_list_remove(a, (gpointer)b)
99 #define DD_LIST_LENGTH(a) \
101 #define DD_LIST_NTH(a, b) \
102 g_list_nth_data(a, b)
103 #define DD_LIST_FREE_LIST(a) \
105 #define DD_LIST_FOREACH(head, elem, node) \
106 for (elem = head, node = NULL; elem && ((node = elem->data) != NULL); elem = elem->next, node = NULL)
107 #define DD_LIST_FOREACH_SAFE(head, elem, elem_next, node) \
108 for (elem = head, elem_next = g_list_next(elem), node = NULL; \
109 elem && ((node = elem->data) != NULL); \
110 elem = elem_next, elem_next = g_list_next(elem), node = NULL)