mirror of
https://github.com/monero-project/monero.git
synced 2024-11-18 10:01:02 +00:00
72 lines
2.4 KiB
C++
72 lines
2.4 KiB
C++
// Copyright (c) 2014-2020, 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
|
|
|
|
#include <string.h>
|
|
#include <sodium/crypto_verify_32.h>
|
|
|
|
struct memcmp32
|
|
{
|
|
static const size_t loop_count = 10000000;
|
|
static int call(const unsigned char *k0, const unsigned char *k1){ return memcmp(k0, k1, 32); }
|
|
};
|
|
|
|
struct verify32
|
|
{
|
|
static const size_t loop_count = 10000000;
|
|
static int call(const unsigned char *k0, const unsigned char *k1){ return crypto_verify_32(k0, k1); }
|
|
};
|
|
|
|
template<typename f, bool equal>
|
|
class test_equality
|
|
{
|
|
public:
|
|
static const size_t loop_count = f::loop_count;
|
|
|
|
bool init()
|
|
{
|
|
for (int n = 0; n < 32; ++n)
|
|
k0[n] = n;
|
|
for (int n = 0; n < 32; ++n)
|
|
k1[n] = equal ? n : n + 1;
|
|
return true;
|
|
}
|
|
|
|
bool test()
|
|
{
|
|
return equal == !f::call(k0, k1);
|
|
}
|
|
|
|
private:
|
|
unsigned char k0[32];
|
|
unsigned char k1[32];
|
|
};
|
|
|