-#include "dnsdist.hh"
-#include "lock.hh"
+/*
+ * This file is part of PowerDNS or dnsdist.
+ * Copyright -- PowerDNS.COM B.V. and its contributors
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of version 2 of the GNU General Public License as
+ * published by the Free Software Foundation.
+ *
+ * In addition, for the avoidance of any doubt, permission is granted to
+ * link this program with OpenSSL and to (re)distribute the binaries
+ * produced as the result of such linking.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+ */
+
+#include "dnsdist-rings.hh"
size_t Rings::numDistinctRequestors()
{
std::set<ComboAddress, ComboAddress::addressOnlyLessThan> s;
- ReadLock rl(&queryLock);
- for(const auto& q : queryRing)
- s.insert(q.requestor);
+ for (const auto& shard : d_shards) {
+ std::lock_guard<std::mutex> rl(shard->queryLock);
+ for(const auto& q : shard->queryRing) {
+ s.insert(q.requestor);
+ }
+ }
return s.size();
}
{
map<ComboAddress, unsigned int, ComboAddress::addressOnlyLessThan> counts;
uint64_t total=0;
- {
- ReadLock rl(&queryLock);
- for(const auto& q : queryRing) {
- counts[q.requestor]+=q.size;
- total+=q.size;
+ for (const auto& shard : d_shards) {
+ {
+ std::lock_guard<std::mutex> rl(shard->queryLock);
+ for(const auto& q : shard->queryRing) {
+ counts[q.requestor]+=q.size;
+ total+=q.size;
+ }
}
- }
-
- {
- std::lock_guard<std::mutex> lock(respMutex);
- for(const auto& r : respRing) {
- counts[r.requestor]+=r.size;
- total+=r.size;
+ {
+ std::lock_guard<std::mutex> rl(shard->respLock);
+ for(const auto& r : shard->respRing) {
+ counts[r.requestor]+=r.size;
+ total+=r.size;
+ }
}
}