flow.c 35 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252
  1. /* Name: flow.c
  2. *
  3. * This file contains functions for manipulating tagged flows.
  4. *
  5. * Slitheen - a decoy routing system for censorship resistance
  6. * Copyright (C) 2017 Cecylia Bocovich (cbocovic@uwaterloo.ca)
  7. *
  8. * This program is free software: you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation, version 3.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  19. *
  20. * Additional permission under GNU GPL version 3 section 7
  21. *
  22. * If you modify this Program, or any covered work, by linking or combining
  23. * it with the OpenSSL library (or a modified version of that library),
  24. * containing parts covered by the terms of the OpenSSL Licence and the
  25. * SSLeay license, the licensors of this Program grant you additional
  26. * permission to convey the resulting work. Corresponding Source for a
  27. * non-source form of such a combination shall include the source code
  28. * for the parts of the OpenSSL library used as well as that of the covered
  29. * work.
  30. */
  31. #include <stdio.h>
  32. #include <stdlib.h>
  33. #include <stdint.h>
  34. #include <pthread.h>
  35. #include <errno.h>
  36. #include <semaphore.h>
  37. #include "flow.h"
  38. #include "crypto.h"
  39. #include "slitheen.h"
  40. #include "relay.h"
  41. #include "util.h"
  42. #define DEBUG_HS
  43. static flow_table *table;
  44. static session_cache *sessions;
  45. client_table *clients;
  46. sem_t flow_table_lock;
  47. /* Initialize the table of tagged flows */
  48. int init_tables(void) {
  49. table = emalloc(sizeof(flow_table));
  50. table->first_entry = NULL;
  51. table->len = 0;
  52. sem_init(&flow_table_lock, 0, 1);
  53. clients = emalloc(sizeof(client_table));
  54. clients->first = NULL;
  55. printf("initialized downstream queue\n");
  56. return 0;
  57. }
  58. /* Add a new flow to the tagged flow table */
  59. flow *add_flow(struct packet_info *info) {
  60. flow_entry *entry = emalloc(sizeof(flow_entry));
  61. flow *new_flow = emalloc(sizeof(flow));
  62. entry->f = new_flow;
  63. entry->next = NULL;
  64. new_flow->src_ip = info->ip_hdr->src;
  65. new_flow->dst_ip = info->ip_hdr->dst;
  66. new_flow->src_port = info->tcp_hdr->src_port;
  67. new_flow->dst_port = info->tcp_hdr->dst_port;
  68. new_flow->ref_ctr = 1;
  69. printf("Adding new flow (%p ref ctr %d)\n", new_flow, 1);
  70. new_flow->removed = 0;
  71. new_flow->upstream_app_data = emalloc(sizeof(app_data_queue));
  72. new_flow->upstream_app_data->first_packet = NULL;
  73. new_flow->downstream_app_data = emalloc(sizeof(app_data_queue));
  74. new_flow->downstream_app_data->first_packet = NULL;
  75. new_flow->upstream_seq_num = ntohl(info->tcp_hdr->sequence_num);
  76. new_flow->downstream_seq_num = ntohl(info->tcp_hdr->ack_num);
  77. new_flow->us_frame_queue = emalloc(sizeof(frame_queue));
  78. new_flow->us_frame_queue->first_frame = NULL;
  79. new_flow->ds_frame_queue = emalloc(sizeof(frame_queue));
  80. new_flow->ds_frame_queue->first_frame = NULL;
  81. new_flow->streams=NULL;
  82. new_flow->downstream_queue=NULL;
  83. new_flow->client_ptr=NULL;
  84. sem_init(&(new_flow->flow_lock), 0, 1);
  85. new_flow->state = TLS_CLNT_HELLO;
  86. new_flow->in_encrypted = 0;
  87. new_flow->out_encrypted = 0;
  88. new_flow->application = 0;
  89. new_flow->stall = 0;
  90. new_flow->resume_session = 0;
  91. new_flow->current_session = NULL;
  92. new_flow->us_hs_queue = init_queue();
  93. new_flow->ds_hs_queue = init_queue();
  94. new_flow->us_packet_chain = emalloc(sizeof(packet_chain));
  95. new_flow->us_packet_chain->expected_seq_num = ntohl(info->tcp_hdr->sequence_num);
  96. new_flow->us_packet_chain->record_len = 0;
  97. new_flow->us_packet_chain->remaining_record_len = 0;
  98. new_flow->us_packet_chain->first_packet = NULL;
  99. new_flow->ds_packet_chain = emalloc(sizeof(packet_chain));
  100. new_flow->ds_packet_chain->expected_seq_num = ntohl(info->tcp_hdr->ack_num);
  101. new_flow->ds_packet_chain->record_len = 0;
  102. new_flow->ds_packet_chain->remaining_record_len = 0;
  103. new_flow->ds_packet_chain->first_packet = NULL;
  104. sem_init(&(new_flow->packet_chain_lock), 0, 1);
  105. new_flow->upstream_queue = NULL;
  106. new_flow->upstream_remaining = 0;
  107. sem_init(&(new_flow->upstream_queue_lock), 0, 1);
  108. new_flow->outbox = NULL;
  109. new_flow->outbox_len = 0;
  110. new_flow->outbox_offset = 0;
  111. new_flow->partial_record_header = NULL;
  112. new_flow->partial_record_header_len = 0;
  113. new_flow->remaining_record_len = 0;
  114. new_flow->remaining_response_len = 0;
  115. new_flow->httpstate = PARSE_HEADER;
  116. new_flow->replace_response = 0;
  117. new_flow->ecdh = NULL;
  118. new_flow->dh = NULL;
  119. new_flow->finish_md_ctx = EVP_MD_CTX_create();
  120. const EVP_MD *md = EVP_sha384();
  121. EVP_DigestInit_ex(new_flow->finish_md_ctx, md, NULL);
  122. new_flow->cipher = NULL;
  123. new_flow->clnt_read_ctx = NULL;
  124. new_flow->clnt_write_ctx = NULL;
  125. new_flow->srvr_read_ctx = NULL;
  126. new_flow->srvr_write_ctx = NULL;
  127. memset(new_flow->read_seq, 0, 8);
  128. memset(new_flow->write_seq, 0, 8);
  129. sem_wait(&flow_table_lock);
  130. flow_entry *last = table->first_entry;
  131. if(last == NULL){
  132. table->first_entry = entry;
  133. } else {
  134. for(int i=0; i< table->len-1; i++){
  135. last = last->next;
  136. }
  137. last->next = entry;
  138. }
  139. table->len ++;
  140. sem_post(&flow_table_lock);
  141. return new_flow;
  142. }
  143. /** Observes TLS handshake messages and updates the state of
  144. * the flow
  145. *
  146. * Inputs:
  147. * f: the tagged flow
  148. * record: a complete TLS record
  149. *
  150. * Output:
  151. * 0 on success, 1 on failure
  152. */
  153. int update_flow(flow *f, uint8_t *record, uint8_t incoming) {
  154. const struct record_header *record_hdr;
  155. const struct handshake_header *handshake_hdr;
  156. uint8_t *p;
  157. record_hdr = (struct record_header*) record;
  158. int record_len;
  159. record_len = RECORD_LEN(record_hdr)+RECORD_HEADER_LEN;
  160. switch(record_hdr->type){
  161. case HS:
  162. p = record;
  163. p += RECORD_HEADER_LEN;
  164. if((incoming && f->in_encrypted) || (!incoming && f->out_encrypted)){
  165. #ifdef DEBUG_HS
  166. printf("Decrypting finished (%d bytes) (%x:%d -> %x:%d)\n", record_len - RECORD_HEADER_LEN, f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  167. printf("Finished ciphertext:\n");
  168. for(int i=0; i< record_len; i++){
  169. printf("%02x ", record[i]);
  170. }
  171. printf("\n");
  172. #endif
  173. int32_t n = encrypt(f, p, p, record_len - RECORD_HEADER_LEN, incoming, 0x16, 0, 0);
  174. if(n<=0){
  175. printf("Error decrypting finished (%x:%d -> %x:%d)\n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  176. }
  177. #ifdef DEBUG_HS
  178. printf("Finished decrypted: (%x:%d -> %x:%d)\n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  179. #endif
  180. p += EVP_GCM_TLS_EXPLICIT_IV_LEN;
  181. #ifdef DEBUG_HS
  182. printf("record:\n");
  183. for(int i=0; i< n; i++){
  184. printf("%02x ", p[i]);
  185. }
  186. printf("\n");
  187. #endif
  188. if(p[0] != 0x14){
  189. p[0] = 0x20; //trigger error
  190. }
  191. if(incoming){
  192. f->in_encrypted = 2;
  193. } else {
  194. f->out_encrypted = 2;
  195. }
  196. }
  197. handshake_hdr = (struct handshake_header*) p;
  198. f->state = handshake_hdr->type;
  199. switch(f->state){
  200. case TLS_CLNT_HELLO:
  201. #ifdef DEBUG_HS
  202. printf("Received tagged client hello (%x:%d -> %x:%d)\n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  203. #endif
  204. if(update_finish_hash(f, p)){
  205. fprintf(stderr, "Error updating finish has with CLNT_HELLO msg\n");
  206. remove_flow(f);
  207. goto err;
  208. }
  209. if(check_session(f, p, HANDSHAKE_MESSAGE_LEN(handshake_hdr))){
  210. fprintf(stderr, "Error checking session, might cause problems\n");
  211. }
  212. break;
  213. case TLS_SERV_HELLO:
  214. #ifdef DEBUG_HS
  215. printf("Received server hello (%x:%d -> %x:%d)\n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  216. #endif
  217. if(f->resume_session){
  218. if(verify_session_id(f,p)){
  219. fprintf(stderr, "Failed to verify session id\n");
  220. }
  221. } else {
  222. if(save_session_id(f,p)){
  223. fprintf(stderr, "Failed to save session id\n");
  224. }
  225. }
  226. if(extract_server_random(f, p)){
  227. fprintf(stderr, "Failed to extract server random nonce\n");
  228. remove_flow(f);
  229. goto err;
  230. }
  231. if(update_finish_hash(f, p)){
  232. fprintf(stderr, "Error updating finish hash with SRVR_HELLO msg\n");
  233. remove_flow(f);
  234. goto err;
  235. }
  236. break;
  237. case TLS_NEW_SESS:
  238. #ifdef DEBUG_HS
  239. printf("Received new session\n");
  240. #endif
  241. if(save_session_ticket(f, p, HANDSHAKE_MESSAGE_LEN(handshake_hdr))){
  242. fprintf(stderr, "Failed to save session ticket\n");
  243. }
  244. if(update_finish_hash(f, p)){
  245. fprintf(stderr, "Error updating finish hash with NEW_SESS msg\n");
  246. remove_flow(f);
  247. goto err;
  248. }
  249. break;
  250. case TLS_CERT:
  251. #ifdef DEBUG_HS
  252. printf("Received cert\n");
  253. #endif
  254. if(update_finish_hash(f, p)){
  255. fprintf(stderr, "Error updating finish hash with CERT msg\n");
  256. remove_flow(f);
  257. goto err;
  258. }
  259. break;
  260. case TLS_SRVR_KEYEX:
  261. #ifdef DEBUG_HS
  262. printf("Received server keyex\n");
  263. #endif
  264. if(update_finish_hash(f, p)){
  265. fprintf(stderr, "Error updating finish hash with SRVR_KEYEX msg\n");
  266. remove_flow(f);
  267. goto err;
  268. }
  269. if(extract_parameters(f, p)){
  270. printf("Error extracting params\n");
  271. remove_flow(f);
  272. goto err;
  273. }
  274. if(compute_master_secret(f)){
  275. printf("Error computing master secret\n");
  276. remove_flow(f);
  277. goto err;
  278. }
  279. break;
  280. case TLS_CERT_REQ:
  281. if(update_finish_hash(f, p)){
  282. fprintf(stderr, "Error updating finish hash with CERT_REQ msg\n");
  283. remove_flow(f);
  284. goto err;
  285. }
  286. break;
  287. case TLS_SRVR_HELLO_DONE:
  288. #ifdef DEBUG_HS
  289. printf("Received server hello done\n");
  290. #endif
  291. if(update_finish_hash(f, p)){
  292. fprintf(stderr, "Error updating finish hash with HELLO_DONE msg\n");
  293. remove_flow(f);
  294. goto err;
  295. }
  296. break;
  297. case TLS_CERT_VERIFY:
  298. #ifdef DEBUG_HS
  299. printf("received cert verify\n");
  300. #endif
  301. if(update_finish_hash(f, p)){
  302. fprintf(stderr, "Error updating finish hash with CERT_VERIFY msg\n");
  303. remove_flow(f);
  304. goto err;
  305. }
  306. break;
  307. case TLS_CLNT_KEYEX:
  308. #ifdef DEBUG_HS
  309. printf("Received client key exchange\n");
  310. #endif
  311. if(update_finish_hash(f, p)){
  312. fprintf(stderr, "Error updating finish hash with CLNT_KEYEX msg\n");
  313. remove_flow(f);
  314. goto err;
  315. }
  316. break;
  317. case TLS_FINISHED:
  318. #ifdef DEBUG_HS
  319. printf("Received finished (%d) (%x:%d -> %x:%d)\n", incoming, f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  320. #endif
  321. if(verify_finish_hash(f,p, incoming)){
  322. fprintf(stderr, "Error verifying finished hash\n");
  323. remove_flow(f);
  324. goto err;
  325. }
  326. //re-encrypt finished message
  327. int32_t n = encrypt(f, record+RECORD_HEADER_LEN, record+RECORD_HEADER_LEN, record_len - (RECORD_HEADER_LEN+16), incoming, 0x16, 1, 1);
  328. #ifdef HS_DEBUG
  329. printf("New finished ciphertext:\n");
  330. for(int i=0; i< record_len; i++){
  331. printf("%02x ", record[i]);
  332. }
  333. printf("\n");
  334. #endif
  335. if(n<=0){
  336. printf("Error re-encrypting finished (%x:%d -> %x:%d)\n", f->src_ip.s_addr, ntohs(f->src_port),
  337. f->dst_ip.s_addr, ntohs(f->dst_port));
  338. }
  339. if((f->in_encrypted == 2) && (f->out_encrypted == 2)){
  340. f->application = 1;
  341. printf("Handshake complete!\n");
  342. }
  343. break;
  344. default:
  345. printf("Error? (%x:%d -> %x:%d)...\n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  346. remove_flow(f);
  347. goto err;
  348. }
  349. break;
  350. case APP:
  351. printf("Application Data (%x:%d -> %x:%d)...\n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  352. break;
  353. case CCS:
  354. #ifdef DEBUG_HS
  355. printf("CCS (%x:%d -> %x:%d) \n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  356. #endif
  357. /*Initialize ciphers */
  358. if ((!f->in_encrypted) && (!f->out_encrypted)){
  359. if(init_ciphers(f)){
  360. remove_flow(f);
  361. goto err;
  362. }
  363. }
  364. if(incoming){
  365. f->in_encrypted = 1;
  366. } else {
  367. f->out_encrypted = 1;
  368. }
  369. break;
  370. case ALERT:
  371. p = record;
  372. p += RECORD_HEADER_LEN;
  373. if(((incoming) && (f->in_encrypted > 0)) || ((!incoming) && (f->out_encrypted > 0))){
  374. //decrypt alert
  375. encrypt(f, p, p, record_len - RECORD_HEADER_LEN, incoming, 0x16, 0, 0);
  376. p += EVP_GCM_TLS_EXPLICIT_IV_LEN;
  377. }
  378. printf("Alert (%x:%d -> %x:%d) %02x %02x \n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port), p[0], p[1]);
  379. fflush(stdout);
  380. //re-encrypt alert
  381. if(((incoming) && (f->in_encrypted > 0)) || ((!incoming) && (f->out_encrypted > 0))){
  382. int32_t n = encrypt(f, record+RECORD_HEADER_LEN, record+RECORD_HEADER_LEN, record_len - (RECORD_HEADER_LEN+16), incoming, 0x16, 1, 1);
  383. if(n <= 0){
  384. printf("Error re-encrypting alert\n");
  385. }
  386. }
  387. break;
  388. case HB:
  389. printf("Heartbeat\n");
  390. break;
  391. default:
  392. printf("Error: Not a Record (%x:%d -> %x:%d)\n", f->src_ip.s_addr, ntohs(f->src_port), f->dst_ip.s_addr, ntohs(f->dst_port));
  393. fflush(stdout);
  394. remove_flow(f);
  395. goto err;
  396. }
  397. return 0;
  398. err:
  399. return 1;
  400. }
  401. /** Removes the tagged flow from the flow table: happens when
  402. * the station receives a TCP RST or FIN packet
  403. *
  404. * Input:
  405. * index: the index into the flow table of the tagged flow
  406. *
  407. * Output:
  408. * 0 on success, 1 on failure
  409. */
  410. int remove_flow(flow *f) {
  411. sem_wait(&flow_table_lock);
  412. //decrement reference counter
  413. f->ref_ctr--;
  414. if(f->ref_ctr){ //if there are still references to f, wait to free it
  415. printf("Cannot free %p, still %d reference(s)\n", f, f->ref_ctr);
  416. f->removed = 1;
  417. sem_post(&flow_table_lock);
  418. return 0;
  419. }
  420. if(f->removed)
  421. printf("Trying again to free\n");
  422. frame *first_frame = f->us_frame_queue->first_frame;
  423. while(first_frame != NULL){
  424. printf("Injecting delayed frame (seq = %u )\n", first_frame->seq_num);
  425. inject_packet(first_frame->iargs, first_frame->header, first_frame->packet);
  426. frame *tmp = first_frame->next;
  427. free(first_frame);
  428. first_frame = tmp;
  429. }
  430. free(f->us_frame_queue);
  431. first_frame = f->ds_frame_queue->first_frame;
  432. while(first_frame != NULL){
  433. printf("Injecting delayed frame (seq = %u )\n", first_frame->seq_num);
  434. inject_packet(first_frame->iargs, first_frame->header, first_frame->packet);
  435. frame *tmp = first_frame->next;
  436. free(first_frame);
  437. first_frame = tmp;
  438. }
  439. free(f->ds_frame_queue);
  440. //Empty application data queues
  441. packet *tmp = f->upstream_app_data->first_packet;
  442. while(tmp != NULL){
  443. f->upstream_app_data->first_packet = tmp->next;
  444. free(tmp->data);
  445. free(tmp);
  446. tmp = f->upstream_app_data->first_packet;
  447. }
  448. free(f->upstream_app_data);
  449. tmp = f->downstream_app_data->first_packet;
  450. while(tmp != NULL){
  451. f->downstream_app_data->first_packet = tmp->next;
  452. free(tmp->data);
  453. free(tmp);
  454. tmp = f->downstream_app_data->first_packet;
  455. }
  456. free(f->downstream_app_data);
  457. if(f->ds_hs_queue != NULL){
  458. remove_queue(f->ds_hs_queue);
  459. }
  460. if(f->us_hs_queue != NULL){
  461. remove_queue(f->us_hs_queue);
  462. }
  463. //free partial record headers
  464. if(f->partial_record_header_len > 0){
  465. f->partial_record_header_len = 0;
  466. free(f->partial_record_header);
  467. }
  468. //Clean up cipher ctxs
  469. EVP_MD_CTX_cleanup(f->finish_md_ctx);
  470. if(f->finish_md_ctx != NULL){
  471. EVP_MD_CTX_destroy(f->finish_md_ctx);
  472. }
  473. if(f->clnt_read_ctx != NULL){
  474. EVP_CIPHER_CTX_cleanup(f->clnt_read_ctx);
  475. OPENSSL_free(f->clnt_read_ctx);
  476. f->clnt_read_ctx = NULL;
  477. }
  478. if(f->clnt_write_ctx != NULL){
  479. EVP_CIPHER_CTX_cleanup(f->clnt_write_ctx);
  480. OPENSSL_free(f->clnt_write_ctx);
  481. f->clnt_write_ctx = NULL;
  482. }
  483. if(f->srvr_read_ctx != NULL){
  484. EVP_CIPHER_CTX_free(f->srvr_read_ctx);
  485. }
  486. if(f->srvr_write_ctx != NULL){
  487. EVP_CIPHER_CTX_free(f->srvr_write_ctx);
  488. }
  489. if(f->ecdh != NULL){
  490. EC_KEY_free(f->ecdh);
  491. }
  492. if(f->dh != NULL){
  493. DH_free(f->dh);
  494. }
  495. if(f->current_session != NULL && f->resume_session == 1){
  496. if( f->current_session->session_ticket != NULL){
  497. free(f->current_session->session_ticket);
  498. }
  499. free(f->current_session);
  500. }
  501. if(f->ds_packet_chain != NULL){
  502. packet *tmp = f->ds_packet_chain->first_packet;
  503. while(tmp != NULL){
  504. f->ds_packet_chain->first_packet = tmp->next;
  505. printf("Freed data %p\n", tmp->data);
  506. printf("Freed packet %p\n", tmp);
  507. free(tmp->data);
  508. free(tmp);
  509. tmp = f->ds_packet_chain->first_packet;
  510. }
  511. }
  512. free(f->ds_packet_chain);
  513. if(f->us_packet_chain != NULL){
  514. packet *tmp = f->us_packet_chain->first_packet;
  515. while(tmp != NULL){
  516. f->us_packet_chain->first_packet = tmp->next;
  517. printf("Freed data %p\n", tmp->data);
  518. printf("Freed packet %p\n", tmp);
  519. free(tmp->data);
  520. free(tmp);
  521. tmp = f->us_packet_chain->first_packet;
  522. }
  523. }
  524. free(f->us_packet_chain);
  525. if(f->upstream_queue != NULL){
  526. queue_block *tmp = f->upstream_queue;
  527. while(tmp != NULL){
  528. f->upstream_queue = tmp->next;
  529. printf("Freed data %p\n", tmp->data);
  530. printf("Freed packet %p\n", tmp);
  531. free(tmp->data);
  532. free(tmp);
  533. tmp = f->upstream_queue;
  534. }
  535. }
  536. flow_entry *entry = table->first_entry;
  537. if(entry->f == f){
  538. table->first_entry = entry->next;
  539. free(entry->f);
  540. free(entry);
  541. table->len --;
  542. } else {
  543. flow_entry *next;
  544. for(int i=0; i< table->len; i++){
  545. if(entry->next != NULL){
  546. next = entry->next;
  547. } else {
  548. printf("Flow not in table\n");
  549. break;
  550. }
  551. if(next->f == f){
  552. entry->next = next->next;
  553. free(next->f);
  554. free(next);
  555. table->len --;
  556. break;
  557. }
  558. entry = next;
  559. }
  560. }
  561. sem_post(&flow_table_lock);
  562. return 1;
  563. }
  564. /** Returns the index of a flow in the flow table if
  565. * it exists, returns 0 if it is not present.
  566. *
  567. * Inputs:
  568. * observed: details for the observed flow
  569. *
  570. * Output:
  571. * flow struct from table or NULL if it doesn't exist
  572. */
  573. flow *check_flow(struct packet_info *info){
  574. /* Loop through flows in table and see if it exists */
  575. int i;
  576. flow_entry *entry = table->first_entry;
  577. flow *candidate;
  578. flow *found = NULL;
  579. if(entry == NULL)
  580. return NULL;
  581. sem_wait(&flow_table_lock);
  582. /* Check first in this direction */
  583. for(i=0; i<table->len; i++){
  584. if(entry == NULL){
  585. printf("Error: entry is null\n");
  586. break;
  587. }
  588. candidate = entry->f;
  589. if(candidate->src_ip.s_addr == info->ip_hdr->src.s_addr){
  590. if(candidate->dst_ip.s_addr == info->ip_hdr->dst.s_addr){
  591. if(candidate->src_port == info->tcp_hdr->src_port){
  592. if(candidate->dst_port == info->tcp_hdr->dst_port){
  593. found = candidate;
  594. }
  595. }
  596. }
  597. }
  598. entry = entry->next;
  599. }
  600. entry = table->first_entry;
  601. /* Then in the other direction */
  602. for(i=0; i<table->len; i++){
  603. if(entry == NULL){
  604. printf("Error: entry is null\n");
  605. break;
  606. }
  607. candidate = entry->f;
  608. if(candidate->src_ip.s_addr == info->ip_hdr->dst.s_addr){
  609. if(candidate->dst_ip.s_addr == info->ip_hdr->src.s_addr){
  610. if(candidate->src_port == info->tcp_hdr->dst_port){
  611. if(candidate->dst_port == info->tcp_hdr->src_port){
  612. found = candidate;
  613. }
  614. }
  615. }
  616. }
  617. entry = entry->next;
  618. }
  619. if(found != NULL){
  620. found->ref_ctr++;
  621. printf("Acquiring flow (%p ref ctr %d)\n", found, found->ref_ctr);
  622. }
  623. sem_post(&flow_table_lock);
  624. if(found != NULL && found->removed){
  625. remove_flow(found);
  626. found=NULL;
  627. }
  628. return found;
  629. }
  630. int init_session_cache(void){
  631. sessions = emalloc(sizeof(session_cache));
  632. sessions->length = 0;
  633. sessions->first_session = NULL;
  634. return 0;
  635. }
  636. /** Called from ServerHello, verifies that the session id returned matches
  637. * the session id requested from the client hello
  638. *
  639. * Input:
  640. * f: the tagged flow
  641. * hs: a pointer to the ServerHello message
  642. *
  643. * Output:
  644. * 0 if success, 1 if failed
  645. */
  646. int verify_session_id(flow *f, uint8_t *hs){
  647. if (f->current_session == NULL)
  648. return 1;
  649. //increment pointer to point to sessionid
  650. uint8_t *p = hs + HANDSHAKE_HEADER_LEN;
  651. p += 2; //skip version
  652. p += SSL3_RANDOM_SIZE; //skip random
  653. uint8_t id_len = (uint8_t) p[0];
  654. p ++;
  655. //check to see if it matches flow's session id set by ClientHello
  656. if(f->current_session->session_id_len > 0 && !memcmp(f->current_session->session_id, p, id_len)){
  657. //if it matched, update flow with master secret :D
  658. #ifdef DEBUG_HS
  659. printf("Session id matched!\n");
  660. printf("First session id (%p->%p):", sessions, sessions->first_session);
  661. #endif
  662. session *last = sessions->first_session;
  663. int found = 0;
  664. for(int i=0; ((i<sessions->length) && (!found)); i++){
  665. #ifdef DEBUG_HS
  666. printf("Checking saved session id: ");
  667. for (int j=0; j< last->session_id_len; j++){
  668. printf("%02x ", last->session_id[j]);
  669. }
  670. printf("\n");
  671. #endif
  672. if(!memcmp(last->session_id, f->current_session->session_id, id_len)){
  673. memcpy(f->master_secret, last->master_secret, SSL3_MASTER_SECRET_SIZE);
  674. found = 1;
  675. }
  676. last = last->next;
  677. }
  678. if((!found) && (f->current_session->session_ticket_len > 0)){
  679. last = sessions->first_session;
  680. for(int i=0; ((i<sessions->length) && (!found)); i++){
  681. if( (last->session_ticket != NULL) && (last->session_ticket_len == f->current_session->session_ticket_len)){
  682. if(!memcmp(last->session_ticket, f->current_session->session_ticket, f->current_session->session_ticket_len)){
  683. memcpy(f->master_secret, last->master_secret, SSL3_MASTER_SECRET_SIZE);
  684. found = 1;
  685. #ifdef DEBUG_HS
  686. printf("Found new session ticket (%x:%d -> %x:%d)\n", f->src_ip.s_addr, f->src_port, f->dst_ip.s_addr, f->dst_port);
  687. for(int i=0; i< last->session_ticket_len; i++){
  688. printf("%02x ", last->session_ticket[i]);
  689. }
  690. printf("\n");
  691. #endif
  692. }
  693. }
  694. last = last->next;
  695. }
  696. }
  697. } else if (f->current_session->session_id_len == 0){
  698. //search for session ticket in session cache
  699. printf("clnt session id was empty, looking for ticket\n");
  700. session *last = sessions->first_session;
  701. if(f->current_session->session_ticket_len > 0){
  702. last = sessions->first_session;
  703. for(int i=0; i<sessions->length; i++){
  704. if(last->session_ticket_len == f->current_session->session_ticket_len){
  705. if(!memcmp(last->session_ticket, f->current_session->session_ticket, f->current_session->session_ticket_len)){
  706. memcpy(f->master_secret, last->master_secret, SSL3_MASTER_SECRET_SIZE);
  707. #ifdef DEBUG_HS
  708. printf("Found new session ticket (%x:%d -> %x:%d)\n", f->src_ip.s_addr, f->src_port, f->dst_ip.s_addr, f->dst_port);
  709. for(int i=0; i< last->session_ticket_len; i++){
  710. printf("%02x ", last->session_ticket[i]);
  711. }
  712. printf("\n");
  713. break;
  714. #endif
  715. }
  716. }
  717. last = last->next;
  718. }
  719. }
  720. } else if (f->current_session->session_id_len > 0){
  721. //server refused resumption, save new session id
  722. printf("session ids did not match, saving new id\n");
  723. save_session_id(f, p);
  724. }
  725. return 0;
  726. }
  727. /* Called from ClientHello. Checks to see if the session id len is > 0. If so,
  728. * saves sessionid for later verification. Also checks to see if a session
  729. * ticket is included as an extension.
  730. *
  731. * Input:
  732. * f: the tagged flow
  733. * hs: a pointer to the ServerHello message
  734. *
  735. * Output:
  736. * 0 if success, 1 if failed
  737. */
  738. int check_session(flow *f, uint8_t *hs, uint32_t len){
  739. uint8_t *p = hs + HANDSHAKE_HEADER_LEN;
  740. p += 2; //skip version
  741. p += SSL3_RANDOM_SIZE; //skip random
  742. session *new_session = emalloc(sizeof(session));
  743. new_session->session_id_len = (uint8_t) p[0];
  744. new_session->session_ticket_len = 0;
  745. new_session->session_ticket = NULL;
  746. p ++;
  747. if(new_session->session_id_len > 0){
  748. f->resume_session = 1;
  749. memcpy(new_session->session_id, p, new_session->session_id_len);
  750. new_session->next = NULL;
  751. #ifdef DEBUG_HS
  752. printf("Requested new session (%x:%d -> %x:%d)\n", f->src_ip.s_addr, f->src_port, f->dst_ip.s_addr, f->dst_port);
  753. printf("session id: \n");
  754. for(int i=0; i< new_session->session_id_len; i++){
  755. printf("%02x ", p[i]);
  756. }
  757. printf("\n");
  758. #endif
  759. f->current_session = new_session;
  760. }
  761. p += new_session->session_id_len;
  762. //check to see if there is a session ticket included
  763. //skip to extensions
  764. uint16_t ciphersuite_len = (p[0] << 8) + p[1];
  765. p += 2 + ciphersuite_len;
  766. uint8_t compress_meth_len = p[0];
  767. p += 1 + compress_meth_len;
  768. //search for SessionTicket TLS extension
  769. if(2 + SSL3_RANDOM_SIZE + new_session->session_id_len + 1 + 2 + ciphersuite_len + 1 + compress_meth_len > len){
  770. //no extension
  771. if(f->current_session == NULL)
  772. free(new_session);
  773. return 0;
  774. }
  775. uint16_t extensions_len = (p[0] << 8) + p[1];
  776. p += 2;
  777. while(extensions_len > 0){
  778. uint16_t type = (p[0] << 8) + p[1];
  779. p += 2;
  780. uint16_t ext_len = (p[0] << 8) + p[1];
  781. p += 2;
  782. if(type == 0x23){
  783. if(ext_len > 0){
  784. f->resume_session = 1;
  785. new_session->session_ticket_len = ext_len;
  786. new_session->session_ticket = ecalloc(1, ext_len);
  787. memcpy(new_session->session_ticket, p, ext_len);
  788. f->current_session = new_session;
  789. }
  790. }
  791. p += ext_len;
  792. extensions_len -= (4 + ext_len);
  793. }
  794. if(!f->resume_session){
  795. free(new_session);
  796. f->stall = 0; //unstall the next packet
  797. }
  798. return 0;
  799. }
  800. /* Called from ServerHello during full handshake. Adds the session id to the
  801. * cache for later resumptions
  802. *
  803. * Input:
  804. * f: the tagged flow
  805. * hs: a pointer to the ServerHello message
  806. *
  807. * Output:
  808. * 0 if success, 1 if failed
  809. */
  810. int save_session_id(flow *f, uint8_t *hs){
  811. //increment pointer to point to sessionid
  812. uint8_t *p = hs + HANDSHAKE_HEADER_LEN;
  813. p += 2; //skip version
  814. p += SSL3_RANDOM_SIZE; //skip random
  815. session *new_session = emalloc(sizeof(session));
  816. new_session->session_id_len = (uint8_t) p[0];
  817. if((new_session->session_id_len <= 0) || (new_session->session_id_len > SSL_MAX_SSL_SESSION_ID_LENGTH)){
  818. //if this value is zero, the session is non-resumable or the
  819. //server will issue a NewSessionTicket handshake message
  820. free(new_session);
  821. return 0;
  822. }
  823. p++;
  824. memcpy(new_session->session_id, p, new_session->session_id_len);
  825. new_session->session_ticket_len = 0;
  826. new_session->session_ticket = NULL;
  827. new_session->next = NULL;
  828. if(f->current_session != NULL){
  829. free(f->current_session);
  830. }
  831. f->resume_session = 0;
  832. f->current_session = new_session;
  833. if(sessions->first_session == NULL){
  834. sessions->first_session = new_session;
  835. printf("First session id (%p->%p):", sessions, sessions->first_session);
  836. for(int i=0; i< new_session->session_id_len; i++){
  837. printf(" %02x", sessions->first_session->session_id[i]);
  838. }
  839. printf("\n");
  840. } else {
  841. session *last = sessions->first_session;
  842. for(int i=0; i< sessions->length -1; i++){
  843. if(last == NULL){
  844. printf("UH OH: last is null?\n");
  845. fflush(stdout);
  846. }
  847. last = last->next;
  848. }
  849. last->next = new_session;
  850. }
  851. sessions->length ++;
  852. #ifdef DEBUG_HS
  853. printf("Saved session id:");
  854. for(int i=0; i< new_session->session_id_len; i++){
  855. printf(" %02x", new_session->session_id[i]);
  856. }
  857. printf("\n");
  858. printf("THERE ARE NOW %d saved sessions\n", sessions->length);
  859. #endif
  860. return 0;
  861. }
  862. /* Called from NewSessionTicket. Adds the session ticket to the
  863. * cache for later resumptions
  864. *
  865. * Input:
  866. * f: the tagged flow
  867. * hs: a pointer to the ServerHello message
  868. *
  869. * Output:
  870. * 0 if success, 1 if failed
  871. */
  872. int save_session_ticket(flow *f, uint8_t *hs, uint32_t len){
  873. #ifdef DEBUG_HS
  874. printf("TICKET HDR:");
  875. for(int i=0; i< HANDSHAKE_HEADER_LEN; i++){
  876. printf("%02x ", hs[i]);
  877. }
  878. printf("\n");
  879. #endif
  880. uint8_t *p = hs + HANDSHAKE_HEADER_LEN;
  881. p += 4;
  882. session *new_session = ecalloc(1, sizeof(session));
  883. new_session->session_id_len = 0;
  884. new_session->session_ticket_len = (p[0] << 8) + p[1];
  885. new_session->next = NULL;
  886. p += 2;
  887. uint8_t *ticket = emalloc(new_session->session_ticket_len);
  888. memcpy(ticket, p, new_session->session_ticket_len);
  889. new_session->session_ticket = ticket;
  890. memcpy(new_session->master_secret, f->master_secret, SSL3_MASTER_SECRET_SIZE);
  891. if(sessions->first_session == NULL){
  892. sessions->first_session = new_session;
  893. } else {
  894. session *last = sessions->first_session;
  895. for(int i=0; i< (sessions->length-1); i++){
  896. if(last == NULL){
  897. printf("UH OH: last is null?\n");
  898. fflush(stdout);
  899. }
  900. last = last->next;
  901. }
  902. last->next = new_session;
  903. }
  904. sessions->length ++;
  905. #ifdef DEBUG_HS
  906. printf("Saved session ticket:");
  907. for(int i=0; i< new_session->session_ticket_len; i++){
  908. printf(" %02x", p[i]);
  909. }
  910. printf("\n");
  911. fflush(stdout);
  912. printf("Saved session master secret:");
  913. for(int i=0; i< SSL3_MASTER_SECRET_SIZE; i++){
  914. printf(" %02x", new_session->master_secret[i]);
  915. }
  916. printf("\n");
  917. fflush(stdout);
  918. printf("THERE ARE NOW %d saved sessions (2)\n", sessions->length);
  919. fflush(stdout);
  920. #endif
  921. return 0;
  922. }
  923. /* Adds a (handshake) packet to the flow's packet chain. If it can complete a record, passes
  924. * this record to update_flow
  925. *
  926. * Note: the code in slitheen-proxy.c should ensure that this function only ever gets the next
  927. * expected sequence number
  928. */
  929. int add_packet(flow *f, struct packet_info *info){
  930. if (info->tcp_hdr == NULL || info->app_data_len <= 0){
  931. return 0;
  932. }
  933. packet *new_packet = emalloc(sizeof(packet));
  934. new_packet->seq_num = ntohl(info->tcp_hdr->sequence_num);
  935. new_packet->len = info->app_data_len;
  936. uint8_t *packet_data = emalloc(new_packet->len);
  937. memcpy(packet_data, info->app_data, new_packet->len);
  938. new_packet->data = packet_data;
  939. new_packet->next = NULL;
  940. uint8_t incoming = (info->ip_hdr->src.s_addr == f->src_ip.s_addr) ? 0 : 1;
  941. packet_chain *chain = (incoming) ? f->ds_packet_chain : f->us_packet_chain;
  942. queue *packet_queue = (incoming) ? f->ds_hs_queue : f->us_hs_queue;
  943. if(new_packet->seq_num < chain->expected_seq_num){
  944. //see if this packet contains any data we are missing
  945. //TODO: figure out how/why this happens and what should follow
  946. printf("ERROR: Received replayed packet O.o\n");
  947. free(new_packet->data);
  948. free(new_packet);
  949. remove_flow(f);
  950. return 1;
  951. }
  952. if(new_packet->seq_num > chain->expected_seq_num) {
  953. printf("ERROR: Received future packet O.o\n");
  954. free(new_packet->data);
  955. free(new_packet);
  956. remove_flow(f);
  957. return 1;
  958. }
  959. //temporary: see if it's the only packet, if so is new record
  960. if(peek(packet_queue, 0) == NULL){
  961. if(new_packet->seq_num == chain->expected_seq_num){
  962. const struct record_header *record_hdr = (struct record_header *) new_packet->data;
  963. chain->record_len = RECORD_LEN(record_hdr)+RECORD_HEADER_LEN;
  964. chain->remaining_record_len = chain->record_len;
  965. }
  966. }
  967. //append packet to queue
  968. enqueue(packet_queue, new_packet);
  969. chain->expected_seq_num += new_packet->len;
  970. uint32_t record_offset = 0; //offset into record for updating info with any changes
  971. uint32_t info_offset = 0; //offset into info for updating with changes
  972. uint32_t info_len = 0; //number of bytes that possibly changed
  973. //while there is still data left:
  974. uint32_t available_data = new_packet->len;
  975. while(available_data > 0){
  976. //if full record, give to update_flow
  977. if(chain->remaining_record_len <= new_packet->len){//we have enough to make a record
  978. chain->remaining_record_len = 0;
  979. uint8_t *record = emalloc(chain->record_len);
  980. uint32_t record_len = chain->record_len;
  981. uint32_t tmp_len = chain->record_len;
  982. packet *next = peek(packet_queue, 0);
  983. while(tmp_len > 0){
  984. if(tmp_len >= next->len){
  985. memcpy(record+chain->record_len - tmp_len, next->data, next->len);
  986. if(next == new_packet){
  987. new_packet = NULL;//TODO: why?
  988. record_offset = chain->record_len - tmp_len;
  989. info_len = next->len;
  990. }
  991. tmp_len -= next->len;
  992. //remove packet from queue
  993. next = dequeue(packet_queue);
  994. free(next->data);
  995. free(next);
  996. next = peek(packet_queue, 0); //TODO: Do we need this???
  997. available_data = 0;
  998. } else { //didn't use up entire packet
  999. memcpy(record+chain->record_len - tmp_len, next->data, tmp_len);
  1000. if(next == new_packet){//TODO: opposite shouldn't happen?
  1001. record_offset = chain->record_len - tmp_len;
  1002. info_len = tmp_len;
  1003. }
  1004. memmove(next->data, next->data+tmp_len, next->len - tmp_len);
  1005. next->len -= tmp_len;
  1006. available_data -= tmp_len;
  1007. tmp_len = 0;
  1008. //Last part of packet is a new record
  1009. const struct record_header *record_hdr = (struct record_header *) next->data;
  1010. chain->record_len = RECORD_LEN(record_hdr)+RECORD_HEADER_LEN;
  1011. chain->remaining_record_len = chain->record_len;
  1012. #ifdef DEBUG
  1013. printf("Found record of type %d\n", record_hdr->type);
  1014. fflush(stdout);
  1015. #endif
  1016. }
  1017. }
  1018. //if handshake is complete, send to relay code
  1019. if(f->application == 1){
  1020. //update packet info and send to replace_packet
  1021. struct packet_info *copy_info = copy_packet_info(info);
  1022. copy_info->app_data = record;
  1023. copy_info->app_data_len = record_len;
  1024. replace_packet(f, copy_info);
  1025. free(copy_info->app_data);
  1026. free(copy_info);
  1027. } else {
  1028. if(update_flow(f, record, incoming)){
  1029. free(record);
  1030. return 1;//error occurred and flow was removed
  1031. }
  1032. if(f->in_encrypted ==2){
  1033. //if server finished message was received, copy changes back to packet
  1034. #ifdef DEBUG
  1035. printf("Replacing info->data with finished message (%d bytes).\n", info_len);
  1036. printf("Previous bytes:\n");
  1037. for(int i=0; i<info_len; i++){
  1038. printf("%02x ", info->app_data[info_offset+i]);
  1039. }
  1040. printf("\n");
  1041. printf("New bytes:\n");
  1042. for(int i=0; i<info_len; i++){
  1043. printf("%02x ", record[record_offset+i]);
  1044. }
  1045. printf("\n");
  1046. printf("SLITHEEN: Previous packet contents:\n");
  1047. for(int i=0; i< info->app_data_len; i++){
  1048. printf("%02x ", info->app_data[i]);
  1049. }
  1050. printf("\n");
  1051. #endif
  1052. memcpy(info->app_data+info_offset, record+record_offset, info_len);
  1053. #ifdef DEBUG
  1054. printf("SLITHEEN: Current packet contents:\n");
  1055. for(int i=0; i< info->app_data_len; i++){
  1056. printf("%02x ", info->app_data[i]);
  1057. }
  1058. printf("\n");
  1059. #endif
  1060. //update TCP checksum
  1061. tcp_checksum(info);
  1062. }
  1063. free(record);
  1064. if(new_packet != NULL){
  1065. info_offset += info_len;
  1066. }
  1067. }
  1068. } else {//can't make a full record yet
  1069. chain->remaining_record_len -= new_packet->len;
  1070. available_data = 0;
  1071. }
  1072. } //exhausted new packet len
  1073. return 0;
  1074. }