mirror of
https://git.wownero.com/wownero/wownero.git
synced 2024-12-23 00:08:54 +00:00
58 lines
2.3 KiB
C
58 lines
2.3 KiB
C
// Copyright (c) 2014-2022, 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
|
|
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
|
|
#include "hash-ops.h"
|
|
#include "keccak.h"
|
|
|
|
void hash_permutation(union hash_state *state) {
|
|
#if BYTE_ORDER == LITTLE_ENDIAN
|
|
keccakf((uint64_t*)state, 24);
|
|
#else
|
|
uint64_t le_state[25];
|
|
memcpy_swap64le(le_state, state, 25);
|
|
keccakf(le_state, 24);
|
|
memcpy_swap64le(state, le_state, 25);
|
|
#endif
|
|
}
|
|
|
|
void hash_process(union hash_state *state, const uint8_t *buf, size_t count) {
|
|
keccak1600(buf, count, (uint8_t*)state);
|
|
}
|
|
|
|
void cn_fast_hash(const void *data, size_t length, char *hash) {
|
|
union hash_state state;
|
|
hash_process(&state, data, length);
|
|
memcpy(hash, &state, HASH_SIZE);
|
|
}
|