123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195 |
- /**********************************************************************
- 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 <stdlib.h>
- #include "erasure_code.h"
- #define TEST_SIZE (128*1024)
- typedef unsigned char u8;
- int main(int argc, char *argv[])
- {
- int i, ret = -1;
- u8 *buff1 = NULL, *buff2 = NULL, *buff3 = NULL, gf_const_tbl[64], a = 2;
- int tsize;
- int align, size;
- unsigned char *efence_buff1;
- unsigned char *efence_buff2;
- unsigned char *efence_buff3;
- printf("gf_vect_mul_test: ");
- gf_vect_mul_init(a, gf_const_tbl);
- buff1 = (u8 *) malloc(TEST_SIZE);
- buff2 = (u8 *) malloc(TEST_SIZE);
- buff3 = (u8 *) malloc(TEST_SIZE);
- if (NULL == buff1 || NULL == buff2 || NULL == buff3) {
- printf("buffer alloc error\n");
- goto exit;
- }
- // Fill with rand data
- for (i = 0; i < TEST_SIZE; i++)
- buff1[i] = rand();
- if (gf_vect_mul(TEST_SIZE, gf_const_tbl, buff1, buff2) != 0) {
- printf("fail creating buff2\n");
- goto exit;
- }
- for (i = 0; i < TEST_SIZE; i++) {
- if (gf_mul_erasure(a, buff1[i]) != buff2[i]) {
- printf("fail at %d, 0x%x x 2 = 0x%x (0x%x)\n", i,
- buff1[i], buff2[i], gf_mul_erasure(2, buff1[i]));
- goto exit;
- }
- }
- if (gf_vect_mul_base(TEST_SIZE, gf_const_tbl, buff1, buff3) != 0) {
- printf("fail fill with rand data\n");
- goto exit;
- }
- // Check reference function
- for (i = 0; i < TEST_SIZE; i++) {
- if (buff2[i] != buff3[i]) {
- printf("fail at %d, 0x%x x 0x%d = 0x%x (0x%x)\n",
- i, a, buff1[i], buff2[i], gf_mul_erasure(a, buff1[i]));
- goto exit;
- }
- }
- for (i = 0; i < TEST_SIZE; i++)
- buff1[i] = rand();
- // Check each possible constant
- for (a = 0; a != 255; a++) {
- gf_vect_mul_init(a, gf_const_tbl);
- if (gf_vect_mul(TEST_SIZE, gf_const_tbl, buff1, buff2) != 0) {
- printf("fail creating buff2\n");
- goto exit;
- }
- for (i = 0; i < TEST_SIZE; i++)
- if (gf_mul_erasure(a, buff1[i]) != buff2[i]) {
- printf("fail at %d, 0x%x x %d = 0x%x (0x%x)\n",
- i, a, buff1[i], buff2[i], gf_mul_erasure(2, buff1[i]));
- goto exit;
- }
- #ifdef TEST_VERBOSE
- putchar('.');
- #endif
- }
- // Check buffer len
- for (tsize = TEST_SIZE; tsize > 0; tsize -= 32) {
- a = rand();
- gf_vect_mul_init(a, gf_const_tbl);
- if (gf_vect_mul(tsize, gf_const_tbl, buff1, buff2) != 0) {
- printf("fail creating buff2 (len %d)\n", tsize);
- goto exit;
- }
- for (i = 0; i < tsize; i++)
- if (gf_mul_erasure(a, buff1[i]) != buff2[i]) {
- printf("fail at %d, 0x%x x %d = 0x%x (0x%x)\n",
- i, a, buff1[i], buff2[i], gf_mul_erasure(2, buff1[i]));
- goto exit;
- }
- #ifdef TEST_VERBOSE
- if (0 == tsize % (32 * 8)) {
- putchar('.');
- fflush(0);
- }
- #endif
- }
- // Run tests at end of buffer for Electric Fence
- align = 32;
- a = 2;
- gf_vect_mul_init(a, gf_const_tbl);
- for (size = 0; size < TEST_SIZE; size += align) {
- // Line up TEST_SIZE from end
- efence_buff1 = buff1 + size;
- efence_buff2 = buff2 + size;
- efence_buff3 = buff3 + size;
- gf_vect_mul(TEST_SIZE - size, gf_const_tbl, efence_buff1, efence_buff2);
- for (i = 0; i < TEST_SIZE - size; i++)
- if (gf_mul_erasure(a, efence_buff1[i]) != efence_buff2[i]) {
- printf("fail at %d, 0x%x x 2 = 0x%x (0x%x)\n",
- i, efence_buff1[i], efence_buff2[i],
- gf_mul_erasure(2, efence_buff1[i]));
- goto exit;
- }
- if (gf_vect_mul_base
- (TEST_SIZE - size, gf_const_tbl, efence_buff1, efence_buff3) != 0) {
- printf("fail line up TEST_SIZE from end\n");
- goto exit;
- }
- // Check reference function
- for (i = 0; i < TEST_SIZE - size; i++)
- if (efence_buff2[i] != efence_buff3[i]) {
- printf("fail at %d, 0x%x x 0x%d = 0x%x (0x%x)\n",
- i, a, efence_buff2[i], efence_buff3[i],
- gf_mul_erasure(2, efence_buff1[i]));
- goto exit;
- }
- #ifdef TEST_VERBOSE
- putchar('.');
- #endif
- }
- // Test all unsupported sizes up to TEST_SIZE
- for (size = 0; size < TEST_SIZE; size++) {
- if (size % align != 0 && gf_vect_mul(size, gf_const_tbl, buff1, buff2) == 0) {
- printf
- ("fail expecting nonzero return code for unaligned size param (%d)\n",
- size);
- goto exit;
- }
- }
- printf(" done: Pass\n");
- fflush(0);
- ret = 0;
- exit:
- free(buff1);
- free(buff2);
- free(buff3);
- return ret;
- }
|