flow.c 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <stdint.h>
  4. #include <pthread.h>
  5. #include <errno.h>
  6. #include "flow.h"
  7. #include "crypto.h"
  8. #include "slitheen.h"
  9. static flow_table *table;
  10. /* Initialize the table of tagged flows */
  11. int init_flow_table(void) {
  12. table = malloc(sizeof(flow_table));
  13. table->table = (flow *) malloc(sizeof(flow)*MAX_FLOWS);
  14. if( table->table == NULL){
  15. fprintf(stderr, "malloc failed.\n");
  16. return 1;
  17. }
  18. table->len = 0;
  19. table->max_len = MAX_FLOWS;
  20. return 0;
  21. }
  22. /* Add a new flow to the tagged flow table */
  23. flow *add_flow(flow newFlow) {
  24. flow *ptr;
  25. if(table->len == table->max_len){
  26. //grow_table();
  27. NULL;
  28. }
  29. printf("there are %d flows in the table\n", table->len);
  30. ptr = table->table + table->len;
  31. newFlow.state = TLS_CLNT_HELLO;
  32. newFlow.in_encrypted = 0;
  33. newFlow.out_encrypted = 0;
  34. newFlow.application = 0;
  35. newFlow.packet_chain = NULL;
  36. newFlow.censored_queue = calloc(1,2048);
  37. newFlow.censored_length = 0;
  38. newFlow.outbox_len = 0;
  39. newFlow.finish_md_ctx = EVP_MD_CTX_create();
  40. const EVP_MD *md = EVP_sha384();
  41. EVP_DigestInit_ex(newFlow.finish_md_ctx, md, NULL);
  42. memset(newFlow.read_seq, 0, 8);
  43. memset(newFlow.write_seq, 0, 8);
  44. *ptr = newFlow;
  45. table->len ++;
  46. return ptr;
  47. }
  48. /* Updates the flow state */
  49. int update_flow(flow *f) {
  50. uint8_t *record;
  51. const struct record_header *record_hdr;
  52. const struct handshake_header *handshake_hdr;
  53. uint8_t *p = f->packet_chain->data;
  54. record_hdr = (struct record_header*) p;
  55. int record_len;
  56. int data_len;
  57. //printf("record version(major): %d.\n", (record_hdr->version&0xFF00)>>8);
  58. //printf("record version(minor): %d.\n", record_hdr->version&0xFF);
  59. //printf("record length: %d.\n", RECORD_LEN(record_hdr));
  60. record_len = RECORD_LEN(record_hdr)+RECORD_HEADER_LEN;
  61. data_len = f->packet_chain->data_len;
  62. packet *current = f->packet_chain;
  63. int incoming = current->incoming;
  64. record = calloc(1, record_len);
  65. for(int i=0; (i<data_len) && (i<record_len); i++){
  66. record[i] = p[i];
  67. }
  68. //printf("record len: %d, data_len: %d\n", record_len, data_len);
  69. while(record_len > data_len) {
  70. if(current->next == NULL){
  71. //printf("Don't have enought to reconstruct record\n");
  72. free(record);
  73. return 0;
  74. }
  75. if(current->next->seq_num != current->seq_num + current->len){
  76. printf("Missing packet: seq_num= %d, datalen= %d, nextseq= %d\n", current->seq_num, current->len, current->next->seq_num);
  77. free(record);
  78. return 0;
  79. }
  80. current = current->next;
  81. p = current->data;
  82. int i;
  83. for(i=0; (i<current->data_len) && (i+data_len < record_len); i++){
  84. record[data_len+i] = p[i];
  85. }
  86. //printf("Filled %d\n", i);
  87. data_len += current->data_len;
  88. }
  89. switch(record_hdr->type){
  90. case HS:
  91. p = record;
  92. p += RECORD_HEADER_LEN;
  93. //int size_hs = HANDSHAKE_MESSAGE_LEN(handshake_hdr);
  94. printf("Handshake Message:\n");
  95. if((incoming && f->in_encrypted) || (!incoming && f->out_encrypted)){
  96. encrypt(f, p, p, record_len - RECORD_HEADER_LEN, incoming, 0x16, 0);
  97. p += EVP_GCM_TLS_EXPLICIT_IV_LEN;
  98. if(incoming) f->in_encrypted = 2;
  99. else f->out_encrypted = 2;
  100. }
  101. handshake_hdr = (struct handshake_header*) p;
  102. f->state = handshake_hdr->type;
  103. printf("record length: %d, hanshake length: %d\n", record_len, HANDSHAKE_MESSAGE_LEN(handshake_hdr));
  104. /* Now see if there's anything extra to do */
  105. switch(f->state){
  106. /* Checks to see if this is a possibly tagged hello msg */
  107. case TLS_CLNT_HELLO:
  108. /* Expecting server hello msg */
  109. printf("Received client hello!\n");
  110. update_finish_hash(f, p);
  111. break;
  112. case TLS_SERV_HELLO:
  113. extract_server_random(f, p);
  114. update_finish_hash(f, p);
  115. printf("Received server hello!\n");
  116. break;
  117. case TLS_NEW_SESS:
  118. update_finish_hash(f, p);
  119. printf("Received new session ticket!\n");
  120. break;
  121. case TLS_CERT:
  122. update_finish_hash(f, p);
  123. printf("Received certificate!\n");
  124. break;
  125. case TLS_SRVR_KEYEX:
  126. update_finish_hash(f, p);
  127. printf("Received server key exchange!\n");
  128. /* Need to extract server params */
  129. if(extract_parameters(f, p)){
  130. printf("Error extracting params\n");
  131. }
  132. if(compute_master_secret(f)){
  133. printf("Error computing master secret\n");
  134. }
  135. break;
  136. case TLS_CERT_REQ:
  137. update_finish_hash(f, p);
  138. printf("Received certificate request!\n");
  139. break;
  140. case TLS_SRVR_HELLO_DONE:
  141. update_finish_hash(f, p);
  142. printf("Received server hello done!\n");
  143. break;
  144. case TLS_CERT_VERIFY:
  145. update_finish_hash(f, p);
  146. printf("Received certificate verify!\n");
  147. break;
  148. case TLS_CLNT_KEYEX:
  149. update_finish_hash(f, p);
  150. printf("Received client key exchange!\n");
  151. break;
  152. case TLS_FINISHED:
  153. verify_finish_hash(f,p, incoming);
  154. update_finish_hash(f, p);
  155. printf("Received finished message!\n");
  156. if((f->in_encrypted == 2) && (f->out_encrypted == 2)){
  157. printf("Handshake complete!\n");
  158. f->application = 1;
  159. if(current->incoming)
  160. f->seq_num = current->seq_num + current->len;
  161. printf("current sequence number: %d = %d, plus length %d\n", f->seq_num, current->seq_num, current->len);
  162. //update sequence number to reflect latest incoming packet
  163. while(current->next != NULL){
  164. current = current->next;
  165. if(current->incoming)
  166. f->seq_num = current->seq_num+ current->len;
  167. printf("current sequence number: %d, plus length %d\n", current->seq_num, current->len);
  168. }
  169. }
  170. break;
  171. default:
  172. printf("Error? %02x\n",p[0]);
  173. break;
  174. }
  175. break;
  176. case APP:
  177. printf("Application Data\n");
  178. //decrypt this
  179. break;
  180. case CCS:
  181. printf("Change of Cipher Spec\n");
  182. if(incoming){
  183. f->in_encrypted = 1;
  184. } else {
  185. f->out_encrypted = 1;
  186. }
  187. /*Initialize ciphers */
  188. init_ciphers(f);
  189. break;
  190. case ALERT:
  191. p = record;
  192. p += RECORD_HEADER_LEN;
  193. encrypt(f, p, p, record_len - RECORD_HEADER_LEN, incoming, 0x16, 0);
  194. p += EVP_GCM_TLS_EXPLICIT_IV_LEN;
  195. printf("Alert: %02x %02x\n", p[0], p[1]);
  196. break;
  197. case HB:
  198. printf("Heartbeat\n");
  199. break;
  200. default:
  201. printf("Error: Not a Record\n");
  202. //TODO: later figure this out, for now delete
  203. f->packet_chain = f->packet_chain->next;
  204. if( f->packet_chain != NULL){
  205. update_flow(f);
  206. }
  207. return 0;
  208. }
  209. //TODO: clean this up
  210. if(!f->application){
  211. f->seq_num = current->seq_num;
  212. if(record_len == data_len){
  213. /* record ended on packet boundary */
  214. f->packet_chain = current->next;
  215. } else {
  216. /* need to update data */
  217. f->packet_chain = current; //TODO: make current
  218. current->data = current->data + (current->data_len - (data_len - record_len));
  219. current->data_len = data_len - record_len;
  220. update_flow(f);
  221. }
  222. }
  223. free(record);
  224. return 0;
  225. }
  226. int remove_flow(int index) {
  227. int i;
  228. flow *ptr;
  229. if(index){
  230. ptr = table->table + index -1;
  231. for(i=0; i< table->len - index; i++){
  232. ptr += i;
  233. *ptr = *(ptr + 1);
  234. }
  235. table->len --;
  236. } else {
  237. return 1;
  238. }
  239. printf("flow removed!\n");
  240. return 0;
  241. }
  242. int grow_table() {
  243. return 0;
  244. }
  245. /** Returns the index of a flow in the flow table if
  246. * it exists, returns 0 if it is not present.
  247. */
  248. int check_flow(flow observed){
  249. /* Loop through flows in table and see if it exists */
  250. int i;
  251. flow *candidate = table->table;
  252. /* Check first in this direction */
  253. for(i=0; i<table->len; i++){
  254. candidate += i;
  255. if(candidate->src_ip.s_addr == observed.src_ip.s_addr){
  256. if(candidate->dst_ip.s_addr == observed.dst_ip.s_addr){
  257. if(candidate->src_port == observed.src_port){
  258. if(candidate->dst_port == observed.dst_port){
  259. return i+1;
  260. }
  261. }
  262. }
  263. }
  264. }
  265. candidate = table->table;
  266. /* Then in the other direction */
  267. for(i=0; i<table->len; i++){
  268. candidate += i;
  269. if(candidate->src_ip.s_addr == observed.dst_ip.s_addr){
  270. if(candidate->dst_ip.s_addr == observed.src_ip.s_addr){
  271. if(candidate->src_port == observed.dst_port){
  272. if(candidate->dst_port == observed.src_port){
  273. return i+1;
  274. }
  275. }
  276. }
  277. }
  278. }
  279. return 0;
  280. }
  281. flow *get_flow(int index){
  282. if(index < table->len){
  283. return table->table+index;
  284. } else {
  285. return NULL;
  286. }
  287. }
  288. /* Adds a packet the flow's packet chain */
  289. int add_packet(flow *f, uint8_t *p){
  290. const struct ip_header *ip_hdr;
  291. const struct tcp_header *tcp_hdr;
  292. packet *new_packet = malloc(sizeof(packet));
  293. p += ETHER_HEADER_LEN; //skip ethernet header
  294. ip_hdr = (struct ip_header*) p;
  295. int size_ip = IP_HEADER_LEN(ip_hdr);
  296. if (ip_hdr->proto != IPPROTO_TCP){
  297. return 0;
  298. }
  299. p += size_ip; //skip IP header
  300. tcp_hdr = (struct tcp_header*) p;
  301. int size_tcp = TCP_HEADER_LEN(tcp_hdr);
  302. p += size_tcp;
  303. new_packet->seq_num = htonl(tcp_hdr->sequence_num);
  304. new_packet->len = htons(ip_hdr->len) - (size_ip + size_tcp);
  305. new_packet->data = p;
  306. new_packet->data_len = htons(ip_hdr->len) - (size_ip + size_tcp);
  307. new_packet->next = NULL;
  308. new_packet->incoming =
  309. (ip_hdr->src.s_addr == f->src_ip.s_addr) ? 0 : 1;
  310. /* Find appropriate place in chain */
  311. if(new_packet->data_len > 0){
  312. packet *previous = NULL;
  313. packet *next = f->packet_chain;
  314. while(next != NULL && (next->seq_num <= new_packet->seq_num)){
  315. //printf("next: %u <= new: %u\n", next->seq_num, new_packet->seq_num);
  316. previous = next;
  317. next = next->next;
  318. }
  319. //place packet after current
  320. if(previous == NULL){
  321. //goes at the beginning of chain
  322. new_packet->next = f->packet_chain;
  323. f->packet_chain = new_packet;
  324. } else {
  325. new_packet->next = next;
  326. previous->next = new_packet;
  327. }
  328. /*printf("Flow: %d > %d (%s)\n", ip_hdr->src.s_addr, ip_hdr->dst.s_addr, (new_packet->incoming)? "incoming":"outgoing");
  329. printf("ID number: %u\n", htonl(ip_hdr->id));
  330. printf("Sequence number: %u\n", htonl(tcp_hdr->sequence_num));
  331. printf("Acknowledgement number: %u\n", htonl(tcp_hdr->ack_num));
  332. printf("Length: %d\n", new_packet->data_len);*/
  333. }
  334. return 0;
  335. }