2016-05-03 19:00:35 +02:00
|
|
|
/**********************************************************************
|
|
|
|
Copyright(c) 2011-2015 Intel Corporation All rights reserved.
|
|
|
|
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions
|
|
|
|
are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
* 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.
|
|
|
|
* Neither the name of Intel Corporation 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
|
|
|
|
OWNER 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.
|
|
|
|
**********************************************************************/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "crc.h"
|
|
|
|
#include "types.h"
|
2019-04-15 08:57:56 +02:00
|
|
|
#include "crc_ref.h"
|
2016-05-03 19:00:35 +02:00
|
|
|
|
|
|
|
#ifndef TEST_SEED
|
|
|
|
# define TEST_SEED 0x1234
|
|
|
|
#endif
|
|
|
|
|
2019-09-11 22:54:44 +02:00
|
|
|
#define MAX_BUF 4096
|
2016-05-03 19:00:35 +02:00
|
|
|
#define TEST_SIZE 20
|
|
|
|
|
|
|
|
typedef uint32_t u32;
|
|
|
|
typedef uint16_t u16;
|
|
|
|
typedef uint8_t u8;
|
|
|
|
|
2019-04-15 08:57:56 +02:00
|
|
|
uint16_t crc16_t10dif_ref(uint16_t seed, uint8_t * buf, uint64_t len);
|
|
|
|
|
2016-05-03 19:00:35 +02:00
|
|
|
void rand_buffer(unsigned char *buf, long buffer_size)
|
|
|
|
{
|
|
|
|
long i;
|
|
|
|
for (i = 0; i < buffer_size; i++)
|
|
|
|
buf[i] = rand();
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(int argc, char *argv[])
|
|
|
|
{
|
|
|
|
int fail = 0;
|
|
|
|
u32 r = 0;
|
|
|
|
int verbose = argc - 1;
|
|
|
|
int i, s;
|
|
|
|
void *buf_raw;
|
|
|
|
unsigned char *buf;
|
|
|
|
|
|
|
|
printf("Test crc16_t10dif_test ");
|
2019-09-11 22:54:44 +02:00
|
|
|
if (posix_memalign(&buf_raw, 32, MAX_BUF * TEST_SIZE)) {
|
2016-05-03 19:00:35 +02:00
|
|
|
printf("alloc error: Fail");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
buf = (unsigned char *)buf_raw;
|
|
|
|
|
|
|
|
srand(TEST_SEED);
|
|
|
|
|
|
|
|
// Test of all zeros
|
|
|
|
memset(buf, 0, MAX_BUF * 10);
|
2019-04-15 08:57:56 +02:00
|
|
|
u16 crc_ref = crc16_t10dif_ref(TEST_SEED, buf, MAX_BUF);
|
|
|
|
u16 crc_base = crc16_t10dif_base(TEST_SEED, buf, MAX_BUF);
|
2016-05-03 19:00:35 +02:00
|
|
|
u16 crc = crc16_t10dif(TEST_SEED, buf, MAX_BUF);
|
2019-04-15 08:57:56 +02:00
|
|
|
if ((crc_base != crc_ref) || (crc != crc_ref)) {
|
2016-05-03 19:00:35 +02:00
|
|
|
fail++;
|
|
|
|
printf("\n opt ref\n");
|
|
|
|
printf(" ------ ------\n");
|
2019-04-15 08:57:56 +02:00
|
|
|
printf("crc zero = 0x%4x 0x%4x 0x%4x \n", crc_ref, crc_base, crc);
|
2016-05-03 19:00:35 +02:00
|
|
|
} else
|
|
|
|
printf(".");
|
|
|
|
|
|
|
|
// Another simple test pattern
|
|
|
|
memset(buf, 0x8a, MAX_BUF);
|
2019-04-15 08:57:56 +02:00
|
|
|
crc_ref = crc16_t10dif_ref(TEST_SEED, buf, MAX_BUF);
|
|
|
|
crc_base = crc16_t10dif_base(TEST_SEED, buf, MAX_BUF);
|
2016-05-03 19:00:35 +02:00
|
|
|
crc = crc16_t10dif(TEST_SEED, buf, MAX_BUF);
|
2019-04-15 08:57:56 +02:00
|
|
|
if ((crc_base != crc_ref) || (crc != crc_ref)) {
|
2016-05-03 19:00:35 +02:00
|
|
|
fail++;
|
2019-04-15 08:57:56 +02:00
|
|
|
printf("crc all 8a = 0x%4x 0x%4x 0x%4x\n", crc_ref, crc_base, crc);
|
2016-05-03 19:00:35 +02:00
|
|
|
} else
|
|
|
|
printf(".");
|
|
|
|
|
|
|
|
// Do a few random tests
|
|
|
|
|
|
|
|
rand_buffer(buf, MAX_BUF * TEST_SIZE);
|
|
|
|
|
|
|
|
for (i = 0; i < TEST_SIZE; i++) {
|
2019-04-15 08:57:56 +02:00
|
|
|
crc_ref = crc16_t10dif_ref(TEST_SEED, buf, MAX_BUF);
|
|
|
|
crc_base = crc16_t10dif_base(TEST_SEED, buf, MAX_BUF);
|
2016-05-03 19:00:35 +02:00
|
|
|
crc = crc16_t10dif(TEST_SEED, buf, MAX_BUF);
|
2019-04-15 08:57:56 +02:00
|
|
|
if ((crc_base != crc_ref) || (crc != crc_ref))
|
2016-05-03 19:00:35 +02:00
|
|
|
fail++;
|
|
|
|
if (verbose)
|
2019-04-15 08:57:56 +02:00
|
|
|
printf("crc rand%3d = 0x%4x 0x%4x 0x%4x\n", i, crc_ref, crc_base, crc);
|
2019-09-11 22:54:44 +02:00
|
|
|
else if (i % (TEST_SIZE / 8) == 0)
|
2016-05-03 19:00:35 +02:00
|
|
|
printf(".");
|
|
|
|
buf += MAX_BUF;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Do a few random sizes
|
|
|
|
buf = (unsigned char *)buf_raw; //reset buf
|
|
|
|
r = rand();
|
|
|
|
|
|
|
|
for (i = MAX_BUF; i >= 0; i--) {
|
2019-04-15 08:57:56 +02:00
|
|
|
crc_ref = crc16_t10dif_ref(r, buf, i);
|
|
|
|
crc_base = crc16_t10dif_base(r, buf, i);
|
2016-05-03 19:00:35 +02:00
|
|
|
crc = crc16_t10dif(r, buf, i);
|
2019-04-15 08:57:56 +02:00
|
|
|
if ((crc_base != crc_ref) || (crc != crc_ref)) {
|
2016-05-03 19:00:35 +02:00
|
|
|
fail++;
|
2019-04-15 08:57:56 +02:00
|
|
|
printf("fail random size%i 0x%8x 0x%8x 0x%8x\n", i, crc_ref, crc_base,
|
|
|
|
crc);
|
2019-09-11 22:54:44 +02:00
|
|
|
} else if (i % (MAX_BUF / 8) == 0)
|
2016-05-03 19:00:35 +02:00
|
|
|
printf(".");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Try different seeds
|
|
|
|
for (s = 0; s < 20; s++) {
|
|
|
|
buf = (unsigned char *)buf_raw; //reset buf
|
|
|
|
|
|
|
|
r = rand(); // just to get a new seed
|
|
|
|
rand_buffer(buf, MAX_BUF * TEST_SIZE); // new pseudo-rand data
|
|
|
|
|
|
|
|
if (verbose)
|
|
|
|
printf("seed = 0x%x\n", r);
|
|
|
|
|
|
|
|
for (i = 0; i < TEST_SIZE; i++) {
|
2019-04-15 08:57:56 +02:00
|
|
|
crc_ref = crc16_t10dif_ref(r, buf, MAX_BUF);
|
|
|
|
crc_base = crc16_t10dif_base(r, buf, MAX_BUF);
|
2016-05-03 19:00:35 +02:00
|
|
|
crc = crc16_t10dif(r, buf, MAX_BUF);
|
2019-04-15 08:57:56 +02:00
|
|
|
if ((crc_base != crc_ref) || (crc != crc_ref))
|
2016-05-03 19:00:35 +02:00
|
|
|
fail++;
|
|
|
|
if (verbose)
|
2019-04-15 08:57:56 +02:00
|
|
|
printf("crc rand%3d = 0x%4x 0x%4x 0x%4x\n", i, crc_ref,
|
|
|
|
crc_base, crc);
|
2019-09-11 22:54:44 +02:00
|
|
|
else if (i % (TEST_SIZE * 20 / 8) == 0)
|
2016-05-03 19:00:35 +02:00
|
|
|
printf(".");
|
|
|
|
buf += MAX_BUF;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Run tests at end of buffer
|
|
|
|
buf = (unsigned char *)buf_raw; //reset buf
|
|
|
|
buf = buf + ((MAX_BUF - 1) * TEST_SIZE); //Line up TEST_SIZE from end
|
|
|
|
for (i = 0; i < TEST_SIZE; i++) {
|
2019-04-15 08:57:56 +02:00
|
|
|
crc_ref = crc16_t10dif_ref(TEST_SEED, buf + i, TEST_SIZE - i);
|
|
|
|
crc_base = crc16_t10dif_base(TEST_SEED, buf + i, TEST_SIZE - i);
|
2016-05-03 19:00:35 +02:00
|
|
|
crc = crc16_t10dif(TEST_SEED, buf + i, TEST_SIZE - i);
|
2019-04-15 08:57:56 +02:00
|
|
|
if ((crc_base != crc_ref) || (crc != crc_ref))
|
2016-05-03 19:00:35 +02:00
|
|
|
fail++;
|
|
|
|
if (verbose)
|
2019-04-15 08:57:56 +02:00
|
|
|
printf("crc eob rand%3d = 0x%4x 0x%4x 0x%4x\n", i, crc_ref, crc_base,
|
|
|
|
crc);
|
2016-05-03 19:00:35 +02:00
|
|
|
else
|
|
|
|
printf(".");
|
|
|
|
}
|
|
|
|
|
|
|
|
printf("Test done: %s\n", fail ? "Fail" : "Pass");
|
|
|
|
if (fail)
|
|
|
|
printf("\nFailed %d tests\n", fail);
|
|
|
|
|
|
|
|
return fail;
|
|
|
|
}
|