-
Notifications
You must be signed in to change notification settings - Fork 29
/
Copy pathTrace.py
104 lines (78 loc) · 2.86 KB
/
Trace.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
"""
This file is part of SEA.
reserbot is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
reserbot is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with SEA. If not, see <http://www.gnu.org/licenses/>.
Copyright 2013 by neuromancer
"""
class IR_Trace:
def __init__(self, filename, first, last):
pass
def __iter__(self):
return self
def next(self):
pass
# more functions
def reset(self):
pass
def __getitem__(self, i):
pass
class REIL_Trace(IR_Trace):
def __init__(self, filename, first, last, is_reversed = False):
self.filename = filename
self.reilf = open(filename)
self.reil_code = self.reilf.readlines()[first:last+1]
#print self.reil_code
self.len = len(self.reil_code)
self.first = first
self.last = first + self.len
#self.len = self.last - self.first
self.is_reversed = is_reversed
if (self.is_reversed):
self.current = self.len - 1
else:
self.current = 0
def __iter__(self):
return self
def __len__(self):
return self.len
def next(self):
#print self.current, self.is_reversed, self.len
if (self.is_reversed):
if self.current < 0:
raise StopIteration
else:
self.current -= 1
return self.reil_code[self.current + 1]
else:
if self.current >= self.len:
raise StopIteration
else:
self.current += 1
return self.reil_code[self.current - 1]
def reverse(self):
self.is_reversed = not (self.is_reversed)
if (self.is_reversed):
self.current = self.len - 1
else:
self.current = 0
#return REIL_Trace(self.filename, self.first, self.last, is_reversed = not (self.is_reversed))
def reset(self):
if (self.is_reversed):
self.current = self.len - 1
else:
self.current = 0
def __getitem__(self, i):
if (type(i) == slice):
(first, last, stride) = i.indices(self.len)
#print (first, last, stride), self.is_reversed
return REIL_Trace(self.filename, first, last-1) #self.__init__(self.filename, first, last)
else:
return self.reil_code[i]