You are viewing a plain text version of this content. The canonical link for it is here.
Posted to oak-commits@jackrabbit.apache.org by re...@apache.org on 2017/10/11 12:32:48 UTC

svn commit: r1811820 - /jackrabbit/oak/trunk/oak-benchmarks/src/main/java/org/apache/jackrabbit/oak/benchmark/RevisionGCTest.java

Author: reschke
Date: Wed Oct 11 12:32:48 2017
New Revision: 1811820

URL: http://svn.apache.org/viewvc?rev=1811820&view=rev
Log:
OAK-6809: Allow RevisionGCTest to operate on "long" paths

adds a system property "RevisionGCTest.PATHDEPTH" setting the number of parent folders (each of which having a 10 character name)

Modified:
    jackrabbit/oak/trunk/oak-benchmarks/src/main/java/org/apache/jackrabbit/oak/benchmark/RevisionGCTest.java

Modified: jackrabbit/oak/trunk/oak-benchmarks/src/main/java/org/apache/jackrabbit/oak/benchmark/RevisionGCTest.java
URL: http://svn.apache.org/viewvc/jackrabbit/oak/trunk/oak-benchmarks/src/main/java/org/apache/jackrabbit/oak/benchmark/RevisionGCTest.java?rev=1811820&r1=1811819&r2=1811820&view=diff
==============================================================================
--- jackrabbit/oak/trunk/oak-benchmarks/src/main/java/org/apache/jackrabbit/oak/benchmark/RevisionGCTest.java (original)
+++ jackrabbit/oak/trunk/oak-benchmarks/src/main/java/org/apache/jackrabbit/oak/benchmark/RevisionGCTest.java Wed Oct 11 12:32:48 2017
@@ -88,8 +88,17 @@ public class RevisionGCTest extends Benc
         Random rand = new Random();
         try {
             System.out.print("Creating garbage ");
+            String longPathName = "0123456789";
+            int depth = Integer.getInteger("RevisionGCTest.PATHDEPTH", 0);
+            Node p = s.getRootNode();
+            while (depth > 0) {
+                depth -= 1;
+                p = p.addNode(longPathName);
+            }
+            s.save();
+            System.out.println("Creating garbage in " + p.getPath() + " (" + p.getPath().length() + " chars)");
             for (int i = 0; i < SCALE; i++) {
-                Node n = s.getRootNode().addNode("node-" + i);
+                Node n = p.addNode("node-" + i);
                 for (int j = 0; j < 1000; j++) {
                     n.addNode("child-" + j, NODE_TYPE);
                 }