5 * DEBUG: section 77 Delay Pools
6 * AUTHOR: Robert Collins <robertc@squid-cache.org>
7 * Based upon original delay pools code by
8 * David Luyer <david@luyer.net>
10 * SQUID Web Proxy Cache http://www.squid-cache.org/
11 * ----------------------------------------------------------
13 * Squid is the result of efforts by numerous individuals from
14 * the Internet community; see the CONTRIBUTORS file for full
15 * details. Many organizations have provided support for Squid's
16 * development; see the SPONSORS file for full details. Squid is
17 * Copyrighted (C) 2001 by the Regents of the University of
18 * California; see the COPYRIGHT file for full details. Squid
19 * incorporates software developed and/or copyrighted by other
20 * sources; see the CREDITS file for full details.
22 * This program is free software; you can redistribute it and/or modify
23 * it under the terms of the GNU General Public License as published by
24 * the Free Software Foundation; either version 2 of the License, or
25 * (at your option) any later version.
27 * This program is distributed in the hope that it will be useful,
28 * but WITHOUT ANY WARRANTY; without even the implied warranty of
29 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
30 * GNU General Public License for more details.
32 * You should have received a copy of the GNU General Public License
33 * along with this program; if not, write to the Free Software
34 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
37 * Copyright (c) 2003, Robert Collins <robertc@squid-cache.org>
44 #include "DelayVector.h"
48 DelayVector::operator new(size_t size
)
50 DelayPools::MemoryUsed
+= sizeof (DelayVector
);
51 return ::operator new (size
);
55 DelayVector::operator delete (void *address
)
57 DelayPools::MemoryUsed
-= sizeof (DelayVector
);
58 ::operator delete (address
);
61 DelayVector::DelayVector()
63 DelayPools::registerForUpdates (this);
66 DelayVector::~DelayVector()
68 DelayPools::deregisterForUpdates (this);
72 DelayVector::stats(StoreEntry
* sentry
)
74 iterator pos
= pools
.begin();
76 while (pos
!= pools
.end()) {
77 (*pos
)->stats(sentry
);
83 DelayVector::dump(StoreEntry
*entry
) const
85 const_iterator pos
= pools
.begin();
87 while (pos
!= pools
.end()) {
94 DelayVector::update(int incr
)
97 * Each pool updates itself,
98 * but we may have deferred reads waiting on the pool as a whole.
107 iterator pos
= pools
.begin();
109 while (pos
!= pools
.end()) {
115 DelayIdComposite::Pointer
116 DelayVector::id(CompositeSelectionDetails
&details
)
118 return new Id(this, details
);
122 DelayVector::push_back(CompositePoolNode::Pointer aNode
)
124 pools
.push_back(aNode
);
128 DelayVector::Id::operator new(size_t size
)
130 DelayPools::MemoryUsed
+= sizeof (Id
);
131 return ::operator new (size
);
135 DelayVector::Id::operator delete (void *address
)
137 DelayPools::MemoryUsed
-= sizeof (Id
);
138 ::operator delete (address
);
141 DelayVector::Id::Id(DelayVector::Pointer aDelayVector
, CompositeSelectionDetails
&details
) : theVector(aDelayVector
)
143 debugs(77, 3, "DelayVector::Id::Id");
144 DelayVector::iterator pos
= theVector
->pools
.begin();
146 while (pos
!= theVector
->pools
.end()) {
147 ids
.push_back ((*pos
)->id (details
));
152 DelayVector::Id::~Id()
154 debugs(77, 3, "DelayVector::Id::~Id");
158 DelayVector::Id::bytesWanted (int minimum
, int maximum
) const
160 int nbytes
= maximum
;
161 const_iterator pos
= ids
.begin();
163 while (pos
!= ids
.end()) {
164 nbytes
= min (nbytes
, (*pos
)->bytesWanted(minimum
, nbytes
));
168 nbytes
= max(minimum
, nbytes
);
173 DelayVector::Id::bytesIn(int qty
)
175 iterator pos
= ids
.begin();
177 while (pos
!= ids
.end()) {
178 (*pos
)->bytesIn(qty
);
182 theVector
->kickReads();
186 DelayVector::Id::delayRead(DeferredRead
const &aRead
)
188 theVector
->delayRead(aRead
);