test.c 21 KB

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