/* Copyright 2001,2002,2003 Roger Dingledine. */ /* See LICENSE for licensing information */ /* $Id$ */ #include #ifdef HAVE_FCNTL_H #include #endif #ifdef MS_WINDOWS /* For mkdir() */ #include #endif #include "or.h" #include "../common/test.h" extern or_options_t options; int have_failed = 0; /* These functions are file-local, but are exposed so we can test. */ int router_get_routerlist_from_directory_impl( const char *s, routerlist_t **dest, crypto_pk_env_t *pkey); void add_fingerprint_to_dir(const char *nickname, const char *fp); void get_platform_str(char *platform, int len); void dump_hex(char *s, int len) { static const char TABLE[] = "0123456789ABCDEF"; unsigned char *d = s; int i, j, nyb; for(i=0;i=0;--j) { nyb = (((int) d[i]) >> (j*4)) & 0x0f; tor_assert(0<=nyb && nyb <=15); putchar(TABLE[nyb]); } } } void setup_directory() { char buf[256]; int r; sprintf(buf, "/tmp/tor_test"); #ifdef _MSC_VER r = mkdir(buf); #else r = mkdir(buf, 0700); #endif if (r && errno != EEXIST) fprintf(stderr, "Can't create directory %s", buf); } void test_buffers() { #define MAX_BUF_SIZE 1024*1024 char str[256]; char str2[256]; buf_t *buf; buf_t *buf2; int s, i, j, eof; /**** * buf_new ****/ if (!(buf = buf_new())) test_fail(); test_eq(buf_capacity(buf), 512*1024); test_eq(buf_datalen(buf), 0); /**** * read_to_buf ****/ s = open("/tmp/tor_test/data", O_WRONLY|O_CREAT|O_TRUNC, 0600); for (j=0;j<256;++j) { str[j] = (char)j; } write(s, str, 256); close(s); s = open("/tmp/tor_test/data", O_RDONLY, 0); eof = 0; i = read_to_buf(s, 10, buf, &eof); test_eq(buf_capacity(buf), 512*1024); test_eq(buf_datalen(buf), 10); test_eq(eof, 0); test_eq(i, 10); test_memeq(str, (char*)_buf_peek_raw_buffer(buf), 10); /* Test reading 0 bytes. */ i = read_to_buf(s, 0, buf, &eof); test_eq(buf_capacity(buf), 512*1024); test_eq(buf_datalen(buf), 10); test_eq(eof, 0); test_eq(i, 0); /* Now test when buffer is filled exactly. */ buf2 = buf_new_with_capacity(6); i = read_to_buf(s, 6, buf2, &eof); test_eq(buf_capacity(buf2), 6); test_eq(buf_datalen(buf2), 6); test_eq(eof, 0); test_eq(i, 6); test_memeq(str+10, (char*)_buf_peek_raw_buffer(buf2), 6); buf_free(buf2); /* Now test when buffer is filled with more data to read. */ buf2 = buf_new_with_capacity(32); i = read_to_buf(s, 128, buf2, &eof); test_eq(buf_capacity(buf2), 128); test_eq(buf_datalen(buf2), 32); test_eq(eof, 0); test_eq(i, 32); buf_free(buf2); /* Now read to eof. */ test_assert(buf_capacity(buf) > 256); i = read_to_buf(s, 1024, buf, &eof); test_eq(i, (256-32-10-6)); test_eq(buf_capacity(buf), MAX_BUF_SIZE); test_eq(buf_datalen(buf), 256-6-32); test_memeq(str, (char*)_buf_peek_raw_buffer(buf), 10); /* XXX Check rest. */ test_eq(eof, 0); i = read_to_buf(s, 1024, buf, &eof); test_eq(i, 0); test_eq(buf_capacity(buf), MAX_BUF_SIZE); test_eq(buf_datalen(buf), 256-6-32); test_eq(eof, 1); close(s); /**** * find_on_inbuf ****/ buf_free(buf); buf = buf_new(); s = open("/tmp/tor_test/data", O_RDONLY, 0); eof = 0; i = read_to_buf(s, 1024, buf, &eof); test_eq(256, i); close(s); test_eq(((int)'d') + 1, find_on_inbuf("abcd", 4, buf)); test_eq(-1, find_on_inbuf("xyzzy", 5, buf)); /* Make sure we don't look off the end of the buffef */ ((char*)_buf_peek_raw_buffer(buf))[256] = 'A'; ((char*)_buf_peek_raw_buffer(buf))[257] = 'X'; test_eq(-1, find_on_inbuf("\xff" "A", 2, buf)); test_eq(-1, find_on_inbuf("AX", 2, buf)); /* Make sure we use the string length */ test_eq(((int)'d')+1, find_on_inbuf("abcdX", 4, buf)); /**** * fetch_from_buf ****/ memset(str2, 255, 256); test_eq(246, fetch_from_buf(str2, 10, buf)); test_memeq(str2, str, 10); test_memeq(str+10,(char*)_buf_peek_raw_buffer(buf),246); test_eq(buf_datalen(buf),246); test_eq(0, fetch_from_buf(str2, 246, buf)); test_memeq(str2, str+10, 246); test_eq(buf_capacity(buf),MAX_BUF_SIZE); test_eq(buf_datalen(buf),0); /**** * write_to_buf ****/ memset((char *)_buf_peek_raw_buffer(buf), (int)'-', 256); i = write_to_buf("Hello world", 11, buf); test_eq(i, 11); test_eq(buf_datalen(buf), 11); test_memeq((char*)_buf_peek_raw_buffer(buf), "Hello world", 11); i = write_to_buf("XYZZY", 5, buf); test_eq(i, 16); test_eq(buf_datalen(buf), 16); test_memeq((char*)_buf_peek_raw_buffer(buf), "Hello worldXYZZY", 16); /* Test when buffer is overfull. */ #if 0 buflen = 18; test_eq(-1, write_to_buf("This string will not fit.", 25, &buf, &buflen, &buf_datalen)); test_eq(buf_datalen, 16); test_memeq(buf, "Hello worldXYZZY--", 18); buflen = MAX_BUF_SIZE; #endif /**** * flush_buf ****/ /* XXXX Needs tests. */ buf_free(buf); } void test_crypto_dh() { crypto_dh_env_t *dh1, *dh2; char p1[CRYPTO_DH_SIZE]; char p2[CRYPTO_DH_SIZE]; char s1[CRYPTO_DH_SIZE]; char s2[CRYPTO_DH_SIZE]; int s1len, s2len; dh1 = crypto_dh_new(); dh2 = crypto_dh_new(); test_eq(crypto_dh_get_bytes(dh1), CRYPTO_DH_SIZE); test_eq(crypto_dh_get_bytes(dh2), CRYPTO_DH_SIZE); memset(p1, 0, CRYPTO_DH_SIZE); memset(p2, 0, CRYPTO_DH_SIZE); test_memeq(p1, p2, CRYPTO_DH_SIZE); test_assert(! crypto_dh_get_public(dh1, p1, CRYPTO_DH_SIZE)); test_memneq(p1, p2, CRYPTO_DH_SIZE); test_assert(! crypto_dh_get_public(dh2, p2, CRYPTO_DH_SIZE)); test_memneq(p1, p2, CRYPTO_DH_SIZE); memset(s1, 0, CRYPTO_DH_SIZE); memset(s2, 0xFF, CRYPTO_DH_SIZE); s1len = crypto_dh_compute_secret(dh1, p2, CRYPTO_DH_SIZE, s1, 50); s2len = crypto_dh_compute_secret(dh2, p1, CRYPTO_DH_SIZE, s2, 50); test_assert(s1len > 0); test_eq(s1len, s2len); test_memeq(s1, s2, s1len); crypto_dh_free(dh1); crypto_dh_free(dh2); } void test_crypto() { crypto_cipher_env_t *env1, *env2; crypto_pk_env_t *pk1, *pk2; char *data1, *data2, *data3, *cp; int i, j, p, len; data1 = tor_malloc(1024); data2 = tor_malloc(1024); data3 = tor_malloc(1024); test_assert(data1 && data2 && data3); /* Try out RNG. */ test_assert(! crypto_seed_rng()); crypto_rand(100, data1); crypto_rand(100, data2); test_memneq(data1,data2,100); #if 0 /* Try out identity ciphers. */ env1 = crypto_new_cipher_env(CRYPTO_CIPHER_IDENTITY); test_neq(env1, 0); test_eq(crypto_cipher_generate_key(env1), 0); test_eq(crypto_cipher_encrypt_init_cipher(env1), 0); for(i = 0; i < 1024; ++i) { data1[i] = (char) i*73; } crypto_cipher_encrypt(env1, data1, 1024, data2); test_memeq(data1, data2, 1024); crypto_free_cipher_env(env1); #endif /* Now, test encryption and decryption with stream cipher. */ data1[0]='\0'; for(i = 1023; i>0; i -= 35) strncat(data1, "Now is the time for all good onions", i); memset(data2, 0, 1024); memset(data3, 0, 1024); env1 = crypto_new_cipher_env(); test_neq(env1, 0); env2 = crypto_new_cipher_env(); test_neq(env2, 0); j = crypto_cipher_generate_key(env1); crypto_cipher_set_key(env2, crypto_cipher_get_key(env1)); crypto_cipher_encrypt_init_cipher(env1); crypto_cipher_decrypt_init_cipher(env2); /* Try encrypting 512 chars. */ crypto_cipher_encrypt(env1, data1, 512, data2); crypto_cipher_decrypt(env2, data2, 512, data3); test_memeq(data1, data3, 512); test_memneq(data1, data2, 512); /* Now encrypt 1 at a time, and get 1 at a time. */ for (j = 512; j < 560; ++j) { crypto_cipher_encrypt(env1, data1+j, 1, data2+j); } for (j = 512; j < 560; ++j) { crypto_cipher_decrypt(env2, data2+j, 1, data3+j); } test_memeq(data1, data3, 560); /* Now encrypt 3 at a time, and get 5 at a time. */ for (j = 560; j < 1024-5; j += 3) { crypto_cipher_encrypt(env1, data1+j, 3, data2+j); } for (j = 560; j < 1024-5; j += 5) { crypto_cipher_decrypt(env2, data2+j, 5, data3+j); } test_memeq(data1, data3, 1024-5); /* Now make sure that when we encrypt with different chunk sizes, we get the same results. */ crypto_free_cipher_env(env2); memset(data3, 0, 1024); env2 = crypto_new_cipher_env(); test_neq(env2, 0); crypto_cipher_set_key(env2, crypto_cipher_get_key(env1)); crypto_cipher_encrypt_init_cipher(env2); for (j = 0; j < 1024-16; j += 17) { crypto_cipher_encrypt(env2, data1+j, 17, data3+j); } for (j= 0; j < 1024-16; ++j) { if (data2[j] != data3[j]) { printf("%d: %d\t%d\n", j, (int) data2[j], (int) data3[j]); } } test_memeq(data2, data3, 1024-16); crypto_free_cipher_env(env1); crypto_free_cipher_env(env2); /* Test vectors for stream ciphers. */ /* XXXX Look up some test vectors for the ciphers and make sure we match. */ /* Test SHA-1 with a test vector from the specification. */ i = crypto_digest("abc", 3, data1); test_memeq(data1, "\xA9\x99\x3E\x36\x47\x06\x81\x6A\xBA\x3E\x25\x71\x78" "\x50\xC2\x6C\x9C\xD0\xD8\x9D", 20); /* Public-key ciphers */ pk1 = crypto_new_pk_env(); pk2 = crypto_new_pk_env(); test_assert(pk1 && pk2); test_assert(! crypto_pk_generate_key(pk1)); test_assert(! crypto_pk_write_public_key_to_string(pk1, &cp, &i)); test_assert(! crypto_pk_read_public_key_from_string(pk2, cp, i)); test_eq(0, crypto_pk_cmp_keys(pk1, pk2)); test_eq(128, crypto_pk_keysize(pk1)); test_eq(128, crypto_pk_keysize(pk2)); test_eq(128, crypto_pk_public_encrypt(pk2, "Hello whirled.", 15, data1, PK_PKCS1_OAEP_PADDING)); test_eq(128, crypto_pk_public_encrypt(pk1, "Hello whirled.", 15, data2, PK_PKCS1_OAEP_PADDING)); /* oaep padding should make encryption not match */ test_memneq(data1, data2, 128); test_eq(15, crypto_pk_private_decrypt(pk1, data1, 128, data3, PK_PKCS1_OAEP_PADDING)); test_streq(data3, "Hello whirled."); memset(data3, 0, 1024); test_eq(15, crypto_pk_private_decrypt(pk1, data2, 128, data3, PK_PKCS1_OAEP_PADDING)); test_streq(data3, "Hello whirled."); /* Can't decrypt with public key. */ test_eq(-1, crypto_pk_private_decrypt(pk2, data2, 128, data3, PK_PKCS1_OAEP_PADDING)); /* Try again with bad padding */ memcpy(data2+1, "XYZZY", 5); /* This has fails ~ once-in-2^40 */ test_eq(-1, crypto_pk_private_decrypt(pk1, data2, 128, data3, PK_PKCS1_OAEP_PADDING)); /* File operations: save and load private key */ test_assert(! crypto_pk_write_private_key_to_filename(pk1, "/tmp/tor_test/pke1y")); test_assert(! crypto_pk_read_private_key_from_filename(pk2, "/tmp/tor_test/pke1y")); test_eq(15, crypto_pk_private_decrypt(pk2, data1, 128, data3, PK_PKCS1_OAEP_PADDING)); /* Now try signing. */ strcpy(data1, "Ossifrage"); test_eq(128, crypto_pk_private_sign(pk1, data1, 10, data2)); test_eq(10, crypto_pk_public_checksig(pk1, data2, 128, data3)); test_streq(data3, "Ossifrage"); /* Try signing digests. */ test_eq(128, crypto_pk_private_sign_digest(pk1, data1, 10, data2)); test_eq(20, crypto_pk_public_checksig(pk1, data2, 128, data3)); test_eq(0, crypto_pk_public_checksig_digest(pk1, data1, 10, data2, 128)); test_eq(-1, crypto_pk_public_checksig_digest(pk1, data1, 11, data2, 128)); /*XXXX test failed signing*/ /* Try encoding */ crypto_free_pk_env(pk2); pk2 = NULL; i = crypto_pk_asn1_encode(pk1, data1, 1024); test_assert(i>0); pk2 = crypto_pk_asn1_decode(data1, i); test_assert(crypto_pk_cmp_keys(pk1,pk2) == 0); /* Try with hybrid encryption wrappers. */ crypto_rand(1024, data1); for (i = 0; i < 3; ++i) { for (j = 85; j < 140; ++j) { memset(data2,0,1024); memset(data3,0,1024); if (i == 0 && j < 129) continue; p = (i==0)?PK_NO_PADDING: (i==1)?PK_PKCS1_PADDING:PK_PKCS1_OAEP_PADDING; len = crypto_pk_public_hybrid_encrypt(pk1,data1,j,data2,p,0); test_assert(len>=0); len = crypto_pk_private_hybrid_decrypt(pk1,data2,len,data3,p); test_eq(len,j); test_memeq(data1,data3,j); } } crypto_free_pk_env(pk1); crypto_free_pk_env(pk2); /* Base64 tests */ strcpy(data1, "Test string that contains 35 chars."); strcat(data1, " 2nd string that contains 35 chars."); i = base64_encode(data2, 1024, data1, 71); j = base64_decode(data3, 1024, data2, i); test_streq(data3, data1); test_eq(j, 71); test_assert(data2[i] == '\0'); /* Base32 tests */ strcpy(data1, "5chrs"); /* bit pattern is: [35 63 68 72 73] -> * [00110101 01100011 01101000 01110010 01110011] * By 5s: [00110 10101 10001 10110 10000 11100 10011 10011] */ i = base32_encode(data2, 9, data1, 5); test_streq(data2, "gvrwq4tt"); strcpy(data1, "\xFF\xF5\x6D\x44\xAE\x0D\x5C\xC9\x62\xC4"); i = base32_encode(data2, 30, data1, 10); test_eq(i,0); test_streq(data2, "772w2rfobvomsywe"); free(data1); free(data2); free(data3); } void test_util() { struct timeval start, end; struct tm a_time; smartlist_t *sl; start.tv_sec = 5; start.tv_usec = 5000; end.tv_sec = 5; end.tv_usec = 5000; test_eq(0L, tv_udiff(&start, &end)); end.tv_usec = 7000; test_eq(2000L, tv_udiff(&start, &end)); end.tv_sec = 6; test_eq(1002000L, tv_udiff(&start, &end)); end.tv_usec = 0; test_eq(995000L, tv_udiff(&start, &end)); end.tv_sec = 4; test_eq(0L, tv_udiff(&start, &end)); /* The test values here are confirmed to be correct on a platform * with a working timegm. */ a_time.tm_year = 2003-1900; a_time.tm_mon = 7; a_time.tm_mday = 30; a_time.tm_hour = 6; a_time.tm_min = 14; a_time.tm_sec = 55; test_eq((time_t) 1062224095UL, tor_timegm(&a_time)); a_time.tm_year = 2004-1900; /* Try a leap year, after feb. */ test_eq((time_t) 1093846495UL, tor_timegm(&a_time)); a_time.tm_mon = 1; /* Try a leap year, in feb. */ a_time.tm_mday = 10; test_eq((time_t) 1076393695UL, tor_timegm(&a_time)); /* Test smartlist */ sl = smartlist_create(); smartlist_add(sl, (void*)1); smartlist_add(sl, (void*)2); smartlist_add(sl, (void*)3); smartlist_add(sl, (void*)4); test_eq(2, (int)smartlist_del_keeporder(sl, 1)); smartlist_insert(sl, 1, (void*)22); smartlist_insert(sl, 0, (void*)0); smartlist_insert(sl, 5, (void*)555); test_eq(0, (int)smartlist_get(sl,0)); test_eq(1, (int)smartlist_get(sl,1)); test_eq(22, (int)smartlist_get(sl,2)); test_eq(3, (int)smartlist_get(sl,3)); test_eq(4, (int)smartlist_get(sl,4)); test_eq(555, (int)smartlist_get(sl,5)); /* XXXX test older functions. */ smartlist_free(sl); } static void* _squareAndRemoveK4(const char *key, void*val, void *data) { int *ip = (int*)data; int v; if (strcmp(key,"K4") == 0) { ++(*ip); return NULL; } v = (int)val; return (void*)(v*v); } void test_strmap() { strmap_t *map; strmap_iter_t *iter; const char *k; void *v; int count; map = strmap_new(); v = strmap_set(map, "K1", (void*)99); test_eq(v, NULL); v = strmap_set(map, "K2", (void*)101); test_eq(v, NULL); v = strmap_set(map, "K1", (void*)100); test_eq(v, (void*)99); test_eq(strmap_get(map,"K1"), (void*)100); test_eq(strmap_get(map,"K2"), (void*)101); test_eq(strmap_get(map,"K-not-there"), NULL); v = strmap_remove(map,"K2"); test_eq(v, (void*)101); test_eq(strmap_get(map,"K2"), NULL); test_eq(strmap_remove(map,"K2"), NULL); strmap_set(map, "K2", (void*)101); strmap_set(map, "K3", (void*)102); strmap_set(map, "K4", (void*)103); strmap_set(map, "K5", (void*)104); strmap_set(map, "K6", (void*)105); count = 0; strmap_foreach(map, _squareAndRemoveK4, &count); test_eq(count, 1); test_eq(strmap_get(map, "K4"), NULL); test_eq(strmap_get(map, "K1"), (void*)10000); test_eq(strmap_get(map, "K6"), (void*)11025); iter = strmap_iter_init(map); strmap_iter_get(iter,&k,&v); test_streq(k, "K1"); test_eq(v, (void*)10000); iter = strmap_iter_next(map,iter); strmap_iter_get(iter,&k,&v); test_streq(k, "K2"); test_eq(v, (void*)10201); iter = strmap_iter_next_rmv(map,iter); strmap_iter_get(iter,&k,&v); test_streq(k, "K3"); test_eq(v, (void*)10404); iter = strmap_iter_next(map,iter); /* K5 */ test_assert(!strmap_iter_done(iter)); iter = strmap_iter_next(map,iter); /* K6 */ test_assert(!strmap_iter_done(iter)); iter = strmap_iter_next(map,iter); /* done */ test_assert(strmap_iter_done(iter)); /* Make sure we removed K2, but not the others. */ test_eq(strmap_get(map, "K2"), NULL); test_eq(strmap_get(map, "K5"), (void*)10816); /* Clean up after ourselves. */ strmap_free(map, NULL); /* Now try some lc functions. */ map = strmap_new(); strmap_set_lc(map,"Ab.C", (void*)1); test_eq(strmap_get(map,"ab.c"), (void*)1); test_eq(strmap_get_lc(map,"AB.C"), (void*)1); test_eq(strmap_get(map,"AB.C"), NULL); test_eq(strmap_remove_lc(map,"aB.C"), (void*)1); test_eq(strmap_get_lc(map,"AB.C"), NULL); strmap_free(map,NULL); } void test_onion() { #if 0 char **names; int i,num; names = parse_nickname_list(" foo bar\t baz quux ", &num); test_eq(num,4); test_streq(names[0],"foo"); test_streq(names[1],"bar"); test_streq(names[2],"baz"); test_streq(names[3],"quux"); for(i=0;i0); strcpy(buf2, "router Magri testaddr1.foo.bar 9000 9002 9003\n" "platform Tor "VERSION" on "); strcat(buf2, get_uname()); strcat(buf2, "\n" "published 1970-01-01 00:00:00\n" "bandwidth 1000 5000\n" "onion-key\n"); strcat(buf2, pk1_str); strcat(buf2, "signing-key\n"); strcat(buf2, pk2_str); strcat(buf2, "router-signature\n"); buf[strlen(buf2)] = '\0'; /* Don't compare the sig; it's never the same twice*/ test_streq(buf, buf2); test_assert(router_dump_router_to_string(buf, 2048, &r1, pk2)>0); cp = buf; rp1 = router_get_entry_from_string((const char*)cp,NULL); test_assert(rp1); test_streq(rp1->address, r1.address); test_eq(rp1->or_port, r1.or_port); test_eq(rp1->socks_port, r1.socks_port); test_eq(rp1->dir_port, r1.dir_port); test_eq(rp1->bandwidthrate, r1.bandwidthrate); test_eq(rp1->bandwidthburst, r1.bandwidthburst); test_assert(crypto_pk_cmp_keys(rp1->onion_pkey, pk1) == 0); test_assert(crypto_pk_cmp_keys(rp1->identity_pkey, pk2) == 0); test_assert(rp1->exit_policy == NULL); #if 0 /* XXX Once we have exit policies, test this again. XXX */ strcpy(buf2, "router tor.tor.tor 9005 0 0 3000\n"); strcat(buf2, pk2_str); strcat(buf2, "signing-key\n"); strcat(buf2, pk1_str); strcat(buf2, "accept *:80\nreject 18.*:24\n\n"); test_assert(router_dump_router_to_string(buf, 2048, &r2, pk2)>0); test_streq(buf, buf2); cp = buf; rp2 = router_get_entry_from_string(&cp); test_assert(rp2); test_streq(rp2->address, r2.address); test_eq(rp2->or_port, r2.or_port); test_eq(rp2->socks_port, r2.socks_port); test_eq(rp2->dir_port, r2.dir_port); test_eq(rp2->bandwidth, r2.bandwidth); test_assert(crypto_pk_cmp_keys(rp2->onion_pkey, pk2) == 0); test_assert(crypto_pk_cmp_keys(rp2->identity_pkey, pk1) == 0); test_eq(rp2->exit_policy->policy_type, EXIT_POLICY_ACCEPT); test_streq(rp2->exit_policy->string, "accept *:80"); test_streq(rp2->exit_policy->address, "*"); test_streq(rp2->exit_policy->port, "80"); test_eq(rp2->exit_policy->next->policy_type, EXIT_POLICY_REJECT); test_streq(rp2->exit_policy->next->string, "reject 18.*:24"); test_streq(rp2->exit_policy->next->address, "18.*"); test_streq(rp2->exit_policy->next->port, "24"); test_assert(rp2->exit_policy->next->next == NULL); #endif /* Okay, now for the directories. */ crypto_pk_get_fingerprint(pk2, buf); add_fingerprint_to_dir("Magri", buf); crypto_pk_get_fingerprint(pk1, buf); add_fingerprint_to_dir("Fred", buf); /* Make sure routers aren't too far in the past any more. */ r1.published_on = time(NULL); r2.published_on = time(NULL)-3*60*60; test_assert(router_dump_router_to_string(buf, 2048, &r1, pk2)>0); cp = buf; test_eq(dirserv_add_descriptor((const char**)&cp), 1); test_assert(router_dump_router_to_string(buf, 2048, &r2, pk1)>0); cp = buf; test_eq(dirserv_add_descriptor((const char**)&cp), 1); options.Nickname = "DirServer"; test_assert(!dirserv_dump_directory_to_string(buf,8192,pk3)); cp = buf; test_assert(!router_get_routerlist_from_directory_impl(buf, &dir1, pk3)); test_eq(2, smartlist_len(dir1->routers)); dirserv_free_fingerprint_list(); tor_free(pk1_str); tor_free(pk2_str); if (pk1) crypto_free_pk_env(pk1); if (pk2) crypto_free_pk_env(pk2); if (rp1) routerinfo_free(rp1); if (rp2) routerinfo_free(rp2); tor_free(dir1); /* XXXX And more !*/ tor_free(dir2); /* And more !*/ /* make sure is_recommended_version() works */ test_eq(1, is_recommended_version("abc", "abc")); test_eq(1, is_recommended_version("abc", "ab,abd,abde,abc,abcde")); test_eq(1, is_recommended_version("abc", "ab,abd,abde,abcde,abc")); test_eq(1, is_recommended_version("abc", "abc,abd,abde,abc,abcde")); test_eq(1, is_recommended_version("a", "a,ab,abd,abde,abc,abcde")); test_eq(0, is_recommended_version("a", "ab,abd,abde,abc,abcde")); test_eq(0, is_recommended_version("abb", "ab,abd,abde,abc,abcde")); test_eq(0, is_recommended_version("a", "")); } void test_rend_fns() { char address1[] = "fooaddress.onion"; char address2[] = "aaaaaaaaaaaaaaaa.onion"; rend_service_descriptor_t *d1, *d2; char *encoded; int len; crypto_pk_env_t *pk1; time_t now; pk1 = crypto_new_pk_env(); test_assert(!crypto_pk_generate_key(pk1)); d1 = tor_malloc_zero(sizeof(rend_service_descriptor_t)); d1->pk = pk1; now = time(NULL); d1->timestamp = now; d1->n_intro_points = 3; d1->intro_points = tor_malloc(sizeof(char*)*3); d1->intro_points[0] = tor_strdup("tom"); d1->intro_points[1] = tor_strdup("crow"); d1->intro_points[2] = tor_strdup("joel"); test_assert(! rend_encode_service_descriptor(d1, pk1, &encoded, &len)); d2 = rend_parse_service_descriptor(encoded, len); test_assert(d2); test_assert(!crypto_pk_cmp_keys(d1->pk, d2->pk)); test_eq(d2->timestamp, now); test_eq(d2->n_intro_points, 3); test_streq(d2->intro_points[0], "tom"); test_streq(d2->intro_points[1], "crow"); test_streq(d2->intro_points[2], "joel"); test_eq(-1, rend_parse_rendezvous_address(address1)); test_eq( 0, rend_parse_rendezvous_address(address2)); rend_service_descriptor_free(d1); rend_service_descriptor_free(d2); } int main(int c, char**v){ #if 0 or_options_t options; /* command-line and config-file options */ if(getconfig(c,v,&options)) exit(1); #endif crypto_seed_rng(); setup_directory(); // puts("========================== Buffers ========================="); // test_buffers(); puts("\n========================== Crypto =========================="); test_crypto(); test_crypto_dh(); puts("\n========================= Util ============================"); test_util(); test_strmap(); puts("\n========================= Onion Skins ====================="); test_onion(); test_onion_handshake(); puts("\n========================= Directory Formats ==============="); /* add_stream_log(LOG_DEBUG, NULL, stdout); */ test_dir_format(); puts("\n========================= Rendezvous functionality ========"); test_rend_fns(); puts(""); if (have_failed) return 1; else return 0; } /* Local Variables: mode:c indent-tabs-mode:nil c-basic-offset:2 End: */