src/acl/UserData.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.h"
  38 #include "acl/UserData.h"
  39 #include "acl/Checklist.h"
  40 #include "wordlist.h"
  41 #include "ConfigParser.h"
  42
  43 template<class T>
  44 inline void
  45 xRefFree(T &thing)
  46 {
  47     xfree (thing);
  48 }
  49
  50 ACLUserData::~ACLUserData()
  51 {
  52     if (names)
  53         names->destroy(xRefFree);
  54 }
  55
  56 static int
  57 splaystrcasecmp (char * const &l, char * const &r)
  58 {
  59     return strcasecmp ((char *)l,(char *)r);
  60 }
  61
  62 static int
  63 splaystrcmp (char * const &l, char * const &r)
  64 {
  65     return strcmp ((char *)l,(char *)r);
  66 }
  67
  68 bool
  69 ACLUserData::match(char const *user)
  70 {
  71     SplayNode<char *> *Top = names;
  72
  73     debugs(28, 7, "aclMatchUser: user is " << user << ", case_insensitive is " << flags.case_insensitive);
  74     debugs(28, 8, "Top is " << Top << ", Top->data is " << ((char *) (Top != NULL ? (Top)->data : "Unavailable")));
  75
  76     if (user == NULL || strcmp(user, "-") == 0)
  77         return 0;
  78
  79     if (flags.required) {
  80         debugs(28, 7, "aclMatchUser: user REQUIRED and auth-info present.");
  81         return 1;
  82     }
  83
  84     if (flags.case_insensitive)
  85         Top = Top->splay((char *)user, splaystrcasecmp);
  86     else
  87         Top = Top->splay((char *)user, splaystrcmp);
  88
  89     /* Top=splay_splay(user,Top,(splayNode::SPLAYCMP *)dumping_strcmp); */
  90     debugs(28, 7, "aclMatchUser: returning " << !splayLastResult << ",Top is " <<
  91            Top << ", Top->data is " << ((char *) (Top ? Top->data : "Unavailable")));
  92
  93     names = Top;
  94
  95     return !splayLastResult;
  96 }
  97
  98 static void
  99 aclDumpUserListWalkee(char * const & node_data, void *outlist)
 100 {
 101     /* outlist is really a wordlist ** */
 102     wordlistAdd((wordlist **)outlist, (char const *)node_data);
 103 }
 104
 105 wordlist *
 106 ACLUserData::dump()
 107 {
 108     wordlist *wl = NULL;
 109
 110     if (flags.case_insensitive)
 111         wordlistAdd(&wl, "-i");
 112
 113     /* damn this is VERY inefficient for long ACL lists... filling
 114      * a wordlist this way costs Sum(1,N) iterations. For instance
 115      * a 1000-elements list will be filled in 499500 iterations.
 116      */
 117     if (flags.required)
 118         wordlistAdd(&wl, "REQUIRED");
 119     else if (names)
 120         names->walk(aclDumpUserListWalkee, &wl);
 121
 122     return wl;
 123 }
 124
 125 void
 126 ACLUserData::parse()
 127 {
 128     debugs(28, 2, "aclParseUserList: parsing user list");
 129     char *t = NULL;
 130
 131     if ((t = ConfigParser::strtokFile())) {
 132         debugs(28, 5, "aclParseUserList: First token is " << t);
 133
 134         if (strcmp("-i", t) == 0) {
 135             debugs(28, 5, "aclParseUserList: Going case-insensitive");
 136             flags.case_insensitive = 1;
 137         } else if (strcmp("REQUIRED", t) == 0) {
 138             debugs(28, 5, "aclParseUserList: REQUIRED-type enabled");
 139             flags.required = 1;
 140         } else {
 141             if (flags.case_insensitive)
 142                 Tolower(t);
 143
 144             names = names->insert(xstrdup(t), splaystrcmp);
 145         }
 146     }
 147
 148     debugs(28, 3, "aclParseUserList: Case-insensitive-switch is " << flags.case_insensitive);
 149     /* we might inherit from a previous declaration */
 150
 151     debugs(28, 4, "aclParseUserList: parsing user list");
 152
 153     while ((t = ConfigParser::strtokFile())) {
 154         debugs(28, 6, "aclParseUserList: Got token: " << t);
 155
 156         if (flags.case_insensitive)
 157             Tolower(t);
 158
 159         names = names->insert(xstrdup(t), splaystrcmp);
 160     }
 161 }
 162
 163
 164 bool
 165 ACLUserData::empty() const
 166 {
 167     return names->empty() && !flags.required;
 168 }
 169
 170 ACLData<char const *> *
 171 ACLUserData::clone() const
 172 {
 173     /* Splay trees don't clone yet. */
 174     assert (!names);
 175     return new ACLUserData;
 176 }