src/acl/StringData.cc

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