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
|
// Copyright (C) 2011 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.
#ifndef DS_LIKE_H
#define DS_LIKE_H 1
#include <stdint.h>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <boost/lexical_cast.hpp>
#include <exceptions/exceptions.h>
#include <dns/messagerenderer.h>
#include <dns/name.h>
#include <dns/rdata.h>
#include <dns/rdataclass.h>
namespace isc {
namespace dns {
namespace rdata {
namespace generic {
namespace detail {
/// \brief \c rdata::DSLikeImpl class represents the DS-like RDATA for DS
/// and DLV types.
///
/// This class implements the basic interfaces inherited by the DS and DLV
/// classes from the abstract \c rdata::Rdata class, and provides trivial
/// accessors to DS-like RDATA.
template <class Type, uint16_t typeCode> class DSLikeImpl {
// Common sequence of toWire() operations used for the two versions of
// toWire().
template <typename Output>
void
toWireCommon(Output& output) const {
output.writeUint16(tag_);
output.writeUint8(algorithm_);
output.writeUint8(digest_type_);
output.writeData(&digest_[0], digest_.size());
}
public:
/// \brief Constructor from string.
///
/// <b>Exceptions</b>
///
/// \c InvalidRdataText is thrown if the method cannot process the
/// parameter data for any of the number of reasons.
DSLikeImpl(const std::string& ds_str) {
std::istringstream iss(ds_str);
// peekc should be of iss's char_type for isspace to work
std::istringstream::char_type peekc;
std::stringbuf digestbuf;
uint32_t tag, algorithm, digest_type;
iss >> tag >> algorithm >> digest_type;
if (iss.bad() || iss.fail()) {
isc_throw(InvalidRdataText,
"Invalid " << RRType(typeCode) << " text");
}
if (tag > 0xffff) {
isc_throw(InvalidRdataText,
RRType(typeCode) << " tag out of range");
}
if (algorithm > 0xff) {
isc_throw(InvalidRdataText,
RRType(typeCode) << " algorithm out of range");
}
if (digest_type > 0xff) {
isc_throw(InvalidRdataText,
RRType(typeCode) << " digest type out of range");
}
iss.read(&peekc, 1);
if (!iss.good() || !isspace(peekc, iss.getloc())) {
isc_throw(InvalidRdataText,
RRType(typeCode) << " presentation format error");
}
iss >> &digestbuf;
tag_ = tag;
algorithm_ = algorithm;
digest_type_ = digest_type;
decodeHex(digestbuf.str(), digest_);
}
/// \brief Constructor from wire-format data.
///
/// \param buffer A buffer storing the wire format data.
/// \param rdata_len The length of the RDATA in bytes, normally expected
/// to be the value of the RDLENGTH field of the corresponding RR.
///
/// <b>Exceptions</b>
///
/// \c InvalidRdataLength is thrown if the input data is too short for the
/// type.
DSLikeImpl(InputBuffer& buffer, size_t rdata_len) {
if (rdata_len < 4) {
isc_throw(InvalidRdataLength, RRType(typeCode) << " too short");
}
tag_ = buffer.readUint16();
algorithm_ = buffer.readUint8();
digest_type_ = buffer.readUint8();
rdata_len -= 4;
digest_.resize(rdata_len);
buffer.readData(&digest_[0], rdata_len);
}
/// \brief The copy constructor.
///
/// Trivial for now, we could've used the default one.
DSLikeImpl(const DSLikeImpl& source) {
digest_ = source.digest_;
tag_ = source.tag_;
algorithm_ = source.algorithm_;
digest_type_ = source.digest_type_;
}
/// \brief Convert the DS-like data to a string.
///
/// \return A \c string object that represents the DS-like data.
std::string
toText() const {
using namespace boost;
return (lexical_cast<string>(static_cast<int>(tag_)) +
" " + lexical_cast<string>(static_cast<int>(algorithm_)) +
" " + lexical_cast<string>(static_cast<int>(digest_type_)) +
" " + encodeHex(digest_));
}
/// \brief Render the DS-like data in the wire format to an OutputBuffer
/// object.
///
/// \param buffer An output buffer to store the wire data.
void
toWire(OutputBuffer& buffer) const {
toWireCommon(buffer);
}
/// \brief Render the DS-like data in the wire format to an
/// AbstractMessageRenderer object.
///
/// \param renderer A renderer object to send the wire data to.
void
toWire(AbstractMessageRenderer& renderer) const {
toWireCommon(renderer);
}
/// \brief Compare two instances of DS-like RDATA.
///
/// It is up to the caller to make sure that \c other is an object of the
/// same \c DSLikeImpl class.
///
/// \param other the right-hand operand to compare against.
/// \return < 0 if \c this would be sorted before \c other.
/// \return 0 if \c this is identical to \c other in terms of sorting
/// order.
/// \return > 0 if \c this would be sorted after \c other.
int
compare(const DSLikeImpl& other_ds) const {
if (tag_ != other_ds.tag_) {
return (tag_ < other_ds.tag_ ? -1 : 1);
}
if (algorithm_ != other_ds.algorithm_) {
return (algorithm_ < other_ds.algorithm_ ? -1 : 1);
}
if (digest_type_ != other_ds.digest_type_) {
return (digest_type_ < other_ds.digest_type_ ? -1 : 1);
}
size_t this_len = digest_.size();
size_t other_len = other_ds.digest_.size();
size_t cmplen = min(this_len, other_len);
int cmp = memcmp(&digest_[0], &other_ds.digest_[0], cmplen);
if (cmp != 0) {
return (cmp);
} else {
return ((this_len == other_len)
? 0 : (this_len < other_len) ? -1 : 1);
}
}
/// \brief Accessors
uint16_t
getTag() const {
return (tag_);
}
private:
// straightforward representation of DS RDATA fields
uint16_t tag_;
uint8_t algorithm_;
uint8_t digest_type_;
std::vector<uint8_t> digest_;
};
}
}
}
}
}
#endif // DS_LIKE_H
// Local Variables:
// mode: c++
// End:
|
