2 Bacula® - The Network Backup Solution
4 Copyright (C) 2003-2008 Free Software Foundation Europe e.V.
6 The main author of Bacula is Kern Sibbald, with contributions from
7 many others, a complete list can be found in the file AUTHORS.
8 This program is Free Software; you can redistribute it and/or
9 modify it under the terms of version two of the GNU General Public
10 License as published by the Free Software Foundation and included
13 This program is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
23 Bacula® is a registered trademark of Kern Sibbald.
24 The licensor of Bacula is the Free Software Foundation Europe
25 (FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
26 Switzerland, email:ftf@fsfeurope.org.
31 * Kern Sibbald, June MMIII
36 * There is a lot of extra casting here to work around the fact
37 * that some compilers (Sun and Visual C++) do not accept
38 * (void *) as an lvalue on the left side of an equal.
40 * Loop var through each member of list
43 #define foreach_alist(var, list) \
44 for((var)=(typeof(var))(list)->first(); (var); (var)=(typeof(var))(list)->next() )
46 #define foreach_alist(var, list) \
47 for((*((void **)&(var))=(void*)((list)->first())); \
49 (*((void **)&(var))=(void*)((list)->next())))
54 /* Second arg of init */
56 owned_by_alist = true,
57 not_owned_by_alist = false
61 * Array list -- much like a simplified STL vector
62 * array of pointers to inserted items
64 class alist : public SMARTALLOC {
73 alist(int num = 1, bool own=true);
75 void init(int num = 1, bool own=true);
76 void append(void *item);
77 void prepend(void *item);
78 void *remove(int index);
85 void * operator [](int index) const;
90 /* Use it as a stack, pushing and poping from the end */
91 void push(void *item) { append(item); };
92 void *pop() { return remove(num_items-1); };
95 inline void * alist::operator [](int index) const {
96 if (index < 0 || index >= num_items) {
102 inline bool alist::empty() const
104 /* Check for null pointer */
105 return this ? num_items == 0 : true;
109 * This allows us to do explicit initialization,
110 * allowing us to mix C++ classes inside malloc'ed
111 * C structures. Define before called in constructor.
113 inline void alist::init(int num, bool own) {
122 inline alist::alist(int num, bool own) {
127 inline alist::~alist() {
133 /* Current size of list */
134 inline int alist::size() const
137 * Check for null pointer, which allows test
138 * on size to succeed even if nothing put in
141 return this ? num_items : 0;
144 /* How much to grow by each time */
145 inline void alist::grow(int num)