Ticket #13869: 0004-libs-bsd-add-getentropy-2.patch

new file headers/compatibility/bsd/sys/sha512.h

@@ +1 @@
+/*-
+ * Copyright 2005 Colin Percival
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. 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.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
+ *
+ * $FreeBSD$
+ */
+
+#ifndef _SHA512_H_
+#define _SHA512_H_
+
+#include <sys/types.h>
+
+#define SHA512_DIGEST_LENGTH        64
+
+typedef struct SHA512Context {
+    uint64_t state[8];
+    uint64_t count[2];
+    unsigned char buf[128];
+} SHA512_CTX;
+
+__BEGIN_DECLS
+
+void    SHA512_Init(SHA512_CTX *);
+void    SHA512_Update(SHA512_CTX *, const void *, size_t);
+void    SHA512_Final(unsigned char [64], SHA512_CTX *);
+char   *SHA512_End(SHA512_CTX *, char *);
+char   *SHA512_File(const char *, char *);
+char   *SHA512_FileChunk(const char *, char *, off_t, off_t);
+char   *SHA512_Data(const void *, unsigned int, char *);
+__END_DECLS
+
+#endif /* !_SHA512_H_ */

headers/compatibility/bsd/unistd.h

@@ -26 +26 @@
 char    *getusershell(void);
 int     issetugid(void);
 void    setusershell(void);
+int getentropy(void *buf, size_t buflen);
 
 #ifdef __cplusplus
 }

src/libs/bsd/Jamfile

@@ -15 +15 @@
             err.c
             explicit_bzero.c
             fgetln.c
+            getentropy.c
             getpass.c
             issetugid.c
             lutimes.c
             progname.c
             pty.cpp
             readpassphrase.c
+            sha512c.c
             signal.c
             string.cpp
             stringlist.c

new file src/libs/bsd/getentropy.c

