-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathbencoder.pyx
More file actions
164 lines (126 loc) · 3.65 KB
/
bencoder.pyx
File metadata and controls
164 lines (126 loc) · 3.65 KB
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
# cython: language_level=3
# The contents of this file are subject to the BitTorrent Open Source License
# Version 1.1 (the License). You may not copy or use this file, in either
# source code or executable form, except in compliance with the License. You
# may obtain a copy of the License at http://www.bittorrent.com/license/.
#
# Software distributed under the License is distributed on an AS IS basis,
# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
# for the specific language governing rights and limitations under the
# License.
# Based on https://github.com/karamanolev/bencode3/blob/master/bencode.py
from cpython.version cimport PY_MAJOR_VERSION, PY_MINOR_VERSION
END_CHAR = ord('e')
ARRAY_TYPECODE = 'b'
if PY_MAJOR_VERSION >= 3 and PY_MINOR_VERSION >=7:
OrderedDict = dict
else:
from collections import OrderedDict
class BTFailure(Exception):
pass
def decode_int(bytes x, int f):
f += 1
cdef long new_f = x.index(b'e', f)
n = int(x[f:new_f])
if x[f] == b'-'[0]:
if x[f + 1] == b'0'[0]:
raise ValueError()
elif x[f] == b'0'[0] and new_f != f + 1:
raise ValueError()
return n, new_f + 1
def decode_string(bytes x, int f):
cdef long colon = x.index(b':', f)
cdef long n = int(x[f:colon])
if x[f] == b'0'[0] and colon != f + 1:
raise ValueError()
colon += 1
return x[colon:colon + n], colon + n
def decode_list(bytes x, int f):
r, f = [], f + 1
while x[f] != END_CHAR:
v, f = decode_func[x[f]](x, f)
r.append(v)
return r, f + 1
def decode_dict(bytes x, int f):
r = OrderedDict()
f += 1
while x[f] != END_CHAR:
k, f = decode_string(x, f)
r[k], f = decode_func[x[f]](x, f)
return r, f + 1
decode_func = dict()
for func, keys in [
(decode_list, 'l'),
(decode_dict, 'd'),
(decode_int, 'i'),
(decode_string, [str(x) for x in range(10)])
]:
for key in keys:
decode_func[ord(key)] = func
def bdecode2(bytes x):
try:
r, l = decode_func[x[0]](x, 0)
except (IndexError, KeyError, ValueError):
raise BTFailure("not a valid bencoded string")
return r, l
def bdecode(bytes x):
r, l = bdecode2(x)
if l != len(x):
raise BTFailure("invalid bencoded value (data after valid prefix)")
return r
cdef encode(v, list r):
tp = type(v)
if tp in encode_func:
return encode_func[tp](v, r)
else:
for tp, func in encode_func.items():
if isinstance(v, tp):
return func(v, r)
raise BTFailure(
"Can't encode {0}(Type: {1})".format(v, type(v))
)
cdef encode_int(long x, list r):
r.append(b'i')
r.append(str(x).encode())
r.append(b'e')
cdef encode_long(x, list r):
r.append(b'i')
r.append(str(x).encode())
r.append(b'e')
cdef encode_bytes(x, list r):
r.append(str(len(x)).encode())
r.append(b':')
r.append(x)
cdef encode_string(str x, list r):
r.append(str(len(x)).encode())
r.append(b':')
r.append(x.encode())
cdef encode_list(x, list r):
r.append(b'l')
for i in x:
encode(i, r)
r.append(b'e')
cdef encode_dict(x, list r):
r.append(b'd')
item_list = list(x.items())
item_list.sort()
for k, v in item_list:
if isinstance(k, str):
k = k.encode()
encode_bytes(k, r)
encode(v, r)
r.append(b'e')
encode_func = {
int: encode_long,
bool: encode_int,
bytes: encode_bytes,
str: encode_string,
list: encode_list,
tuple: encode_list,
dict: encode_dict,
OrderedDict: encode_dict,
}
def bencode(x):
r = []
encode(x, r)
return b''.join(r)