QuickMythril
/
Brooklyn
forked from Qortal/Brooklyn
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity
QortalOS Brooklyn for Raspberry Pi 4
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
21 Commits
1 Branch
23 Tags
720 MiB
 
 
 
 
 
 
Tree: 9265f4f149
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '9265f4f149'
${ noResults }
Brooklyn/crypto/test_types.c

337 lines
7.9 KiB
Raw Blame History

/* $Id: test_types.c 250 2010-09-10 20:23:02Z tp $ */
/*
* Unit tests for the basic integer types and functions for encoding and
* decoding such integer types to and from byte streams.
*
* ==========================(LICENSE BEGIN)============================
*
* Copyright (c) 2007-2010 Projet RNRT SAPHIR
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* ===========================(LICENSE END)=============================
*
* @author Thomas Pornin <[email protected]>
*/
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include "sph_types.h"
#include "utest.h"
static void
test_config(void)
{
#ifdef SPH_UPTR
ASSERT(sizeof(void *) == sizeof(SPH_UPTR));
#endif
ASSERT(sizeof(sph_u32) >= 4);
ASSERT((((sph_u32)-1) >> 31) >= 1U);
#if SPH_64
ASSERT(sizeof(sph_u64) >= 8);
ASSERT((((sph_u64)-1) >> 63) >= 1U);
#endif
}
static void
test_types32(void)
{
unsigned i;
union {
unsigned char bytes[64];
sph_u32 v32;
} u;
#if SPH_LITTLE_ENDIAN || SPH_BIG_ENDIAN
ASSERT(sizeof(sph_u32) == 4);
#else
ASSERT(sizeof(sph_u32) >= 4);
#endif
for (i = 0; i < sizeof u.bytes; i ++)
u.bytes[i] = i;
for (i = 0; (i + 3) < sizeof u.bytes; i ++) {
sph_u32 v, w;
v = ((sph_u32)i << 24)
| ((sph_u32)(i + 1) << 16)
| ((sph_u32)(i + 2) << 8)
| (sph_u32)(i + 3);
w = ((sph_u32)(i + 3) << 24)
| ((sph_u32)(i + 2) << 16)
| ((sph_u32)(i + 1) << 8)
| (sph_u32)i;
ASSERT(sph_dec32be(u.bytes + i) == v);
ASSERT(sph_dec32le(u.bytes + i) == w);
if (i % 4 == 0) {
ASSERT(sph_dec32be_aligned(u.bytes + i) == v);
ASSERT(sph_dec32le_aligned(u.bytes + i) == w);
}
}
memset(u.bytes, 0, sizeof u.bytes);
for (i = 0; (i + 3) < sizeof u.bytes; i ++) {
sph_u32 v, w;
v = ((sph_u32)i << 24)
| ((sph_u32)(i + 1) << 16)
| ((sph_u32)(i + 2) << 8)
| (sph_u32)(i + 3);
w = ((sph_u32)(i + 3) << 24)
| ((sph_u32)(i + 2) << 16)
| ((sph_u32)(i + 1) << 8)
| (sph_u32)i;
if (i % 4 == 0) {
sph_enc32be_aligned(u.bytes + i, v);
} else {
sph_enc32be(u.bytes + i, v);
}
ASSERT(u.bytes[i + 0] == i + 0);
ASSERT(u.bytes[i + 1] == i + 1);
ASSERT(u.bytes[i + 2] == i + 2);
ASSERT(u.bytes[i + 3] == i + 3);
memset(u.bytes, 0, sizeof u.bytes);
if (i % 4 == 0) {
sph_enc32le_aligned(u.bytes + i, w);
} else {
sph_enc32le(u.bytes + i, w);
}
ASSERT(u.bytes[i + 0] == i + 0);
ASSERT(u.bytes[i + 1] == i + 1);
ASSERT(u.bytes[i + 2] == i + 2);
ASSERT(u.bytes[i + 3] == i + 3);
}
}
#if SPH_64
static void
test_types64(void)
{
unsigned i;
union {
unsigned char bytes[64];
sph_u64 v64;
} u;
#if SPH_LITTLE_ENDIAN || SPH_BIG_ENDIAN
ASSERT(sizeof(sph_u64) == 8);
#else
ASSERT(sizeof(sph_u64) >= 8);
#endif
for (i = 0; i < sizeof u.bytes; i ++)
u.bytes[i] = i;
for (i = 0; (i + 7) < sizeof u.bytes; i ++) {
sph_u64 v, w;
v = ((sph_u64)i << 56)
| ((sph_u64)(i + 1) << 48)
| ((sph_u64)(i + 2) << 40)
| ((sph_u64)(i + 3) << 32)
| ((sph_u64)(i + 4) << 24)
| ((sph_u64)(i + 5) << 16)
| ((sph_u64)(i + 6) << 8)
| (sph_u64)(i + 7);
w = ((sph_u64)(i + 7) << 56)
| ((sph_u64)(i + 6) << 48)
| ((sph_u64)(i + 5) << 40)
| ((sph_u64)(i + 4) << 32)
| ((sph_u64)(i + 3) << 24)
| ((sph_u64)(i + 2) << 16)
| ((sph_u64)(i + 1) << 8)
| (sph_u64)i;
ASSERT(sph_dec64be(u.bytes + i) == v);
ASSERT(sph_dec64le(u.bytes + i) == w);
if (i % 8 == 0) {
ASSERT(sph_dec64be_aligned(u.bytes + i) == v);
ASSERT(sph_dec64le_aligned(u.bytes + i) == w);
}
}
memset(u.bytes, 0, sizeof u.bytes);
for (i = 0; (i + 7) < sizeof u.bytes; i ++) {
sph_u64 v, w;
v = ((sph_u64)i << 56)
| ((sph_u64)(i + 1) << 48)
| ((sph_u64)(i + 2) << 40)
| ((sph_u64)(i + 3) << 32)
| ((sph_u64)(i + 4) << 24)
| ((sph_u64)(i + 5) << 16)
| ((sph_u64)(i + 6) << 8)
| (sph_u64)(i + 7);
w = ((sph_u64)(i + 7) << 56)
| ((sph_u64)(i + 6) << 48)
| ((sph_u64)(i + 5) << 40)
| ((sph_u64)(i + 4) << 32)
| ((sph_u64)(i + 3) << 24)
| ((sph_u64)(i + 2) << 16)
| ((sph_u64)(i + 1) << 8)
| (sph_u64)i;
if (i % 8 == 0) {
sph_enc64be_aligned(u.bytes + i, v);
} else {
sph_enc64be(u.bytes + i, v);
}
ASSERT(u.bytes[i + 0] == i + 0);
ASSERT(u.bytes[i + 1] == i + 1);
ASSERT(u.bytes[i + 2] == i + 2);
ASSERT(u.bytes[i + 3] == i + 3);
ASSERT(u.bytes[i + 4] == i + 4);
ASSERT(u.bytes[i + 5] == i + 5);
ASSERT(u.bytes[i + 6] == i + 6);
ASSERT(u.bytes[i + 7] == i + 7);
memset(u.bytes, 0, sizeof u.bytes);
if (i % 8 == 0) {
sph_enc64le_aligned(u.bytes + i, w);
} else {
sph_enc64le(u.bytes + i, w);
}
ASSERT(u.bytes[i + 0] == i + 0);
ASSERT(u.bytes[i + 1] == i + 1);
ASSERT(u.bytes[i + 2] == i + 2);
ASSERT(u.bytes[i + 3] == i + 3);
ASSERT(u.bytes[i + 4] == i + 4);
ASSERT(u.bytes[i + 5] == i + 5);
ASSERT(u.bytes[i + 6] == i + 6);
ASSERT(u.bytes[i + 7] == i + 7);
}
}
#endif
#define STR(x) STR_(x)
#define STR_(x) #x
static void
print_macros(void)
{
printf("Used configuration:\n");
printf(" 64-bit support: "
#if SPH_64
"yes"
#if SPH_64_TRUE
" (native)"
#else
" (emulated)"
#endif
#else
"no"
#endif
"\n");
printf(" pointer as integer type: %s\n",
#ifdef SPH_UPTR
STR(SPH_UPTR)
#else
"[none]"
#endif
);
printf(" unaligned access: "
#if SPH_UNALIGNED
"yes"
#else
"no"
#endif
"\n");
printf(" direct access, little endian: "
#if SPH_LITTLE_ENDIAN
"yes"
#else
"no"
#endif
"\n");
printf(" direct access, big endian: "
#if SPH_BIG_ENDIAN
"yes"
#else
"no"
#endif
"\n");
printf(" little-endian access is efficient: "
#if SPH_LITTLE_FAST
"yes"
#else
"no"
#endif
"\n");
printf(" big-endian access is efficient: "
#if SPH_BIG_FAST
"yes"
#else
"no"
#endif
"\n");
printf(" specific architecture: "
#if SPH_SPARCV9_GCC_32
"Sparc v9 32-bit with GCC"
#elif SPH_SPARCV9_GCC_64
"Sparc v9 64-bit with GCC"
#elif SPH_SPARCV9_GCC
"Sparc v9 [unknown size] with GCC"
#elif SPH_I386_GCC
"i386 with GCC"
#elif SPH_I386_MSVC
"i386 with Visual C"
#elif SPH_AMD64_GCC
"amd64 with GCC"
#elif SPH_AMD64_MSVC
"amd64 with Visual C"
#elif SPH_PPC32_GCC
"PowerPC 32-bit with GCC"
#elif SPH_PPC64_GCC
"PowerPC 64-bit with GCC"
#else
"[none]"
#endif
"\n");
}
static void
print_types(void)
{
printf("sizeof int: %2d\n", (int)sizeof(int));
printf("sizeof long: %2d\n", (int)sizeof(long));
#if defined ULLONG_MAX || defined __GNUC__
printf("sizeof long long: %2d\n", (int)sizeof(long long));
#else
printf("[no detected 'long long']\n");
#endif
printf("sizeof pointer: %2d\n", (int)sizeof(void *));
printf("sizeof sph_u32: %2d\n", (int)sizeof(sph_u32));
#if SPH_64
printf("sizeof sph_u64: %2d\n", (int)sizeof(sph_u64));
#else
printf("[no detected 64-bit type]\n");
#endif
}
static void
test_types(void)
{
print_macros();
print_types();
test_config();
test_types32();
#if SPH_64
test_types64();
#else
printf("warning: no 64-bit type defined\n");
#endif
}
UTEST_MAIN("types", test_types)