/*
- * Bacula array list routines
+ * Bacula array list routines
*
* alist is a simple malloc'ed array of pointers. For the moment,
- * it simply malloc's a bigger array controlled by num_grow.
+ * it simply malloc's a bigger array controlled by num_grow.
* Default is to realloc the pointer array for each new member.
*
* Kern Sibbald, June MMIII
*
*/
/*
- Copyright (C) 2000-2003 Kern Sibbald and John Walker
+ Copyright (C) 2000-2004 Kern Sibbald and John Walker
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
#include "bacula.h"
/*
- * Private grow list function. Used to insure that
+ * Private grow list function. Used to insure that
* at least one more "slot" is available.
*/
void alist::grow_list()
if (num_items == 0) {
return NULL;
} else {
- cur_item = num_items;
+ cur_item = num_items;
return items[num_items-1];
}
}
}
/*
- * prepend an item to the list
+ * prepend an item to the list -- i.e. add to beginning
*/
void alist::prepend(void *item) {
grow_list();
if (own_items) {
for (int i=0; i<num_items; i++) {
free(items[i]);
+ items[i] = NULL;
}
}
free(items);
+ items = NULL;
}
}
fileset->mylist.init();
printf("Manual allocation/destruction of list:\n");
-
+
for (int i=0; i<20; i++) {
sprintf(buf, "This is item %d", i);
fileset->mylist.append(bstrdup(buf));
- }
+ }
for (int i=0; i< fileset->mylist.size(); i++) {
- printf("Item %d = %s\n", i, (char *)fileset->mylist[i]);
+ printf("Item %d = %s\n", i, (char *)fileset->mylist[i]);
}
fileset->mylist.destroy();
free(fileset);
for (int i=0; i<20; i++) {
sprintf(buf, "This is item %d", i);
mlist->append(bstrdup(buf));
- }
+ }
for (int i=0; i< mlist->size(); i++) {
- printf("Item %d = %s\n", i, (char *)mlist->get(i));
+ printf("Item %d = %s\n", i, (char *)mlist->get(i));
}
delete mlist;
- sm_dump(False);
+ sm_dump(false);
}
#endif