rendcommon.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345
  1. /* Copyright 2004 Roger Dingledine, Nick Mathewson. */
  2. /* See LICENSE for licensing information */
  3. /* $Id$ */
  4. const char rendcommon_c_id[] = "$Id$";
  5. /**
  6. * \file rendcommon.c
  7. * \brief Rendezvous implementation: shared code between
  8. * introducers, services, clients, and rendezvous points.
  9. **/
  10. #include "or.h"
  11. /** Return 0 if one and two are the same service ids, else -1 or 1 */
  12. int rend_cmp_service_ids(const char *one, const char *two) {
  13. return strcasecmp(one,two);
  14. }
  15. /** Free the storage held by the service descriptor <b>desc</b>.
  16. */
  17. void rend_service_descriptor_free(rend_service_descriptor_t *desc)
  18. {
  19. int i;
  20. if (desc->pk)
  21. crypto_free_pk_env(desc->pk);
  22. if (desc->intro_points) {
  23. for (i=0; i < desc->n_intro_points; ++i) {
  24. tor_free(desc->intro_points[i]);
  25. }
  26. tor_free(desc->intro_points);
  27. }
  28. tor_free(desc);
  29. }
  30. /** Encode a service descriptor for <b>desc</b>, and sign it with
  31. * <b>key</b>. Store the descriptor in *<b>str_out</b>, and set
  32. * *<b>len_out</b> to its length.
  33. */
  34. int
  35. rend_encode_service_descriptor(rend_service_descriptor_t *desc,
  36. crypto_pk_env_t *key,
  37. char **str_out, size_t *len_out)
  38. {
  39. char *buf, *cp, *ipoint;
  40. int i;
  41. size_t keylen, asn1len;
  42. keylen = crypto_pk_keysize(desc->pk);
  43. buf = tor_malloc(keylen*2); /* Too long, but that's okay. */
  44. i = crypto_pk_asn1_encode(desc->pk, buf, keylen*2);
  45. if (i<0) {
  46. tor_free(buf);
  47. return -1;
  48. }
  49. asn1len = i;
  50. *len_out = 2 + asn1len + 4 + 2 + keylen;
  51. for (i = 0; i < desc->n_intro_points; ++i) {
  52. *len_out += strlen(desc->intro_points[i]) + 1;
  53. }
  54. cp = *str_out = tor_malloc(*len_out);
  55. set_uint16(cp, htons((uint16_t)asn1len));
  56. cp += 2;
  57. memcpy(cp, buf, asn1len);
  58. tor_free(buf);
  59. cp += asn1len;
  60. set_uint32(cp, htonl((uint32_t)desc->timestamp));
  61. cp += 4;
  62. set_uint16(cp, htons((uint16_t)desc->n_intro_points));
  63. cp += 2;
  64. for (i=0; i < desc->n_intro_points; ++i) {
  65. ipoint = (char*)desc->intro_points[i];
  66. strlcpy(cp, ipoint, *len_out-(cp-*str_out));
  67. cp += strlen(ipoint)+1;
  68. }
  69. i = crypto_pk_private_sign_digest(key, cp, *str_out, cp-*str_out);
  70. if (i<0) {
  71. tor_free(*str_out);
  72. return -1;
  73. }
  74. cp += i;
  75. tor_assert(*len_out == (size_t)(cp-*str_out));
  76. return 0;
  77. }
  78. /** Parse a service descriptor at <b>str</b> (<b>len</b> bytes). On
  79. * success, return a newly alloced service_descriptor_t. On failure,
  80. * return NULL.
  81. */
  82. rend_service_descriptor_t *rend_parse_service_descriptor(
  83. const char *str, size_t len)
  84. {
  85. rend_service_descriptor_t *result = NULL;
  86. int i;
  87. size_t keylen, asn1len;
  88. const char *end, *cp, *eos;
  89. result = tor_malloc_zero(sizeof(rend_service_descriptor_t));
  90. cp = str;
  91. end = str+len;
  92. if (end-cp < 2) goto truncated;
  93. asn1len = ntohs(get_uint16(cp));
  94. cp += 2;
  95. if ((size_t)(end-cp) < asn1len) goto truncated;
  96. result->pk = crypto_pk_asn1_decode(cp, asn1len);
  97. if (!result->pk) goto truncated;
  98. cp += asn1len;
  99. if (end-cp < 4) goto truncated;
  100. result->timestamp = (time_t) ntohl(get_uint32(cp));
  101. cp += 4;
  102. if (end-cp < 2) goto truncated;
  103. result->n_intro_points = ntohs(get_uint16(cp));
  104. result->intro_points = tor_malloc_zero(sizeof(char*)*result->n_intro_points);
  105. cp += 2;
  106. for (i=0;i<result->n_intro_points;++i) {
  107. if (end-cp < 2) goto truncated;
  108. eos = (const char *)memchr(cp,'\0',end-cp);
  109. if (!eos) goto truncated;
  110. result->intro_points[i] = tor_strdup(cp);
  111. cp = eos+1;
  112. }
  113. keylen = crypto_pk_keysize(result->pk);
  114. tor_assert(end-cp >= 0);
  115. if ((size_t)(end-cp) < keylen) goto truncated;
  116. if ((size_t)(end-cp) > keylen) {
  117. log_fn(LOG_WARN, "Signature too long on service descriptor");
  118. goto error;
  119. }
  120. if (crypto_pk_public_checksig_digest(result->pk,
  121. (char*)str,cp-str, /* data */
  122. (char*)cp,end-cp /* signature*/
  123. )<0) {
  124. log_fn(LOG_WARN, "Bad signature on service descriptor");
  125. goto error;
  126. }
  127. return result;
  128. truncated:
  129. log_fn(LOG_WARN, "Truncated service descriptor");
  130. error:
  131. rend_service_descriptor_free(result);
  132. return NULL;
  133. }
  134. /** Sets <b>out</b> to the first 10 bytes of the digest of <b>pk</b>,
  135. * base32 encoded. NUL-terminates out. (We use this string to
  136. * identify services in directory requests and .onion URLs.)
  137. */
  138. int rend_get_service_id(crypto_pk_env_t *pk, char *out)
  139. {
  140. char buf[DIGEST_LEN];
  141. tor_assert(pk);
  142. if (crypto_pk_get_digest(pk, buf) < 0)
  143. return -1;
  144. base32_encode(out, REND_SERVICE_ID_LEN+1, buf, 10);
  145. return 0;
  146. }
  147. /* ==== Rendezvous service descriptor cache. */
  148. #define REND_CACHE_MAX_AGE (24*60*60)
  149. #define REND_CACHE_MAX_SKEW (90*60)
  150. /** Map from service id (as generated by rend_get_service_id) to
  151. * rend_cache_entry_t. */
  152. static strmap_t *rend_cache = NULL;
  153. /** Initializes the service descriptor cache.
  154. */
  155. void rend_cache_init(void)
  156. {
  157. rend_cache = strmap_new();
  158. }
  159. /** Removes all old entries from the service descriptor cache.
  160. */
  161. void rend_cache_clean(void)
  162. {
  163. strmap_iter_t *iter;
  164. const char *key;
  165. void *val;
  166. rend_cache_entry_t *ent;
  167. time_t cutoff;
  168. cutoff = time(NULL) - REND_CACHE_MAX_AGE;
  169. for (iter = strmap_iter_init(rend_cache); !strmap_iter_done(iter); ) {
  170. strmap_iter_get(iter, &key, &val);
  171. ent = (rend_cache_entry_t*)val;
  172. if (ent->parsed->timestamp < cutoff) {
  173. iter = strmap_iter_next_rmv(rend_cache, iter);
  174. rend_service_descriptor_free(ent->parsed);
  175. tor_free(ent->desc);
  176. tor_free(ent);
  177. } else {
  178. iter = strmap_iter_next(rend_cache, iter);
  179. }
  180. }
  181. }
  182. /** Return true iff <b>query</b> is a syntactically valid service ID (as
  183. * generated by rend_get_service_id). */
  184. int rend_valid_service_id(const char *query) {
  185. if (strlen(query) != REND_SERVICE_ID_LEN)
  186. return 0;
  187. if (strspn(query, BASE32_CHARS) != REND_SERVICE_ID_LEN)
  188. return 0;
  189. return 1;
  190. }
  191. /** If we have a cached rend_cache_entry_t for the service ID <b>query</b>, set
  192. * *<b>e</b> to that entry and return 1. Else return 0.
  193. */
  194. int rend_cache_lookup_entry(const char *query, rend_cache_entry_t **e)
  195. {
  196. tor_assert(rend_cache);
  197. if (!rend_valid_service_id(query))
  198. return -1;
  199. *e = strmap_get_lc(rend_cache, query);
  200. if (!*e)
  201. return 0;
  202. return 1;
  203. }
  204. /** <b>query</b> is a base-32'ed service id. If it's malformed, return -1.
  205. * Else look it up.
  206. * - If it is found, point *desc to it, and write its length into
  207. * *desc_len, and return 1.
  208. * - If it is not found, return 0.
  209. * Note: calls to rend_cache_clean or rend_cache_store may invalidate
  210. * *desc.
  211. */
  212. int rend_cache_lookup_desc(const char *query, const char **desc, size_t *desc_len)
  213. {
  214. rend_cache_entry_t *e;
  215. int r;
  216. r = rend_cache_lookup_entry(query,&e);
  217. if (r <= 0) return r;
  218. *desc = e->desc;
  219. *desc_len = e->len;
  220. return 1;
  221. }
  222. /** Parse *desc, calculate its service id, and store it in the cache.
  223. * If we have a newer descriptor with the same ID, ignore this one.
  224. * If we have an older descriptor with the same ID, replace it.
  225. * Return -1 if it's malformed or otherwise rejected; return 0 if
  226. * it's the same or older than one we've already got; return 1 if
  227. * it's novel.
  228. */
  229. int rend_cache_store(const char *desc, size_t desc_len)
  230. {
  231. rend_cache_entry_t *e;
  232. rend_service_descriptor_t *parsed;
  233. char query[REND_SERVICE_ID_LEN+1];
  234. time_t now;
  235. tor_assert(rend_cache);
  236. parsed = rend_parse_service_descriptor(desc,desc_len);
  237. if (!parsed) {
  238. log_fn(LOG_WARN,"Couldn't parse service descriptor");
  239. return -1;
  240. }
  241. if (rend_get_service_id(parsed->pk, query)<0) {
  242. log_fn(LOG_WARN,"Couldn't compute service ID");
  243. rend_service_descriptor_free(parsed);
  244. return -1;
  245. }
  246. now = time(NULL);
  247. if (parsed->timestamp < now-REND_CACHE_MAX_AGE) {
  248. log_fn(LOG_WARN,"Service descriptor %s is too old", query);
  249. rend_service_descriptor_free(parsed);
  250. return -1;
  251. }
  252. if (parsed->timestamp > now+REND_CACHE_MAX_SKEW) {
  253. log_fn(LOG_WARN,"Service descriptor %s is too far in the future", query);
  254. rend_service_descriptor_free(parsed);
  255. return -1;
  256. }
  257. e = (rend_cache_entry_t*) strmap_get_lc(rend_cache, query);
  258. if (e && e->parsed->timestamp > parsed->timestamp) {
  259. log_fn(LOG_INFO,"We already have a newer service descriptor %s with the same ID", query);
  260. rend_service_descriptor_free(parsed);
  261. return 0;
  262. }
  263. if (e && e->len == desc_len && !memcmp(desc,e->desc,desc_len)) {
  264. log_fn(LOG_INFO,"We already have this service descriptor %s", query);
  265. e->received = time(NULL);
  266. rend_service_descriptor_free(parsed);
  267. return 0;
  268. }
  269. if (!e) {
  270. e = tor_malloc_zero(sizeof(rend_cache_entry_t));
  271. strmap_set_lc(rend_cache, query, e);
  272. } else {
  273. rend_service_descriptor_free(e->parsed);
  274. tor_free(e->desc);
  275. }
  276. e->received = time(NULL);
  277. e->parsed = parsed;
  278. e->len = desc_len;
  279. e->desc = tor_malloc(desc_len);
  280. memcpy(e->desc, desc, desc_len);
  281. log_fn(LOG_INFO,"Successfully stored rend desc '%s', len %d", query, (int)desc_len);
  282. return 1;
  283. }
  284. /** Called when we get a rendezvous-related relay cell on circuit
  285. * <b>circ</b>. Dispatch on rendezvous relay command. */
  286. void rend_process_relay_cell(circuit_t *circ, int command, size_t length,
  287. const char *payload)
  288. {
  289. int r;
  290. switch (command) {
  291. case RELAY_COMMAND_ESTABLISH_INTRO:
  292. r = rend_mid_establish_intro(circ,payload,length);
  293. break;
  294. case RELAY_COMMAND_ESTABLISH_RENDEZVOUS:
  295. r = rend_mid_establish_rendezvous(circ,payload,length);
  296. break;
  297. case RELAY_COMMAND_INTRODUCE1:
  298. r = rend_mid_introduce(circ,payload,length);
  299. break;
  300. case RELAY_COMMAND_INTRODUCE2:
  301. r = rend_service_introduce(circ,payload,length);
  302. break;
  303. case RELAY_COMMAND_INTRODUCE_ACK:
  304. r = rend_client_introduction_acked(circ,payload,length);
  305. break;
  306. case RELAY_COMMAND_RENDEZVOUS1:
  307. r = rend_mid_rendezvous(circ,payload,length);
  308. break;
  309. case RELAY_COMMAND_RENDEZVOUS2:
  310. r = rend_client_receive_rendezvous(circ,payload,length);
  311. break;
  312. case RELAY_COMMAND_INTRO_ESTABLISHED:
  313. r = rend_service_intro_established(circ,payload,length);
  314. break;
  315. case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
  316. r = rend_client_rendezvous_acked(circ,payload,length);
  317. break;
  318. default:
  319. tor_assert(0);
  320. }
  321. }