Enable SHA1 optimizations (faster bit twiddling) and SHA2 optimizations (loop unroll).

src/platform/vboot_reference/crypto/sha1.c

 /* Copyright (c) 2010 The Chromium OS Authors. All rights reserved.
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 /* SHA-1 implementation largely based on libmincrypt in the the Android
  * Open Source Project (platorm/system/core.git/libmincrypt/sha.c
  */
 
 #include "sha.h"
 
 /* Some machines lack byteswap.h and endian.h. These have to use the
  * slower code, even if they're little-endian.
  */
 
 #if defined(HAVE_ENDIAN_H) && defined(HAVE_LITTLE_ENDIAN)
 
 #include <byteswap.h>
 #include <memory.h>
 
 /* This version is about 28% faster than the generic version below,
  * but assumes little-endianness.
  */
-static inline uint32_t ror27(uint32_t val) {
+static uint32_t ror27(uint32_t val) {
   return (val >> 27) | (val << 5);
 }
-static inline uint32_t ror2(uint32_t val) {
+static uint32_t ror2(uint32_t val) {
   return (val >> 2) | (val << 30);
 }
-static inline uint32_t ror31(uint32_t val) {
+static uint32_t ror31(uint32_t val) {
   return (val >> 31) | (val << 1);
 }
 
-static void SHA1_Transform(SHA_CTX* ctx) {
+static void SHA1_Transform(SHA1_CTX* ctx) {
   uint32_t W[80];
   register uint32_t A, B, C, D, E;
   int t;
 
   A = ctx->state[0];
   B = ctx->state[1];
   C = ctx->state[2];
   D = ctx->state[3];
   E = ctx->state[4];
 
@@ skipping 235 matching lines @@
   int i;
   SHA1_CTX ctx;
   SHA1_init(&ctx);
   SHA1_update(&ctx, data, len);
   p = SHA1_final(&ctx);
   for (i = 0; i < SHA1_DIGEST_SIZE; ++i) {
     digest[i] = *p++;
   }
   return digest;
 }