chg: UbixFS::vfs_write(): ...

Now checks for which range the data is being written to (direct blocks,
     indirect block, or double indirect blocks), but only writes out properly
     to direct blocks.  If the file is too small, it will extend out the
     file by 32k as needed.
add: UbixFS::vfs_mkdir(): works for all cases except vfs_mkdir("/foo//bar");
     Oh, and it does sub-dirs, too, which is something UbixFS v1 never did. HA!
add: vfs_abstract::vfs_purge()

add: UbixFS::vfs_sync() ...

add: UbixFS::vfs_stop()
chg: calling vfs_stop() will sync the disk before disengaging the FS

sync

chg: made bTreeHeader fit into a block ...

chg: made UbixFS class friend of bTree
chg: made bTree class friend of UbixFS
chg: added flag to root dir inode to indicate it is in fact a directory
chg: added bTree btptr to uPtr union
chg: added void * bPtr to uPtr union

chg: UbixFS::vfs_format() works ...

chg: UbixFS::vfs_init() works

chg: oops, the ramDrive is 100MB, not 512MB

add: ramdrive.h ...

chg: renamed device_t.size to sectors
chg: made #define for size of ramdisk
chg: calculated sectors of ramdisk and stored in the device_t struct

del: inode.h, superblock.h ...

chg: merged inode.h and superblock.h into ubixfs.h
chg: UbixFS::getFreeBlock() now returns a blockRun
chg: UbixFS::get8FreeBlocks() now returns a blockRun
chg: changed vfs_FS::vfs_mknod() parameters
add: UbixFS::getNextAG()
add: UbixFS::mknod()
chg: added a const char * key parameter to bTree::Insert() and bTree::bTree()
     now the key name can be different from the inode file name
add: started code for allocating an inode on disk in UbixFS::mknod()

there we go ordering issues with gcc

add: uPtr union for holding bNode *, ubixfsInode *, off_t, and inodeAddrs ...

chg: Modified head/tail/parent pointers in bNodes to use uPtrs
chg: Modified next/prev/parent pointers in ubixfsInodes to use uPtrs
add: UbixFS::vfs_mknod()
chg: prefixed public methods in UbixFS class with vfs_

chg: modified entries in the btreeheader to be off_t ...

add: bTree::saveNode()
add: bTree::Save() code

chg: fixed up the inode to be exactly 4k ...

chg: modified it to be C friendly?

chg: padded out diskSuperBlock to 512 bytes

chg: added check in bTree::Insert() to see if the root node is null, and if ...

so, allocate a new one.

chg: cleaned up the code. Changed insert test from 250,000 to 3000

chg: fixed bug where a node would split and the child's parent pointer(s) ...

would still point to the original node

chg: sync

chg: tracking down split error

chg: fixed one bug in the insertion of nodes

Helping TCA find the source of the error

chg: ubu is a penis

chg: tracking down tail ptr problem

chg: UBU IS A TARD

chg: oops, now it's at 100,000

chg: lowered test count to 100,000

chg: changed test to 2.5mil entries

chg: changed input test to 1,000,000 inodes

del: removed debugging info ...

chg: insert 100,000 filenames into the b+tree

chg: fixed extra chars after #endif

chg: fixed bug on insert ...

chg: looking for bug in bTree::Find()