]>
Commit | Line | Data |
---|---|---|
3841dd46 | 1 | /* |
65092baf | 2 | * $Id: ACLDomainData.cc,v 1.10 2005/05/08 06:36:45 hno Exp $ |
3841dd46 | 3 | * |
4 | * DEBUG: section 28 Access Control | |
5 | * AUTHOR: Duane Wessels | |
6 | * | |
7 | * SQUID Web Proxy Cache http://www.squid-cache.org/ | |
8 | * ---------------------------------------------------------- | |
9 | * | |
10 | * Squid is the result of efforts by numerous individuals from | |
11 | * the Internet community; see the CONTRIBUTORS file for full | |
12 | * details. Many organizations have provided support for Squid's | |
13 | * development; see the SPONSORS file for full details. Squid is | |
14 | * Copyrighted (C) 2001 by the Regents of the University of | |
15 | * California; see the COPYRIGHT file for full details. Squid | |
16 | * incorporates software developed and/or copyrighted by other | |
17 | * sources; see the CREDITS file for full details. | |
18 | * | |
19 | * This program is free software; you can redistribute it and/or modify | |
20 | * it under the terms of the GNU General Public License as published by | |
21 | * the Free Software Foundation; either version 2 of the License, or | |
22 | * (at your option) any later version. | |
23 | * | |
24 | * This program is distributed in the hope that it will be useful, | |
25 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
26 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
27 | * GNU General Public License for more details. | |
28 | * | |
29 | * You should have received a copy of the GNU General Public License | |
30 | * along with this program; if not, write to the Free Software | |
31 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. | |
32 | * | |
33 | * | |
34 | * Copyright (c) 2003, Robert Collins <robertc@squid-cache.org> | |
35 | */ | |
36 | ||
37 | #include "squid.h" | |
38 | #include "ACLDomainData.h" | |
39 | #include "authenticate.h" | |
40 | #include "ACLChecklist.h" | |
41 | ||
3841dd46 | 42 | template<class T> |
43 | inline void | |
44 | xRefFree(T &thing) | |
45 | { | |
46 | xfree (thing); | |
47 | } | |
48 | ||
49 | ACLDomainData::~ACLDomainData() | |
50 | { | |
51 | if (domains) | |
62e76326 | 52 | domains->destroy(xRefFree); |
53 | } | |
3841dd46 | 54 | |
55 | template<class T> | |
56 | inline int | |
57 | splaystrcasecmp (T&l, T&r) | |
58 | { | |
59 | return strcasecmp ((char *)l,(char *)r); | |
60 | } | |
61 | ||
62 | template<class T> | |
63 | inline int | |
64 | splaystrcmp (T&l, T&r) | |
65 | { | |
66 | return strcmp ((char *)l,(char *)r); | |
67 | } | |
68 | ||
69 | /* general compare functions, these are used for tree search algorithms | |
70 | * so they return <0, 0 or >0 */ | |
71 | ||
7e6b941f | 72 | /* compare a host and a domain */ |
73 | ||
74 | static int | |
75 | aclHostDomainCompare( char *const &a, char * const &b) | |
76 | { | |
77 | const char *h = (const char *)a; | |
78 | const char *d = (const char *)b; | |
79 | return matchDomainName(h, d); | |
80 | } | |
81 | ||
82 | ||
3841dd46 | 83 | /* compare two domains */ |
84 | ||
85 | template<class T> | |
86 | int | |
87 | aclDomainCompare(T const &a, T const &b) | |
88 | { | |
89 | char * const d1 = (char *const)b; | |
90 | char * const d2 = (char *const )a; | |
91 | int ret; | |
92 | ret = aclHostDomainCompare(d1, d2); | |
62e76326 | 93 | |
3841dd46 | 94 | if (ret != 0) { |
62e76326 | 95 | char *const d3 = d2; |
96 | char *const d4 = d1; | |
97 | ret = aclHostDomainCompare(d3, d4); | |
3841dd46 | 98 | } |
62e76326 | 99 | |
3841dd46 | 100 | /* FIXME this warning may display d1 and d2 when it should display d3 and d4 */ |
101 | if (ret == 0) { | |
62e76326 | 102 | debug(28, 0) ("WARNING: '%s' is a subdomain of '%s'\n", d1, d2); |
103 | debug(28, 0) ("WARNING: because of this '%s' is ignored to keep splay tree searching predictable\n", (char *) a); | |
104 | debug(28, 0) ("WARNING: You should probably remove '%s' from the ACL named '%s'\n", d1, AclMatchedName); | |
3841dd46 | 105 | } |
62e76326 | 106 | |
3841dd46 | 107 | return ret; |
108 | } | |
109 | ||
3841dd46 | 110 | bool |
111 | ACLDomainData::match(char const *host) | |
112 | { | |
113 | if (host == NULL) | |
62e76326 | 114 | return 0; |
115 | ||
3841dd46 | 116 | debug(28, 3) ("aclMatchDomainList: checking '%s'\n", host); |
62e76326 | 117 | |
3841dd46 | 118 | domains = domains->splay((char *)host, aclHostDomainCompare); |
62e76326 | 119 | |
3841dd46 | 120 | debug(28, 3) ("aclMatchDomainList: '%s' %s\n", |
62e76326 | 121 | host, splayLastResult ? "NOT found" : "found"); |
122 | ||
3841dd46 | 123 | return !splayLastResult; |
124 | } | |
125 | ||
126 | static void | |
127 | aclDumpDomainListWalkee(char * const & node_data, void *outlist) | |
128 | { | |
129 | /* outlist is really a wordlist ** */ | |
130 | wordlistAdd((wordlist **)outlist, (char const *)node_data); | |
131 | } | |
132 | ||
133 | wordlist * | |
134 | ACLDomainData::dump() | |
135 | { | |
136 | wordlist *wl = NULL; | |
137 | /* damn this is VERY inefficient for long ACL lists... filling | |
138 | * a wordlist this way costs Sum(1,N) iterations. For instance | |
139 | * a 1000-elements list will be filled in 499500 iterations. | |
140 | */ | |
141 | domains->walk(aclDumpDomainListWalkee, &wl); | |
142 | return wl; | |
143 | } | |
144 | ||
145 | void | |
146 | ACLDomainData::parse() | |
147 | { | |
148 | char *t = NULL; | |
62e76326 | 149 | |
3841dd46 | 150 | while ((t = strtokFile())) { |
62e76326 | 151 | Tolower(t); |
152 | domains = domains->insert(xstrdup(t), aclDomainCompare); | |
3841dd46 | 153 | } |
154 | } | |
155 | ||
65092baf | 156 | bool |
157 | ACLDomainData::empty() const | |
158 | { | |
159 | return domains == NULL; | |
160 | } | |
161 | ||
3841dd46 | 162 | |
5dee515e | 163 | ACLData<char const *> * |
3841dd46 | 164 | ACLDomainData::clone() const |
165 | { | |
166 | /* Splay trees don't clone yet. */ | |
167 | assert (!domains); | |
168 | return new ACLDomainData; | |
169 | } |