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
|
# 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.
# Written by Bram Cohen
from select import select, error
from time import sleep
from types import IntType
from bisect import bisect
POLLIN = 1
POLLOUT = 2
POLLERR = 8
POLLHUP = 16
class poll(object):
def __init__(self):
self.rlist = []
self.wlist = []
def register(self, f, t):
if type(f) != IntType:
f = f.fileno()
if (t & POLLIN) != 0:
insert(self.rlist, f)
else:
remove(self.rlist, f)
if (t & POLLOUT) != 0:
insert(self.wlist, f)
else:
remove(self.wlist, f)
def unregister(self, f):
if type(f) != IntType:
f = f.fileno()
remove(self.rlist, f)
remove(self.wlist, f)
def poll(self, timeout = None):
if self.rlist != [] or self.wlist != []:
r, w, e = select(self.rlist, self.wlist, [], timeout)
else:
sleep(timeout)
return []
result = []
for s in r:
result.append((s, POLLIN))
for s in w:
result.append((s, POLLOUT))
return result
def remove(list, item):
i = bisect(list, item)
if i > 0 and list[i-1] == item:
del list[i-1]
def insert(list, item):
i = bisect(list, item)
if i == 0 or list[i-1] != item:
list.insert(i, item)
|
