- File:
-
- 1 edited
-
libcfa/src/concurrency/ready_queue.cfa (modified) (3 diffs)
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/ready_queue.cfa
r343d10e r1eb239e4 419 419 // Actually pop the list 420 420 struct $thread * thrd; 421 thrd = pop(lane); 421 bool emptied; 422 [thrd, emptied] = pop(lane); 422 423 423 424 /* paranoid */ verify(thrd); … … 456 457 if(head(lane)->link.next == thrd) { 457 458 $thread * pthrd; 458 pthrd = pop(lane); 459 bool emptied; 460 [pthrd, emptied] = pop(lane); 459 461 460 462 /* paranoid */ verify( pthrd == thrd ); … … 606 608 while(!is_empty(lanes.data[idx])) { 607 609 struct $thread * thrd; 608 thrd = pop(lanes.data[idx]); 610 __attribute__((unused)) bool _; 611 [thrd, _] = pop(lanes.data[idx]); 609 612 610 613 push(cltr, thrd);
Note:
See TracChangeset
for help on using the changeset viewer.