]>
Commit | Line | Data |
---|---|---|
48071869 | 1 | /* |
48071869 | 2 | * DEBUG: section 28 Access Control |
3 | * AUTHOR: Duane Wessels | |
4 | * | |
5 | * SQUID Web Proxy Cache http://www.squid-cache.org/ | |
6 | * ---------------------------------------------------------- | |
7 | * | |
8 | * Squid is the result of efforts by numerous individuals from | |
9 | * the Internet community; see the CONTRIBUTORS file for full | |
10 | * details. Many organizations have provided support for Squid's | |
11 | * development; see the SPONSORS file for full details. Squid is | |
12 | * Copyrighted (C) 2001 by the Regents of the University of | |
13 | * California; see the COPYRIGHT file for full details. Squid | |
14 | * incorporates software developed and/or copyrighted by other | |
15 | * sources; see the CREDITS file for full details. | |
16 | * | |
17 | * This program is free software; you can redistribute it and/or modify | |
18 | * it under the terms of the GNU General Public License as published by | |
19 | * the Free Software Foundation; either version 2 of the License, or | |
20 | * (at your option) any later version. | |
26ac0430 | 21 | * |
48071869 | 22 | * This program is distributed in the hope that it will be useful, |
23 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
24 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
25 | * GNU General Public License for more details. | |
26ac0430 | 26 | * |
48071869 | 27 | * You should have received a copy of the GNU General Public License |
28 | * along with this program; if not, write to the Free Software | |
29 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. | |
30 | * | |
31 | * | |
32 | * Copyright (c) 2003, Robert Collins <robertc@squid-cache.org> | |
33 | */ | |
34 | ||
582c2af2 | 35 | #include "squid.h" |
3ad63615 | 36 | #include "acl/Checklist.h" |
602d9612 | 37 | #include "acl/StringData.h" |
06390e4b | 38 | #include "cache_cf.h" |
cdaba1d8 | 39 | #include "Debug.h" |
48071869 | 40 | |
48071869 | 41 | ACLStringData::ACLStringData() : values (NULL) |
42 | {} | |
43 | ||
44 | ACLStringData::ACLStringData(ACLStringData const &old) : values (NULL) | |
45 | { | |
46 | assert (!old.values); | |
47 | } | |
48 | ||
49 | template<class T> | |
50 | inline void | |
51 | xRefFree(T &thing) | |
52 | { | |
53 | xfree (thing); | |
54 | } | |
55 | ||
56 | ACLStringData::~ACLStringData() | |
57 | { | |
58 | if (values) | |
59 | values->destroy(xRefFree); | |
60 | } | |
61 | ||
079b4b63 | 62 | static int |
63 | splaystrcmp (char * const &l, char * const &r) | |
48071869 | 64 | { |
079b4b63 | 65 | return strcmp (l,r); |
48071869 | 66 | } |
67 | ||
00352183 AR |
68 | void |
69 | ACLStringData::insert(const char *value) | |
70 | { | |
71 | values = values->insert(xstrdup(value), splaystrcmp); | |
72 | } | |
73 | ||
48071869 | 74 | bool |
75 | ACLStringData::match(char const *toFind) | |
76 | { | |
77 | if (!values || !toFind) | |
78 | return 0; | |
79 | ||
bf8fe701 | 80 | debugs(28, 3, "aclMatchStringList: checking '" << toFind << "'"); |
48071869 | 81 | |
82 | values = values->splay((char *)toFind, splaystrcmp); | |
83 | ||
bf8fe701 | 84 | debugs(28, 3, "aclMatchStringList: '" << toFind << "' " << (splayLastResult ? "NOT found" : "found")); |
48071869 | 85 | |
86 | return !splayLastResult; | |
87 | } | |
88 | ||
89 | static void | |
90 | aclDumpStringWalkee(char * const & node_data, void *outlist) | |
91 | { | |
8966008b FC |
92 | /* outlist is really a SBufList* */ |
93 | static_cast<SBufList*>(outlist)->push_back(SBuf(node_data)); | |
48071869 | 94 | } |
95 | ||
8966008b | 96 | SBufList |
4f8ca96e | 97 | ACLStringData::dump() const |
48071869 | 98 | { |
8966008b | 99 | SBufList sl; |
48071869 | 100 | /* damn this is VERY inefficient for long ACL lists... filling |
519bae94 | 101 | * a SBufList this way costs Sum(1,N) iterations. For instance |
48071869 | 102 | * a 1000-elements list will be filled in 499500 iterations. |
103 | */ | |
8966008b FC |
104 | values->walk(aclDumpStringWalkee, &sl); |
105 | return sl; | |
48071869 | 106 | } |
107 | ||
108 | void | |
109 | ACLStringData::parse() | |
110 | { | |
111 | char *t; | |
112 | ||
113 | while ((t = strtokFile())) | |
114 | values = values->insert(xstrdup(t), splaystrcmp); | |
115 | } | |
116 | ||
65092baf | 117 | bool |
118 | ACLStringData::empty() const | |
119 | { | |
290eb6b9 | 120 | return values->empty(); |
65092baf | 121 | } |
122 | ||
48071869 | 123 | ACLData<char const *> * |
124 | ACLStringData::clone() const | |
125 | { | |
126 | /* Splay trees don't clone yet. */ | |
127 | assert (!values); | |
128 | return new ACLStringData(*this); | |
129 | } |