Changeset 2b0e754 for doc/theses/mike_brooks_MMath/benchmarks/list/driver.c

Timestamp:

Jul 27, 2025, 3:25:11 PM (2 months ago)

Author:

Michael Brooks <mlbrooks@…>

Branches:

master

Children:

5ba1356

Parents:

b9d1242

Message:

Continue disabling harness features, achieving best-case times that match Peter's, on the three tests with new CSVs here.

The fully-disabled harness probably still fools the optimizer because it uses the Buhr-Dice "pass function" trick in place of the disabled observation and iterators array. That these times are now often beating Peter's requires further investigation.

Make STL run with (cpp-sltref) and without (cpp-stlrefAlloGlib) llheap.
Include peter-*.csv from runs on Swift. (Thesis still builds with original numbers from labpc.)
Add data post-processing for sorting and aggregation, leveraging thesis's plots' framework.

Add makefile-saved setups for matching Peter.
Add ability to disable "observation" (use of volatiles) and iterators array (support for remelem).
Add integrated clean-build-run targets for varying the "disable" switches.
Strengthen disable-interleaving mode to avoid the extra loops on remove.

Still to entertain some of this stripping being unnecessary for achieving near Peter-match.
Still to compare costs of the relevant stripped features, and recommend harness variation(s) to for use in thesis.

File:

• doc/theses/mike_brooks_MMath/benchmarks/list/driver.c (modified) (10 diffs)

doc/theses/mike_brooks_MMath/benchmarks/list/driver.c

@@ -4 +4 @@
 #include <string.h>
 
+#ifdef DISABLE_OBSERVATION
+#include "proglang.h"
+#define bobs_init(...)
+#else
 #include "observation.h"
+#endif
 
 #ifdef TINY_USER_ITEMS
@@ -20 +25 @@
 {
     BFX_INTRUSION(B_UserItem)
+//    BFX_LISTED_ELEM_T(B_UserItem) selfListed;
     UDATA_T userdata[ UDATA_LEN ];
 }
@@ -51 +57 @@
 static BFX_LIST_HEAD_T(B_UserItem) lst;
 
+#ifdef DISABLE_OBSERVATION
+MAYBE_EXTERN_C (
+    void bobs_seek(unsigned int i) {}
+    void bobs_moveNext() {}
+    void bobs_movePrev() {}
+    int bobs_hasCurrent() { return 0; }
+    void * bobs_getCurrentLoc() { return NULL; }
+    int bobs_getCurrentVal() { return 0; }
+    // enum bobs_op_movement_t bobs_op_movement = OP_MOVEMENT;
+    // enum bobs_op_polarity_t bobs_op_polarity = OP_POLARITY;
+)
+
+#else
+
 MAYBE_EXTERN_C (
 
@@ -87 +107 @@
     enum bobs_op_polarity_t bobs_op_polarity = OP_POLARITY;
 )
-
+#endif
+
+
+#ifndef DISABLE_OBSERVATION
 
 // Remove progress end (number) is based (upon) remove-number
@@ -101 +124 @@
 )
 
+#endif // ndef DISABLE_OBSERVATION
+
 unsigned int uDefaultPreemption() {
         return 0;
 }
 
+#ifdef DISABLE_ITERS_AR
+// Saves on memory accesses, makes element-oriented removals and observation impossible (instead, they crash)
+static inline BFX_LISTED_ELEM_T(B_UserItem) buhrdice_pass( BFX_LISTED_ELEM_T(B_UserItem) v ) {   // prevent eliding, cheaper than volatile
+    __asm__ __volatile__ ( "" : "+r"(v) );
+    return v ;
+} // pass
+#define ITERS_SAVE(i, insertElemExpr) buhrdice_pass(insertElemExpr)
+#endif
+
 int main(int argc, const char *argv[]) {
+
+  #ifdef DISABLE_OBSERVATION
+    // define the outbound dependencies as locals, for compiling into nops
+    size_t       bobs_ops_completed      = 0;
+    unsigned int bobs_prog_inserting     = 0;
+    unsigned int bobs_prog_removing      = 0;
+    unsigned int bobs_prog_removing_end  = 0;
+    unsigned int bobs_prog_rollover_flag = 0;
+  #endif
 
     const char * usage_args = "[ExperimentDurSec [CheckDonePeriod [NumNodes [ExperimentDurOpCount [Seed [InterleaveFrac]]]]]]";
@@ -227 +270 @@
     memset(ui, 0, (size_t)NumNodes * (size_t)sizeof(B_UserItem));
 
+  #ifndef DISABLE_ITERS_AR
     listedItems = (BFX_LISTED_ELEM_T(B_UserItem)*)malloc( (size_t)NumNodes * (size_t)sizeof(BFX_LISTED_ELEM_T(B_UserItem)) );
     if (!listedItems) {
@@ -233 +277 @@
     }
     memset(listedItems, 0, (size_t)NumNodes * (size_t)sizeof(BFX_LISTED_ELEM_T(B_UserItem)));
+    #define ITERS_SAVE(i, insertElemExpr) listedItems[i] = (insertElemExpr)
+  #endif
 
     // Construct and fill with demo data
@@ -285 +331 @@
         for ( int t = 0; t < CheckDonePeriod; t += 1 ) {
             TRACE('a')              // insert special first
-            listedItems[0] =
-                BOP_INIT(lst, listedItems, 0, ui[INSERTPOS(0)]);
+            ITERS_SAVE( 0,
+                BOP_INIT(lst, listedItems, 0, ui[INSERTPOS(0)]) );
             TRACE('b')              // insert general
             for ( int privateCurInsert = 1;
@@ -293 +339 @@
                 ) {
                 TRACE('-')
-                listedItems[privateCurInsert] =
-                    BOP_INSERT( lst, listedItems, privateCurInsert, ui[INSERTPOS(privateCurInsert)] );
+                ITERS_SAVE( privateCurInsert,
+                    BOP_INSERT( lst, listedItems, privateCurInsert, ui[INSERTPOS(privateCurInsert)] ) );
                 TRACE('+')
             }
+          #ifdef DISABLE_INTERLEAVING
+            // interleaving off, simple removes
+            // (remove logic of 2b01f8eb0956)
+            TRACE('c')
+            for ( int privateCurRemove = 1;
+                  (bobs_prog_removing = privateCurRemove, privateCurRemove < NumNodes);
+                  privateCurRemove += 1
+                ) {
+                TRACE('-')
+                BOP_REMOVE( lst, listedItems, privateCurRemove-1 );
+                TRACE('+')
+            }
+          #else
+            // interleaving on, complex removes
             TRACE('c')              // remove general
             int removeProgress[] = { 0, 0 };
@@ -324 +384 @@
                 }
             }
+          #endif // DISABLE_INTERLEAVING
             TRACE('D')              // remove special last
             BOP_TEARDOWN(lst, listedItems, NumNodes-1);