aboutsummaryrefslogtreecommitdiff
path: root/rpc_server_loopback.c
blob: 643d5a27d8f21a5f831eb2bea1f08256c693181d (plain) (blame)
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
/*
 * rpc_server_loopback.c
 * ---------------------
 * Remote procedure call transport over loopback socket.
 *
 * Copyright (c) 2016, NORDUnet A/S All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 * - Redistributions of source code must retain the above copyright notice,
 *   this list of conditions and the following disclaimer.
 *
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 *
 * - Neither the name of the NORDUnet nor the names of its contributors may
 *   be used to endorse or promote products derived from this software
 *   without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <unistd.h>	/* close */

#include "hal.h"
#include "hal_internal.h"

static int fd;

hal_error_t hal_rpc_server_transport_init(void)
{
    struct sockaddr_in sin;

    fd = socket(AF_INET, SOCK_DGRAM, 0);
    if (fd == -1)
	return perror("socket"), HAL_ERROR_RPC_TRANSPORT;
    sin.sin_family = AF_INET;
    sin.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
    sin.sin_port = 17425;
    if (bind(fd, (const struct sockaddr *)&sin, sizeof(sin)) != 0)
	return perror("bind"), HAL_ERROR_RPC_TRANSPORT;
    return HAL_OK;
}

hal_error_t hal_rpc_server_transport_close(void)
{
    if (close(fd) != 0)
	return perror("close"), HAL_ERROR_RPC_TRANSPORT;
    return HAL_OK;
}

hal_error_t hal_rpc_sendto(const uint8_t * const buf, const size_t len, void *opaque)
{
    struct sockaddr_in *sin = (struct sockaddr_in *)opaque;
    int ret;

    if ((ret = sendto(fd, buf, len, 0, (struct sockaddr *)sin, sizeof(*sin))) == -1)
	return perror("sendto"), HAL_ERROR_RPC_TRANSPORT;
    return HAL_OK;
}

