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 * Returns: item if item inserted
107 * other_item if same value already exists (item not inserted)
109 void *dlist::binary_insert(void *item, int compare(void *item1, void *item2))
115 if (num_items == 0) {
116 //Dmsg0(000, "Append first.\n");
120 if (num_items == 1) {
121 comp = compare(item, first());
124 //Dmsg0(000, "Insert before first.\n");
126 } else if (comp > 0) {
127 insert_after(item, first());
128 //Dmsg0(000, "Insert after first.\n");
131 //Dmsg0(000, "Same as first.\n");
135 /* Check against last item */
136 comp = compare(item, last());
139 //Dmsg0(000, "Appended item.\n");
141 } else if (comp == 0) {
142 //Dmsg0(000, "Same as last.\n");
145 /* Check against first item */
146 comp = compare(item, first());
149 //Dmsg0(000, "Inserted item before.\n");
151 } else if (comp == 0) {
152 //Dmsg0(000, "Same as first.\n");
155 if (num_items == 2) {
156 insert_after(item, first());
157 //Dmsg0(000, "Inserted item after.\n");
166 nxt = (low + high) / 2;
168 cur_item = next(cur_item);
172 cur_item = prev(cur_item);
175 //Dmsg1(000, "Compare item to %d\n", cur);
176 comp = compare(item, cur_item);
177 //Dmsg2(000, "Compare item to %d = %d\n", cur, comp);
180 //Dmsg2(000, "set high; low=%d high=%d\n", low, high);
181 } else if (comp > 0) {
183 //Dmsg2(000, "set low; low=%d high=%d\n", low, high);
185 //Dmsg1(000, "Same as item %d\n", cur);
190 insert_before(item, cur_item);
191 //Dmsg1(000, "Insert before item %d\n", cur);
193 insert_after(item, cur_item);
194 //Dmsg1(000, "Insert after item %d\n", cur);
200 void dlist::remove(void *item)
203 dlink *ilink = (dlink *)(((char *)item)+loffset); /* item's link */
207 ((dlink *)(((char *)head)+loffset))->prev = NULL;
212 } else if (item == tail) {
215 ((dlink *)(((char *)tail)+loffset))->next = NULL;
219 ((dlink *)(((char *)xitem)+loffset))->prev = ilink->prev;
221 ((dlink *)(((char *)xitem)+loffset))->next = ilink->next;
224 if (num_items == 0) {
229 void * dlist::next(void *item)
234 return ((dlink *)(((char *)item)+loffset))->next;
237 void * dlist::prev(void *item)
242 return ((dlink *)(((char *)item)+loffset))->prev;
246 /* Destroy the list contents */
247 void dlist::destroy()
249 for (void *n=head; n; ) {
250 void *ni = ((dlink *)(((char *)n)+loffset))->next;
267 static int my_compare(void *item1, void *item2)
271 jcr1 = (MYJCR *)item1;
272 jcr2 = (MYJCR *)item2;
273 comp = strcmp(jcr1->buf, jcr2->buf);
274 //Dmsg3(000, "compare=%d: %s to %s\n", comp, jcr1->buf, jcr2->buf);
284 MYJCR *save_jcr = NULL;
287 jcr_chain = (dlist *)malloc(sizeof(dlist));
288 jcr_chain->init(jcr, &jcr->link);
290 printf("Prepend 20 items 0-19\n");
291 for (int i=0; i<20; i++) {
292 sprintf(buf, "This is dlist item %d", i);
293 jcr = (MYJCR *)malloc(sizeof(MYJCR));
294 jcr->buf = bstrdup(buf);
295 jcr_chain->prepend(jcr);
301 next_jcr = (MYJCR *)jcr_chain->next(save_jcr);
302 printf("11th item=%s\n", next_jcr->buf);
303 jcr = (MYJCR *)malloc(sizeof(MYJCR));
304 jcr->buf = save_jcr->buf;
305 printf("Remove 10th item\n");
306 jcr_chain->remove(save_jcr);
307 printf("Re-insert 10th item\n");
308 jcr_chain->insert_before(jcr, next_jcr);
310 printf("Print remaining list.\n");
311 foreach_dlist (jcr, jcr_chain) {
312 printf("Dlist item = %s\n", jcr->buf);
315 jcr_chain->destroy();
318 jcr_chain = new dlist(jcr, &jcr->link);
319 printf("append 20 items 0-19\n");
320 for (int i=0; i<20; i++) {
321 sprintf(buf, "This is dlist item %d", i);
322 jcr = (MYJCR *)malloc(sizeof(MYJCR));
323 jcr->buf = bstrdup(buf);
324 jcr_chain->append(jcr);
330 next_jcr = (MYJCR *)jcr_chain->next(save_jcr);
331 printf("11th item=%s\n", next_jcr->buf);
332 jcr = (MYJCR *)malloc(sizeof(MYJCR));
333 jcr->buf = save_jcr->buf;
334 printf("Remove 10th item\n");
335 jcr_chain->remove(save_jcr);
336 printf("Re-insert 10th item\n");
337 jcr_chain->insert_before(jcr, next_jcr);
339 printf("Print remaining list.\n");
340 foreach_dlist (jcr, jcr_chain) {
341 printf("Dlist item = %s\n", jcr->buf);
348 /* Now do a binary insert for the list */
349 jcr_chain = new dlist(jcr, &jcr->link);
351 printf("append %d items\n", CNT*CNT*CNT);
354 for (int i=0; i<CNT; i++) {
355 for (int j=0; j<CNT; j++) {
356 for (int k=0; k<CNT; k++) {
358 if ((count & 0x3FF) == 0) {
359 Dmsg1(000, "At %d\n", count);
361 jcr = (MYJCR *)malloc(sizeof(MYJCR));
362 jcr->buf = bstrdup(buf);
363 jcr1 = (MYJCR *)jcr_chain->binary_insert(jcr, my_compare);
365 Dmsg2(000, "Insert of %s vs %s failed.\n", jcr->buf, jcr1->buf);
376 printf("Print sorted list.\n");
377 foreach_dlist (jcr, jcr_chain) {
378 printf("Dlist item = %s\n", jcr->buf);