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
|
/* Copyright (C) 2017 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 <https://www.gnu.org/licenses/>.
*/
/** @file
* Implementation of RRset (de)materialization, i.e. (de)serialization to storage
* format used in cache (some repeated fields are omitted). Prototypes in ./impl.h
*/
#include "lib/cache/impl.h"
int rdataset_dematerialize(const knot_rdataset_t *rds, uint8_t * restrict data)
{
/* FIXME: either give up on even alignment and thus direct usability
* of rdatasets as they are in lmdb, or align inside cdb_* functions
* (request sizes one byte longer and shift iff on an odd address). */
//if ((size_t)data & 1) VERBOSE_MSG(NULL, "dematerialize: odd address\n");
//const uint8_t *data0 = data;
if (!data) {
assert(data);
return kr_error(EINVAL);
}
const uint16_t rr_count = rds ? rds->count : 0;
memcpy(data, &rr_count, sizeof(rr_count));
data += sizeof(rr_count);
if (rr_count) {
size_t size = knot_rdataset_size(rds);
memcpy(data, rds->rdata, size);
data += size;
}
//VERBOSE_MSG(NULL, "dematerialized to %d B\n", (int)(data - data0));
(void)data;
return kr_ok();
}
/** Materialize a knot_rdataset_t from cache with given TTL.
* Return the number of bytes consumed or an error code.
*/
static int rdataset_materialize(knot_rdataset_t * restrict rds, const uint8_t * const data,
const uint8_t *data_bound, knot_mm_t *pool)
{
assert(rds && data && data_bound && data_bound > data && !rds->rdata
/*&& !((size_t)data & 1)*/);
assert(pool); /* not required, but that's our current usage; guard leaks */
const uint8_t *d = data; /* iterates over the cache data */
{
uint16_t rr_count;
memcpy(&rr_count, d, sizeof(rr_count));
d += sizeof(rr_count);
rds->count = rr_count;
if (!rr_count) { /* avoid mm_alloc(pool, 0); etc. */
return d - data;
}
}
/* First sum up the sizes for wire format length. */
const knot_rdataset_t rds_tmp = {
.count = rds->count,
.rdata = (knot_rdata_t *)d,
};
size_t rds_size = knot_rdataset_size(&rds_tmp); /* TODO: we might overrun here already,
but we need to trust cache anyway...*/
if (d + rds_size > data_bound) {
VERBOSE_MSG(NULL, "materialize: EILSEQ!\n");
return kr_error(EILSEQ);
}
rds->rdata = mm_alloc(pool, rds_size);
if (!rds->rdata) {
return kr_error(ENOMEM);
}
memcpy(rds->rdata, d, rds_size);
d += rds_size;
//VERBOSE_MSG(NULL, "materialized from %d B\n", (int)(d - data));
return d - data;
}
int kr_cache_materialize(knot_rdataset_t *dst, const struct kr_cache_p *ref,
knot_mm_t *pool)
{
struct entry_h *eh = ref->raw_data;
return rdataset_materialize(dst, eh->data, ref->raw_bound, pool);
}
int entry2answer(struct answer *ans, int id,
const struct entry_h *eh, const uint8_t *eh_bound,
const knot_dname_t *owner, uint16_t type, uint32_t new_ttl)
{
/* We assume it's zeroed. Do basic sanity check. */
if (ans->rrsets[id].set.rr || ans->rrsets[id].sig_rds.rdata
|| (type == KNOT_RRTYPE_NSEC && ans->nsec_p.raw)
|| (type == KNOT_RRTYPE_NSEC3 && !ans->nsec_p.raw)
)
{
assert(false);
return kr_error(EINVAL);
}
/* Materialize the base RRset. */
knot_rrset_t *rr = ans->rrsets[id].set.rr
= knot_rrset_new(owner, type, KNOT_CLASS_IN, new_ttl, ans->mm);
if (!rr) {
assert(!ENOMEM);
return kr_error(ENOMEM);
}
int ret = rdataset_materialize(&rr->rrs, eh->data, eh_bound, ans->mm);
if (ret < 0) goto fail;
size_t data_off = ret;
ans->rrsets[id].set.rank = eh->rank;
ans->rrsets[id].set.expiring = is_expiring(eh->ttl, new_ttl);
/* Materialize the RRSIG RRset for the answer in (pseudo-)packet. */
bool want_rrsigs = true; /* LATER(optim.): might be omitted in some cases. */
if (want_rrsigs) {
ret = rdataset_materialize(&ans->rrsets[id].sig_rds, eh->data + data_off,
eh_bound, ans->mm);
if (ret < 0) goto fail;
/* Sanity check: we consumed exactly all data. */
int unused_bytes = eh_bound - (uint8_t *)eh->data - data_off - ret;
if (unused_bytes) {
kr_log_error("[cach] entry2answer ERROR: unused bytes: %d\n",
unused_bytes);
assert(!EILSEQ);
ret = kr_error(EILSEQ);
goto fail; /* to be on the safe side */
}
}
return kr_ok();
fail:
assert(/*false*/!ret);
/* Cleanup the item that we might've (partially) written to. */
knot_rrset_free(ans->rrsets[id].set.rr, ans->mm);
knot_rdataset_clear(&ans->rrsets[id].sig_rds, ans->mm);
memset(&ans->rrsets[id], 0, sizeof(ans->rrsets[id]));
return kr_error(ret);
}
|
