12196127483

Committed 06 Dec 2024 09:15AM UTC coverage: 64.691% (+0.3%) from 64.385%

Build # 12196127483

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #14926 from miodvallat/feature/12953

[feature] remove support for libdecaf

Run Details

37447 of 88766 branches covered (42.19%)

Branch coverage included in aggregate %.

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

51 existing lines in 11 files now uncovered.

125704 of 163434 relevant lines covered (76.91%)

4649259.46 hits per line

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

39.71

/pdns/shuffle.cc

/*
 * 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.
 */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <string>

#include "shuffle.hh"
#include "dns_random.hh"
#include "dnsparser.hh"

// shuffle, maintaining some semblance of order
void pdns::shuffle(std::vector<DNSZoneRecord>& rrs)
{
  std::vector<DNSZoneRecord>::iterator first;
  std::vector<DNSZoneRecord>::iterator second;

  // We assume the CNAMES are listed first in the ANSWER section and the the other records
  // and we want to shuffle the other records only

  // First we scan for the first non-CNAME ANSWER record
  for (first = rrs.begin(); first != rrs.end(); ++first) {
    if (first->dr.d_place == DNSResourceRecord::ANSWER && first->dr.d_type != QType::CNAME) {
      break;
    }
  }
  // And then for one past the last ANSWER record
  for (second = first; second != rrs.end(); ++second) {
    if (second->dr.d_place != DNSResourceRecord::ANSWER) {
      break;
    }
  }

  // Now shuffle the non-CNAME ANSWER records
  dns_random_engine randomEngine;
  if (second - first > 1) {
    shuffle(first, second, randomEngine);
  }

  // now shuffle the ADDITIONAL records in the same manner as the ANSWER records
  for (first = second; first != rrs.end(); ++first) {
    if (first->dr.d_place == DNSResourceRecord::ADDITIONAL && first->dr.d_type != QType::CNAME) {
      break;
    }
  }
  for (second = first; second != rrs.end(); ++second) {
    if (second->dr.d_place != DNSResourceRecord::ADDITIONAL) {
      break;
    }
  }

  if (second - first > 1) {
    shuffle(first, second, randomEngine);
  }
  // we don't shuffle the rest
}

// shuffle, maintaining some semblance of order
static void shuffle(std::vector<DNSRecord>& rrs, bool includingAdditionals)
{
  // This shuffles in the same style as the above method, keeping CNAME in the front and RRSIGs at the end
  std::vector<DNSRecord>::iterator first;
  std::vector<DNSRecord>::iterator second;

  for (first = rrs.begin(); first != rrs.end(); ++first) {
    if (first->d_place == DNSResourceRecord::ANSWER && first->d_type != QType::CNAME) {
      break;
    }
  }
  for (second = first; second != rrs.end(); ++second) {
    if (second->d_place != DNSResourceRecord::ANSWER || second->d_type == QType::RRSIG) {
      break;
    }
  }

  pdns::dns_random_engine randomEngine;
  if (second - first > 1) {
    shuffle(first, second, randomEngine);
  }

  if (!includingAdditionals) {
    return;
  }

  // now shuffle the additional records
  for (first = second; first != rrs.end(); ++first) {
    if (first->d_place == DNSResourceRecord::ADDITIONAL && first->d_type != QType::CNAME) {
      break;
    }
  }
  for (second = first; second != rrs.end(); ++second) {
    if (second->d_place != DNSResourceRecord::ADDITIONAL) {
      break;
    }
  }

  if (second - first > 1) {
    shuffle(first, second, randomEngine);
  }
  // we don't shuffle the rest
}

static uint16_t mapTypesToOrder(uint16_t type)
{
  if (type == QType::CNAME) {
    return 0;
  }
  if (type == QType::RRSIG) {
    return 65535;
  }
  return 1;
}

// make sure rrs is sorted in d_place order to avoid surprises later
// then shuffle the parts that desire shuffling
void pdns::orderAndShuffle(vector<DNSRecord>& rrs, bool includingAdditionals)
{
  std::stable_sort(rrs.begin(), rrs.end(), [](const DNSRecord& lhs, const DNSRecord& rhs) {
    return std::tuple(lhs.d_place, mapTypesToOrder(lhs.d_type)) < std::tuple(rhs.d_place, mapTypesToOrder(rhs.d_type));
  });
  shuffle(rrs, includingAdditionals);
}

