2 * Copyright (c) 2009-2010 The FreeBSD Foundation
5 * This software was developed by Pawel Jakub Dawidek under sponsorship from
6 * the FreeBSD Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
33 #include <sys/endian.h>
41 #include <openssl/sha.h>
50 #include "hast_proto.h"
52 struct hast_main_header {
53 /* Protocol version. */
55 /* Size of nv headers. */
59 typedef int hps_send_t(struct hast_resource *, struct nv *nv, void **, size_t *, bool *);
60 typedef int hps_recv_t(struct hast_resource *, struct nv *nv, void **, size_t *, bool *);
62 struct hast_pipe_stage {
68 static int compression_send(struct hast_resource *res, struct nv *nv,
69 void **datap, size_t *sizep, bool *freedatap);
70 static int compression_recv(struct hast_resource *res, struct nv *nv,
71 void **datap, size_t *sizep, bool *freedatap);
73 static int checksum_send(struct hast_resource *res, struct nv *nv,
74 void **datap, size_t *sizep, bool *freedatap);
75 static int checksum_recv(struct hast_resource *res, struct nv *nv,
76 void **datap, size_t *sizep, bool *freedatap);
79 static struct hast_pipe_stage pipeline[] = {
80 { "compression", compression_send, compression_recv },
82 { "checksum", checksum_send, checksum_recv }
87 compression_send(struct hast_resource *res, struct nv *nv, void **datap,
88 size_t *sizep, bool *freedatap)
90 unsigned char *newbuf;
95 * TODO: For now we emulate compression.
96 * At 80% probability we succeed to compress data, which means we
97 * allocate new buffer, copy the data over set *freedatap to true.
100 if (arc4random_uniform(100) < 80) {
104 * Compression succeeded (but we will grow by 4 bytes, not
107 newbuf = malloc(sizeof(uint32_t) + *sizep);
110 origsize = (void *)newbuf;
111 *origsize = htole32((uint32_t)*sizep);
112 nv_add_string(nv, "null", "compression");
113 if (nv_error(nv) != 0) {
115 errno = nv_error(nv);
118 bcopy(*datap, newbuf + sizeof(uint32_t), *sizep);
123 *sizep = sizeof(uint32_t) + *sizep;
126 * Compression failed, so we leave everything as it was.
127 * It is not critical for compression to succeed.
135 compression_recv(struct hast_resource *res, struct nv *nv, void **datap,
136 size_t *sizep, bool *freedatap)
138 unsigned char *newbuf;
142 res = res; /* TODO */
145 * TODO: For now we emulate compression.
148 algo = nv_get_string(nv, "compression");
150 return (0); /* No compression. */
151 if (strcmp(algo, "null") != 0) {
152 pjdlog_error("Unknown compression algorithm '%s'.", algo);
153 return (-1); /* Unknown compression algorithm. */
156 origsize = le32toh(*(uint32_t *)*datap);
157 newbuf = malloc(origsize);
160 bcopy((unsigned char *)*datap + sizeof(uint32_t), newbuf, origsize);
172 checksum_send(struct hast_resource *res, struct nv *nv, void **datap,
173 size_t *sizep, bool *freedatap __unused)
175 unsigned char hash[SHA256_DIGEST_LENGTH];
178 res = res; /* TODO */
181 SHA256_Update(&ctx, *datap, *sizep);
182 SHA256_Final(hash, &ctx);
184 nv_add_string(nv, "sha256", "checksum");
185 nv_add_uint8_array(nv, hash, sizeof(hash), "hash");
191 checksum_recv(struct hast_resource *res, struct nv *nv, void **datap,
192 size_t *sizep, bool *freedatap __unused)
194 unsigned char chash[SHA256_DIGEST_LENGTH];
195 const unsigned char *rhash;
200 res = res; /* TODO */
202 algo = nv_get_string(nv, "checksum");
204 return (0); /* No checksum. */
205 if (strcmp(algo, "sha256") != 0) {
206 pjdlog_error("Unknown checksum algorithm '%s'.", algo);
207 return (-1); /* Unknown checksum algorithm. */
209 rhash = nv_get_uint8_array(nv, &size, "hash");
211 pjdlog_error("Checksum algorithm is present, but hash is missing.");
212 return (-1); /* Hash not found. */
214 if (size != sizeof(chash)) {
215 pjdlog_error("Invalid hash size (%zu) for %s, should be %zu.",
216 size, algo, sizeof(chash));
217 return (-1); /* Different hash size. */
221 SHA256_Update(&ctx, *datap, *sizep);
222 SHA256_Final(chash, &ctx);
224 if (bcmp(rhash, chash, sizeof(chash)) != 0) {
225 pjdlog_error("Hash mismatch.");
226 return (-1); /* Hash mismatch. */
231 #endif /* HAVE_CRYPTO */
234 * Send the given nv structure via conn.
235 * We keep headers in nv structure and pass data in separate argument.
236 * There can be no data at all (data is NULL then).
239 hast_proto_send(struct hast_resource *res, struct proto_conn *conn,
240 struct nv *nv, const void *data, size_t size)
242 struct hast_main_header hdr;
249 dptr = (void *)(uintptr_t)data;
257 for (ii = 0; ii < sizeof(pipeline) / sizeof(pipeline[0]);
259 ret = pipeline[ii].hps_send(res, nv, &dptr, &size,
266 nv_add_uint32(nv, size, "size");
267 if (nv_error(nv) != 0) {
268 errno = nv_error(nv);
277 hdr.version = HAST_PROTO_VERSION;
278 hdr.size = htole32((uint32_t)ebuf_size(eb));
279 if (ebuf_add_head(eb, &hdr, sizeof(hdr)) < 0)
282 hptr = ebuf_data(eb, &hsize);
283 if (proto_send(conn, hptr, hsize) < 0)
285 if (data != NULL && proto_send(conn, dptr, size) < 0)
296 hast_proto_recv_hdr(struct proto_conn *conn, struct nv **nvp)
298 struct hast_main_header hdr;
306 if (proto_recv(conn, &hdr, sizeof(hdr)) < 0)
309 if (hdr.version != HAST_PROTO_VERSION) {
310 errno = ERPCMISMATCH;
314 hdr.size = le32toh(hdr.size);
316 eb = ebuf_alloc(hdr.size);
319 if (ebuf_add_tail(eb, NULL, hdr.size) < 0)
321 hptr = ebuf_data(eb, NULL);
322 assert(hptr != NULL);
323 if (proto_recv(conn, hptr, hdr.size) < 0)
338 hast_proto_recv_data(struct hast_resource *res, struct proto_conn *conn,
339 struct nv *nv, void *data, size_t size)
347 assert(data != NULL);
354 dsize = nv_get_uint32(nv, "size");
356 (void)nv_set_error(nv, 0);
358 if (proto_recv(conn, data, dsize) < 0)
361 for (ii = sizeof(pipeline) / sizeof(pipeline[0]); ii > 0;
363 assert(!"to be verified");
364 ret = pipeline[ii - 1].hps_recv(res, nv, &dptr,
372 /* TODO: 'size' doesn't seem right here. It is maximum data size. */
374 bcopy(dptr, data, dsize);
380 if (ret < 0) printf("%s:%u %s\n", __func__, __LINE__, strerror(errno));
387 hast_proto_recv(struct hast_resource *res, struct proto_conn *conn,
388 struct nv **nvp, void *data, size_t size)
394 ret = hast_proto_recv_hdr(conn, &nv);
397 dsize = nv_get_uint32(nv, "size");
399 (void)nv_set_error(nv, 0);
401 ret = hast_proto_recv_data(res, conn, nv, data, size);