ffi-hydrogen 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (160) hide show
  1. checksums.yaml +7 -0
  2. data/.gitignore +13 -0
  3. data/.rspec +3 -0
  4. data/.rubocop.yml +30 -0
  5. data/.travis.yml +10 -0
  6. data/Gemfile +6 -0
  7. data/LICENSE.txt +21 -0
  8. data/README.md +72 -0
  9. data/Rakefile +46 -0
  10. data/bench/both.rb +86 -0
  11. data/bench/encode.rb +57 -0
  12. data/bench/encrypt.rb +80 -0
  13. data/bench/init.rb +5 -0
  14. data/bin/console +14 -0
  15. data/bin/setup +8 -0
  16. data/ffi-hydrogen.gemspec +31 -0
  17. data/lib/ffi/hydrogen.rb +216 -0
  18. data/vendor/.clang-format +2 -0
  19. data/vendor/.gitignore +3 -0
  20. data/vendor/README.md +2 -0
  21. data/vendor/libhydrogen/.clang-format +95 -0
  22. data/vendor/libhydrogen/.gitignore +32 -0
  23. data/vendor/libhydrogen/.travis.yml +22 -0
  24. data/vendor/libhydrogen/LICENSE +18 -0
  25. data/vendor/libhydrogen/Makefile +61 -0
  26. data/vendor/libhydrogen/Makefile.arduino +51 -0
  27. data/vendor/libhydrogen/README.md +29 -0
  28. data/vendor/libhydrogen/hydrogen.c +18 -0
  29. data/vendor/libhydrogen/hydrogen.h +317 -0
  30. data/vendor/libhydrogen/impl/common.h +316 -0
  31. data/vendor/libhydrogen/impl/core.h +220 -0
  32. data/vendor/libhydrogen/impl/gimli-core/portable.h +39 -0
  33. data/vendor/libhydrogen/impl/gimli-core/sse2.h +97 -0
  34. data/vendor/libhydrogen/impl/gimli-core.h +25 -0
  35. data/vendor/libhydrogen/impl/hash.h +138 -0
  36. data/vendor/libhydrogen/impl/hydrogen_p.h +83 -0
  37. data/vendor/libhydrogen/impl/kdf.h +20 -0
  38. data/vendor/libhydrogen/impl/kx.h +441 -0
  39. data/vendor/libhydrogen/impl/pwhash.h +281 -0
  40. data/vendor/libhydrogen/impl/random.h +376 -0
  41. data/vendor/libhydrogen/impl/secretbox.h +236 -0
  42. data/vendor/libhydrogen/impl/sign.h +207 -0
  43. data/vendor/libhydrogen/impl/x25519.h +383 -0
  44. data/vendor/libhydrogen/library.properties +10 -0
  45. data/vendor/libhydrogen/logo.png +0 -0
  46. data/vendor/libhydrogen/tests/tests.c +431 -0
  47. data/vendor/main.c +140 -0
  48. data/vendor/stringencoders/.gitignore +25 -0
  49. data/vendor/stringencoders/.travis.yml +13 -0
  50. data/vendor/stringencoders/AUTHORS +1 -0
  51. data/vendor/stringencoders/COPYING +2 -0
  52. data/vendor/stringencoders/ChangeLog +170 -0
  53. data/vendor/stringencoders/Doxyfile +276 -0
  54. data/vendor/stringencoders/INSTALL +119 -0
  55. data/vendor/stringencoders/LICENSE +22 -0
  56. data/vendor/stringencoders/Makefile.am +3 -0
  57. data/vendor/stringencoders/NEWS +3 -0
  58. data/vendor/stringencoders/README +2 -0
  59. data/vendor/stringencoders/README.md +32 -0
  60. data/vendor/stringencoders/bootstrap.sh +3 -0
  61. data/vendor/stringencoders/configure-gcc-hardened.sh +16 -0
  62. data/vendor/stringencoders/configure.ac +44 -0
  63. data/vendor/stringencoders/doxy/footer.html +34 -0
  64. data/vendor/stringencoders/doxy/header.html +85 -0
  65. data/vendor/stringencoders/indent.sh +9 -0
  66. data/vendor/stringencoders/javascript/base64-speed.html +43 -0
  67. data/vendor/stringencoders/javascript/base64-test.html +209 -0
  68. data/vendor/stringencoders/javascript/base64.html +18 -0
  69. data/vendor/stringencoders/javascript/base64.js +176 -0
  70. data/vendor/stringencoders/javascript/qunit.css +119 -0
  71. data/vendor/stringencoders/javascript/qunit.js +1062 -0
  72. data/vendor/stringencoders/javascript/urlparse-test.html +367 -0
  73. data/vendor/stringencoders/javascript/urlparse.js +328 -0
  74. data/vendor/stringencoders/make-ci.sh +13 -0
  75. data/vendor/stringencoders/makerelease.sh +16 -0
  76. data/vendor/stringencoders/python/b85.py +176 -0
  77. data/vendor/stringencoders/src/Makefile.am +134 -0
  78. data/vendor/stringencoders/src/arraytoc.c +85 -0
  79. data/vendor/stringencoders/src/arraytoc.h +43 -0
  80. data/vendor/stringencoders/src/extern_c_begin.h +3 -0
  81. data/vendor/stringencoders/src/extern_c_end.h +3 -0
  82. data/vendor/stringencoders/src/html_named_entities_generator.py +203 -0
  83. data/vendor/stringencoders/src/modp_ascii.c +159 -0
  84. data/vendor/stringencoders/src/modp_ascii.h +162 -0
  85. data/vendor/stringencoders/src/modp_ascii_data.h +84 -0
  86. data/vendor/stringencoders/src/modp_ascii_gen.c +55 -0
  87. data/vendor/stringencoders/src/modp_b16.c +125 -0
  88. data/vendor/stringencoders/src/modp_b16.h +148 -0
  89. data/vendor/stringencoders/src/modp_b16_data.h +104 -0
  90. data/vendor/stringencoders/src/modp_b16_gen.c +65 -0
  91. data/vendor/stringencoders/src/modp_b2.c +69 -0
  92. data/vendor/stringencoders/src/modp_b2.h +130 -0
  93. data/vendor/stringencoders/src/modp_b2_data.h +44 -0
  94. data/vendor/stringencoders/src/modp_b2_gen.c +36 -0
  95. data/vendor/stringencoders/src/modp_b36.c +108 -0
  96. data/vendor/stringencoders/src/modp_b36.h +170 -0
  97. data/vendor/stringencoders/src/modp_b64.c +254 -0
  98. data/vendor/stringencoders/src/modp_b64.h +236 -0
  99. data/vendor/stringencoders/src/modp_b64_data.h +477 -0
  100. data/vendor/stringencoders/src/modp_b64_gen.c +168 -0
  101. data/vendor/stringencoders/src/modp_b64r.c +254 -0
  102. data/vendor/stringencoders/src/modp_b64r.h +242 -0
  103. data/vendor/stringencoders/src/modp_b64r_data.h +477 -0
  104. data/vendor/stringencoders/src/modp_b64w.c +254 -0
  105. data/vendor/stringencoders/src/modp_b64w.h +231 -0
  106. data/vendor/stringencoders/src/modp_b64w_data.h +477 -0
  107. data/vendor/stringencoders/src/modp_b85.c +109 -0
  108. data/vendor/stringencoders/src/modp_b85.h +171 -0
  109. data/vendor/stringencoders/src/modp_b85_data.h +36 -0
  110. data/vendor/stringencoders/src/modp_b85_gen.c +65 -0
  111. data/vendor/stringencoders/src/modp_bjavascript.c +65 -0
  112. data/vendor/stringencoders/src/modp_bjavascript.h +105 -0
  113. data/vendor/stringencoders/src/modp_bjavascript_data.h +84 -0
  114. data/vendor/stringencoders/src/modp_bjavascript_gen.c +58 -0
  115. data/vendor/stringencoders/src/modp_burl.c +228 -0
  116. data/vendor/stringencoders/src/modp_burl.h +259 -0
  117. data/vendor/stringencoders/src/modp_burl_data.h +136 -0
  118. data/vendor/stringencoders/src/modp_burl_gen.c +121 -0
  119. data/vendor/stringencoders/src/modp_html.c +128 -0
  120. data/vendor/stringencoders/src/modp_html.h +53 -0
  121. data/vendor/stringencoders/src/modp_html_named_entities.h +9910 -0
  122. data/vendor/stringencoders/src/modp_json.c +315 -0
  123. data/vendor/stringencoders/src/modp_json.h +103 -0
  124. data/vendor/stringencoders/src/modp_json_data.h +57 -0
  125. data/vendor/stringencoders/src/modp_json_gen.py +60 -0
  126. data/vendor/stringencoders/src/modp_mainpage.h +120 -0
  127. data/vendor/stringencoders/src/modp_numtoa.c +350 -0
  128. data/vendor/stringencoders/src/modp_numtoa.h +100 -0
  129. data/vendor/stringencoders/src/modp_qsiter.c +76 -0
  130. data/vendor/stringencoders/src/modp_qsiter.h +71 -0
  131. data/vendor/stringencoders/src/modp_stdint.h +43 -0
  132. data/vendor/stringencoders/src/modp_utf8.c +88 -0
  133. data/vendor/stringencoders/src/modp_utf8.h +38 -0
  134. data/vendor/stringencoders/src/modp_xml.c +311 -0
  135. data/vendor/stringencoders/src/modp_xml.h +166 -0
  136. data/vendor/stringencoders/src/stringencoders.pc +10 -0
  137. data/vendor/stringencoders/src/stringencoders.pc.in +10 -0
  138. data/vendor/stringencoders/test/Makefile.am +113 -0
  139. data/vendor/stringencoders/test/apr_base64.c +262 -0
  140. data/vendor/stringencoders/test/apr_base64.h +120 -0
  141. data/vendor/stringencoders/test/cxx_test.cc +482 -0
  142. data/vendor/stringencoders/test/minunit.h +82 -0
  143. data/vendor/stringencoders/test/modp_ascii_test.c +281 -0
  144. data/vendor/stringencoders/test/modp_b16_test.c +288 -0
  145. data/vendor/stringencoders/test/modp_b2_test.c +250 -0
  146. data/vendor/stringencoders/test/modp_b64_test.c +266 -0
  147. data/vendor/stringencoders/test/modp_b85_test.c +130 -0
  148. data/vendor/stringencoders/test/modp_bjavascript_test.c +137 -0
  149. data/vendor/stringencoders/test/modp_burl_test.c +423 -0
  150. data/vendor/stringencoders/test/modp_html_test.c +296 -0
  151. data/vendor/stringencoders/test/modp_json_test.c +336 -0
  152. data/vendor/stringencoders/test/modp_numtoa_test.c +545 -0
  153. data/vendor/stringencoders/test/modp_qsiter_test.c +280 -0
  154. data/vendor/stringencoders/test/modp_utf8_test.c +188 -0
  155. data/vendor/stringencoders/test/modp_xml_test.c +339 -0
  156. data/vendor/stringencoders/test/speedtest.c +241 -0
  157. data/vendor/stringencoders/test/speedtest_ascii.c +345 -0
  158. data/vendor/stringencoders/test/speedtest_msg.c +78 -0
  159. data/vendor/stringencoders/test/speedtest_numtoa.c +276 -0
  160. metadata +314 -0