@@ +1 @@
+/*  $OpenBSD: getentropy_hpux.c,v 1.5 2016/08/07 03:27:21 tb Exp $  */
+
+/*
+ * Copyright (c) 2014 Theo de Raadt <deraadt@openbsd.org>
+ * Copyright (c) 2014 Bob Beck <beck@obtuse.com>
+ *
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ *
+ * Emulation of getentropy(2) as documented at:
+ * http://man.openbsd.org/getentropy.2
+ */
+
+#include <sys/types.h>
+#include <sys/param.h>
+#include <sys/ioctl.h>
+#include <sys/resource.h>
+#include <sys/statvfs.h>
+#include <sys/socket.h>
+#include <sys/mman.h>
+#include <sys/stat.h>
+#include <sys/time.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <termios.h>
+#include <fcntl.h>
+#include <signal.h>
+#include <string.h>
+#include <errno.h>
+#include <unistd.h>
+#include <time.h>
+#include <sys/sha512.h>
+
+#define REPEAT 5
+#define min(a, b) (((a) < (b)) ? (a) : (b))
+
+#define HX(a, b) \
+    do { \
+        if ((a)) \
+            HD(errno); \
+        else \
+            HD(b); \
+    } while (0)
+
+#define HR(x, l) (SHA512_Update(&ctx, (char *)(x), (l)))
+#define HD(x)    (SHA512_Update(&ctx, (char *)&(x), sizeof (x)))
+#define HF(x)    (SHA512_Update(&ctx, (char *)&(x), sizeof (void*)))
+
+int getentropy(void *buf, size_t len);
+
+static int gotdata(char *buf, size_t len);
+static int getentropy_urandom(void *buf, size_t len, const char *path,
+    int devfscheck);
+static int getentropy_fallback(void *buf, size_t len);
+
+int
+getentropy(void *buf, size_t len)
+{
+    int ret = -1;
+
+    if (len > 256) {
+        errno = EIO;
+        return (-1);
+    }
+
+    /*
+     * Try to get entropy with /dev/urandom
+     */
+    ret = getentropy_urandom(buf, len, "/dev/urandom", 0);
+    if (ret != -1)
+        return (ret);
+
+    /*
+     * Entropy collection via /dev/urandom has failed.
+     *
+     * No other API exists for collecting entropy, and we have
+     * no failsafe way to get it on Haiku that is not sensitive
+     * to resource exhaustion.
+     *
+     * We have very few options:
+     *     - Even syslog_r is unsafe to call at this low level, so
+     *   there is no way to alert the user or program.
+     *     - Cannot call abort() because some systems have unsafe
+     *   corefiles.
+     *     - Could raise(SIGKILL) resulting in silent program termination.
+     *     - Return EIO, to hint that arc4random's stir function
+     *       should raise(SIGKILL)
+     *     - Do the best under the circumstances....
+     *
+     * This code path exists to bring light to the issue that Haiku 
+     * does not provide a failsafe API for entropy collection.
+     *
+     * We hope this demonstrates that Haiku should consider
+     * providing a new failsafe API which works in a chroot or
+     * when file descriptors are exhausted.
+     */
+#undef FAIL_INSTEAD_OF_TRYING_FALLBACK
+#ifdef FAIL_INSTEAD_OF_TRYING_FALLBACK
+    raise(SIGKILL);
+#endif
+    ret = getentropy_fallback(buf, len);
+    if (ret != -1)
+        return (ret);
+
+    errno = EIO;
+    return (ret);
+}
+
+/*
+ * Basic sanity checking; wish we could do better.
+ */
+static int
+gotdata(char *buf, size_t len)
+{
+    char    any_set = 0;
+    size_t  i;
+
+    for (i = 0; i < len; ++i)
+        any_set |= buf[i];
+    if (any_set == 0)
+        return (-1);
+    return (0);
+}
+
+static int
+getentropy_urandom(void *buf, size_t len, const char *path, int devfscheck)
+{
+    struct stat st;
+    size_t i;
+    int fd, flags;
+    int save_errno = errno;
+
+start:
+
+    flags = O_RDONLY;
+#ifdef O_NOFOLLOW
+    flags |= O_NOFOLLOW;
+#endif
+#ifdef O_CLOEXEC
+    flags |= O_CLOEXEC;
+#endif
+    fd = open(path, flags, 0);
+    if (fd == -1) {
+        if (errno == EINTR)
+            goto start;
+        goto nodevrandom;
+    }
+#ifndef O_CLOEXEC
+    fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
+#endif
+
+    /* Lightly verify that the device node looks sane */
+    if (fstat(fd, &st) == -1 || !S_ISCHR(st.st_mode)) {
+        close(fd);
+        goto nodevrandom;
+    }
+    for (i = 0; i < len; ) {
+        size_t wanted = len - i;
+        ssize_t ret = read(fd, (char *)buf + i, wanted);
+
+        if (ret == -1) {
+            if (errno == EAGAIN || errno == EINTR)
+                continue;
+            close(fd);
+            goto nodevrandom;
+        }
+        i += ret;
+    }
+    close(fd);
+    if (gotdata(buf, len) == 0) {
+        errno = save_errno;
+        return (0);     /* satisfied */
+    }
+nodevrandom:
+    errno = EIO;
+    return (-1);
+}
+
+static const int cl[] = {
+    CLOCK_REALTIME,
+#ifdef CLOCK_MONOTONIC
+    CLOCK_MONOTONIC,
+#endif
+#ifdef CLOCK_MONOTONIC_RAW
+    CLOCK_MONOTONIC_RAW,
+#endif
+#ifdef CLOCK_TAI
+    CLOCK_TAI,
+#endif
+#ifdef CLOCK_VIRTUAL
+    CLOCK_VIRTUAL,
+#endif
+#ifdef CLOCK_UPTIME
+    CLOCK_UPTIME,
+#endif
+#ifdef CLOCK_PROCESS_CPUTIME_ID
+    CLOCK_PROCESS_CPUTIME_ID,
+#endif
+#ifdef CLOCK_THREAD_CPUTIME_ID
+    CLOCK_THREAD_CPUTIME_ID,
+#endif
+};
+
+static int
+getentropy_fallback(void *buf, size_t len)
+{
+    uint8_t results[SHA512_DIGEST_LENGTH];
+    int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat;
+    static int cnt;
+    struct timespec ts;
+    struct timeval tv;
+    struct rusage ru;
+    sigset_t sigset;
+    struct stat st;
+    SHA512_CTX ctx;
+    static pid_t lastpid;
+    pid_t pid;
+    size_t i, ii, m;
+    char *p;
+
+    pid = getpid();
+    if (lastpid == pid) {
+        faster = 1;
+        repeat = 2;
+    } else {
+        faster = 0;
+        lastpid = pid;
+        repeat = REPEAT;
+    }
+    for (i = 0; i < len; ) {
+        int j;
+        SHA512_Init(&ctx);
+        for (j = 0; j < repeat; j++) {
+            HX((e = gettimeofday(&tv, NULL)) == -1, tv);
+            if (e != -1) {
+                cnt += (int)tv.tv_sec;
+                cnt += (int)tv.tv_usec;
+            }
+
+            for (ii = 0; ii < sizeof(cl)/sizeof(cl[0]); ii++)
+                HX(clock_gettime(cl[ii], &ts) == -1, ts);
+
+            HX((pid = getpid()) == -1, pid);
+            HX((pid = getsid(pid)) == -1, pid);
+            HX((pid = getppid()) == -1, pid);
+            HX((pid = getpgid(0)) == -1, pid);
+
+            if (!faster) {
+                ts.tv_sec = 0;
+                ts.tv_nsec = 1;
+                (void) nanosleep(&ts, NULL);
+            }
+
+            HX(sigpending(&sigset) == -1, sigset);
+            HX(sigprocmask(SIG_BLOCK, NULL, &sigset) == -1,
+                sigset);
+
+            HF(getentropy); /* an addr in this library */
+            HF(printf);     /* an addr in libc */
+            p = (char *)&p;
+            HD(p);      /* an addr on stack */
+            p = (char *)&errno;
+            HD(p);      /* the addr of errno */
+
+            if (i == 0) {
+                struct statvfs stvfs;
+                struct termios tios;
+                off_t off;
+
+                /*
+                 * Prime-sized mappings encourage fragmentation;
+                 * thus exposing some address entropy.
+                 */
+                struct mm {
+                    size_t  npg;
+                    void    *p;
+                } mm[] =     {
+                    { 17, MAP_FAILED }, { 3, MAP_FAILED },
+                    { 11, MAP_FAILED }, { 2, MAP_FAILED },
+                    { 5, MAP_FAILED }, { 3, MAP_FAILED },
+                    { 7, MAP_FAILED }, { 1, MAP_FAILED },
+                    { 57, MAP_FAILED }, { 3, MAP_FAILED },
+                    { 131, MAP_FAILED }, { 1, MAP_FAILED },
+                };
+
+                for (m = 0; m < sizeof mm/sizeof(mm[0]); m++) {
+                    HX(mm[m].p = mmap(NULL,
+                        mm[m].npg * pgs,
+                        PROT_READ|PROT_WRITE,
+                        MAP_PRIVATE|MAP_ANON, -1,
+                        (off_t)0), mm[m].p);
+                    if (mm[m].p != MAP_FAILED) {
+                        size_t mo;
+
+                        /* Touch some memory... */
+                        p = mm[m].p;
+                        mo = cnt %
+                            (mm[m].npg * pgs - 1);
+                        p[mo] = 1;
+                        cnt += (int)((long)(mm[m].p)
+                            / pgs);
+                    }
+
+                    /* Check cnts and times... */
+                    for (ii = 0; ii < sizeof(cl)/sizeof(cl[0]);
+                        ii++) {
+                        HX((e = clock_gettime(cl[ii],
+                            &ts)) == -1, ts);
+                        if (e != -1)
+                            cnt += (int)ts.tv_nsec;
+                    }
+
+                    HX((e = getrusage(RUSAGE_SELF,
+                        &ru)) == -1, ru);
+                    if (e != -1) {
+                        cnt += (int)ru.ru_utime.tv_sec;
+                        cnt += (int)ru.ru_utime.tv_usec;
+                    }
+                }
+
+                for (m = 0; m < sizeof mm/sizeof(mm[0]); m++) {
+                    if (mm[m].p != MAP_FAILED)
+                        munmap(mm[m].p, mm[m].npg * pgs);
+                    mm[m].p = MAP_FAILED;
+                }
+
+                HX(stat(".", &st) == -1, st);
+                HX(statvfs(".", &stvfs) == -1, stvfs);
+
+                HX(stat("/", &st) == -1, st);
+                HX(statvfs("/", &stvfs) == -1, stvfs);
+
+                HX((e = fstat(0, &st)) == -1, st);
+                if (e == -1) {
+                    if (S_ISREG(st.st_mode) ||
+                        S_ISFIFO(st.st_mode) ||
+                        S_ISSOCK(st.st_mode)) {
+                        HX(fstatvfs(0, &stvfs) == -1,
+                            stvfs);
+                        HX((off = lseek(0, (off_t)0,
+                            SEEK_CUR)) < 0, off);
+                    }
+                    if (S_ISCHR(st.st_mode)) {
+                        HX(tcgetattr(0, &tios) == -1,
+                            tios);
+                    }
+                }
+
+                HX((e = getrusage(RUSAGE_CHILDREN,
+                    &ru)) == -1, ru);
+                if (e != -1) {
+                    cnt += (int)ru.ru_utime.tv_sec;
+                    cnt += (int)ru.ru_utime.tv_usec;
+                }
+            } else {
+                /* Subsequent hashes absorb previous result */
+                HD(results);
+            }
+
+            HX((e = gettimeofday(&tv, NULL)) == -1, tv);
+            if (e != -1) {
+                cnt += (int)tv.tv_sec;
+                cnt += (int)tv.tv_usec;
+            }
+
+            HD(cnt);
+        }
+        SHA512_Final(results, &ctx);
+        memcpy((char *)buf + i, results, min(sizeof(results), len - i));
+        i += min(sizeof(results), len - i);
+    }
+    explicit_bzero(&ctx, sizeof ctx);
+    explicit_bzero(results, sizeof results);
+    if (gotdata(buf, len) == 0) {
+        errno = save_errno;
+        return (0);     /* satisfied */
+    }
+    errno = EIO;
+    return (-1);
+}

