an appropriate test to simulate SOR for new pool allocation
authorjjenista <jjenista>
Tue, 21 Sep 2010 21:30:47 +0000 (21:30 +0000)
committerjjenista <jjenista>
Tue, 21 Sep 2010 21:30:47 +0000 (21:30 +0000)
Robust/src/Tests/oooJava/poolalloc/makefile
Robust/src/Tests/oooJava/poolalloc/test.java

index 4f15263096e220ab728a490bd59a2186c7a8a2cd..2e6017d94a9b5d5ece633f0eb4bed8a9851233a0 100644 (file)
@@ -4,8 +4,8 @@ SOURCE_FILES=test.java
 
 BUILDSCRIPT=../../../buildscript
 
 
 BUILDSCRIPT=../../../buildscript
 
-USEOOO= -ooojava 2 2  -ooodebug  
-BSFLAGS= -64bit -mainclass $(PROGRAM) -garbagestats -joptimize -noloop -optimize #-coreprof -coreprof-checkoverflow -debug
+USEOOO= -ooojava 24 2  -ooodebug  
+BSFLAGS= -64bit -mainclass $(PROGRAM) -heapsize-mb 1024 -garbagestats -noloop -nooptimize -coreprof -coreprof-checkoverflow -coreprof -coreprof-eventwords 1024*1024*128 -debug
 DISJOINT= -disjoint -disjoint-k 1 -enable-assertions #-disjoint-desire-determinism
 
 all: ooo
 DISJOINT= -disjoint -disjoint-k 1 -enable-assertions #-disjoint-desire-determinism
 
 all: ooo
index aaf88e140be1b1c2ca9009adb4e304d9742d1acb..390657ec04fdb2d59eb523d926f283c41ff4dcc1 100644 (file)
@@ -12,12 +12,19 @@ public class Test {
     for( int i = 0; i < 200000; ++i ) {
       rblock a {
         Foo f = new Foo();
     for( int i = 0; i < 200000; ++i ) {
       rblock a {
         Foo f = new Foo();
-        f.z = 1;
-        x += f.z;
+        f.z = 0;
+        ++f.z;
       }
       rblock b {
       }
       rblock b {
-        x -= f.z;
+        --f.z;
       }
       }
+      int y = -1;
+      if( i % 2 == 0 ) {
+        rblock c {
+          y = 1;
+        }
+      }
+      x += f.z + y;
     }
 
     System.out.println( x );
     }
 
     System.out.println( x );