aboutsummaryrefslogtreecommitdiffstats
path: root/behex_upper.c
diff options
context:
space:
mode:
authorMattias Andrée <maandree@kth.se>2019-02-09 18:20:57 +0100
committerMattias Andrée <maandree@kth.se>2019-02-09 18:20:57 +0100
commit242430d5e52cf8ee49dcd1701cf134e7454910c6 (patch)
treee3238ce604ffb0d80a4e122cd40d5807372f187f /behex_upper.c
parentMerge pull request #2 from maaku/no-trailing-comma (diff)
downloadlibsha2-242430d5e52cf8ee49dcd1701cf134e7454910c6.tar.gz
libsha2-242430d5e52cf8ee49dcd1701cf134e7454910c6.tar.bz2
libsha2-242430d5e52cf8ee49dcd1701cf134e7454910c6.tar.xz
Change license to ISC and reorganise
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to '')
-rw-r--r--behex_upper.c20
1 files changed, 20 insertions, 0 deletions
diff --git a/behex_upper.c b/behex_upper.c
new file mode 100644
index 0000000..29e5f91
--- /dev/null
+++ b/behex_upper.c
@@ -0,0 +1,20 @@
+/* See LICENSE file for copyright and license details. */
+#include "common.h"
+
+
+/**
+ * Convert a binary hashsum to upper case hexadecimal representation
+ *
+ * @param output Output array, should have an allocation size of at least `2 * n + 1`
+ * @param hashsum The hashsum to convert
+ * @param n The size of `hashsum`
+ */
+void
+libsha2_behex_upper(char *restrict output, const char *restrict hashsum, size_t n)
+{
+ output[2 * n] = '\0';
+ while (n--) {
+ output[2 * n + 0] = "0123456789ABCDEF"[(hashsum[n] >> 4) & 15];
+ output[2 * n + 1] = "0123456789ABCDEF"[(hashsum[n] >> 0) & 15];
+ }
+}