1 /***************************************************************************
3 * Project ___| | | | _ \| |
5 * | (__| |_| | _ <| |___
6 * \___|\___/|_| \_\_____|
8 * Copyright (C) 1998 - 2013, Daniel Stenberg, <daniel@haxx.se>, et al.
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.
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.
18 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
19 * KIND, either express or implied.
21 ***************************************************************************/
23 #include "curl_setup.h"
25 #include "curl_memory.h"
28 /* The last #include file should be: */
31 /* returns last node in linked list */
32 static struct curl_slist *slist_get_last(struct curl_slist *list)
34 struct curl_slist *item;
36 /* if caller passed us a NULL, return now */
40 /* loop through to find the last item */
49 * Curl_slist_append_nodup() appends a string to the linked list. Rather than
50 * copying the string in dynamic storage, it takes its ownership. The string
51 * should have been malloc()ated. Curl_slist_append_nodup always returns
52 * the address of the first record, so that you can use this function as an
53 * initialization function as well as an append function.
54 * If an error occurs, NULL is returned and the string argument is NOT
57 struct curl_slist *Curl_slist_append_nodup(struct curl_slist *list, char *data)
59 struct curl_slist *last;
60 struct curl_slist *new_item;
64 new_item = malloc(sizeof(struct curl_slist));
68 new_item->next = NULL;
69 new_item->data = data;
71 /* if this is the first item, then new_item *is* the list */
75 last = slist_get_last(list);
76 last->next = new_item;
81 * curl_slist_append() appends a string to the linked list. It always returns
82 * the address of the first record, so that you can use this function as an
83 * initialization function as well as an append function. If you find this
84 * bothersome, then simply create a separate _init function and call it
85 * appropriately from within the program.
87 struct curl_slist *curl_slist_append(struct curl_slist *list,
90 char *dupdata = strdup(data);
95 list = Curl_slist_append_nodup(list, dupdata);
103 * Curl_slist_duplicate() duplicates a linked list. It always returns the
104 * address of the first record of the cloned list or NULL in case of an
105 * error (or if the input list was NULL).
107 struct curl_slist *Curl_slist_duplicate(struct curl_slist *inlist)
109 struct curl_slist *outlist = NULL;
110 struct curl_slist *tmp;
113 tmp = curl_slist_append(outlist, inlist->data);
116 curl_slist_free_all(outlist);
121 inlist = inlist->next;
126 /* be nice and clean up resources */
127 void curl_slist_free_all(struct curl_slist *list)
129 struct curl_slist *next;
130 struct curl_slist *item;
138 Curl_safefree(item->data);