new file src/libs/bsd/sha512c.c

@@ +1 @@
+/*-
+ * Copyright 2005 Colin Percival
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. 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.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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 <sys/cdefs.h>
+#include <endian.h>
+#include <sys/sha512.h>
+#include <sys/types.h>
+
+#include <string.h>
+
+
+#if BYTE_ORDER == BIG_ENDIAN
+
+/* Copy a vector of big-endian uint64_t into a vector of bytes */
+#define be64enc_vect(dst, src, len) \
+    memcpy((void *)dst, (const void *)src, (size_t)len)
+
+/* Copy a vector of bytes into a vector of big-endian uint64_t */
+#define be64dec_vect(dst, src, len) \
+    memcpy((void *)dst, (const void *)src, (size_t)len)
+
+#else /* BYTE_ORDER != BIG_ENDIAN */
+
+/*
+ * Encode a length len/4 vector of (uint64_t) into a length len vector of
+ * (unsigned char) in big-endian form.  Assumes len is a multiple of 8.
+ */
+static void
+be64enc_vect(unsigned char *dst, const uint64_t *src, size_t len)
+{
+    size_t i;
+
+    for (i = 0; i < len / 8; i++)
+        be64enc(dst + i * 8, src[i]);
+}
+
+/*
+ * Decode a big-endian length len vector of (unsigned char) into a length
+ * len/4 vector of (uint64_t).  Assumes len is a multiple of 8.
+ */
+static void
+be64dec_vect(uint64_t *dst, const unsigned char *src, size_t len)
+{
+    size_t i;
+
+    for (i = 0; i < len / 8; i++)
+        dst[i] = be64dec(src + i * 8);
+}
+
+#endif /* BYTE_ORDER != BIG_ENDIAN */
+
+/* Elementary functions used by SHA512 */
+#define Ch(x, y, z) ((x & (y ^ z)) ^ z)
+#define Maj(x, y, z)    ((x & (y | z)) | (y & z))
+#define SHR(x, n)   (x >> n)
+#define ROTR(x, n)  ((x >> n) | (x << (64 - n)))
+#define S0(x)       (ROTR(x, 28) ^ ROTR(x, 34) ^ ROTR(x, 39))
+#define S1(x)       (ROTR(x, 14) ^ ROTR(x, 18) ^ ROTR(x, 41))
+#define s0(x)       (ROTR(x, 1) ^ ROTR(x, 8) ^ SHR(x, 7))
+#define s1(x)       (ROTR(x, 19) ^ ROTR(x, 61) ^ SHR(x, 6))
+
+/* SHA512 round function */
+#define RND(a, b, c, d, e, f, g, h, k)          \
+    t0 = h + S1(e) + Ch(e, f, g) + k;       \
+    t1 = S0(a) + Maj(a, b, c);          \
+    d += t0;                    \
+    h  = t0 + t1;
+
+/* Adjusted round function for rotating state */
+#define RNDr(S, W, i, k)            \
+    RND(S[(80 - i) % 8], S[(81 - i) % 8],   \
+        S[(82 - i) % 8], S[(83 - i) % 8],   \
+        S[(84 - i) % 8], S[(85 - i) % 8],   \
+        S[(86 - i) % 8], S[(87 - i) % 8],   \
+        W[i] + k)
+
+/*
+ * SHA512 block compression function.  The 512-bit state is transformed via
+ * the 512-bit input block to produce a new state.
+ */
+static void
+SHA512_Transform(uint64_t * state, const unsigned char block[128])
+{
+    uint64_t W[80];
+    uint64_t S[8];
+    uint64_t t0, t1;
+    int i;
+
+    /* 1. Prepare message schedule W. */
+    be64dec_vect(W, block, 128);
+    for (i = 16; i < 80; i++)
+        W[i] = s1(W[i - 2]) + W[i - 7] + s0(W[i - 15]) + W[i - 16];
+
+    /* 2. Initialize working variables. */
+    memcpy(S, state, 64);
+
+    /* 3. Mix. */
+    RNDr(S, W, 0, 0x428a2f98d728ae22ULL);
+    RNDr(S, W, 1, 0x7137449123ef65cdULL);
+    RNDr(S, W, 2, 0xb5c0fbcfec4d3b2fULL);
+    RNDr(S, W, 3, 0xe9b5dba58189dbbcULL);
+    RNDr(S, W, 4, 0x3956c25bf348b538ULL);
+    RNDr(S, W, 5, 0x59f111f1b605d019ULL);
+    RNDr(S, W, 6, 0x923f82a4af194f9bULL);
+    RNDr(S, W, 7, 0xab1c5ed5da6d8118ULL);
+    RNDr(S, W, 8, 0xd807aa98a3030242ULL);
+    RNDr(S, W, 9, 0x12835b0145706fbeULL);
+    RNDr(S, W, 10, 0x243185be4ee4b28cULL);
+    RNDr(S, W, 11, 0x550c7dc3d5ffb4e2ULL);
+    RNDr(S, W, 12, 0x72be5d74f27b896fULL);
+    RNDr(S, W, 13, 0x80deb1fe3b1696b1ULL);
+    RNDr(S, W, 14, 0x9bdc06a725c71235ULL);
+    RNDr(S, W, 15, 0xc19bf174cf692694ULL);
+    RNDr(S, W, 16, 0xe49b69c19ef14ad2ULL);
+    RNDr(S, W, 17, 0xefbe4786384f25e3ULL);
+    RNDr(S, W, 18, 0x0fc19dc68b8cd5b5ULL);
+    RNDr(S, W, 19, 0x240ca1cc77ac9c65ULL);
+    RNDr(S, W, 20, 0x2de92c6f592b0275ULL);
+    RNDr(S, W, 21, 0x4a7484aa6ea6e483ULL);
+    RNDr(S, W, 22, 0x5cb0a9dcbd41fbd4ULL);
+    RNDr(S, W, 23, 0x76f988da831153b5ULL);
+    RNDr(S, W, 24, 0x983e5152ee66dfabULL);
+    RNDr(S, W, 25, 0xa831c66d2db43210ULL);
+    RNDr(S, W, 26, 0xb00327c898fb213fULL);
+    RNDr(S, W, 27, 0xbf597fc7beef0ee4ULL);
+    RNDr(S, W, 28, 0xc6e00bf33da88fc2ULL);
+    RNDr(S, W, 29, 0xd5a79147930aa725ULL);
+    RNDr(S, W, 30, 0x06ca6351e003826fULL);
+    RNDr(S, W, 31, 0x142929670a0e6e70ULL);
+    RNDr(S, W, 32, 0x27b70a8546d22ffcULL);
+    RNDr(S, W, 33, 0x2e1b21385c26c926ULL);
+    RNDr(S, W, 34, 0x4d2c6dfc5ac42aedULL);
+    RNDr(S, W, 35, 0x53380d139d95b3dfULL);
+    RNDr(S, W, 36, 0x650a73548baf63deULL);
+    RNDr(S, W, 37, 0x766a0abb3c77b2a8ULL);
+    RNDr(S, W, 38, 0x81c2c92e47edaee6ULL);
+    RNDr(S, W, 39, 0x92722c851482353bULL);
+    RNDr(S, W, 40, 0xa2bfe8a14cf10364ULL);
+    RNDr(S, W, 41, 0xa81a664bbc423001ULL);
+    RNDr(S, W, 42, 0xc24b8b70d0f89791ULL);
+    RNDr(S, W, 43, 0xc76c51a30654be30ULL);
+    RNDr(S, W, 44, 0xd192e819d6ef5218ULL);
+    RNDr(S, W, 45, 0xd69906245565a910ULL);
+    RNDr(S, W, 46, 0xf40e35855771202aULL);
+    RNDr(S, W, 47, 0x106aa07032bbd1b8ULL);
+    RNDr(S, W, 48, 0x19a4c116b8d2d0c8ULL);
+    RNDr(S, W, 49, 0x1e376c085141ab53ULL);
+    RNDr(S, W, 50, 0x2748774cdf8eeb99ULL);
+    RNDr(S, W, 51, 0x34b0bcb5e19b48a8ULL);
+    RNDr(S, W, 52, 0x391c0cb3c5c95a63ULL);
+    RNDr(S, W, 53, 0x4ed8aa4ae3418acbULL);
+    RNDr(S, W, 54, 0x5b9cca4f7763e373ULL);
+    RNDr(S, W, 55, 0x682e6ff3d6b2b8a3ULL);
+    RNDr(S, W, 56, 0x748f82ee5defb2fcULL);
+    RNDr(S, W, 57, 0x78a5636f43172f60ULL);
+    RNDr(S, W, 58, 0x84c87814a1f0ab72ULL);
+    RNDr(S, W, 59, 0x8cc702081a6439ecULL);
+    RNDr(S, W, 60, 0x90befffa23631e28ULL);
+    RNDr(S, W, 61, 0xa4506cebde82bde9ULL);
+    RNDr(S, W, 62, 0xbef9a3f7b2c67915ULL);
+    RNDr(S, W, 63, 0xc67178f2e372532bULL);
+    RNDr(S, W, 64, 0xca273eceea26619cULL);
+    RNDr(S, W, 65, 0xd186b8c721c0c207ULL);
+    RNDr(S, W, 66, 0xeada7dd6cde0eb1eULL);
+    RNDr(S, W, 67, 0xf57d4f7fee6ed178ULL);
+    RNDr(S, W, 68, 0x06f067aa72176fbaULL);
+    RNDr(S, W, 69, 0x0a637dc5a2c898a6ULL);
+    RNDr(S, W, 70, 0x113f9804bef90daeULL);
+    RNDr(S, W, 71, 0x1b710b35131c471bULL);
+    RNDr(S, W, 72, 0x28db77f523047d84ULL);
+    RNDr(S, W, 73, 0x32caab7b40c72493ULL);
+    RNDr(S, W, 74, 0x3c9ebe0a15c9bebcULL);
+    RNDr(S, W, 75, 0x431d67c49c100d4cULL);
+    RNDr(S, W, 76, 0x4cc5d4becb3e42b6ULL);
+    RNDr(S, W, 77, 0x597f299cfc657e2aULL);
+    RNDr(S, W, 78, 0x5fcb6fab3ad6faecULL);
+    RNDr(S, W, 79, 0x6c44198c4a475817ULL);
+
+    /* 4. Mix local working variables into global state */
+    for (i = 0; i < 8; i++)
+        state[i] += S[i];
+}
+
+static unsigned char PAD[128] = {
+    0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+};
+
+/* Add padding and terminating bit-count. */
+static void
+SHA512_Pad(SHA512_CTX * ctx)
+{
+    unsigned char len[16];
+    uint64_t r, plen;
+
+    /*
+     * Convert length to a vector of bytes -- we do this now rather
+     * than later because the length will change after we pad.
+     */
+    be64enc_vect(len, ctx->count, 16);
+
+    /* Add 1--128 bytes so that the resulting length is 112 mod 128 */
+    r = (ctx->count[1] >> 3) & 0x7f;
+    plen = (r < 112) ? (112 - r) : (240 - r);
+    SHA512_Update(ctx, PAD, (size_t)plen);
+
+    /* Add the terminating bit-count */
+    SHA512_Update(ctx, len, 16);
+}
+
+/* SHA-512 initialization.  Begins a SHA-512 operation. */
+void
+SHA512_Init(SHA512_CTX * ctx)
+{
+
+    /* Zero bits processed so far */
+    ctx->count[0] = ctx->count[1] = 0;
+
+    /* Magic initialization constants */
+    ctx->state[0] = 0x6a09e667f3bcc908ULL;
+    ctx->state[1] = 0xbb67ae8584caa73bULL;
+    ctx->state[2] = 0x3c6ef372fe94f82bULL;
+    ctx->state[3] = 0xa54ff53a5f1d36f1ULL;
+    ctx->state[4] = 0x510e527fade682d1ULL;
+    ctx->state[5] = 0x9b05688c2b3e6c1fULL;
+    ctx->state[6] = 0x1f83d9abfb41bd6bULL;
+    ctx->state[7] = 0x5be0cd19137e2179ULL;
+}
+
+/* Add bytes into the hash */
+void
+SHA512_Update(SHA512_CTX * ctx, const void *in, size_t len)
+{
+    uint64_t bitlen[2];
+    uint64_t r;
+    const unsigned char *src = in;
+
+    /* Number of bytes left in the buffer from previous updates */
+    r = (ctx->count[1] >> 3) & 0x7f;
+
+    /* Convert the length into a number of bits */
+    bitlen[1] = ((uint64_t)len) << 3;
+    bitlen[0] = ((uint64_t)len) >> 61;
+
+    /* Update number of bits */
+    if ((ctx->count[1] += bitlen[1]) < bitlen[1])
+        ctx->count[0]++;
+    ctx->count[0] += bitlen[0];
+
+    /* Handle the case where we don't need to perform any transforms */
+    if (len < 128 - r) {
+        memcpy(&ctx->buf[r], src, len);
+        return;
+    }
+
+    /* Finish the current block */
+    memcpy(&ctx->buf[r], src, 128 - r);
+    SHA512_Transform(ctx->state, ctx->buf);
+    src += 128 - r;
+    len -= 128 - r;
+
+    /* Perform complete blocks */
+    while (len >= 128) {
+        SHA512_Transform(ctx->state, src);
+        src += 128;
+        len -= 128;
+    }
+
+    /* Copy left over data into buffer */
+    memcpy(ctx->buf, src, len);
+}
+
+/*
+ * SHA-512 finalization.  Pads the input data, exports the hash value,
+ * and clears the context state.
+ */
+void
+SHA512_Final(unsigned char digest[64], SHA512_CTX * ctx)
+{
+
+    /* Add padding */
+    SHA512_Pad(ctx);
+
+    /* Write the hash */
+    be64enc_vect(digest, ctx->state, 64);
+
+    /* Clear the context state */
+    memset((void *)ctx, 0, sizeof(*ctx));
+}