Ignore:
Timestamp:
Sep 29, 2022, 11:33:03 AM (23 months ago)
Author:
Thierry Delisle <tdelisle@…>
Branches:
ADT, ast-experimental, master
Children:
5f9c42b
Parents:
a659b31
Message:

Added some defensive programming to work around parsing bug

File:
1 edited

Legend:

Unmodified
Added
Removed
  • libcfa/src/concurrency/kernel/cluster.cfa

    ra659b31 r1756e08  
    254254}
    255255
    256 static void assign_list(unsigned & valrq, unsigned & valio, dlist(processor) & list, unsigned count) {
    257         processor * it = &list`first;
     256static void assign_list(unsigned & valrq, unsigned & valio, dlist(struct processor) & list, unsigned count) {
     257        struct processor * it = &list`first;
    258258        for(unsigned i = 0; i < count; i++) {
    259259                /* paranoid */ verifyf( it, "Unexpected null iterator, at index %u of %u\n", i, count);
     
    278278
    279279#if defined(CFA_HAVE_LINUX_IO_URING_H)
    280         static void assign_io(io_context$ ** data, size_t count, dlist(processor) & list) {
    281                 processor * it = &list`first;
     280        static void assign_io(io_context$ ** data, size_t count, dlist(struct processor) & list) {
     281                struct processor * it = &list`first;
    282282                while(it) {
    283283                        /* paranoid */ verifyf( it, "Unexpected null iterator\n");
Note: See TracChangeset for help on using the changeset viewer.