]>
git.ipfire.org Git - thirdparty/squid.git/blob - src/acl/DomainData.cc
4 * DEBUG: section 28 Access Control
5 * AUTHOR: Duane Wessels
7 * SQUID Web Proxy Cache http://www.squid-cache.org/
8 * ----------------------------------------------------------
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.
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.
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.
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.
34 * Copyright (c) 2003, Robert Collins <robertc@squid-cache.org>
38 #include "acl/DomainData.h"
39 #include "acl/Checklist.h"
49 ACLDomainData::~ACLDomainData()
52 domains
->destroy(xRefFree
);
57 splaystrcasecmp (T
&l
, T
&r
)
59 return strcasecmp ((char *)l
,(char *)r
);
64 splaystrcmp (T
&l
, T
&r
)
66 return strcmp ((char *)l
,(char *)r
);
69 /* general compare functions, these are used for tree search algorithms
70 * so they return <0, 0 or >0 */
72 /* compare a host and a domain */
75 aclHostDomainCompare( char *const &a
, char * const &b
)
77 const char *h
= (const char *)a
;
78 const char *d
= (const char *)b
;
79 return matchDomainName(h
, d
);
83 /* compare two domains */
87 aclDomainCompare(T
const &a
, T
const &b
)
89 char * const d1
= (char *const)b
;
90 char * const d2
= (char *const )a
;
92 ret
= aclHostDomainCompare(d1
, d2
);
97 ret
= aclHostDomainCompare(d3
, d4
);
100 /* FIXME this warning may display d1 and d2 when it should display d3 and d4 */
102 debugs(28, 0, "WARNING: '" << d1
<< "' is a subdomain of '" << d2
<< "'");
103 debugs(28, 0, "WARNING: because of this '" << (char *) a
<< "' is ignored to keep splay tree searching predictable");
104 debugs(28, 0, "WARNING: You should probably remove '" << d1
<< "' from the ACL named '" << AclMatchedName
<< "'");
111 ACLDomainData::match(char const *host
)
116 debugs(28, 3, "aclMatchDomainList: checking '" << host
<< "'");
118 domains
= domains
->splay((char *)host
, aclHostDomainCompare
);
120 debugs(28, 3, "aclMatchDomainList: '" << host
<< "' " << (splayLastResult
? "NOT found" : "found"));
122 return !splayLastResult
;
126 aclDumpDomainListWalkee(char * const & node_data
, void *outlist
)
128 /* outlist is really a wordlist ** */
129 wordlistAdd((wordlist
**)outlist
, (char const *)node_data
);
133 ACLDomainData::dump()
136 /* damn this is VERY inefficient for long ACL lists... filling
137 * a wordlist this way costs Sum(1,N) iterations. For instance
138 * a 1000-elements list will be filled in 499500 iterations.
140 domains
->walk(aclDumpDomainListWalkee
, &wl
);
145 ACLDomainData::parse()
149 while ((t
= strtokFile())) {
151 domains
= domains
->insert(xstrdup(t
), aclDomainCompare
);
156 ACLDomainData::empty() const
158 return domains
->empty();
162 ACLData
<char const *> *
163 ACLDomainData::clone() const
165 /* Splay trees don't clone yet. */
167 return new ACLDomainData
;