ret = aclHTTPStatusCompare(a, b);
if (ret == 0) {
- SBuf sa, sb;
- sa=a->repr();
- sb=b->repr();
+ const SBuf sa = a->repr();
+ const SBuf sb = b->repr();
debugs(28, DBG_CRITICAL, "WARNING: '" << sa << "' is a subrange of '" << sb << "'");
debugs(28, DBG_CRITICAL, "WARNING: because of this '" << sa << "' is ignored to keep splay tree searching predictable");
debugs(28, DBG_CRITICAL, "WARNING: You should probably remove '" << sb << "' from the ACL named '" << AclMatchedName << "'");
return new ACLIntRange (*this);
}
-ACLIntRange::~ACLIntRange ()
+ACLIntRange::~ACLIntRange()
{}
SBufList
-ACLIntRange::dump ()
+ACLIntRange::dump()
{
SBufList sl;
CbDataListIterator<RangeType> iter(ranges);
ACLIP::dump() const
{
SBufList sl;
- data->walk (DumpIpListWalkee, &sl);
+ data->walk(DumpIpListWalkee, &sl);
return sl;
}
bool
-ACLIP::empty () const
+ACLIP::empty() const
{
return data->empty();
}
return !splayLastResult;
}
-acl_ip_data::acl_ip_data () :addr1(), addr2(), mask(), next (NULL) {}
+acl_ip_data::acl_ip_data() :addr1(), addr2(), mask(), next (NULL) {}
-acl_ip_data::acl_ip_data (Ip::Address const &anAddress1, Ip::Address const &anAddress2, Ip::Address const &aMask, acl_ip_data *aNext) : addr1(anAddress1), addr2(anAddress2), mask(aMask), next(aNext) {}
+acl_ip_data::acl_ip_data(Ip::Address const &anAddress1, Ip::Address const &anAddress2, Ip::Address const &aMask, acl_ip_data *aNext) : addr1(anAddress1), addr2(anAddress2), mask(aMask), next(aNext) {}
#include "acl/StringData.h"
#include "cache_cf.h"
#include "Debug.h"
-#include "wordlist.h"
ACLStringData::ACLStringData() : values (NULL)
{}
{
SBufList sl;
/* damn this is VERY inefficient for long ACL lists... filling
- * a wordlist this way costs Sum(1,N) iterations. For instance
+ * a SBufList this way costs Sum(1,N) iterations. For instance
* a 1000-elements list will be filled in 499500 iterations.
*/
values->walk(aclDumpStringWalkee, &sl);
#include "acl/UserData.h"
#include "ConfigParser.h"
#include "Debug.h"
-#include "wordlist.h"
template<class T>
inline void
sl.push_back(SBuf("-i"));
/* damn this is VERY inefficient for long ACL lists... filling
- * a wordlist this way costs Sum(1,N) iterations. For instance
+ * a SBufList this way costs Sum(1,N) iterations. For instance
* a 1000-elements list will be filled in 499500 iterations.
*/
if (flags.required)