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(const struct hast_resource *, struct nv *nv, void **,
61 typedef int hps_recv_t(const struct hast_resource *, struct nv *nv, void **,
64 struct hast_pipe_stage {
70 static int compression_send(const struct hast_resource *res, struct nv *nv,
71 void **datap, size_t *sizep, bool *freedatap);
72 static int compression_recv(const struct hast_resource *res, struct nv *nv,
73 void **datap, size_t *sizep, bool *freedatap);
75 static int checksum_send(const struct hast_resource *res, struct nv *nv,
76 void **datap, size_t *sizep, bool *freedatap);
77 static int checksum_recv(const struct hast_resource *res, struct nv *nv,
78 void **datap, size_t *sizep, bool *freedatap);
81 static struct hast_pipe_stage pipeline[] = {
82 { "compression", compression_send, compression_recv },
84 { "checksum", checksum_send, checksum_recv }
89 compression_send(const struct hast_resource *res, struct nv *nv, void **datap,
90 size_t *sizep, bool *freedatap)
92 unsigned char *newbuf;
97 * TODO: For now we emulate compression.
98 * At 80% probability we succeed to compress data, which means we
99 * allocate new buffer, copy the data over set *freedatap to true.
102 if (arc4random_uniform(100) < 80) {
106 * Compression succeeded (but we will grow by 4 bytes, not
109 newbuf = malloc(sizeof(uint32_t) + *sizep);
112 origsize = (void *)newbuf;
113 *origsize = htole32((uint32_t)*sizep);
114 nv_add_string(nv, "null", "compression");
115 if (nv_error(nv) != 0) {
117 errno = nv_error(nv);
120 bcopy(*datap, newbuf + sizeof(uint32_t), *sizep);
125 *sizep = sizeof(uint32_t) + *sizep;
128 * Compression failed, so we leave everything as it was.
129 * It is not critical for compression to succeed.
137 compression_recv(const struct hast_resource *res, struct nv *nv, void **datap,
138 size_t *sizep, bool *freedatap)
140 unsigned char *newbuf;
144 res = res; /* TODO */
147 * TODO: For now we emulate compression.
150 algo = nv_get_string(nv, "compression");
152 return (0); /* No compression. */
153 if (strcmp(algo, "null") != 0) {
154 pjdlog_error("Unknown compression algorithm '%s'.", algo);
155 return (-1); /* Unknown compression algorithm. */
158 origsize = le32toh(*(uint32_t *)*datap);
159 newbuf = malloc(origsize);
162 bcopy((unsigned char *)*datap + sizeof(uint32_t), newbuf, origsize);
174 checksum_send(const struct hast_resource *res, struct nv *nv, void **datap,
175 size_t *sizep, bool *freedatap __unused)
177 unsigned char hash[SHA256_DIGEST_LENGTH];
180 res = res; /* TODO */
183 SHA256_Update(&ctx, *datap, *sizep);
184 SHA256_Final(hash, &ctx);
186 nv_add_string(nv, "sha256", "checksum");
187 nv_add_uint8_array(nv, hash, sizeof(hash), "hash");
193 checksum_recv(const struct hast_resource *res, struct nv *nv, void **datap,
194 size_t *sizep, bool *freedatap __unused)
196 unsigned char chash[SHA256_DIGEST_LENGTH];
197 const unsigned char *rhash;
202 res = res; /* TODO */
204 algo = nv_get_string(nv, "checksum");
206 return (0); /* No checksum. */
207 if (strcmp(algo, "sha256") != 0) {
208 pjdlog_error("Unknown checksum algorithm '%s'.", algo);
209 return (-1); /* Unknown checksum algorithm. */
211 rhash = nv_get_uint8_array(nv, &size, "hash");
213 pjdlog_error("Checksum algorithm is present, but hash is missing.");
214 return (-1); /* Hash not found. */
216 if (size != sizeof(chash)) {
217 pjdlog_error("Invalid hash size (%zu) for %s, should be %zu.",
218 size, algo, sizeof(chash));
219 return (-1); /* Different hash size. */
223 SHA256_Update(&ctx, *datap, *sizep);
224 SHA256_Final(chash, &ctx);
226 if (bcmp(rhash, chash, sizeof(chash)) != 0) {
227 pjdlog_error("Hash mismatch.");
228 return (-1); /* Hash mismatch. */
233 #endif /* HAVE_CRYPTO */
236 * Send the given nv structure via conn.
237 * We keep headers in nv structure and pass data in separate argument.
238 * There can be no data at all (data is NULL then).
241 hast_proto_send(const struct hast_resource *res, struct proto_conn *conn,
242 struct nv *nv, const void *data, size_t size)
244 struct hast_main_header hdr;
251 dptr = (void *)(uintptr_t)data;
259 for (ii = 0; ii < sizeof(pipeline) / sizeof(pipeline[0]);
261 ret = pipeline[ii].hps_send(res, nv, &dptr, &size,
268 nv_add_uint32(nv, size, "size");
269 if (nv_error(nv) != 0) {
270 errno = nv_error(nv);
279 hdr.version = HAST_PROTO_VERSION;
280 hdr.size = htole32((uint32_t)ebuf_size(eb));
281 if (ebuf_add_head(eb, &hdr, sizeof(hdr)) < 0)
284 hptr = ebuf_data(eb, &hsize);
285 if (proto_send(conn, hptr, hsize) < 0)
287 if (data != NULL && proto_send(conn, dptr, size) < 0)
298 hast_proto_recv_hdr(const struct proto_conn *conn, struct nv **nvp)
300 struct hast_main_header hdr;
308 if (proto_recv(conn, &hdr, sizeof(hdr)) < 0)
311 if (hdr.version != HAST_PROTO_VERSION) {
312 errno = ERPCMISMATCH;
316 hdr.size = le32toh(hdr.size);
318 eb = ebuf_alloc(hdr.size);
321 if (ebuf_add_tail(eb, NULL, hdr.size) < 0)
323 hptr = ebuf_data(eb, NULL);
324 assert(hptr != NULL);
325 if (proto_recv(conn, hptr, hdr.size) < 0)
340 hast_proto_recv_data(const struct hast_resource *res, struct proto_conn *conn,
341 struct nv *nv, void *data, size_t size)
349 assert(data != NULL);
356 dsize = nv_get_uint32(nv, "size");
358 (void)nv_set_error(nv, 0);
360 if (proto_recv(conn, data, dsize) < 0)
363 for (ii = sizeof(pipeline) / sizeof(pipeline[0]); ii > 0;
365 assert(!"to be verified");
366 ret = pipeline[ii - 1].hps_recv(res, nv, &dptr,
374 /* TODO: 'size' doesn't seem right here. It is maximum data size. */
376 bcopy(dptr, data, dsize);
382 if (ret < 0) printf("%s:%u %s\n", __func__, __LINE__, strerror(errno));
389 hast_proto_recv(const struct hast_resource *res, struct proto_conn *conn,
390 struct nv **nvp, void *data, size_t size)
396 ret = hast_proto_recv_hdr(conn, &nv);
399 dsize = nv_get_uint32(nv, "size");
401 (void)nv_set_error(nv, 0);
403 ret = hast_proto_recv_data(res, conn, nv, data, size);