@@ -0,0 +1,281 @@
1
+ /* we compile as C90 but use snprintf */
2
+ #define _ISOC99_SOURCE
3
+
4
+ #include "minunit.h"
5
+ #include <limits.h>
6
+ #include <stdio.h>
7
+ #include <stdlib.h>
8
+ #include <string.h>
9
+
10
+ #include "modp_ascii.h"
11
+
12
+ static char* testLowerSimple(void)
13
+ {
14
+ const char* case4 = "ABCD abcd1234";
15
+ const char* case3 = "ABCD abcd123";
16
+ const char* case2 = "ABCD abcd12";
17
+ const char* case1 = "ABCD abcd1";
18
+
19
+ char orig[100];
20
+ strcpy(orig, case4);
21
+ modp_tolower(orig, strlen(orig));
22
+ mu_assert_str_equals("abcd abcd1234", orig);
23
+
24
+ strcpy(orig, case3);
25
+ modp_tolower(orig, strlen(orig));
26
+ mu_assert_str_equals("abcd abcd123", orig);
27
+
28
+ strcpy(orig, case2);
29
+ modp_tolower(orig, strlen(orig));
30
+ mu_assert_str_equals("abcd abcd12", orig);
31
+
32
+ strcpy(orig, case1);
33
+ modp_tolower(orig, strlen(orig));
34
+ mu_assert_str_equals("abcd abcd1", orig);
35
+
36
+ return 0;
37
+ }
38
+
39
+ /**
40
+ * Test possible overflow conditions
41
+ *
42
+ */
43
+ static char* testUpperHighBits(void)
44
+ {
45
+ char obuf[5];
46
+ char expected[5];
47
+ char buf[5];
48
+
49
+ buf[0] = 'z';
50
+ buf[1] = (char)0xff;
51
+ buf[2] = (char)0xff;
52
+ buf[3] = (char)0xff;
53
+ buf[4] = '\0';
54
+
55
+ expected[0] = 'Z';
56
+ expected[1] = (char)0xff;
57
+ expected[2] = (char)0xff;
58
+ expected[3] = (char)0xff;
59
+ expected[4] = '\0';
60
+
61
+ memset(obuf, 0, sizeof(obuf));
62
+ modp_toupper_copy(obuf, buf, strlen(buf));
63
+ mu_assert_str_equals(expected, obuf);
64
+
65
+ buf[0] = (char)0xff;
66
+ buf[1] = (char)0xff;
67
+ buf[2] = (char)0xff;
68
+ buf[3] = 'z';
69
+ buf[4] = '\0';
70
+
71
+ expected[0] = (char)0xff;
72
+ expected[1] = (char)0xff;
73
+ expected[2] = (char)0xff;
74
+ expected[3] = 'Z';
75
+ expected[4] = '\0';
76
+ memset(obuf, 0, sizeof(obuf));
77
+ modp_toupper_copy(obuf, buf, strlen(buf));
78
+ mu_assert_str_equals(expected, obuf);
79
+
80
+ return 0;
81
+ }
82
+
83
+ static char* testUpperSimple(void)
84
+ {
85
+ const char* case4 = "ABCD abcd1234";
86
+ const char* case3 = "ABCD abcd123";
87
+ const char* case2 = "ABCD abcd12";
88
+ const char* case1 = "ABCD abcd1";
89
+
90
+ char orig[100];
91
+ strcpy(orig, case4);
92
+ modp_toupper(orig, strlen(orig));
93
+ mu_assert_str_equals("ABCD ABCD1234", orig);
94
+
95
+ strcpy(orig, case3);
96
+ modp_toupper(orig, strlen(orig));
97
+ mu_assert_str_equals("ABCD ABCD123", orig);
98
+
99
+ strcpy(orig, case2);
100
+ modp_toupper(orig, strlen(orig));
101
+ mu_assert_str_equals("ABCD ABCD12", orig);
102
+
103
+ strcpy(orig, case1);
104
+ modp_toupper(orig, strlen(orig));
105
+ mu_assert_str_equals("ABCD ABCD1", orig);
106
+
107
+ return 0;
108
+ }
109
+
110
+ static char* testPrintSimple(void)
111
+ {
112
+ const char* case4 = "ABCD abcd\t\t\t\t";
113
+ const char* case3 = "ABCD abcd\t\t\t";
114
+ const char* case2 = "ABCD abcd\t\t";
115
+ const char* case1 = "ABCD abcd\t";
116
+
117
+ char orig[100];
118
+ strcpy(orig, case4);
119
+ modp_toprint(orig, strlen(orig));
120
+ mu_assert_str_equals("ABCD abcd????", orig);
121
+
122
+ strcpy(orig, case3);
123
+ modp_toprint(orig, strlen(orig));
124
+ mu_assert_str_equals("ABCD abcd???", orig);
125
+
126
+ strcpy(orig, case2);
127
+ modp_toprint(orig, strlen(orig));
128
+ mu_assert_str_equals("ABCD abcd??", orig);
129
+
130
+ strcpy(orig, case1);
131
+ modp_toprint(orig, strlen(orig));
132
+ mu_assert_str_equals("ABCD abcd?", orig);
133
+
134
+ return 0;
135
+ }
136
+
137
+ static char* testToUpper(void)
138
+ {
139
+ int i;
140
+ char buf1[300];
141
+ char expected[300];
142
+ for (i = 0; i < 256; ++i) {
143
+ buf1[i] = (char)i;
144
+ expected[i] = (char)((i >= 'a' && i <= 'z') ? i - 32 : i);
145
+ }
146
+ modp_toupper(buf1, (size_t)256);
147
+ mu_assert(memcmp(expected, buf1, (size_t)256) == 0);
148
+
149
+ /* do other sizes to check */
150
+ for (i = 0; i < 256; ++i)
151
+ buf1[i] = (char)i;
152
+ modp_toupper(buf1, (size_t)255);
153
+ mu_assert(memcmp(expected, buf1, (size_t)255) == 0);
154
+
155
+ for (i = 0; i < 256; ++i)
156
+ buf1[i] = (char)i;
157
+ modp_toupper(buf1, (size_t)254);
158
+ mu_assert(memcmp(expected, buf1, (size_t)254) == 0);
159
+
160
+ for (i = 0; i < 256; ++i)
161
+ buf1[i] = (char)i;
162
+ modp_toupper(buf1, (size_t)253);
163
+ mu_assert(memcmp(expected, buf1, (size_t)253) == 0);
164
+ return 0;
165
+ }
166
+
167
+ static char* testToLower(void)
168
+ {
169
+ int i;
170
+ char buf1[300];
171
+ char expected[300];
172
+ for (i = 0; i < 256; ++i) {
173
+ buf1[i] = (char)i;
174
+ expected[i] = (char)((i >= 'A' && i <= 'Z') ? i + 32 : i);
175
+ }
176
+
177
+ modp_tolower(buf1, (size_t)256);
178
+ mu_assert(memcmp(expected, buf1, (size_t)256) == 0);
179
+
180
+ /* do other sizes to check */
181
+ for (i = 0; i < 256; ++i)
182
+ buf1[i] = (char)i;
183
+ modp_tolower(buf1, (size_t)255);
184
+ mu_assert(memcmp(expected, buf1, (size_t)255) == 0);
185
+
186
+ for (i = 0; i < 256; ++i)
187
+ buf1[i] = (char)i;
188
+ modp_tolower(buf1, (size_t)254);
189
+ mu_assert(memcmp(expected, buf1, (size_t)254) == 0);
190
+
191
+ for (i = 0; i < 256; ++i)
192
+ buf1[i] = (char)i;
193
+ modp_tolower(buf1, (size_t)253);
194
+ mu_assert(memcmp(expected, buf1, (size_t)253) == 0);
195
+ return 0;
196
+ }
197
+
198
+ static char* testToUpperCopy(void)
199
+ {
200
+ int i;
201
+ char buf1[300];
202
+ char output[300];
203
+ char expected[300];
204
+ for (i = 0; i < 256; ++i) {
205
+ buf1[i] = (char)i;
206
+ output[i] = 0;
207
+ expected[i] = (char)((i >= 'a' && i <= 'z') ? i - 32 : i);
208
+ }
209
+ buf1[i] = 0;
210
+ output[i] = 0;
211
+
212
+ modp_toupper_copy(output, buf1, (size_t)256);
213
+ mu_assert(memcmp(expected, output, (size_t)256) == 0);
214
+
215
+ /* do other sizes to check */
216
+ for (i = 0; i < 256; ++i)
217
+ output[i] = 0;
218
+ modp_toupper_copy(output, buf1, (size_t)255);
219
+ mu_assert(memcmp(expected, output, (size_t)255) == 0);
220
+
221
+ for (i = 0; i < 256; ++i)
222
+ output[i] = 0;
223
+ modp_toupper_copy(output, buf1, (size_t)254);
224
+ mu_assert(memcmp(expected, output, (size_t)254) == 0);
225
+
226
+ for (i = 0; i < 256; ++i)
227
+ output[i] = 0;
228
+ modp_toupper_copy(output, buf1, (size_t)253);
229
+ mu_assert(memcmp(expected, output, (size_t)253) == 0);
230
+ return 0;
231
+ }
232
+
233
+ static char* testToLowerCopy(void)
234
+ {
235
+ int i;
236
+ char buf1[300];
237
+ char output[300];
238
+ char expected[300];
239
+ for (i = 0; i < 256; ++i) {
240
+ buf1[i] = (char)i;
241
+ output[i] = 0;
242
+ expected[i] = (char)((i >= 'A' && i <= 'Z') ? i + 32 : i);
243
+ }
244
+ buf1[i] = 0;
245
+ output[i] = 0;
246
+
247
+ modp_tolower_copy(output, buf1, (size_t)256);
248
+ mu_assert(memcmp(expected, output, (size_t)256) == 0);
249
+
250
+ /* do other sizes to check */
251
+ for (i = 0; i < 256; ++i)
252
+ output[i] = 0;
253
+ modp_tolower_copy(output, buf1, (size_t)255);
254
+ mu_assert(memcmp(expected, output, (size_t)255) == 0);
255
+
256
+ for (i = 0; i < 256; ++i)
257
+ output[i] = 0;
258
+ modp_tolower_copy(output, buf1, (size_t)254);
259
+ mu_assert(memcmp(expected, output, (size_t)254) == 0);
260
+
261
+ for (i = 0; i < 256; ++i)
262
+ output[i] = 0;
263
+ modp_tolower_copy(output, buf1, (size_t)253);
264
+ mu_assert(memcmp(expected, output, (size_t)253) == 0);
265
+ return 0;
266
+ }
267
+
268
+ static char* all_tests(void)
269
+ {
270
+ mu_run_test(testUpperHighBits);
271
+ mu_run_test(testUpperSimple);
272
+ mu_run_test(testLowerSimple);
273
+ mu_run_test(testPrintSimple);
274
+ mu_run_test(testToUpperCopy);
275
+ mu_run_test(testToLowerCopy);
276
+ mu_run_test(testToUpper);
277
+ mu_run_test(testToLower);
278
+ return 0;
279
+ }
280
+
281
+ UNITTESTS
@@ -0,0 +1,288 @@
1
+ /* we compile as C90 but use snprintf */
2
+ #define _ISOC99_SOURCE
3
+
4
+ #include <stdio.h>
5
+ #include <stdlib.h>
6
+ #include <string.h>
7
+
8
+ #include "minunit.h"
9
+
10
+ #include "modp_b16.h"
11
+
12
+ static char* testEndian(void)
13
+ {
14
+ /* this test that "0001" is "00000001" */
15
+ char buf[100];
16
+ char result[10];
17
+ char endian[] = { (char)0, (char)0, (char)0, (char)1 };
18
+ size_t d = modp_b16_encode(buf, endian, (size_t)4);
19
+ mu_assert_int_equals(8, d);
20
+ mu_assert_str_equals("00000001", buf);
21
+ mu_assert_int_equals('0', buf[0]);
22
+ mu_assert_int_equals('0', buf[1]);
23
+ mu_assert_int_equals('0', buf[2]);
24
+ mu_assert_int_equals('0', buf[3]);
25
+ mu_assert_int_equals('0', buf[4]);
26
+ mu_assert_int_equals('0', buf[5]);
27
+ mu_assert_int_equals('0', buf[6]);
28
+ mu_assert_int_equals('1', buf[7]);
29
+
30
+ memset(result, 255, sizeof(result));
31
+ d = modp_b16_decode(result, buf, (size_t)8);
32
+ mu_assert_int_equals(4, d);
33
+ mu_assert_int_equals(endian[0], result[0]);
34
+ mu_assert_int_equals(endian[1], result[1]);
35
+ mu_assert_int_equals(endian[2], result[2]);
36
+ mu_assert_int_equals(endian[3], result[3]);
37
+
38
+ return 0;
39
+ }
40
+
41
+ static char* testEncodeDecode(void)
42
+ {
43
+ /* 2 bytes == 4 bytes out */
44
+ char ibuf[2];
45
+ char obuf[5];
46
+ char rbuf[4];
47
+ char msg[100]; /* for test messages output */
48
+ msg[0] = 0; /* make msg an empty string */
49
+ unsigned int i, j;
50
+ size_t d;
51
+
52
+ for (i = 0; i < 256; ++i) {
53
+ for (j = 0; j < 256; ++j) {
54
+ /* comment this out.. it really slows down the test */
55
+ sprintf(msg, "(i,j) = (%u,%u):", i, j);
56
+ ibuf[0] = (char)((unsigned char)i);
57
+ ibuf[1] = (char)((unsigned char)j);
58
+
59
+ memset(obuf, 0, sizeof(obuf));
60
+ d = modp_b16_encode(obuf, ibuf, (size_t)2);
61
+ mu_assert_int_equals_msg(msg, 4, d);
62
+ d = modp_b16_decode(rbuf, obuf, d);
63
+ mu_assert_int_equals_msg(msg, 2, d);
64
+ mu_assert_int_equals_msg(msg, ibuf[0], rbuf[0]);
65
+ mu_assert_int_equals_msg(msg, ibuf[1], rbuf[1]);
66
+ }
67
+ }
68
+
69
+ return 0;
70
+ }
71
+
72
+ static char* testOddDecode(void)
73
+ {
74
+ char obuf[100];
75
+ char ibuf[100];
76
+
77
+ memset(obuf, 0, sizeof(obuf));
78
+ memset(ibuf, 0, sizeof(ibuf));
79
+
80
+ /* Test Odd Number of Input bytes
81
+ * Should be error
82
+ */
83
+ obuf[0] = 1;
84
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, (size_t)1));
85
+ mu_assert_int_equals(1, obuf[0]);
86
+
87
+ obuf[0] = 1;
88
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, (size_t)3));
89
+ mu_assert_int_equals(1, obuf[0]);
90
+
91
+ obuf[0] = 1;
92
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, (size_t)7));
93
+ mu_assert_int_equals(1, obuf[0]);
94
+
95
+ return 0;
96
+ }
97
+
98
+ /** \brief test input that is a multiple of 2 (special case in code)
99
+ */
100
+ static char* testDecodeMutlipleOf2(void)
101
+ {
102
+ char obuf[100];
103
+ memset(obuf, 0xff, sizeof(obuf));
104
+
105
+ mu_assert_int_equals(1, modp_b16_decode(obuf, "01", (size_t)2));
106
+ mu_assert_int_equals(1, obuf[0]);
107
+
108
+ return 0;
109
+ }
110
+
111
+ static char* testOddEncode(void)
112
+ {
113
+ char obuf[100];
114
+ char ibuf[100];
115
+
116
+ /* oddball 1 char. */
117
+ ibuf[0] = 1;
118
+ mu_assert_int_equals(2, modp_b16_encode(obuf, ibuf, (size_t)1));
119
+ mu_assert_int_equals(obuf[0], '0');
120
+ mu_assert_int_equals(obuf[1], '1');
121
+
122
+ /* oddball 2 char. */
123
+ ibuf[0] = 0;
124
+ ibuf[1] = 1;
125
+ mu_assert_int_equals(4, modp_b16_encode(obuf, ibuf, (size_t)2));
126
+ mu_assert_int_equals(obuf[0], '0');
127
+ mu_assert_int_equals(obuf[1], '0');
128
+ mu_assert_int_equals(obuf[2], '0');
129
+ mu_assert_int_equals(obuf[3], '1');
130
+
131
+ /* oddball 1 char. */
132
+ ibuf[0] = 0;
133
+ ibuf[1] = 0;
134
+ ibuf[2] = 1;
135
+ mu_assert_int_equals(6, modp_b16_encode(obuf, ibuf, (size_t)3));
136
+ mu_assert_int_equals(obuf[0], '0');
137
+ mu_assert_int_equals(obuf[1], '0');
138
+ mu_assert_int_equals(obuf[2], '0');
139
+ mu_assert_int_equals(obuf[3], '0');
140
+ mu_assert_int_equals(obuf[4], '0');
141
+ mu_assert_int_equals(obuf[5], '1');
142
+
143
+ return 0;
144
+ }
145
+
146
+ static char* testBadDecode(void)
147
+ {
148
+ char obuf[100];
149
+ char ibuf[100];
150
+
151
+ memset(obuf, 0, sizeof(obuf));
152
+ memset(ibuf, 0, sizeof(ibuf));
153
+
154
+ /* we are testing input of 2 bytes, 4 bytes
155
+ * to test all possible screwups
156
+ */
157
+ strcpy(ibuf, "X1");
158
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
159
+ strcpy(ibuf, "1X");
160
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
161
+ strcpy(ibuf, "XX");
162
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
163
+
164
+ /* 1 bad char */
165
+ strcpy(ibuf, "X111");
166
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
167
+ strcpy(ibuf, "1X11");
168
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
169
+ strcpy(ibuf, "11X1");
170
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
171
+ strcpy(ibuf, "111X");
172
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
173
+
174
+ /* 2 bad chars */
175
+ strcpy(ibuf, "XX11");
176
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
177
+ strcpy(ibuf, "1XX1");
178
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
179
+ strcpy(ibuf, "11XX");
180
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
181
+ strcpy(ibuf, "X1X1");
182
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
183
+ strcpy(ibuf, "1X1X");
184
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
185
+ strcpy(ibuf, "X11X");
186
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
187
+
188
+ /* 3 bad chars */
189
+ strcpy(ibuf, "1XXX");
190
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
191
+ strcpy(ibuf, "X1XX");
192
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
193
+ strcpy(ibuf, "XX1X");
194
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
195
+ strcpy(ibuf, "XXX1");
196
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
197
+
198
+ /* 4 bad chars */
199
+ strcpy(ibuf, "XXXX");
200
+ mu_assert_int_equals(-1, modp_b16_decode(obuf, ibuf, strlen(ibuf)));
201
+
202
+ return 0;
203
+ }
204
+
205
+ static char* testEmptyInput(void)
206
+ {
207
+ char obuf[100];
208
+ char ibuf[100];
209
+
210
+ memset(obuf, 0, sizeof(obuf));
211
+ memset(ibuf, 0, sizeof(ibuf));
212
+
213
+ /* encode 0 bytes, get a null byte back */
214
+ obuf[0] = 1;
215
+ mu_assert_int_equals(0, modp_b16_encode(obuf, ibuf, (size_t)0));
216
+ mu_assert_int_equals(0, obuf[0]);
217
+
218
+ /* decode 0 bytes, buffer is untouched */
219
+ obuf[0] = 1;
220
+ mu_assert_int_equals(0, modp_b16_decode(obuf, ibuf, (size_t)0));
221
+ mu_assert_int_equals(1, obuf[0]);
222
+
223
+ return 0;
224
+ }
225
+
226
+ static char* testLengths(void)
227
+ {
228
+ /* Decode Len
229
+ * 2 input -> 1 output. No added NULL byte
230
+ */
231
+ mu_assert_int_equals(0, modp_b16_decode_len(0));
232
+ mu_assert_int_equals(1, modp_b16_decode_len(1));
233
+ mu_assert_int_equals(1, modp_b16_decode_len(2));
234
+ mu_assert_int_equals(2, modp_b16_decode_len(3));
235
+ mu_assert_int_equals(2, modp_b16_decode_len(4));
236
+
237
+ /* Encode Len
238
+ * 1 byte -> 2 output + 1 null byte
239
+ */
240
+ mu_assert_int_equals(1, modp_b16_encode_len(0));
241
+ mu_assert_int_equals(3, modp_b16_encode_len(1));
242
+ mu_assert_int_equals(5, modp_b16_encode_len(2));
243
+ mu_assert_int_equals(7, modp_b16_encode_len(3));
244
+ mu_assert_int_equals(9, modp_b16_encode_len(4));
245
+
246
+ return 0;
247
+ }
248
+
249
+ static char* testValgrind(void)
250
+ {
251
+ /*
252
+ * an input of 3 chars, means output is 3*2+1 = 7 chars
253
+ * However, the code works on output in values of 4bytes
254
+ * so valgrind complains about use stomping on memory
255
+ */
256
+ const size_t buflen1 = 3;
257
+ const size_t buflen2 = 7;
258
+ char* ibuf = (char*)malloc(buflen1);
259
+ ibuf[0] = '1';
260
+ ibuf[1] = '2';
261
+ ibuf[2] = '3';
262
+ char* obuf = (char*)malloc(buflen2);
263
+
264
+ memset(obuf, 0, buflen1);
265
+ size_t d = modp_b16_encode(obuf, ibuf, buflen1);
266
+ free(ibuf);
267
+ free(obuf);
268
+
269
+ mu_assert_int_equals(6, d);
270
+ return 0;
271
+ }
272
+
273
+ static char* all_tests(void)
274
+ {
275
+ mu_run_test(testEndian);
276
+ mu_run_test(testEncodeDecode);
277
+ mu_run_test(testLengths);
278
+ mu_run_test(testEmptyInput);
279
+ mu_run_test(testBadDecode);
280
+ mu_run_test(testOddDecode);
281
+ mu_run_test(testOddEncode);
282
+ mu_run_test(testDecodeMutlipleOf2);
283
+ mu_run_test(testValgrind);
284
+
285
+ return 0;
286
+ }
287
+
288
+ UNITTESTS