2 * Bacula doubly linked list routines.
4 * dlist is a doubly linked list with the links being in the
7 * Kern Sibbald, July MMIII
13 Copyright (C) 2000-2004 Kern Sibbald and John Walker
15 This program is free software; you can redistribute it and/or
16 modify it under the terms of the GNU General Public License as
17 published by the Free Software Foundation; either version 2 of
18 the License, or (at your option) any later version.
20 This program is distributed in the hope that it will be useful,
21 but WITHOUT ANY WARRANTY; without even the implied warranty of
22 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
23 General Public License for more details.
25 You should have received a copy of the GNU General Public
26 License along with this program; if not, write to the Free
27 Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
34 /* ===================================================================
38 * Append an item to the list
40 void dlist::append(void *item)
42 ((dlink *)(((char *)item)+loffset))->next = NULL;
43 ((dlink *)(((char *)item)+loffset))->prev = tail;
45 ((dlink *)(((char *)tail)+loffset))->next = item;
48 if (head == NULL) { /* if empty list, */
49 head = item; /* item is head as well */
55 * Append an item to the list
57 void dlist::prepend(void *item)
59 ((dlink *)(((char *)item)+loffset))->next = head;
60 ((dlink *)(((char *)item)+loffset))->prev = NULL;
62 ((dlink *)(((char *)head)+loffset))->prev = item;
65 if (tail == NULL) { /* if empty list, */
66 tail = item; /* item is tail too */
71 void dlist::insert_before(void *item, void *where)
73 dlink *where_link = (dlink *)((char *)where+loffset);
75 ((dlink *)(((char *)item)+loffset))->next = where;
76 ((dlink *)(((char *)item)+loffset))->prev = where_link->prev;
78 if (where_link->prev) {
79 ((dlink *)(((char *)(where_link->prev))+loffset))->next = item;
81 where_link->prev = item;
88 void dlist::insert_after(void *item, void *where)
90 dlink *where_link = (dlink *)((char *)where+loffset);
92 ((dlink *)(((char *)item)+loffset))->next = where_link->next;
93 ((dlink *)(((char *)item)+loffset))->prev = where;
95 if (where_link->next) {
96 ((dlink *)(((char *)(where_link->next))+loffset))->prev = item;
98 where_link->next = item;
106 * Insert an item in the list, but only if it is unique
107 * otherwise, the item is returned non inserted
109 * Returns: item if item inserted
110 * other_item if same value already exists (item not inserted)
112 void *dlist::unique_binary_insert(void *item, int compare(void *item1, void *item2))
118 if (num_items == 0) {
119 //Dmsg0(000, "Append first.\n");
123 if (num_items == 1) {
124 comp = compare(item, first());
127 //Dmsg0(000, "Insert before first.\n");
129 } else if (comp > 0) {
130 insert_after(item, first());
131 //Dmsg0(000, "Insert after first.\n");
134 //Dmsg0(000, "Same as first.\n");
138 /* Check against last item */
139 comp = compare(item, last());
142 //Dmsg0(000, "Appended item.\n");
144 } else if (comp == 0) {
145 //Dmsg0(000, "Same as last.\n");
148 /* Check against first item */
149 comp = compare(item, first());
152 //Dmsg0(000, "Inserted item before.\n");
154 } else if (comp == 0) {
155 //Dmsg0(000, "Same as first.\n");
158 if (num_items == 2) {
159 insert_after(item, first());
160 //Dmsg0(000, "Inserted item after.\n");
169 nxt = (low + high) / 2;
171 cur_item = next(cur_item);
175 cur_item = prev(cur_item);
178 //Dmsg1(000, "Compare item to %d\n", cur);
179 comp = compare(item, cur_item);
180 //Dmsg2(000, "Compare item to %d = %d\n", cur, comp);
183 //Dmsg2(000, "set high; low=%d high=%d\n", low, high);
184 } else if (comp > 0) {
186 //Dmsg2(000, "set low; low=%d high=%d\n", low, high);
188 //Dmsg1(000, "Same as item %d\n", cur);
193 insert_before(item, cur_item);
194 //Dmsg1(000, "Insert before item %d\n", cur);
196 insert_after(item, cur_item);
197 //Dmsg1(000, "Insert after item %d\n", cur);
204 * Insert an item in the list, regardless if it is unique
207 void dlist::binary_insert(void *item, int compare(void *item1, void *item2))
209 void *ins_item = unique_binary_insert(item, compare);
210 /* If identical, insert after the one found */
211 if (ins_item != item) {
212 insert_after(item, ins_item);
217 void dlist::remove(void *item)
220 dlink *ilink = (dlink *)(((char *)item)+loffset); /* item's link */
224 ((dlink *)(((char *)head)+loffset))->prev = NULL;
229 } else if (item == tail) {
232 ((dlink *)(((char *)tail)+loffset))->next = NULL;
236 ((dlink *)(((char *)xitem)+loffset))->prev = ilink->prev;
238 ((dlink *)(((char *)xitem)+loffset))->next = ilink->next;
241 if (num_items == 0) {
246 void * dlist::next(void *item)
251 return ((dlink *)(((char *)item)+loffset))->next;
254 void * dlist::prev(void *item)
259 return ((dlink *)(((char *)item)+loffset))->prev;
263 /* Destroy the list contents */
264 void dlist::destroy()
266 for (void *n=head; n; ) {
267 void *ni = ((dlink *)(((char *)n)+loffset))->next;
284 static int my_compare(void *item1, void *item2)
288 jcr1 = (MYJCR *)item1;
289 jcr2 = (MYJCR *)item2;
290 comp = strcmp(jcr1->buf, jcr2->buf);
291 //Dmsg3(000, "compare=%d: %s to %s\n", comp, jcr1->buf, jcr2->buf);
301 MYJCR *save_jcr = NULL;
304 jcr_chain = (dlist *)malloc(sizeof(dlist));
305 jcr_chain->init(jcr, &jcr->link);
307 printf("Prepend 20 items 0-19\n");
308 for (int i=0; i<20; i++) {
309 sprintf(buf, "This is dlist item %d", i);
310 jcr = (MYJCR *)malloc(sizeof(MYJCR));
311 jcr->buf = bstrdup(buf);
312 jcr_chain->prepend(jcr);
318 next_jcr = (MYJCR *)jcr_chain->next(save_jcr);
319 printf("11th item=%s\n", next_jcr->buf);
320 jcr = (MYJCR *)malloc(sizeof(MYJCR));
321 jcr->buf = save_jcr->buf;
322 printf("Remove 10th item\n");
323 jcr_chain->remove(save_jcr);
324 printf("Re-insert 10th item\n");
325 jcr_chain->insert_before(jcr, next_jcr);
327 printf("Print remaining list.\n");
328 foreach_dlist (jcr, jcr_chain) {
329 printf("Dlist item = %s\n", jcr->buf);
332 jcr_chain->destroy();
335 jcr_chain = new dlist(jcr, &jcr->link);
336 printf("append 20 items 0-19\n");
337 for (int i=0; i<20; i++) {
338 sprintf(buf, "This is dlist item %d", i);
339 jcr = (MYJCR *)malloc(sizeof(MYJCR));
340 jcr->buf = bstrdup(buf);
341 jcr_chain->append(jcr);
347 next_jcr = (MYJCR *)jcr_chain->next(save_jcr);
348 printf("11th item=%s\n", next_jcr->buf);
349 jcr = (MYJCR *)malloc(sizeof(MYJCR));
350 jcr->buf = save_jcr->buf;
351 printf("Remove 10th item\n");
352 jcr_chain->remove(save_jcr);
353 printf("Re-insert 10th item\n");
354 jcr_chain->insert_before(jcr, next_jcr);
356 printf("Print remaining list.\n");
357 foreach_dlist (jcr, jcr_chain) {
358 printf("Dlist item = %s\n", jcr->buf);
365 /* Now do a binary insert for the list */
366 jcr_chain = new dlist(jcr, &jcr->link);
368 printf("append %d items\n", CNT*CNT*CNT);
371 for (int i=0; i<CNT; i++) {
372 for (int j=0; j<CNT; j++) {
373 for (int k=0; k<CNT; k++) {
375 if ((count & 0x3FF) == 0) {
376 Dmsg1(000, "At %d\n", count);
378 jcr = (MYJCR *)malloc(sizeof(MYJCR));
379 jcr->buf = bstrdup(buf);
380 jcr1 = (MYJCR *)jcr_chain->binary_insert(jcr, my_compare);
382 Dmsg2(000, "Insert of %s vs %s failed.\n", jcr->buf, jcr1->buf);
393 printf("Print sorted list.\n");
394 foreach_dlist (jcr, jcr_chain) {
395 printf("Dlist item = %s\n", jcr->buf);