-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy paththreading.py
571 lines (457 loc) · 15.4 KB
/
threading.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
import utime
import sys
import _thread
import osTimer
class Lock(object):
def __init__(self):
self.__lock = _thread.allocate_lock()
self.__owner = None
def __enter__(self):
self.acquire()
return self
def __exit__(self, *args, **kwargs):
self.release()
def acquire(self):
flag = self.__lock.acquire()
self.__owner = _thread.get_ident()
return flag
def release(self):
self.__owner = None
return self.__lock.release()
def locked(self):
return self.__lock.locked()
@property
def owner(self):
return self.__owner
class _Waiter(object):
"""WARNING: Waiter object can only be used once."""
def __init__(self):
self.__lock = Lock()
self.__lock.acquire()
self.__gotit = True
@property
def __unlock_timer(self):
timer = getattr(self, "__unlock_timer__", None)
if timer is None:
timer = osTimer()
setattr(self, "__unlock_timer__", timer)
return timer
@property
def __timer_lock(self):
lock = getattr(self, "__timer_lock__", None)
if lock is None:
lock = Lock()
setattr(self, "__timer_lock__", lock)
return lock
def __auto_release(self, _):
with self.__timer_lock:
self.__gotit = not self.__release()
def acquire(self, timeout=None):
if timeout is not None and timeout <= 0:
raise ValueError("\"timeout\" must be a positive number.")
gotit = self.__gotit
if timeout:
with self.__timer_lock:
self.__unlock_timer.start(timeout * 1000, 0, self.__auto_release)
self.__lock.acquire() # block here
if timeout:
with self.__timer_lock:
gotit = self.__gotit
self.__unlock_timer.stop()
return gotit
def __release(self):
try:
self.__lock.release()
except RuntimeError:
return False
return True
def release(self):
return self.__release()
class Condition(object):
def __init__(self, lock=None):
if lock is None:
lock = Lock()
self.__lock = lock
self.__waiters = []
self.acquire = self.__lock.acquire
self.release = self.__lock.release
def __enter__(self):
self.acquire()
return self
def __exit__(self, *args, **kwargs):
self.release()
def __is_owned(self):
return self.__lock.locked() and self.__lock.owner == _thread.get_ident()
def wait(self, timeout=None):
if not self.__is_owned():
raise RuntimeError("cannot wait on un-acquired lock.")
waiter = _Waiter()
self.__waiters.append(waiter)
self.release()
gotit = False
try:
gotit = waiter.acquire(timeout)
return gotit
finally:
self.acquire()
if not gotit:
try:
self.__waiters.remove(waiter)
except ValueError:
pass
def wait_for(self, predicate, timeout=None):
endtime = None
remaining = timeout
result = predicate()
while not result:
if remaining is not None:
if endtime is None:
endtime = utime.time() + remaining
else:
remaining = endtime - utime.time()
if remaining <= 0.0:
break
self.wait(remaining)
result = predicate()
return result
def notify(self, n=1):
if not self.__is_owned():
raise RuntimeError("cannot wait on un-acquired lock.")
if n < 0:
raise ValueError("invalid param, n should be >= 0.")
waiters_to_notify = self.__waiters[:n]
for waiter in waiters_to_notify:
waiter.release()
try:
self.__waiters.remove(waiter)
except ValueError:
pass
def notify_all(self):
self.notify(n=len(self.__waiters))
class Event(object):
def __init__(self):
self.__flag = False
self.__cond = Condition()
def wait(self, timeout=None, clear=False):
with self.__cond:
result = self.__cond.wait_for(lambda: self.__flag, timeout=timeout)
if result and clear:
self.__flag = False
return result
def set(self):
with self.__cond:
self.__flag = True
self.__cond.notify_all()
def clear(self):
with self.__cond:
self.__flag = False
def is_set(self):
with self.__cond:
return self.__flag
class EventSet(object):
def __init__(self):
self.__set = 0
self.__cond = Condition()
def wait(self, event_set, timeout=None, clear=False):
with self.__cond:
result = self.__cond.wait_for(lambda: (event_set & self.__set) == event_set, timeout=timeout)
if result and clear:
self.__set &= ~event_set
return result
def waitAny(self, event_set, timeout=None, clear=False):
with self.__cond:
result = self.__cond.wait_for(lambda: event_set & self.__set, timeout=timeout)
if result and clear:
self.__set &= ~event_set
return result
def set(self, event_set):
with self.__cond:
self.__set |= event_set
self.__cond.notify_all()
def clear(self, event_set):
with self.__cond:
self.__set &= ~event_set
def is_set(self, event_set):
with self.__cond:
return (self.__set & event_set) == event_set
def is_set_any(self, event_set):
with self.__cond:
return self.__set & event_set
class Semaphore(object):
def __init__(self, value=1):
if value < 0:
raise ValueError("semaphore initial value must be >= 0")
self.__value = value
self.__cond = Condition()
def __enter__(self):
self.acquire()
return self
def __exit__(self, *args, **kwargs):
self.release()
def counts(self):
with self.__cond:
return self.__value
def acquire(self, block=True, timeout=None):
with self.__cond:
if not block:
if self.__value > 0:
self.__value -= 1
return True
else:
return False
elif timeout is not None and timeout <= 0:
raise ValueError("\"timeout\" must be a positive number.")
else:
if self.__cond.wait_for(lambda: self.__value > 0, timeout=timeout):
self.__value -= 1
return True
else:
return False
def release(self, n=1):
if n < 1:
raise ValueError("n must be one or more")
with self.__cond:
self.__value += n
self.__cond.notify(n)
def clear(self):
with self.__cond:
self.__value = 0
class BoundedSemaphore(Semaphore):
def __init__(self, value=1):
super().__init__(value)
self.__initial_value = value
def release(self, n=1):
if n < 1:
raise ValueError("n must be one or more")
with self.__cond:
if self.__value + n > self.__initial_value:
raise ValueError("Semaphore released too many times")
self.__value += n
self.__cond.notify(n)
class Queue(object):
class Full(Exception):
pass
class Empty(Exception):
pass
def __init__(self, max_size=100):
self.queue = []
self.__max_size = max_size
self.__lock = Lock()
self.__not_empty = Condition(self.__lock)
self.__not_full = Condition(self.__lock)
def _put(self, item):
self.queue.append(item)
def put(self, item, block=True, timeout=None):
with self.__not_full:
if not block:
if len(self.queue) >= self.__max_size:
raise self.Full
elif timeout is not None and timeout <= 0:
raise ValueError("\"timeout\" must be a positive number.")
else:
if not self.__not_full.wait_for(lambda: len(self.queue) < self.__max_size, timeout=timeout):
raise self.Full
self._put(item)
self.__not_empty.notify()
def _get(self):
return self.queue.pop(0)
def get(self, block=True, timeout=None):
with self.__not_empty:
if not block:
if len(self.queue) == 0:
raise self.Empty
elif timeout is not None and timeout <= 0:
raise ValueError("\"timeout\" must be a positive number.")
else:
if not self.__not_empty.wait_for(lambda: len(self.queue) != 0, timeout=timeout):
raise self.Empty
item = self._get()
self.__not_full.notify()
return item
def size(self):
with self.__lock:
return len(self.queue)
def clear(self):
with self.__lock:
self.queue.clear()
class LifoQueue(Queue):
def _put(self, item):
self.queue.append(item)
def _get(self):
return self.queue.pop()
class PriorityQueue(Queue):
@classmethod
def __siftdown(cls, heap, startpos, pos):
newitem = heap[pos]
while pos > startpos:
parentpos = (pos - 1) >> 1
parent = heap[parentpos]
if newitem < parent:
heap[pos] = parent
pos = parentpos
continue
break
heap[pos] = newitem
def _put(self, item):
self.queue.append(item)
self.__siftdown(self.queue, 0, len(self.queue) - 1)
@classmethod
def __siftup(cls, heap, pos):
endpos = len(heap)
startpos = pos
newitem = heap[pos]
childpos = 2 * pos + 1
while childpos < endpos:
rightpos = childpos + 1
if rightpos < endpos and not heap[childpos] < heap[rightpos]:
childpos = rightpos
heap[pos] = heap[childpos]
pos = childpos
childpos = 2 * pos + 1
heap[pos] = newitem
cls.__siftdown(heap, startpos, pos)
def _get(self):
lastelt = self.queue.pop()
if self.queue:
returnitem = self.queue[0]
self.queue[0] = lastelt
self.__siftup(self.queue, 0)
return returnitem
return lastelt
class Thread(object):
DEFAULT_STACK_SIZE = _thread.stack_size()
def __init__(self, target=None, args=(), kwargs=None):
self.__target = target
self.__args = args
self.__kwargs = kwargs or {}
self.__ident = None
self.__stopped_event = Event()
def is_running(self):
if self.__ident is None:
return False
else:
return _thread.threadIsRunning(self.__ident)
def join(self, timeout=None):
return self.__stopped_event.wait(timeout=timeout)
def terminate(self):
"""WARNING: you must release all resources after terminate thread, especially **Lock(s)**"""
if self.is_running():
_thread.stop_thread(self.ident)
self.__ident = None
self.__stopped_event.set()
def start(self, stack_size=None):
if self.__ident is not None:
raise RuntimeError("threads can only be started once")
if stack_size is not None:
_thread.stack_size(stack_size * 1024)
self.__ident = _thread.start_new_thread(self.__bootstrap, ())
if stack_size is not None:
_thread.stack_size(self.DEFAULT_STACK_SIZE)
def __bootstrap(self):
try:
self.run()
except Exception as e:
sys.print_exception(e)
finally:
self.__stopped_event.set()
def run(self):
if self.__target:
self.__target(*self.__args, **self.__kwargs)
@property
def ident(self):
return self.__ident
class _Result(object):
class TimeoutError(Exception):
pass
class NotReadyError(Exception):
pass
def __init__(self):
self.__rv = None
self.__exc = None
self.__finished = Event()
def set(self, exc=None, rv=None):
self.__exc = exc
self.__rv = rv
self.__finished.set()
def __get_value_or_raise_exc(self):
if self.__exc:
raise self.__exc
return self.__rv
def get(self, block=True, timeout=None):
if not block:
if self.__finished.is_set():
return self.__get_value_or_raise_exc()
raise self.NotReadyError("result not ready")
if self.__finished.wait(timeout=timeout):
return self.__get_value_or_raise_exc()
else:
raise self.TimeoutError("get result timeout.")
class AsyncTask(object):
def __init__(self, target=None, args=(), kwargs=None):
self.__target = target
self.__args = args
self.__kwargs = kwargs or {}
def delay(self, seconds=None):
result = _Result()
Thread(target=self.__run, args=(result, seconds)).start()
return result
def __run(self, result, delay_seconds):
if delay_seconds is not None and delay_seconds > 0:
utime.sleep(delay_seconds)
try:
rv = self.__target(*self.__args, **self.__kwargs)
except Exception as e:
sys.print_exception(e)
result.set(exc=e)
else:
result.set(rv=rv)
@classmethod
def wrapper(cls, func):
def inner_wrapper(*args, **kwargs):
return cls(target=func, args=args, kwargs=kwargs)
return inner_wrapper
class _WorkItem(object):
def __init__(self, target=None, args=(), kwargs=None):
self.__target = target
self.__args = args
self.__kwargs = kwargs or {}
self.result = _Result()
def __call__(self, *args, **kwargs):
try:
rv = self.__target(*self.__args, **self.__kwargs)
except Exception as e:
self.result.set(exc=e)
else:
self.result.set(rv=rv)
def _worker(work_queue):
while True:
try:
task = work_queue.get()
task()
except Exception as e:
sys.print_exception(e)
class ThreadPoolExecutor(object):
def __init__(self, max_workers=4):
if max_workers <= 0:
raise ValueError("max_workers must be greater than 0.")
self.__max_workers = max_workers
self.__work_queue = Queue()
self.__threads = set()
self.__lock = Lock()
def submit(self, *args, **kwargs):
with self.__lock:
item = _WorkItem(*args, **kwargs)
self.__work_queue.put(item)
self.__adjust_thread_count()
return item.result
def __adjust_thread_count(self):
if len(self.__threads) < self.__max_workers:
t = Thread(target=_worker, args=(self.__work_queue, ))
t.start()
self.__threads.add(t)
def shutdown(self):
with self.__lock:
for t in self.__threads:
t.terminate()
self.__threads = set()
self.__work_queue = Queue()