<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>UbixOS V2: src/sys/ubixfsv2/btree.cpp Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.7 -->
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="classes.html"><span>Data Structures</span></a></li>
<li id="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="dirs.html"><span>Directories</span></a></li>
<li>
<form action="search.php" method="get">
<table cellspacing="0" cellpadding="0" border="0">
<tr>
<td><label> <u>S</u>earch for </label></td>
<td><input type="text" name="query" value="" size="20" accesskey="s"/></td>
</tr>
</table>
</form>
</li>
</ul></div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul></div>
<div class="nav">
<a class="el" href="dir_897b6a2d7bab147dd1db58381aad3984.html">src</a> » <a class="el" href="dir_832905b1f7f5feaf61a306b40c0ac817.html">sys</a> » <a class="el" href="dir_21e0927e9dd41d8ff1206ca4f0555726.html">ubixfsv2</a></div>
<h1>btree.cpp</h1><a href="btree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// http://www.cs.msstate.edu/~cs2314/global/BTreeAnimation/algorithm.html</span>
<a name="l00002"></a>00002 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00003"></a>00003 <span class="preprocessor">#include <<a class="code" href="string_8h.html">string.h</a>></span>
<a name="l00004"></a>00004 <span class="preprocessor">#include <stdio.h></span>
<a name="l00005"></a>00005 <span class="preprocessor">#include <unistd.h></span>
<a name="l00006"></a>00006 <span class="preprocessor">#include <iostream></span>
<a name="l00007"></a>00007 <span class="preprocessor">#include <<a class="code" href="assert_8h.html">assert.h</a>></span>
<a name="l00008"></a>00008 <span class="preprocessor">#include "<a class="code" href="btree_8h.html">btree.h</a>"</span>
<a name="l00009"></a>00009 <span class="preprocessor">#include "<a class="code" href="ubixfsv2_2ubixfs_8h.html">ubixfs.h</a>"</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="keyword">using namespace </span>std;
<a name="l00012"></a><a class="code" href="btree_8cpp.html#621fb9a42299fe3892b62a43086d4caf">00012</a> <span class="preprocessor">#define VERIFY(x, y, z, n) if ((x) != (y)) { cout << "verify " << z << " failed" << endl; PrintWholeTree(); }</span>
<a name="l00013"></a>00013 <span class="preprocessor"></span>
<a name="l00014"></a><a class="code" href="classbTree.html#fcb9ea137c7c244e4fc23b95c7e48d48">00014</a> <a class="code" href="classbTree.html#f6969b750661bc6859f3a1a5b60cca90">bTree::bTree</a>(<a class="code" href="classUbixFS.html">UbixFS</a> * filesystem, <a class="code" href="structfileDescriptor.html">fileDescriptor</a> * myfd) {
<a name="l00015"></a>00015 <a class="code" href="include_2ubixos_2types_8h.html#7619b847aeded8a6d14cbfa212b2cdfb">size_t</a> result = 0;
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00018"></a>00018 <a class="code" href="classbTree.html#28b1926c127d65af730a534a3ca1a7a5">tag</a> = 0;
<a name="l00019"></a>00019 <a class="code" href="structfs.html">fs</a> = filesystem;
<a name="l00020"></a>00020 <a class="code" href="classbTree.html#adb550cc0b77f9f3ed14a5f679dbd954">fd</a> = myfd;
<a name="l00021"></a>00021 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a> = <span class="keyword">new</span> <a class="code" href="structbTreeHeader.html">bTreeHeader</a>;
<a name="l00022"></a>00022 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>);
<a name="l00023"></a>00023 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>, 0, <span class="keyword">sizeof</span>(<a class="code" href="structbTreeHeader.html">bTreeHeader</a>));
<a name="l00024"></a>00024 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(<a class="code" href="structfs.html">fs</a>);
<a name="l00025"></a>00025 result = <a class="code" href="structfs.html">fs</a>->vfs_read(<a class="code" href="classbTree.html#adb550cc0b77f9f3ed14a5f679dbd954">fd</a>, <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>, 0, <span class="keyword">sizeof</span>(bTreeHeader));
<a name="l00026"></a>00026 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(result == <span class="keyword">sizeof</span>(bTreeHeader));
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="comment">// If there are any files in this dir, load the first node of the b+tree</span>
<a name="l00029"></a>00029 <span class="keywordflow">if</span> (<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#a9518218d48b68f08aa2406268faf8da">treeLeafCount</a> != 0) {
<a name="l00030"></a>00030 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#fa2951c3806f5b1990da9f4f34d9fc10">firstNodeOffset</a> != 0);
<a name="l00031"></a>00031 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> = <span class="keyword">new</span> <a class="code" href="structbNode.html">bNode</a>;
<a name="l00032"></a>00032 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>);
<a name="l00033"></a>00033 result = <a class="code" href="structfs.html">fs</a>->vfs_read(<a class="code" href="classbTree.html#adb550cc0b77f9f3ed14a5f679dbd954">fd</a>, <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>, <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#fa2951c3806f5b1990da9f4f34d9fc10">firstNodeOffset</a>, <span class="keyword">sizeof</span>(<a class="code" href="structbNode.html">bNode</a>));
<a name="l00034"></a>00034 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(result == <span class="keyword">sizeof</span>(bNode));
<a name="l00035"></a>00035 } <span class="comment">// if </span>
<a name="l00036"></a>00036
<a name="l00037"></a>00037 } <span class="comment">// bTree::bTree</span>
<a name="l00038"></a>00038
<a name="l00039"></a><a class="code" href="classbTree.html#f6969b750661bc6859f3a1a5b60cca90">00039</a> <a class="code" href="classbTree.html#f6969b750661bc6859f3a1a5b60cca90">bTree::bTree</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> * key, <a class="code" href="structubixfsInode.html">ubixfsInode</a> * inode) {
<a name="l00040"></a>00040 <span class="comment">/* once the FS and the bTree are interfaced, this should go away */</span>
<a name="l00041"></a>00041 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00042"></a>00042 <a class="code" href="classbTree.html#28b1926c127d65af730a534a3ca1a7a5">tag</a> = 0;
<a name="l00043"></a>00043 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a> = <span class="keyword">new</span> <a class="code" href="structbTreeHeader.html">bTreeHeader</a>;
<a name="l00044"></a>00044 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>);
<a name="l00045"></a>00045 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>, 0, <span class="keyword">sizeof</span>(<a class="code" href="structbTreeHeader.html">bTreeHeader</a>));
<a name="l00046"></a>00046 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#ca6e142166a274565291bc425b80549f">treeDepth</a> = 1;
<a name="l00047"></a>00047 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#d072fd3a177d2aa12a2ff3ebf1ccbcb7">treeWidth</a> = 0;
<a name="l00048"></a>00048 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#a9518218d48b68f08aa2406268faf8da">treeLeafCount</a> = 0;
<a name="l00049"></a>00049 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#60d3496f588d01ff12f9e74288494f3b">firstDeleted</a> = -1;
<a name="l00050"></a>00050 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#fa2951c3806f5b1990da9f4f34d9fc10">firstNodeOffset</a> = <span class="keyword">sizeof</span>(bTreeHeader);
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keywordflow">if</span> (inode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00053"></a>00053 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> = <a class="code" href="classbTree.html#ee13657d4417aaf2f772663fbbb3687c">allocEmptyNode</a>();
<a name="l00054"></a>00054 <span class="keywordflow">if</span> (<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00055"></a>00055 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used = 1;
<a name="l00056"></a>00056 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->parent.bPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00057"></a>00057 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->leaf = <span class="keyword">true</span>;
<a name="l00058"></a>00058 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->childCount[1] = 1;
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="comment">// cout << "---Creating " << inode->name << "@" << inode << endl;</span>
<a name="l00061"></a>00061 <a class="code" href="lib_2string_8h.html#2a6bedbfab350cd17b80849f5f9234e9">strncpy</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->keys[0], key, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00062"></a>00062 <span class="comment">// insert pointer to data page to the right of the data</span>
<a name="l00063"></a>00063 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->head[1].iPtr = inode;
<a name="l00064"></a>00064 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->tail[1].iPtr = inode;
<a name="l00065"></a>00065
<a name="l00066"></a>00066 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->present[1] = <span class="keyword">true</span>;
<a name="l00067"></a>00067 <span class="keywordflow">if</span> (inode != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00068"></a>00068 inode->next.bPtr = inode->prev.bPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00069"></a>00069 } <span class="comment">// if</span>
<a name="l00070"></a>00070 <span class="keywordflow">return</span>;
<a name="l00071"></a>00071 } <span class="comment">// bTree:bTree</span>
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <span class="keywordtype">bool</span>
<a name="l00074"></a><a class="code" href="classbTree.html#fbaa745c86c8bfaa77d2196a0c1eb85b">00074</a> <a class="code" href="classbTree.html#fbaa745c86c8bfaa77d2196a0c1eb85b">bTree::Insert</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> * key, <a class="code" href="structubixfsInode.html">ubixfsInode</a> * inode) {
<a name="l00075"></a>00075 <a class="code" href="structbNode.html">bNode</a> * bnode = <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>;
<a name="l00076"></a>00076 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * tmpInode = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00077"></a>00077 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> curSlot = 0;
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="keywordflow">if</span> (inode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00080"></a>00080
<a name="l00081"></a>00081 <span class="comment">// note: this code is right out of the constructor</span>
<a name="l00082"></a>00082 <span class="keywordflow">if</span> (<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00083"></a>00083 <span class="keywordflow">if</span> (<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a> == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a> = <span class="keyword">new</span> <a class="code" href="structbTreeHeader.html">bTreeHeader</a>;
<a name="l00084"></a>00084 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>);
<a name="l00085"></a>00085 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>, 0, <span class="keyword">sizeof</span>(<a class="code" href="structbTreeHeader.html">bTreeHeader</a>));
<a name="l00086"></a>00086 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#ca6e142166a274565291bc425b80549f">treeDepth</a> = 1;
<a name="l00087"></a>00087 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#d072fd3a177d2aa12a2ff3ebf1ccbcb7">treeWidth</a> = 0;
<a name="l00088"></a>00088 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#a9518218d48b68f08aa2406268faf8da">treeLeafCount</a> = 0;
<a name="l00089"></a>00089 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#60d3496f588d01ff12f9e74288494f3b">firstDeleted</a> = -1;
<a name="l00090"></a>00090 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#fa2951c3806f5b1990da9f4f34d9fc10">firstNodeOffset</a> = <span class="keyword">sizeof</span>(bTreeHeader);
<a name="l00091"></a>00091
<a name="l00092"></a>00092 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> = <a class="code" href="classbTree.html#ee13657d4417aaf2f772663fbbb3687c">allocEmptyNode</a>();
<a name="l00093"></a>00093 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>);
<a name="l00094"></a>00094 <span class="keywordflow">if</span> (<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00095"></a>00095
<a name="l00096"></a>00096 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used = 1;
<a name="l00097"></a>00097 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->parent.bPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00098"></a>00098 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->leaf = <span class="keyword">true</span>;
<a name="l00099"></a>00099 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->childCount[1] = 1;
<a name="l00100"></a>00100
<a name="l00101"></a>00101 <a class="code" href="lib_2string_8h.html#2a6bedbfab350cd17b80849f5f9234e9">strncpy</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->keys[0], key, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00102"></a>00102 <span class="comment">// insert pointer to data page to the right of the data</span>
<a name="l00103"></a>00103 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->head[1].iPtr = inode;
<a name="l00104"></a>00104 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->tail[1].iPtr = inode;
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->present[1] = <span class="keyword">true</span>;
<a name="l00107"></a>00107 inode->next.iPtr = inode->prev.iPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00108"></a>00108 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00109"></a>00109 } <span class="comment">// if</span>
<a name="l00110"></a>00110
<a name="l00111"></a>00111 tmpInode = <a class="code" href="classbTree.html#3e852a247447d5611a7e5cd7de53ecf9">Find</a>(key);
<a name="l00112"></a>00112 <span class="keywordflow">if</span> (tmpInode != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00113"></a>00113 <span class="comment">// PrintWholeTree();</span>
<a name="l00114"></a>00114 <span class="comment">// cout << "Insert(" << key << ")" << endl;</span>
<a name="l00115"></a>00115 <span class="comment">//Info(bnode);</span>
<a name="l00116"></a>00116 ++<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#a9518218d48b68f08aa2406268faf8da">treeLeafCount</a>;
<a name="l00117"></a>00117 <span class="comment">/*</span>
<a name="l00118"></a>00118 <span class="comment"> * Find the leaf node the inode goes into</span>
<a name="l00119"></a>00119 <span class="comment"> */</span>
<a name="l00120"></a>00120 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(bnode->used);
<a name="l00121"></a>00121 <span class="comment">// cout << "---Inserting " << inode->name << " @ " << inode << endl; </span>
<a name="l00122"></a>00122 <span class="keywordflow">while</span> (bnode != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> && !bnode->leaf) {
<a name="l00123"></a>00123 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[0]) < 0) {
<a name="l00124"></a>00124 bnode = bnode->head[0].bPtr;
<a name="l00125"></a>00125 } <span class="keywordflow">else</span> {
<a name="l00126"></a>00126 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[bnode->used-1]) >= 0) {
<a name="l00127"></a>00127 bnode = bnode->head[bnode->used].bPtr;
<a name="l00128"></a>00128 } <span class="keywordflow">else</span> {
<a name="l00129"></a>00129 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 1; i < bnode->used; i++) {
<a name="l00130"></a>00130 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[i]) < 0) {
<a name="l00131"></a>00131 bnode = bnode->head[i].bPtr;
<a name="l00132"></a>00132 <span class="keywordflow">break</span>;
<a name="l00133"></a>00133 } <span class="comment">// if</span>
<a name="l00134"></a>00134 } <span class="comment">// for i</span>
<a name="l00135"></a>00135 } <span class="comment">// else</span>
<a name="l00136"></a>00136 }
<a name="l00137"></a>00137 } <span class="comment">// while</span>
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <span class="comment">/*</span>
<a name="l00140"></a>00140 <span class="comment"> *</span>
<a name="l00141"></a>00141 <span class="comment"> */</span>
<a name="l00142"></a>00142
<a name="l00143"></a>00143 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(bnode);
<a name="l00144"></a>00144 <span class="keywordflow">if</span> (bnode->leaf != <span class="keyword">true</span>) cout << <span class="stringliteral">"leafnode!=true"</span> << endl;
<a name="l00145"></a>00145 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(inode);
<a name="l00146"></a>00146
<a name="l00147"></a>00147 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[curSlot = 0]) < 0)
<a name="l00148"></a>00148 tmpInode = bnode->head[curSlot].iPtr;
<a name="l00149"></a>00149 <span class="keywordflow">else</span>
<a name="l00150"></a>00150 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[(curSlot = bnode->used)-1]) >= 0)
<a name="l00151"></a>00151 tmpInode = bnode->head[bnode->used].iPtr;
<a name="l00152"></a>00152 <span class="keywordflow">else</span> {
<a name="l00153"></a>00153 <span class="keywordflow">for</span> (curSlot = 1; curSlot < bnode->used; curSlot++) {
<a name="l00154"></a>00154 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[curSlot]) < 0) {
<a name="l00155"></a>00155 tmpInode = bnode->head[curSlot].iPtr;
<a name="l00156"></a>00156 <span class="keywordflow">break</span>;
<a name="l00157"></a>00157 } <span class="comment">// if</span>
<a name="l00158"></a>00158 } <span class="comment">// for curSlot</span>
<a name="l00159"></a>00159 tmpInode = bnode->head[curSlot].iPtr;
<a name="l00160"></a>00160 } <span class="comment">// else</span>
<a name="l00161"></a>00161
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="keywordflow">if</span> (tmpInode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00164"></a>00164 <span class="comment">/*</span>
<a name="l00165"></a>00165 <span class="comment"> * This is the first node in this leaf</span>
<a name="l00166"></a>00166 <span class="comment"> */</span>
<a name="l00167"></a>00167 bnode->head[curSlot].iPtr = bnode->tail[curSlot].iPtr = inode;
<a name="l00168"></a>00168 bnode->present[curSlot] = <span class="keyword">true</span>;
<a name="l00169"></a>00169
<a name="l00170"></a>00170 if (curSlot == 0) {
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="keywordflow">if</span> (bnode->head[1].iPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00173"></a>00173 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * iptr = bnode->head[1].iPtr;
<a name="l00174"></a>00174 inode->prev.iPtr = iptr->prev.iPtr;
<a name="l00175"></a>00175 inode->next.iPtr = iptr;
<a name="l00176"></a>00176 iptr->prev.iPtr = inode;
<a name="l00177"></a>00177 if (inode->prev.iPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)
<a name="l00178"></a>00178 inode->prev.iPtr->next.iPtr = inode;
<a name="l00179"></a>00179 } <span class="keywordflow">else</span> {
<a name="l00180"></a>00180 inode->next.iPtr = inode->prev.iPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00181"></a>00181 } <span class="comment">// else</span>
<a name="l00182"></a>00182
<a name="l00183"></a>00183 } <span class="keywordflow">else</span> {
<a name="l00184"></a>00184 ++bnode->used;
<a name="l00185"></a>00185 } <span class="comment">// else</span>
<a name="l00186"></a>00186
<a name="l00187"></a>00187 } <span class="keywordflow">else</span> {
<a name="l00188"></a>00188 <span class="comment">/*</span>
<a name="l00189"></a>00189 <span class="comment"> * Add node to leaf page. Scan through to find where it goes.</span>
<a name="l00190"></a>00190 <span class="comment"> */</span>
<a name="l00191"></a>00191 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->head[curSlot].iPtr->name) < 0)
<a name="l00192"></a>00192 {
<a name="l00193"></a>00193
<a name="l00194"></a>00194 inode->next.iPtr = bnode->head[curSlot].iPtr;
<a name="l00195"></a>00195 inode->prev.iPtr = inode->next.iPtr->prev.iPtr;
<a name="l00196"></a>00196 inode->next.iPtr->prev.iPtr = inode;
<a name="l00197"></a>00197 if (inode->prev.iPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) inode->prev.iPtr->next.iPtr = inode;
<a name="l00198"></a>00198 bnode->head[curSlot].iPtr = inode;
<a name="l00199"></a>00199
<a name="l00200"></a>00200 } <span class="keywordflow">else</span> {
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->tail[curSlot].iPtr->name) > 0) {
<a name="l00203"></a>00203
<a name="l00204"></a>00204 inode->prev.iPtr = bnode->tail[curSlot].iPtr;
<a name="l00205"></a>00205 inode->next.iPtr = inode->prev.iPtr->next.iPtr;
<a name="l00206"></a>00206 inode->prev.iPtr->next.iPtr = inode;
<a name="l00207"></a>00207
<a name="l00208"></a>00208 if (inode->next.iPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) inode->next.iPtr->prev.iPtr = inode;
<a name="l00209"></a>00209 bnode->tail[curSlot].iPtr = inode;
<a name="l00210"></a>00210
<a name="l00211"></a>00211 } <span class="keywordflow">else</span> {
<a name="l00212"></a>00212
<a name="l00213"></a>00213
<a name="l00214"></a>00214 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * tmpInode = bnode->head[curSlot].iPtr;
<a name="l00215"></a>00215 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < bnode->childCount[curSlot]; i++) {
<a name="l00216"></a>00216 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, tmpInode->name) < 0) {
<a name="l00217"></a>00217 inode->next.iPtr = tmpInode;
<a name="l00218"></a>00218 inode->prev.iPtr = tmpInode->prev.iPtr;
<a name="l00219"></a>00219 inode->next.iPtr->prev.iPtr = inode;
<a name="l00220"></a>00220 inode->prev.iPtr->next.iPtr = inode;
<a name="l00221"></a>00221 <span class="keywordflow">break</span>;
<a name="l00222"></a>00222 } <span class="comment">// if</span>
<a name="l00223"></a>00223 tmpInode = tmpInode->next.iPtr;
<a name="l00224"></a>00224 } <span class="comment">// for i</span>
<a name="l00225"></a>00225
<a name="l00226"></a>00226 } <span class="comment">// else</span>
<a name="l00227"></a>00227
<a name="l00228"></a>00228 } <span class="comment">// else</span>
<a name="l00229"></a>00229
<a name="l00230"></a>00230 } <span class="comment">// else</span>
<a name="l00231"></a>00231
<a name="l00232"></a>00232
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <span class="keywordflow">if</span> (++bnode->childCount[curSlot] == <a class="code" href="btree_8h.html#6612d45a89119eb036b8f2f28c99205c">B_MAX_CHILD_COUNT</a>) {
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="comment">// cout << "---- before split ----" << endl;</span>
<a name="l00237"></a>00237 <span class="comment">// Info(bnode);</span>
<a name="l00238"></a>00238
<a name="l00239"></a>00239 if (curSlot != bnode->used) {
<a name="l00240"></a>00240 <span class="keywordtype">int</span> shift = bnode->used - curSlot +1;
<a name="l00241"></a>00241
<a name="l00242"></a>00242 memmove(&bnode->head[curSlot+1],
<a name="l00243"></a>00243 &bnode->head[curSlot],
<a name="l00244"></a>00244 <span class="keyword">sizeof</span>(bnode->head[0]) * shift);
<a name="l00245"></a>00245 memmove(&bnode->tail[curSlot+1],
<a name="l00246"></a>00246 &bnode->tail[curSlot],
<a name="l00247"></a>00247 <span class="keyword">sizeof</span>(bnode->tail[0]) * shift);
<a name="l00248"></a>00248 memmove(&bnode->present[curSlot+1],
<a name="l00249"></a>00249 &bnode->present[curSlot],
<a name="l00250"></a>00250 <span class="keyword">sizeof</span>(bnode->present[0]) * shift);
<a name="l00251"></a>00251 memmove(&bnode->childCount[curSlot+1],
<a name="l00252"></a>00252 &bnode->childCount[curSlot],
<a name="l00253"></a>00253 <span class="keyword">sizeof</span>(bnode->childCount[0]) * shift);
<a name="l00254"></a>00254
<a name="l00255"></a>00255 memmove(&bnode->keys[curSlot+1],
<a name="l00256"></a>00256 &bnode->keys[curSlot],
<a name="l00257"></a>00257 <span class="keyword">sizeof</span>(bnode->keys[0]) * (shift-1));
<a name="l00258"></a>00258 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(bnode->keys[curSlot], 0, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00259"></a>00259 } <span class="keywordflow">else</span> {
<a name="l00260"></a>00260 bnode->head[curSlot+1] = bnode->head[curSlot];
<a name="l00261"></a>00261 bnode->tail[curSlot+1] = bnode->tail[curSlot];
<a name="l00262"></a>00262 bnode->childCount[curSlot+1] = bnode->childCount[curSlot];
<a name="l00263"></a>00263 bnode->present[curSlot+1] = bnode->present[curSlot];
<a name="l00264"></a>00264 } <span class="comment">// else</span>
<a name="l00265"></a>00265
<a name="l00266"></a>00266 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * tmpInode = bnode->head[curSlot].iPtr;
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < (B_MAX_CHILD_COUNT+1) >> 1; i++) {
<a name="l00269"></a>00269 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(tmpInode);
<a name="l00270"></a>00270 tmpInode = tmpInode->next.iPtr;
<a name="l00271"></a>00271 } <span class="comment">// for i</span>
<a name="l00272"></a>00272
<a name="l00273"></a>00273 <a class="code" href="lib_2string_8h.html#2a6bedbfab350cd17b80849f5f9234e9">strncpy</a>(bnode->keys[curSlot], tmpInode->name, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00274"></a>00274 bnode->head[curSlot+1].iPtr = tmpInode;
<a name="l00275"></a>00275 bnode->tail[curSlot].iPtr = tmpInode->prev.iPtr;
<a name="l00276"></a>00276 bnode->childCount[curSlot] = (<a class="code" href="btree_8h.html#6612d45a89119eb036b8f2f28c99205c">B_MAX_CHILD_COUNT</a>+1) >> 1;
<a name="l00277"></a>00277 bnode->childCount[curSlot+1] -= bnode->childCount[curSlot];
<a name="l00278"></a>00278 bnode->present[curSlot] = <span class="keyword">true</span>;
<a name="l00279"></a>00279 ++header->treeWidth;
<a name="l00280"></a>00280 <span class="keywordflow">if</span> (++bnode->used == <a class="code" href="btree_8h.html#d0a8c9702b88c517fad6d76b2f2e837c">B_MAX_KEYS</a>) splitNode(bnode);
<a name="l00281"></a>00281
<a name="l00282"></a>00282 } <span class="comment">// if leaf is full</span>
<a name="l00283"></a>00283 <span class="comment">// Info(bnode);</span>
<a name="l00284"></a>00284 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00285"></a>00285 } <span class="comment">// bTree::Insert</span>
<a name="l00286"></a>00286
<a name="l00287"></a>00287 <span class="keywordtype">void</span>
<a name="l00288"></a><a class="code" href="classbTree.html#51f94e9190f4c21c66367932b22c10aa">00288</a> <a class="code" href="classbTree.html#51f94e9190f4c21c66367932b22c10aa">bTree::splitNode</a>(<a class="code" href="structbNode.html">bNode</a> * oldNode) {
<a name="l00289"></a>00289 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * tmpInode = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00290"></a>00290 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(oldNode);
<a name="l00291"></a>00291 <span class="keywordflow">if</span> (oldNode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00292"></a>00292 <span class="keywordflow">if</span> (oldNode->used != <a class="code" href="btree_8h.html#d0a8c9702b88c517fad6d76b2f2e837c">B_MAX_KEYS</a>) <span class="keywordflow">return</span>;
<a name="l00293"></a>00293
<a name="l00294"></a>00294 <a class="code" href="structbNode.html">bNode</a> * newNode = <a class="code" href="classbTree.html#ee13657d4417aaf2f772663fbbb3687c">allocEmptyNode</a>();
<a name="l00295"></a>00295 <span class="keywordflow">if</span> (newNode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00296"></a>00296
<a name="l00297"></a>00297 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shift = <a class="code" href="btree_8h.html#d0a8c9702b88c517fad6d76b2f2e837c">B_MAX_KEYS</a> >> 1;
<a name="l00298"></a>00298 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> splitLoc = <a class="code" href="btree_8h.html#d0a8c9702b88c517fad6d76b2f2e837c">B_MAX_KEYS</a> - shift;
<a name="l00299"></a>00299 ++ shift;
<a name="l00300"></a>00300 <span class="comment">// cout << "oldNode before split: " << endl;</span>
<a name="l00301"></a>00301 <span class="comment">// Info(oldNode);</span>
<a name="l00302"></a>00302 <span class="comment">// cout << "splitLoc: " << splitLoc << endl;</span>
<a name="l00303"></a>00303 <span class="comment">// cout << "shift: " << shift << endl;</span>
<a name="l00304"></a>00304
<a name="l00305"></a>00305 newNode->used = oldNode->used = <a class="code" href="btree_8h.html#d0a8c9702b88c517fad6d76b2f2e837c">B_MAX_KEYS</a> >> 1;
<a name="l00306"></a>00306 newNode->parent.bPtr = oldNode->parent.bPtr;
<a name="l00307"></a>00307 newNode->leaf = oldNode->leaf;
<a name="l00308"></a>00308
<a name="l00309"></a>00309 <span class="comment">// cout << "newNode->used: " << newNode->used << endl;</span>
<a name="l00310"></a>00310 <span class="comment">// cout << "oldNode->used: " << oldNode->used << endl;</span>
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <a class="code" href="lib_2string_8h.html#e33b18edb618c656b9b795b9fce2316c">memcpy</a>(&newNode->keys[0],
<a name="l00313"></a>00313 &oldNode->keys[splitLoc],
<a name="l00314"></a>00314 <span class="keyword">sizeof</span>(newNode->keys[0]) * (shift-1));
<a name="l00315"></a>00315
<a name="l00316"></a>00316 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(&oldNode->keys[splitLoc], 0, <span class="keyword">sizeof</span>(newNode->keys[0]) * (shift-1));
<a name="l00317"></a>00317
<a name="l00318"></a>00318 <a class="code" href="lib_2string_8h.html#e33b18edb618c656b9b795b9fce2316c">memcpy</a>(&newNode->present[0],
<a name="l00319"></a>00319 &oldNode->present[splitLoc],
<a name="l00320"></a>00320 <span class="keyword">sizeof</span>(newNode->present[0]) * shift);
<a name="l00321"></a>00321
<a name="l00322"></a>00322 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(&oldNode->present[splitLoc], 0, <span class="keyword">sizeof</span>(newNode->present[0]) * shift);
<a name="l00323"></a>00323
<a name="l00324"></a>00324 <a class="code" href="lib_2string_8h.html#e33b18edb618c656b9b795b9fce2316c">memcpy</a>(&newNode->head[0],
<a name="l00325"></a>00325 &oldNode->head[splitLoc],
<a name="l00326"></a>00326 <span class="keyword">sizeof</span>(newNode->head[0]) * shift);
<a name="l00327"></a>00327
<a name="l00328"></a>00328 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(&oldNode->head[splitLoc], 0,
<a name="l00329"></a>00329 <span class="keyword">sizeof</span>(newNode->head[0]) * shift);
<a name="l00330"></a>00330
<a name="l00331"></a>00331 <a class="code" href="lib_2string_8h.html#e33b18edb618c656b9b795b9fce2316c">memcpy</a>(&newNode->tail[0],
<a name="l00332"></a>00332 &oldNode->tail[splitLoc],
<a name="l00333"></a>00333 <span class="keyword">sizeof</span>(newNode->tail[0]) * shift);
<a name="l00334"></a>00334
<a name="l00335"></a>00335 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(&oldNode->tail[splitLoc], 0,
<a name="l00336"></a>00336 <span class="keyword">sizeof</span>(newNode->tail[0]) * shift);
<a name="l00337"></a>00337
<a name="l00338"></a>00338 <a class="code" href="lib_2string_8h.html#e33b18edb618c656b9b795b9fce2316c">memcpy</a>(&newNode->childCount[0],
<a name="l00339"></a>00339 &oldNode->childCount[splitLoc],
<a name="l00340"></a>00340 <span class="keyword">sizeof</span>(newNode->childCount[0]) * shift);
<a name="l00341"></a>00341
<a name="l00342"></a>00342 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(&oldNode->childCount[splitLoc], 0,
<a name="l00343"></a>00343 <span class="keyword">sizeof</span>(newNode->childCount[0]) * shift);
<a name="l00344"></a>00344
<a name="l00345"></a>00345 <span class="keywordflow">if</span> (!newNode->leaf) {
<a name="l00346"></a>00346 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= newNode->used; i++) {
<a name="l00347"></a>00347 newNode->head[i].bPtr->parent.bPtr = newNode;
<a name="l00348"></a>00348 } <span class="comment">// for i</span>
<a name="l00349"></a>00349 } <span class="comment">// if newNode isn't a leaf</span>
<a name="l00350"></a>00350
<a name="l00351"></a>00351 tmpInode = <a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">GetFirstNode</a>(newNode);
<a name="l00352"></a>00352 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(tmpInode);
<a name="l00353"></a>00353
<a name="l00354"></a>00354 <span class="keywordflow">if</span> (oldNode == <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>) {
<a name="l00355"></a>00355 <span class="comment">// allocate a new root node</span>
<a name="l00356"></a>00356 ++<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#ca6e142166a274565291bc425b80549f">treeDepth</a>;
<a name="l00357"></a>00357 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> = <a class="code" href="classbTree.html#ee13657d4417aaf2f772663fbbb3687c">allocEmptyNode</a>();
<a name="l00358"></a>00358 oldNode->parent.bPtr = <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>;
<a name="l00359"></a>00359 newNode->parent.bPtr = <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>;
<a name="l00360"></a>00360 <span class="comment">// strncpy(root->keys[0], newNode->keys[0], B_MAX_NAME_LENGTH);</span>
<a name="l00361"></a>00361 <a class="code" href="lib_2string_8h.html#2a6bedbfab350cd17b80849f5f9234e9">strncpy</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->keys[0], tmpInode->name, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00362"></a>00362 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->head[0].bPtr = oldNode;
<a name="l00363"></a>00363 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->tail[0].bPtr = <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->tail[1].bPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00364"></a>00364 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->head[1].bPtr = newNode;
<a name="l00365"></a>00365 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used = 1;
<a name="l00366"></a>00366 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->leaf = <span class="keyword">false</span>;
<a name="l00367"></a>00367 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->present[0] = <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->present[1] = <span class="keyword">true</span>;
<a name="l00368"></a>00368 <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->childCount[0] = <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->childCount[1] = 0;
<a name="l00369"></a>00369 <span class="comment">// root->childCount[0] = oldNode->used;</span>
<a name="l00370"></a>00370 <span class="comment">// root->childCount[1] = newNode->used;</span>
<a name="l00371"></a>00371
<a name="l00372"></a>00372 <span class="comment">// cout << "parent" << endl;</span>
<a name="l00373"></a>00373 <span class="comment">// Info(newNode->parent);</span>
<a name="l00374"></a>00374 <span class="comment">// cout << "oldNode" << endl;</span>
<a name="l00375"></a>00375 <span class="comment">// Info(oldNode);</span>
<a name="l00376"></a>00376 <span class="comment">// cout << "-----" << endl;</span>
<a name="l00377"></a>00377 <span class="comment">// cout << "newNode" << endl;</span>
<a name="l00378"></a>00378 <span class="comment">// Info(newNode);</span>
<a name="l00379"></a>00379 <span class="comment">// cout << "-----" << endl;</span>
<a name="l00380"></a>00380
<a name="l00381"></a>00381 } <span class="keywordflow">else</span> {
<a name="l00382"></a>00382 <a class="code" href="classbTree.html#8f732470e0bc0b0a5a0810c944c51122">insertNode</a>(newNode->parent.bPtr, tmpInode->name, newNode);
<a name="l00383"></a>00383 <span class="comment">// if (oldNode->parent->used == B_MAX_KEYS) splitNode(oldNode->parent);</span>
<a name="l00384"></a>00384 } <span class="comment">// else</span>
<a name="l00385"></a>00385 <span class="keywordflow">return</span>;
<a name="l00386"></a>00386 } <span class="comment">// bTree::splitNode</span>
<a name="l00387"></a>00387
<a name="l00388"></a>00388 <span class="keywordtype">void</span>
<a name="l00389"></a><a class="code" href="classbTree.html#8f732470e0bc0b0a5a0810c944c51122">00389</a> <a class="code" href="classbTree.html#8f732470e0bc0b0a5a0810c944c51122">bTree::insertNode</a>(<a class="code" href="structbNode.html">bNode</a> * node, <span class="keyword">const</span> <span class="keywordtype">char</span> * key, <a class="code" href="structbNode.html">bNode</a> * headPtr) {
<a name="l00390"></a>00390 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> curSlot = 0;
<a name="l00391"></a>00391 <span class="keywordflow">if</span> (node == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> || key == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00392"></a>00392
<a name="l00393"></a>00393 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, node->keys[node->used-1]) >= 0){
<a name="l00394"></a>00394 curSlot = node->used;
<a name="l00395"></a>00395 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(node->keys[curSlot], 0, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00396"></a>00396 <a class="code" href="lib_2string_8h.html#2a6bedbfab350cd17b80849f5f9234e9">strncpy</a>(node->keys[curSlot], key, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00397"></a>00397 node->head[curSlot+1].bPtr = headPtr;
<a name="l00398"></a>00398 node->tail[curSlot+1].bPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00399"></a>00399 node->present[curSlot+1] = <span class="keyword">true</span>;
<a name="l00400"></a>00400 node->childCount[node->used] = 0; <span class="comment">// maybe?</span>
<a name="l00401"></a>00401
<a name="l00402"></a>00402 } <span class="keywordflow">else</span> {
<a name="l00403"></a>00403
<a name="l00404"></a>00404 <span class="keywordflow">for</span> (curSlot = 0; curSlot < node->used; curSlot++) {
<a name="l00405"></a>00405 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, node->keys[curSlot]) < 0) <span class="keywordflow">break</span>;
<a name="l00406"></a>00406 } <span class="comment">// for </span>
<a name="l00407"></a>00407
<a name="l00408"></a>00408 <span class="comment">/*</span>
<a name="l00409"></a>00409 <span class="comment"> * note that there is one more item for everything but keys</span>
<a name="l00410"></a>00410 <span class="comment"> * So, make the shift count +1 and just subtract it from the key shift</span>
<a name="l00411"></a>00411 <span class="comment"> * later</span>
<a name="l00412"></a>00412 <span class="comment"> */</span>
<a name="l00413"></a>00413 <span class="keywordtype">int</span> shift = node->used - curSlot +1;
<a name="l00414"></a>00414
<a name="l00415"></a>00415 memmove(&node->head[curSlot+1],
<a name="l00416"></a>00416 &node->head[curSlot],
<a name="l00417"></a>00417 <span class="keyword">sizeof</span>(node->head[0]) * shift);
<a name="l00418"></a>00418 memmove(&node->tail[curSlot+1],
<a name="l00419"></a>00419 &node->tail[curSlot],
<a name="l00420"></a>00420 <span class="keyword">sizeof</span>(node->tail[0]) * shift);
<a name="l00421"></a>00421 memmove(&node->present[curSlot+1],
<a name="l00422"></a>00422 &node->present[curSlot],
<a name="l00423"></a>00423 <span class="keyword">sizeof</span>(node->present[0]) * shift);
<a name="l00424"></a>00424 memmove(&node->childCount[curSlot+1],
<a name="l00425"></a>00425 &node->childCount[curSlot],
<a name="l00426"></a>00426 <span class="keyword">sizeof</span>(node->childCount[0]) * shift);
<a name="l00427"></a>00427
<a name="l00428"></a>00428 memmove(&node->keys[curSlot+1],
<a name="l00429"></a>00429 &node->keys[curSlot],
<a name="l00430"></a>00430 <span class="keyword">sizeof</span>(node->keys[0]) * (shift-1));
<a name="l00431"></a>00431
<a name="l00432"></a>00432 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(node->keys[curSlot], 0, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00433"></a>00433 <a class="code" href="lib_2string_8h.html#2a6bedbfab350cd17b80849f5f9234e9">strncpy</a>(node->keys[curSlot], key, <a class="code" href="btree_8h.html#4d914af1586d2b2c41b4427e9488decf">B_MAX_NAME_LENGTH</a>);
<a name="l00434"></a>00434 node->head[curSlot+1].bPtr = headPtr;
<a name="l00435"></a>00435 node->tail[curSlot+1].bPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00436"></a>00436 node->present[curSlot+1] = <span class="keyword">true</span>;
<a name="l00437"></a>00437 <span class="comment">// node->childCount[node->used] = ?;</span>
<a name="l00438"></a>00438 } <span class="comment">// else </span>
<a name="l00439"></a>00439 <span class="keywordflow">if</span> (++node->used == <a class="code" href="btree_8h.html#d0a8c9702b88c517fad6d76b2f2e837c">B_MAX_KEYS</a>) <a class="code" href="classbTree.html#51f94e9190f4c21c66367932b22c10aa">splitNode</a>(node);
<a name="l00440"></a>00440 <span class="keywordflow">return</span>;
<a name="l00441"></a>00441 } <span class="comment">// bTree::insertNode</span>
<a name="l00442"></a>00442
<a name="l00443"></a>00443 <a class="code" href="structbNode.html">bNode</a> *
<a name="l00444"></a><a class="code" href="classbTree.html#ee13657d4417aaf2f772663fbbb3687c">00444</a> <a class="code" href="classbTree.html#ee13657d4417aaf2f772663fbbb3687c">bTree::allocEmptyNode</a>(<span class="keywordtype">void</span>) {
<a name="l00445"></a>00445 <a class="code" href="structbNode.html">bNode</a> * newNode = <span class="keyword">new</span> <a class="code" href="structbNode.html">bNode</a>;
<a name="l00446"></a>00446
<a name="l00447"></a>00447 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(newNode, 0, <span class="keyword">sizeof</span>(<a class="code" href="structbNode.html">bNode</a>));
<a name="l00448"></a>00448 newNode->magic1 = <a class="code" href="btree_8h.html#6068ceea0c729502fc2c30fb5fe68e75">B_NODE_MAGIC_1</a>;
<a name="l00449"></a>00449 newNode->magic2 = <a class="code" href="btree_8h.html#6d1cceff07f71b93f2b82935353e3846">B_NODE_MAGIC_2</a>;
<a name="l00450"></a>00450 newNode->parent.bPtr = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00451"></a>00451 newNode->tag = ++<a class="code" href="classbTree.html#28b1926c127d65af730a534a3ca1a7a5">tag</a>; <span class="comment">// this will start at 1 (0 is the header node)</span>
<a name="l00452"></a>00452 <span class="keywordflow">return</span> newNode;
<a name="l00453"></a>00453 } <span class="comment">// bTree::allocEmptyNode</span>
<a name="l00454"></a>00454
<a name="l00455"></a>00455 <span class="keywordtype">void</span>
<a name="l00456"></a><a class="code" href="classbTree.html#336aef73ec18ab2abdf76e451f01b983">00456</a> <a class="code" href="classbTree.html#e095e3365ec7b4656efcf0889ff43a6c">bTree::Info</a>(<span class="keyword">const</span> <a class="code" href="structbNode.html">bNode</a> * node) {
<a name="l00457"></a>00457 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * inode = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00458"></a>00458 <span class="keywordflow">if</span> (node == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> || <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00459"></a>00459 cout << node << <span class="stringliteral">" | "</span> << node->parent.bPtr << endl;
<a name="l00460"></a>00460 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= node->used; i++) {
<a name="l00461"></a>00461 inode = node->head[i].iPtr;
<a name="l00462"></a>00462 <span class="comment">// cout << "(" << node->childCount[i] << ")";</span>
<a name="l00463"></a>00463 for (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k = 0; k < node->childCount[i]; k++) {
<a name="l00464"></a>00464 cout << <span class="stringliteral">"["</span> << inode->name << <span class="stringliteral">"]"</span>;
<a name="l00465"></a>00465 inode = inode->next.iPtr;
<a name="l00466"></a>00466 } <span class="comment">// for k</span>
<a name="l00467"></a>00467 <span class="keywordflow">if</span> (i != node->used) cout << <span class="stringliteral">" {"</span> << node->keys[i] << <span class="stringliteral">"} "</span>;
<a name="l00468"></a>00468 } <span class="comment">// for i</span>
<a name="l00469"></a>00469 cout << endl;
<a name="l00470"></a>00470 <span class="keywordflow">return</span>;
<a name="l00471"></a>00471 <span class="preprocessor">#if 0</span>
<a name="l00472"></a>00472 <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < node->used; i++) {
<a name="l00473"></a>00473 cout << <span class="stringliteral">"keys["</span> << i << <span class="stringliteral">"]: "</span> << node->keys[i] << <span class="stringliteral">" "</span>;
<a name="l00474"></a>00474 } <span class="comment">// for i</span>
<a name="l00475"></a>00475 cout << endl;
<a name="l00476"></a>00476 cout << <span class="stringliteral">"node->used: "</span> << node->used << endl;
<a name="l00477"></a>00477 cout << <span class="stringliteral">"leaf: "</span> << node->leaf << endl;
<a name="l00478"></a>00478 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= node->used; i++) {
<a name="l00479"></a>00479 inode = (<a class="code" href="structubixfsInode.html">ubixfsInode</a> *)node->head[i];
<a name="l00480"></a>00480 cout << <span class="stringliteral">"node->childCount["</span><<i<<<span class="stringliteral">"]: "</span> << node->childCount[i] << endl;
<a name="l00481"></a>00481 for (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j = 0; j < node->childCount[i]; j++) {
<a name="l00482"></a>00482 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(inode);
<a name="l00483"></a>00483 cout << <span class="stringliteral">"["</span> << i << <span class="stringliteral">"].["</span> << j << <span class="stringliteral">"]->"</span> << inode->name << endl;
<a name="l00484"></a>00484 inode = inode->next;
<a name="l00485"></a>00485 } <span class="comment">// for j</span>
<a name="l00486"></a>00486 } <span class="comment">// for i</span>
<a name="l00487"></a>00487 <span class="preprocessor">#endif</span>
<a name="l00488"></a>00488 <span class="preprocessor"></span>} <span class="comment">// bTree::Info</span>
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="keywordtype">void</span>
<a name="l00491"></a><a class="code" href="classbTree.html#e095e3365ec7b4656efcf0889ff43a6c">00491</a> <a class="code" href="classbTree.html#e095e3365ec7b4656efcf0889ff43a6c">bTree::Info</a>(<span class="keywordtype">void</span>) {
<a name="l00492"></a>00492 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * inode = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00493"></a>00493
<a name="l00494"></a>00494 cout << <span class="stringliteral">"tree depth: "</span> << <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#ca6e142166a274565291bc425b80549f">treeDepth</a> << endl;
<a name="l00495"></a>00495 cout << <span class="stringliteral">"tree width: "</span> << <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#d072fd3a177d2aa12a2ff3ebf1ccbcb7">treeWidth</a> << endl;
<a name="l00496"></a>00496 cout << <span class="stringliteral">"tree leaf count: "</span> << <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#a9518218d48b68f08aa2406268faf8da">treeLeafCount</a> << endl;
<a name="l00497"></a>00497 cout << <span class="stringliteral">"tag: "</span> << <a class="code" href="classbTree.html#28b1926c127d65af730a534a3ca1a7a5">tag</a> << endl;
<a name="l00498"></a>00498
<a name="l00499"></a>00499 <span class="keywordflow">if</span> (<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a> == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00500"></a>00500
<a name="l00501"></a>00501 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used; i++) {
<a name="l00502"></a>00502 cout << <span class="stringliteral">"CC["</span> << i << <span class="stringliteral">"]: "</span> << <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->childCount[i] << <span class="stringliteral">" "</span>;
<a name="l00503"></a>00503 } <span class="comment">// for i</span>
<a name="l00504"></a>00504
<a name="l00505"></a>00505 cout << endl;
<a name="l00506"></a>00506 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used; i++) {
<a name="l00507"></a>00507 cout << <span class="stringliteral">"CH["</span> << i << <span class="stringliteral">"]: "</span> << <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->head[i].bPtr << <span class="stringliteral">" "</span>;
<a name="l00508"></a>00508 } <span class="comment">// for i</span>
<a name="l00509"></a>00509
<a name="l00510"></a>00510 cout << endl;
<a name="l00511"></a>00511 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <=<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used; i++) {
<a name="l00512"></a>00512 cout << <span class="stringliteral">"CT["</span> << i << <span class="stringliteral">"]: "</span> << <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->tail[i].bPtr << <span class="stringliteral">" "</span>;
<a name="l00513"></a>00513 } <span class="comment">// for i</span>
<a name="l00514"></a>00514 cout << endl;
<a name="l00515"></a>00515 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used; i++) {
<a name="l00516"></a>00516 cout << <span class="stringliteral">"keys["</span> << i << <span class="stringliteral">"]: "</span> << <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->keys[i] << <span class="stringliteral">" "</span>;
<a name="l00517"></a>00517 } <span class="comment">// for i</span>
<a name="l00518"></a>00518 cout << endl;
<a name="l00519"></a>00519
<a name="l00520"></a>00520 cout << <span class="stringliteral">"root->used: "</span> << <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used << endl;
<a name="l00521"></a>00521 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->used; i++) {
<a name="l00522"></a>00522 inode = <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->head[i].iPtr;
<a name="l00523"></a>00523 cout << <span class="stringliteral">"root->childCount["</span><<i<<<span class="stringliteral">"]: "</span> << <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->childCount[i] << endl;
<a name="l00524"></a>00524 if (<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->leaf) {
<a name="l00525"></a>00525 cout << <span class="stringliteral">"root contains leaf node"</span> << endl;
<a name="l00526"></a>00526 for (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j = 0; j < <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>->childCount[i]; j++) {
<a name="l00527"></a>00527 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(inode);
<a name="l00528"></a>00528 cout << <span class="stringliteral">"["</span> << i << <span class="stringliteral">"].["</span> << j << <span class="stringliteral">"]->"</span> << inode->name << endl;
<a name="l00529"></a>00529 inode = inode->next.iPtr;
<a name="l00530"></a>00530 } <span class="comment">// for j</span>
<a name="l00531"></a>00531 } <span class="comment">// if root->leaf</span>
<a name="l00532"></a>00532 } <span class="comment">// for i</span>
<a name="l00533"></a>00533 } <span class="comment">// bTree::Info</span>
<a name="l00534"></a>00534
<a name="l00535"></a>00535 <span class="keywordtype">void</span>
<a name="l00536"></a><a class="code" href="classbTree.html#1c516c3e73c273ded54df841e8271954">00536</a> <a class="code" href="classbTree.html#1c516c3e73c273ded54df841e8271954">bTree::Print</a>(<span class="keywordtype">void</span>) {
<a name="l00537"></a>00537 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * node = <a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">GetFirstNode</a>();
<a name="l00538"></a>00538 <span class="keywordflow">while</span> (node != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00539"></a>00539 cout << node->name << endl;
<a name="l00540"></a>00540 node = node->next.iPtr;
<a name="l00541"></a>00541 }
<a name="l00542"></a>00542 } <span class="comment">// bTree::Print</span>
<a name="l00543"></a>00543
<a name="l00544"></a>00544 <a class="code" href="structubixfsInode.html">ubixfsInode</a> *
<a name="l00545"></a><a class="code" href="classbTree.html#3e852a247447d5611a7e5cd7de53ecf9">00545</a> <a class="code" href="classbTree.html#3e852a247447d5611a7e5cd7de53ecf9">bTree::Find</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> * key) {
<a name="l00546"></a>00546 <span class="comment">/*</span>
<a name="l00547"></a>00547 <span class="comment"> ubixfsInode * tmp = GetFirstNode();</span>
<a name="l00548"></a>00548 <span class="comment"> while (tmp!=NULL) {</span>
<a name="l00549"></a>00549 <span class="comment"> if (strcmp(tmp->name, key) == 0) return tmp;</span>
<a name="l00550"></a>00550 <span class="comment"> tmp = tmp->next.iPtr;</span>
<a name="l00551"></a>00551 <span class="comment"> }</span>
<a name="l00552"></a>00552 <span class="comment"> return NULL;</span>
<a name="l00553"></a>00553 <span class="comment">*/</span>
<a name="l00554"></a>00554 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#dddfb323e06a20e5f57896ad6de6430c">treeSearch</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>, key);
<a name="l00555"></a>00555 } <span class="comment">// bTree::Find</span>
<a name="l00556"></a>00556
<a name="l00557"></a>00557 <a class="code" href="structubixfsInode.html">ubixfsInode</a> *
<a name="l00558"></a><a class="code" href="classbTree.html#033edc7c078c7c90f59610ca8946cebe">00558</a> <a class="code" href="classbTree.html#033edc7c078c7c90f59610ca8946cebe">bTree::inodeSearch</a>(<a class="code" href="structubixfsInode.html">ubixfsInode</a> * inode, <span class="keyword">const</span> <span class="keywordtype">char</span> * key) {
<a name="l00559"></a>00559 <span class="keywordflow">if</span> (inode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> || key == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00560"></a>00560 <span class="keywordtype">int</span> result = <a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(inode->name, key);
<a name="l00561"></a>00561 <span class="keywordflow">if</span> (result == 0) <span class="keywordflow">return</span> inode;
<a name="l00562"></a>00562
<a name="l00563"></a>00563 <span class="keywordflow">if</span> (result < 0) {
<a name="l00564"></a>00564 inode = inode->next.iPtr;
<a name="l00565"></a>00565 <span class="keywordflow">while</span> (inode != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> && ((result = <a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(inode->name, key)) < 0)) {
<a name="l00566"></a>00566 inode = inode->next.iPtr;
<a name="l00567"></a>00567 } <span class="comment">// while</span>
<a name="l00568"></a>00568 } <span class="keywordflow">else</span> {
<a name="l00569"></a>00569 inode = inode->prev.iPtr;
<a name="l00570"></a>00570 <span class="keywordflow">while</span> (inode != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> && ((result = <a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(inode->name, key)) > 0)) {
<a name="l00571"></a>00571 inode = inode->prev.iPtr;
<a name="l00572"></a>00572 } <span class="comment">// while</span>
<a name="l00573"></a>00573 } <span class="comment">// else</span>
<a name="l00574"></a>00574 <span class="keywordflow">return</span> (result == 0 ? inode : <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>);
<a name="l00575"></a>00575 } <span class="comment">// bTree::inodeSearch</span>
<a name="l00576"></a>00576
<a name="l00577"></a>00577 <a class="code" href="structubixfsInode.html">ubixfsInode</a> *
<a name="l00578"></a><a class="code" href="classbTree.html#dddfb323e06a20e5f57896ad6de6430c">00578</a> <a class="code" href="classbTree.html#dddfb323e06a20e5f57896ad6de6430c">bTree::treeSearch</a>(<a class="code" href="structbNode.html">bNode</a> * bnode, <span class="keyword">const</span> <span class="keywordtype">char</span> * key) {
<a name="l00579"></a>00579
<a name="l00580"></a>00580 <span class="keywordflow">if</span> (bnode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> || key == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> || bnode->used == 0) <span class="keywordflow">return</span> <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00581"></a>00581
<a name="l00582"></a>00582 <span class="keywordflow">if</span> (bnode->leaf)
<a name="l00583"></a>00583 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#033edc7c078c7c90f59610ca8946cebe">inodeSearch</a>(<a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">GetFirstNode</a>(bnode), key);
<a name="l00584"></a>00584
<a name="l00585"></a>00585 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[0]) < 0) {
<a name="l00586"></a>00586 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#dddfb323e06a20e5f57896ad6de6430c">treeSearch</a>(bnode->head[0].bPtr, key);
<a name="l00587"></a>00587 } <span class="comment">// if</span>
<a name="l00588"></a>00588
<a name="l00589"></a>00589 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[bnode->used-1]) >= 0) {
<a name="l00590"></a>00590 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#dddfb323e06a20e5f57896ad6de6430c">treeSearch</a>(bnode->head[bnode->used].bPtr, key);
<a name="l00591"></a>00591 } <span class="comment">// if</span>
<a name="l00592"></a>00592
<a name="l00593"></a>00593 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 1; i < bnode->used; i++) {
<a name="l00594"></a>00594 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, bnode->keys[i]) < 0) {
<a name="l00595"></a>00595 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#dddfb323e06a20e5f57896ad6de6430c">treeSearch</a>(bnode->head[i].bPtr, key);
<a name="l00596"></a>00596 } <span class="comment">// if</span>
<a name="l00597"></a>00597 } <span class="comment">// for i</span>
<a name="l00598"></a>00598
<a name="l00599"></a>00599 <span class="keywordflow">return</span> <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00600"></a>00600 } <span class="comment">// bTree::treeSearch</span>
<a name="l00601"></a>00601
<a name="l00602"></a>00602 <a class="code" href="structubixfsInode.html">ubixfsInode</a> *
<a name="l00603"></a><a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">00603</a> <a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">bTree::GetFirstNode</a>(<span class="keywordtype">void</span>) {
<a name="l00604"></a>00604 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">GetFirstNode</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>);
<a name="l00605"></a>00605 } <span class="comment">// bTree::GetFirstNode</span>
<a name="l00606"></a>00606
<a name="l00607"></a>00607 <a class="code" href="structubixfsInode.html">ubixfsInode</a> *
<a name="l00608"></a><a class="code" href="classbTree.html#6150d5508019569eab05f007285437aa">00608</a> <a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">bTree::GetFirstNode</a>(<a class="code" href="structbNode.html">bNode</a> * node) {
<a name="l00609"></a>00609 <a class="code" href="structbNode.html">bNode</a> * tmpNode = node;
<a name="l00610"></a>00610
<a name="l00611"></a>00611 <span class="keywordflow">if</span> (tmpNode == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00612"></a>00612
<a name="l00613"></a>00613 <span class="keywordflow">while</span> (!tmpNode->leaf) {
<a name="l00614"></a>00614 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < tmpNode->used; i++) {
<a name="l00615"></a>00615 <span class="keywordflow">if</span> (tmpNode->head[i].bPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00616"></a>00616 tmpNode = tmpNode->head[i].bPtr;
<a name="l00617"></a>00617 <span class="keywordflow">break</span>;
<a name="l00618"></a>00618 } <span class="comment">// if</span>
<a name="l00619"></a>00619 } <span class="comment">// for i</span>
<a name="l00620"></a>00620 } <span class="comment">// while</span>
<a name="l00621"></a>00621
<a name="l00622"></a>00622 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < tmpNode->used; i++) {
<a name="l00623"></a>00623 <span class="keywordflow">if</span> (tmpNode->head[i].iPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> tmpNode->head[i].iPtr;
<a name="l00624"></a>00624 } <span class="comment">// for i</span>
<a name="l00625"></a>00625 <span class="keywordflow">return</span> <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00626"></a>00626 } <span class="comment">// bTree::GetFirstNode</span>
<a name="l00627"></a>00627
<a name="l00628"></a>00628 <a class="code" href="structbNode.html">bNode</a> *
<a name="l00629"></a><a class="code" href="classbTree.html#757a2be70e2309d4bf0be2eff562a8b9">00629</a> <a class="code" href="classbTree.html#757a2be70e2309d4bf0be2eff562a8b9">bTree::findLeafNode</a>(<a class="code" href="structbNode.html">bNode</a> * node, <span class="keyword">const</span> <span class="keywordtype">char</span> * key) {
<a name="l00630"></a>00630 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(node);
<a name="l00631"></a>00631 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(key);
<a name="l00632"></a>00632 <span class="keywordflow">if</span> (node == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> || key == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00633"></a>00633 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(node->used);
<a name="l00634"></a>00634 <span class="keywordflow">if</span> (node->leaf) <span class="keywordflow">return</span> node;
<a name="l00635"></a>00635
<a name="l00636"></a>00636 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, node->keys[0]) < 0)
<a name="l00637"></a>00637 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#757a2be70e2309d4bf0be2eff562a8b9">findLeafNode</a>(node->head[0].bPtr, key);
<a name="l00638"></a>00638
<a name="l00639"></a>00639 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, node->keys[node->used-1]) >= 0)
<a name="l00640"></a>00640 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#757a2be70e2309d4bf0be2eff562a8b9">findLeafNode</a>(node->head[node->used].bPtr, key);
<a name="l00641"></a>00641
<a name="l00642"></a>00642 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 1; i < node->used; i++) {
<a name="l00643"></a>00643 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(key, node->keys[i]) < 0)
<a name="l00644"></a>00644 <span class="keywordflow">return</span> <a class="code" href="classbTree.html#757a2be70e2309d4bf0be2eff562a8b9">findLeafNode</a>(node->head[i].bPtr, key);
<a name="l00645"></a>00645 } <span class="comment">// for i</span>
<a name="l00646"></a>00646
<a name="l00647"></a>00647 <span class="keywordflow">return</span> <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00648"></a>00648 } <span class="comment">// bTree::findLeafNode</span>
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="keywordtype">void</span>
<a name="l00651"></a><a class="code" href="classbTree.html#9fec062b5b9f54ab6147cba2e92763c2">00651</a> <a class="code" href="classbTree.html#9fec062b5b9f54ab6147cba2e92763c2">bTree::saveNode</a>(FILE * fd, <a class="code" href="structbNode.html">bNode</a> * node, <span class="keywordtype">void</span> * tmpPtr) {
<a name="l00652"></a>00652
<a name="l00653"></a>00653 <a class="code" href="structbNode.html">bNode</a> * ptr = (<a class="code" href="structbNode.html">bNode</a> *)tmpPtr;
<a name="l00654"></a>00654 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(tmpPtr);
<a name="l00655"></a>00655 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(fd);
<a name="l00656"></a>00656 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(node);
<a name="l00657"></a>00657 cout << <span class="stringliteral">"writing tag: "</span> << node->tag << endl;
<a name="l00658"></a>00658
<a name="l00659"></a>00659 <a class="code" href="lib_2string_8h.html#e33b18edb618c656b9b795b9fce2316c">memcpy</a>(tmpPtr, node, <span class="keyword">sizeof</span>(<a class="code" href="structbNode.html">bNode</a>));
<a name="l00660"></a>00660
<a name="l00661"></a>00661 <span class="keywordflow">if</span> (node->parent.bPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)
<a name="l00662"></a>00662 ptr->parent.offset = node->parent.bPtr->tag * <span class="keyword">sizeof</span>(bNode);
<a name="l00663"></a>00663 <span class="keywordflow">else</span>
<a name="l00664"></a>00664 ptr->parent.offset = 0;
<a name="l00665"></a>00665
<a name="l00666"></a>00666 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= node->used; i++) {
<a name="l00667"></a>00667 bNode * bPtr = node->head[i].bPtr;
<a name="l00668"></a>00668
<a name="l00669"></a>00669 if (bPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)
<a name="l00670"></a>00670 ptr->head[i].offset = bPtr->tag * <span class="keyword">sizeof</span>(bNode);
<a name="l00671"></a>00671 <span class="keywordflow">else</span>
<a name="l00672"></a>00672 ptr->head[i].offset = ~0;
<a name="l00673"></a>00673 ptr->present[i] = <span class="keyword">false</span>;
<a name="l00674"></a>00674 } <span class="comment">// for i</span>
<a name="l00675"></a>00675
<a name="l00676"></a>00676 <span class="keywordflow">if</span> (node->leaf) {
<a name="l00677"></a>00677
<a name="l00678"></a>00678 for (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= node->used; i++) {
<a name="l00679"></a>00679 <span class="comment">// ubixfsInode * inode = node->head[i].iPtr;</span>
<a name="l00680"></a>00680 <span class="comment">// mji if (inode != NULL) tmp->head[i] = inode-></span>
<a name="l00681"></a>00681 } <span class="comment">// for i</span>
<a name="l00682"></a>00682 } <span class="keywordflow">else</span> {
<a name="l00683"></a>00683
<a name="l00684"></a>00684 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= node->used; i++) {
<a name="l00685"></a>00685
<a name="l00686"></a>00686 <span class="keywordflow">if</span> (node->head[i].bPtr != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <a class="code" href="classbTree.html#9fec062b5b9f54ab6147cba2e92763c2">saveNode</a>(fd, node->head[i].bPtr, tmpPtr);
<a name="l00687"></a>00687
<a name="l00688"></a>00688 } <span class="comment">// for i</span>
<a name="l00689"></a>00689
<a name="l00690"></a>00690 } <span class="comment">// else</span>
<a name="l00691"></a>00691
<a name="l00692"></a>00692 <span class="keywordflow">return</span>;
<a name="l00693"></a>00693 } <span class="comment">// bTree::saveNode </span>
<a name="l00694"></a>00694
<a name="l00695"></a>00695 <span class="keywordtype">bool</span>
<a name="l00696"></a><a class="code" href="classbTree.html#58a7211e172868c67ee7ed12e8015c4f">00696</a> <a class="code" href="classbTree.html#58a7211e172868c67ee7ed12e8015c4f">bTree::Save</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> * filename) {
<a name="l00697"></a>00697 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * <a class="code" href="unionuPtr.html">uPtr</a> = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00698"></a>00698 <span class="keywordflow">if</span> (filename == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00699"></a>00699 FILE * fd = <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00700"></a>00700 <span class="keywordflow">if</span> ((fd = <a class="code" href="include_2vfs_2file_8h.html#d6a41ac88a7d46d574e8a675fdde136c">fopen</a>(filename, <span class="stringliteral">"wb+"</span>)) == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00701"></a>00701
<a name="l00702"></a>00702 cout << <span class="stringliteral">"tags: "</span> << <a class="code" href="classbTree.html#28b1926c127d65af730a534a3ca1a7a5">tag</a> << endl;
<a name="l00703"></a>00703 lseek(fileno(fd), <a class="code" href="classbTree.html#28b1926c127d65af730a534a3ca1a7a5">tag</a> * <span class="keyword">sizeof</span>(bNode), SEEK_END);
<a name="l00704"></a>00704
<a name="l00705"></a>00705 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#fa2951c3806f5b1990da9f4f34d9fc10">firstNodeOffset</a> = <span class="keyword">sizeof</span>(bNode);
<a name="l00706"></a>00706 <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#60d3496f588d01ff12f9e74288494f3b">firstDeleted</a> = -1;
<a name="l00707"></a>00707 <span class="keywordtype">void</span> * tmpPtr = malloc(<span class="keyword">sizeof</span>(bNode));
<a name="l00708"></a>00708 <a class="code" href="assert_8h.html#d6d5aaa966ca7424f7cb9bd01f2c838b">assert</a>(tmpPtr);
<a name="l00709"></a>00709 uPtr = (<a class="code" href="structubixfsInode.html">ubixfsInode</a> *)tmpPtr;
<a name="l00710"></a>00710 <a class="code" href="lib_2string_8h.html#ce4b911463887af5e748326323e99a23">memset</a>(tmpPtr, 0, <span class="keyword">sizeof</span>(bNode));
<a name="l00711"></a>00711 <a class="code" href="include_2vfs_2file_8h.html#ca6c1e5b57dc9f5d8551b41ea98bfbb7">fwrite</a>(<a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>, <span class="keyword">sizeof</span>(<a class="code" href="structbTreeHeader.html">bTreeHeader</a>), 1, fd);
<a name="l00712"></a>00712 <a class="code" href="classbTree.html#9fec062b5b9f54ab6147cba2e92763c2">saveNode</a>(fd, <a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>, tmpPtr);
<a name="l00713"></a>00713
<a name="l00714"></a>00714 <a class="code" href="include_2vfs_2file_8h.html#872c22366b4c63f4bdb10cd3b7980b11">fclose</a>(fd);
<a name="l00715"></a>00715 free(tmpPtr);
<a name="l00716"></a>00716 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00717"></a>00717 } <span class="comment">// bTree::Save</span>
<a name="l00718"></a>00718
<a name="l00719"></a>00719 <span class="keywordtype">bool</span>
<a name="l00720"></a><a class="code" href="classbTree.html#80f234b61d3d99a44dba29f0754607dc">00720</a> <a class="code" href="classbTree.html#80f234b61d3d99a44dba29f0754607dc">bTree::Load</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> * filename) {
<a name="l00721"></a>00721 <span class="keywordflow">if</span> (filename == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00722"></a>00722 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00723"></a>00723 } <span class="comment">// bTree::Load</span>
<a name="l00724"></a>00724
<a name="l00725"></a>00725 <span class="keywordtype">bool</span>
<a name="l00726"></a><a class="code" href="classbTree.html#ca63b57c49aed1565117d6de1d47036e">00726</a> <a class="code" href="classbTree.html#ca63b57c49aed1565117d6de1d47036e">bTree::Delete</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> * key) {
<a name="l00727"></a>00727
<a name="l00728"></a>00728 <span class="keywordflow">if</span> (key == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00729"></a>00729 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00730"></a>00730 } <span class="comment">// bTree::Delete</span>
<a name="l00731"></a>00731
<a name="l00732"></a>00732 <span class="keywordtype">bool</span>
<a name="l00733"></a><a class="code" href="classbTree.html#73a18a32abfb03fc233f35a237ad094f">00733</a> <a class="code" href="classbTree.html#73a18a32abfb03fc233f35a237ad094f">bTree::Verify</a>(<span class="keywordtype">void</span>) {
<a name="l00734"></a>00734 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * node = <a class="code" href="classbTree.html#8d04e7d1bb555d157f32673af0977244">GetFirstNode</a>();
<a name="l00735"></a>00735 <span class="keywordflow">if</span> (node == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00736"></a>00736
<a name="l00737"></a>00737 <span class="keywordflow">while</span> (node != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00738"></a>00738 <a class="code" href="structubixfsInode.html">ubixfsInode</a> * <a class="code" href="structfileSystem.html#a53ac2dce5c23d729ca2e49907a542de">next</a> = node->next.iPtr;
<a name="l00739"></a>00739 <span class="keywordflow">if</span> (<a class="code" href="structfileSystem.html#a53ac2dce5c23d729ca2e49907a542de">next</a> != <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {
<a name="l00740"></a>00740 <span class="comment">// cout << node->name << "::" << node->next->name << ":::" << strcmp(node->name, node->next->name) << endl;</span>
<a name="l00741"></a>00741 <span class="keywordflow">if</span> (<a class="code" href="lib_2string_8h.html#6f3dcb20ff11ff9db5904c3cfb61a38c">strcmp</a>(node->name, <a class="code" href="structfileSystem.html#a53ac2dce5c23d729ca2e49907a542de">next</a>->name) > 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00742"></a>00742 }
<a name="l00743"></a>00743 node = <a class="code" href="structfileSystem.html#a53ac2dce5c23d729ca2e49907a542de">next</a>;
<a name="l00744"></a>00744 } <span class="comment">// while</span>
<a name="l00745"></a>00745 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00746"></a>00746 } <span class="comment">// bTree::Verify</span>
<a name="l00747"></a>00747
<a name="l00748"></a>00748 <span class="keywordtype">void</span>
<a name="l00749"></a><a class="code" href="classbTree.html#af1aa66ce8e4d6b6ae3a50b66bc4b3e5">00749</a> <a class="code" href="classbTree.html#1c516c3e73c273ded54df841e8271954">bTree::Print</a>(bNode * node) {
<a name="l00750"></a>00750 <span class="keywordflow">if</span> (node == <a class="code" href="def_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) <span class="keywordflow">return</span>;
<a name="l00751"></a>00751 <a class="code" href="classbTree.html#e095e3365ec7b4656efcf0889ff43a6c">Info</a>(node);
<a name="l00752"></a>00752 <span class="keywordflow">if</span> (!node->leaf)
<a name="l00753"></a>00753 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i <= node->used; i++) {
<a name="l00754"></a>00754 <a class="code" href="classbTree.html#1c516c3e73c273ded54df841e8271954">Print</a>(node->head[i].bPtr);
<a name="l00755"></a>00755 } <span class="comment">// for i</span>
<a name="l00756"></a>00756 } <span class="comment">// bTree::Print</span>
<a name="l00757"></a>00757
<a name="l00758"></a>00758 <span class="keywordtype">void</span>
<a name="l00759"></a><a class="code" href="classbTree.html#167dc542695e9e90d741dedb07a8fee4">00759</a> <a class="code" href="classbTree.html#167dc542695e9e90d741dedb07a8fee4">bTree::PrintWholeTree</a>(<span class="keywordtype">void</span>) {
<a name="l00760"></a>00760 <a class="code" href="classbTree.html#1c516c3e73c273ded54df841e8271954">Print</a>(<a class="code" href="classbTree.html#136e55de9f7c2144aaa86729413bb0c6">root</a>);
<a name="l00761"></a>00761 } <span class="comment">// bTree::PrintWholeTree;</span>
<a name="l00762"></a>00762
<a name="l00763"></a><a class="code" href="classbTree.html#2daef081948bc350347520ca9781cc1b">00763</a> <a class="code" href="classbTree.html#2daef081948bc350347520ca9781cc1b">bTree::~bTree</a>(<span class="keywordtype">void</span>) {
<a name="l00764"></a>00764 cout << <span class="stringliteral">"tree depth: "</span> << <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#ca6e142166a274565291bc425b80549f">treeDepth</a> << endl;
<a name="l00765"></a>00765 cout << <span class="stringliteral">"tree width: "</span> << <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#d072fd3a177d2aa12a2ff3ebf1ccbcb7">treeWidth</a> << endl;
<a name="l00766"></a>00766 cout << <span class="stringliteral">"tree leaf count: "</span> << <a class="code" href="classbTree.html#8bef0f48cc7ace024ca327ce774185c8">header</a>-><a class="code" href="structbTreeHeader.html#a9518218d48b68f08aa2406268faf8da">treeLeafCount</a> << endl;
<a name="l00767"></a>00767 } <span class="comment">// bTree::~bTree</span>
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Tue Dec 5 23:34:58 2006 for UbixOS V2 by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>
