src/DelayUser.cc

   1
   2 /*
   3  * $Id$
   4  *
   5  * DEBUG: section 77    Delay Pools
   6  * AUTHOR: Robert Collins <robertc@squid-cache.org>
   7  *
   8  * SQUID Web Proxy Cache          http://www.squid-cache.org/
   9  * ----------------------------------------------------------
  10  *
  11  *  Squid is the result of efforts by numerous individuals from
  12  *  the Internet community; see the CONTRIBUTORS file for full
  13  *  details.   Many organizations have provided support for Squid's
  14  *  development; see the SPONSORS file for full details.  Squid is
  15  *  Copyrighted (C) 2001 by the Regents of the University of
  16  *  California; see the COPYRIGHT file for full details.  Squid
  17  *  incorporates software developed and/or copyrighted by other
  18  *  sources; see the CREDITS file for full details.
  19  *
  20  *  This program is free software; you can redistribute it and/or modify
  21  *  it under the terms of the GNU General Public License as published by
  22  *  the Free Software Foundation; either version 2 of the License, or
  23  *  (at your option) any later version.
  24  *
  25  *  This program is distributed in the hope that it will be useful,
  26  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  27  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  28  *  GNU General Public License for more details.
  29  *
  30  *  You should have received a copy of the GNU General Public License
  31  *  along with this program; if not, write to the Free Software
  32  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
  33  *
  34  *
  35  * Copyright (c) 2003, Robert Collins <robertc@squid-cache.org>
  36  */
  37
  38 #include "config.h"
  39
  40 #if DELAY_POOLS
  41 #include "squid.h"
  42 #include "DelayUser.h"
  43 #include "AuthUserRequest.h"
  44 #include "AuthUser.h"
  45 #include "NullDelayId.h"
  46 #include "Store.h"
  47
  48 void *
  49 DelayUser::operator new(size_t size)
  50 {
  51     DelayPools::MemoryUsed += sizeof (DelayUser);
  52     return ::operator new (size);
  53 }
  54
  55 void
  56 DelayUser::operator delete (void *address)
  57 {
  58     DelayPools::MemoryUsed -= sizeof (DelayUser);
  59     ::operator delete (address);
  60 }
  61
  62 DelayUser::DelayUser()
  63 {
  64     DelayPools::registerForUpdates (this);
  65 }
  66
  67 static SplayNode<DelayUserBucket::Pointer>::SPLAYFREE DelayUserFree;
  68
  69 DelayUser::~DelayUser()
  70 {
  71     DelayPools::deregisterForUpdates (this);
  72     buckets.head->destroy (DelayUserFree);
  73 }
  74
  75 static SplayNode<DelayUserBucket::Pointer>::SPLAYCMP DelayUserCmp;
  76
  77 int
  78 DelayUserCmp(DelayUserBucket::Pointer const &left, DelayUserBucket::Pointer const &right)
  79 {
  80     /* for rate limiting, case insensitive */
  81     return strcasecmp(left->authUser->username(), right->authUser->username());
  82 }
  83
  84 void
  85 DelayUserFree(DelayUserBucket::Pointer &)
  86 {}
  87
  88 void
  89 DelayUserStatsWalkee(DelayUserBucket::Pointer const &current, void *state)
  90 {
  91     current->stats ((StoreEntry *)state);
  92 }
  93
  94 void
  95 DelayUser::stats(StoreEntry * sentry)
  96 {
  97     spec.stats (sentry, "Per User");
  98
  99     if (spec.restore_bps == -1)
 100         return;
 101
 102     storeAppendPrintf(sentry, "\t\tCurrent: ");
 103
 104     if (!buckets.head) {
 105         storeAppendPrintf (sentry, "Not used yet.\n\n");
 106         return;
 107     }
 108
 109     buckets.head->walk(DelayUserStatsWalkee, sentry);
 110     storeAppendPrintf(sentry, "\n\n");
 111 }
 112
 113 void
 114 DelayUser::dump(StoreEntry *entry) const
 115 {
 116     spec.dump(entry);
 117 }
 118
 119 struct DelayUserUpdater {
 120     DelayUserUpdater (DelaySpec &_spec, int _incr):spec(_spec),incr(_incr) {};
 121
 122     DelaySpec spec;
 123     int incr;
 124 };
 125
 126 void
 127 DelayUserUpdateWalkee(DelayUserBucket::Pointer const &current, void *state)
 128 {
 129     DelayUserUpdater *t = (DelayUserUpdater *)state;
 130     /* This doesn't change the value of the DelayUserBucket, so is safe */
 131     const_cast<DelayUserBucket *>(current.getRaw())->theBucket.update(t->spec, t->incr);
 132 }
 133
 134 void
 135 DelayUser::update(int incr)
 136 {
 137     DelayUserUpdater updater(spec, incr);
 138     buckets.head->walk (DelayUserUpdateWalkee, &updater);
 139 }
 140
 141 void
 142 DelayUser::parse()
 143 {
 144     spec.parse();
 145 }
 146
 147 DelayIdComposite::Pointer
 148 DelayUser::id(CompositePoolNode::CompositeSelectionDetails &details)
 149 {
 150     if (!details.user)
 151         return new NullDelayId;
 152
 153     return new Id(this, details.user->user());
 154 }
 155
 156 void *
 157 DelayUser::Id::operator new(size_t size)
 158 {
 159     DelayPools::MemoryUsed += sizeof (Id);
 160     return ::operator new (size);
 161 }
 162
 163 void
 164 DelayUser::Id::operator delete (void *address)
 165 {
 166     DelayPools::MemoryUsed -= sizeof (Id);
 167     ::operator delete (address);
 168 }
 169
 170 void *
 171 DelayUserBucket::operator new(size_t size)
 172 {
 173     DelayPools::MemoryUsed += sizeof (DelayUserBucket);
 174     return ::operator new (size);
 175 }
 176
 177 void
 178 DelayUserBucket::operator delete (void *address)
 179 {
 180     DelayPools::MemoryUsed -= sizeof (DelayUserBucket);
 181     ::operator delete (address);
 182 }
 183
 184 DelayUserBucket::DelayUserBucket(AuthUser *aUser) : authUser (aUser)
 185 {
 186     debugs(77, 3, "DelayUserBucket::DelayUserBucket");
 187
 188     authUser->lock();
 189 }
 190
 191 DelayUserBucket::~DelayUserBucket()
 192 {
 193     authUser->unlock();
 194     debugs(77, 3, "DelayUserBucket::~DelayUserBucket");
 195 }
 196
 197 void
 198 DelayUserBucket::stats (StoreEntry *entry) const
 199 {
 200     storeAppendPrintf(entry, " %s:", authUser->username());
 201     theBucket.stats (entry);
 202 }
 203
 204 DelayUser::Id::Id(DelayUser::Pointer aDelayUser,AuthUser *aUser) : theUser(aDelayUser)
 205 {
 206     theBucket = new DelayUserBucket(aUser);
 207     DelayUserBucket::Pointer const *existing = theUser->buckets.find(theBucket, DelayUserCmp);
 208
 209     if (existing) {
 210         theBucket = *existing;
 211         return;
 212     }
 213
 214     theBucket->theBucket.init(theUser->spec);
 215     theUser->buckets.head = theUser->buckets.head->insert (theBucket, DelayUserCmp);
 216 }
 217
 218 DelayUser::Id::~Id()
 219 {
 220     debugs(77, 3, "DelayUser::Id::~Id");
 221 }
 222
 223 int
 224 DelayUser::Id::bytesWanted (int min, int max) const
 225 {
 226     return theBucket->theBucket.bytesWanted(min,max);
 227 }
 228
 229 void
 230 DelayUser::Id::bytesIn(int qty)
 231 {
 232     theBucket->theBucket.bytesIn(qty);
 233 }
 234
 235 #endif