src/acl/StringData.cc

   1 /*
   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.
  21  *
  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.
  26  *
  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
  35 #include "squid.h"
  36 #include "acl/StringData.h"
  37 #include "acl/Checklist.h"
  38 #include "cache_cf.h"
  39 #include "Debug.h"
  40 #include "wordlist.h"
  41
  42 ACLStringData::ACLStringData() : values (NULL)
  43 {}
  44
  45 ACLStringData::ACLStringData(ACLStringData const &old) : values (NULL)
  46 {
  47     assert (!old.values);
  48 }
  49
  50 template<class T>
  51 inline void
  52 xRefFree(T &thing)
  53 {
  54     xfree (thing);
  55 }
  56
  57 ACLStringData::~ACLStringData()
  58 {
  59     if (values)
  60         values->destroy(xRefFree);
  61 }
  62
  63 static int
  64 splaystrcmp (char * const &l, char * const &r)
  65 {
  66     return strcmp (l,r);
  67 }
  68
  69 bool
  70 ACLStringData::match(char const *toFind)
  71 {
  72     if (!values || !toFind)
  73         return 0;
  74
  75     debugs(28, 3, "aclMatchStringList: checking '" << toFind << "'");
  76
  77     values = values->splay((char *)toFind, splaystrcmp);
  78
  79     debugs(28, 3, "aclMatchStringList: '" << toFind << "' " << (splayLastResult ? "NOT found" : "found"));
  80
  81     return !splayLastResult;
  82 }
  83
  84 static void
  85 aclDumpStringWalkee(char * const & node_data, void *outlist)
  86 {
  87     /* outlist is really a wordlist ** */
  88     wordlistAdd((wordlist **)outlist, node_data);
  89 }
  90
  91 wordlist *
  92 ACLStringData::dump()
  93 {
  94     wordlist *wl = NULL;
  95     /* damn this is VERY inefficient for long ACL lists... filling
  96      * a wordlist this way costs Sum(1,N) iterations. For instance
  97      * a 1000-elements list will be filled in 499500 iterations.
  98      */
  99     values->walk(aclDumpStringWalkee, &wl);
 100     return wl;
 101 }
 102
 103 void
 104 ACLStringData::parse()
 105 {
 106     char *t;
 107
 108     while ((t = strtokFile()))
 109         values = values->insert(xstrdup(t), splaystrcmp);
 110 }
 111
 112 bool
 113 ACLStringData::empty() const
 114 {
 115     return values->empty();
 116 }
 117
 118 ACLData<char const *> *
 119 ACLStringData::clone() const
 120 {
 121     /* Splay trees don't clone yet. */
 122     assert (!values);
 123     return new ACLStringData(*this);
 124 }