2018-01-07 05:05:16 +00:00
|
|
|
// Copyright (c) 2014-2018, The Monero Project
|
2014-07-23 13:03:52 +00:00
|
|
|
//
|
|
|
|
// 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
|
2014-03-03 22:07:58 +00:00
|
|
|
|
|
|
|
#include <cstddef>
|
|
|
|
#include <fstream>
|
|
|
|
#include <iomanip>
|
|
|
|
#include <ios>
|
|
|
|
#include <string>
|
|
|
|
|
|
|
|
#include "warnings.h"
|
|
|
|
#include "crypto/hash.h"
|
|
|
|
#include "../io.h"
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
using namespace crypto;
|
|
|
|
typedef crypto::hash chash;
|
|
|
|
|
|
|
|
PUSH_WARNINGS
|
|
|
|
DISABLE_VS_WARNINGS(4297)
|
|
|
|
extern "C" {
|
|
|
|
static void hash_tree(const void *data, size_t length, char *hash) {
|
|
|
|
if ((length & 31) != 0) {
|
|
|
|
throw ios_base::failure("Invalid input length for tree_hash");
|
|
|
|
}
|
2018-03-14 15:10:54 +00:00
|
|
|
tree_hash((const char (*)[crypto::HASH_SIZE]) data, length >> 5, hash);
|
2014-03-03 22:07:58 +00:00
|
|
|
}
|
2018-02-07 19:07:36 +00:00
|
|
|
static void cn_slow_hash_0(const void *data, size_t length, char *hash) {
|
2018-03-05 09:24:11 +00:00
|
|
|
return cn_slow_hash(data, length, hash, 0/*variant*/, 0/*prehashed*/);
|
2018-02-07 19:07:36 +00:00
|
|
|
}
|
|
|
|
static void cn_slow_hash_1(const void *data, size_t length, char *hash) {
|
2018-03-05 09:24:11 +00:00
|
|
|
return cn_slow_hash(data, length, hash, 1/*variant*/, 0/*prehashed*/);
|
2018-02-07 19:07:36 +00:00
|
|
|
}
|
2014-03-03 22:07:58 +00:00
|
|
|
}
|
|
|
|
POP_WARNINGS
|
|
|
|
|
|
|
|
extern "C" typedef void hash_f(const void *, size_t, char *);
|
|
|
|
struct hash_func {
|
|
|
|
const string name;
|
|
|
|
hash_f &f;
|
2018-02-07 19:07:36 +00:00
|
|
|
} hashes[] = {{"fast", cn_fast_hash}, {"slow", cn_slow_hash_0}, {"tree", hash_tree},
|
2014-03-03 22:07:58 +00:00
|
|
|
{"extra-blake", hash_extra_blake}, {"extra-groestl", hash_extra_groestl},
|
2018-02-07 19:07:36 +00:00
|
|
|
{"extra-jh", hash_extra_jh}, {"extra-skein", hash_extra_skein},
|
|
|
|
{"slow-1", cn_slow_hash_1}};
|
2014-03-03 22:07:58 +00:00
|
|
|
|
|
|
|
int main(int argc, char *argv[]) {
|
|
|
|
hash_f *f;
|
|
|
|
hash_func *hf;
|
|
|
|
fstream input;
|
|
|
|
vector<char> data;
|
|
|
|
chash expected, actual;
|
|
|
|
size_t test = 0;
|
|
|
|
bool error = false;
|
|
|
|
if (argc != 3) {
|
|
|
|
cerr << "Wrong number of arguments" << endl;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
for (hf = hashes;; hf++) {
|
|
|
|
if (hf >= &hashes[sizeof(hashes) / sizeof(hash_func)]) {
|
|
|
|
cerr << "Unknown function" << endl;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (argv[1] == hf->name) {
|
|
|
|
f = &hf->f;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
input.open(argv[2], ios_base::in);
|
|
|
|
for (;;) {
|
|
|
|
++test;
|
|
|
|
input.exceptions(ios_base::badbit);
|
|
|
|
get(input, expected);
|
|
|
|
if (input.rdstate() & ios_base::eofbit) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
input.exceptions(ios_base::badbit | ios_base::failbit | ios_base::eofbit);
|
|
|
|
input.clear(input.rdstate());
|
|
|
|
get(input, data);
|
|
|
|
f(data.data(), data.size(), (char *) &actual);
|
|
|
|
if (expected != actual) {
|
|
|
|
size_t i;
|
|
|
|
cerr << "Hash mismatch on test " << test << endl << "Input: ";
|
|
|
|
if (data.size() == 0) {
|
|
|
|
cerr << "empty";
|
|
|
|
} else {
|
|
|
|
for (i = 0; i < data.size(); i++) {
|
|
|
|
cerr << setbase(16) << setw(2) << setfill('0') << int(static_cast<unsigned char>(data[i]));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
cerr << endl << "Expected hash: ";
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
cerr << setbase(16) << setw(2) << setfill('0') << int(reinterpret_cast<unsigned char *>(&expected)[i]);
|
|
|
|
}
|
|
|
|
cerr << endl << "Actual hash: ";
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
cerr << setbase(16) << setw(2) << setfill('0') << int(reinterpret_cast<unsigned char *>(&actual)[i]);
|
|
|
|
}
|
|
|
|
cerr << endl;
|
|
|
|
error = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return error ? 1 : 0;
|
|
|
|
}
|