1 /*
2 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without modification,
6 * are permitted provided that the following conditions are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright notice, this list of
9 * conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
12 * of conditions and the following disclaimer in the documentation and/or other materials
13 * provided with the distribution.
14 *
15 * 3. Neither the name of the copyright holder nor the names of its contributors may be used
16 * to endorse or promote products derived from this software without specific prior written
17 * permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31 #include "It_test_misc.h"
32
TestCase(VOID)33 static UINT32 TestCase(VOID)
34 {
35 char key[64];
36 char orig[9] = "eggplant";
37 char buf[64];
38 char txt[9];
39 int i, j;
40
41 for (i = 0; i < 64; i++) {
42 key[i] = rand() & 1;
43 }
44
45 for (i = 0; i < 8; i++) {
46 for (j = 0; j < 8; j++) {
47 buf[i * 8 + j] = orig[i] >> j & 1;
48 }
49 setkey(key);
50 }
51 printf("Before encrypting: %s\n", orig);
52
53 encrypt(buf, 0);
54 for (i = 0; i < 8; i++) {
55 for (j = 0, txt[i] = '\0'; j < 8; j++) {
56 txt[i] |= buf[i * 8 + j] << j;
57 }
58 txt[8] = '\0';
59 }
60 ICUNIT_GOTO_STRING_NOT_EQUAL(txt, orig, txt, EXIT);
61
62 encrypt(buf, 1);
63 for (i = 0; i < 8; i++) {
64 for (j = 0, txt[i] = '\0'; j < 8; j++) {
65 txt[i] |= buf[i * 8 + j] << j;
66 }
67 txt[8] = '\0';
68 }
69 ICUNIT_GOTO_STRING_EQUAL(txt, orig, txt, EXIT);
70
71 return 0;
72 EXIT:
73 return -1;
74 }
75
76
ItTestUtil006(VOID)77 VOID ItTestUtil006(VOID)
78 {
79 TEST_ADD_CASE(__FUNCTION__, TestCase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
80 }
81