1 /*-
2 * SPDX-License-Identifier: MIT
3 *
4 * Copyright (C) 2015-2021 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
5 * Copyright (C) 2019-2021 Matt Dunwoodie <ncon@noconroy.net>
6 *
7 * Permission is hereby granted, free of charge, to any person obtaining
8 * a copy of this software and associated documentation files (the
9 * "Software"), to deal in the Software without restriction, including
10 * without limitation the rights to use, copy, modify, merge, publish,
11 * distribute, sublicense, and/or sell copies of the Software, and to
12 * permit persons to whom the Software is furnished to do so, subject
13 * to the following conditions:
14 *
15 * The above copyright notice and this permission notice shall be
16 * included in all copies or substantial portions of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
19 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
21 * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
22 * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 */
26
27 #define T_LIM (COUNTER_WINDOW_SIZE + 1)
28 #define T_INIT do { \
29 bzero(&kp, sizeof(kp)); \
30 lockinit(&kp.kp_counter_lock, "noise_counter", 0, 0); \
31 } while (0)
32 #define T(num, v, e) do { \
33 if (noise_keypair_counter_check(&kp, v) != (e)) { \
34 kprintf("%s: self-test %u: FAIL\n", __func__, num); \
35 success = false; \
36 } \
37 } while (0)
38
39 bool
noise_counter_selftest(void)40 noise_counter_selftest(void)
41 {
42 struct noise_keypair kp;
43 int i;
44 bool success = true;
45
46 T_INIT;
47 /* T(test_number, counter, expected_response) */
48 T( 1, 0, 0);
49 T( 2, 1, 0);
50 T( 3, 1, EEXIST);
51 T( 4, 9, 0);
52 T( 5, 8, 0);
53 T( 6, 7, 0);
54 T( 7, 7, EEXIST);
55 T( 8, T_LIM, 0);
56 T( 9, T_LIM - 1, 0);
57 T(10, T_LIM - 1, EEXIST);
58 T(11, T_LIM - 2, 0);
59 T(12, 2, 0);
60 T(13, 2, EEXIST);
61 T(14, T_LIM + 16, 0);
62 T(15, 3, ESTALE);
63 T(16, T_LIM + 16, EEXIST);
64 T(17, T_LIM * 4, 0);
65 T(18, T_LIM * 4 - (T_LIM - 1), 0);
66 T(19, 10, ESTALE);
67 T(20, T_LIM * 4 - T_LIM, ESTALE);
68 T(21, T_LIM * 4 - (T_LIM + 1), ESTALE);
69 T(22, T_LIM * 4 - (T_LIM - 2), 0);
70 T(23, T_LIM * 4 - (T_LIM - 1), EEXIST);
71 T(24, 0, ESTALE);
72 T(25, REJECT_AFTER_MESSAGES, EINVAL);
73 T(26, REJECT_AFTER_MESSAGES - 1, 0);
74 T(27, REJECT_AFTER_MESSAGES, EINVAL);
75 T(28, REJECT_AFTER_MESSAGES - 1, EEXIST);
76 T(29, REJECT_AFTER_MESSAGES - 2, 0);
77 T(30, REJECT_AFTER_MESSAGES + 1, EINVAL);
78 T(31, REJECT_AFTER_MESSAGES + 2, EINVAL);
79 T(32, REJECT_AFTER_MESSAGES - 2, EEXIST);
80 T(33, REJECT_AFTER_MESSAGES - 3, 0);
81 T(34, 0, ESTALE);
82
83 T_INIT;
84 for (i = 1; i <= COUNTER_WINDOW_SIZE; ++i)
85 T(35, i, 0);
86 T(36, 0, 0);
87 T(37, 0, EEXIST);
88
89 T_INIT;
90 for (i = 2; i <= COUNTER_WINDOW_SIZE + 1; ++i)
91 T(38, i, 0);
92 T(39, 1, 0);
93 T(40, 0, ESTALE);
94
95 T_INIT;
96 for (i = COUNTER_WINDOW_SIZE; i >= 0; --i)
97 T(41, i, 0);
98
99 T_INIT;
100 for (i = COUNTER_WINDOW_SIZE + 1; i >= 1; --i)
101 T(42, i, 0);
102 T(43, 0, ESTALE);
103
104 T_INIT;
105 for (i = COUNTER_WINDOW_SIZE; i >= 1; --i)
106 T(44, i, 0);
107 T(45, COUNTER_WINDOW_SIZE + 1, 0);
108 T(46, 0, ESTALE);
109
110 T_INIT;
111 for (i = COUNTER_WINDOW_SIZE; i >= 1; --i)
112 T(47, i, 0);
113 T(48, 0, 0);
114 T(49, COUNTER_WINDOW_SIZE + 1, 0);
115
116 kprintf("%s: %s\n", __func__, success ? "pass" : "FAIL");
117 return (success);
118 }
119
120 #undef T
121 #undef T_INIT
122 #undef T_LIM
123