hal_error_t hal_rpc_recvfrom(uint8_t * const buf, size_t * const len, void **opaque)
{
    static struct sockaddr_in sin;
    socklen_t sin_len = sizeof(sin);
    int ret;

    if ((ret = recvfrom(fd, buf, *len, 0, (struct sockaddr *)&sin, &sin_len)) == -1)
	return HAL_ERROR_RPC_TRANSPORT;
    *opaque = (void *)&sin;
    *len = ret;
    return HAL_OK;
}
SH_STATE_BLOCKS > 0 || HAL_STATIC_HMAC_STATE_BLOCKS > 0 static uint16_t next_glop = 0; uint32_t glop = ++next_glop << 16; next_glop %= 0x7FFF; #endif #if HAL_STATIC_HASH_STATE_BLOCKS > 0 if (!is_hmac) { for (int i = 0; i < sizeof(hash_handle)/sizeof(*hash_handle); i++) { if (hash_handle[i].state.hash != NULL) continue; hash_handle[i].hash_handle.handle = i | glop; return &hash_handle[i]; } } #endif #if HAL_STATIC_HMAC_STATE_BLOCKS > 0 if (is_hmac) { for (int i = 0; i < sizeof(hmac_handle)/sizeof(*hmac_handle); i++) { if (hmac_handle[i].state.hmac != NULL) continue; hmac_handle[i].hash_handle.handle = i | glop | HANDLE_FLAG_HMAC; return &hmac_handle[i]; } } #endif return NULL; } /* * Check a caller-supplied handle. Must be in range, in use, and have * the right glop. Returns slot pointer on success, NULL otherwise. */ static inline handle_slot_t *find_handle(const hal_hash_handle_t handle) { #if HAL_STATIC_HASH_STATE_BLOCKS > 0 || HAL_STATIC_HMAC_STATE_BLOCKS > 0 const int i = (int) (handle.handle & 0xFFFF); const int is_hmac = (handle.handle & HANDLE_FLAG_HMAC) != 0; #endif #if HAL_STATIC_HASH_STATE_BLOCKS > 0 if (!is_hmac && i < sizeof(hash_handle)/sizeof(*hash_handle) && hash_handle[i].hash_handle.handle == handle.handle && hash_handle[i].state.hash != NULL) return &hash_handle[i]; #endif #if HAL_STATIC_HMAC_STATE_BLOCKS > 0 if (is_hmac && i < sizeof(hmac_handle)/sizeof(*hmac_handle) && hmac_handle[i].hash_handle.handle == handle.handle && hmac_handle[i].state.hmac != NULL) return &hmac_handle[i]; #endif return NULL; } static inline void free_handle(handle_slot_t *slot) { if (slot != NULL) /* state is a union, so this this works for hash and hmac */ slot->state.hash = NULL; } /* * Translate an algorithm number to a descriptor. */ static inline const hal_hash_descriptor_t *alg_to_descriptor(const hal_digest_algorithm_t alg) { switch (alg) { case HAL_DIGEST_ALGORITHM_SHA1: return hal_hash_sha1; case HAL_DIGEST_ALGORITHM_SHA256: return hal_hash_sha256; case HAL_DIGEST_ALGORITHM_SHA512_224: return hal_hash_sha512_224; case HAL_DIGEST_ALGORITHM_SHA512_256: return hal_hash_sha512_256; case HAL_DIGEST_ALGORITHM_SHA384: return hal_hash_sha384; case HAL_DIGEST_ALGORITHM_SHA512: return hal_hash_sha512; default: return NULL; } } /* * Given a slot pointer, fetch the descriptor. */ static inline const hal_hash_descriptor_t *slot_to_descriptor(const handle_slot_t * const slot) { if (slot == NULL) return NULL; if ((slot->hash_handle.handle & HANDLE_FLAG_HMAC) == 0) return hal_hash_get_descriptor(slot->state.hash); else return hal_hmac_get_descriptor(slot->state.hmac); } /* * Public API */ static hal_error_t get_digest_length(const hal_digest_algorithm_t alg, size_t *length) { const hal_hash_descriptor_t * const d = alg_to_descriptor(alg); if (d == NULL || length == NULL) return HAL_ERROR_BAD_ARGUMENTS; *length = d->digest_length; return HAL_OK; } static hal_error_t get_digest_algorithm_id(const hal_digest_algorithm_t alg, uint8_t *id, size_t *len, const size_t len_max) { const hal_hash_descriptor_t * const d = alg_to_descriptor(alg); if (d == NULL) return HAL_ERROR_BAD_ARGUMENTS; if (len != NULL) *len = d->digest_algorithm_id_length; if (id == NULL) return HAL_OK; if (len_max < d->digest_algorithm_id_length) return HAL_ERROR_RESULT_TOO_LONG; memcpy(id, d->digest_algorithm_id, d->digest_algorithm_id_length); return HAL_OK; } static hal_error_t get_algorithm(const hal_hash_handle_t handle, hal_digest_algorithm_t *alg) { handle_slot_t *slot = find_handle(handle); const hal_hash_descriptor_t *descriptor = slot_to_descriptor(slot); if (slot == NULL || alg == NULL) return HAL_ERROR_BAD_ARGUMENTS; if (descriptor == NULL) return HAL_ERROR_IMPOSSIBLE; *alg = descriptor->digest_algorithm; return HAL_OK; } static hal_error_t initialize(const hal_client_handle_t client, const hal_session_handle_t session, hal_hash_handle_t *hash, const hal_digest_algorithm_t alg, const uint8_t * const key, const size_t key_len) { const hal_hash_descriptor_t *descriptor; handle_slot_t *slot; hal_error_t err; if (hash == NULL) return HAL_ERROR_BAD_ARGUMENTS; if ((descriptor = alg_to_descriptor(alg)) == NULL) return HAL_ERROR_BAD_ARGUMENTS; if ((slot = alloc_handle(key_len != 0)) == NULL) return HAL_ERROR_ALLOCATION_FAILURE; slot->client_handle = client; slot->session_handle = session; *hash = slot->hash_handle; if (key_len == 0) err = hal_hash_initialize(NULL, descriptor, &slot->state.hash, NULL, 0); else err = hal_hmac_initialize(NULL, descriptor, &slot->state.hmac, NULL, 0, key, key_len); if (err != HAL_OK) free_handle(slot); return err; } static hal_error_t update(const hal_hash_handle_t handle, const uint8_t * data, const size_t length) { handle_slot_t *slot = find_handle(handle); if (slot == NULL) return HAL_ERROR_BAD_ARGUMENTS; if ((handle.handle & HANDLE_FLAG_HMAC) == 0) return hal_hash_update(slot->state.hash, data, length); else return hal_hmac_update(slot->state.hmac, data, length); } static hal_error_t finalize(const hal_hash_handle_t handle, uint8_t *digest, const size_t length) { handle_slot_t *slot = find_handle(handle); hal_error_t err; if (slot == NULL) return HAL_ERROR_BAD_ARGUMENTS; if ((handle.handle & HANDLE_FLAG_HMAC) == 0) { err = hal_hash_finalize(slot->state.hash, digest, length); hal_hash_cleanup(&slot->state.hash); } else { err = hal_hmac_finalize(slot->state.hmac, digest, length); hal_hmac_cleanup(&slot->state.hmac); } free_handle(slot); return err; } const hal_rpc_hash_dispatch_t hal_rpc_local_hash_dispatch = { .get_digest_length = get_digest_length, .get_digest_algorithm_id = get_digest_algorithm_id, .get_algorithm = get_algorithm, .initialize = initialize, .update = update, .finalize = finalize }; /* * Local variables: * indent-tabs-mode: nil * End: */