14253572168

Committed 02 Apr 2025 01:53PM UTC coverage: 60.402% (-3.1%) from 63.455%

Build # 14253572168

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #15385 from rgacogne/ddist-enable-quiche-sni-tests

dnsdist: Enable the DoQ and DoH3 parts of the SNI tests in our CI

Run Details

31683 of 72068 branches covered (43.96%)

Branch coverage included in aggregate %.

82493 of 116960 relevant lines covered (70.53%)

1751591.83 hits per line

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

0.0

/pdns/statnode.cc

#include "statnode.hh"

StatNode::Stat StatNode::print(unsigned int depth, Stat newstat, bool silent) const
{
  if(!silent) {
    cout<<string(depth, ' ');
    cout<<name<<": "<<endl;
  }
  Stat childstat;
  childstat.queries += s.queries;
  childstat.noerrors += s.noerrors;
  childstat.nxdomains += s.nxdomains;
  childstat.servfails += s.servfails;
  childstat.drops += s.drops;
  childstat.bytes += s.bytes;
  childstat.hits += s.hits;

  if(children.size()>1024 && !silent) {
    cout<<string(depth, ' ')<<name<<": too many to print"<<endl;
  }
  for(const children_t::value_type& child :  children) {
    childstat=child.second.print(depth+8, childstat, silent || children.size()>1024);
  }
  if(!silent || children.size()>1)
    cout<<string(depth, ' ')<<childstat.queries<<" queries, " << 
      childstat.noerrors<<" noerrors, "<< 
      childstat.nxdomains<<" nxdomains, "<< 
      childstat.servfails<<" servfails, "<< 
      childstat.drops<<" drops, "<<
      childstat.bytes<<" bytes, "<<
      childstat.hits<<" hits"<<endl;

  newstat+=childstat;

  return newstat;
}

void StatNode::visit(const visitor_t& visitor, Stat& newstat, unsigned int depth) const
{
  Stat childstat(s);

  for (const auto& child : children) {
    child.second.visit(visitor, childstat, depth+8);
  }

  visitor(this, s, childstat);

  newstat += childstat;
}

void StatNode::submit(const DNSName& domain, int rcode, unsigned int bytes, bool hit, const std::optional<ComboAddress>& remote)
{
  //  cerr<<"FIRST submit called on '"<<domain<<"'"<<endl;
  std::vector<string> tmp = domain.getRawLabels();
  if (tmp.empty()) {
    return;
  }

  auto last = tmp.end() - 1;
  children[*last].submit(last, tmp.begin(), "", rcode, bytes, remote, 1, hit);
}

/* www.powerdns.com. -> 
   .                 <- fullnames
   com.
   powerdns.com
   www.powerdns.com. 
*/

void StatNode::submit(std::vector<string>::const_iterator end, std::vector<string>::const_iterator begin, const std::string& domain, int rcode, unsigned int bytes, const std::optional<ComboAddress>& remote, unsigned int count, bool hit)
{
  //  cerr<<"Submit called for domain='"<<domain<<"': ";
  //  for(const std::string& n :  labels) 
  //    cerr<<n<<".";
  //  cerr<<endl;
  if (name.empty()) {

    name=*end;
    //    cerr<<"Set short name to '"<<name<<"'"<<endl;
  }
  else {
    //    cerr<<"Short name was already set to '"<<name<<"'"<<endl;
  }

  if (end == begin) {
    if (fullname.empty()) {
      size_t needed = name.size() + 1 + domain.size();
      if (fullname.capacity() < needed) {
        fullname.reserve(needed);
      }
      fullname = name;
      fullname.append(".");
      fullname.append(domain);
      labelsCount = count;
    }
    //    cerr<<"Hit the end, set our fullname to '"<<fullname<<"'"<<endl<<endl;
    s.queries++;
    s.bytes += bytes;
    if (rcode < 0) {
      s.drops++;
    }
    else if (rcode == RCode::NoError) {
      s.noerrors++;
    }
    else if (rcode == RCode::ServFail) {
      s.servfails++;
    }
    else if (rcode == RCode::NXDomain) {
      s.nxdomains++;
    }

    if (remote) {
      s.remotes[*remote]++;
    }

    if (hit) {
      ++s.hits;
    }
  }
  else {
    if (fullname.empty()) {
      size_t needed = name.size() + 1 + domain.size();
      if (fullname.capacity() < needed) {
        fullname.reserve(needed);
      }
      fullname = name;
      fullname.append(".");
      fullname.append(domain);
      labelsCount = count;
    }
    //    cerr<<"Not yet end, set our fullname to '"<<fullname<<"', recursing"<<endl;
    --end;
    children[*end].submit(end, begin, fullname, rcode, bytes, remote, count+1, hit);
  }
}

