test.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918
  1. /* Copyright 2001,2002,2003 Roger Dingledine. */
  2. /* See LICENSE for licensing information */
  3. /* $Id$ */
  4. #include <stdio.h>
  5. #ifdef HAVE_FCNTL_H
  6. #include <fcntl.h>
  7. #endif
  8. #ifdef MS_WINDOWS
  9. /* For mkdir() */
  10. #include <direct.h>
  11. #endif
  12. #include "or.h"
  13. #include "../common/test.h"
  14. extern or_options_t options;
  15. int have_failed = 0;
  16. /* These functions are file-local, but are exposed so we can test. */
  17. int router_get_routerlist_from_directory_impl(
  18. const char *s, routerlist_t **dest, crypto_pk_env_t *pkey);
  19. void add_fingerprint_to_dir(const char *nickname, const char *fp);
  20. void
  21. dump_hex(char *s, int len)
  22. {
  23. static const char TABLE[] = "0123456789ABCDEF";
  24. unsigned char *d = s;
  25. int i, j, nyb;
  26. for(i=0;i<len;++i) {
  27. for (j=1;j>=0;--j) {
  28. nyb = (((int) d[i]) >> (j*4)) & 0x0f;
  29. assert(0<=nyb && nyb <=15);
  30. putchar(TABLE[nyb]);
  31. }
  32. }
  33. }
  34. void
  35. setup_directory() {
  36. char buf[256];
  37. int r;
  38. sprintf(buf, "/tmp/tor_test");
  39. #ifdef _MSC_VER
  40. r = mkdir(buf);
  41. #else
  42. r = mkdir(buf, 0700);
  43. #endif
  44. if (r && errno != EEXIST)
  45. fprintf(stderr, "Can't create directory %s", buf);
  46. }
  47. void
  48. test_buffers() {
  49. #define MAX_BUF_SIZE 1024*1024
  50. char str[256];
  51. char str2[256];
  52. buf_t *buf;
  53. buf_t *buf2;
  54. int s, i, j, eof;
  55. /****
  56. * buf_new
  57. ****/
  58. if (!(buf = buf_new()))
  59. test_fail();
  60. test_eq(buf_capacity(buf), 512*1024);
  61. test_eq(buf_datalen(buf), 0);
  62. /****
  63. * read_to_buf
  64. ****/
  65. s = open("/tmp/tor_test/data", O_WRONLY|O_CREAT|O_TRUNC, 0600);
  66. for (j=0;j<256;++j) {
  67. str[j] = (char)j;
  68. }
  69. write(s, str, 256);
  70. close(s);
  71. s = open("/tmp/tor_test/data", O_RDONLY, 0);
  72. eof = 0;
  73. i = read_to_buf(s, 10, buf, &eof);
  74. test_eq(buf_capacity(buf), 512*1024);
  75. test_eq(buf_datalen(buf), 10);
  76. test_eq(eof, 0);
  77. test_eq(i, 10);
  78. test_memeq(str, (char*)_buf_peek_raw_buffer(buf), 10);
  79. /* Test reading 0 bytes. */
  80. i = read_to_buf(s, 0, buf, &eof);
  81. test_eq(buf_capacity(buf), 512*1024);
  82. test_eq(buf_datalen(buf), 10);
  83. test_eq(eof, 0);
  84. test_eq(i, 0);
  85. /* Now test when buffer is filled exactly. */
  86. buf2 = buf_new_with_capacity(6);
  87. i = read_to_buf(s, 6, buf2, &eof);
  88. test_eq(buf_capacity(buf2), 6);
  89. test_eq(buf_datalen(buf2), 6);
  90. test_eq(eof, 0);
  91. test_eq(i, 6);
  92. test_memeq(str+10, (char*)_buf_peek_raw_buffer(buf2), 6);
  93. buf_free(buf2);
  94. /* Now test when buffer is filled with more data to read. */
  95. buf2 = buf_new_with_capacity(32);
  96. i = read_to_buf(s, 128, buf2, &eof);
  97. test_eq(buf_capacity(buf2), 128);
  98. test_eq(buf_datalen(buf2), 32);
  99. test_eq(eof, 0);
  100. test_eq(i, 32);
  101. buf_free(buf2);
  102. /* Now read to eof. */
  103. test_assert(buf_capacity(buf) > 256);
  104. i = read_to_buf(s, 1024, buf, &eof);
  105. test_eq(i, (256-32-10-6));
  106. test_eq(buf_capacity(buf), MAX_BUF_SIZE);
  107. test_eq(buf_datalen(buf), 256-6-32);
  108. test_memeq(str, (char*)_buf_peek_raw_buffer(buf), 10); /* XXX Check rest. */
  109. test_eq(eof, 0);
  110. i = read_to_buf(s, 1024, buf, &eof);
  111. test_eq(i, 0);
  112. test_eq(buf_capacity(buf), MAX_BUF_SIZE);
  113. test_eq(buf_datalen(buf), 256-6-32);
  114. test_eq(eof, 1);
  115. close(s);
  116. /****
  117. * find_on_inbuf
  118. ****/
  119. buf_free(buf);
  120. buf = buf_new();
  121. s = open("/tmp/tor_test/data", O_RDONLY, 0);
  122. eof = 0;
  123. i = read_to_buf(s, 1024, buf, &eof);
  124. test_eq(256, i);
  125. close(s);
  126. test_eq(((int)'d') + 1, find_on_inbuf("abcd", 4, buf));
  127. test_eq(-1, find_on_inbuf("xyzzy", 5, buf));
  128. /* Make sure we don't look off the end of the buffef */
  129. ((char*)_buf_peek_raw_buffer(buf))[256] = 'A';
  130. ((char*)_buf_peek_raw_buffer(buf))[257] = 'X';
  131. test_eq(-1, find_on_inbuf("\xff" "A", 2, buf));
  132. test_eq(-1, find_on_inbuf("AX", 2, buf));
  133. /* Make sure we use the string length */
  134. test_eq(((int)'d')+1, find_on_inbuf("abcdX", 4, buf));
  135. /****
  136. * fetch_from_buf
  137. ****/
  138. memset(str2, 255, 256);
  139. test_eq(246, fetch_from_buf(str2, 10, buf));
  140. test_memeq(str2, str, 10);
  141. test_memeq(str+10,(char*)_buf_peek_raw_buffer(buf),246);
  142. test_eq(buf_datalen(buf),246);
  143. test_eq(0, fetch_from_buf(str2, 246, buf));
  144. test_memeq(str2, str+10, 246);
  145. test_eq(buf_capacity(buf),MAX_BUF_SIZE);
  146. test_eq(buf_datalen(buf),0);
  147. /****
  148. * write_to_buf
  149. ****/
  150. memset((char *)_buf_peek_raw_buffer(buf), (int)'-', 256);
  151. i = write_to_buf("Hello world", 11, buf);
  152. test_eq(i, 11);
  153. test_eq(buf_datalen(buf), 11);
  154. test_memeq((char*)_buf_peek_raw_buffer(buf), "Hello world", 11);
  155. i = write_to_buf("XYZZY", 5, buf);
  156. test_eq(i, 16);
  157. test_eq(buf_datalen(buf), 16);
  158. test_memeq((char*)_buf_peek_raw_buffer(buf), "Hello worldXYZZY", 16);
  159. /* Test when buffer is overfull. */
  160. #if 0
  161. buflen = 18;
  162. test_eq(-1, write_to_buf("This string will not fit.", 25,
  163. &buf, &buflen, &buf_datalen));
  164. test_eq(buf_datalen, 16);
  165. test_memeq(buf, "Hello worldXYZZY--", 18);
  166. buflen = MAX_BUF_SIZE;
  167. #endif
  168. /****
  169. * flush_buf
  170. ****/
  171. /* XXXX Needs tests. */
  172. buf_free(buf);
  173. }
  174. void
  175. test_crypto_dh()
  176. {
  177. crypto_dh_env_t *dh1, *dh2;
  178. char p1[CRYPTO_DH_SIZE];
  179. char p2[CRYPTO_DH_SIZE];
  180. char s1[CRYPTO_DH_SIZE];
  181. char s2[CRYPTO_DH_SIZE];
  182. int s1len, s2len;
  183. dh1 = crypto_dh_new();
  184. dh2 = crypto_dh_new();
  185. test_eq(crypto_dh_get_bytes(dh1), CRYPTO_DH_SIZE);
  186. test_eq(crypto_dh_get_bytes(dh2), CRYPTO_DH_SIZE);
  187. memset(p1, 0, CRYPTO_DH_SIZE);
  188. memset(p2, 0, CRYPTO_DH_SIZE);
  189. test_memeq(p1, p2, CRYPTO_DH_SIZE);
  190. test_assert(! crypto_dh_get_public(dh1, p1, CRYPTO_DH_SIZE));
  191. test_memneq(p1, p2, CRYPTO_DH_SIZE);
  192. test_assert(! crypto_dh_get_public(dh2, p2, CRYPTO_DH_SIZE));
  193. test_memneq(p1, p2, CRYPTO_DH_SIZE);
  194. memset(s1, 0, CRYPTO_DH_SIZE);
  195. memset(s2, 0xFF, CRYPTO_DH_SIZE);
  196. s1len = crypto_dh_compute_secret(dh1, p2, CRYPTO_DH_SIZE, s1, 50);
  197. s2len = crypto_dh_compute_secret(dh2, p1, CRYPTO_DH_SIZE, s2, 50);
  198. test_assert(s1len > 0);
  199. test_eq(s1len, s2len);
  200. test_memeq(s1, s2, s1len);
  201. crypto_dh_free(dh1);
  202. crypto_dh_free(dh2);
  203. }
  204. void
  205. test_crypto()
  206. {
  207. crypto_cipher_env_t *env1, *env2;
  208. crypto_pk_env_t *pk1, *pk2;
  209. char *data1, *data2, *data3, *cp;
  210. FILE *f;
  211. int i, j, p, len;
  212. data1 = tor_malloc(1024);
  213. data2 = tor_malloc(1024);
  214. data3 = tor_malloc(1024);
  215. test_assert(data1 && data2 && data3);
  216. /* Try out RNG. */
  217. test_assert(! crypto_seed_rng());
  218. crypto_rand(100, data1);
  219. crypto_rand(100, data2);
  220. test_memneq(data1,data2,100);
  221. #if 0
  222. /* Try out identity ciphers. */
  223. env1 = crypto_new_cipher_env(CRYPTO_CIPHER_IDENTITY);
  224. test_neq(env1, 0);
  225. test_eq(crypto_cipher_generate_key(env1), 0);
  226. test_eq(crypto_cipher_set_iv(env1, ""), 0);
  227. test_eq(crypto_cipher_encrypt_init_cipher(env1), 0);
  228. for(i = 0; i < 1024; ++i) {
  229. data1[i] = (char) i*73;
  230. }
  231. crypto_cipher_encrypt(env1, data1, 1024, data2);
  232. test_memeq(data1, data2, 1024);
  233. crypto_free_cipher_env(env1);
  234. #endif
  235. /* Now, test encryption and decryption with stream cipher. */
  236. data1[0]='\0';
  237. for(i = 1023; i>0; i -= 35)
  238. strncat(data1, "Now is the time for all good onions", i);
  239. memset(data2, 0, 1024);
  240. memset(data3, 0, 1024);
  241. env1 = crypto_new_cipher_env();
  242. test_neq(env1, 0);
  243. env2 = crypto_new_cipher_env();
  244. test_neq(env2, 0);
  245. j = crypto_cipher_generate_key(env1);
  246. crypto_cipher_set_key(env2, crypto_cipher_get_key(env1));
  247. crypto_cipher_set_iv(env1, "12345678901234567890");
  248. crypto_cipher_set_iv(env2, "12345678901234567890");
  249. crypto_cipher_encrypt_init_cipher(env1);
  250. crypto_cipher_decrypt_init_cipher(env2);
  251. /* Try encrypting 512 chars. */
  252. crypto_cipher_encrypt(env1, data1, 512, data2);
  253. crypto_cipher_decrypt(env2, data2, 512, data3);
  254. test_memeq(data1, data3, 512);
  255. test_memneq(data1, data2, 512);
  256. /* Now encrypt 1 at a time, and get 1 at a time. */
  257. for (j = 512; j < 560; ++j) {
  258. crypto_cipher_encrypt(env1, data1+j, 1, data2+j);
  259. }
  260. for (j = 512; j < 560; ++j) {
  261. crypto_cipher_decrypt(env2, data2+j, 1, data3+j);
  262. }
  263. test_memeq(data1, data3, 560);
  264. /* Now encrypt 3 at a time, and get 5 at a time. */
  265. for (j = 560; j < 1024-5; j += 3) {
  266. crypto_cipher_encrypt(env1, data1+j, 3, data2+j);
  267. }
  268. for (j = 560; j < 1024-5; j += 5) {
  269. crypto_cipher_decrypt(env2, data2+j, 5, data3+j);
  270. }
  271. test_memeq(data1, data3, 1024-5);
  272. /* Now make sure that when we encrypt with different chunk sizes, we get
  273. the same results. */
  274. crypto_free_cipher_env(env2);
  275. memset(data3, 0, 1024);
  276. env2 = crypto_new_cipher_env();
  277. test_neq(env2, 0);
  278. crypto_cipher_set_key(env2, crypto_cipher_get_key(env1));
  279. crypto_cipher_set_iv(env2, "12345678901234567890");
  280. crypto_cipher_encrypt_init_cipher(env2);
  281. for (j = 0; j < 1024-16; j += 17) {
  282. crypto_cipher_encrypt(env2, data1+j, 17, data3+j);
  283. }
  284. for (j= 0; j < 1024-16; ++j) {
  285. if (data2[j] != data3[j]) {
  286. printf("%d: %d\t%d\n", j, (int) data2[j], (int) data3[j]);
  287. }
  288. }
  289. test_memeq(data2, data3, 1024-16);
  290. crypto_free_cipher_env(env1);
  291. crypto_free_cipher_env(env2);
  292. /* Test vectors for stream ciphers. */
  293. /* XXXX Look up some test vectors for the ciphers and make sure we match. */
  294. /* Test SHA-1 with a test vector from the specification. */
  295. i = crypto_digest("abc", 3, data1);
  296. test_memeq(data1,
  297. "\xA9\x99\x3E\x36\x47\x06\x81\x6A\xBA\x3E\x25\x71\x78"
  298. "\x50\xC2\x6C\x9C\xD0\xD8\x9D", 20);
  299. /* Public-key ciphers */
  300. pk1 = crypto_new_pk_env();
  301. pk2 = crypto_new_pk_env();
  302. test_assert(pk1 && pk2);
  303. test_assert(! crypto_pk_generate_key(pk1));
  304. test_assert(! crypto_pk_write_public_key_to_string(pk1, &cp, &i));
  305. test_assert(! crypto_pk_read_public_key_from_string(pk2, cp, i));
  306. test_eq(0, crypto_pk_cmp_keys(pk1, pk2));
  307. test_eq(128, crypto_pk_keysize(pk1));
  308. test_eq(128, crypto_pk_keysize(pk2));
  309. test_eq(128, crypto_pk_public_encrypt(pk2, "Hello whirled.", 15, data1,
  310. PK_PKCS1_OAEP_PADDING));
  311. test_eq(128, crypto_pk_public_encrypt(pk1, "Hello whirled.", 15, data2,
  312. PK_PKCS1_OAEP_PADDING));
  313. /* oaep padding should make encryption not match */
  314. test_memneq(data1, data2, 128);
  315. test_eq(15, crypto_pk_private_decrypt(pk1, data1, 128, data3,
  316. PK_PKCS1_OAEP_PADDING));
  317. test_streq(data3, "Hello whirled.");
  318. memset(data3, 0, 1024);
  319. test_eq(15, crypto_pk_private_decrypt(pk1, data2, 128, data3,
  320. PK_PKCS1_OAEP_PADDING));
  321. test_streq(data3, "Hello whirled.");
  322. /* Can't decrypt with public key. */
  323. test_eq(-1, crypto_pk_private_decrypt(pk2, data2, 128, data3,
  324. PK_PKCS1_OAEP_PADDING));
  325. /* Try again with bad padding */
  326. memcpy(data2+1, "XYZZY", 5); /* This has fails ~ once-in-2^40 */
  327. test_eq(-1, crypto_pk_private_decrypt(pk1, data2, 128, data3,
  328. PK_PKCS1_OAEP_PADDING));
  329. /* File operations: save and load private key */
  330. f = fopen("/tmp/tor_test/pkey1", "wb");
  331. test_assert(! crypto_pk_write_private_key_to_file(pk1, f));
  332. fclose(f);
  333. f = fopen("/tmp/tor_test/pkey1", "rb");
  334. test_assert(! crypto_pk_read_private_key_from_file(pk2, f));
  335. fclose(f);
  336. test_eq(15, crypto_pk_private_decrypt(pk2, data1, 128, data3,
  337. PK_PKCS1_OAEP_PADDING));
  338. test_assert(! crypto_pk_read_private_key_from_filename(pk2,
  339. "/tmp/tor_test/pkey1"));
  340. test_eq(15, crypto_pk_private_decrypt(pk2, data1, 128, data3,
  341. PK_PKCS1_OAEP_PADDING));
  342. /* Now try signing. */
  343. strcpy(data1, "Ossifrage");
  344. test_eq(128, crypto_pk_private_sign(pk1, data1, 10, data2));
  345. test_eq(10, crypto_pk_public_checksig(pk1, data2, 128, data3));
  346. test_streq(data3, "Ossifrage");
  347. /* Try signing digests. */
  348. test_eq(128, crypto_pk_private_sign_digest(pk1, data1, 10, data2));
  349. test_eq(20, crypto_pk_public_checksig(pk1, data2, 128, data3));
  350. test_eq(0, crypto_pk_public_checksig_digest(pk1, data1, 10, data2, 128));
  351. test_eq(-1, crypto_pk_public_checksig_digest(pk1, data1, 11, data2, 128));
  352. /*XXXX test failed signing*/
  353. /* Try encoding */
  354. crypto_free_pk_env(pk2);
  355. pk2 = NULL;
  356. i = crypto_pk_asn1_encode(pk1, data1, 1024);
  357. test_assert(i>0);
  358. pk2 = crypto_pk_asn1_decode(data1, i);
  359. test_assert(crypto_pk_cmp_keys(pk1,pk2) == 0);
  360. /* Try with hybrid encryption wrappers. */
  361. crypto_rand(1024, data1);
  362. for (i = 0; i < 3; ++i) {
  363. for (j = 85; j < 140; ++j) {
  364. memset(data2,0,1024);
  365. memset(data3,0,1024);
  366. if (i == 0 && j < 129)
  367. continue;
  368. p = (i==0)?PK_NO_PADDING:
  369. (i==1)?PK_PKCS1_PADDING:PK_PKCS1_OAEP_PADDING;
  370. len = crypto_pk_public_hybrid_encrypt(pk1,data1,j,data2,p,0);
  371. test_assert(len>=0);
  372. len = crypto_pk_private_hybrid_decrypt(pk1,data2,len,data3,p);
  373. test_eq(len,j);
  374. test_memeq(data1,data3,j);
  375. }
  376. }
  377. crypto_free_pk_env(pk1);
  378. crypto_free_pk_env(pk2);
  379. /* Base64 tests */
  380. strcpy(data1, "Test string that contains 35 chars.");
  381. strcat(data1, " 2nd string that contains 35 chars.");
  382. i = base64_encode(data2, 1024, data1, 71);
  383. j = base64_decode(data3, 1024, data2, i);
  384. test_streq(data3, data1);
  385. test_eq(j, 71);
  386. test_assert(data2[i] == '\0');
  387. /* Base32 tests */
  388. strcpy(data1, "5chrs");
  389. /* bit pattern is: [35 63 68 72 73] ->
  390. * [00110101 01100011 01101000 01110010 01110011]
  391. * By 5s: [00110 10101 10001 10110 10000 11100 10011 10011]
  392. */
  393. i = base32_encode(data2, 9, data1, 5);
  394. test_streq(data2, "gvrwq2tt");
  395. free(data1);
  396. free(data2);
  397. free(data3);
  398. }
  399. void
  400. test_util() {
  401. struct timeval start, end;
  402. struct tm a_time;
  403. smartlist_t *sl;
  404. start.tv_sec = 5;
  405. start.tv_usec = 5000;
  406. end.tv_sec = 5;
  407. end.tv_usec = 5000;
  408. test_eq(0L, tv_udiff(&start, &end));
  409. end.tv_usec = 7000;
  410. test_eq(2000L, tv_udiff(&start, &end));
  411. end.tv_sec = 6;
  412. test_eq(1002000L, tv_udiff(&start, &end));
  413. end.tv_usec = 0;
  414. test_eq(995000L, tv_udiff(&start, &end));
  415. end.tv_sec = 4;
  416. test_eq(0L, tv_udiff(&start, &end));
  417. /* The test values here are confirmed to be correct on a platform
  418. * with a working timegm. */
  419. a_time.tm_year = 2003-1900;
  420. a_time.tm_mon = 7;
  421. a_time.tm_mday = 30;
  422. a_time.tm_hour = 6;
  423. a_time.tm_min = 14;
  424. a_time.tm_sec = 55;
  425. test_eq((time_t) 1062224095UL, tor_timegm(&a_time));
  426. a_time.tm_year = 2004-1900; /* Try a leap year, after feb. */
  427. test_eq((time_t) 1093846495UL, tor_timegm(&a_time));
  428. a_time.tm_mon = 1; /* Try a leap year, in feb. */
  429. a_time.tm_mday = 10;
  430. test_eq((time_t) 1076393695UL, tor_timegm(&a_time));
  431. /* Test smartlist */
  432. sl = smartlist_create();
  433. smartlist_add(sl, (void*)1);
  434. smartlist_add(sl, (void*)2);
  435. smartlist_add(sl, (void*)3);
  436. smartlist_add(sl, (void*)4);
  437. test_eq(2, (int)smartlist_del_keeporder(sl, 1));
  438. smartlist_insert(sl, 1, (void*)22);
  439. smartlist_insert(sl, 0, (void*)0);
  440. smartlist_insert(sl, 5, (void*)555);
  441. test_eq(0, (int)smartlist_get(sl,0));
  442. test_eq(1, (int)smartlist_get(sl,1));
  443. test_eq(22, (int)smartlist_get(sl,2));
  444. test_eq(3, (int)smartlist_get(sl,3));
  445. test_eq(4, (int)smartlist_get(sl,4));
  446. test_eq(555, (int)smartlist_get(sl,5));
  447. /* XXXX test older functions. */
  448. smartlist_free(sl);
  449. }
  450. static void* _squareAndRemoveK4(const char *key, void*val, void *data)
  451. {
  452. int *ip = (int*)data;
  453. int v;
  454. if (strcmp(key,"K4") == 0) {
  455. ++(*ip);
  456. return NULL;
  457. }
  458. v = (int)val;
  459. return (void*)(v*v);
  460. }
  461. void test_strmap() {
  462. strmap_t *map;
  463. strmap_iter_t *iter;
  464. const char *k;
  465. void *v;
  466. int count;
  467. map = strmap_new();
  468. v = strmap_set(map, "K1", (void*)99);
  469. test_eq(v, NULL);
  470. v = strmap_set(map, "K2", (void*)101);
  471. test_eq(v, NULL);
  472. v = strmap_set(map, "K1", (void*)100);
  473. test_eq(v, (void*)99);
  474. test_eq(strmap_get(map,"K1"), (void*)100);
  475. test_eq(strmap_get(map,"K2"), (void*)101);
  476. test_eq(strmap_get(map,"K-not-there"), NULL);
  477. v = strmap_remove(map,"K2");
  478. test_eq(v, (void*)101);
  479. test_eq(strmap_get(map,"K2"), NULL);
  480. test_eq(strmap_remove(map,"K2"), NULL);
  481. strmap_set(map, "K2", (void*)101);
  482. strmap_set(map, "K3", (void*)102);
  483. strmap_set(map, "K4", (void*)103);
  484. strmap_set(map, "K5", (void*)104);
  485. strmap_set(map, "K6", (void*)105);
  486. count = 0;
  487. strmap_foreach(map, _squareAndRemoveK4, &count);
  488. test_eq(count, 1);
  489. test_eq(strmap_get(map, "K4"), NULL);
  490. test_eq(strmap_get(map, "K1"), (void*)10000);
  491. test_eq(strmap_get(map, "K6"), (void*)11025);
  492. iter = strmap_iter_init(map);
  493. strmap_iter_get(iter,&k,&v);
  494. test_streq(k, "K1");
  495. test_eq(v, (void*)10000);
  496. iter = strmap_iter_next(map,iter);
  497. strmap_iter_get(iter,&k,&v);
  498. test_streq(k, "K2");
  499. test_eq(v, (void*)10201);
  500. iter = strmap_iter_next_rmv(map,iter);
  501. strmap_iter_get(iter,&k,&v);
  502. test_streq(k, "K3");
  503. test_eq(v, (void*)10404);
  504. iter = strmap_iter_next(map,iter); /* K5 */
  505. test_assert(!strmap_iter_done(iter));
  506. iter = strmap_iter_next(map,iter); /* K6 */
  507. test_assert(!strmap_iter_done(iter));
  508. iter = strmap_iter_next(map,iter); /* done */
  509. test_assert(strmap_iter_done(iter));
  510. /* Make sure we removed K2, but not the others. */
  511. test_eq(strmap_get(map, "K2"), NULL);
  512. test_eq(strmap_get(map, "K5"), (void*)10816);
  513. /* Clean up after ourselves. */
  514. strmap_free(map, NULL);
  515. /* Now try some lc functions. */
  516. map = strmap_new();
  517. strmap_set_lc(map,"Ab.C", (void*)1);
  518. test_eq(strmap_get(map,"ab.c"), (void*)1);
  519. test_eq(strmap_get_lc(map,"AB.C"), (void*)1);
  520. test_eq(strmap_get(map,"AB.C"), NULL);
  521. test_eq(strmap_remove_lc(map,"aB.C"), (void*)1);
  522. test_eq(strmap_get_lc(map,"AB.C"), NULL);
  523. strmap_free(map,NULL);
  524. }
  525. void test_onion() {
  526. #if 0
  527. char **names;
  528. int i,num;
  529. names = parse_nickname_list(" foo bar\t baz quux ", &num);
  530. test_eq(num,4);
  531. test_streq(names[0],"foo");
  532. test_streq(names[1],"bar");
  533. test_streq(names[2],"baz");
  534. test_streq(names[3],"quux");
  535. for(i=0;i<num;i++)
  536. tor_free(names[i]);
  537. tor_free(names);
  538. #endif
  539. }
  540. void
  541. test_onion_handshake() {
  542. /* client-side */
  543. crypto_dh_env_t *c_dh = NULL;
  544. char c_buf[ONIONSKIN_CHALLENGE_LEN];
  545. char c_keys[40];
  546. /* server-side */
  547. char s_buf[ONIONSKIN_REPLY_LEN];
  548. char s_keys[40];
  549. /* shared */
  550. crypto_pk_env_t *pk = NULL;
  551. pk = crypto_new_pk_env();
  552. test_assert(! crypto_pk_generate_key(pk));
  553. /* client handshake 1. */
  554. memset(c_buf, 0, ONIONSKIN_CHALLENGE_LEN);
  555. test_assert(! onion_skin_create(pk, &c_dh, c_buf));
  556. /* server handshake */
  557. memset(s_buf, 0, ONIONSKIN_REPLY_LEN);
  558. memset(s_keys, 0, 40);
  559. test_assert(! onion_skin_server_handshake(c_buf, pk, s_buf, s_keys, 40));
  560. /* client handshake 2 */
  561. memset(c_keys, 0, 40);
  562. test_assert(! onion_skin_client_handshake(c_dh, s_buf, c_keys, 40));
  563. crypto_dh_free(c_dh);
  564. if (memcmp(c_keys, s_keys, 40)) {
  565. puts("Aiiiie");
  566. exit(1);
  567. }
  568. test_memeq(c_keys, s_keys, 40);
  569. memset(s_buf, 0, 40);
  570. test_memneq(c_keys, s_buf, 40);
  571. crypto_free_pk_env(pk);
  572. }
  573. /* from routers.c */
  574. int is_recommended_version(char *myversion, char *start);
  575. void
  576. test_dir_format()
  577. {
  578. char buf[8192], buf2[8192];
  579. char *pk1_str = NULL, *pk2_str = NULL, *pk3_str = NULL, *cp;
  580. int pk1_str_len, pk2_str_len, pk3_str_len;
  581. routerinfo_t r1, r2;
  582. crypto_pk_env_t *pk1 = NULL, *pk2 = NULL, *pk3 = NULL;
  583. routerinfo_t *rp1 = NULL, *rp2 = NULL;
  584. struct exit_policy_t ex1, ex2;
  585. routerlist_t *dir1 = NULL, *dir2 = NULL;
  586. test_assert( (pk1 = crypto_new_pk_env()) );
  587. test_assert( (pk2 = crypto_new_pk_env()) );
  588. test_assert( (pk3 = crypto_new_pk_env()) );
  589. test_assert(! crypto_pk_generate_key(pk1));
  590. test_assert(! crypto_pk_generate_key(pk2));
  591. test_assert(! crypto_pk_generate_key(pk3));
  592. r1.address = "testaddr1.foo.bar";
  593. r1.addr = 0xc0a80001u; /* 192.168.0.1 */
  594. r1.published_on = 0;
  595. r1.or_port = 9000;
  596. r1.socks_port = 9002;
  597. r1.dir_port = 9003;
  598. r1.onion_pkey = pk1;
  599. r1.identity_pkey = pk2;
  600. r1.link_pkey = pk3;
  601. r1.bandwidthrate = r1.bandwidthburst = 1000;
  602. r1.exit_policy = NULL;
  603. r1.nickname = "Magri";
  604. ex1.policy_type = EXIT_POLICY_ACCEPT;
  605. ex1.string = NULL;
  606. ex1.addr = 0;
  607. ex1.msk = 0;
  608. ex1.prt_min = ex1.prt_max = 80;
  609. ex1.next = &ex2;
  610. ex2.policy_type = EXIT_POLICY_REJECT;
  611. ex2.addr = 18 << 24;
  612. ex2.msk = 0xFF000000u;
  613. ex2.prt_min = ex1.prt_max = 24;
  614. ex2.next = NULL;
  615. r2.address = "tor.tor.tor";
  616. r2.addr = 0x0a030201u; /* 10.3.2.1 */
  617. r2.published_on = 5;
  618. r2.or_port = 9005;
  619. r2.socks_port = 0;
  620. r2.dir_port = 0;
  621. r2.onion_pkey = pk2;
  622. r2.identity_pkey = pk1;
  623. r2.link_pkey = pk2;
  624. r2.bandwidthrate = r2.bandwidthburst = 3000;
  625. r2.exit_policy = &ex1;
  626. r2.nickname = "Fred";
  627. test_assert(!crypto_pk_write_public_key_to_string(pk1, &pk1_str,
  628. &pk1_str_len));
  629. test_assert(!crypto_pk_write_public_key_to_string(pk2 , &pk2_str,
  630. &pk2_str_len));
  631. test_assert(!crypto_pk_write_public_key_to_string(pk3 , &pk3_str,
  632. &pk3_str_len));
  633. memset(buf, 0, 2048);
  634. test_assert(router_dump_router_to_string(buf, 2048, &r1, pk2)>0);
  635. strcpy(buf2, "router Magri testaddr1.foo.bar 9000 9002 9003 1000\n"
  636. "platform Tor "VERSION" on ");
  637. strcat(buf2, get_uname());
  638. strcat(buf2, "\n"
  639. "published 1970-01-01 00:00:00\n"
  640. "onion-key\n");
  641. strcat(buf2, pk1_str);
  642. strcat(buf2, "link-key\n");
  643. strcat(buf2, pk3_str);
  644. strcat(buf2, "signing-key\n");
  645. strcat(buf2, pk2_str);
  646. strcat(buf2, "router-signature\n");
  647. buf[strlen(buf2)] = '\0'; /* Don't compare the sig; it's never the same twice*/
  648. test_streq(buf, buf2);
  649. test_assert(router_dump_router_to_string(buf, 2048, &r1, pk2)>0);
  650. cp = buf;
  651. rp1 = router_get_entry_from_string((const char*)cp,NULL);
  652. test_assert(rp1);
  653. test_streq(rp1->address, r1.address);
  654. test_eq(rp1->or_port, r1.or_port);
  655. test_eq(rp1->socks_port, r1.socks_port);
  656. test_eq(rp1->dir_port, r1.dir_port);
  657. test_eq(rp1->bandwidthrate, r1.bandwidthrate);
  658. // test_eq(rp1->bandwidthburst, r1.bandwidthburst);
  659. test_assert(crypto_pk_cmp_keys(rp1->onion_pkey, pk1) == 0);
  660. test_assert(crypto_pk_cmp_keys(rp1->link_pkey, pk3) == 0);
  661. test_assert(crypto_pk_cmp_keys(rp1->identity_pkey, pk2) == 0);
  662. test_assert(rp1->exit_policy == NULL);
  663. #if 0
  664. /* XXX Once we have exit policies, test this again. XXX */
  665. strcpy(buf2, "router tor.tor.tor 9005 0 0 3000\n");
  666. strcat(buf2, pk2_str);
  667. strcat(buf2, "signing-key\n");
  668. strcat(buf2, pk1_str);
  669. strcat(buf2, "accept *:80\nreject 18.*:24\n\n");
  670. test_assert(router_dump_router_to_string(buf, 2048, &r2, pk2)>0);
  671. test_streq(buf, buf2);
  672. cp = buf;
  673. rp2 = router_get_entry_from_string(&cp);
  674. test_assert(rp2);
  675. test_streq(rp2->address, r2.address);
  676. test_eq(rp2->or_port, r2.or_port);
  677. test_eq(rp2->socks_port, r2.socks_port);
  678. test_eq(rp2->dir_port, r2.dir_port);
  679. test_eq(rp2->bandwidth, r2.bandwidth);
  680. test_assert(crypto_pk_cmp_keys(rp2->onion_pkey, pk2) == 0);
  681. test_assert(crypto_pk_cmp_keys(rp2->identity_pkey, pk1) == 0);
  682. test_eq(rp2->exit_policy->policy_type, EXIT_POLICY_ACCEPT);
  683. test_streq(rp2->exit_policy->string, "accept *:80");
  684. test_streq(rp2->exit_policy->address, "*");
  685. test_streq(rp2->exit_policy->port, "80");
  686. test_eq(rp2->exit_policy->next->policy_type, EXIT_POLICY_REJECT);
  687. test_streq(rp2->exit_policy->next->string, "reject 18.*:24");
  688. test_streq(rp2->exit_policy->next->address, "18.*");
  689. test_streq(rp2->exit_policy->next->port, "24");
  690. test_assert(rp2->exit_policy->next->next == NULL);
  691. #endif
  692. /* Okay, now for the directories. */
  693. crypto_pk_get_fingerprint(pk2, buf);
  694. add_fingerprint_to_dir("Magri", buf);
  695. crypto_pk_get_fingerprint(pk1, buf);
  696. add_fingerprint_to_dir("Fred", buf);
  697. /* Make sure routers aren't too far in the past any more. */
  698. r1.published_on = time(NULL);
  699. r2.published_on = time(NULL)-3*60*60;
  700. test_assert(router_dump_router_to_string(buf, 2048, &r1, pk2)>0);
  701. cp = buf;
  702. test_eq(dirserv_add_descriptor((const char**)&cp), 1);
  703. test_assert(router_dump_router_to_string(buf, 2048, &r2, pk1)>0);
  704. cp = buf;
  705. test_eq(dirserv_add_descriptor((const char**)&cp), 1);
  706. options.Nickname = "DirServer";
  707. test_assert(!dirserv_dump_directory_to_string(buf,8192,pk3));
  708. cp = buf;
  709. test_assert(!router_get_routerlist_from_directory_impl(buf, &dir1, pk3));
  710. test_eq(2, smartlist_len(dir1->routers));
  711. dirserv_free_fingerprint_list();
  712. tor_free(pk1_str);
  713. tor_free(pk2_str);
  714. if (pk1) crypto_free_pk_env(pk1);
  715. if (pk2) crypto_free_pk_env(pk2);
  716. if (rp1) routerinfo_free(rp1);
  717. if (rp2) routerinfo_free(rp2);
  718. tor_free(dir1); /* XXXX And more !*/
  719. tor_free(dir2); /* And more !*/
  720. /* make sure is_recommended_version() works */
  721. test_eq(1, is_recommended_version("abc", "abc"));
  722. test_eq(1, is_recommended_version("abc", "ab,abd,abde,abc,abcde"));
  723. test_eq(1, is_recommended_version("abc", "ab,abd,abde,abcde,abc"));
  724. test_eq(1, is_recommended_version("abc", "abc,abd,abde,abc,abcde"));
  725. test_eq(1, is_recommended_version("a", "a,ab,abd,abde,abc,abcde"));
  726. test_eq(0, is_recommended_version("a", "ab,abd,abde,abc,abcde"));
  727. test_eq(0, is_recommended_version("abb", "ab,abd,abde,abc,abcde"));
  728. test_eq(0, is_recommended_version("a", ""));
  729. }
  730. void test_rend_fns()
  731. {
  732. char address1[] = "fooaddress.onion";
  733. char address2[] = "aaaaaaaaaaaaaaaa.onion";
  734. rend_service_descriptor_t *d1, *d2;
  735. char *encoded;
  736. int len;
  737. crypto_pk_env_t *pk1;
  738. time_t now;
  739. pk1 = crypto_new_pk_env();
  740. test_assert(!crypto_pk_generate_key(pk1));
  741. d1 = tor_malloc_zero(sizeof(rend_service_descriptor_t));
  742. d1->pk = pk1;
  743. now = time(NULL);
  744. d1->timestamp = now;
  745. d1->n_intro_points = 3;
  746. d1->intro_points = tor_malloc(sizeof(char*)*3);
  747. d1->intro_points[0] = tor_strdup("tom");
  748. d1->intro_points[1] = tor_strdup("crow");
  749. d1->intro_points[2] = tor_strdup("joel");
  750. test_assert(! rend_encode_service_descriptor(d1, pk1, &encoded, &len));
  751. d2 = rend_parse_service_descriptor(encoded, len);
  752. test_assert(d2);
  753. test_assert(!crypto_pk_cmp_keys(d1->pk, d2->pk));
  754. test_eq(d2->timestamp, now);
  755. test_eq(d2->n_intro_points, 3);
  756. test_streq(d2->intro_points[0], "tom");
  757. test_streq(d2->intro_points[1], "crow");
  758. test_streq(d2->intro_points[2], "joel");
  759. test_eq(-1, rend_parse_rendezvous_address(address1));
  760. test_eq( 0, rend_parse_rendezvous_address(address2));
  761. rend_service_descriptor_free(d1);
  762. rend_service_descriptor_free(d2);
  763. }
  764. int
  765. main(int c, char**v){
  766. #if 0
  767. or_options_t options; /* command-line and config-file options */
  768. if(getconfig(c,v,&options))
  769. exit(1);
  770. #endif
  771. crypto_seed_rng();
  772. setup_directory();
  773. // puts("========================== Buffers =========================");
  774. // test_buffers();
  775. puts("\n========================== Crypto ==========================");
  776. test_crypto();
  777. test_crypto_dh();
  778. puts("\n========================= Util ============================");
  779. test_util();
  780. test_strmap();
  781. puts("\n========================= Onion Skins =====================");
  782. test_onion();
  783. test_onion_handshake();
  784. puts("\n========================= Directory Formats ===============");
  785. // add_stream_log(LOG_DEBUG, NULL, stdout);
  786. test_dir_format();
  787. puts("\n========================= Rendezvous functionality ========");
  788. test_rend_fns();
  789. puts("");
  790. if (have_failed)
  791. return 1;
  792. else
  793. return 0;
  794. }
  795. /*
  796. Local Variables:
  797. mode:c
  798. indent-tabs-mode:nil
  799. c-basic-offset:2
  800. End:
  801. */