2 * Amanda, The Advanced Maryland Automatic Network Disk Archiver
3 * Copyright (c) 1991-1998 University of Maryland at College Park
4 * Copyright (c) 2007-2012 Zmanda, Inc. All Rights Reserved.
7 * Permission to use, copy, modify, distribute, and sell this software and its
8 * documentation for any purpose is hereby granted without fee, provided that
9 * the above copyright notice appear in all copies and that both that
10 * copyright notice and this permission notice appear in supporting
11 * documentation, and that the name of U.M. not be used in advertising or
12 * publicity pertaining to distribution of the software without specific,
13 * written prior permission. U.M. makes no representations about the
14 * suitability of this software for any purpose. It is provided "as is"
15 * without express or implied warranty.
17 * U.M. DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL U.M.
19 * BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
20 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
21 * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
22 * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
24 * Author: James da Silva, Systems Design and Analysis Group
25 * Computer Science Department
26 * University of Maryland at College Park
29 * $Id: sl.c,v 1.6 2006/05/25 01:47:12 johnfranks Exp $
31 * A doubly linked list of string (char *)
51 sl = alloc(SIZEOF(am_sl_t));
67 a = alloc(SIZEOF(sle_t));
68 a->name = stralloc(name);
91 a = alloc(SIZEOF(sle_t));
92 a->name = stralloc(name);
116 for(b=sl->first; b != NULL; b=b->next) {
117 int i = strcmp(b->name, name);
118 if(i==0) return(sl); /* already there, no need to insert */
122 if(b == sl->first) return insert_sl(sl, name);
123 if(b == NULL) return append_sl(sl, name);
125 a = alloc(SIZEOF(sle_t));
126 a->name = stralloc(name);
128 /* insert before b */
163 elem->prev->next = elem->next;
165 sl->first = elem->next;
168 elem->next->prev = elem->prev;
170 sl->last = elem->prev;
183 am_sl_t *new_sl = NULL;
186 if(!sl) return new_sl;
188 for(a = sl->first; a != NULL; a = a->next) {
189 new_sl = append_sl(new_sl, a->name);
196 * Return "true" iff sl is empty (i.e. contains no elements).
205 return (sl->nb_element == 0);