]>
Commit | Line | Data |
---|---|---|
d295d770 | 1 | |
2 | /* | |
b510f3a1 | 3 | * DEBUG: section 03 Configuration File Parsing |
d295d770 | 4 | * AUTHOR: Harvest Derived |
5 | * | |
6 | * SQUID Web Proxy Cache http://www.squid-cache.org/ | |
7 | * ---------------------------------------------------------- | |
8 | * | |
9 | * Squid is the result of efforts by numerous individuals from | |
10 | * the Internet community; see the CONTRIBUTORS file for full | |
11 | * details. Many organizations have provided support for Squid's | |
12 | * development; see the SPONSORS file for full details. Squid is | |
13 | * Copyrighted (C) 2001 by the Regents of the University of | |
14 | * California; see the COPYRIGHT file for full details. Squid | |
15 | * incorporates software developed and/or copyrighted by other | |
16 | * sources; see the CREDITS file for full details. | |
17 | * | |
18 | * This program is free software; you can redistribute it and/or modify | |
19 | * it under the terms of the GNU General Public License as published by | |
20 | * the Free Software Foundation; either version 2 of the License, or | |
21 | * (at your option) any later version. | |
26ac0430 | 22 | * |
d295d770 | 23 | * This program is distributed in the hope that it will be useful, |
24 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
25 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
26 | * GNU General Public License for more details. | |
26ac0430 | 27 | * |
d295d770 | 28 | * You should have received a copy of the GNU General Public License |
29 | * along with this program; if not, write to the Free Software | |
30 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. | |
31 | * | |
32 | */ | |
33 | ||
f7f3304a | 34 | #include "squid.h" |
d295d770 | 35 | #include "MemBuf.h" |
602d9612 | 36 | #include "wordlist.h" |
d295d770 | 37 | |
38 | void | |
39 | wordlistDestroy(wordlist ** list) | |
40 | { | |
41 | wordlist *w = NULL; | |
42 | ||
43 | while ((w = *list) != NULL) { | |
44 | *list = w->next; | |
45 | safe_free(w->key); | |
46 | delete w; | |
47 | } | |
48 | ||
49 | *list = NULL; | |
50 | } | |
51 | ||
52 | const char * | |
53 | wordlistAdd(wordlist ** list, const char *key) | |
54 | { | |
55 | while (*list) | |
56 | list = &(*list)->next; | |
57 | ||
58 | *list = new wordlist; | |
59 | ||
60 | (*list)->key = xstrdup(key); | |
61 | ||
62 | (*list)->next = NULL; | |
63 | ||
64 | return (*list)->key; | |
65 | } | |
66 | ||
67 | void | |
68 | wordlistJoin(wordlist ** list, wordlist ** wl) | |
69 | { | |
70 | while (*list) | |
71 | list = &(*list)->next; | |
72 | ||
73 | *list = *wl; | |
74 | ||
75 | *wl = NULL; | |
76 | } | |
77 | ||
78 | void | |
79 | wordlistAddWl(wordlist ** list, wordlist * wl) | |
80 | { | |
81 | while (*list) | |
82 | list = &(*list)->next; | |
83 | ||
84 | for (; wl; wl = wl->next, list = &(*list)->next) { | |
85 | *list = new wordlist(); | |
86 | (*list)->key = xstrdup(wl->key); | |
87 | (*list)->next = NULL; | |
88 | } | |
89 | } | |
90 | ||
91 | void | |
92 | wordlistCat(const wordlist * w, MemBuf * mb) | |
93 | { | |
94 | while (NULL != w) { | |
95 | mb->Printf("%s\n", w->key); | |
96 | w = w->next; | |
97 | } | |
98 | } | |
99 | ||
100 | wordlist * | |
101 | wordlistDup(const wordlist * w) | |
102 | { | |
103 | wordlist *D = NULL; | |
104 | ||
105 | while (NULL != w) { | |
106 | wordlistAdd(&D, w->key); | |
107 | w = w->next; | |
108 | } | |
109 | ||
110 | return D; | |
111 | } | |
514fc315 FC |
112 | |
113 | SBufList | |
114 | ToSBufList(wordlist *wl) | |
115 | { | |
116 | SBufList rv; | |
117 | while (wl != NULL) { | |
118 | rv.push_back(SBuf(wl->key)); | |
119 | wl = wl->next; | |
120 | } | |
121 | return rv; | |
122 | } |