Changeset 6b33e89 for libcfa/src/concurrency/kernel/cluster.cfa
- Timestamp:
- Apr 25, 2025, 7:39:09 AM (5 months ago)
- Branches:
- master
- Children:
- 65bd3c2
- Parents:
- b195498
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/kernel/cluster.cfa
rb195498 r6b33e89 234 234 235 235 static void assign_list(unsigned & valrq, unsigned & valio, dlist(struct processor) & list, unsigned count) { 236 struct processor * it = & list`first;236 struct processor * it = &first( list ); 237 237 for(unsigned i = 0; i < count; i++) { 238 238 /* paranoid */ verifyf( it, "Unexpected null iterator, at index %u of %u\n", i, count); … … 245 245 valio += __shard_factor.io; 246 246 #endif 247 it = & (*it)`next;247 it = &next( *it ); 248 248 } 249 249 } … … 258 258 #if defined(CFA_HAVE_LINUX_IO_URING_H) 259 259 static void assign_io(io_context$ ** data, size_t count, dlist(struct processor) & list) { 260 struct processor * it = & list`first;260 struct processor * it = &first( list ); 261 261 while(it) { 262 262 /* paranoid */ verifyf( it, "Unexpected null iterator\n"); 263 263 /* paranoid */ verifyf( it->io.ctx->cq.id < count, "Processor %p has id %u above count %zu\n", it, it->rdq.id, count); 264 264 data[it->io.ctx->cq.id] = it->io.ctx; 265 it = & (*it)`next;265 it = &next( *it ); 266 266 } 267 267 }
Note:
See TracChangeset
for help on using the changeset viewer.