1	#include "statnode.hh"
2
3	StatNode::Stat StatNode::print(unsigned int depth, Stat newstat, bool silent) const
4	{	×
5	if(!silent) {	×
6	cout<<string(depth, ' ');	×
7	cout<<name<<": "<<endl;	×
8	}	×
9	Stat childstat;	×
10	childstat.queries += s.queries;	×
11	childstat.noerrors += s.noerrors;	×
12	childstat.nxdomains += s.nxdomains;	×
13	childstat.servfails += s.servfails;	×
14	childstat.drops += s.drops;	×
15	childstat.bytes += s.bytes;	×
16	childstat.hits += s.hits;	×
17
18	if(children.size()>1024 && !silent) {	×
19	cout<<string(depth, ' ')<<name<<": too many to print"<<endl;	×
20	}	×
21	for(const children_t::value_type& child : children) {	×
22	childstat=child.second.print(depth+8, childstat, silent \|\| children.size()>1024);	×
23	}	×
24	if(!silent \|\| children.size()>1)	×
25	cout<<string(depth, ' ')<<childstat.queries<<" queries, " <<	×
26	childstat.noerrors<<" noerrors, "<<	×
27	childstat.nxdomains<<" nxdomains, "<<	×
28	childstat.servfails<<" servfails, "<<	×
29	childstat.drops<<" drops, "<<	×
30	childstat.bytes<<" bytes, "<<	×
31	childstat.hits<<" hits"<<endl;	×
32
33	newstat+=childstat;	×
34
35	return newstat;	×
36	}	×
37
38	void StatNode::visit(const visitor_t& visitor, Stat& newstat, unsigned int depth) const
39	{	×
40	Stat childstat(s);	×
41
42	for (const auto& child : children) {	×
43	child.second.visit(visitor, childstat, depth+8);	×
44	}	×
45
46	visitor(this, s, childstat);	×
47
48	newstat += childstat;	×
49	}	×
50
51	void StatNode::submit(const DNSName& domain, int rcode, unsigned int bytes, bool hit, const std::optional<ComboAddress>& remote)
52	{	×
53	// cerr<<"FIRST submit called on '"<<domain<<"'"<<endl;
54	std::vector<string> tmp = domain.getRawLabels();	×
55	if (tmp.empty()) {	×
56	return;	×
57	}	×
58
59	auto last = tmp.end() - 1;	×
60	children[*last].submit(last, tmp.begin(), "", rcode, bytes, remote, 1, hit);	×
61	}	×
62
63	/* www.powerdns.com. ->
64	. <- fullnames
65	com.
66	powerdns.com
67	www.powerdns.com.
68	*/
69
70	void StatNode::submit(std::vector<string>::const_iterator end, std::vector<string>::const_iterator begin, const std::string& domain, int rcode, unsigned int bytes, const std::optional<ComboAddress>& remote, unsigned int count, bool hit)
71	{	×
72	// cerr<<"Submit called for domain='"<<domain<<"': ";
73	// for(const std::string& n : labels)
74	// cerr<<n<<".";
75	// cerr<<endl;
76	if (name.empty()) {	×
77
78	name=*end;	×
79	// cerr<<"Set short name to '"<<name<<"'"<<endl;
80	}	×
81	else {	×
82	// cerr<<"Short name was already set to '"<<name<<"'"<<endl;
83	}	×
84
85	if (end == begin) {	×
86	if (fullname.empty()) {	×
87	size_t needed = name.size() + 1 + domain.size();	×
88	if (fullname.capacity() < needed) {	×
89	fullname.reserve(needed);	×
90	}	×
91	fullname = name;	×
92	fullname.append(".");	×
93	fullname.append(domain);	×
94	labelsCount = count;	×
95	}	×
96	// cerr<<"Hit the end, set our fullname to '"<<fullname<<"'"<<endl<<endl;
97	s.queries++;	×
98	s.bytes += bytes;	×
99	if (rcode < 0) {	×
100	s.drops++;	×
101	}	×
102	else if (rcode == RCode::NoError) {	×
103	s.noerrors++;	×
104	}	×
105	else if (rcode == RCode::ServFail) {	×
106	s.servfails++;	×
107	}	×
108	else if (rcode == RCode::NXDomain) {	×
109	s.nxdomains++;	×
110	}	×
111
112	if (remote) {	×
113	s.remotes[*remote]++;	×
114	}	×
115
116	if (hit) {	×
117	++s.hits;	×
118	}	×
119	}	×
120	else {	×
121	if (fullname.empty()) {	×
122	size_t needed = name.size() + 1 + domain.size();	×
123	if (fullname.capacity() < needed) {	×
124	fullname.reserve(needed);	×
125	}	×
126	fullname = name;	×
127	fullname.append(".");	×
128	fullname.append(domain);	×
129	labelsCount = count;	×
130	}	×
131	// cerr<<"Not yet end, set our fullname to '"<<fullname<<"', recursing"<<endl;
132	--end;	×
133	children[*end].submit(end, begin, fullname, rcode, bytes, remote, count+1, hit);	×
134	}	×
135	}	×

PowerDNS / pdns / 14253572168

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