]> git.ipfire.org Git - thirdparty/squid.git/blob - src/DelayUser.cc
Summary: Merge in external acl refactoring and tagged delay pools.
[thirdparty/squid.git] / src / DelayUser.cc
1
2 /*
3 * $Id: DelayUser.cc,v 1.5 2003/05/20 12:17:38 robertc Exp $
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 "authenticate.h"
44 #include "NullDelayId.h"
45 #include "Store.h"
46
47 void *
48 DelayUser::operator new(size_t size)
49 {
50 DelayPools::MemoryUsed += sizeof (DelayUser);
51 return ::operator new (size);
52 }
53
54 void
55 DelayUser::operator delete (void *address)
56 {
57 DelayPools::MemoryUsed -= sizeof (DelayUser);
58 ::operator delete (address);
59 }
60
61 void
62 DelayUser::deleteSelf() const
63 {
64 delete this;
65 }
66
67 DelayUser::DelayUser()
68 {
69 DelayPools::registerForUpdates (this);
70 }
71
72 static SplayNode<DelayUserBucket::Pointer>::SPLAYFREE DelayUserFree;
73
74 DelayUser::~DelayUser()
75 {
76 DelayPools::deregisterForUpdates (this);
77 buckets.head->destroy (DelayUserFree);
78 }
79
80 static SplayNode<DelayUserBucket::Pointer>::SPLAYCMP DelayUserCmp;
81
82 int
83 DelayUserCmp(DelayUserBucket::Pointer const &left, DelayUserBucket::Pointer const &right)
84 {
85 /* for rate limiting, case insensitive */
86 return strcasecmp(left->authUser->username(), right->authUser->username());
87 }
88
89 void
90 DelayUserFree(DelayUserBucket::Pointer &)
91 {}
92
93 void
94 DelayUserStatsWalkee(DelayUserBucket::Pointer const &current, void *state)
95 {
96 current->stats ((StoreEntry *)state);
97 }
98
99 void
100 DelayUser::stats(StoreEntry * sentry)
101 {
102 spec.stats (sentry, "Per User");
103
104 if (spec.restore_bps == -1)
105 return;
106
107 storeAppendPrintf(sentry, "\t\tCurrent: ");
108
109 if (!buckets.head) {
110 storeAppendPrintf (sentry, "Not used yet.\n\n");
111 return;
112 }
113
114 buckets.head->walk(DelayUserStatsWalkee, sentry);
115 storeAppendPrintf(sentry, "\n\n");
116 }
117
118 void
119 DelayUser::dump(StoreEntry *entry) const
120 {
121 spec.dump(entry);
122 }
123
124 struct DelayUserUpdater
125 {
126 DelayUserUpdater (DelaySpec &_spec, int _incr):spec(_spec),incr(_incr){};
127
128 DelaySpec spec;
129 int incr;
130 };
131
132 void
133 DelayUserUpdateWalkee(DelayUserBucket::Pointer const &current, void *state)
134 {
135 DelayUserUpdater *t = (DelayUserUpdater *)state;
136 /* This doesn't change the value of the DelayUserBucket, so is safe */
137 const_cast<DelayUserBucket *>(current.getRaw())->theBucket.update(t->spec, t->incr);
138 }
139
140 void
141 DelayUser::update(int incr)
142 {
143 DelayUserUpdater updater(spec, incr);
144 buckets.head->walk (DelayUserUpdateWalkee, &updater);
145 }
146
147 void
148 DelayUser::parse()
149 {
150 spec.parse();
151 }
152
153 DelayIdComposite::Pointer
154 DelayUser::id(CompositePoolNode::CompositeSelectionDetails &details)
155 {
156 if (!details.user)
157 return new NullDelayId;
158
159 return new Id(this, details.user->auth_user);
160 }
161
162 void *
163 DelayUser::Id::operator new(size_t size)
164 {
165 DelayPools::MemoryUsed += sizeof (Id);
166 return ::operator new (size);
167 }
168
169 void
170 DelayUser::Id::operator delete (void *address)
171 {
172 DelayPools::MemoryUsed -= sizeof (Id);
173 ::operator delete (address);
174 }
175
176 void
177 DelayUser::Id::deleteSelf() const
178 {
179 delete this;
180 }
181
182 void *
183 DelayUserBucket::operator new(size_t size)
184 {
185 DelayPools::MemoryUsed += sizeof (DelayUserBucket);
186 return ::operator new (size);
187 }
188
189 void
190 DelayUserBucket::operator delete (void *address)
191 {
192 DelayPools::MemoryUsed -= sizeof (DelayUserBucket);
193 ::operator delete (address);
194 }
195
196 DelayUserBucket::DelayUserBucket(AuthUser *aUser) : authUser (aUser)
197 {
198 debug (77,3) ("DelayUserBucket::DelayUserBucket\n");
199 authenticateAuthUserLock (authUser);
200 }
201
202 DelayUserBucket::~DelayUserBucket()
203 {
204 authenticateAuthUserUnlock(authUser);
205 debug (77,3) ("DelayUserBucket::~DelayUserBucket\n");
206 }
207
208 void
209 DelayUserBucket::stats (StoreEntry *entry) const
210 {
211 storeAppendPrintf(entry, " %s:", authUser->username());
212 theBucket.stats (entry);
213 }
214
215 DelayUser::Id::Id(DelayUser::Pointer aDelayUser,AuthUser *aUser) : theUser(aDelayUser)
216 {
217 theBucket = new DelayUserBucket(aUser);
218 DelayUserBucket::Pointer const *existing = theUser->buckets.find(theBucket, DelayUserCmp);
219
220 if (existing) {
221 theBucket = *existing;
222 return;
223 }
224
225 theBucket->theBucket.init(theUser->spec);
226 theUser->buckets.head = theUser->buckets.head->insert (theBucket, DelayUserCmp);
227 }
228
229 DelayUser::Id::~Id()
230 {
231 debug (77,3) ("DelayUser::Id::~Id\n");
232 }
233
234 int
235 DelayUser::Id::bytesWanted (int min, int max) const
236 {
237 return theBucket->theBucket.bytesWanted(min,max);
238 }
239
240 void
241 DelayUser::Id::bytesIn(int qty)
242 {
243 theBucket->theBucket.bytesIn(qty);
244 }
245
246 #endif