Changeset 90a8125 for libcfa/src/concurrency/kernel/cluster.cfa

Timestamp:

Jun 3, 2022, 3:10:01 PM (3 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, ast-experimental, master, pthread-emulation, qualifiedEnum

Children:

7affcda

Parents:

bf0263c (diff), fc134a48 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

File:

• libcfa/src/concurrency/kernel/cluster.cfa (modified) (6 diffs)

libcfa/src/concurrency/kernel/cluster.cfa

@@ -49 +49 @@
 
 // returns the maximum number of processors the RWLock support
-__attribute__((weak)) unsigned __max_processors() {
+__attribute__((weak)) unsigned __max_processors() libcfa_public {
         const char * max_cores_s = getenv("CFA_MAX_PROCESSORS");
         if(!max_cores_s) {
@@ -233 +233 @@
                                         if(is_empty(sl)) {
                                                 assert( sl.anchor.next == 0p );
-                                                assert( sl.anchor.ts   == -1llu );
+                                                assert( sl.anchor.ts   == MAX );
                                                 assert( mock_head(sl)  == sl.prev );
                                         } else {
                                                 assert( sl.anchor.next != 0p );
-                                                assert( sl.anchor.ts   != -1llu );
+                                                assert( sl.anchor.ts   != MAX );
                                                 assert( mock_head(sl)  != sl.prev );
                                         }
@@ -259 +259 @@
                 /* paranoid */ verifyf( it, "Unexpected null iterator, at index %u of %u\n", i, count);
                 it->rdq.id = valrq;
-                it->rdq.target = MAX;
+                it->rdq.target = UINT_MAX;
                 valrq += __shard_factor.readyq;
                 #if defined(CFA_HAVE_LINUX_IO_URING_H)
                         it->io.ctx->cq.id = valio;
-                        it->io.target = MAX;
+                        it->io.target = UINT_MAX;
                         valio += __shard_factor.io;
                 #endif
@@ -472 +472 @@
         this.prev = mock_head(this);
         this.anchor.next = 0p;
-        this.anchor.ts   = -1llu;
+        this.anchor.ts   = MAX;
         #if !defined(__CFA_NO_STATISTICS__)
                 this.cnt  = 0;
@@ -484 +484 @@
         /* paranoid */ verify( &mock_head(this)->link.ts   == &this.anchor.ts   );
         /* paranoid */ verify( mock_head(this)->link.next == 0p );
-        /* paranoid */ verify( mock_head(this)->link.ts   == -1llu  );
+        /* paranoid */ verify( mock_head(this)->link.ts   == MAX );
         /* paranoid */ verify( mock_head(this) == this.prev );
         /* paranoid */ verify( __alignof__(__intrusive_lane_t) == 128 );
@@ -495 +495 @@
         // Make sure the list is empty
         /* paranoid */ verify( this.anchor.next == 0p );
-        /* paranoid */ verify( this.anchor.ts   == -1llu );
+        /* paranoid */ verify( this.anchor.ts   == MAX );
         /* paranoid */ verify( mock_head(this)  == this.prev );
 }