1	/*
2	* This file is part of PowerDNS or dnsdist.
3	* Copyright -- PowerDNS.COM B.V. and its contributors
4	*
5	* This program is free software; you can redistribute it and/or modify
6	* it under the terms of version 2 of the GNU General Public License as
7	* published by the Free Software Foundation.
8	*
9	* In addition, for the avoidance of any doubt, permission is granted to
10	* link this program with OpenSSL and to (re)distribute the binaries
11	* produced as the result of such linking.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software
20	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
21	*/
22	#ifdef HAVE_CONFIG_H
23	#include "config.h"
24	#endif
25
26	#include <string>
27
28	#include "shuffle.hh"
29	#include "dns_random.hh"
30	#include "dnsparser.hh"
31
32	// shuffle, maintaining some semblance of order
33	void pdns::shuffle(std::vector<DNSZoneRecord>& rrs)
34	{	×
35	std::vector<DNSZoneRecord>::iterator first;	×
36	std::vector<DNSZoneRecord>::iterator second;	×
37
38	// We assume the CNAMES are listed first in the ANSWER section and the the other records
39	// and we want to shuffle the other records only
40
41	// First we scan for the first non-CNAME ANSWER record
42	for (first = rrs.begin(); first != rrs.end(); ++first) {	×
43	if (first->dr.d_place == DNSResourceRecord::ANSWER && first->dr.d_type != QType::CNAME) {	×
44	break;	×
45	}	×
46	}	×
47	// And then for one past the last ANSWER record
48	for (second = first; second != rrs.end(); ++second) {	×
49	if (second->dr.d_place != DNSResourceRecord::ANSWER) {	×
50	break;	×
51	}	×
52	}	×
53
54	// Now shuffle the non-CNAME ANSWER records
55	dns_random_engine randomEngine;	×
56	if (second - first > 1) {	×
57	shuffle(first, second, randomEngine);	×
58	}	×
59
60	// now shuffle the ADDITIONAL records in the same manner as the ANSWER records
61	for (first = second; first != rrs.end(); ++first) {	×
62	if (first->dr.d_place == DNSResourceRecord::ADDITIONAL && first->dr.d_type != QType::CNAME) {	×
63	break;	×
64	}	×
65	}	×
66	for (second = first; second != rrs.end(); ++second) {	×
67	if (second->dr.d_place != DNSResourceRecord::ADDITIONAL) {	×
68	break;	×
69	}	×
70	}	×
71
72	if (second - first > 1) {	×
73	shuffle(first, second, randomEngine);	×
74	}	×
75	// we don't shuffle the rest
76	}	×
77
78	// shuffle, maintaining some semblance of order
79	static void shuffle(std::vector<DNSRecord>& rrs, bool includingAdditionals)
80	{	2,245✔
81	// This shuffles in the same style as the above method, keeping CNAME in the front and RRSIGs at the end
82	std::vector<DNSRecord>::iterator first;	2,245✔
83	std::vector<DNSRecord>::iterator second;	2,245✔
84
85	for (first = rrs.begin(); first != rrs.end(); ++first) {	4,130✔
86	if (first->d_place == DNSResourceRecord::ANSWER && first->d_type != QType::CNAME) {	3,791✔
87	break;	1,906✔
88	}	1,906✔
89	}	3,791✔
90	for (second = first; second != rrs.end(); ++second) {	6,230✔
91	if (second->d_place != DNSResourceRecord::ANSWER \|\| second->d_type == QType::RRSIG) {	4,438✔
92	break;	453✔
93	}	453✔
94	}	4,438✔
95
96	pdns::dns_random_engine randomEngine;	2,245✔
97	if (second - first > 1) {	2,245✔
98	shuffle(first, second, randomEngine);	533✔
99	}	533✔
100
101	if (!includingAdditionals) {	2,245!
102	return;	2,245✔
103	}	2,245✔
104
105	// now shuffle the additional records
UNCOV 106	for (first = second; first != rrs.end(); ++first) {	×
107	if (first->d_place == DNSResourceRecord::ADDITIONAL && first->d_type != QType::CNAME) {	×
108	break;	×
109	}	×
110	}	×
UNCOV 111	for (second = first; second != rrs.end(); ++second) {	×
112	if (second->d_place != DNSResourceRecord::ADDITIONAL) {	×
113	break;	×
114	}	×
115	}	×
116
UNCOV 117	if (second - first > 1) {	×
118	shuffle(first, second, randomEngine);	×
119	}	×
120	// we don't shuffle the rest
UNCOV 121	}	×
122
123	static uint16_t mapTypesToOrder(uint16_t type)
124	{	18,638✔
125	if (type == QType::CNAME) {	18,638✔
126	return 0;	4,721✔
127	}	4,721✔
128	if (type == QType::RRSIG) {	13,917✔
129	return 65535;	1,783✔
130	}	1,783✔
131	return 1;	12,134✔
132	}	13,917✔
133
134	// make sure rrs is sorted in d_place order to avoid surprises later
135	// then shuffle the parts that desire shuffling
136	void pdns::orderAndShuffle(vector<DNSRecord>& rrs, bool includingAdditionals)
137	{	2,245✔
138	std::stable_sort(rrs.begin(), rrs.end(), [](const DNSRecord& lhs, const DNSRecord& rhs) {	9,323✔
139	return std::tuple(lhs.d_place, mapTypesToOrder(lhs.d_type)) < std::tuple(rhs.d_place, mapTypesToOrder(rhs.d_type));	9,319✔
140	});	9,319✔
141	shuffle(rrs, includingAdditionals);	2,245✔
142	}	2,245✔

PowerDNS / pdns / 12196127483

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