2 * QEMU Crypto hash algorithms
4 * Copyright (c) 2016 Red Hat, Inc.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
21 #include "qemu/osdep.h"
22 #include "qapi/error.h"
23 #include "crypto/hash.h"
26 static int qcrypto_hash_alg_map
[QCRYPTO_HASH_ALG__MAX
] = {
27 [QCRYPTO_HASH_ALG_MD5
] = G_CHECKSUM_MD5
,
28 [QCRYPTO_HASH_ALG_SHA1
] = G_CHECKSUM_SHA1
,
29 [QCRYPTO_HASH_ALG_SHA224
] = -1,
30 [QCRYPTO_HASH_ALG_SHA256
] = G_CHECKSUM_SHA256
,
31 [QCRYPTO_HASH_ALG_SHA384
] = -1,
32 #if GLIB_CHECK_VERSION(2, 36, 0)
33 [QCRYPTO_HASH_ALG_SHA512
] = G_CHECKSUM_SHA512
,
35 [QCRYPTO_HASH_ALG_SHA512
] = -1,
37 [QCRYPTO_HASH_ALG_RIPEMD160
] = -1,
40 gboolean
qcrypto_hash_supports(QCryptoHashAlgorithm alg
)
42 if (alg
< G_N_ELEMENTS(qcrypto_hash_alg_map
) &&
43 qcrypto_hash_alg_map
[alg
] != -1) {
50 int qcrypto_hash_bytesv(QCryptoHashAlgorithm alg
,
51 const struct iovec
*iov
,
60 if (!qcrypto_hash_supports(alg
)) {
62 "Unknown hash algorithm %d",
67 cs
= g_checksum_new(qcrypto_hash_alg_map
[alg
]);
69 for (i
= 0; i
< niov
; i
++) {
70 g_checksum_update(cs
, iov
[i
].iov_base
, iov
[i
].iov_len
);
73 ret
= g_checksum_type_get_length(qcrypto_hash_alg_map
[alg
]);
75 error_setg(errp
, "%s",
76 "Unable to get hash length");
79 if (*resultlen
== 0) {
81 *result
= g_new0(uint8_t, *resultlen
);
82 } else if (*resultlen
!= ret
) {
84 "Result buffer size %zu is smaller than hash %d",
89 g_checksum_get_digest(cs
, *result
, resultlen
);