5 Copyright (C) 2004-2005 Kern Sibbald
7 This program is free software; you can redistribute it and/or
8 modify it under the terms of the GNU General Public License
9 version 2 as amended with additional clauses defined in the
10 file LICENSE in the main source directory.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 the file LICENSE for additional details.
20 /* ========================================================================
22 * Doubly linked list -- dlist
30 /* In case you want to specifically specify the offset to the link */
31 #define OFFSET(item, link) (int)((char *)(link) - (char *)(item))
33 * There is a lot of extra casting here to work around the fact
34 * that some compilers (Sun and Visual C++) do not accept
35 * (void *) as an lvalue on the left side of an equal.
37 * Loop var through each member of list
40 #define foreach_dlist(var, list) \
41 for((var)=NULL; ((var)=(typeof(var))(list)->next(var)); )
43 #define foreach_dlist(var, list) \
44 for((var)=NULL; (*((void **)&(var))=(void*)((list)->next(var))); )
54 class dlist : public SMARTALLOC {
60 dlist(void *item, dlink *link);
62 ~dlist() { destroy(); }
63 void init(void *item, dlink *link);
64 void prepend(void *item);
65 void append(void *item);
66 void insert_before(void *item, void *where);
67 void insert_after(void *item, void *where);
68 void *binary_insert(void *item, int compare(void *item1, void *item2));
69 void *binary_search(void *item, int compare(void *item1, void *item2));
70 void binary_insert_multiple(void *item, int compare(void *item1, void *item2));
71 void remove(void *item);
74 void *next(const void *item) const;
75 void *prev(const void *item) const;
83 * This allows us to do explicit initialization,
84 * allowing us to mix C++ classes inside malloc'ed
85 * C structures. Define before called in constructor.
87 inline void dlist::init(void *item, dlink *link)
90 loffset = (int)((char *)link - (char *)item);
91 if (loffset < 0 || loffset > 5000) {
92 Emsg0(M_ABORT, 0, "Improper dlist initialization.\n");
98 * Constructor called with the address of a
99 * member of the list (not the list head), and
100 * the address of the link within that member.
101 * If the link is at the beginning of the list member,
102 * then there is no need to specify the link address
103 * since the offset is zero.
105 inline dlist::dlist(void *item, dlink *link)
110 /* Constructor with link at head of item */
111 inline dlist::dlist(void) : head(0), tail(0), loffset(0), num_items(0)
115 inline bool dlist::empty() const
120 inline int dlist::size() const
127 inline void * dlist::first() const
132 inline void * dlist::last() const