Changeset 58fe85a for benchmark/creation

Timestamp:

Jan 7, 2021, 3:27:00 PM (5 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

2b4daf2, 64aeca0

Parents:

3c64c668 (diff), eef8dfb (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' into park_unpark

Location:

benchmark/creation

Files:

• JavaThread.java (modified) (3 diffs)
• cfa_gen.cfa (modified) (2 diffs)
• rust_tokio_thrd.rs (added)

benchmark/creation/JavaThread.java

@@ -1 +1 @@
 public class JavaThread {
         // Simplistic low-quality Marsaglia Shift-XOR pseudo-random number generator.
-        // Bijective   
+        // Bijective
         // Cycle length for non-zero values is 4G-1.
         // 0 is absorbing and should be avoided -- fixed point.
         // The returned value is typically masked to produce a positive value.
-        static volatile int Ticket = 0 ; 
+        static volatile int Ticket = 0 ;
 
         private static int nextRandom (int x) {
-                if (x == 0) { 
+                if (x == 0) {
                         // reseed the PRNG
-                        // Ticket is accessed infrequently and does not constitute a coherence hot-spot. 
-                        // Note that we use a non-atomic racy increment -- the race is rare and benign. 
-                        // If the race is a concern switch to an AtomicInteger.  
-                        // In addition accesses to the RW volatile global "Ticket"  variable are not 
-                        // (readily) predictable at compile-time so the JIT will not be able to elide 
-                        // nextRandom() invocations.  
-                        x = ++Ticket ; 
-                        if (x == 0) x = 1 ; 
+                        // Ticket is accessed infrequently and does not constitute a coherence hot-spot.
+                        // Note that we use a non-atomic racy increment -- the race is rare and benign.
+                        // If the race is a concern switch to an AtomicInteger.
+                        // In addition accesses to the RW volatile global "Ticket"  variable are not
+                        // (readily) predictable at compile-time so the JIT will not be able to elide
+                        // nextRandom() invocations.
+                        x = ++Ticket ;
+                        if (x == 0) x = 1 ;
                 }
                 x ^= x << 6;
                 x ^= x >>> 21;
                 x ^= x << 7;
-                return x ;   
+                return x ;
         }
         static int x = 2;
 
-        static private int times = Integer.parseInt("10000") ;
+        static private long times = Long.parseLong("10000") ;
 
         public static class MyThread extends Thread {
@@ -33 +33 @@
         }
         public static void helper() throws InterruptedException {
-                for(int i = 1; i <= times; i += 1) {
+                for(long i = 1; i <= times; i += 1) {
                         MyThread m = new MyThread();
                         x = nextRandom( x );
@@ -47 +47 @@
         }
         public static void main(String[] args) throws InterruptedException {
-                if ( args.length > 2 ) System.exit( 1 );
-                if ( args.length == 2 ) { times = Integer.parseInt(args[1]); }
+                if ( args.length > 1 ) System.exit( 1 );
+                if ( args.length == 1 ) { times = Long.parseLong(args[0]); }
 
-                for (int i = Integer.parseInt("5"); --i >= 0 ; ) { 
+                for (int i = Integer.parseInt("5"); --i >= 0 ; ) {
                         InnerMain();
                         Thread.sleep(2000);             // 2 seconds

benchmark/creation/cfa_gen.cfa

@@ -1 @@
-#include "bench.h"
+#include "../bench.h"
 
-struct C {
+generator G {
         volatile int restart; // ensure compiler does not optimize away all the code
 };
-void ?{}( C & c ) { c.restart = 0; }
-void main( C & ) {}
+void ?{}( G & g ) { g.restart = 0; }
+void main( G & ) {}
 
 int main( int argc, char * argv[] ) {
@@ -11 +11 @@
         BENCH(
                 for ( times ) {
-                         C c;
+                         G g;
                 },
                 result