-
Notifications
You must be signed in to change notification settings - Fork 68
/
pyper.py
2210 lines (1897 loc) · 83.6 KB
/
pyper.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/env python
import sys
from dpkt.ethernet import *
from dpkt.ip import *
from dpkt.tcp import *
from dpkt.udp import *
from dpkt.dns import *
from dpkt.http import *
import dpkt
import logging
import urllib
from re import compile as re
from itertools import chain
import xml.sax
import xml.sax.handler
from socket import *
from pprint import pformat
from struct import unpack
from traceback import format_exc
import traceback
import tempfile
from pcaputil import *
VERSION = 12
log = logging.getLogger(__file__)
log.setLevel(logging.CRITICAL)
log.addHandler(logging.StreamHandler())
def safe_reduction(
list,
selector = lambda x: x,
condition = lambda x: x is not None,
reduction = sum
):
"""
A function to safely apply a reduction function (min, max average, etc)
to a list of values that may include bad data (some of the values are
None, for example).
You can supply a selector function that extracts the value out of the
item, a condition function which decides whether or not to include
this item in the reduction, and the reduction function itself, which is
any function that takes a sequence and reduces it to another value.
Returns None if no items passed the condition.
"""
safe_list = [
selector(x) for x in list
if condition(selector(x))
]
if len(safe_list):
return reduction(safe_list)
else:
return None
def safe_average(
list,
selector = lambda x: x,
condition = lambda x: x is not None,
):
return safe_reduction(
list,
selector,
condition,
reduction = lambda l: sum(l) / float(len(l))
)
def safe_min(
list,
selector = lambda x: x,
condition = lambda x: x is not None,
):
return safe_reduction(list, selector, condition, min)
def safe_max(
list,
selector = lambda x: x,
condition = lambda x: x is not None,
):
return safe_reduction(list, selector, condition, max)
def safe_sum(
list,
selector = lambda x: x,
condition = lambda x: x is not None,
):
return safe_reduction(list, selector, condition, sum)
class NoFlowsError(Exception):
pass
def flow_str(socket):
s, d = socket
src, sport = s
dst, dport = d
return '%s:%d -> %s:%d' % (
inet_ntoa(src), sport,
inet_ntoa(dst), dport
)
class ModifiedReader(object):
"""A copy of the dpkt pcap Reader. The only change is that the iterator
yields the pcap packet header as well, so it's possible to check the true
frame length, among other things.
"""
def __init__(self, fileobj):
self.name = fileobj.name
self.fd = fileobj.fileno()
self.__f = fileobj
buf = self.__f.read(dpkt.pcap.FileHdr.__hdr_len__)
self.__fh = dpkt.pcap.FileHdr(buf)
self.__ph = dpkt.pcap.PktHdr
if self.__fh.magic == dpkt.pcap.PMUDPCT_MAGIC:
self.__fh = dpkt.pcap.LEFileHdr(buf)
self.__ph = dpkt.pcap.LEPktHdr
elif self.__fh.magic != dpkt.pcap.TCPDUMP_MAGIC:
raise ValueError, 'invalid tcpdump header'
self.snaplen = self.__fh.snaplen
self.dloff = dpkt.pcap.dltoff[self.__fh.linktype]
self.filter = ''
def fileno(self):
return self.fd
def datalink(self):
return self.__fh.linktype
def setfilter(self, value, optimize=1):
return NotImplementedError
def readpkts(self):
return list(self)
def dispatch(self, cnt, callback, *args):
if cnt > 0:
for i in range(cnt):
ts, pkt = self.next()
callback(ts, pkt, *args)
else:
for ts, pkt in self:
callback(ts, pkt, *args)
def loop(self, callback, *args):
self.dispatch(0, callback, *args)
def __iter__(self):
self.__f.seek(dpkt.pcap.FileHdr.__hdr_len__)
while 1:
buf = self.__f.read(dpkt.pcap.PktHdr.__hdr_len__)
if not buf: break
hdr = self.__ph(buf)
buf = self.__f.read(hdr.caplen)
yield (hdr.tv_sec + (hdr.tv_usec / 1000000.0), buf, hdr)
class Flow(object):
def __init__(self, socket, analysis, index, packets):
# Save params
self.socket = socket
self.analysis = analysis
self.index = index
self.orig_index = index
self.packets = packets
# Unpack socket
s, d = socket
sip, self.sport = s
dip, self.dport = d
self.sip = inet_ntoa(sip)
self.dip = inet_ntoa(dip)
self.hostname = '('+self.dip+')'
# Time analysis
self.start = min(p.ts for p in self.packets)
self.end = max(p.ts for p in self.packets)
self.duration = self.end - self.start
self.analyze()
@property
def real_flow(self):
return self
def analyze(self):
"""
Subclasses should override this to do post __init__()
processing without having to override __init__().
"""
pass
relative_start = property(
lambda self: self.start - self.analysis.global_start)
relative_end = property(
lambda self: self.end - self.analysis.global_start)
http_relative_start = property(
lambda self: self.start - self.analysis.http_start)
http_relative_end = property(
lambda self: self.end - self.analysis.http_start)
def __repr__(self):
return '%s <%s, start=%s>' % (
self.__class__.__name__,
flow_str(self.socket),
self.start
)
def __cmp__(self, other):
"""Flows are compared based on their start time."""
return cmp(self.start, other.start)
def __eq__(self, other):
return not self.__ne__(other)
def __ne__(self, other):
if isinstance(other, Flow):
return self.__cmp__(other) != 0
else:
return True
def host(self):
"""
Returns the highest level hostname this flow could belong to, given
that there is dns information available in the parent.
"""
if self.dip in self.analysis.dns.chains:
return self.analysis.dns.chains[self.dip][-1]
else:
return self.dip
def host_chain(self):
if self.dip in self.analysis.dns.chains:
return reversed(self.analysis.dns.chains[self.dip])
else:
return []
class TCPFlow(Flow):
def __repr__(self):
return '%s <%s, fwd=%s, rev=%s>' % (
self.__class__.__name__,
flow_str(self.socket),
friendly_data(self.forward_data)[:60],
friendly_data(self.reverse_data)[:60]
)
def analyze(self):
def assemble_stream(packets, seq_start):
# Assembles a data stream given a list of packets all in the same
# direction. These packets should be partially sorted.
# NOTE: this fills the self.retransmission
### DEBUG ###
stream = ''
packets = [x for x in packets]
raw_list = [
(
# Range covered by this packet
(pkt.tcp.seq, pkt.tcp.seq + len(pkt.tcp.data) - 1),
) for pkt in packets
]
raw_list.sort()
#log.debug('RAW_LIST: \n%s' % pformat(raw_list))
#### DEBUG ###
# Get a list of the data packets in sequence. (Remember, these are normalized seqs)
sequence_list = [
(
# Range covered by this packet
(pkt.tcp.seq, pkt.tcp.seq + len(pkt.tcp.data) - 1),
# Reference to the packet
pkt
) for pkt in packets if \
len(pkt.tcp.data) != 0 and \
(not pkt.tcp.flags & TH_SYN) and \
#(not pkt.tcp.flags & TH_FIN) and \ # No, fin can has data
(not pkt.tcp.flags & TH_RST)
]
sequence_list.sort(key = lambda x: x[0][0])
#log.debug('SEQUENCE_LIST %s: \n%s' % (flow_str(self.socket), pformat(sequence_list)))
#log.debug('SEQ_START: \n%d' % seq_start)
## Now assemble the stream from the sequence list
if self.syn:
# SYN counts as one byte if that's where we got initial seq
cur_seq = seq_start + 1
elif len(sequence_list):
# If we started in the middle, just use the first seq we see
(start, end), pkt = sequence_list[0]
cur_seq = start
segments = []
for ((start,end),pkt) in sequence_list:
# If this packet is in order, just add it's data and advance
if start == cur_seq:
cur_seq = end + 1
# If we got some of the data already this must be a rexmit.
# Since python's list.sort() is stable, we know this packet
# came later and therefore is the retransmission.
elif start < cur_seq:
# Does it have new data?
if end > cur_seq:
segments.append(pkt.tcp.data[end-cur_seq:])
cur_seq = end + 1
pkt.is_rexmit = True
self.rexmit_packets.append(pkt)
# If there is a gap, the packet must be out of order. Anything
# from here on out is a lost cause, since we sorted it, there
# is no hope of filling the gap (this also means the flow is
# incomplete as captured).
else:
pkt.is_out_of_order = True
self.ooo_packets.append(pkt)
self.missing_data = True
#log.debug('SEGMENTS (%d): \n%s' % (len(segments), `segments`))
#log.debug('OOO PACKETS (%d): \n%s' % (len(self.ooo_packets), `self.ooo_packets`))
stream = ''.join(segments)
return sequence_list, stream
#end def assemble_stream
class TCPSeqNormalizer(object):
# jh:
# I'm normalizing the sequence numbers so they're sortable. This is
# an attempt to ensure they have a monotonically increasing ordering
# even if the sequence number wraps. (and even if the packets are not
# in order, of course)
# It still starts at the same spot, but after a wrap, it will count as
# 2^32 + seq, and continue from there. (So mod by 2^32 to get the original
# value back.)
# once we see sequence numbers pass 0xc0000000, increase low_seq_offset by
# the sequence number space. This means subsequent numbers that wrap
# (so they're below 0x80000000 by value) will come after the current
# sequence number.
# once the sequence numbers pass 0x40000000, increase high_seq_offset up to
# low_seq_offset, so that numbers past 0x80000000 will come after the current
# number again. (because otherwise, they'd have the lower offset value to add)
# this technique can fail with more than 1GB in flight. (If you get a seq#
# past 0xc0000000 (3g), you'll increase low_seq_offset, and if you later get
# a seq# under 0x80000000 (2g), you'll treat it as wrapped, and add 4g.) It
# might be possible to improve the tolerance to handle up to 2GB in flight.
# PS: This technique is apparently called "unwrap" in matlab, and some call it
# "unmod". It's often used for handling values like degrees or radians that
# are cyclic within a certain range and have a discontinuous jump in value, but
# really represent some continuous property.
# Note: You can get back the original sequence number as (seq % 0x100000000)
def __init__(self):
self.high_seq_offset = 0
self.low_seq_offset = 0
self.high_ack_offset = 0
self.low_ack_offset = 0
def normalize_seq(self, pkt):
if self.low_seq_offset == self.high_seq_offset:
if pkt.tcp.seq >= 0xc0000000:
self.low_seq_offset += 0x100000000
else:
if pkt.tcp.seq < 0x80000000 and pkt.tcp.seq >= 0x40000000:
self.high_seq_offset = self.low_seq_offset
if pkt.tcp.seq < 0x80000000:
pkt.tcp.seq += self.low_seq_offset
else:
pkt.tcp.seq += self.high_seq_offset
# same thing for acks
if self.low_ack_offset == self.high_ack_offset:
if pkt.tcp.ack >= 0xc0000000:
self.low_ack_offset += 0x100000000
else:
if pkt.tcp.ack < 0x80000000 and pkt.tcp.ack >= 0x40000000:
self.high_ack_offset = self.low_ack_offset
if pkt.tcp.ack < 0x80000000:
pkt.tcp.ack += self.low_ack_offset
else:
pkt.tcp.ack += self.high_ack_offset
# end class TCPSeqNormalizer
# real begin of analyze(self)
self.missing_data = None # True mean for sure we are missing data
# Detect handshake
self.has_handshake = False
self.handshake_duration = None
self.syn = None
self.synack = None
self.ack = None
self.has_rst = False
self.has_fin = False
if len(self.packets) >= 3:
# TODO: more robust handshake detection
first, second, third = self.packets[0:3]
if first.tcp.flags & TH_SYN and not first.tcp.flags & TH_ACK:
self.syn = first
if second.tcp.flags & (TH_SYN | TH_ACK):
self.synack = second
if third.tcp.flags & TH_ACK:
self.ack = third
self.has_handshake = True
self.handshake_duration = self.ack.ts - self.syn.ts
if self.has_handshake:
seq_forward_start = self.syn.tcp.seq
seq_reverse_start = self.synack.tcp.seq
else:
# TODO: what is the best way to go if the capture doesn't have
# a handshake?
seq_forward_start = self.packets[0].tcp.seq
seq_reverse_start = self.packets[0].tcp.ack # this always work?
# Try finding the first packet in the opposite direction
for pkt in self.packets:
if not self.samedir(pkt):
seq_reverse_start = pkt.tcp.seq
break
self.rexmit_packets = []
self.ooo_packets = []
for pkt in self.packets:
self.has_rst |= ((pkt.tcp.flags & TH_RST) != 0)
self.has_fin |= ((pkt.tcp.flags & TH_FIN) != 0)
self.open = (not self.has_rst) and (not self.has_fin)
fwd_pkts = [pkt for pkt in self.packets if self.samedir(pkt)]
rev_pkts = [pkt for pkt in self.packets if not self.samedir(pkt)]
# un-mod sequence numbers (let them exceed 2^32 instead of wrapping)
norm = TCPSeqNormalizer()
for pkt in fwd_pkts:
norm.normalize_seq(pkt)
norm = TCPSeqNormalizer()
for pkt in rev_pkts:
norm.normalize_seq(pkt)
#log.debug('LOCALS \n%s' % pformat(self.__dict__))
# Grab forward stream
self.forward_sequence_list, self.forward_data = \
assemble_stream(fwd_pkts, seq_forward_start)
self.forward_sequence_start = self.forward_sequence_list[0][0][0] \
if len(self.forward_sequence_list) else None
# And reverse stream
self.reverse_sequence_list, self.reverse_data = \
assemble_stream(rev_pkts, seq_reverse_start)
self.reverse_sequence_start = self.reverse_sequence_list[0][0][0] \
if len(self.reverse_sequence_list) else None
#log.debug('FORWARD DATA: \n%s' % `self.forward_data`)
#log.debug('REVERSE DATA: \n%s' % `self.reverse_data`)
# Calculate RTT
def calculate_rtt(samedir=True):
#log.debug('\n\nCALCULATING RTT: samedir = %s\n' % str(samedir))
# Calculate rtt for handshake
if self.has_handshake:
self.syn.rtt = self.synack.ts - self.syn.ts
self.synack.rtt = self.ack.ts - self.synack.ts
# Calculate rtt from data packets
soq = []
high_tx_seq = None
for pkt in self.packets:
#log.debug('\n\tcalculate_rtt: pkt id %u time %f' % (
# pkt.ip.id, pkt.ts))
# this is a data pkt in the reverse direction
if bool(self.samedir(pkt)) == bool(samedir):
#log.debug('\tsamedir pkt id %u'%pkt.ip.id)
if len(pkt.tcp.data) > 0:
# only add new pkts to soq
if high_tx_seq is None or \
pkt.end_seq > high_tx_seq:
#log.debug('\tadd pkt id %u'%pkt.ip.id)
high_tx_seq = pkt.end_seq
soq.append(pkt)
# retransmission
else:
#log.debug('\tretrans pkt id %u'%pkt.ip.id)
# remove any soq pkt that overlaps with pkt
for soq_pkt in soq:
if soq_pkt.overlaps(pkt):
soq.remove(soq_pkt)
# an ack
else:
#log.debug('\tother dir pkt id %u'%pkt.ip.id)
most_recent_removal = None
# remove all acked soq pkts and save the last
for soq_pkt in soq:
#log.debug('\tpkt.tcp.ack %u soq_pkt.end %u >? %s'% (
# pkt.tcp.ack-1, soq_pkt.end_seq,
# pkt.tcp.ack-1 >= soq_pkt.end_seq))
if pkt.tcp.ack > soq_pkt.end_seq:
most_recent_removal = soq_pkt
soq.remove(soq_pkt)
if most_recent_removal is not None:
most_recent_removal.rtt = pkt.ts - most_recent_removal.ts
#log.debug(
# '\tack id %u time %f data id %u time %f rtt %f' % (
# pkt.ip.id, pkt.ts, most_recent_removal.ip.id, \
# most_recent_removal.ts, most_recent_removal.rtt))
calculate_rtt(samedir = True)
calculate_rtt(samedir = False)
# Calcualte RTT stats
self.forward_packets = fwd_pkts
self.reverse_packets = rev_pkts
# AVG
self.forward_rtt_avg = safe_average(
self.forward_packets,
selector = lambda pkt: pkt.rtt,
)
self.reverse_rtt_avg = safe_average(
self.reverse_packets,
selector = lambda pkt: pkt.rtt,
)
# MAX
self.forward_rtt_max = safe_max(
self.forward_packets,
selector = lambda pkt: pkt.rtt,
)
self.reverse_rtt_max = safe_max(
self.reverse_packets,
selector = lambda pkt: pkt.rtt,
)
# MIN
self.forward_rtt_min = safe_min(
self.forward_packets,
selector = lambda pkt: pkt.rtt,
)
self.reverse_rtt_min = safe_min(
self.reverse_packets,
selector = lambda pkt: pkt.rtt,
)
#log.debug("\tFORWARD RTT: avg %.3f max %.3f min %.3f" % (
# self.forward_rtt_avg, self.forward_rtt_max, self.forward_rtt_min
#))
#log.debug("\tREVERSE RTT: avg %.3f max %.3f min %.3f" % (
# self.reverse_rtt_avg, self.reverse_rtt_max, self.reverse_rtt_min
#))
# Totals (sum the forward and reverse values and ignore None's,
# if both are None then the total is None)
self.rtt_avg = safe_sum((self.forward_rtt_avg, self.reverse_rtt_avg))
self.rtt_max = safe_sum((self.forward_rtt_max, self.reverse_rtt_max))
self.rtt_min = safe_sum((self.forward_rtt_min, self.reverse_rtt_min))
#log.critical("\tTOTAL RTT: avg %-10f max %-10f min %-10f" % (
# self.rtt_avg, self.rtt_max, self.rtt_min
#))
# begin calculating stalls, pauses, and availability times (by byte)
class TCPTimer(object):
def __init__(self, start_seq, start_ts, stall_thresh=0.5):
self.stalls = []
self.pauses = []
self.availability = []
self.hi_seq = start_seq
self.hi_ack = start_seq
self.last_seq = start_seq
self.seq_advance_ts = start_ts
self.ack_advance_ts = start_ts
self.last_seq_ts = start_ts
self.last_ack_ts = start_ts
self.stall_thresh = stall_thresh
def next_seq(self, ts, seq):
if seq > self.hi_seq:
self.hi_seq = seq
self.seq_advance_ts = ts
self.last_seq = seq
self.last_seq_ts = ts
def next_ack(self, ts, ack):
if ack > self.hi_ack:
prev_ts = self.last_seq_ts
self.availability.append((prev_ts, self.hi_ack, ack))
timediff = prev_ts-self.ack_advance_ts
if timediff > self.stall_thresh:
if self.hi_seq > self.last_seq:
self.stalls.append((self.ack_advance_ts, prev_ts))
else:
self.pauses.append((self.ack_advance_ts, prev_ts))
self.ack_advance_ts = prev_ts
self.hi_ack = ack
#end class TCPTimer
if self.rtt_min is None:
stall_thresh = 0.5
else:
stall_thresh = self.rtt_min*2.5
if stall_thresh < 0.2:
stall_thresh = 0.2
start_time = self.packets[0].ts
fwdTimer = TCPTimer(seq_forward_start, start_time, stall_thresh)
bwdTimer = TCPTimer(seq_reverse_start, start_time, stall_thresh)
fwd_ha = seq_forward_start
bwd_ha = seq_reverse_start
last_ts = 0.0
for pkt in self.packets:
if pkt.ts < last_ts:
print 'on %s: %f vs. %f out of order' % (self.socket, last_ts-start_time, pkt.ts-start_time)
if self.samedir(pkt):
fwdTimer.next_seq(pkt.ts, pkt.tcp.seq)
bwdTimer.next_ack(pkt.ts, pkt.tcp.ack)
if bwd_ha < pkt.tcp.ack:
bwd_ha = pkt.tcp.ack
else:
bwdTimer.next_seq(pkt.ts, pkt.tcp.seq)
fwdTimer.next_ack(pkt.ts, pkt.tcp.ack)
if fwd_ha < pkt.tcp.ack:
fwd_ha = pkt.tcp.ack
self.forward_stalls = fwdTimer.stalls
self.reverse_stalls = bwdTimer.stalls
self.forward_pauses = fwdTimer.pauses
self.reverse_pauses = bwdTimer.pauses
self.forward_availability = fwdTimer.availability
self.reverse_availability = bwdTimer.availability
# end calculating stalls and availability times (by byte)
http_relative_handshake_end = property(
lambda self: self.ack.ts - self.analysis.http_start if self.has_handshake else None
)
def samedir(self, packet):
"""Returns True if the packet is in the same direction as the SYN
(or the first packet if there is no SYN, or reverse if first src
port is 80 and dst port is not)."""
# TODO: we probably should put forward/reverse values in a structure based on
# an early guess, then swap them if we later find we got it backwards,
# and have an easy "requests==forward, response==reverse" association.
if self.has_handshake:
return self.syn.tcp.sport == packet.tcp.sport
if len(self.packets) == 0:
return None
if self.packets[0].tcp.sport == 80:
# if first packet's source port is 80 (http) then we probably got it
# backwards.
return self.packets[0].tcp.dport == packet.tcp.sport
return self.packets[0].tcp.sport == packet.tcp.sport
class HTTPFlow(TCPFlow):
def analyze(self):
super(HTTPFlow, self).analyze()
self.requests = []
self.responses = []
self.pairs = []
self.dns_query = None
self.flow_states = []
def gather_messages(MessageClass, start_seq, seq_list, data):
# Returns a list of messages from a stream
#log.debug('gathering messages')
messages = []
cur_seq = start_seq
while len(data):
#log.debug('%s len %d data %s cur_seq %d messages %s\n' %
# (MessageClass.__name__, len(data), `data`,cur_seq,`messages`))
message = MessageClass(data, cur_seq, seq_list, self)
messages.append(message)
cur_seq += message.len
data = message.data
return messages
#log.debug('PARSING HTTP')
try:
#log.debug(' > GUESSING FORWARD DIRECTION')
self.requests = gather_messages(
HTTPRequest, self.forward_sequence_start,
self.forward_sequence_list, self.forward_data)
self.responses = gather_messages(
HTTPResponse, self.reverse_sequence_start,
self.reverse_sequence_list, self.reverse_data)
# Are the requests the same direction as the TCP flow?
# NOTE: this does not really matter, it just keeps track of
# which stream (forward or reverse) the http request came from.
self.request_direction = True
#log.debug(' CORRECT. NEW SELF: \n%s' % pformat(self.__dict__))
except Exception, e:
#log.debug(format_exc())
#log.debug(' > GUESSING REVERSE DIRECTION %s' % (flow_str(self.socket)))
self.requests = gather_messages(
HTTPRequest, self.reverse_sequence_start,
self.reverse_sequence_list, self.reverse_data)
self.responses = gather_messages(
HTTPResponse, self.forward_sequence_start,
self.forward_sequence_list, self.forward_data)
self.request_direction = False
#log.debug(' CORRECT. NEW SELF: \n%s' % pformat(self.__dict__))
# pairs?
self.pairs = zip(self.requests, self.responses)
if not len(self.pairs):
raise Exception('This HTTP flow doesn\'t have enough pairs.')
self.build_states()
# Find duration from start of flow to the first request
self.handshake_to_request = None
if len(self.pairs):
(first_req, first_resp), first_pkt = self.pairs[0], self.packets[0]
if self.has_handshake:
self.handshake_to_request = first_req.start - self.ack.ts
else:
self.handshake_to_request = first_req.start - first_pkt.ts
self.tcp_upload = safe_sum(len(request) for request in self.requests)
self.tcp_download = safe_sum(len(response) for response in self.responses)
self.http_upload = sum(len(request.body)
for request in self.requests)
self.http_download = sum(len(response.body)
for response in self.responses)
# These are based on the the http messages, rather than raw packets.
# The start will always include a handshake if there is one.
self.http_start = min((request.sort_start for request in self.requests)) \
if len(self.requests)!=0 else self.start
self.http_end = max((response.end for response in self.responses)) \
if len(self.responses)!=0 else self.end
# This is potentially shorter than self.duration.
self.http_duration = self.http_end - self.http_start
# Converted from timestamp
http_relative_http_start = property(
lambda self: self.http_start - self.analysis.http_start)
http_relative_http_end = property(
lambda self: self.http_end - self.analysis.http_start)
num_request_packets = property(
lambda self: sum(len(request.packets)
for request, response in self.pairs))
num_response_packets = property(
lambda self: sum(len(response.packets)
for request, response in self.pairs))
def build_states(self):
"""
Containment function to calculate the list of flow states out of
the information found in the flow object. It goes step-by-step
through the stages of the flow and appends states as it goes.
"""
# Handshake
if self.has_handshake:
self.flow_states.append((self.syn.ts, self.ack.ts, fs_handshake))
if len(self.pairs) > 0:
self.flow_states.append((self.ack.ts, self.pairs[0][0].start, fs_handshake_done))
# Bail if we don't have any pairs
if len(self.pairs) <= 0:
return
# Gather together the stalls for use later
# (usually client starts, so reverse is response)
self.response_stalls = self.reverse_stalls
self.response_pauses = self.reverse_pauses
self.response_availability = self.reverse_availability
if not self.request_direction:
self.response_stalls = self.forward_stalls
self.response_pauses = self.forward_pauses
self.response_availability = self.forward_availability
# Loop through each request/response pair
prev_resp = None
for req, resp in self.pairs:
# Idle time between pairs
if prev_resp != None:
self.flow_states.append((prev_resp.end, req.start, fs_idle))
prev_resp = resp
#
append_pair_states(self.flow_states,
req.start, req.end,
resp.start, resp.end,
req.flow.rtt_min/2
)
resp.stalls = [
(max(start, resp.start)-resp.start, min(end, resp.end)-resp.start) for start, end in self.response_stalls
if (start >= resp.start and start < resp.end) or (end > resp.start and end <= resp.end)]
resp.pauses = [
(max(start, resp.start)-resp.start, min(end, resp.end)-resp.start) for start, end in self.response_pauses
if (start >= resp.start and start < resp.end) or (end > resp.start and end <= resp.end)]
self.flow_states.extend([(start+resp.start, end+resp.start, fs_paused) for start, end in resp.pauses])
#if len(resp.pauses) > 0 or len(resp.stalls) > 0:
# print "%s: %d pauses, %d stalls" % (req.base_uri_trunc, len(resp.pauses), len(resp.stalls))
# if len(resp.pauses) > 0:
# print "pauses: %s" % (`resp.pauses`)
# if len(resp.stalls) > 0:
# print "stalls: %s" % (`resp.stalls`)
resp.availability = []
initial_seq = None
for ts, fromseq, redge in self.response_availability:
if ts >= resp.start and ts <= resp.end:
if initial_seq is None:
initial_seq = fromseq
resp.availability.append((ts-resp.start, redge-initial_seq))
# TBD: this is just bad. availability is sometimes getting built
# wrong when there's stuff like out of order packets. Hack
# it into shape so I can make assumptions about it:
# 1. availability monotonically increases in offset and time
# 2. last byte's time offset is response duration
# 3. last byte exactly equals total length of response
# In theory, if availability-building logic were perfect, none of
# these would ever be hit. In practice, even if we fix the obvious
# stuff, there might be some trouble with pipelining (2 responses
# could be in the same packet, for instance). The right thing
# ultimately is to make the logic solid and check the assertions,
# but for now, we fixup anything broken after the initial pass.
last_ts, last_off = resp.availability[0]
idx = 1
showed_orig = False
while idx < len(resp.availability):
ts, offset = resp.availability[idx]
if ts > resp.duration or offset > resp.total_bytes or last_ts > ts or last_off >= offset:
if not showed_orig:
showed_orig = True
#log.debug(`resp.availability`)
#log.debug('fixup bad availability: %s, %f/%d comes behind %f/%d' % (req.base_uri_trunc, ts, offset, last_ts, last_off))
del resp.availability[idx]
else:
last_ts = ts
last_off = offset
idx+=1
if len(resp.availability) > 0:
tail_ts, tail_off = resp.availability[-1]
if tail_ts < resp.duration or tail_off < resp.total_bytes:
if not showed_orig:
showed_orig = True
#log.debug(`resp.availability`)
if not (tail_ts < resp.duration and tail_off < resp.total_bytes):
#log.debug('fixup bad availability: %s %f/%d ended earlier than response %f/%d' % (req.base_uri_trunc, tail_ts, tail_off, resp.duration, resp.total_bytes))
del resp.availability[-1]
#else:
# log.debug('fixup bad availability: %s %f/%d ended completely before response %f/%d' % (req.base_uri_trunc, tail_ts, tail_off, resp.duration, resp.total_bytes))
resp.availability.append((resp.duration, resp.total_bytes))
else:
#log.debug('fixup bad availability: %s was empty' % (req.base_uri_trunc, tail_ts, tail_off, resp.duration, resp.total_bytes))
resp.availability.append((resp.duration, resp.total_bytes))
showed_orig = True
#if showed_orig:
# log.debug(`resp.availability`)
# log.debug('resp start %f, end %f, dur %f, tot %d' % (resp.start, resp.end, resp.duration, resp.total_bytes))
# these should never fire (ideally because of good logic, but currently because of the fixup above)
assert(len(resp.availability) > 0)
last_ts, last_off = resp.availability[0]
for ts, offset in resp.availability[1:]:
if last_ts > ts or last_off >= offset:
log.critical('bad availability: %s, %f/%d comes behind %f/%d' % (req.base_uri_trunc, ts, offset, last_ts, last_off))
log.critical(`resp.availability`)
log.critical('total: %d, start %f, end %f, dur %f' % (resp.total_bytes, resp.start, resp.end, resp.end-resp.start))
assert(last_ts <= ts)
assert(last_off < offset)
last_ts = ts
last_off = offset
assert(resp.availability[-1][1]==resp.total_bytes)
assert(resp.availability[-1][0]==(resp.end-resp.start))
for start, end in self.response_stalls:
self.flow_states.append((start, end, fs_stalled))
regions = [(req.sort_start, resp.end) for req, resp in self.pairs]
self.flow_durations, self.flow_colors = st.full_view()
for (req, resp), (durations, colors) in zip(self.pairs, st.region_views()):
req.pair_durations = durations
req.pair_colors = colors
#if len(self.response_stalls) > 0:
# log.debug("%s: stalls: %s" % (flow_str(self.socket), `self.response_stalls`))
# log.debug("flow_states: %s" % (`self.flow_states`))
# log.debug("disjoint_states: %s" % (`disjoint_states`))
class UDPFlow(Flow):
def analyze(self):
super(UDPFlow, self).analyze()
class TCPPacket(object):
def __init__(self, ts, buf, eth, ip, tcp):
self.ts = ts
self.buf = buf
self.eth = eth
self.ip = ip
self.tcp = tcp
self.is_rexmit = None
self.is_out_of_order = None
self.start_seq = self.tcp.seq
self.end_seq = self.tcp.seq + len(self.tcp.data) - 1
self.rtt = None
def __cmp__(self, other):
return cmp(self.ts, other.ts)
def __eq__(self, other):
return not self.__ne__(other)
def __ne__(self, other):
if isinstance(other, TCPPacket):
return cmp(self, other) != 0
else:
return True
def overlaps(self, other):
return (self.start_seq <= other.start_seq and \
other.start_seq < self.end_seq) \
or \
(self.start_seq < other.end_seq and \
other.end_seq <= self.end_seq)
class UDPPacket(object):
def __init__(self, ts, buf, eth, ip, udp):
self.ts = ts
self.buf = buf
self.eth = eth
self.ip = ip
self.udp = udp
def __repr__(self):
return `self.udp`
class DNSMessage(object):
"""Holds a dns request or response and some extrated data."""
def __init__(self, ts, buf, eth, ip, udp, dns, analysis):
self.ts = ts
self.buf = buf
self.eth = eth
self.ip = ip
self.udp = udp
self.dns = dns
self.analysis = analysis
self.start = ts
self.end = ts
self.duration = 0
self.map = {}
self.reverse_map = {}
self.ips = []
self.is_answer = False
self.hosts = []
# Are there questions in the packet?
if hasattr(self.dns, 'qd'):
self.hosts = [q.name for q in self.dns.qd]
#log.critical('HOSTS: %s' % self.hosts)
# Do we have an answer?
if hasattr(self.dns, 'an'):
self.is_answer = True
answer = self.dns.an
for rr in answer:
#log.debug(`answer`)
# CNAME support (type 5)
if hasattr(rr, 'type') and rr.type == 5:
# Read dns name format
def read_labels(rdata):
#log.debug('STARTING READ OF: '+`rdata`)
ptr = 0
labels = []
while True:
count = unpack('B', rdata[ptr])[0]
#log.debug('ptr %d count %d stuff %s' % (
# ptr, count, `rdata[ptr:count]`
#))
# End of record