src/ACLDomainData.cc

   1 /*
   2  * $Id: ACLDomainData.cc,v 1.4 2003/07/14 08:21:56 robertc Exp $
   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
  42 MemPool (*ACLDomainData::Pool)(NULL);
  43 void *
  44 ACLDomainData::operator new (size_t byteCount)
  45 {
  46     /* derived classes with different sizes must implement their own new */
  47     assert (byteCount == sizeof (ACLDomainData));
  48
  49     if (!Pool)
  50         Pool = memPoolCreate("ACLDomainData", sizeof (ACLDomainData));
  51
  52     return memPoolAlloc(Pool);
  53 }
  54
  55 void
  56 ACLDomainData::operator delete (void *address)
  57 {
  58     memPoolFree (Pool, address);
  59 }
  60
  61 void
  62 ACLDomainData::deleteSelf() const
  63 {
  64     delete this;
  65 }
  66
  67 template<class T>
  68 inline void
  69 xRefFree(T &thing)
  70 {
  71     xfree (thing);
  72 }
  73
  74 ACLDomainData::~ACLDomainData()
  75 {
  76     if (domains)
  77         domains->destroy(xRefFree);
  78 }
  79
  80 template<class T>
  81 inline int
  82 splaystrcasecmp (T&l, T&r)
  83 {
  84     return strcasecmp ((char *)l,(char *)r);
  85 }
  86
  87 template<class T>
  88 inline int
  89 splaystrcmp (T&l, T&r)
  90 {
  91     return strcmp ((char *)l,(char *)r);
  92 }
  93
  94 /* general compare functions, these are used for tree search algorithms
  95  * so they return <0, 0 or >0 */
  96
  97 /* compare two domains */
  98
  99 template<class T>
 100 int
 101 aclDomainCompare(T const &a, T const &b)
 102 {
 103     char * const d1 = (char *const)b;
 104     char * const d2 = (char *const )a;
 105     int ret;
 106     ret = aclHostDomainCompare(d1, d2);
 107
 108     if (ret != 0) {
 109         char *const d3 = d2;
 110         char *const d4 = d1;
 111         ret = aclHostDomainCompare(d3, d4);
 112     }
 113
 114     /* FIXME this warning may display d1 and d2 when it should display d3 and d4 */
 115     if (ret == 0) {
 116         debug(28, 0) ("WARNING: '%s' is a subdomain of '%s'\n", d1, d2);
 117         debug(28, 0) ("WARNING: because of this '%s' is ignored to keep splay tree searching predictable\n", (char *) a);
 118         debug(28, 0) ("WARNING: You should probably remove '%s' from the ACL named '%s'\n", d1, AclMatchedName);
 119     }
 120
 121     return ret;
 122 }
 123
 124 /* compare a host and a domain */
 125
 126 static int
 127 aclHostDomainCompare( char *const &a, char * const &b)
 128 {
 129     const char *h = (const char *)a;
 130     const char *d = (const char *)b;
 131     return matchDomainName(h, d);
 132 }
 133
 134
 135 bool
 136 ACLDomainData::match(char const *host)
 137 {
 138     if (host == NULL)
 139         return 0;
 140
 141     debug(28, 3) ("aclMatchDomainList: checking '%s'\n", host);
 142
 143     domains = domains->splay((char *)host, aclHostDomainCompare);
 144
 145     debug(28, 3) ("aclMatchDomainList: '%s' %s\n",
 146                   host, splayLastResult ? "NOT found" : "found");
 147
 148     return !splayLastResult;
 149 }
 150
 151 static void
 152 aclDumpDomainListWalkee(char * const & node_data, void *outlist)
 153 {
 154     /* outlist is really a wordlist ** */
 155     wordlistAdd((wordlist **)outlist, (char const *)node_data);
 156 }
 157
 158 wordlist *
 159 ACLDomainData::dump()
 160 {
 161     wordlist *wl = NULL;
 162     /* damn this is VERY inefficient for long ACL lists... filling
 163      * a wordlist this way costs Sum(1,N) iterations. For instance
 164      * a 1000-elements list will be filled in 499500 iterations.
 165      */
 166     domains->walk(aclDumpDomainListWalkee, &wl);
 167     return wl;
 168 }
 169
 170 void
 171 ACLDomainData::parse()
 172 {
 173     char *t = NULL;
 174
 175     while ((t = strtokFile())) {
 176         Tolower(t);
 177         domains = domains->insert(xstrdup(t), aclDomainCompare);
 178     }
 179 }
 180
 181
 182 ACLData<char const *> *
 183 ACLDomainData::clone() const
 184 {
 185     /* Splay trees don't clone yet. */
 186     assert (!domains);
 187     return new ACLDomainData;
 188 }