1/***************************************************************************
2 *                                  _   _ ____  _
3 *  Project                     ___| | | |  _ \| |
4 *                             / __| | | | |_) | |
5 *                            | (__| |_| |  _ <| |___
6 *                             \___|\___/|_| \_\_____|
7 *
8 * Copyright (C) 1998 - 2011, Daniel Stenberg, <daniel@haxx.se>, et al.
9 *
10 * This software is licensed as described in the file COPYING, which
11 * you should have received as part of this distribution. The terms
12 * are also available at http://curl.haxx.se/docs/copyright.html.
13 *
14 * You may opt to use, copy, modify, merge, publish, distribute and/or sell
15 * copies of the Software, and permit persons to whom the Software is
16 * furnished to do so, under the terms of the COPYING file.
17 *
18 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
19 * KIND, either express or implied.
20 *
21 ***************************************************************************/
22
23#include "curl_setup.h"
24
25#include "curl_memory.h"
26#include "slist.h"
27
28/* The last #include file should be: */
29#include "memdebug.h"
30
31/* returns last node in linked list */
32static struct curl_slist *slist_get_last(struct curl_slist *list)
33{
34  struct curl_slist     *item;
35
36  /* if caller passed us a NULL, return now */
37  if(!list)
38    return NULL;
39
40  /* loop through to find the last item */
41  item = list;
42  while(item->next) {
43    item = item->next;
44  }
45  return item;
46}
47
48/*
49 * curl_slist_append() appends a string to the linked list. It always returns
50 * the address of the first record, so that you can use this function as an
51 * initialization function as well as an append function. If you find this
52 * bothersome, then simply create a separate _init function and call it
53 * appropriately from within the program.
54 */
55struct curl_slist *curl_slist_append(struct curl_slist *list,
56                                     const char *data)
57{
58  struct curl_slist     *last;
59  struct curl_slist     *new_item;
60
61  new_item = malloc(sizeof(struct curl_slist));
62  if(new_item) {
63    char *dupdata = strdup(data);
64    if(dupdata) {
65      new_item->next = NULL;
66      new_item->data = dupdata;
67    }
68    else {
69      free(new_item);
70      return NULL;
71    }
72  }
73  else
74    return NULL;
75
76  if(list) {
77    last = slist_get_last(list);
78    last->next = new_item;
79    return list;
80  }
81
82  /* if this is the first item, then new_item *is* the list */
83  return new_item;
84}
85
86/*
87 * Curl_slist_duplicate() duplicates a linked list. It always returns the
88 * address of the first record of the cloned list or NULL in case of an
89 * error (or if the input list was NULL).
90 */
91struct curl_slist *Curl_slist_duplicate(struct curl_slist *inlist)
92{
93  struct curl_slist *outlist = NULL;
94  struct curl_slist *tmp;
95
96  while(inlist) {
97    tmp = curl_slist_append(outlist, inlist->data);
98
99    if(!tmp) {
100      curl_slist_free_all(outlist);
101      return NULL;
102    }
103
104    outlist = tmp;
105    inlist = inlist->next;
106  }
107  return outlist;
108}
109
110/* be nice and clean up resources */
111void curl_slist_free_all(struct curl_slist *list)
112{
113  struct curl_slist     *next;
114  struct curl_slist     *item;
115
116  if(!list)
117    return;
118
119  item = list;
120  do {
121    next = item->next;
122    Curl_safefree(item->data);
123    free(item);
124    item = next;
125  } while(next);
126}
127
128