Changeset 81ab5eb for libcfa/src/concurrency/io.cfa
- Timestamp:
- Mar 29, 2026, 9:52:51 PM (5 days ago)
- Branches:
- master
- Children:
- e6e250d
- Parents:
- 00675ed4
- File:
-
- 1 edited
-
libcfa/src/concurrency/io.cfa (modified) (4 diffs)
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/io.cfa
r00675ed4 r81ab5eb 594 594 lock( queue.lock __cfaabi_dbg_ctx2 ); 595 595 { 596 was_empty = isEmpty( queue.queue );596 was_empty = empty( queue.queue ); 597 597 598 598 // Add our request to the list … … 632 632 // notify the arbiter that new allocations are available 633 633 static void __ioarbiter_notify( io_arbiter$ & this, io_context$ * ctx ) { 634 /* paranoid */ verify( ! isEmpty( this.pending.queue ) );634 /* paranoid */ verify( ! empty( this.pending.queue ) ); 635 635 /* paranoid */ verify( __preemption_enabled() ); 636 636 … … 642 642 // as long as there are pending allocations try to satisfy them 643 643 // for simplicity do it in FIFO order 644 while( ! isEmpty( this.pending.queue ) ) {644 while( ! empty( this.pending.queue ) ) { 645 645 // get first pending allocs 646 646 __u32 have = ctx->sq.free_ring.tail - ctx->sq.free_ring.head; … … 727 727 // pop each operation one at a time. 728 728 // There is no wait morphing because of the io sq ring 729 while( ! isEmpty( ctx.ext_sq.queue ) ) {729 while( ! empty( ctx.ext_sq.queue ) ) { 730 730 // drop the element from the queue 731 731 __external_io & ei = (__external_io&)remove_first( ctx.ext_sq.queue );
Note:
See TracChangeset
for help on using the changeset viewer.