Changeset 983edfd
- Timestamp:
- Dec 12, 2019, 11:52:11 AM (5 years ago)
- Branches:
- ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum
- Children:
- c84b4be
- Parents:
- 2a3d446
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/ready_queue.cfa
r2a3d446 r983edfd 484 484 verifyf((empty.mask[word] & (1ull << bit)) != 0, "After set %llu:%llu (%u), %llx & %llx", word, bit, i, empty.mask[word], (1ull << bit)); 485 485 } 486 verify (empty.count <= (int)list.count);487 verify ( list.data[i].last_id ==kernelTLS.this_processor->id );488 verify ( list.data[i].lock);486 verifyf( empty.count <= list.count, "Non-empty count (%zu) exceeds actual count (%zu)\n", empty.count, list.count ); 487 verifyf( list.data[i].last_id == kernelTLS.this_processor->id, "Expected last processor to lock queue %u to be %u, was %u\n", i, list.data[i].last_id, kernelTLS.this_processor->id ); 488 verifyf( list.data[i].lock, "List %u is not locked\n", i ); 489 489 490 490 // Unlock and return … … 768 768 __cfa_readyQ_mask_t clears = ~0; 769 769 770 for( b ; fbit ~ lbit ) {770 for( b ; lbit ~ fbit ) { 771 771 clears ^= 1 << b; 772 772 } 773 773 774 774 empty.mask[fword] &= clears; 775 776 777 empty.count = 0; 778 for( i ; lword ) { 779 empty.count += __builtin_popcountl(empty.mask[i]); 780 } 775 781 } 776 782
Note: See TracChangeset
for help on using the changeset viewer.