ADT
        arm-eh
        ast-experimental
        enum
        forall-pointer-decay
        jacob/cs343-translation
        jenkins-sandbox
        new-ast
        new-ast-unique-expr
        pthread-emulation
        qualifiedEnum
      
      
        
          | Last change
 on this file since 1c40091 was             be53b87, checked in by Peter A. Buhr <pabuhr@…>, 6 years ago | 
        
          | 
update Java benchmarks with multiple mechanisms to trick the JIT
 | 
        
          | 
              
Property                 mode
 set to                 100644 | 
        
          | File size:
            1.5 KB | 
      
      
| Line |  | 
|---|
| 1 | public class JavaThread { | 
|---|
| 2 | // Simplistic low-quality Marsaglia Shift-XOR pseudo-random number generator. | 
|---|
| 3 | // Bijective | 
|---|
| 4 | // Cycle length for non-zero values is 4G-1. | 
|---|
| 5 | // 0 is absorbing and should be avoided -- fixed point. | 
|---|
| 6 | // The returned value is typically masked to produce a positive value. | 
|---|
| 7 | static volatile int Ticket = 0 ; | 
|---|
| 8 |  | 
|---|
| 9 | private static int nextRandom (int x) { | 
|---|
| 10 | if (x == 0) { | 
|---|
| 11 | // reseed the PRNG | 
|---|
| 12 | // Ticket is accessed infrequently and does not constitute a coherence hot-spot. | 
|---|
| 13 | // Note that we use a non-atomic racy increment -- the race is rare and benign. | 
|---|
| 14 | // If the race is a concern switch to an AtomicInteger. | 
|---|
| 15 | // In addition accesses to the RW volatile global "Ticket"  variable are not | 
|---|
| 16 | // (readily) predictable at compile-time so the JIT will not be able to elide | 
|---|
| 17 | // nextRandom() invocations. | 
|---|
| 18 | x = ++Ticket ; | 
|---|
| 19 | if (x == 0) x = 1 ; | 
|---|
| 20 | } | 
|---|
| 21 | x ^= x << 6; | 
|---|
| 22 | x ^= x >>> 21; | 
|---|
| 23 | x ^= x << 7; | 
|---|
| 24 | return x ; | 
|---|
| 25 | } | 
|---|
| 26 | static int x = 2; | 
|---|
| 27 |  | 
|---|
| 28 | static private final int NoOfTimes = Integer.parseInt("1000000") ; | 
|---|
| 29 |  | 
|---|
| 30 | public static void helper() { | 
|---|
| 31 | for(int i = 1; i <= NoOfTimes; i += 1) { | 
|---|
| 32 | Thread.yield(); | 
|---|
| 33 | } | 
|---|
| 34 | } | 
|---|
| 35 | public static void InnerMain() { | 
|---|
| 36 | long start = System.nanoTime(); | 
|---|
| 37 | helper(); | 
|---|
| 38 | long end = System.nanoTime(); | 
|---|
| 39 | System.out.println( (end - start) / NoOfTimes ); | 
|---|
| 40 | } | 
|---|
| 41 | public static void main(String[] args) throws InterruptedException { | 
|---|
| 42 | for (int n = Integer.parseInt("5"); --n >= 0 ; ) { | 
|---|
| 43 | InnerMain(); | 
|---|
| 44 | Thread.sleep(2000);     // 2 seconds | 
|---|
| 45 | x = nextRandom(x); | 
|---|
| 46 | } | 
|---|
| 47 | if ( x == 0 ) System.out.println(x); | 
|---|
| 48 | } | 
|---|
| 49 | } | 
|---|
       
      
  Note:
 See   
TracBrowser
 for help on using the repository browser.