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 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722
|
"""
Theses test cases demonstrate the API for shared resources.
"""
# Pytest gets the parameters "env" and "log" from the *conftest.py* file
import pytest
import simpy
#
# Tests for Resource
#
def test_resource(env, log):
"""A *resource* is something with a limited numer of slots that need
to be requested before and released after the usage (e.g., gas pumps
at a gas station).
"""
def pem(env, name, resource, log):
req = resource.request()
yield req
assert resource.count == 1
yield env.timeout(1)
resource.release(req)
log.append((name, env.now))
resource = simpy.Resource(env, capacity=1)
assert resource.capacity == 1
assert resource.count == 0
env.process(pem(env, 'a', resource, log))
env.process(pem(env, 'b', resource, log))
env.run()
assert log == [('a', 1), ('b', 2)]
def test_resource_capacity(env):
pytest.raises(ValueError, simpy.Resource, env, 0)
def test_resource_context_manager(env, log):
"""The event that ``Resource.request()`` returns can be used as
Context Manager."""
def pem(env, name, resource, log):
with resource.request() as request:
yield request
yield env.timeout(1)
log.append((name, env.now))
resource = simpy.Resource(env, capacity=1)
env.process(pem(env, 'a', resource, log))
env.process(pem(env, 'b', resource, log))
env.run()
assert log == [('a', 1), ('b', 2)]
def test_resource_slots(env, log):
def pem(env, name, resource, log):
with resource.request() as req:
yield req
log.append((name, env.now))
yield env.timeout(1)
resource = simpy.Resource(env, capacity=3)
for i in range(9):
env.process(pem(env, str(i), resource, log))
env.run()
assert log == [('0', 0), ('1', 0), ('2', 0), ('3', 1), ('4', 1), ('5', 1),
('6', 2), ('7', 2), ('8', 2)]
def test_resource_continue_after_interrupt(env):
"""A process may be interrupted while waiting for a resource but
should be able to continue waiting afterwards."""
def pem(env, res):
with res.request() as req:
yield req
yield env.timeout(1)
def victim(env, res):
try:
evt = res.request()
yield evt
pytest.fail('Should not have gotten the resource.')
except simpy.Interrupt:
yield evt
res.release(evt)
assert env.now == 1
def interruptor(env, proc):
proc.interrupt()
yield env.exit(0)
res = simpy.Resource(env, 1)
env.process(pem(env, res))
proc = env.process(victim(env, res))
env.process(interruptor(env, proc))
env.run()
def test_resource_release_after_interrupt(env):
"""A process needs to release a resource, even it it was interrupted
and does not continue to wait for it."""
def blocker(env, res):
with res.request() as req:
yield req
yield env.timeout(1)
def victim(env, res):
try:
evt = res.request()
yield evt
pytest.fail('Should not have gotten the resource.')
except simpy.Interrupt:
# Dont wait for the resource
res.release(evt)
assert env.now == 0
env.exit()
def interruptor(env, proc):
proc.interrupt()
yield env.exit(0)
res = simpy.Resource(env, 1)
env.process(blocker(env, res))
victim_proc = env.process(victim(env, res))
env.process(interruptor(env, victim_proc))
env.run()
def test_resource_immediate_requests(env):
"""A process must not acquire a resource if it releases it and immediately
requests it again while there are already other requesting processes."""
def child(env, res):
result = []
for i in range(3):
with res.request() as req:
yield req
result.append(env.now)
yield env.timeout(1)
env.exit(result)
def parent(env):
res = simpy.Resource(env, 1)
child_a = env.process(child(env, res))
child_b = env.process(child(env, res))
a_acquire_times = yield child_a
b_acquire_times = yield child_b
assert a_acquire_times == [0, 2, 4]
assert b_acquire_times == [1, 3, 5]
env.process(parent(env))
env.run()
def test_resource_cm_exception(env, log):
"""Resource with context manager receives an exception."""
def process(env, resource, log, raise_):
try:
with resource.request() as req:
yield req
yield env.timeout(1)
log.append(env.now)
if raise_:
raise ValueError('Foo')
except ValueError as err:
assert err.args == ('Foo',)
resource = simpy.Resource(env, 1)
env.process(process(env, resource, log, True))
# The second process is used to check if it was able to access the
# resource:
env.process(process(env, resource, log, False))
env.run()
assert log == [1, 2]
def test_resource_with_condition(env):
def process(env, resource):
with resource.request() as res_event:
result = yield res_event | env.timeout(1)
assert res_event in result
resource = simpy.Resource(env, 1)
env.process(process(env, resource))
env.run()
def test_resource_with_priority_queue(env):
def process(env, delay, resource, priority, res_time):
yield env.timeout(delay)
req = resource.request(priority=priority)
yield req
assert env.now == res_time
yield env.timeout(5)
resource.release(req)
resource = simpy.PriorityResource(env, capacity=1)
env.process(process(env, 0, resource, 2, 0))
env.process(process(env, 2, resource, 3, 10))
env.process(process(env, 2, resource, 3, 15)) # Test equal priority
env.process(process(env, 4, resource, 1, 5))
env.run()
def test_sorted_queue_maxlen(env):
"""Requests must fail if more than *maxlen* requests happen
concurrently."""
resource = simpy.PriorityResource(env, capacity=1)
resource.put_queue.maxlen = 1
def process(env, resource):
# The first request immediately triggered and does not enter the queue.
resource.request(priority=1)
# The second request is enqueued.
resource.request(priority=1)
try:
# The third request will now fail.
resource.request(priority=1)
pytest.fail('Expected a RuntimeError')
except RuntimeError as e:
assert e.args[0] == 'Cannot append event. Queue is full.'
yield env.timeout(0)
env.process(process(env, resource))
env.run()
def test_get_users(env):
def process(env, resource):
with resource.request() as req:
yield req
yield env.timeout(1)
resource = simpy.Resource(env, 1)
procs = [env.process(process(env, resource)) for i in range(3)]
env.run(until=1)
assert [evt.proc for evt in resource.users] == procs[0:1]
assert [evt.proc for evt in resource.queue] == procs[1:]
env.run(until=2)
assert [evt.proc for evt in resource.users] == procs[1:2]
assert [evt.proc for evt in resource.queue] == procs[2:]
#
# Tests for PreemptiveResource
#
def test_preemptive_resource(env):
"""Processes with a higher priority may preempt requests of lower priority
processes. Note that higher priorities are indicated by a lower number
value."""
def proc_a(env, resource, prio):
try:
with resource.request(priority=prio) as req:
yield req
pytest.fail('Should have received an interrupt/preemption.')
except simpy.Interrupt:
pass
def proc_b(env, resource, prio):
with resource.request(priority=prio) as req:
yield req
resource = simpy.PreemptiveResource(env, 1)
env.process(proc_a(env, resource, 1))
env.process(proc_b(env, resource, 0))
env.run()
def test_preemptive_resource_timeout_0(env):
def proc_a(env, resource, prio):
with resource.request(priority=prio) as req:
try:
yield req
yield env.timeout(1)
pytest.fail('Should have received an interrupt/preemption.')
except simpy.Interrupt:
pass
yield env.event()
def proc_b(env, resource, prio):
with resource.request(priority=prio) as req:
yield req
resource = simpy.PreemptiveResource(env, 1)
env.process(proc_a(env, resource, 1))
env.process(proc_b(env, resource, 0))
env.run()
def test_mixed_preemption(env, log):
def p(id, env, res, delay, prio, preempt, log):
yield env.timeout(delay)
with res.request(priority=prio, preempt=preempt) as req:
try:
yield req
yield env.timeout(2)
log.append((env.now, id))
except simpy.Interrupt as ir:
log.append((env.now, id, (ir.cause.by, ir.cause.usage_since)))
res = simpy.PreemptiveResource(env, 1)
# p0: First user:
env.process(p(0, env, res, delay=0, prio=2, preempt=True, log=log))
# p1: Waits (cannot preempt):
env.process(p(1, env, res, delay=0, prio=2, preempt=True, log=log))
# p2: Waits later, but has a higher prio:
env.process(p(2, env, res, delay=1, prio=1, preempt=False, log=log))
# p3: Preempt the above proc:
p3 = env.process(p(3, env, res, delay=3, prio=0, preempt=True, log=log))
# p4: Wait again:
env.process(p(4, env, res, delay=4, prio=3, preempt=True, log=log))
env.run()
assert log == [
(2, 0), # p0 done
(3, 2, (p3, 2)), # p2 got it next, but got interrupted by p3
(5, 3), # p3 done
(7, 1), # p1 done (finally got the resource)
(9, 4), # p4 done
]
def test_nested_preemption(env, log):
def process(id, env, res, delay, prio, preempt, log):
yield env.timeout(delay)
with res.request(priority=prio, preempt=preempt) as req:
try:
yield req
yield env.timeout(5)
log.append((env.now, id))
except simpy.Interrupt as ir:
log.append((env.now, id, (ir.cause.by, ir.cause.usage_since)))
def process2(id, env, res0, res1, delay, prio, preempt, log):
yield env.timeout(delay)
with res0.request(priority=prio, preempt=preempt) as req0:
try:
yield req0
with res1.request(priority=prio, preempt=preempt) as req1:
try:
yield req1
yield env.timeout(5)
log.append((env.now, id))
except simpy.Interrupt as ir:
log.append((env.now, id, (ir.cause.by,
ir.cause.usage_since,
ir.cause.resource)))
except simpy.Interrupt as ir:
log.append((env.now, id, (ir.cause.by, ir.cause.usage_since,
ir.cause.resource)))
res0 = simpy.PreemptiveResource(env, 1)
res1 = simpy.PreemptiveResource(env, 1)
env.process(process2(0, env, res0, res1, 0, -1, True, log))
p1 = env.process(process(1, env, res1, 1, -2, True, log))
env.process(process2(2, env, res0, res1, 20, -1, True, log))
p3 = env.process(process(3, env, res0, 21, -2, True, log))
env.process(process2(4, env, res0, res1, 21, -1, True, log))
env.run()
assert log == [
(1, 0, (p1, 0, res1)),
(6, 1),
(21, 2, (p3, 20, res0)),
(26, 3), (31, 4),
]
#
# Tests for Container
#
def test_container(env, log):
"""A *container* is a resource (of optinally limited capacity) where
you can put in our take out a discrete or continuous amount of
things (e.g., a box of lump sugar or a can of milk). The *put* and
*get* operations block if the buffer is to full or to empty. If they
return, the process nows that the *put* or *get* operation was
successfull.
"""
def putter(env, buf, log):
yield env.timeout(1)
while True:
yield buf.put(2)
log.append(('p', env.now))
yield env.timeout(1)
def getter(env, buf, log):
yield buf.get(1)
log.append(('g', env.now))
yield env.timeout(1)
yield buf.get(1)
log.append(('g', env.now))
buf = simpy.Container(env, init=0, capacity=2)
env.process(putter(env, buf, log))
env.process(getter(env, buf, log))
env.run(until=5)
assert log == [('p', 1), ('g', 1), ('g', 2), ('p', 2)]
def test_container_get_queued(env):
def proc(env, wait, container, what):
yield env.timeout(wait)
with getattr(container, what)(1) as req:
yield req
container = simpy.Container(env, 1)
p0 = env.process(proc(env, 0, container, 'get'))
env.process(proc(env, 1, container, 'put'))
env.process(proc(env, 1, container, 'put'))
p3 = env.process(proc(env, 1, container, 'put'))
env.run(until=1)
assert [ev.proc for ev in container.put_queue] == []
assert [ev.proc for ev in container.get_queue] == [p0]
env.run(until=2)
assert [ev.proc for ev in container.put_queue] == [p3]
assert [ev.proc for ev in container.get_queue] == []
def test_initial_container_capacity(env):
container = simpy.Container(env)
assert container.capacity == float('inf')
def test_container_get_put_bounds(env):
container = simpy.Container(env)
pytest.raises(ValueError, container.get, -13)
pytest.raises(ValueError, container.put, -13)
@pytest.mark.parametrize(('error', 'args'), [
(None, [2, 1]), # normal case
(None, [1, 1]), # init == capacity should be valid
(None, [1, 0]), # init == 0 should be valid
(ValueError, [1, 2]), # init > capcity
(ValueError, [0]), # capacity == 0
(ValueError, [-1]), # capacity < 0
(ValueError, [1, -1]), # init < 0
])
def test_container_init_capacity(env, error, args):
args.insert(0, env)
if error:
pytest.raises(error, simpy.Container, *args)
else:
simpy.Container(*args)
#
# Tests fore Store
#
def test_store(env):
"""A store models the production and consumption of concrete python
objects (in contrast to containers, where you only now if the *put*
or *get* operations were successfull but don't get concrete
objects).
"""
def putter(env, store, item):
yield store.put(item)
def getter(env, store, orig_item):
item = yield store.get()
assert item is orig_item
store = simpy.Store(env, capacity=2)
item = object()
# NOTE: Does the start order matter? Need to test this.
env.process(putter(env, store, item))
env.process(getter(env, store, item))
env.run()
@pytest.mark.parametrize('Store', [
simpy.Store,
simpy.FilterStore,
])
def test_initial_store_capacity(env, Store):
store = Store(env)
assert store.capacity == float('inf')
def test_store_capacity(env):
pytest.raises(ValueError, simpy.Store, env, 0)
pytest.raises(ValueError, simpy.Store, env, -1)
capacity = 2
store = simpy.Store(env, capacity)
env.process((store.put(i) for i in range(capacity + 1)))
env.run()
# Ensure store is filled to capacity
assert len(store.items) == capacity
def test_store_cancel(env):
store = simpy.Store(env, capacity=1)
def acquire_implicit_cancel():
with store.get():
yield env.timeout(1)
# implicit cancel() when exiting with-block
env.process(acquire_implicit_cancel())
env.run()
def test_priority_store_item_priority(env):
pstore = simpy.PriorityStore(env, 3)
log = []
def getter(wait):
yield env.timeout(wait)
item = yield pstore.get()
log.append(item)
# Do not specify priority; the items themselves will be compared to
# determine priority.
env.process((pstore.put(s) for s in 'bcadefg'))
env.process(getter(1))
env.process(getter(2))
env.process(getter(3))
env.run()
assert log == ['a', 'b', 'c']
def test_priority_store_stable_order(env):
pstore = simpy.PriorityStore(env, 3)
log = []
def getter(wait):
yield env.timeout(wait)
_, item = yield pstore.get()
log.append(item)
items = [object() for _ in range(3)]
# Unorderable items are inserted with same priority.
env.process((pstore.put(simpy.PriorityItem(0, item)) for item in items))
env.process(getter(1))
env.process(getter(2))
env.process(getter(3))
env.run()
# Since the priorities were the same for all items, ensure that items are
# retrieved in insertion order.
assert log == items
def test_filter_store(env):
def pem(env):
store = simpy.FilterStore(env, capacity=2)
get_event = store.get(lambda item: item == 'b')
yield store.put('a')
assert not get_event.triggered
yield store.put('b')
assert get_event.triggered
env.process(pem(env))
env.run()
def test_filter_store_get_after_mismatch(env):
"""Regression test for issue #49.
Triggering get-events after a put in FilterStore wrongly breaks after the
first mismatch.
"""
def putter(env, store):
# The order of putting 'spam' before 'eggs' is important here.
yield store.put('spam')
yield env.timeout(1)
yield store.put('eggs')
def getter(store):
# The order of requesting 'eggs' before 'spam' is important here.
eggs = store.get(lambda i: i == 'eggs')
spam = store.get(lambda i: i == 'spam')
ret = yield spam | eggs
assert spam in ret and eggs not in ret
assert env.now == 0
yield eggs
assert env.now == 1
store = simpy.FilterStore(env, capacity=2)
env.process(getter(store))
env.process(putter(env, store))
env.run()
def test_filter_calls_best_case(env):
"""The filter function is called every item in the store until a match is
found. In the best case the first item already matches."""
log = []
def log_filter(item):
log.append('check %s' % item)
return True
store = simpy.FilterStore(env)
store.items = [1, 2, 3]
def getter(store):
log.append('get %s' % (yield store.get(log_filter)))
log.append('get %s' % (yield store.get(log_filter)))
log.append('get %s' % (yield store.get(log_filter)))
env.process(getter(store))
env.run()
assert log == ['check 1', 'get 1', 'check 2', 'get 2', 'check 3', 'get 3']
def test_filter_calls_worst_case(env):
"""In the worst case the filter function is being called for items multiple
times."""
log = []
store = simpy.FilterStore(env)
def putter(store):
for i in range(4):
log.append('put %s' % i)
yield store.put(i)
def log_filter(item):
log.append('check %s' % item)
return item >= 3
def getter(store):
log.append('get %s' % (yield store.get(log_filter)))
env.process(getter(store))
env.process(putter(store))
env.run()
# The filter function is repeatedly called for every item in the store
# until a match is found.
assert log == [
'put 0', 'check 0',
'put 1', 'check 0', 'check 1',
'put 2', 'check 0', 'check 1', 'check 2',
'put 3', 'check 0', 'check 1', 'check 2', 'check 3', 'get 3',
]
def test_immediate_put_request(env):
"""Put requests that can be fulfilled immediately do not enter the put
queue."""
resource = simpy.Resource(env, capacity=1)
assert len(resource.users) == 0
assert len(resource.queue) == 0
# The resource is empty, the first request will succeed immediately without
# entering the queue.
request = resource.request()
assert request.triggered
assert len(resource.users) == 1
assert len(resource.queue) == 0
# A second request will get enqueued however.
request = resource.request()
assert not request.triggered
assert len(resource.users) == 1
assert len(resource.queue) == 1
def test_immediate_get_request(env):
"""Get requests that can be fulfilled immediately do not enter the get
queue."""
container = simpy.Container(env)
# Put something in the container, this request is triggered immediately
# without entering the queue.
request = container.put(1)
assert request.triggered
assert container.level == 1
assert len(container.put_queue) == 0
# The first get request will succeed immediately without entering the
# queue.
request = container.get(1)
assert request.triggered
assert container.level == 0
assert len(container.get_queue) == 0
# A second get request will get enqueued.
request = container.get(1)
assert not request.triggered
assert len(container.get_queue) == 1
|