--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/jdk/test/java/rmi/reliability/benchmark/bench/serial/GetPutFieldTrees.java Sat Dec 01 00:00:00 2007 +0000
@@ -0,0 +1,157 @@
+/*
+ * Copyright 1999 Sun Microsystems, Inc. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/*
+ *
+ */
+
+package bench.serial;
+
+import bench.Benchmark;
+import java.io.IOException;
+import java.io.ObjectInputStream;
+import java.io.ObjectOutputStream;
+import java.io.Serializable;
+
+/**
+ * Benchmark for testing speed of writes and reads of an object tree, where
+ * nodes contain explicit writeObject() and readObject() methods which use the
+ * GetField()/PutField() API.
+ */
+public class GetPutFieldTrees implements Benchmark {
+
+ static class Node implements Serializable {
+ boolean z;
+ byte b;
+ char c;
+ short s;
+ int i;
+ float f;
+ long j;
+ double d;
+ String str = "bodega";
+ Object parent, left, right;
+
+ Node(Object parent, int depth) {
+ this.parent = parent;
+ if (depth > 0) {
+ left = new Node(this, depth - 1);
+ right = new Node(this, depth - 1);
+ }
+ }
+
+ private void writeObject(ObjectOutputStream out) throws IOException {
+ ObjectOutputStream.PutField fields = out.putFields();
+ fields.put("z", z);
+ fields.put("b", b);
+ fields.put("c", c);
+ fields.put("s", s);
+ fields.put("i", i);
+ fields.put("f", f);
+ fields.put("j", j);
+ fields.put("d", d);
+ fields.put("str", str);
+ fields.put("parent", parent);
+ fields.put("left", left);
+ fields.put("right", right);
+ out.writeFields();
+ }
+
+ private void readObject(ObjectInputStream in)
+ throws IOException, ClassNotFoundException
+ {
+ ObjectInputStream.GetField fields = in.readFields();
+ z = fields.get("z", false);
+ b = fields.get("b", (byte) 0);
+ c = fields.get("c", (char) 0);
+ s = fields.get("s", (short) 0);
+ i = fields.get("i", (int) 0);
+ f = fields.get("f", (float) 0.0);
+ j = fields.get("j", (long) 0);
+ d = fields.get("d", (double) 0.0);
+ str = (String) fields.get("str", null);
+ parent = fields.get("parent", null);
+ left = fields.get("left", null);
+ right = fields.get("right", null);
+ }
+ }
+
+ /**
+ * Write and read a tree of objects from a stream. The benchmark is run in
+ * batches: each "batch" consists of a fixed number of read/write cycles,
+ * and the stream is flushed (and underlying stream buffer cleared) in
+ * between each batch.
+ * Arguments: <tree depth> <# batches> <# cycles per batch>
+ */
+ public long run(String[] args) throws Exception {
+ int depth = Integer.parseInt(args[0]);
+ int nbatches = Integer.parseInt(args[1]);
+ int ncycles = Integer.parseInt(args[2]);
+ Node[] trees = genTrees(depth, ncycles);
+ StreamBuffer sbuf = new StreamBuffer();
+ ObjectOutputStream oout =
+ new ObjectOutputStream(sbuf.getOutputStream());
+ ObjectInputStream oin =
+ new ObjectInputStream(sbuf.getInputStream());
+
+ doReps(oout, oin, sbuf, trees, 1); // warmup
+
+ long start = System.currentTimeMillis();
+ doReps(oout, oin, sbuf, trees, nbatches);
+ return System.currentTimeMillis() - start;
+ }
+
+ /**
+ * Generate object trees.
+ */
+ Node[] genTrees(int depth, int ntrees) {
+ Node[] trees = new Node[ntrees];
+ for (int i = 0; i < ntrees; i++) {
+ trees[i] = new Node(null, depth);
+ }
+ return trees;
+ }
+
+ /**
+ * Run benchmark for given number of batches, with each batch containing
+ * the given number of cycles.
+ */
+ void doReps(ObjectOutputStream oout, ObjectInputStream oin,
+ StreamBuffer sbuf, Node[] trees, int nbatches)
+ throws Exception
+ {
+ int ncycles = trees.length;
+ for (int i = 0; i < nbatches; i++) {
+ sbuf.reset();
+ oout.reset();
+ for (int j = 0; j < ncycles; j++) {
+ oout.writeObject(trees[j]);
+ }
+ oout.flush();
+ for (int j = 0; j < ncycles; j++) {
+ oin.readObject();
+ }
+ }
+ }
+}
+