/usr/lib/python3/dist-packages/mypy/waiter.py is in python3-mypy 0.560-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | """Parallel subprocess task runner.
This is used for running mypy tests.
"""
from typing import Dict, List, Optional, Set, Tuple, Any, Iterable, IO
import os
from multiprocessing import cpu_count
import pipes
import re
from subprocess import Popen, STDOUT, DEVNULL
import sys
import tempfile
import time
import json
from collections import defaultdict
class WaiterError(Exception):
pass
class LazySubprocess:
"""Wrapper around a subprocess that runs a test task."""
def __init__(self, name: str, args: List[str], *, cwd: Optional[str] = None,
env: Optional[Dict[str, str]] = None,
passthrough: Optional[int] = None) -> None:
self.name = name
self.args = args
self.cwd = cwd
self.env = env
self.start_time = None # type: Optional[float]
self.end_time = None # type: Optional[float]
# None means no passthrough
# otherwise, it represents verbosity level
self.passthrough = passthrough
def start(self) -> None:
if self.passthrough is None or self.passthrough < 0:
self.outfile = tempfile.TemporaryFile() # type: Optional[IO[Any]]
else:
self.outfile = None
self.start_time = time.perf_counter()
self.process = Popen(self.args, cwd=self.cwd, env=self.env,
stdout=self.outfile, stderr=STDOUT)
self.pid = self.process.pid
def wait(self) -> int:
return self.process.wait()
def status(self) -> Optional[int]:
return self.process.returncode
def read_output(self) -> str:
if not self.outfile:
return ''
file = self.outfile
file.seek(0)
# Assume it's ascii to avoid unicode headaches (and portability issues).
return file.read().decode('ascii')
@property
def elapsed_time(self) -> float:
if self.end_time is None or self.start_time is None:
return 0
else:
return self.end_time - self.start_time
class Noter:
"""Update stats about running jobs.
Only used when verbosity == 0.
"""
def __init__(self, total: int) -> None:
# Total number of tasks.
self.total = total
self.running = set() # type: Set[int]
# Passed tasks.
self.passes = 0
# Failed tasks.
self.fails = 0
def start(self, job: int) -> None:
self.running.add(job)
self.update()
def stop(self, job: int, failed: bool) -> None:
self.running.remove(job)
if failed:
self.fails += 1
else:
self.passes += 1
self.update()
def message(self, msg: str) -> None:
# Using a CR instead of NL will overwrite the line.
sys.stdout.write('%-80s\r' % msg)
sys.stdout.flush()
def update(self) -> None:
pending = self.total - self.passes - self.fails - len(self.running)
args = (self.passes, self.fails, pending, len(self.running))
msg = 'passed %d, failed %d, pending %d; running %d' % args
self.message(msg)
def clear(self) -> None:
self.message('')
class Waiter:
"""Run subprocesses in parallel and wait for them.
Usage:
waiter = Waiter()
waiter.add('sleep 9')
waiter.add('sleep 10')
if not waiter.run():
print('error')
"""
LOGSIZE = 50
FULL_LOG_FILENAME = '.runtest_log.json'
def __init__(self, limit: int = 0, *, verbosity: int = 0, xfail: List[str] = [],
lf: bool = False, ff: bool = False) -> None:
self.verbosity = verbosity
self.queue = [] # type: List[LazySubprocess]
# Index of next task to run in the queue.
self.next = 0
self.current = {} # type: Dict[int, Tuple[int, LazySubprocess]]
if limit == 0:
try:
sched_getaffinity = os.sched_getaffinity
except AttributeError:
# no support for affinity on OSX/Windows
limit = cpu_count()
else:
# Note: only count CPUs we are allowed to use. It is a
# major mistake to count *all* CPUs on the machine.
limit = len(sched_getaffinity(0))
self.limit = limit
self.lf = lf
self.ff = ff
assert limit > 0
self.xfail = set(xfail)
self._note = None # type: Optional[Noter]
self.times1 = {} # type: Dict[str, float]
self.times2 = {} # type: Dict[str, float]
self.new_log = defaultdict(dict) # type: Dict[str, Dict[str, float]]
self.sequential_tasks = set() # type: Set[str]
def load_log_file(self) -> Optional[List[Dict[str, Dict[str, Any]]]]:
try:
# get the last log
with open(self.FULL_LOG_FILENAME) as fp:
test_log = json.load(fp)
except FileNotFoundError:
test_log = []
except json.JSONDecodeError:
print('corrupt test log file {}'.format(self.FULL_LOG_FILENAME), file=sys.stderr)
test_log = []
return test_log
def add(self, cmd: LazySubprocess, sequential: bool = False) -> int:
rv = len(self.queue)
if cmd.name in (task.name for task in self.queue):
sys.exit('Duplicate test name: {}'.format(cmd.name))
self.queue.append(cmd)
if sequential:
self.sequential_tasks.add(cmd.name)
return rv
def _start_next(self) -> None:
num = self.next
cmd = self.queue[num]
name = cmd.name
cmd.start()
self.current[cmd.pid] = (num, cmd)
if self.verbosity >= 1:
print('%-8s #%d %s' % ('START', num, name))
if self.verbosity >= 2:
print('%-8s #%d %s' % ('CWD', num, cmd.cwd or '.'))
cmd_str = ' '.join(pipes.quote(a) for a in cmd.args)
print('%-8s #%d %s' % ('COMMAND', num, cmd_str))
sys.stdout.flush()
elif self.verbosity >= 0:
assert self._note is not None
self._note.start(num)
self.next += 1
def _record_time(self, name: str, elapsed_time: float) -> None:
# The names we use are space-separated series of rather arbitrary words.
# They tend to start general and get more specific, so use that.
name1 = re.sub(' .*', '', name) # First word.
self.times1[name1] = elapsed_time + self.times1.get(name1, 0)
name2 = re.sub('( .*?) .*', r'\1', name) # First two words.
self.times2[name2] = elapsed_time + self.times2.get(name2, 0)
def _poll_current(self) -> Tuple[int, int]:
while True:
time.sleep(.01)
for pid in self.current:
cmd = self.current[pid][1]
code = cmd.process.poll()
if code is not None:
cmd.end_time = time.perf_counter()
assert cmd.start_time is not None
self.new_log['exit_code'][cmd.name] = code
self.new_log['runtime'][cmd.name] = cmd.end_time - cmd.start_time
return pid, code
def _wait_next(self) -> Tuple[List[str], int, int]:
"""Wait for a single task to finish.
Return tuple (list of failed tasks, number test cases, number of failed tests).
"""
pid, status = self._poll_current()
num, cmd = self.current.pop(pid)
name = cmd.name
self._record_time(cmd.name, cmd.elapsed_time)
rc = cmd.wait()
if rc >= 0:
msg = 'EXIT %d' % rc
else:
msg = 'SIG %d' % -rc
if self.verbosity >= 1:
print('%-8s #%d %s' % (msg, num, name))
sys.stdout.flush()
elif self.verbosity >= 0:
assert self._note is not None
self._note.stop(num, bool(rc))
elif self.verbosity >= -1:
sys.stdout.write('.' if rc == 0 else msg[0])
num_complete = self.next - len(self.current)
if num_complete % 50 == 0 or num_complete == len(self.queue):
sys.stdout.write(' %d/%d\n' % (num_complete, len(self.queue)))
elif num_complete % 10 == 0:
sys.stdout.write(' ')
sys.stdout.flush()
if rc != 0:
if name not in self.xfail:
fail_type = 'FAILURE' # type: Optional[str]
else:
fail_type = 'XFAIL'
else:
if name not in self.xfail:
fail_type = None
else:
fail_type = 'UPASS'
# Get task output.
output = cmd.read_output()
num_tests, num_tests_failed = parse_test_stats_from_output(output, fail_type)
if fail_type is not None or self.verbosity >= 1:
self._report_task_failure(fail_type, num, name, output)
if fail_type is not None:
failed_tasks = ['%8s %s' % (fail_type, name)]
else:
failed_tasks = []
return failed_tasks, num_tests, num_tests_failed
def _report_task_failure(self, fail_type: Optional[str], num: int, name: str,
output: str) -> None:
if self.verbosity <= 0:
sys.stdout.write('\n')
sys.stdout.write('\n%-8s #%d %s\n\n' % (fail_type or 'PASS', num, name))
sys.stdout.write(output + '\n')
sys.stdout.flush()
def run(self) -> int:
if self.verbosity >= -1:
print('%-8s %d' % ('PARALLEL', self.limit))
sys.stdout.flush()
if self.verbosity == 0:
self._note = Noter(len(self.queue))
print('SUMMARY %d tasks selected' % len(self.queue))
def avg(lst: Iterable[float]) -> float:
valid_items = [item for item in lst if item is not None]
if not valid_items:
# we don't know how long a new task takes
# better err by putting it in front in case it is slow:
# a fast task in front hurts performance less than a slow task in the back
return float('inf')
else:
return sum(valid_items) / len(valid_items)
logs = self.load_log_file()
if logs:
times = {cmd.name: avg(log['runtime'].get(cmd.name, None) for log in logs)
for cmd in self.queue}
def sort_function(cmd: LazySubprocess) -> Tuple[Any, int, float]:
# longest tasks first
runtime = -times[cmd.name]
# sequential tasks go first by default
sequential = -(cmd.name in self.sequential_tasks)
if self.ff:
# failed tasks first with -ff
assert logs is not None
exit_code = -logs[-1]['exit_code'].get(cmd.name, 0)
if not exit_code:
# avoid interrupting parallel tasks with sequential in between
# so either: seq failed, parallel failed, parallel passed, seq passed
# or: parallel failed, seq failed, seq passed, parallel passed
# I picked the first one arbitrarily, since no obvious pros/cons
# in other words, among failed tasks, sequential should go before parallel,
# and among successful tasks, sequential should go after parallel
sequential = -sequential
else:
# ignore exit code without -ff
exit_code = 0
return exit_code, sequential, runtime
self.queue = sorted(self.queue, key=sort_function)
if self.lf:
self.queue = [cmd for cmd in self.queue
if logs[-1]['exit_code'].get(cmd.name, 0)]
sys.stdout.flush()
# Failed tasks.
all_failures = [] # type: List[str]
# Number of test cases. Some tasks can involve multiple test cases.
total_tests = 0
# Number of failed test cases.
total_failed_tests = 0
running_sequential_task = False
while self.current or self.next < len(self.queue):
while len(self.current) < self.limit and self.next < len(self.queue):
# only start next task if idle, or current and next tasks are both parallel
if running_sequential_task:
break
if self.queue[self.next].name in self.sequential_tasks:
if self.current:
break
else:
running_sequential_task = True
self._start_next()
fails, tests, test_fails = self._wait_next()
running_sequential_task = False
all_failures += fails
total_tests += tests
total_failed_tests += test_fails
if self.verbosity == 0:
assert self._note is not None
self._note.clear()
if self.new_log: # don't append empty log, it will corrupt the cache file
# log only LOGSIZE most recent tests
logs = self.load_log_file()
assert logs is not None
test_log = (logs + [self.new_log])[-self.LOGSIZE:]
try:
with open(self.FULL_LOG_FILENAME, 'w') as fp:
json.dump(test_log, fp, sort_keys=True, indent=4)
except Exception as e:
print('cannot save test log file:', e)
if all_failures:
summary = 'SUMMARY %d/%d tasks and %d/%d tests failed' % (
len(all_failures), len(self.queue), total_failed_tests, total_tests)
print(summary)
for f in all_failures:
print(f)
print(summary)
print('*** FAILURE ***')
sys.stdout.flush()
if any('XFAIL' not in f for f in all_failures):
return 1
else:
print('SUMMARY all %d tasks and %d tests passed' % (
len(self.queue), total_tests))
print('*** OK ***')
sys.stdout.flush()
return 0
def parse_test_stats_from_output(output: str, fail_type: Optional[str]) -> Tuple[int, int]:
"""Parse tasks output and determine test counts.
Return tuple (number of tests, number of test failures). Default
to the entire task representing a single test as a fallback.
"""
# pytest
m = re.search('^=+ (.*) in [0-9.]+ seconds =+\n\Z', output, re.MULTILINE)
if m:
counts = {}
for part in m.group(1).split(', '): # e.g., '3 failed, 32 passed, 345 deselected'
count, key = part.split()
counts[key] = int(count)
return (sum(c for k, c in counts.items() if k != 'deselected'),
counts.get('failed', 0))
# myunit
m = re.search('^([0-9]+)/([0-9]+) test cases failed(, ([0-9]+) skipped)?.$', output,
re.MULTILINE)
if m:
return int(m.group(2)), int(m.group(1))
m = re.search('^([0-9]+) test cases run(, ([0-9]+) skipped)?, all passed.$', output,
re.MULTILINE)
if m:
return int(m.group(1)), 0
# Couldn't find test counts, so fall back to single test per tasks.
if fail_type is not None:
return 1, 1
else:
return 1, 0
|