src/common/dllist.h


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205


/* Chrysalide - Outil d'analyse de fichiers binaires
 * dllist.h - prototypes de l'implantation simple des listes doublement chaînées
 *
 * Copyright (C) 2009-2018 Cyrille Bagard
 *
 *  This file is part of Chrysalide.
 *
 *  Chrysalide 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.
 *
 *  Chrysalide 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 Chrysalide.  If not, see <http://www.gnu.org/licenses/>.
 */


#ifndef _COMMON_DLLIST_H
#define _COMMON_DLLIST_H


#include "macros.h"


/* Structure à inclure en tête de structure */
typedef struct _dl_list_item_t
{
    struct _dl_list_item_t *prev;             /* Elément précédent           */
    struct _dl_list_item_t *next;             /* Elément suivant             */

} dl_list_item_t;

typedef dl_list_item_t *dl_list_head_t;


#define DL_LIST_ITEM(name) dl_list_item_t name


#define DL_LIST_ITEM_INIT(item)                                                     \
    do                                                                              \
    {                                                                               \
        (item)->prev = (item);                                                      \
        (item)->next = (item);                                                      \
                                                                                    \
    } while(0)

#define DL_LIST_HEAD_INIT(head)                                                     \
    head = NULL


/* Ajoute un élément dans une liste doublement chaînée. */
void __dl_list_add(dl_list_item_t *, dl_list_head_t *, dl_list_item_t *, dl_list_item_t *);

/* Supprime un élément d'une liste doublement chaînée. */
void __dl_list_del(dl_list_item_t *, dl_list_head_t *);


#define dl_list_empty(head)                                                         \
    ((head) == NULL)

#define _dl_list_is_last(item, head)                                                \
    ((item)->next == head)

#define dl_list_is_last(item, head, member)                                         \
    item->member.next == &head->member

#define dl_list_last(head, type, member)                                            \
    (dl_list_empty(head) ? NULL : (type *)container_of(head->member.prev, type, member))

#define dl_list_add(new, head, type, member)                                        \
    do                                                                              \
    {                                                                               \
        dl_list_item_t *hmbr = (dl_list_empty(*(head)) ? NULL : &(*head)->member);  \
        __dl_list_add(&new->member, &hmbr,                                          \
                      dl_list_empty(*(head)) ? &new->member : hmbr->prev,           \
                      dl_list_empty(*(head)) ? &new->member : hmbr);                \
        *(head) = new;                                                              \
    }                                                                               \
    while (0)

#define dl_list_add_before(new, head, pos, member)                                  \
    do                                                                              \
    {                                                                               \
        pos->member.prev->next = &new->member;                                      \
        new->member.prev = pos->member.prev;                                        \
        pos->member.prev = &new->member;                                            \
        new->member.next = &pos->member;                                            \
        if (pos == *head) *head = new;                                              \
    }                                                                               \
    while (0)

#define dl_list_add_tail(new, head, type, member)                                   \
    do                                                                              \
    {                                                                               \
        dl_list_item_t *hmbr = (dl_list_empty(*(head)) ? NULL : &(*head)->member);  \
        __dl_list_add(&new->member, &hmbr,                                          \
                      dl_list_empty(*(head)) ? &new->member : hmbr->prev,           \
                      dl_list_empty(*(head)) ? &new->member : hmbr);                \
        *(head) = container_of(hmbr, type, member);                                 \
    }                                                                               \
    while (0)

#define dl_list_del(item, head, type, member)                                       \
    do                                                                              \
    {                                                                               \
        dl_list_item_t *hmbr = &(*head)->member;                                    \
        __dl_list_del(&item->member, &hmbr);                                        \
        *(head) = (hmbr ? container_of(hmbr, type, member) : NULL);                 \
        DL_LIST_ITEM_INIT(&item->member);                                           \
    }                                                                               \
    while(0)

#define _dl_list_merge(head1, head2)                                                \
    do                                                                              \
    {                                                                               \
        dl_list_item_t *mid = head1->prev;                                          \
        mid->next = head2;                                                          \
        head1->prev = head2->prev;                                                  \
        head2->prev->next = head1;                                                  \
        head2->prev = mid;                                                          \
    }                                                                               \
    while(0)

#define dl_list_merge(head1, head2, type, member)                                   \
    do                                                                              \
    {                                                                               \
        if (dl_list_empty(*head1)) *head1 = *head2;                                 \
        else if (!dl_list_empty(*head2))                                            \
        {                                                                           \
            dl_list_item_t *hmbr1 = &(*head1)->member;                              \
            dl_list_item_t *hmbr2 = &(*head2)->member;                              \
            dl_list_item_t *mid = hmbr1->prev;                                      \
            mid->next = hmbr2;                                                      \
            hmbr1->prev = hmbr2->prev;                                              \
            hmbr2->prev->next = hmbr1;                                              \
            hmbr2->prev = mid;                                                      \
        }                                                                           \
    }                                                                               \
    while(0)

#define dl_list_push dl_list_add_tail

#define dl_list_pop(head, type, member)                                             \
    ({                                                                              \
        type *_result = *head;/* FIXME : ARgh ! */                                  \
        dl_list_del(_result, head, type, member);                                   \
        _result;                                                                    \
    })

#define _dl_list_next(iter, head)                                                   \
    ({                                                                              \
        dl_list_item_t *__next;                                                     \
        __next = iter->next;                                                        \
        if (__next == head)                                                         \
            __next = NULL;                                                          \
        __next;                                                                     \
    })


#define dl_list_next_iter(iter, head, type, member)                                 \
    (iter->member.next == &head->member ?                                           \
     NULL : container_of(iter->member.next, type, member))

#define dl_list_prev_iter(iter, head, type, member)                                 \
    (&iter->member == &head->member ?                                               \
     NULL : container_of(iter->member.prev, type, member))

#define dl_list_for_each(pos, head, type, member)                                   \
	for (pos = head;                                                                \
         pos != NULL;                                                               \
         pos = dl_list_next_iter(pos, (head), type, member))

#define dl_list_next_iter_safe(iter, head, type, member)                            \
    (iter == NULL || iter->member.next == &(*head)->member ?                        \
     NULL : container_of(iter->member.next, type, member))

#define dl_list_for_each_safe(pos, head, next, type, member)                        \
	for (pos = *head,                                                               \
             next = dl_list_next_iter_safe(pos, (head), type, member);              \
         pos != NULL;                                                               \
         pos = next,                                                                \
             next = dl_list_next_iter_safe(pos, (head), type, member))

#define dl_list_for_each_rev(pos, head, type, member)                               \
	for (pos = dl_list_last(head, type, member);                                    \
         pos != NULL;                                                               \
         pos = dl_list_prev_iter(pos, (head), type, member))


/* Prototype pour un comparateur d'éléments */
typedef int (*__dl_item_compar_fn_t) (const dl_list_item_t *, const dl_list_item_t *);

/* Trie une liste chaînée en notant les éléments identiques. */
void sort_dl_list_no_dup(dl_list_head_t *, size_t *, __dl_item_compar_fn_t, dl_list_head_t *);


#endif  /* _COMMON_DLLIST_H */