9990344439

Committed 18 Jul 2024 11:03AM UTC coverage: 64.669% (-0.01%) from 64.683%

Build # 9990344439

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #14499 from omoerbeek/rec-process-additionals

rec: limit the number of async tasks pushed to resolve NS names

Run Details

37047 of 87910 branches covered (42.14%)

Branch coverage included in aggregate %.

11 of 11 new or added lines in 1 file covered. (100.0%)

5447 existing lines in 74 files now uncovered.

124537 of 161953 relevant lines covered (76.9%)

6134177.01 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

72.94

/pdns/recursordist/sortlist.cc

#include "sortlist.hh"
#include "dnsrecords.hh"

void SortList::clear()
{
  d_sortlist.clear();
}

int SortList::getMaxOrder(const Netmask& formask) const
{
  int order = 0;

  const auto* place = d_sortlist.lookup(formask);
  if (place != nullptr && place->first == formask) {
    for (const auto& node_order : place->second.d_orders) {
      order = std::max(order, node_order.second);
    }
  }

  return order;
}

void SortList::addEntry(const Netmask& covers, const Netmask& answermask, int order)
{
  if (order < 0) {
    order = getMaxOrder(covers);
    ++order;
  }
  //  cout<<"Adding for netmask "<<formask.toString()<<" the order instruction that "<<valmask.toString()<<" is order "<<order<<endl;
  d_sortlist.insert(covers).second.d_orders.insert(answermask).second = order;
}

std::unique_ptr<SortListOrderCmp> SortList::getOrderCmp(const ComboAddress& who) const
{
  if (!d_sortlist.match(who)) {
    return {};
  }
  const auto* fnd = d_sortlist.lookup(who);
  //  cerr<<"Returning sort order for "<<who.toString()<<", have "<<fnd->second.d_orders.size()<<" entries"<<endl;
  return make_unique<SortListOrderCmp>(fnd->second);
}

// call this with **stable_sort**
bool SortListOrderCmp::operator()(const DNSRecord& lhs, const DNSRecord& rhs) const
{
  bool aAddr = (lhs.d_type == QType::A || lhs.d_type == QType::AAAA);
  bool bAddr = (rhs.d_type == QType::A || rhs.d_type == QType::AAAA);

  // anything address related is always 'larger', rest is equal
  if (aAddr && !bAddr) {
    return false;
  }
  if (!aAddr && bAddr) {
    return true;
  }
  if (!aAddr && !bAddr) {
    return false;
  }

  int aOrder = std::numeric_limits<int>::max();
  int bOrder = aOrder;

  ComboAddress laddr = getAddr(lhs);
  ComboAddress raddr = getAddr(rhs);

  if (d_slo.d_orders.match(laddr)) {
    aOrder = d_slo.d_orders.lookup(laddr)->second;
  }
  if (d_slo.d_orders.match(raddr)) {
    bOrder = d_slo.d_orders.lookup(raddr)->second;
  }
  return aOrder < bOrder;
}

1	#include "sortlist.hh"
2	#include "dnsrecords.hh"
3
4	void SortList::clear()
5	{	×
6	d_sortlist.clear();	×
7	}	×
8
9	int SortList::getMaxOrder(const Netmask& formask) const
UNCOV 10	{	1✔
UNCOV 11	int order = 0;	1✔
12
UNCOV 13	const auto* place = d_sortlist.lookup(formask);	1✔
UNCOV 14	if (place != nullptr && place->first == formask) {	1!
15	for (const auto& node_order : place->second.d_orders) {	×
16	order = std::max(order, node_order.second);	×
17	}	×
18	}	×
19
UNCOV 20	return order;	1✔
UNCOV 21	}	1✔
22
23	void SortList::addEntry(const Netmask& covers, const Netmask& answermask, int order)
24	{	8✔
25	if (order < 0) {	8!
26	order = getMaxOrder(covers);	×
27	++order;	×
28	}	×
29	// cout<<"Adding for netmask "<<formask.toString()<<" the order instruction that "<<valmask.toString()<<" is order "<<order<<endl;
30	d_sortlist.insert(covers).second.d_orders.insert(answermask).second = order;	8✔
31	}	8✔
32
33	std::unique_ptr<SortListOrderCmp> SortList::getOrderCmp(const ComboAddress& who) const
34	{	2,426✔
35	if (!d_sortlist.match(who)) {	2,427✔
36	return {};	2,426✔
37	}	2,426✔
38	const auto* fnd = d_sortlist.lookup(who);	2,147,483,648✔
39	// cerr<<"Returning sort order for "<<who.toString()<<", have "<<fnd->second.d_orders.size()<<" entries"<<endl;
40	return make_unique<SortListOrderCmp>(fnd->second);	2,147,483,648✔
41	}	2,426✔
42
43	// call this with stable_sort
44	bool SortListOrderCmp::operator()(const DNSRecord& lhs, const DNSRecord& rhs) const
UNCOV 45	{	9✔
UNCOV 46	bool aAddr = (lhs.d_type == QType::A \|\| lhs.d_type == QType::AAAA);	9!
UNCOV 47	bool bAddr = (rhs.d_type == QType::A \|\| rhs.d_type == QType::AAAA);	9!
48
49	// anything address related is always 'larger', rest is equal
UNCOV 50	if (aAddr && !bAddr) {	9✔
UNCOV 51	return false;	3✔
UNCOV 52	}	3✔
UNCOV 53	if (!aAddr && bAddr) {	6!
UNCOV 54	return true;	×
UNCOV 55	}	×
UNCOV 56	if (!aAddr && !bAddr) {	6!
UNCOV 57	return false;	2✔
UNCOV 58	}	2✔
59
UNCOV 60	int aOrder = std::numeric_limits<int>::max();	4✔
UNCOV 61	int bOrder = aOrder;	4✔
62
UNCOV 63	ComboAddress laddr = getAddr(lhs);	4✔
UNCOV 64	ComboAddress raddr = getAddr(rhs);	4✔
65
UNCOV 66	if (d_slo.d_orders.match(laddr)) {	4✔
UNCOV 67	aOrder = d_slo.d_orders.lookup(laddr)->second;	1✔
UNCOV 68	}	1✔
UNCOV 69	if (d_slo.d_orders.match(raddr)) {	4!
UNCOV 70	bOrder = d_slo.d_orders.lookup(raddr)->second;	4✔
UNCOV 71	}	4✔
UNCOV 72	return aOrder < bOrder;	4✔
UNCOV 73	}	6✔

PowerDNS / pdns / 9990344439

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous