/*
*
* JBoss, the OpenSource J2EE webOS
*
* Distributable under LGPL license.
* See terms of license at gnu.org.
*/
package org.jboss.cache;
import junit.framework.Test;
import junit.framework.TestCase;
import junit.framework.TestSuite;
import org.jboss.cache.PropertyConfigurator;
import org.jboss.cache.TreeCache;
import org.jboss.cache.transaction.DummyTransactionManager;
import javax.naming.Context;
import javax.naming.InitialContext;
import javax.transaction.UserTransaction;
import java.text.DecimalFormat;
import java.text.FieldPosition;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Properties;
/**
* Local mode performance test for TreeCache.
*
* @version $Revision: 2015 $
* @author <a href="mailto:bwang@jboss.org">Ben Wang</a> May 20 2003
*/
public class ReplicatedAsyncMapPerfTest extends TestCase
{
TreeCache cache_;
int cachingMode_ = TreeCache.LOCAL;
final static Properties p_;
// final static Log log_=LogFactory.getLog(LocalPerfAopTest.class);
String oldFactory_ = null;
final String FACTORY = "org.jboss.cache.transaction.DummyContextFactory";
DummyTransactionManager tm_;
Map map_ = new HashMap();
// final int SIZE = 100;
// final String FQN = "/regular/test";
// final String KEY = Integer.toString((SIZE/2));
ArrayList nodeList_;
static final int depth_ = 3;
static final int children_ = 4;
static final int mapValueSize_ = 100;
static final String seed1_ = "This is a test. ";
static final String seed2_ = "THAT is a TEST. ";
StringBuffer originalStrBuf_;
StringBuffer newStrBuf_;
static
{
p_ = new Properties();
p_.put(Context.INITIAL_CONTEXT_FACTORY, "org.jboss.cache.transaction.DummyContextFactory");
}
public ReplicatedAsyncMapPerfTest(String name)
{
super(name);
}
public void setUp() throws Exception
{
super.setUp();
oldFactory_ = System.getProperty(Context.INITIAL_CONTEXT_FACTORY);
System.setProperty(Context.INITIAL_CONTEXT_FACTORY, FACTORY);
DummyTransactionManager.getInstance();
initCaches(TreeCache.LOCAL);
tm_ = new DummyTransactionManager();
originalStrBuf_ = new StringBuffer();
newStrBuf_ = new StringBuffer();
generateString();
log("ReplicatedasyncMapPerfAopTest: cacheMode=replAsync");
populateMap();
nodeList_ = nodeGen(depth_, children_);
}
private void generateString()
{
while (originalStrBuf_.length() < mapValueSize_) {
originalStrBuf_.append(seed1_);
newStrBuf_.append(seed2_);
}
}
private void populateMap()
{
int depth = depth_;
int children = children_;
int total = 0;
while (depth > 0) {
for (int i = 0; i < total; i++) {
for (int j = 0; j < children; j++) {
total++;
}
}
depth--;
}
for (int i = 0; i < total; i++) {
String key = Integer.toString(i);
String value = originalStrBuf_.toString();
map_.put(key, value);
}
}
public void tearDown() throws Exception
{
super.tearDown();
DummyTransactionManager.destroy();
destroyCaches();
if (oldFactory_ != null) {
System.setProperty(Context.INITIAL_CONTEXT_FACTORY, oldFactory_);
oldFactory_ = null;
}
map_.clear();
}
void initCaches(int caching_mode) throws Exception
{
cachingMode_ = caching_mode;
cache_ = new TreeCache();
PropertyConfigurator config = new PropertyConfigurator();
config.configure(cache_, "META-INF/replAsync-service.xml"); // read in generic replAsync xml
cache_.setTransactionManagerLookupClass("org.jboss.cache.DummyTransactionManagerLookup");
cache_.startService();
}
void destroyCaches() throws Exception
{
cache_.stopService();
cache_ = null;
}
public void testAll() throws Exception
{
try {
Thread.sleep(5000);
} catch (Exception ex) {
}
log("=== Transaction ===");
// Formating
DecimalFormat form = new DecimalFormat("#.00");
FieldPosition fieldPos = new FieldPosition(0);
StringBuffer dumbStr = new StringBuffer();
boolean hasTx = false;
// Step 1. Add entries to the cache
long time1 = System.currentTimeMillis();
int nOps = _put(hasTx);
long time2 = System.currentTimeMillis();
double d = (double) (time2 - time1) / nOps;
log("Time elapsed for put entry is " + (time2 - time1) + " with " + nOps
+ " operations. Average per ops is: " + form.format(d, dumbStr, fieldPos) +
" msec.");
dumbStr = new StringBuffer();
// Step 2. Query the cache
time1 = System.currentTimeMillis();
nOps = _get(hasTx);
time2 = System.currentTimeMillis();
d = (double) (time2 - time1) / nOps;
log("Time elapsed for get entry is " + (time2 - time1) + " with " + nOps
+ " operations. Average per ops is: " + form.format(d, dumbStr, fieldPos) +
" msec.");
dumbStr = new StringBuffer();
// Step 3. Remove entries from the cache
time1 = System.currentTimeMillis();
nOps = _remove(hasTx);
time2 = System.currentTimeMillis();
d = (double) (time2 - time1) / nOps;
log("Time elapsed for remove entry is " + (time2 - time1) + " with " + nOps
+ " operations. Average per ops is: " + form.format(d, dumbStr, fieldPos) +
" msec.");
}
private int _put(boolean hasTx) throws Exception
{
UserTransaction tx = null;
if (hasTx) {
tx = (UserTransaction) new InitialContext(p_).lookup("UserTransaction");
}
String value = newStrBuf_.toString();
for (int i = 0; i < nodeList_.size(); i++) {
String key = Integer.toString(i);
map_.put(key, value);
if (hasTx) {
tx.begin();
cache_.put((String) nodeList_.get(i), key, map_);
tx.commit();
} else {
cache_.put((String) nodeList_.get(i), key, map_);
}
}
return nodeList_.size();
}
private int _get(boolean hasTx) throws Exception
{
UserTransaction tx = null;
if (hasTx) {
tx = (UserTransaction) new InitialContext(p_).lookup("UserTransaction");
}
for (int i = 0; i < nodeList_.size(); i++) {
String key = Integer.toString(i);
if (hasTx) {
tx.begin();
Map map = (Map) cache_.get((String) nodeList_.get(i), key);
map.get(key);
tx.commit();
} else {
Map map = (Map) cache_.get((String) nodeList_.get(i), key);
map.get(key);
}
}
return nodeList_.size();
}
private int _remove(boolean hasTx) throws Exception
{
UserTransaction tx = null;
if (hasTx) {
tx = (UserTransaction) new InitialContext(p_).lookup("UserTransaction");
}
for (int i = 0; i < nodeList_.size(); i++) {
String key = Integer.toString(i);
if (hasTx) {
tx.begin();
Map map = (Map) cache_.get((String) nodeList_.get(i), key);
map.remove(key);
tx.commit();
} else {
Map map = (Map) cache_.get((String) nodeList_.get(i), key);
map.remove(key);
}
}
return nodeList_.size();
}
/**
* Generate the tree nodes quasi-exponentially. I.e., depth is the level
* of the hierarchy and children is the number of children under each node.
* This strucutre is used to add, get, and remove for each node.
*/
private ArrayList nodeGen(int depth, int children)
{
ArrayList strList = new ArrayList();
ArrayList oldList = new ArrayList();
ArrayList newList = new ArrayList();
oldList.add("/");
newList.add("/");
strList.add("/");
while (depth > 0) {
// Trying to produce node name at this depth.
newList = new ArrayList();
for (int i = 0; i < oldList.size(); i++) {
for (int j = 0; j < children; j++) {
String tmp = (String) oldList.get(i);
tmp += Integer.toString(j);
if (depth != 1) tmp += "/";
newList.add(tmp);
}
}
strList.addAll(newList);
oldList = newList;
depth--;
}
log("Nodes generated: " + strList.size());
return strList;
}
public static Test suite() throws Exception
{
return new TestSuite(ReplicatedAsyncMapPerfTest.class);
}
private void log(String str)
{
// System.out.println(this.getClass().getName() +": " +str);
System.out.println(str);
}
}