Monero
Loading...
Searching...
No Matches
hash-ops.h
Go to the documentation of this file.
1// Copyright (c) 2014-2022, The Monero Project
2//
3// All rights reserved.
4//
5// Redistribution and use in source and binary forms, with or without modification, are
6// permitted provided that the following conditions are met:
7//
8// 1. Redistributions of source code must retain the above copyright notice, this list of
9// conditions and the following disclaimer.
10//
11// 2. Redistributions in binary form must reproduce the above copyright notice, this list
12// of conditions and the following disclaimer in the documentation and/or other
13// materials provided with the distribution.
14//
15// 3. Neither the name of the copyright holder nor the names of its contributors may be
16// used to endorse or promote products derived from this software without specific
17// prior written permission.
18//
19// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
20// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
22// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
26// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
27// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28//
29// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
30
31#pragma once
32
33#if !defined(__cplusplus)
34
35#include <assert.h>
36#include <stdbool.h>
37#include <stddef.h>
38#include <stdint.h>
39
40#include "int-util.h"
41#include "warnings.h"
42
43static inline void *padd(void *p, size_t i) {
44 return (char *) p + i;
45}
46
47static inline const void *cpadd(const void *p, size_t i) {
48 return (const char *) p + i;
49}
50
53static_assert(sizeof(size_t) == 4 || sizeof(size_t) == 8, "size_t must be 4 or 8 bytes long");
54static inline void place_length(uint8_t *buffer, size_t bufsize, size_t length) {
55 if (sizeof(size_t) == 4) {
56 *(uint32_t *) padd(buffer, bufsize - 4) = swap32be(length);
57 } else {
58 *(uint64_t *) padd(buffer, bufsize - 8) = swap64be(length);
59 }
60}
62
63#pragma pack(push, 1)
65 uint8_t b[200];
67};
68#pragma pack(pop)
69static_assert(sizeof(union hash_state) == 200, "Invalid structure size");
70
72void hash_process(union hash_state *state, const uint8_t *buf, size_t count);
73
74#endif
75
76enum {
79};
80
81void cn_fast_hash(const void *data, size_t length, char *hash);
82void cn_slow_hash(const void *data, size_t length, char *hash, int variant, int prehashed, uint64_t height);
83
84void hash_extra_blake(const void *data, size_t length, char *hash);
85void hash_extra_groestl(const void *data, size_t length, char *hash);
86void hash_extra_jh(const void *data, size_t length, char *hash);
87void hash_extra_skein(const void *data, size_t length, char *hash);
88
89void tree_hash(const char (*hashes)[HASH_SIZE], size_t count, char *root_hash);
90bool tree_path(size_t count, size_t idx, uint32_t *path);
91bool tree_branch(const char (*hashes)[HASH_SIZE], size_t count, const char *hash, char (*branch)[HASH_SIZE], size_t *depth, uint32_t *path);
92bool tree_branch_hash(const char hash[HASH_SIZE], const char (*branch)[HASH_SIZE], size_t depth, uint32_t path, char root[HASH_SIZE]);
93bool is_branch_in_tree(const char hash[HASH_SIZE], const char root[HASH_SIZE], const char (*branch)[HASH_SIZE], size_t depth, uint32_t path);
94
95#define RX_BLOCK_VERSION 12
98uint64_t rx_seedheight(const uint64_t height);
99void rx_seedheights(const uint64_t height, uint64_t *seed_height, uint64_t *next_height);
100
101void rx_set_main_seedhash(const char *seedhash, size_t max_dataset_init_threads);
102void rx_slow_hash(const char *seedhash, const void *data, size_t length, char *result_hash);
103
104void rx_set_miner_thread(uint32_t value, size_t max_dataset_init_threads);
void hash_process(union hash_state *state, const uint8_t *buf, size_t count)
Definition hash.c:49
uint64_t rx_seedheight(const uint64_t height)
Definition rx-slow-hash.c:179
void cn_fast_hash(const void *data, size_t length, char *hash)
Definition hash.c:53
void cn_slow_hash(const void *data, size_t length, char *hash, int variant, int prehashed, uint64_t height)
Definition slow-hash.c:1776
void hash_extra_blake(const void *data, size_t length, char *hash)
Definition hash-extra-blake.c:36
bool tree_branch(const char(*hashes)[HASH_SIZE], size_t count, const char *hash, char(*branch)[HASH_SIZE], size_t *depth, uint32_t *path)
Definition tree-hash.c:152
@ HASH_DATA_AREA
Definition hash-ops.h:78
void rx_set_miner_thread(uint32_t value, size_t max_dataset_init_threads)
Definition rx-slow-hash.c:490
void rx_slow_hash_allocate_state(void)
Definition rx-slow-hash.c:511
static void * padd(void *p, size_t i)
Definition hash-ops.h:43
void rx_set_main_seedhash(const char *seedhash, size_t max_dataset_init_threads)
Definition rx-slow-hash.c:388
void rx_seedheights(const uint64_t height, uint64_t *seed_height, uint64_t *next_height)
Definition rx-slow-hash.c:187
uint32_t rx_get_miner_thread(void)
Definition rx-slow-hash.c:507
static const void * cpadd(const void *p, size_t i)
Definition hash-ops.h:47
bool tree_branch_hash(const char hash[HASH_SIZE], const char(*branch)[HASH_SIZE], size_t depth, uint32_t path, char root[HASH_SIZE])
Definition tree-hash.c:224
void hash_extra_groestl(const void *data, size_t length, char *hash)
Definition hash-extra-groestl.c:36
void hash_permutation(union hash_state *state)
Definition hash.c:38
void tree_hash(const char(*hashes)[HASH_SIZE], size_t count, char *root_hash)
Definition tree-hash.c:62
static void place_length(uint8_t *buffer, size_t bufsize, size_t length)
Definition hash-ops.h:54
void rx_slow_hash_free_state(void)
Definition rx-slow-hash.c:520
bool is_branch_in_tree(const char hash[HASH_SIZE], const char root[HASH_SIZE], const char(*branch)[HASH_SIZE], size_t depth, uint32_t path)
Definition tree-hash.c:251
void hash_extra_skein(const void *data, size_t length, char *hash)
Definition hash-extra-skein.c:37
void hash_extra_jh(const void *data, size_t length, char *hash)
Definition hash-extra-jh.c:39
bool tree_path(size_t count, size_t idx, uint32_t *path)
Definition tree-hash.c:108
void rx_slow_hash(const char *seedhash, const void *data, size_t length, char *result_hash)
Definition rx-slow-hash.c:408
#define HASH_SIZE
Definition hmac-keccak.c:33
#define inline
Definition inline_c.h:34
#define swap64be
Definition int-util.h:288
#define swap32be
Definition int-util.h:280
const GenericPointer< typename T::ValueType > T2 value
Definition pointer.h:1225
const char * buf
Definition slow_memmem.cpp:73
static __thread int depth
Definition threadpool.cpp:34
unsigned int uint32_t
Definition stdint.h:126
unsigned char uint8_t
Definition stdint.h:124
unsigned __int64 uint64_t
Definition stdint.h:136
Definition blake256.h:36
std::string data
Definition base58.cpp:37
struct hash_func hashes[]
Definition hash-ops.h:64
uint8_t b[200]
Definition hash-ops.h:65
uint64_t w[25]
Definition hash-ops.h:66
#define DISABLE_VS_WARNINGS(w)
Definition warnings.h:18
#define POP_WARNINGS
Definition warnings.h:17
#define PUSH_WARNINGS
Definition warnings.h:16