/*
* Copyright (C) [2004, 2005, 2006], Hyperic, Inc.
* This file is part of SIGAR.
*
* SIGAR is free software; you can redistribute it and/or modify
* it under the terms version 2 of the GNU General Public License as
* published by the Free Software Foundation. This program 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 for more
* details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA.
*/
package org.hyperic.sigar.win32.test;
import java.util.Iterator;
import java.util.Map;
import org.hyperic.sigar.test.SigarTestCase;
import org.hyperic.sigar.win32.Pdh;
public class TestPdh extends SigarTestCase {
public TestPdh(String name) {
super(name);
}
private void getValue(String key) throws Exception {
Pdh pdh = new Pdh();
traceln(key);
assertGtEqZeroTrace("raw",
(long)pdh.getRawValue(key));
assertGtEqZeroTrace("fmt",
(long)pdh.getFormattedValue(key));
}
public void testGetValue() throws Exception {
Pdh.enableTranslation();
final String DL = "\\";
String[][] keys = {
{ "System", "System Up Time" },
{ "Memory", "Available Bytes" },
{ "Memory", "Pages/sec" },
{ "Processor(_Total)", "% User Time" },
};
for (int i=0; i<keys.length; i++) {
String path =
DL + keys[i][0] + DL + keys[i][1];
String trans = Pdh.translate(path);
if (!trans.equals(path)) {
traceln(path + "-->" + trans);
}
traceln(path + " validate: " + Pdh.validate(path));
getValue(path);
}
}
public void testCounterMap() throws Exception {
Map counters = Pdh.getEnglishPerflibCounterMap();
assertGtZeroTrace("counters", counters.size());
int dups = 0;
for (Iterator it=counters.entrySet().iterator(); it.hasNext();) {
Map.Entry entry = (Map.Entry)it.next();
String name = (String)entry.getKey();
int[] ix = (int[])entry.getValue();
if (ix.length > 1) {
dups++;
//traceln(name + " has dups: " + ix.length);
}
}
traceln(dups + " names have dups");
String[] keys = {
"System", "System Up Time"
};
int last = -1;
for (int i=0; i<keys.length; i++) {
String name = keys[i];
int[] ix =
(int[])counters.get(name.toLowerCase());
assertFalse(ix[0] == last);
traceln(name + "=" + ix[0]);
last = ix[0];
String lookupName =
Pdh.getCounterName(ix[0]);
traceln(name + "=" + lookupName);
}
}
public void testValidate() {
Object[][] tests = {
{ "\\Does Not\\Exist", new Integer(Pdh.NO_OBJECT) },
{ "Does Not Exist", new Integer(Pdh.BAD_COUNTERNAME) },
{ "\\System\\DoesNotExist", new Integer(Pdh.NO_COUNTER) },
{ "\\Processor(666)\\% User Time", new Integer(Pdh.NO_INSTANCE) },
{ "\\System\\Threads", new Integer(Pdh.VALID_DATA) },
//slow
//{ "\\\\-\\System\\Threads", new Integer(Pdh.NO_MACHINE) },
};
for (int i=0; i<tests.length; i++) {
String path = (String)tests[i][0];
int expect = ((Integer)tests[i][1]).intValue();
int status = Pdh.validate(path);
boolean expectedResult = (status == expect);
if (!expectedResult) {
traceln("[validate] " + path + "-->" +
Integer.toHexString(status).toUpperCase() +
" != " +
Integer.toHexString(expect).toUpperCase());
}
assertTrue(expectedResult);
}
}
public void testPdh() throws Exception {
String[] iface = Pdh.getKeys("Thread");
assertTrue(iface.length > 0);
}
}