randomx.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397
  1. /*
  2. Copyright (c) 2018-2019, tevador <tevador@gmail.com>
  3. All rights reserved.
  4. Redistribution and use in source and binary forms, with or without
  5. modification, are permitted provided that the following conditions are met:
  6. * Redistributions of source code must retain the above copyright
  7. notice, this list of conditions and the following disclaimer.
  8. * Redistributions in binary form must reproduce the above copyright
  9. notice, this list of conditions and the following disclaimer in the
  10. documentation and/or other materials provided with the distribution.
  11. * Neither the name of the copyright holder nor the
  12. names of its contributors may be used to endorse or promote products
  13. derived from this software without specific prior written permission.
  14. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  15. ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  16. WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  17. DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  18. FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  19. DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  20. SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  21. CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  22. OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  23. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  24. */
  25. #include "randomx.h"
  26. #include "dataset.hpp"
  27. #include "vm_interpreted.hpp"
  28. #include "vm_interpreted_light.hpp"
  29. #include "vm_compiled.hpp"
  30. #include "vm_compiled_light.hpp"
  31. #include "blake2/blake2.h"
  32. #include "cpu.hpp"
  33. #include <cassert>
  34. #include <limits>
  35. #include <cfenv>
  36. extern "C" {
  37. randomx_flags randomx_get_flags() {
  38. randomx_flags flags = RANDOMX_HAVE_COMPILER ? RANDOMX_FLAG_JIT : RANDOMX_FLAG_DEFAULT;
  39. randomx::Cpu cpu;
  40. #ifdef __OpenBSD__
  41. if (flags == RANDOMX_FLAG_JIT) {
  42. flags |= RANDOMX_FLAG_SECURE;
  43. }
  44. #endif
  45. if (HAVE_AES && cpu.hasAes()) {
  46. flags |= RANDOMX_FLAG_HARD_AES;
  47. }
  48. if (randomx_argon2_impl_avx2() != nullptr && cpu.hasAvx2()) {
  49. flags |= RANDOMX_FLAG_ARGON2_AVX2;
  50. }
  51. if (randomx_argon2_impl_ssse3() != nullptr && cpu.hasSsse3()) {
  52. flags |= RANDOMX_FLAG_ARGON2_SSSE3;
  53. }
  54. return flags;
  55. }
  56. randomx_cache *randomx_alloc_cache(randomx_flags flags) {
  57. randomx_cache *cache = nullptr;
  58. auto impl = randomx::selectArgonImpl(flags);
  59. if (impl == nullptr) {
  60. return cache;
  61. }
  62. try {
  63. cache = new randomx_cache();
  64. cache->argonImpl = impl;
  65. switch ((int)(flags & (RANDOMX_FLAG_JIT | RANDOMX_FLAG_LARGE_PAGES))) {
  66. case RANDOMX_FLAG_DEFAULT:
  67. cache->dealloc = &randomx::deallocCache<randomx::DefaultAllocator>;
  68. cache->jit = nullptr;
  69. cache->initialize = &randomx::initCache;
  70. cache->datasetInit = &randomx::initDataset;
  71. cache->memory = (uint8_t*)randomx::DefaultAllocator::allocMemory(randomx::CacheSize);
  72. break;
  73. case RANDOMX_FLAG_JIT:
  74. cache->dealloc = &randomx::deallocCache<randomx::DefaultAllocator>;
  75. cache->jit = new randomx::JitCompiler();
  76. cache->initialize = &randomx::initCacheCompile;
  77. cache->datasetInit = cache->jit->getDatasetInitFunc();
  78. cache->memory = (uint8_t*)randomx::DefaultAllocator::allocMemory(randomx::CacheSize);
  79. break;
  80. case RANDOMX_FLAG_LARGE_PAGES:
  81. cache->dealloc = &randomx::deallocCache<randomx::LargePageAllocator>;
  82. cache->jit = nullptr;
  83. cache->initialize = &randomx::initCache;
  84. cache->datasetInit = &randomx::initDataset;
  85. cache->memory = (uint8_t*)randomx::LargePageAllocator::allocMemory(randomx::CacheSize);
  86. break;
  87. case RANDOMX_FLAG_JIT | RANDOMX_FLAG_LARGE_PAGES:
  88. cache->dealloc = &randomx::deallocCache<randomx::LargePageAllocator>;
  89. cache->jit = new randomx::JitCompiler();
  90. cache->initialize = &randomx::initCacheCompile;
  91. cache->datasetInit = cache->jit->getDatasetInitFunc();
  92. cache->memory = (uint8_t*)randomx::LargePageAllocator::allocMemory(randomx::CacheSize);
  93. break;
  94. default:
  95. UNREACHABLE;
  96. }
  97. }
  98. catch (std::exception &ex) {
  99. if (cache != nullptr) {
  100. randomx_release_cache(cache);
  101. cache = nullptr;
  102. }
  103. }
  104. return cache;
  105. }
  106. void randomx_init_cache(randomx_cache *cache, const void *key, size_t keySize) {
  107. assert(cache != nullptr);
  108. assert(keySize == 0 || key != nullptr);
  109. std::string cacheKey;
  110. cacheKey.assign((const char *)key, keySize);
  111. if (cache->cacheKey != cacheKey || !cache->isInitialized()) {
  112. cache->initialize(cache, key, keySize);
  113. cache->cacheKey = cacheKey;
  114. }
  115. }
  116. void randomx_release_cache(randomx_cache* cache) {
  117. assert(cache != nullptr);
  118. if (cache->memory != nullptr) {
  119. cache->dealloc(cache);
  120. }
  121. delete cache;
  122. }
  123. randomx_dataset *randomx_alloc_dataset(randomx_flags flags) {
  124. //fail on 32-bit systems if DatasetSize is >= 4 GiB
  125. if (randomx::DatasetSize > std::numeric_limits<size_t>::max()) {
  126. return nullptr;
  127. }
  128. randomx_dataset *dataset = nullptr;
  129. try {
  130. dataset = new randomx_dataset();
  131. if (flags & RANDOMX_FLAG_LARGE_PAGES) {
  132. dataset->dealloc = &randomx::deallocDataset<randomx::LargePageAllocator>;
  133. dataset->memory = (uint8_t*)randomx::LargePageAllocator::allocMemory(randomx::DatasetSize);
  134. }
  135. else {
  136. dataset->dealloc = &randomx::deallocDataset<randomx::DefaultAllocator>;
  137. dataset->memory = (uint8_t*)randomx::DefaultAllocator::allocMemory(randomx::DatasetSize);
  138. }
  139. }
  140. catch (std::exception &ex) {
  141. if (dataset != nullptr) {
  142. randomx_release_dataset(dataset);
  143. dataset = nullptr;
  144. }
  145. }
  146. return dataset;
  147. }
  148. constexpr unsigned long DatasetItemCount = randomx::DatasetSize / RANDOMX_DATASET_ITEM_SIZE;
  149. unsigned long randomx_dataset_item_count() {
  150. return DatasetItemCount;
  151. }
  152. void randomx_init_dataset(randomx_dataset *dataset, randomx_cache *cache, unsigned long startItem, unsigned long itemCount) {
  153. assert(dataset != nullptr);
  154. assert(cache != nullptr);
  155. assert(startItem < DatasetItemCount && itemCount <= DatasetItemCount);
  156. assert(startItem + itemCount <= DatasetItemCount);
  157. cache->datasetInit(cache, dataset->memory + startItem * randomx::CacheLineSize, startItem, startItem + itemCount);
  158. }
  159. void *randomx_get_dataset_memory(randomx_dataset *dataset) {
  160. assert(dataset != nullptr);
  161. return dataset->memory;
  162. }
  163. void randomx_release_dataset(randomx_dataset *dataset) {
  164. assert(dataset != nullptr);
  165. dataset->dealloc(dataset);
  166. delete dataset;
  167. }
  168. randomx_vm *randomx_create_vm(randomx_flags flags, randomx_cache *cache, randomx_dataset *dataset) {
  169. assert(cache != nullptr || (flags & RANDOMX_FLAG_FULL_MEM));
  170. assert(cache == nullptr || cache->isInitialized());
  171. assert(dataset != nullptr || !(flags & RANDOMX_FLAG_FULL_MEM));
  172. randomx_vm *vm = nullptr;
  173. try {
  174. switch ((int)(flags & (RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_JIT | RANDOMX_FLAG_HARD_AES | RANDOMX_FLAG_LARGE_PAGES))) {
  175. case RANDOMX_FLAG_DEFAULT:
  176. vm = new randomx::InterpretedLightVmDefault();
  177. break;
  178. case RANDOMX_FLAG_FULL_MEM:
  179. vm = new randomx::InterpretedVmDefault();
  180. break;
  181. case RANDOMX_FLAG_JIT:
  182. if (flags & RANDOMX_FLAG_SECURE) {
  183. vm = new randomx::CompiledLightVmDefaultSecure();
  184. }
  185. else {
  186. vm = new randomx::CompiledLightVmDefault();
  187. }
  188. break;
  189. case RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_JIT:
  190. if (flags & RANDOMX_FLAG_SECURE) {
  191. vm = new randomx::CompiledVmDefaultSecure();
  192. }
  193. else {
  194. vm = new randomx::CompiledVmDefault();
  195. }
  196. break;
  197. case RANDOMX_FLAG_HARD_AES:
  198. vm = new randomx::InterpretedLightVmHardAes();
  199. break;
  200. case RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_HARD_AES:
  201. vm = new randomx::InterpretedVmHardAes();
  202. break;
  203. case RANDOMX_FLAG_JIT | RANDOMX_FLAG_HARD_AES:
  204. if (flags & RANDOMX_FLAG_SECURE) {
  205. vm = new randomx::CompiledLightVmHardAesSecure();
  206. }
  207. else {
  208. vm = new randomx::CompiledLightVmHardAes();
  209. }
  210. break;
  211. case RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_JIT | RANDOMX_FLAG_HARD_AES:
  212. if (flags & RANDOMX_FLAG_SECURE) {
  213. vm = new randomx::CompiledVmHardAesSecure();
  214. }
  215. else {
  216. vm = new randomx::CompiledVmHardAes();
  217. }
  218. break;
  219. case RANDOMX_FLAG_LARGE_PAGES:
  220. vm = new randomx::InterpretedLightVmLargePage();
  221. break;
  222. case RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_LARGE_PAGES:
  223. vm = new randomx::InterpretedVmLargePage();
  224. break;
  225. case RANDOMX_FLAG_JIT | RANDOMX_FLAG_LARGE_PAGES:
  226. if (flags & RANDOMX_FLAG_SECURE) {
  227. vm = new randomx::CompiledLightVmLargePageSecure();
  228. }
  229. else {
  230. vm = new randomx::CompiledLightVmLargePage();
  231. }
  232. break;
  233. case RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_JIT | RANDOMX_FLAG_LARGE_PAGES:
  234. if (flags & RANDOMX_FLAG_SECURE) {
  235. vm = new randomx::CompiledVmLargePageSecure();
  236. }
  237. else {
  238. vm = new randomx::CompiledVmLargePage();
  239. }
  240. break;
  241. case RANDOMX_FLAG_HARD_AES | RANDOMX_FLAG_LARGE_PAGES:
  242. vm = new randomx::InterpretedLightVmLargePageHardAes();
  243. break;
  244. case RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_HARD_AES | RANDOMX_FLAG_LARGE_PAGES:
  245. vm = new randomx::InterpretedVmLargePageHardAes();
  246. break;
  247. case RANDOMX_FLAG_JIT | RANDOMX_FLAG_HARD_AES | RANDOMX_FLAG_LARGE_PAGES:
  248. if (flags & RANDOMX_FLAG_SECURE) {
  249. vm = new randomx::CompiledLightVmLargePageHardAesSecure();
  250. }
  251. else {
  252. vm = new randomx::CompiledLightVmLargePageHardAes();
  253. }
  254. break;
  255. case RANDOMX_FLAG_FULL_MEM | RANDOMX_FLAG_JIT | RANDOMX_FLAG_HARD_AES | RANDOMX_FLAG_LARGE_PAGES:
  256. if (flags & RANDOMX_FLAG_SECURE) {
  257. vm = new randomx::CompiledVmLargePageHardAesSecure();
  258. }
  259. else {
  260. vm = new randomx::CompiledVmLargePageHardAes();
  261. }
  262. break;
  263. default:
  264. UNREACHABLE;
  265. }
  266. if(cache != nullptr) {
  267. vm->setCache(cache);
  268. vm->cacheKey = cache->cacheKey;
  269. }
  270. if(dataset != nullptr)
  271. vm->setDataset(dataset);
  272. vm->allocate();
  273. }
  274. catch (std::exception &ex) {
  275. delete vm;
  276. vm = nullptr;
  277. }
  278. return vm;
  279. }
  280. void randomx_vm_set_cache(randomx_vm *machine, randomx_cache* cache) {
  281. assert(machine != nullptr);
  282. assert(cache != nullptr && cache->isInitialized());
  283. if (machine->cacheKey != cache->cacheKey) {
  284. machine->setCache(cache);
  285. machine->cacheKey = cache->cacheKey;
  286. }
  287. }
  288. void randomx_vm_set_dataset(randomx_vm *machine, randomx_dataset *dataset) {
  289. assert(machine != nullptr);
  290. assert(dataset != nullptr);
  291. machine->setDataset(dataset);
  292. }
  293. void randomx_destroy_vm(randomx_vm *machine) {
  294. assert(machine != nullptr);
  295. delete machine;
  296. }
  297. void randomx_calculate_hash(randomx_vm *machine, const void *input, size_t inputSize, void *output) {
  298. assert(machine != nullptr);
  299. assert(inputSize == 0 || input != nullptr);
  300. assert(output != nullptr);
  301. fenv_t fpstate;
  302. fegetenv(&fpstate);
  303. alignas(16) uint64_t tempHash[8];
  304. int blakeResult = blake2b(tempHash, sizeof(tempHash), input, inputSize, nullptr, 0);
  305. assert(blakeResult == 0);
  306. machine->initScratchpad(&tempHash);
  307. machine->resetRoundingMode();
  308. for (int chain = 0; chain < RANDOMX_PROGRAM_COUNT - 1; ++chain) {
  309. machine->run(&tempHash);
  310. blakeResult = blake2b(tempHash, sizeof(tempHash), machine->getRegisterFile(), sizeof(randomx::RegisterFile), nullptr, 0);
  311. assert(blakeResult == 0);
  312. }
  313. machine->run(&tempHash);
  314. machine->getFinalResult(output, RANDOMX_HASH_SIZE);
  315. fesetenv(&fpstate);
  316. }
  317. void randomx_calculate_hash_first(randomx_vm* machine, const void* input, size_t inputSize) {
  318. blake2b(machine->tempHash, sizeof(machine->tempHash), input, inputSize, nullptr, 0);
  319. machine->initScratchpad(machine->tempHash);
  320. }
  321. void randomx_calculate_hash_next(randomx_vm* machine, const void* nextInput, size_t nextInputSize, void* output) {
  322. machine->resetRoundingMode();
  323. for (uint32_t chain = 0; chain < RANDOMX_PROGRAM_COUNT - 1; ++chain) {
  324. machine->run(machine->tempHash);
  325. blake2b(machine->tempHash, sizeof(machine->tempHash), machine->getRegisterFile(), sizeof(randomx::RegisterFile), nullptr, 0);
  326. }
  327. machine->run(machine->tempHash);
  328. // Finish current hash and fill the scratchpad for the next hash at the same time
  329. blake2b(machine->tempHash, sizeof(machine->tempHash), nextInput, nextInputSize, nullptr, 0);
  330. machine->hashAndFill(output, RANDOMX_HASH_SIZE, machine->tempHash);
  331. }
  332. void randomx_calculate_hash_last(randomx_vm* machine, void* output) {
  333. machine->resetRoundingMode();
  334. for (int chain = 0; chain < RANDOMX_PROGRAM_COUNT - 1; ++chain) {
  335. machine->run(machine->tempHash);
  336. blake2b(machine->tempHash, sizeof(machine->tempHash), machine->getRegisterFile(), sizeof(randomx::RegisterFile), nullptr, 0);
  337. }
  338. machine->run(machine->tempHash);
  339. machine->getFinalResult(output, RANDOMX_HASH_SIZE);
  340. }
  341. }