test.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693
  1. /* Copyright 2001,2002,2003 Roger Dingledine, Matej Pfajfar. */
  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. void
  15. dump_hex(char *s, int len)
  16. {
  17. static const char TABLE[] = "0123456789ABCDEF";
  18. unsigned char *d = s;
  19. int i, j, nyb;
  20. for(i=0;i<len;++i) {
  21. for (j=1;j>=0;--j) {
  22. nyb = (((int) d[i]) >> (j*4)) & 0x0f;
  23. assert(0<=nyb && nyb <=15);
  24. putchar(TABLE[nyb]);
  25. }
  26. }
  27. }
  28. void
  29. setup_directory() {
  30. char buf[256];
  31. int r;
  32. sprintf(buf, "/tmp/tor_test");
  33. #ifdef _MSC_VER
  34. r = mkdir(buf);
  35. #else
  36. r = mkdir(buf, 0700);
  37. #endif
  38. if (r && errno != EEXIST)
  39. fprintf(stderr, "Can't create directory %s", buf);
  40. }
  41. void
  42. test_buffers() {
  43. char str[256];
  44. char str2[256];
  45. buf_t *buf;
  46. buf_t *buf2;
  47. int s, i, j, eof;
  48. /****
  49. * buf_new
  50. ****/
  51. if (!(buf = buf_new()))
  52. test_fail();
  53. test_eq(buf_capacity(buf), MAX_BUF_SIZE);
  54. test_eq(buf_datalen(buf), 0);
  55. /****
  56. * read_to_buf
  57. ****/
  58. s = open("/tmp/tor_test/data", O_WRONLY|O_CREAT|O_TRUNC, 0600);
  59. for (j=0;j<256;++j) {
  60. str[j] = (char)j;
  61. }
  62. write(s, str, 256);
  63. close(s);
  64. s = open("/tmp/tor_test/data", O_RDONLY, 0);
  65. eof = 0;
  66. i = read_to_buf(s, 10, buf, &eof);
  67. test_eq(buf_capacity(buf), MAX_BUF_SIZE);
  68. test_eq(buf_datalen(buf), 10);
  69. test_eq(eof, 0);
  70. test_eq(i, 10);
  71. test_memeq(str, (char*)_buf_peek_raw_buffer(buf), 10);
  72. /* Test reading 0 bytes. */
  73. i = read_to_buf(s, 0, buf, &eof);
  74. test_eq(buf_capacity(buf), MAX_BUF_SIZE);
  75. test_eq(buf_datalen(buf), 10);
  76. test_eq(eof, 0);
  77. test_eq(i, 0);
  78. /* Now test when buffer is filled exactly. */
  79. buf2 = buf_new_with_capacity(6);
  80. i = read_to_buf(s, 6, buf2, &eof);
  81. test_eq(buf_capacity(buf2), 6);
  82. test_eq(buf_datalen(buf2), 6);
  83. test_eq(eof, 0);
  84. test_eq(i, 6);
  85. test_memeq(str+10, (char*)_buf_peek_raw_buffer(buf2), 6);
  86. buf_free(buf2);
  87. /* Now test when buffer is filled with more data to read. */
  88. buf2 = buf_new_with_capacity(32);
  89. i = read_to_buf(s, 128, buf2, &eof);
  90. test_eq(buf_capacity(buf2), 32);
  91. test_eq(buf_datalen(buf2), 32);
  92. test_eq(eof, 0);
  93. test_eq(i, 32);
  94. buf_free(buf2);
  95. /* Now read to eof. */
  96. test_assert(buf_capacity(buf) > 256);
  97. i = read_to_buf(s, 1024, buf, &eof);
  98. test_eq(i, (256-32-10-6));
  99. test_eq(buf_capacity(buf), MAX_BUF_SIZE);
  100. test_eq(buf_datalen(buf), 256-6-32);
  101. test_memeq(str, (char*)_buf_peek_raw_buffer(buf), 10); /* XXX Check rest. */
  102. test_eq(eof, 0);
  103. i = read_to_buf(s, 1024, buf, &eof);
  104. test_eq(i, 0);
  105. test_eq(buf_capacity(buf), MAX_BUF_SIZE);
  106. test_eq(buf_datalen(buf), 256-6-32);
  107. test_eq(eof, 1);
  108. close(s);
  109. /****
  110. * find_on_inbuf
  111. ****/
  112. buf_free(buf);
  113. buf = buf_new();
  114. s = open("/tmp/tor_test/data", O_RDONLY, 0);
  115. eof = 0;
  116. i = read_to_buf(s, 1024, buf, &eof);
  117. test_eq(256, i);
  118. close(s);
  119. test_eq(((int)'d') + 1, find_on_inbuf("abcd", 4, buf));
  120. test_eq(-1, find_on_inbuf("xyzzy", 5, buf));
  121. /* Make sure we don't look off the end of the buffef */
  122. ((char*)_buf_peek_raw_buffer(buf))[256] = 'A';
  123. ((char*)_buf_peek_raw_buffer(buf))[257] = 'X';
  124. test_eq(-1, find_on_inbuf("\xff" "A", 2, buf));
  125. test_eq(-1, find_on_inbuf("AX", 2, buf));
  126. /* Make sure we use the string length */
  127. test_eq(((int)'d')+1, find_on_inbuf("abcdX", 4, buf));
  128. /****
  129. * fetch_from_buf
  130. ****/
  131. memset(str2, 255, 256);
  132. test_eq(246, fetch_from_buf(str2, 10, buf));
  133. test_memeq(str2, str, 10);
  134. test_memeq(str+10,(char*)_buf_peek_raw_buffer(buf),246);
  135. test_eq(buf_datalen(buf),246);
  136. test_eq(0, fetch_from_buf(str2, 246, buf));
  137. test_memeq(str2, str+10, 246);
  138. test_eq(buf_capacity(buf),MAX_BUF_SIZE);
  139. test_eq(buf_datalen(buf),0);
  140. /****
  141. * write_to_buf
  142. ****/
  143. memset((char *)_buf_peek_raw_buffer(buf), (int)'-', 256);
  144. i = write_to_buf("Hello world", 11, buf);
  145. test_eq(i, 11);
  146. test_eq(buf_datalen(buf), 11);
  147. test_memeq((char*)_buf_peek_raw_buffer(buf), "Hello world", 11);
  148. i = write_to_buf("XYZZY", 5, buf);
  149. test_eq(i, 16);
  150. test_eq(buf_datalen(buf), 16);
  151. test_memeq((char*)_buf_peek_raw_buffer(buf), "Hello worldXYZZY", 16);
  152. /* Test when buffer is overfull. */
  153. #if 0
  154. buflen = 18;
  155. test_eq(-1, write_to_buf("This string will not fit.", 25,
  156. &buf, &buflen, &buf_datalen));
  157. test_eq(buf_datalen, 16);
  158. test_memeq(buf, "Hello worldXYZZY--", 18);
  159. buflen = MAX_BUF_SIZE;
  160. #endif
  161. /****
  162. * flush_buf
  163. ****/
  164. /* XXXX Needs tests. */
  165. buf_free(buf);
  166. }
  167. void
  168. test_crypto_dh()
  169. {
  170. crypto_dh_env_t *dh1, *dh2;
  171. char p1[CRYPTO_DH_SIZE];
  172. char p2[CRYPTO_DH_SIZE];
  173. char s1[CRYPTO_DH_SIZE];
  174. char s2[CRYPTO_DH_SIZE];
  175. int s1len, s2len;
  176. dh1 = crypto_dh_new();
  177. dh2 = crypto_dh_new();
  178. test_eq(crypto_dh_get_bytes(dh1), CRYPTO_DH_SIZE);
  179. test_eq(crypto_dh_get_bytes(dh2), CRYPTO_DH_SIZE);
  180. memset(p1, 0, CRYPTO_DH_SIZE);
  181. memset(p2, 0, CRYPTO_DH_SIZE);
  182. test_memeq(p1, p2, CRYPTO_DH_SIZE);
  183. test_assert(! crypto_dh_get_public(dh1, p1, CRYPTO_DH_SIZE));
  184. test_memneq(p1, p2, CRYPTO_DH_SIZE);
  185. test_assert(! crypto_dh_get_public(dh2, p2, CRYPTO_DH_SIZE));
  186. test_memneq(p1, p2, CRYPTO_DH_SIZE);
  187. memset(s1, 0, CRYPTO_DH_SIZE);
  188. memset(s2, 0xFF, CRYPTO_DH_SIZE);
  189. s1len = crypto_dh_compute_secret(dh1, p2, CRYPTO_DH_SIZE, s1, 50);
  190. s2len = crypto_dh_compute_secret(dh2, p1, CRYPTO_DH_SIZE, s2, 50);
  191. test_assert(s1len > 0);
  192. test_eq(s1len, s2len);
  193. test_memeq(s1, s2, s1len);
  194. crypto_dh_free(dh1);
  195. crypto_dh_free(dh2);
  196. }
  197. void
  198. test_crypto()
  199. {
  200. crypto_cipher_env_t *env1, *env2;
  201. crypto_pk_env_t *pk1, *pk2;
  202. char *data1, *data2, *data3, *cp;
  203. FILE *f;
  204. int i, j;
  205. int str_ciphers[] = { CRYPTO_CIPHER_IDENTITY,
  206. CRYPTO_CIPHER_DES,
  207. CRYPTO_CIPHER_RC4,
  208. CRYPTO_CIPHER_3DES,
  209. CRYPTO_CIPHER_AES_CTR,
  210. -1 };
  211. data1 = tor_malloc(1024);
  212. data2 = tor_malloc(1024);
  213. data3 = tor_malloc(1024);
  214. test_assert(data1 && data2 && data3);
  215. /* Try out RNG. */
  216. test_assert(! crypto_seed_rng());
  217. crypto_rand(100, data1);
  218. crypto_rand(100, data2);
  219. test_memneq(data1,data2,100);
  220. /* Try out identity ciphers. */
  221. env1 = crypto_new_cipher_env(CRYPTO_CIPHER_IDENTITY);
  222. test_neq(env1, 0);
  223. test_eq(crypto_cipher_generate_key(env1), 0);
  224. test_eq(crypto_cipher_set_iv(env1, ""), 0);
  225. test_eq(crypto_cipher_encrypt_init_cipher(env1), 0);
  226. for(i = 0; i < 1024; ++i) {
  227. data1[i] = (char) i*73;
  228. }
  229. crypto_cipher_encrypt(env1, data1, 1024, data2);
  230. test_memeq(data1, data2, 1024);
  231. crypto_free_cipher_env(env1);
  232. /* Now, test encryption and decryption with stream ciphers. */
  233. data1[0]='\0';
  234. for(i = 1023; i>0; i -= 35)
  235. strncat(data1, "Now is the time for all good onions", i);
  236. for(i=0; str_ciphers[i] >= 0; ++i) {
  237. /* For each cipher... */
  238. memset(data2, 0, 1024);
  239. memset(data3, 0, 1024);
  240. env1 = crypto_new_cipher_env(str_ciphers[i]);
  241. test_neq(env1, 0);
  242. env2 = crypto_new_cipher_env(str_ciphers[i]);
  243. test_neq(env2, 0);
  244. j = crypto_cipher_generate_key(env1);
  245. if (str_ciphers[i] != CRYPTO_CIPHER_IDENTITY) {
  246. crypto_cipher_set_key(env2, crypto_cipher_get_key(env1));
  247. }
  248. crypto_cipher_set_iv(env1, "12345678901234567890");
  249. crypto_cipher_set_iv(env2, "12345678901234567890");
  250. crypto_cipher_encrypt_init_cipher(env1);
  251. crypto_cipher_decrypt_init_cipher(env2);
  252. /* Try encrypting 512 chars. */
  253. crypto_cipher_encrypt(env1, data1, 512, data2);
  254. crypto_cipher_decrypt(env2, data2, 512, data3);
  255. test_memeq(data1, data3, 512);
  256. if (str_ciphers[i] == CRYPTO_CIPHER_IDENTITY) {
  257. test_memeq(data1, data2, 512);
  258. } else {
  259. test_memneq(data1, data2, 512);
  260. }
  261. /* Now encrypt 1 at a time, and get 1 at a time. */
  262. for (j = 512; j < 560; ++j) {
  263. crypto_cipher_encrypt(env1, data1+j, 1, data2+j);
  264. }
  265. for (j = 512; j < 560; ++j) {
  266. crypto_cipher_decrypt(env2, data2+j, 1, data3+j);
  267. }
  268. test_memeq(data1, data3, 560);
  269. /* Now encrypt 3 at a time, and get 5 at a time. */
  270. for (j = 560; j < 1024-5; j += 3) {
  271. crypto_cipher_encrypt(env1, data1+j, 3, data2+j);
  272. }
  273. for (j = 560; j < 1024-5; j += 5) {
  274. crypto_cipher_decrypt(env2, data2+j, 5, data3+j);
  275. }
  276. test_memeq(data1, data3, 1024-5);
  277. /* Now make sure that when we encrypt with different chunk sizes, we get
  278. the same results. */
  279. crypto_free_cipher_env(env2);
  280. memset(data3, 0, 1024);
  281. env2 = crypto_new_cipher_env(str_ciphers[i]);
  282. test_neq(env2, 0);
  283. if (str_ciphers[i] != CRYPTO_CIPHER_IDENTITY) {
  284. crypto_cipher_set_key(env2, crypto_cipher_get_key(env1));
  285. }
  286. crypto_cipher_set_iv(env2, "12345678901234567890");
  287. crypto_cipher_encrypt_init_cipher(env2);
  288. for (j = 0; j < 1024-16; j += 17) {
  289. crypto_cipher_encrypt(env2, data1+j, 17, data3+j);
  290. }
  291. for (j= 0; j < 1024-16; ++j) {
  292. if (data2[j] != data3[j]) {
  293. printf("%d: %d\t%d\n", j, (int) data2[j], (int) data3[j]);
  294. }
  295. }
  296. test_memeq(data2, data3, 1024-16);
  297. crypto_free_cipher_env(env1);
  298. crypto_free_cipher_env(env2);
  299. }
  300. /* Test vectors for stream ciphers. */
  301. /* XXXX Look up some test vectors for the ciphers and make sure we match. */
  302. /* Test SHA-1 with a test vector from the specification. */
  303. i = crypto_SHA_digest("abc", 3, data1);
  304. test_memeq(data1,
  305. "\xA9\x99\x3E\x36\x47\x06\x81\x6A\xBA\x3E\x25\x71\x78"
  306. "\x50\xC2\x6C\x9C\xD0\xD8\x9D", 20);
  307. /* Public-key ciphers */
  308. pk1 = crypto_new_pk_env(CRYPTO_PK_RSA);
  309. pk2 = crypto_new_pk_env(CRYPTO_PK_RSA);
  310. test_assert(pk1 && pk2);
  311. test_assert(! crypto_pk_generate_key(pk1));
  312. test_assert(! crypto_pk_write_public_key_to_string(pk1, &cp, &i));
  313. test_assert(! crypto_pk_read_public_key_from_string(pk2, cp, i));
  314. test_eq(0, crypto_pk_cmp_keys(pk1, pk2));
  315. test_eq(128, crypto_pk_keysize(pk1));
  316. test_eq(128, crypto_pk_keysize(pk2));
  317. test_eq(128, crypto_pk_public_encrypt(pk2, "Hello whirled.", 15, data1,
  318. RSA_PKCS1_OAEP_PADDING));
  319. test_eq(128, crypto_pk_public_encrypt(pk1, "Hello whirled.", 15, data2,
  320. RSA_PKCS1_OAEP_PADDING));
  321. /* oaep padding should make encryption not match */
  322. test_memneq(data1, data2, 128);
  323. test_eq(15, crypto_pk_private_decrypt(pk1, data1, 128, data3,
  324. RSA_PKCS1_OAEP_PADDING));
  325. test_streq(data3, "Hello whirled.");
  326. memset(data3, 0, 1024);
  327. test_eq(15, crypto_pk_private_decrypt(pk1, data2, 128, data3,
  328. RSA_PKCS1_OAEP_PADDING));
  329. test_streq(data3, "Hello whirled.");
  330. /* Can't decrypt with public key. */
  331. test_eq(-1, crypto_pk_private_decrypt(pk2, data2, 128, data3,
  332. RSA_PKCS1_OAEP_PADDING));
  333. /* Try again with bad padding */
  334. memcpy(data2+1, "XYZZY", 5); /* This has fails ~ once-in-2^40 */
  335. test_eq(-1, crypto_pk_private_decrypt(pk1, data2, 128, data3,
  336. RSA_PKCS1_OAEP_PADDING));
  337. /* File operations: save and load private key */
  338. f = fopen("/tmp/tor_test/pkey1", "wb");
  339. test_assert(! crypto_pk_write_private_key_to_file(pk1, f));
  340. fclose(f);
  341. f = fopen("/tmp/tor_test/pkey1", "rb");
  342. test_assert(! crypto_pk_read_private_key_from_file(pk2, f));
  343. fclose(f);
  344. test_eq(15, crypto_pk_private_decrypt(pk2, data1, 128, data3,
  345. RSA_PKCS1_OAEP_PADDING));
  346. test_assert(! crypto_pk_read_private_key_from_filename(pk2,
  347. "/tmp/tor_test/pkey1"));
  348. test_eq(15, crypto_pk_private_decrypt(pk2, data1, 128, data3,
  349. RSA_PKCS1_OAEP_PADDING));
  350. /* Now try signing. */
  351. strcpy(data1, "Ossifrage");
  352. test_eq(128, crypto_pk_private_sign(pk1, data1, 10, data2));
  353. test_eq(10, crypto_pk_public_checksig(pk1, data2, 128, data3));
  354. test_streq(data3, "Ossifrage");
  355. /*XXXX test failed signing*/
  356. crypto_free_pk_env(pk1);
  357. crypto_free_pk_env(pk2);
  358. /* Base64 tests */
  359. strcpy(data1, "Test string that contains 35 chars.");
  360. strcat(data1, " 2nd string that contains 35 chars.");
  361. i = base64_encode(data2, 1024, data1, 71);
  362. j = base64_decode(data3, 1024, data2, i);
  363. test_streq(data3, data1);
  364. test_eq(j, 71);
  365. test_assert(data2[i] == '\0');
  366. free(data1);
  367. free(data2);
  368. free(data3);
  369. }
  370. void
  371. test_util() {
  372. struct timeval start, end;
  373. start.tv_sec = 5;
  374. start.tv_usec = 5000;
  375. end.tv_sec = 5;
  376. end.tv_usec = 5000;
  377. test_eq(0L, tv_udiff(&start, &end));
  378. end.tv_usec = 7000;
  379. test_eq(2000L, tv_udiff(&start, &end));
  380. end.tv_sec = 6;
  381. test_eq(1002000L, tv_udiff(&start, &end));
  382. end.tv_usec = 0;
  383. test_eq(995000L, tv_udiff(&start, &end));
  384. end.tv_sec = 4;
  385. test_eq(0L, tv_udiff(&start, &end));
  386. }
  387. void
  388. test_onion_handshake() {
  389. /* client-side */
  390. crypto_dh_env_t *c_dh = NULL;
  391. char c_buf[DH_ONIONSKIN_LEN];
  392. char c_keys[40];
  393. /* server-side */
  394. char s_buf[DH_KEY_LEN];
  395. char s_keys[40];
  396. /* shared */
  397. crypto_pk_env_t *pk = NULL;
  398. pk = crypto_new_pk_env(CRYPTO_PK_RSA);
  399. test_assert(! crypto_pk_generate_key(pk));
  400. /* client handshake 1. */
  401. memset(c_buf, 0, DH_ONIONSKIN_LEN);
  402. test_assert(! onion_skin_create(pk, &c_dh, c_buf));
  403. /* server handshake */
  404. memset(s_buf, 0, DH_KEY_LEN);
  405. memset(s_keys, 0, 40);
  406. test_assert(! onion_skin_server_handshake(c_buf, pk, s_buf, s_keys, 40));
  407. /* client handshake 2 */
  408. memset(c_keys, 0, 40);
  409. test_assert(! onion_skin_client_handshake(c_dh, s_buf, c_keys, 40));
  410. crypto_dh_free(c_dh);
  411. if (memcmp(c_keys, s_keys, 40)) {
  412. puts("Aiiiie");
  413. exit(1);
  414. }
  415. test_memeq(c_keys, s_keys, 40);
  416. memset(s_buf, 0, 40);
  417. test_memneq(c_keys, s_buf, 40);
  418. crypto_free_pk_env(pk);
  419. }
  420. /* from routers.c */
  421. int compare_recommended_versions(char *myversion, char *start);
  422. void
  423. test_dir_format()
  424. {
  425. char buf[8192], buf2[8192];
  426. char *pk1_str = NULL, *pk2_str = NULL, *pk3_str = NULL, *cp;
  427. int pk1_str_len, pk2_str_len, pk3_str_len;
  428. routerinfo_t r1, r2;
  429. crypto_pk_env_t *pk1 = NULL, *pk2 = NULL, *pk3 = NULL;
  430. routerinfo_t *rp1 = NULL, *rp2 = NULL;
  431. struct exit_policy_t ex1, ex2;
  432. directory_t *dir1 = NULL, *dir2 = NULL;
  433. test_assert( (pk1 = crypto_new_pk_env(CRYPTO_PK_RSA)) );
  434. test_assert( (pk2 = crypto_new_pk_env(CRYPTO_PK_RSA)) );
  435. test_assert( (pk3 = crypto_new_pk_env(CRYPTO_PK_RSA)) );
  436. test_assert(! crypto_pk_generate_key(pk1));
  437. test_assert(! crypto_pk_generate_key(pk2));
  438. test_assert(! crypto_pk_generate_key(pk3));
  439. r1.address = "testaddr1.foo.bar";
  440. r1.addr = 0xc0a80001u; /* 192.168.0.1 */
  441. r1.published_on = 0;
  442. r1.or_port = 9000;
  443. r1.ap_port = 9002;
  444. r1.dir_port = 9003;
  445. r1.onion_pkey = pk1;
  446. r1.identity_pkey = pk2;
  447. r1.link_pkey = pk3;
  448. r1.bandwidth = 1000;
  449. r1.exit_policy = NULL;
  450. r1.nickname = "Magri";
  451. ex1.policy_type = EXIT_POLICY_ACCEPT;
  452. ex1.string = NULL;
  453. ex1.address = "*";
  454. ex1.port = "80";
  455. ex1.next = &ex2;
  456. ex2.policy_type = EXIT_POLICY_REJECT;
  457. ex2.address = "18.*";
  458. ex2.port = "24";
  459. ex2.next = NULL;
  460. r2.address = "tor.tor.tor";
  461. r2.addr = 0x0a030201u; /* 10.3.2.1 */
  462. r2.published_on = 5;
  463. r2.or_port = 9005;
  464. r2.ap_port = 0;
  465. r2.dir_port = 0;
  466. r2.onion_pkey = pk2;
  467. r2.identity_pkey = pk1;
  468. r2.link_pkey = pk2;
  469. r2.bandwidth = 3000;
  470. r2.exit_policy = &ex1;
  471. test_assert(!crypto_pk_write_public_key_to_string(pk1, &pk1_str,
  472. &pk1_str_len));
  473. test_assert(!crypto_pk_write_public_key_to_string(pk2 , &pk2_str,
  474. &pk2_str_len));
  475. test_assert(!crypto_pk_write_public_key_to_string(pk3 , &pk3_str,
  476. &pk3_str_len));
  477. memset(buf, 0, 2048);
  478. log_set_severity(LOG_WARNING);
  479. test_assert(router_dump_router_to_string(buf, 2048, &r1, pk2)>0);
  480. strcpy(buf2, "router Magri testaddr1.foo.bar 9000 9002 9003 1000\n"
  481. "platform Tor "VERSION" on ");
  482. strcat(buf2, get_uname());
  483. strcat(buf2, "\n"
  484. "published 1970-01-01 00:00:00\n"
  485. "onion-key\n");
  486. strcat(buf2, pk1_str);
  487. strcat(buf2, "link-key\n");
  488. strcat(buf2, pk3_str);
  489. strcat(buf2, "signing-key\n");
  490. strcat(buf2, pk2_str);
  491. strcat(buf2, "router-signature\n");
  492. buf[strlen(buf2)] = '\0'; /* Don't compare the sig; it's never the same twice*/
  493. test_streq(buf, buf2);
  494. test_assert(router_dump_router_to_string(buf, 2048, &r1, pk2)>0);
  495. cp = buf;
  496. rp1 = router_get_entry_from_string(&cp);
  497. test_assert(rp1);
  498. test_streq(rp1->address, r1.address);
  499. test_eq(rp1->or_port, r1.or_port);
  500. test_eq(rp1->ap_port, r1.ap_port);
  501. test_eq(rp1->dir_port, r1.dir_port);
  502. test_eq(rp1->bandwidth, r1.bandwidth);
  503. test_assert(crypto_pk_cmp_keys(rp1->onion_pkey, pk1) == 0);
  504. test_assert(crypto_pk_cmp_keys(rp1->link_pkey, pk3) == 0);
  505. test_assert(crypto_pk_cmp_keys(rp1->identity_pkey, pk2) == 0);
  506. test_assert(rp1->exit_policy == NULL);
  507. #if 0
  508. /* XXX Once we have exit policies, test this again. XXX */
  509. strcpy(buf2, "router tor.tor.tor 9005 0 0 3000\n");
  510. strcat(buf2, pk2_str);
  511. strcat(buf2, "signing-key\n");
  512. strcat(buf2, pk1_str);
  513. strcat(buf2, "accept *:80\nreject 18.*:24\n\n");
  514. test_assert(router_dump_router_to_string(buf, 2048, &r2, pk2)>0);
  515. test_streq(buf, buf2);
  516. cp = buf;
  517. rp2 = router_get_entry_from_string(&cp);
  518. test_assert(rp2);
  519. test_streq(rp2->address, r2.address);
  520. test_eq(rp2->or_port, r2.or_port);
  521. test_eq(rp2->ap_port, r2.ap_port);
  522. test_eq(rp2->dir_port, r2.dir_port);
  523. test_eq(rp2->bandwidth, r2.bandwidth);
  524. test_assert(crypto_pk_cmp_keys(rp2->onion_pkey, pk2) == 0);
  525. test_assert(crypto_pk_cmp_keys(rp2->identity_pkey, pk1) == 0);
  526. test_eq(rp2->exit_policy->policy_type, EXIT_POLICY_ACCEPT);
  527. test_streq(rp2->exit_policy->string, "accept *:80");
  528. test_streq(rp2->exit_policy->address, "*");
  529. test_streq(rp2->exit_policy->port, "80");
  530. test_eq(rp2->exit_policy->next->policy_type, EXIT_POLICY_REJECT);
  531. test_streq(rp2->exit_policy->next->string, "reject 18.*:24");
  532. test_streq(rp2->exit_policy->next->address, "18.*");
  533. test_streq(rp2->exit_policy->next->port, "24");
  534. test_assert(rp2->exit_policy->next->next == NULL);
  535. #endif
  536. #if 0
  537. /* XXX To re-enable this test, we need to separate directory generation
  538. * XXX from the directory backend again. Do this the next time we have
  539. * XXX directory trouble. */
  540. /* Okay, now for the directories. */
  541. dir1 = (directory_t*) tor_malloc(sizeof(directory_t));
  542. dir1->n_routers = 2;
  543. dir1->routers = (routerinfo_t**) tor_malloc(sizeof(routerinfo_t*)*2);
  544. dir1->routers[0] = &r1;
  545. dir1->routers[1] = &r2;
  546. test_assert(! dump_signed_directory_to_string_impl(buf, 4096, dir1, pk1));
  547. /* puts(buf); */
  548. test_assert(! router_get_dir_from_string_impl(buf, &dir2, pk1));
  549. test_eq(2, dir2->n_routers);
  550. #endif
  551. if (pk1_str) free(pk1_str);
  552. if (pk2_str) free(pk2_str);
  553. if (pk1) crypto_free_pk_env(pk1);
  554. if (pk2) crypto_free_pk_env(pk2);
  555. if (rp1) routerinfo_free(rp1);
  556. if (rp2) routerinfo_free(rp2);
  557. if (dir1) free(dir1); /* And more !*/
  558. if (dir1) free(dir2); /* And more !*/
  559. /* make sure compare_recommended_versions() works */
  560. test_eq(0, compare_recommended_versions("abc", "abc"));
  561. test_eq(0, compare_recommended_versions("abc", "ab,abd,abde,abc,abcde"));
  562. test_eq(0, compare_recommended_versions("abc", "ab,abd,abde,abcde,abc"));
  563. test_eq(0, compare_recommended_versions("abc", "abc,abd,abde,abc,abcde"));
  564. test_eq(0, compare_recommended_versions("a", "a,ab,abd,abde,abc,abcde"));
  565. test_eq(-1, compare_recommended_versions("a", "ab,abd,abde,abc,abcde"));
  566. test_eq(-1, compare_recommended_versions("abb", "ab,abd,abde,abc,abcde"));
  567. test_eq(-1, compare_recommended_versions("a", ""));
  568. test_eq(0, compare_recommended_versions(VERSION, RECOMMENDED_SOFTWARE_VERSIONS));
  569. }
  570. int
  571. main(int c, char**v){
  572. #if 0
  573. or_options_t options; /* command-line and config-file options */
  574. if(getconfig(c,v,&options))
  575. exit(1);
  576. #endif
  577. log_set_severity(LOG_ERR); /* make logging quieter */
  578. crypto_seed_rng();
  579. setup_directory();
  580. puts("========================== Buffers =========================");
  581. test_buffers();
  582. puts("\n========================== Crypto ==========================");
  583. test_crypto();
  584. test_crypto_dh();
  585. puts("\n========================= Util ============================");
  586. test_util();
  587. puts("\n========================= Onion Skins =====================");
  588. test_onion_handshake();
  589. puts("\n========================= Directory Formats ===============");
  590. test_dir_format();
  591. puts("");
  592. return 0;
  593. }
  594. /*
  595. Local Variables:
  596. mode:c
  597. indent-tabs-mode:nil
  598. c-basic-offset:2
  599. End:
  600. */