169N/A/*
2362N/A * Copyright (c) 1999, 2008, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A *
0N/A */
0N/A
0N/Apackage bench.serial;
0N/A
0N/Aimport bench.Benchmark;
0N/Aimport java.io.ObjectInputStream;
0N/Aimport java.io.ObjectOutputStream;
0N/Aimport java.io.Serializable;
0N/A
0N/A/**
0N/A * Benchmark for testing speed of writes and reads of an object tree.
0N/A */
0N/Apublic class ObjTrees implements Benchmark {
169N/A
0N/A static class Node implements Serializable {
0N/A boolean z;
169N/A byte b;
169N/A char c;
169N/A short s;
169N/A int i;
169N/A float f;
169N/A long j;
169N/A double d;
169N/A String str = "bodega";
0N/A Object parent, left, right;
169N/A
0N/A Node(Object parent, int depth) {
0N/A this.parent = parent;
0N/A if (depth > 0) {
0N/A left = new Node(this, depth - 1);
0N/A right = new Node(this, depth - 1);
0N/A }
0N/A }
0N/A }
0N/A
0N/A /**
0N/A * Write and read a tree of objects from a stream. The benchmark is run in
0N/A * batches: each "batch" consists of a fixed number of read/write cycles,
0N/A * and the stream is flushed (and underlying stream buffer cleared) in
0N/A * between each batch.
0N/A * Arguments: <tree depth> <# batches> <# cycles per batch>
0N/A */
0N/A public long run(String[] args) throws Exception {
169N/A int depth = Integer.parseInt(args[0]);
169N/A int nbatches = Integer.parseInt(args[1]);
169N/A int ncycles = Integer.parseInt(args[2]);
169N/A Node[] trees = genTrees(depth, ncycles);
169N/A StreamBuffer sbuf = new StreamBuffer();
169N/A ObjectOutputStream oout =
169N/A new ObjectOutputStream(sbuf.getOutputStream());
169N/A ObjectInputStream oin =
169N/A new ObjectInputStream(sbuf.getInputStream());
0N/A
169N/A doReps(oout, oin, sbuf, trees, 1); // warmup
169N/A
169N/A long start = System.currentTimeMillis();
169N/A doReps(oout, oin, sbuf, trees, nbatches);
0N/A return System.currentTimeMillis() - start;
0N/A }
0N/A
0N/A /**
0N/A * Generate object trees.
0N/A */
0N/A Node[] genTrees(int depth, int ntrees) {
169N/A Node[] trees = new Node[ntrees];
169N/A for (int i = 0; i < ntrees; i++) {
169N/A trees[i] = new Node(null, depth);
169N/A }
169N/A return trees;
0N/A }
0N/A
0N/A /**
169N/A * Run benchmark for given number of batches, with each batch containing
0N/A * the given number of cycles.
0N/A */
0N/A void doReps(ObjectOutputStream oout, ObjectInputStream oin,
169N/A StreamBuffer sbuf, Node[] trees, int nbatches)
169N/A throws Exception
0N/A {
169N/A int ncycles = trees.length;
169N/A for (int i = 0; i < nbatches; i++) {
169N/A sbuf.reset();
169N/A oout.reset();
169N/A for (int j = 0; j < ncycles; j++) {
169N/A oout.writeObject(trees[j]);
169N/A }
169N/A oout.flush();
169N/A for (int j = 0; j < ncycles; j++) {
169N/A oin.readObject();
169N/A }
169N/A }
0N/A }
0N/A}