1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
|
// Copyright (C) 2010 Internet Systems Consortium, Inc. ("ISC")
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
// AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
// LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
// OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
// PERFORMANCE OF THIS SOFTWARE.
#include <algorithm>
#include <cctype>
#include <string>
#include <sstream>
#include <iomanip>
#include <ios>
#include <ostream>
#include <vector>
#include <stdint.h>
#include <string.h>
#include <boost/lexical_cast.hpp>
#include <boost/shared_ptr.hpp>
#include <util/buffer.h>
#include <dns/name.h>
#include <dns/messagerenderer.h>
#include <dns/rdata.h>
#include <dns/rrparamregistry.h>
#include <dns/rrtype.h>
using namespace std;
using namespace boost;
using namespace isc::util;
namespace isc {
namespace dns {
namespace rdata {
// XXX: we need to specify std:: for string to help doxygen match the
// function signature with that given in the header file.
RdataPtr
createRdata(const RRType& rrtype, const RRClass& rrclass,
const std::string& rdata_string)
{
return (RRParamRegistry::getRegistry().createRdata(rrtype, rrclass,
rdata_string));
}
RdataPtr
createRdata(const RRType& rrtype, const RRClass& rrclass,
isc::util::InputBuffer& buffer, size_t len)
{
if (len > MAX_RDLENGTH) {
isc_throw(InvalidRdataLength, "RDLENGTH too large");
}
size_t old_pos = buffer.getPosition();
RdataPtr rdata =
RRParamRegistry::getRegistry().createRdata(rrtype, rrclass, buffer,
len);
if (buffer.getPosition() - old_pos != len) {
isc_throw(InvalidRdataLength, "RDLENGTH mismatch: " <<
buffer.getPosition() - old_pos << " != " << len);
}
return (rdata);
}
RdataPtr
createRdata(const RRType& rrtype, const RRClass& rrclass, const Rdata& source)
{
return (RRParamRegistry::getRegistry().createRdata(rrtype, rrclass,
source));
}
int
compareNames(const Name& n1, const Name& n2) {
size_t len1 = n1.getLength();
size_t len2 = n2.getLength();
size_t cmplen = min(len1, len2);
for (size_t i = 0; i < cmplen; ++i) {
uint8_t c1 = tolower(n1.at(i));
uint8_t c2 = tolower(n2.at(i));
if (c1 < c2) {
return (-1);
} else if (c1 > c2) {
return (1);
}
}
return ((len1 == len2) ? 0 : (len1 < len2) ? -1 : 1);
}
namespace generic {
struct GenericImpl {
GenericImpl(const vector<uint8_t>& data) : data_(data) {}
vector<uint8_t> data_;
};
Generic::Generic(isc::util::InputBuffer& buffer, size_t rdata_len) {
if (rdata_len > MAX_RDLENGTH) {
isc_throw(InvalidRdataLength, "RDLENGTH too large");
}
vector<uint8_t> data(rdata_len);
if (rdata_len > 0) {
buffer.readData(&data[0], rdata_len);
}
impl_ = new GenericImpl(data);
}
Generic::Generic(const std::string& rdata_string) {
istringstream iss(rdata_string);
string unknown_mark;
iss >> unknown_mark;
if (unknown_mark != "\\#") {
isc_throw(InvalidRdataText,
"Missing the special token (\\#) for generic RDATA encoding");
}
// RDLENGTH: read into a string so that we can easily reject invalid tokens
string rdlen_txt;
iss >> rdlen_txt;
istringstream iss_rdlen(rdlen_txt);
int32_t rdlen;
iss_rdlen >> rdlen;
if (iss_rdlen.rdstate() != ios::eofbit) {
isc_throw(InvalidRdataText,
"Invalid representation for a generic RDLENGTH");
}
if (rdlen < 0 || rdlen > 0xffff) {
isc_throw(InvalidRdataLength, "RDATA length is out of range");
}
iss >> ws; // skip any white spaces
// Hexadecimal encoding of RDATA: each segment must consist of an even
// number of hex digits.
vector<uint8_t> data;
while (!iss.eof() && data.size() < rdlen) {
// extract two characters, which should compose a single byte of data.
char buf[2];
iss.read(buf, sizeof(buf));
if ((iss.rdstate() & (ios::badbit | ios::failbit)) != 0) {
isc_throw(InvalidRdataText,
"Invalid hex encoding of generic RDATA");
}
// convert it to a single byte integer as a hex digit.
istringstream iss_byte(string(buf, sizeof(buf)));
unsigned int ch;
iss_byte >> hex >> ch;
if (iss_byte.rdstate() != ios::eofbit) {
isc_throw(InvalidRdataText,
"Invalid hex encoding of generic RDATA");
}
data.push_back(ch);
iss >> ws; // skip spaces
}
if (!iss.eof()) {
isc_throw(InvalidRdataLength,
"RDLENGTH is too small for generic RDATA");
}
if (data.size() != rdlen) {
isc_throw(InvalidRdataLength,
"Generic RDATA code doesn't match RDLENGTH");
}
impl_ = new GenericImpl(data);
}
Generic::~Generic() {
delete impl_;
}
Generic::Generic(const Generic& source) :
Rdata(), impl_(new GenericImpl(*source.impl_))
{}
Generic&
Generic::operator=(const Generic& source) {
if (impl_ == source.impl_) {
return (*this);
}
GenericImpl* newimpl = new GenericImpl(*source.impl_);
delete impl_;
impl_ = newimpl;
return (*this);
}
namespace {
class UnknownRdataDumper {
public:
UnknownRdataDumper(ostringstream& oss) : oss_(&oss) {}
void operator()(const unsigned char d)
{
*oss_ << setw(2) << static_cast<unsigned int>(d);
}
private:
ostringstream* oss_;
};
}
string
Generic::toText() const {
ostringstream oss;
oss << "\\# " << impl_->data_.size() << " ";
oss.fill('0');
oss << right << hex;
for_each(impl_->data_.begin(), impl_->data_.end(), UnknownRdataDumper(oss));
return (oss.str());
}
void
Generic::toWire(isc::util::OutputBuffer& buffer) const {
buffer.writeData(&impl_->data_[0], impl_->data_.size());
}
void
Generic::toWire(AbstractMessageRenderer& renderer) const {
renderer.writeData(&impl_->data_[0], impl_->data_.size());
}
namespace {
inline int
compare_internal(const GenericImpl& lhs, const GenericImpl& rhs) {
size_t this_len = lhs.data_.size();
size_t other_len = rhs.data_.size();
size_t len = (this_len < other_len) ? this_len : other_len;
int cmp;
// TODO: is there a need to check len - should we just assert?
// (Depends if it is possible for rdata to have zero length)
if ((len != 0) &&
((cmp = memcmp(&lhs.data_[0], &rhs.data_[0], len)) != 0)) {
return (cmp);
} else {
return ((this_len == other_len) ? 0 :
(this_len < other_len) ? -1 : 1);
}
}
}
int
Generic::compare(const Rdata& other) const {
const Generic& other_rdata = dynamic_cast<const Generic&>(other);
return (compare_internal(*impl_, *other_rdata.impl_));
}
std::ostream&
operator<<(std::ostream& os, const Generic& rdata) {
return (os << rdata.toText());
}
} // end of namespace generic
} // end of namespace rdata
}
}
|