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
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
|
/*!
* \file rrset.h
*
* \author Lubos Slovak <lubos.slovak@nic.cz>
* \author Jan Kadlec <jan.kadlec@nic.cz>
*
* \brief RRSet structure and API for manipulating it.
*
* \addtogroup libknot
* @{
*/
/* Copyright (C) 2013 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
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, see <http://www.gnu.org/licenses/>.
*/
#ifndef _KNOT_RRSET_H_
#define _KNOT_RRSET_H_
#include <stdint.h>
#include <stdbool.h>
#include "libknot/dname.h"
/*----------------------------------------------------------------------------*/
/*!
* \brief Structure for representing an RRSet.
*
* For definition of a RRSet see RFC2181, Section 5.
*
* As all RRs within a RRSet share the same OWNER, TYPE, CLASS and TTL (see
* Section 5.2 of RFC2181), there is no need to duplicate these data in the
* program. Distinct Resource Records are thus represented only as distinct
* RDATA sections of corresponding RRs.
*/
struct knot_rrset {
/*! \brief Domain name being the owner of the RRSet. */
knot_dname_t *owner;
uint16_t type; /*!< TYPE of the RRset. */
uint16_t rclass; /*!< CLASS of the RRSet. */
uint32_t ttl; /*!< TTL of the RRSet. */
/*! \brief RDATA array (for all RRs). DNAMEs stored as full,
* uncompressed wire. Binary data stored in wireformat order.
*/
uint8_t *rdata; /*!< RDATA array (All RRs). DNAMEs stored as full wire. */
/*! \brief Beginnings of RRs - first one does not contain 0, last
* last one holds total length of all RRs together
*/
uint32_t *rdata_indices; /*!< Indices to beginnings of RRs (without 0)*/
uint16_t rdata_count; /*!< Count of RRs in this RRSet. */
struct knot_rrset *rrsigs; /*!< Set of RRSIGs covering this RRSet. */
};
typedef struct knot_rrset knot_rrset_t;
/*----------------------------------------------------------------------------*/
typedef enum {
KNOT_RRSET_COMPARE_PTR,
KNOT_RRSET_COMPARE_HEADER,
KNOT_RRSET_COMPARE_WHOLE
} knot_rrset_compare_type_t;
typedef enum {
KNOT_RRSET_DUPL_MERGE,
KNOT_RRSET_DUPL_REPLACE,
KNOT_RRSET_DUPL_SKIP
} knot_rrset_dupl_handling_t;
/*----------------------------------------------------------------------------*/
uint32_t rrset_rdata_size_total(const knot_rrset_t *rrset);
/*!
* \brief Creates a new RRSet with the given properties.
*
* The created RRSet contains no RDATAs (i.e. is actually empty).
*
* \param owner OWNER of the RRSet.
* \param type TYPE of the RRSet.
* \param rclass CLASS of the RRSet.
* \param ttl TTL of the RRset.
*
* \return New RRSet structure with the given OWNER, TYPE, CLASS and TTL or NULL
* if an error occured.
*/
knot_rrset_t *knot_rrset_new(knot_dname_t *owner, uint16_t type,
uint16_t rclass, uint32_t ttl);
/*!
* \brief Creates a new RRSet according to given template RRSet.
*
* OWNER, TYPE, CLASS, and TTL values from template RRSet are used.
*
* \param tmp RRSet template.
*
* \return New RRSet, NULL if an error occured.
*/
knot_rrset_t *knot_rrset_new_from(const knot_rrset_t *tpl);
/*!
* \brief Adds the given RDATA to the RRSet.
*
* \param rrset RRSet to add the RDATA to.
* \param rdata RDATA to add to the RRSet.
* \param size Size of RDATA.
*
* \retval KNOT_EINVAL on wrong arguments.
* \retval KNOT_EOK on success.
*/
int knot_rrset_add_rdata(knot_rrset_t *rrset, const uint8_t *rdata,
uint16_t size);
/*!
* \brief Creates RDATA memory and returns a pointer to it.
* If the RRSet is not empty, function will return a memory
* pointing to a beginning of a new RR. (Indices will be handled as well)
*
* \param rrset RRSet to add the RDATA to.
* \param size Size of RR RDATA (Size in internal representation)
*
* \return Pointer to memory to be written to.
* \retval NULL if arguments are invalid
*/
uint8_t* knot_rrset_create_rdata(knot_rrset_t *rrset, const uint16_t size);
/*!
* \brief Returns size of an RR RDATA on a given position.
*
* \param rrset RRSet holding RR RDATA.
* \param pos RR position.
*
* \retval 0 on error.
* \return Item size on success.
*/
/* [code-review] Misleading name, maybe remove the word 'item'. And add knot. */
uint16_t rrset_rdata_item_size(const knot_rrset_t *rrset,
size_t pos);
/*!
* \brief Adds RRSIG signatures to this RRSet.
*
* \param rrset RRSet to add the signatures into.
* \param rrsigs Set of RRSIGs covering this RRSet.
*
* \retval KNOT_EOK
* \retval KNOT_EINVAL
*/
int knot_rrset_set_rrsigs(knot_rrset_t *rrset, knot_rrset_t *rrsigs);
/*!
* \brief Adds RRSIG signatures to this RRSet.
*
* \param rrset RRSet to add the signatures into.
* \param rrsigs Set of RRSIGs covering this RRSet.
* \param dupl Merging strategy.
*
* \retval KNOT_EOK if no merge was needed.
* \retval 1 if merge was needed.
* \retval 2 if rrsig was not first, but is was skipped.
* \retval KNOT_EINVAL on faulty arguments or rrsig does not belong to this rrset.
*/
//TODO test
int knot_rrset_add_rrsigs(knot_rrset_t *rrset, knot_rrset_t *rrsigs,
knot_rrset_dupl_handling_t dupl);
/*!
* \brief Returns the Owner of the RRSet.
*
* \param rrset RRSet to get the Owner of.
*
* \return Owner of the given RRSet.
*/
const knot_dname_t *knot_rrset_owner(const knot_rrset_t *rrset);
/*!
* \brief Returns the Owner of the RRSet.
*
* \param rrset RRSet to get the Owner of.
*
* \return Owner of the given RRSet.
*/
knot_dname_t *knot_rrset_get_owner(const knot_rrset_t *rrset);
/*!
* \brief Set rrset owner to specified dname.
*
* Previous owner will be replaced if exist.
*
* \param rrset Specified RRSet.
* \param owner New owner dname.
*/
int knot_rrset_set_owner(knot_rrset_t *rrset, const knot_dname_t *owner);
/*!
* \brief Sets rrset TTL to given TTL.
*
* \param rrset Specified RRSet.
* \param ttl New TTL.
*/
void knot_rrset_set_ttl(knot_rrset_t *rrset, uint32_t ttl);
void knot_rrset_set_class(knot_rrset_t *rrset, uint16_t rclass);
/*!
* \brief Returns the TYPE of the RRSet.
*
* \param rrset RRSet to get the TYPE of.
*
* \return TYPE of the given RRSet.
*/
uint16_t knot_rrset_type(const knot_rrset_t *rrset);
/*!
* \brief Returns the CLASS of the RRSet.
*
* \param rrset RRSet to get the CLASS of.
*
* \return CLASS of the given RRSet.
*/
uint16_t knot_rrset_class(const knot_rrset_t *rrset);
/*!
* \brief Returns the TTL of the RRSet.
*
* \param rrset RRSet to get the TTL of.
*
* \return TTL of the given RRSet.
*/
uint32_t knot_rrset_ttl(const knot_rrset_t *rrset);
/*!
* \brief Returns RDATA of RR on given position.
*
* \param rrset RRSet to get the RDATA from.
* \param rdata_pos Position of RR to get.
*
* \retval NULL if no RDATA on rdata_pos exist.
* \return Pointer to RDATA on given position if successfull.
*/
uint8_t *knot_rrset_get_rdata(const knot_rrset_t *rrset, size_t rdata_pos);
/*!
* \brief Returns the count of RRs in a given RRSet.
*
* \param rrset RRSet to get the RRs count from.
*
* \return Count of the RRs in a given RRSet.
*/
uint16_t knot_rrset_rdata_rr_count(const knot_rrset_t *rrset);
/*!
* \brief Returns the set of RRSIGs covering the given RRSet.
*
* \param rrset RRSet to get the signatures for.
*
* \return Set of RRSIGs which cover the given RRSet or NULL if there is none or
* if no rrset was provided (\a rrset is NULL).
*/
const knot_rrset_t *knot_rrset_rrsigs(const knot_rrset_t *rrset);
knot_rrset_t *knot_rrset_get_rrsigs(knot_rrset_t *rrset);
int knot_rrset_rdata_equal(const knot_rrset_t *r1, const knot_rrset_t *r2);
/*!
* \brief Compares two RRSets for equality.
*
* \param r1 First RRSet.
* \param r2 Second RRSet.
* \param cmp Type of comparison to perform.
*
* \retval 1 if RRSets are equal.
* \retval 0 if RRSets are not equal.
* \retval < 0 if error occured.
*/
int knot_rrset_equal(const knot_rrset_t *r1,
const knot_rrset_t *r2,
knot_rrset_compare_type_t cmp);
int knot_rrset_deep_copy(const knot_rrset_t *from, knot_rrset_t **to);
int knot_rrset_deep_copy_no_sig(const knot_rrset_t *from, knot_rrset_t **to);
int knot_rrset_shallow_copy(const knot_rrset_t *from, knot_rrset_t **to);
/*! \brief Does round-robin rotation of the RRSet.
*
* \note This is not thread-safe. If two threads call this function, the RRSet
* may rotate twice, or not rotate at all. This is not a big issue though.
* In future we may replace this with some per-thread counter.
*/
void knot_rrset_rotate(knot_rrset_t *rrset);
/*!
* \brief Destroys the RRSet structure.
*
* Does not destroy the OWNER domain name structure, nor the signatures, as
* these may be used elsewhere.
*
* Does not destroy RDATA structures neither, as they need special processing.
*
* Also sets the given pointer to NULL.
*
* \param rrset RRset to be destroyed.
*/
void knot_rrset_free(knot_rrset_t **rrset);
/*!
* \brief Destroys the RRSet structure and all its substructures.
*
* Also sets the given pointer to NULL.
*
* \param rrset RRset to be destroyed.
* \param free_owner Set to 0 if you do not want the owner domain name to be
* destroyed also. Set to <> 0 otherwise.
* \param free_rdata_dnames Set to <> 0 if you want to delete ALL domain names
* present in RDATA. Set to 0 otherwise. (See
* knot_rdata_deep_free().)
*/
void knot_rrset_deep_free(knot_rrset_t **rrset, int free_owner);
void knot_rrset_deep_free_no_sig(knot_rrset_t **rrset, int free_owner);
int knot_rrset_to_wire(const knot_rrset_t *rrset, uint8_t *wire, size_t *size,
size_t max_size, uint16_t *rr_count, void *comp_data);
/*!
* \brief Write one RR from RRSet.
*/
int knot_rrset_to_wire_one(const knot_rrset_t *rrset, uint16_t rr_number,
uint8_t *wire, size_t max_size, size_t *outsize,
void *comp_data);
/*!
* \brief Merges two RRSets.
*
* Merges \a r1 into \a r2 by concatenating the list of RDATAs in \a r2 after
* the list of RDATAs in \a r1. You must not
* destroy the RDATAs in \a r2 as they are now identical to RDATAs in \a r1.
* (You may use function knot_rrset_free() though, as it does not touch RDATAs).
*
* \note Member \a rrsigs is preserved from the first RRSet.
*
* \param r1 Pointer to RRSet to be merged into.
* \param r2 Poitner to RRSet to be merged.
*
* \retval KNOT_EOK
* \retval KNOT_EINVAL if the RRSets could not be merged, because their
* Owner, Type, Class or TTL does not match.
*/
int knot_rrset_merge(knot_rrset_t *rrset1, const knot_rrset_t *rrset2);
/*! \brief Merges without with duplicate check, with sort. */
int knot_rrset_merge_sort(knot_rrset_t *rrset1, const knot_rrset_t *rrset2,
int *merged, int *deleted_rrs);
/*!
* \brief Sort RDATA in RRSet to be in caonical order.
* \todo Not optimal, rewrite!
*
* \param rrset RRSet to be sorted.
* \return Error code, KNOT_EOK when successful.
*/
int knot_rrset_sort_rdata(knot_rrset_t *rrset);
/*!
* \brief Return true if the RRSet is an NSEC3 related type.
*
* \param rr RRSet.
*/
bool knot_rrset_is_nsec3rel(const knot_rrset_t *rr);
void knot_rrset_dump(const knot_rrset_t *rrset);
//TODO test
int rrset_serialize(const knot_rrset_t *rrset, uint8_t *stream, size_t *size);
uint64_t rrset_binary_size(const knot_rrset_t *rrset);
//TODO test
int rrset_serialize_alloc(const knot_rrset_t *rrset, uint8_t **stream,
size_t *size);
//TODO test
int rrset_deserialize(uint8_t *stream, size_t *stream_size,
knot_rrset_t **rrset);
/* \brief Adds RR on 'pos' position from 'source' to 'dest' */
int knot_rrset_add_rr_from_rrset(knot_rrset_t *dest, const knot_rrset_t *source,
size_t rdata_pos);
/* \brief Removes RRs contained in 'what' RRSet from 'from' RRSet.
* Deleted RRs are returned in 'rr_deleted' */
int knot_rrset_remove_rr_using_rrset(knot_rrset_t *from,
const knot_rrset_t *what,
knot_rrset_t **rr_deleted);
/* \brief Removes RRs contained in 'what' RRSet from 'from' RRSet. */
int knot_rrset_remove_rr_using_rrset_del(knot_rrset_t *from,
const knot_rrset_t *what);
/* \brief Finds RR at 'pos' position in 'rr_reference' RRSet in
'rr_search_in' RRSet. Position returned in 'pos_out'. */
int knot_rrset_find_rr_pos(const knot_rrset_t *rr_search_in,
const knot_rrset_t *rr_reference, size_t pos,
size_t *pos_out);
/* \brief Creates one RR from wire, stores it into 'rrset'. */
int knot_rrset_rdata_from_wire_one(knot_rrset_t *rrset,
const uint8_t *wire, size_t *pos,
size_t total_size, size_t rdlength);
int knot_rrset_ds_check(const knot_rrset_t *rrset);
uint8_t *rrset_rdata_pointer(const knot_rrset_t *rrset, size_t pos);
int rrset_rdata_compare_one(const knot_rrset_t *rrset1,
const knot_rrset_t *rrset2,
size_t pos1, size_t pos2);
#endif /* _KNOT_RRSET_H_ */
/*! @} */
|