text: // Copyright (c) 2014-2018, The Monero Project
  // 
  // 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.
  // 
  // 3. Neither the name of the copyright holder 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.
  // 
  // Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
  
  #pragma once
  
  #if !defined(__cplusplus)
  
  #include <assert.h>
  #include <stdbool.h>
  #include <stddef.h>
  #include <stdint.h>
  
  #include "int-util.h"
  #include "warnings.h"
  
  static inline void *padd(void *p, size_t i) {
    return (char *) p + i;
  }
  
  static inline const void *cpadd(const void *p, size_t i) {
    return (const char *) p + i;
  }
  
  PUSH_WARNINGS
  DISABLE_VS_WARNINGS(4267)
  static_assert(sizeof(size_t) == 4 || sizeof(size_t) == 8, "size_t must be 4 or 8 bytes long");
  static inline void place_length(uint8_t *buffer, size_t bufsize, size_t length) {
    if (sizeof(size_t) == 4) {
      *(uint32_t *) padd(buffer, bufsize - 4) = swap32be(length);
    } else {
      *(uint64_t *) padd(buffer, bufsize - 8) = swap64be(length);
    }
  }
  POP_WARNINGS
  
  #pragma pack(push, 1)
  union hash_state {
    uint8_t b[200];
    uint64_t w[25];
  };
  #pragma pack(pop)
  static_assert(sizeof(union hash_state) == 200, "Invalid structure size");
  
  void hash_permutation(union hash_state *state);
  void hash_process(union hash_state *state, const uint8_t *buf, size_t count);
  
  #endif
  
  enum {
    HASH_SIZE = 32,
    HASH_DATA_AREA = 136
  };
  
  void cn_fast_hash(const void *data, size_t length, char *hash);
  void cn_slow_hash(const void *data, size_t length, char *hash, int variant, int prehashed);
  void cn_conceal_slow_hash_v0(const void *data, size_t length, char *hash);
  
  
  void hash_extra_blake(const void *data, size_t length, char *hash);
  void hash_extra_groestl(const void *data, size_t length, char *hash);
  void hash_extra_jh(const void *data, size_t length, char *hash);
  void hash_extra_skein(const void *data, size_t length, char *hash);
  
  void tree_hash(const char (*hashes)[HASH_SIZE], size_t count, char *root_hash);
  