/**
* It convert a keyDataEntry to byte[].
*
* @param entry specify the data entry. Input parameter.
* @return return a byte array with size equal to the size of (key,data).
* @exception KeyNotMatchException entry.key is neither StringKey nor IntegerKey
* @exception NodeNotMatchException entry.data is neither LeafData nor IndexData
* @exception ConvertException error from the lower layer
*/
protected static final byte[] getBytesFromEntry(KeyDataEntry entry)
throws KeyNotMatchException, NodeNotMatchException, ConvertException {
byte[] data;
int n, m;
try {
n = getKeyLength(entry.key);
m = n;
if (entry.data instanceof IndexData) n += 4;
else if (entry.data instanceof LeafData) n += 8;
data = new byte[n];
if (entry.key instanceof IntegerKey) {
Convert.setIntValue(((IntegerKey) entry.key).getKey().intValue(), 0, data);
} else if (entry.key instanceof StringKey) {
Convert.setStrValue(((StringKey) entry.key).getKey(), 0, data);
} else throw new KeyNotMatchException(null, "key types do not match");
if (entry.data instanceof IndexData) {
Convert.setIntValue(((IndexData) entry.data).getData().pid, m, data);
} else if (entry.data instanceof LeafData) {
Convert.setIntValue(((LeafData) entry.data).getData().slotNo, m, data);
Convert.setIntValue(((LeafData) entry.data).getData().pageNo.pid, m + 4, data);
} else throw new NodeNotMatchException(null, "node types do not match");
return data;
} catch (IOException e) {
throw new ConvertException(e, "convert failed");
}
}
/**
* It gets an keyDataEntry from bytes array and position
*
* @param from It's a bytes array where KeyDataEntry will come from. Input parameter.
* @param offset the offset in the bytes. Input parameter.
* @param keyType It specifies the type of key. It can be AttrType.attrString or
* AttrType.attrInteger. Input parameter.
* @param nodeType It specifes NodeType.LEAF or NodeType.INDEX. Input parameter.
* @param length The length of (key, data) in byte array "from". Input parameter.
* @return return a KeyDataEntry object
* @exception KeyNotMatchException key is neither StringKey nor IntegerKey
* @exception NodeNotMatchException nodeType is neither NodeType.LEAF nor NodeType.INDEX.
* @exception ConvertException error from the lower layer
*/
protected static final KeyDataEntry getEntryFromBytes(
byte[] from, int offset, int length, int keyType, short nodeType)
throws KeyNotMatchException, NodeNotMatchException, ConvertException {
KeyClass key;
DataClass data;
int n;
try {
if (nodeType == NodeType.INDEX) {
n = 4;
data = new IndexData(Convert.getIntValue(offset + length - 4, from));
} else if (nodeType == NodeType.LEAF) {
n = 8;
TID genid = new TID();
genid.slotNo = Convert.getIntValue(offset + length - 8, from);
genid.pageNo = new PageID();
genid.pageNo.pid = Convert.getIntValue(offset + length - 4, from);
data = new LeafData(genid);
} else throw new NodeNotMatchException(null, "node types do not match");
if (keyType == AttrType.attrInteger) {
key = new IntegerKey(new Integer(Convert.getIntValue(offset, from)));
} else if (keyType == AttrType.attrString) {
// System.out.println(" offset "+ offset + " " + length + " "+n);
key = new StringKey(Convert.getStrValue(offset, from, length - n));
} else throw new KeyNotMatchException(null, "key types do not match");
return new KeyDataEntry(key, data);
} catch (IOException e) {
throw new ConvertException(e, "convert faile");
}
}
/**
* overrides the test3 function in TestDriver. It exercises some of the internal of the buffer
* manager
*
* @return whether test3 has passed
*/
protected boolean test3() {
System.out.print("\n Test 3 exercises some of the internals " + "of the buffer manager\n");
int index;
int numPages = NUMBUF + 10;
Page pg = new Page();
PageId pid = new PageId();
PageId[] pids = new PageId[numPages];
boolean status = OK;
System.out.print(
" - Allocate and dirty some new pages, one at " + "a time, and leave some pinned\n");
for (index = 0; status == OK && index < numPages; ++index) {
try {
pid = SystemDefs.JavabaseBM.newPage(pg, 1);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not allocate new page number " + index + 1 + "\n");
e.printStackTrace();
}
if (status == OK) pids[index] = pid;
if (status == OK) {
// Copy the page number + 99999 onto each page. It seems
// unlikely that this bit pattern would show up there by
// coincidence.
int data = pid.pid + 99999;
try {
Convert.setIntValue(data, 0, pg.getpage());
} catch (IOException e) {
System.err.print("*** Convert value failed\n");
status = FAIL;
e.printStackTrace();
}
// Leave the page pinned if it equals 12 mod 20. This is a
// random number based loosely on a bug report.
if (status == OK) {
if (pid.pid % 20 != 12) {
try {
SystemDefs.JavabaseBM.unpinPage(pid, /*dirty:*/ true);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not unpin dirty page " + pid.pid + "\n");
}
}
}
}
}
if (status == OK) {
System.out.print(" - Read the pages\n");
for (index = 0; status == OK && index < numPages; ++index) {
pid = pids[index];
try {
SystemDefs.JavabaseBM.pinPage(pid, pg, false);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not pin page " + pid.pid + "\n");
e.printStackTrace();
}
if (status == OK) {
int data = 0;
try {
data = Convert.getIntValue(0, pg.getpage());
} catch (IOException e) {
System.err.print("*** Convert value failed \n");
status = FAIL;
}
if (data != pid.pid + 99999) {
status = FAIL;
System.err.print("*** Read wrong data back from page " + pid.pid + "\n");
}
}
if (status == OK) {
try {
SystemDefs.JavabaseBM.unpinPage(pid, true); // might not be dirty
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not unpin page " + pid.pid + "\n");
e.printStackTrace();
}
}
if (status == OK && (pid.pid % 20 == 12)) {
try {
SystemDefs.JavabaseBM.unpinPage(pid, /*dirty:*/ true);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not unpin page " + pid.pid + "\n");
e.printStackTrace();
}
}
}
}
if (status == OK) System.out.print(" Test 3 completed successfully.\n");
return status;
}
/**
* overrides the test4 function in TestDriver
*
* @return whether test4 has passed
*/
protected boolean test4() {
System.out.print("\n Test 4 exercises some of the internals " + "of the buffer manager\n");
int index;
int numPages = NUMBUF + 10;
Page pg = new Page();
PageId pid = new PageId();
PageId[] pids = new PageId[numPages];
boolean status = OK;
System.out.print(" - Allocate bunch of pages together \n");
for (int i = 0; i < numPages / NUMBUF; i++) {
for (index = i * NUMBUF; status == OK && index < (i + 1) * NUMBUF; ++index) {
pg = new Page();
try {
pid = SystemDefs.JavabaseBM.newPage(pg, 1);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not allocate new page number " + index + 1 + "\n");
e.printStackTrace();
}
if (status == OK) {
pids[index] = pid;
}
if (status == OK) {
// Copy the page number + 99999 onto each page. It seems
// unlikely that this bit pattern would show up there by
// coincidence.
int data = pid.pid + 99999;
try {
Convert.setIntValue(data, 0, pg.getpage());
} catch (IOException e) {
System.err.print("*** Convert value failed\n");
status = FAIL;
e.printStackTrace();
}
}
}
for (index = i * NUMBUF; status == OK && index < (i + 1) * NUMBUF; ++index) {
try {
SystemDefs.JavabaseBM.unpinPage(pids[index], true);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not unpin page " + pids[index].pid + "\n");
e.printStackTrace();
}
}
}
if (status == OK) {
System.out.print(" - Read the pages\n");
for (int i = 0; i < numPages / NUMBUF; i++) {
for (index = i * NUMBUF; status == OK && index < (i + 1) * NUMBUF; ++index) {
pg = new Page();
pid = pids[index];
try {
SystemDefs.JavabaseBM.pinPage(pid, pg, false);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not pin page " + pid.pid + "\n");
e.printStackTrace();
}
if (status == OK) {
int data = 0;
try {
data = Convert.getIntValue(0, pg.getpage());
} catch (IOException e) {
System.err.print("*** Convert value failed \n");
status = FAIL;
}
if (data != pid.pid + 99999) {
status = FAIL;
System.err.print("*** Read wrong data back from page " + pid.pid + "\n");
}
}
}
for (index = i * NUMBUF; status == OK && index < (i + 1) * NUMBUF; ++index) {
try {
SystemDefs.JavabaseBM.unpinPage(pids[index], true);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not unpin page " + pids[index].pid + "\n");
e.printStackTrace();
}
}
}
}
if (status == OK) {
System.out.print(" Test 4 completed successfully.\n");
}
return status;
}
/**
* overrides the test1 function in TestDriver. It tests some simple normal buffer manager
* operations.
*
* @return whether test1 has passed
*/
protected boolean test1() {
System.out.print("\n Test 1 does a simple test of normal buffer ");
System.out.print("manager operations:\n");
// We choose this number to ensure that at least one page will have to be
// written during this test.
boolean status = OK;
int numPages = SystemDefs.JavabaseBM.getNumUnpinnedBuffers() + 1;
Page pg = new Page();
PageId pid;
PageId lastPid;
PageId firstPid = new PageId();
System.out.print(" - Allocate a bunch of new pages\n");
try {
firstPid = SystemDefs.JavabaseBM.newPage(pg, numPages);
} catch (Exception e) {
System.err.print("*** Could not allocate " + numPages);
System.err.print(" new pages in the database.\n");
e.printStackTrace();
return false;
}
// Unpin that first page... to simplify our loop.
try {
SystemDefs.JavabaseBM.unpinPage(firstPid, false /*not dirty*/);
} catch (Exception e) {
System.err.print("*** Could not unpin the first new page.\n");
e.printStackTrace();
status = FAIL;
}
System.out.print(" - Write something on each one\n");
pid = new PageId();
lastPid = new PageId();
for (pid.pid = firstPid.pid, lastPid.pid = pid.pid + numPages;
status == OK && pid.pid < lastPid.pid;
pid.pid = pid.pid + 1) {
try {
SystemDefs.JavabaseBM.pinPage(pid, pg, /*emptyPage:*/ true);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not pin new page " + pid.pid + "\n");
e.printStackTrace();
}
if (status == OK) {
// Copy the page number + 99999 onto each page. It seems
// unlikely that this bit pattern would show up there by
// coincidence.
int data = pid.pid + 99999;
try {
Convert.setIntValue(data, 0, pg.getpage());
} catch (IOException e) {
System.err.print("*** Convert value failed\n");
status = FAIL;
}
if (status == OK) {
try {
SystemDefs.JavabaseBM.unpinPage(pid, /*dirty:*/ true);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not unpin dirty page " + pid.pid + "\n");
e.printStackTrace();
}
}
}
}
if (status == OK)
System.out.print(
" - Read that something back from each one\n"
+ " (because we're buffering, this is where "
+ "most of the writes happen)\n");
for (pid.pid = firstPid.pid; status == OK && pid.pid < lastPid.pid; pid.pid = pid.pid + 1) {
try {
SystemDefs.JavabaseBM.pinPage(pid, pg, /*emptyPage:*/ false);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not pin page " + pid.pid + "\n");
e.printStackTrace();
}
if (status == OK) {
int data = 0;
try {
data = Convert.getIntValue(0, pg.getpage());
} catch (IOException e) {
System.err.print("*** Convert value failed \n");
status = FAIL;
}
if (status == OK) {
if (data != (pid.pid) + 99999) {
status = FAIL;
System.err.print("*** Read wrong data back from page " + pid.pid + "\n");
}
}
if (status == OK) {
try {
SystemDefs.JavabaseBM.unpinPage(pid, /*dirty:*/ true);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Could not unpin page " + pid.pid + "\n");
e.printStackTrace();
}
}
}
}
if (status == OK) System.out.print(" - Free the pages again\n");
for (pid.pid = firstPid.pid; pid.pid < lastPid.pid; pid.pid = pid.pid + 1) {
try {
SystemDefs.JavabaseBM.freePage(pid);
} catch (Exception e) {
status = FAIL;
System.err.print("*** Error freeing page " + pid.pid + "\n");
e.printStackTrace();
}
}
if (status == OK) System.out.print(" Test 1 completed successfully.\n");
return status;
}