<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.16"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>UbixOS: fs/ubixfsv2/btree.cpp Source File</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">UbixOS
 <span id="projectnumber">2.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.16 -->
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('de/d00/btree_8cpp_source.html','../../');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">btree.cpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="../../de/d00/btree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// http://www.cs.msstate.edu/~cs2314/global/BTreeAnimation/algorithm.html</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>  </div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"></span> </div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">#include <stdlib.h></span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">#include <string.h></span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">#include <stdio.h></span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">#include <unistd.h></span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">#include <iostream></span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">#include <assert.h></span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">#include "btree.h"</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">#include "ubixfs.h"</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"></span> </div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">using namespace std;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">#define VERIFY(x, y, z, n) if ((x) != (y)) { cout << "verify " << z << " failed" << endl; PrintWholeTree(); }</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"></span> </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">bTree::bTree(UbixFS * filesystem, fileDescriptor * myfd) {</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> size_t result = 0;</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"></span> </div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> root = NULL;</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> tag = 0;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> fs = filesystem;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> fd = myfd;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> header = new bTreeHeader;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> assert(header);</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> memset(header, 0, sizeof(bTreeHeader));</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> assert(fs);</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> result = fs->vfs_read(fd, header, 0, sizeof(bTreeHeader));</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> assert(result == sizeof(bTreeHeader));</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"></span> </div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> // If there are any files in this dir, load the first node of the b+tree</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> if (header->treeLeafCount != 0) {</span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> assert(header->firstNodeOffset != 0);</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> root = new bNode;</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> assert(root);</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> result = fs->vfs_read(fd, root, header->firstNodeOffset, sizeof(bNode));</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> assert(result == sizeof(bNode));</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> } // if </span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"></span> </div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">} // bTree::bTree</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"></span> </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">bTree::bTree(const char * key, ubixfsInode * inode) {</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// once the FS and the bTree are interfaced, this should go away</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> root = NULL;</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> tag = 0;</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> header = new bTreeHeader;</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> assert(header);</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> memset(header, 0, sizeof(bTreeHeader));</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> header->treeDepth = 1;</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> header->treeWidth = 0;</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> header->treeLeafCount = 0;</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> header->firstDeleted = -1;</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> header->firstNodeOffset = sizeof(bTreeHeader);</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"></span> </div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> if (inode == NULL) return;</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> root = allocEmptyNode();</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> if (root == NULL) return;</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> root->used = 1;</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> root->parent.bPtr = NULL;</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> root->leaf = true;</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> root->childCount[1] = 1;</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"></span> </div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// cout << "---Creating " << inode->name << "@" << inode << endl;</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> strncpy(root->keys[0], key, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> // insert pointer to data page to the right of the data</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> root->head[1].iPtr = inode;</span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> root->tail[1].iPtr = inode;</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"></span> </div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> root->present[1] = true;</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> if (inode != NULL) {</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> inode->next.bPtr = inode->prev.bPtr = NULL;</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> return;</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">} // bTree:bTree</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"></span> </div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">bool</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">bTree::Insert(const char * key, ubixfsInode * inode) {</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> bNode * bnode = root;</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> ubixfsInode * tmpInode = NULL;</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> unsigned int curSlot = 0;</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"></span> </div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> if (inode == NULL) return false;</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> </span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> // note: this code is right out of the constructor</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> if (root == NULL) {</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> if (header == NULL) header = new bTreeHeader;</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> assert(header);</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> memset(header, 0, sizeof(bTreeHeader));</span></div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> header->treeDepth = 1;</span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> header->treeWidth = 0;</span></div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> header->treeLeafCount = 0;</span></div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> header->firstDeleted = -1;</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> header->firstNodeOffset = sizeof(bTreeHeader);</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"></span> </div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> root = allocEmptyNode();</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> assert(root);</span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> if (root == NULL) return false;</span></div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> </span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> root->used = 1;</span></div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> root->parent.bPtr = NULL;</span></div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> root->leaf = true;</span></div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> root->childCount[1] = 1;</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"></span> </div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> strncpy(root->keys[0], key, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> // insert pointer to data page to the right of the data</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> root->head[1].iPtr = inode;</span></div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> root->tail[1].iPtr = inode;</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"></span> </div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> root->present[1] = true;</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> inode->next.iPtr = inode->prev.iPtr = NULL;</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> return true;</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> </span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> tmpInode = Find(key);</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> if (tmpInode != NULL) return false;</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// PrintWholeTree();</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// cout << "Insert(" << key << ")" << endl;</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment">//Info(bnode);</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> ++header->treeLeafCount;</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> //Find the leaf node the inode goes into</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"></span> </div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> assert(bnode->used);</span></div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// cout << "---Inserting " << inode->name << " @ " << inode << endl; </span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> while (bnode != NULL && !bnode->leaf) {</span></div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> if (strcmp(key, bnode->keys[0]) < 0) {</span></div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> bnode = bnode->head[0].bPtr;</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> if (strcmp(key, bnode->keys[bnode->used-1]) >= 0) {</span></div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> bnode = bnode->head[bnode->used].bPtr;</span></div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> for (unsigned int i = 1; i < bnode->used; i++) {</span></div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> if (strcmp(key, bnode->keys[i]) < 0) {</span></div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> bnode = bnode->head[i].bPtr;</span></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> break;</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> }</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> } // while</span></div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"></span> </div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"></span> </div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">assert(bnode);</span></div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment">if (bnode->leaf != true) cout << "leafnode!=true" << endl;</span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">assert(inode);</span></div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"></span> </div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> if (strcmp(key, bnode->keys[curSlot = 0]) < 0)</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> tmpInode = bnode->head[curSlot].iPtr;</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"> else</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"> if (strcmp(key, bnode->keys[(curSlot = bnode->used)-1]) >= 0)</span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"> tmpInode = bnode->head[bnode->used].iPtr;</span></div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"> else {</span></div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> for (curSlot = 1; curSlot < bnode->used; curSlot++) {</span></div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> if (strcmp(key, bnode->keys[curSlot]) < 0) {</span></div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> tmpInode = bnode->head[curSlot].iPtr;</span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> break;</span></div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> } // for curSlot</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> tmpInode = bnode->head[curSlot].iPtr;</span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"></span> </div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"></span> </div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> if (tmpInode == NULL) {</span></div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> // This is the first node in this leaf</span></div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> bnode->head[curSlot].iPtr = bnode->tail[curSlot].iPtr = inode;</span></div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> bnode->present[curSlot] = true;</span></div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"></span> </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> if (curSlot == 0) {</span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"></span> </div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> if (bnode->head[1].iPtr != NULL) {</span></div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> ubixfsInode * iptr = bnode->head[1].iPtr;</span></div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> inode->prev.iPtr = iptr->prev.iPtr;</span></div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> inode->next.iPtr = iptr;</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> iptr->prev.iPtr = inode;</span></div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> if (inode->prev.iPtr != NULL) </span></div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"> inode->prev.iPtr->next.iPtr = inode;</span></div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> inode->next.iPtr = inode->prev.iPtr = NULL;</span></div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"></span> </div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> ++bnode->used; </span></div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"></span> </div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> // Add node to leaf page. Scan through to find where it goes.</span></div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"></span> </div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> if (strcmp(key, bnode->head[curSlot].iPtr->name) < 0)</span></div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> {</span></div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"></span> </div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> inode->next.iPtr = bnode->head[curSlot].iPtr;</span></div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> inode->prev.iPtr = inode->next.iPtr->prev.iPtr;</span></div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> inode->next.iPtr->prev.iPtr = inode;</span></div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> if (inode->prev.iPtr != NULL) inode->prev.iPtr->next.iPtr = inode;</span></div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> bnode->head[curSlot].iPtr = inode;</span></div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"></span> </div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"></span> </div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> if (strcmp(key, bnode->tail[curSlot].iPtr->name) > 0) {</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"></span> </div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> inode->prev.iPtr = bnode->tail[curSlot].iPtr;</span></div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> inode->next.iPtr = inode->prev.iPtr->next.iPtr;</span></div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> inode->prev.iPtr->next.iPtr = inode;</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"></span> </div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> if (inode->next.iPtr != NULL) inode->next.iPtr->prev.iPtr = inode;</span></div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> bnode->tail[curSlot].iPtr = inode;</span></div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"></span> </div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"></span> </div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"></span> </div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> ubixfsInode * tmpInode = bnode->head[curSlot].iPtr;</span></div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> for (unsigned int i = 0; i < bnode->childCount[curSlot]; i++) {</span></div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> if (strcmp(key, tmpInode->name) < 0) {</span></div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> inode->next.iPtr = tmpInode;</span></div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> inode->prev.iPtr = tmpInode->prev.iPtr;</span></div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> inode->next.iPtr->prev.iPtr = inode;</span></div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> inode->prev.iPtr->next.iPtr = inode;</span></div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> break;</span></div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"> tmpInode = tmpInode->next.iPtr; </span></div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"></span> </div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"></span> </div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"></span> </div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"></span> </div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"></span> </div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"></span> </div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> if (++bnode->childCount[curSlot] == B_MAX_CHILD_COUNT) {</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"></span> </div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// cout << "---- before split ----" << endl;</span></div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment">// Info(bnode);</span></div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"></span> </div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"> if (curSlot != bnode->used) {</span></div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> int shift = bnode->used - curSlot +1;</span></div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"></span> </div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> memmove(&bnode->head[curSlot+1],</span></div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"> &bnode->head[curSlot],</span></div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment"> sizeof(bnode->head[0]) * shift);</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"> memmove(&bnode->tail[curSlot+1],</span></div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> &bnode->tail[curSlot],</span></div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment"> sizeof(bnode->tail[0]) * shift);</span></div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"> memmove(&bnode->present[curSlot+1],</span></div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"> &bnode->present[curSlot],</span></div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> sizeof(bnode->present[0]) * shift);</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> memmove(&bnode->childCount[curSlot+1],</span></div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"> &bnode->childCount[curSlot],</span></div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"> sizeof(bnode->childCount[0]) * shift);</span></div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"></span> </div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"> memmove(&bnode->keys[curSlot+1],</span></div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"> &bnode->keys[curSlot],</span></div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> sizeof(bnode->keys[0]) * (shift-1));</span></div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> memset(bnode->keys[curSlot], 0, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> bnode->head[curSlot+1] = bnode->head[curSlot];</span></div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"> bnode->tail[curSlot+1] = bnode->tail[curSlot];</span></div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"> bnode->childCount[curSlot+1] = bnode->childCount[curSlot];</span></div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> bnode->present[curSlot+1] = bnode->present[curSlot];</span></div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"></span> </div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> ubixfsInode * tmpInode = bnode->head[curSlot].iPtr;</span></div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"></span> </div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> for (unsigned int i = 0; i < (B_MAX_CHILD_COUNT+1) >> 1; i++) {</span></div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"> assert(tmpInode);</span></div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"> tmpInode = tmpInode->next.iPtr;</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"></span> </div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> strncpy(bnode->keys[curSlot], tmpInode->name, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"> bnode->head[curSlot+1].iPtr = tmpInode;</span></div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"> bnode->tail[curSlot].iPtr = tmpInode->prev.iPtr;</span></div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> bnode->childCount[curSlot] = (B_MAX_CHILD_COUNT+1) >> 1;</span></div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> bnode->childCount[curSlot+1] -= bnode->childCount[curSlot];</span></div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> bnode->present[curSlot] = true;</span></div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> ++header->treeWidth;</span></div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> if (++bnode->used == B_MAX_KEYS) splitNode(bnode);</span></div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="comment"></span> </div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> } // if leaf is full</span></div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// Info(bnode);</span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> return true;</span></div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment">} // bTree::Insert</span></div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"></span> </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment">void </span></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment">bTree::splitNode(bNode * oldNode) {</span></div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"> ubixfsInode * tmpInode = NULL;</span></div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"> assert(oldNode);</span></div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"> if (oldNode == NULL) return;</span></div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"> if (oldNode->used != B_MAX_KEYS) return;</span></div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="comment"></span> </div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="comment"> bNode * newNode = allocEmptyNode();</span></div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment"> if (newNode == NULL) return;</span></div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment"></span> </div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"> unsigned int shift = B_MAX_KEYS >> 1;</span></div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> unsigned int splitLoc = B_MAX_KEYS - shift;</span></div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> ++ shift;</span></div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// cout << "oldNode before split: " << endl;</span></div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// Info(oldNode);</span></div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="comment">// cout << "splitLoc: " << splitLoc << endl;</span></div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment">// cout << "shift: " << shift << endl;</span></div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"></span> </div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> newNode->used = oldNode->used = B_MAX_KEYS >> 1;</span></div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> newNode->parent.bPtr = oldNode->parent.bPtr;</span></div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"> newNode->leaf = oldNode->leaf;</span></div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"></span> </div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment">// cout << "newNode->used: " << newNode->used << endl;</span></div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment">// cout << "oldNode->used: " << oldNode->used << endl;</span></div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"></span> </div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> memcpy(&newNode->keys[0],</span></div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> &oldNode->keys[splitLoc],</span></div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> sizeof(newNode->keys[0]) * (shift-1));</span></div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> </span></div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> memset(&oldNode->keys[splitLoc], 0, sizeof(newNode->keys[0]) * (shift-1));</span></div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"></span> </div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> memcpy(&newNode->present[0],</span></div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> &oldNode->present[splitLoc],</span></div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> sizeof(newNode->present[0]) * shift);</span></div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"></span> </div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> memset(&oldNode->present[splitLoc], 0, sizeof(newNode->present[0]) * shift);</span></div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"></span> </div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> memcpy(&newNode->head[0],</span></div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"> &oldNode->head[splitLoc],</span></div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment"> sizeof(newNode->head[0]) * shift);</span></div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="comment"></span> </div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment"> memset(&oldNode->head[splitLoc], 0, </span></div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"> sizeof(newNode->head[0]) * shift);</span></div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"></span> </div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> memcpy(&newNode->tail[0],</span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"> &oldNode->tail[splitLoc],</span></div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment"> sizeof(newNode->tail[0]) * shift);</span></div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment"></span> </div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment"> memset(&oldNode->tail[splitLoc], 0, </span></div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment"> sizeof(newNode->tail[0]) * shift);</span></div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"></span> </div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"> memcpy(&newNode->childCount[0],</span></div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="comment"> &oldNode->childCount[splitLoc],</span></div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="comment"> sizeof(newNode->childCount[0]) * shift);</span></div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"></span> </div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"> memset(&oldNode->childCount[splitLoc], 0, </span></div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment"> sizeof(newNode->childCount[0]) * shift);</span></div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"></span> </div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"> if (!newNode->leaf) {</span></div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> for (unsigned int i = 0; i <= newNode->used; i++) {</span></div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> newNode->head[i].bPtr->parent.bPtr = newNode;</span></div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment"> } // if newNode isn't a leaf</span></div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment"></span> </div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment"> tmpInode = GetFirstNode(newNode);</span></div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"> assert(tmpInode);</span></div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment"></span> </div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"> if (oldNode == root) {</span></div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> // allocate a new root node</span></div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> ++header->treeDepth;</span></div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> root = allocEmptyNode();</span></div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment"> oldNode->parent.bPtr = root;</span></div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"> newNode->parent.bPtr = root;</span></div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"> // strncpy(root->keys[0], newNode->keys[0], B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment"> strncpy(root->keys[0], tmpInode->name, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment"> root->head[0].bPtr = oldNode;</span></div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment"> root->tail[0].bPtr = root->tail[1].bPtr = NULL;</span></div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"> root->head[1].bPtr = newNode;</span></div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> root->used = 1;</span></div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"> root->leaf = false;</span></div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> root->present[0] = root->present[1] = true;</span></div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"> root->childCount[0] = root->childCount[1] = 0;</span></div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment">// root->childCount[0] = oldNode->used;</span></div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment">// root->childCount[1] = newNode->used;</span></div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"></span> </div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment">// cout << "parent" << endl;</span></div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment">// Info(newNode->parent);</span></div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// cout << "oldNode" << endl;</span></div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment">// Info(oldNode);</span></div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment">// cout << "-----" << endl;</span></div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment">// cout << "newNode" << endl;</span></div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment">// Info(newNode);</span></div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment">// cout << "-----" << endl;</span></div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"></span> </div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"> insertNode(newNode->parent.bPtr, tmpInode->name, newNode);</span></div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> // if (oldNode->parent->used == B_MAX_KEYS) splitNode(oldNode->parent);</span></div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> return;</span></div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment">} // bTree::splitNode</span></div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"></span> </div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment">void</span></div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment">bTree::insertNode(bNode * node, const char * key, bNode * headPtr) {</span></div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"> unsigned int curSlot = 0;</span></div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> if (node == NULL || key == NULL) return;</span></div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"></span> </div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> if (strcmp(key, node->keys[node->used-1]) >= 0){</span></div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> curSlot = node->used;</span></div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> memset(node->keys[curSlot], 0, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"> strncpy(node->keys[curSlot], key, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"> node->head[curSlot+1].bPtr = headPtr;</span></div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"> node->tail[curSlot+1].bPtr = NULL;</span></div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"> node->present[curSlot+1] = true;</span></div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"> node->childCount[node->used] = 0; // maybe?</span></div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"></span> </div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"></span> </div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> for (curSlot = 0; curSlot < node->used; curSlot++) {</span></div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment"> if (strcmp(key, node->keys[curSlot]) < 0) break;</span></div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"> } // for </span></div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"></span> </div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"></span> </div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> */</span><span class="comment">/*</span></div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> * note that there is one more item for everything but keys</span></div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> * So, make the shift count +1 and just subtract it from the key shift</span></div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment"> * later</span></div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"> */</span><span class="comment">/*</span></div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> int shift = node->used - curSlot +1;</span></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"></span> </div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> memmove(&node->head[curSlot+1],</span></div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"> &node->head[curSlot],</span></div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"> sizeof(node->head[0]) * shift);</span></div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"> memmove(&node->tail[curSlot+1],</span></div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"> &node->tail[curSlot],</span></div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> sizeof(node->tail[0]) * shift);</span></div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> memmove(&node->present[curSlot+1],</span></div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment"> &node->present[curSlot],</span></div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="comment"> sizeof(node->present[0]) * shift);</span></div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment"> memmove(&node->childCount[curSlot+1],</span></div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"> &node->childCount[curSlot],</span></div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"> sizeof(node->childCount[0]) * shift);</span></div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"></span> </div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment"> memmove(&node->keys[curSlot+1],</span></div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"> &node->keys[curSlot],</span></div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> sizeof(node->keys[0]) * (shift-1));</span></div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> </span></div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> memset(node->keys[curSlot], 0, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> strncpy(node->keys[curSlot], key, B_MAX_NAME_LENGTH);</span></div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> node->head[curSlot+1].bPtr = headPtr;</span></div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> node->tail[curSlot+1].bPtr = NULL;</span></div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> node->present[curSlot+1] = true;</span></div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment">// node->childCount[node->used] = ?;</span></div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> } // else </span></div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> if (++node->used == B_MAX_KEYS) splitNode(node); </span></div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> return;</span></div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment">} // bTree::insertNode</span></div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"></span> </div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment">bNode *</span></div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment">bTree::allocEmptyNode(void) {</span></div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> bNode * newNode = new bNode;</span></div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"></span> </div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> memset(newNode, 0, sizeof(bNode));</span></div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> newNode->magic1 = B_NODE_MAGIC_1;</span></div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> newNode->magic2 = B_NODE_MAGIC_2;</span></div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment"> newNode->parent.bPtr = NULL;</span></div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="comment"> newNode->tag = ++tag; // this will start at 1 (0 is the header node)</span></div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment"> return newNode;</span></div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment">} // bTree::allocEmptyNode</span></div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"></span> </div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment">void</span></div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment">bTree::Info(const bNode * node) {</span></div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> ubixfsInode * inode = NULL;</span></div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"> if (node == NULL || root == NULL) return;</span></div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"> cout << node << " | " << node->parent.bPtr << endl;</span></div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment"> for (unsigned int i = 0; i <= node->used; i++) {</span></div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> inode = node->head[i].iPtr;</span></div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment">// cout << "(" << node->childCount[i] << ")";</span></div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment"> for (unsigned int k = 0; k < node->childCount[i]; k++) {</span></div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment"> cout << "[" << inode->name << "]";</span></div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment"> inode = inode->next.iPtr;</span></div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment"> } // for k</span></div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment"> if (i != node->used) cout << " {" << node->keys[i] << "} ";</span></div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> cout << endl;</span></div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> return;</span></div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment">#if 0</span></div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="comment"> for (unsigned int i = 0; i < node->used; i++) {</span></div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="comment"> cout << "keys[" << i << "]: " << node->keys[i] << " ";</span></div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> cout << endl;</span></div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> cout << "node->used: " << node->used << endl;</span></div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> cout << "leaf: " << node->leaf << endl;</span></div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="comment"> for (unsigned int i = 0; i <= node->used; i++) {</span></div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment"> inode = (ubixfsInode *)node->head[i];</span></div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="comment">cout << "node->childCount["<<i<<"]: " << node->childCount[i] << endl;</span></div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="comment"> for (unsigned int j = 0; j < node->childCount[i]; j++) {</span></div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="comment"> assert(inode);</span></div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="comment"> cout << "[" << i << "].[" << j << "]->" << inode->name << endl;</span></div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="comment"> inode = inode->next;</span></div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span> <span class="comment"> } // for j</span></div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment">#endif</span></div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="comment">} // bTree::Info</span></div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="comment"></span> </div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="comment">void</span></div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="comment">bTree::Info(void) {</span></div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="comment"> ubixfsInode * inode = NULL;</span></div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment"></span> </div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment"> cout << "tree depth: " << header->treeDepth << endl;</span></div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"> cout << "tree width: " << header->treeWidth << endl;</span></div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment"> cout << "tree leaf count: " << header->treeLeafCount << endl;</span></div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"> cout << "tag: " << tag << endl;</span></div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="comment"></span> </div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="comment"> if (root == NULL) return;</span></div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment"></span> </div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="comment"> for (unsigned int i = 0; i <= root->used; i++) {</span></div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="comment"> cout << "CC[" << i << "]: " << root->childCount[i] << " ";</span></div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment"></span> </div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"> cout << endl;</span></div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment"> for (unsigned int i = 0; i <= root->used; i++) {</span></div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="comment"> cout << "CH[" << i << "]: " << root->head[i].bPtr << " ";</span></div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span> <span class="comment"></span> </div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="comment"> cout << endl;</span></div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment"> for (unsigned int i = 0; i <=root->used; i++) {</span></div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="comment"> cout << "CT[" << i << "]: " << root->tail[i].bPtr << " ";</span></div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> <span class="comment"> cout << endl;</span></div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="comment"> for (unsigned int i = 0; i < root->used; i++) {</span></div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="comment"> cout << "keys[" << i << "]: " << root->keys[i] << " ";</span></div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="comment"> cout << endl;</span></div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment"></span> </div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment">cout << "root->used: " << root->used << endl;</span></div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment"> for (unsigned int i = 0; i <= root->used; i++) {</span></div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment"> inode = root->head[i].iPtr;</span></div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment">cout << "root->childCount["<<i<<"]: " << root->childCount[i] << endl;</span></div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment"> if (root->leaf) {</span></div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment">cout << "root contains leaf node" << endl;</span></div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment"> for (unsigned int j = 0; j < root->childCount[i]; j++) {</span></div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment"> assert(inode);</span></div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"> cout << "[" << i << "].[" << j << "]->" << inode->name << endl;</span></div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> inode = inode->next.iPtr;</span></div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="comment"> } // for j</span></div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"> } // if root->leaf</span></div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment">} // bTree::Info</span></div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"></span> </div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment">void</span></div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="comment">bTree::Print(void) {</span></div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="comment"> ubixfsInode * node = GetFirstNode();</span></div>
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="comment"> while (node != NULL) {</span></div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"> cout << node->name << endl;</span></div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> node = node->next.iPtr;</span></div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> }</span></div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment">} // bTree::Print</span></div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"></span> </div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment">ubixfsInode *</span></div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment">bTree::Find(const char * key) {</span></div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment"></span> </div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="comment">*/</span><span class="comment">/*</span></div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment"> ubixfsInode * tmp = GetFirstNode();</span></div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="comment"> while (tmp!=NULL) {</span></div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="comment"> if (strcmp(tmp->name, key) == 0) return tmp;</span></div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="comment"> tmp = tmp->next.iPtr;</span></div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment"> }</span></div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> return NULL;</span></div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment">*/</span><span class="comment">/*</span></div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment"> return treeSearch(root, key);</span></div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment">} // bTree::Find</span></div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"></span> </div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment">ubixfsInode *</span></div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment">bTree::inodeSearch(ubixfsInode * inode, const char * key) {</span></div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="comment"> if (inode == NULL || key == NULL) return NULL;</span></div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="comment"> int result = strcmp(inode->name, key);</span></div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment"> if (result == 0) return inode;</span></div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="comment"></span> </div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"> if (result < 0) {</span></div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> inode = inode->next.iPtr;</span></div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> while (inode != NULL && ((result = strcmp(inode->name, key)) < 0)) {</span></div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"> inode = inode->next.iPtr;</span></div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> } // while</span></div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> inode = inode->prev.iPtr;</span></div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> while (inode != NULL && ((result = strcmp(inode->name, key)) > 0)) {</span></div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> inode = inode->prev.iPtr;</span></div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> } // while</span></div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment"> return (result == 0 ? inode : NULL);</span></div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="comment">} // bTree::inodeSearch</span></div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="comment"></span> </div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="comment">ubixfsInode *</span></div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment">bTree::treeSearch(bNode * bnode, const char * key) {</span></div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"></span> </div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment"> if (bnode == NULL || key == NULL || bnode->used == 0) return NULL;</span></div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="comment"> </span></div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="comment"> if (bnode->leaf) </span></div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment"> return inodeSearch(GetFirstNode(bnode), key);</span></div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="comment"></span> </div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="comment"> if (strcmp(key, bnode->keys[0]) < 0) {</span></div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment"> return treeSearch(bnode->head[0].bPtr, key);</span></div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment"></span> </div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="comment"> if (strcmp(key, bnode->keys[bnode->used-1]) >= 0) {</span></div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span> <span class="comment"> return treeSearch(bnode->head[bnode->used].bPtr, key);</span></div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment"></span> </div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment"> for (unsigned int i = 1; i < bnode->used; i++) {</span></div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="comment"> if (strcmp(key, bnode->keys[i]) < 0) {</span></div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span> <span class="comment"> return treeSearch(bnode->head[i].bPtr, key);</span></div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment"></span> </div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"> return NULL;</span></div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment">} // bTree::treeSearch</span></div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"></span> </div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment">ubixfsInode * </span></div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment">bTree::GetFirstNode(void) {</span></div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> return GetFirstNode(root);</span></div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment">} // bTree::GetFirstNode</span></div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"></span> </div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment">ubixfsInode *</span></div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment">bTree::GetFirstNode(bNode * node) {</span></div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> bNode * tmpNode = node;</span></div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"></span> </div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="comment"> if (tmpNode == NULL) return NULL;</span></div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="comment"></span> </div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="comment"> while (!tmpNode->leaf) {</span></div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span> <span class="comment"> for (unsigned int i = 0; i < tmpNode->used; i++) {</span></div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="comment"> if (tmpNode->head[i].bPtr != NULL) {</span></div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment"> tmpNode = tmpNode->head[i].bPtr;</span></div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment"> break;</span></div>
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment"> } // if</span></div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment"> } // while</span></div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="comment"></span> </div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span> <span class="comment"> for (unsigned int i = 0; i < tmpNode->used; i++) {</span></div>
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> <span class="comment"> if (tmpNode->head[i].iPtr != NULL) return tmpNode->head[i].iPtr;</span></div>
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment"> return NULL;</span></div>
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment">} // bTree::GetFirstNode</span></div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="comment"></span> </div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="comment">bNode *</span></div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span> <span class="comment">bTree::findLeafNode(bNode * node, const char * key) {</span></div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span> <span class="comment"> assert(node);</span></div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="comment"> assert(key);</span></div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment"> if (node == NULL || key == NULL) return NULL;</span></div>
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment"> assert(node->used);</span></div>
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="comment"> if (node->leaf) return node;</span></div>
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment"></span> </div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment"> if (strcmp(key, node->keys[0]) < 0) </span></div>
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment"> return findLeafNode(node->head[0].bPtr, key);</span></div>
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="comment"></span> </div>
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="comment"> if (strcmp(key, node->keys[node->used-1]) >= 0) </span></div>
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="comment"> return findLeafNode(node->head[node->used].bPtr, key);</span></div>
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> </span></div>
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> for (unsigned int i = 1; i < node->used; i++) {</span></div>
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> if (strcmp(key, node->keys[i]) < 0) </span></div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> return findLeafNode(node->head[i].bPtr, key);</span></div>
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> </span></div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> return NULL;</span></div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment">} // bTree::findLeafNode</span></div>
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="comment"></span> </div>
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="comment">void</span></div>
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment">bTree::saveNode(FILE * fd, bNode * node, void * tmpPtr) {</span></div>
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment"> </span></div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment"> bNode * ptr = (bNode *)tmpPtr;</span></div>
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment"> assert(tmpPtr);</span></div>
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="comment"> assert(fd);</span></div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="comment"> assert(node);</span></div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="comment"> cout << "writing tag: " << node->tag << endl;</span></div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> <span class="comment"></span> </div>
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span> <span class="comment"> memcpy(tmpPtr, node, sizeof(bNode)); </span></div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="comment"></span> </div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="comment"> if (node->parent.bPtr != NULL)</span></div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="comment"> ptr->parent.offset = node->parent.bPtr->tag * sizeof(bNode);</span></div>
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span> <span class="comment"> else</span></div>
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="comment"> ptr->parent.offset = 0;</span></div>
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment"></span> </div>
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment"> for (unsigned int i = 0; i <= node->used; i++) {</span></div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment"> bNode * bPtr = node->head[i].bPtr;</span></div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="comment"></span> </div>
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span> <span class="comment"> if (bPtr != NULL)</span></div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span> <span class="comment"> ptr->head[i].offset = bPtr->tag * sizeof(bNode);</span></div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="comment"> else</span></div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="comment"> ptr->head[i].offset = ~0;</span></div>
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"> ptr->present[i] = false;</span></div>
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="comment"> </span></div>
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="comment"> if (node->leaf) {</span></div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="comment"></span> </div>
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="comment"> for (unsigned int i = 0; i <= node->used; i++) {</span></div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment"> // ubixfsInode * inode = node->head[i].iPtr;</span></div>
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"> // mji if (inode != NULL) tmp->head[i] = inode-></span></div>
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"> } else {</span></div>
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment"></span> </div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment"> for (unsigned int i = 0; i <= node->used; i++) {</span></div>
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span> <span class="comment"></span> </div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span> <span class="comment"> if (node->head[i].bPtr != NULL) saveNode(fd, node->head[i].bPtr, tmpPtr);</span></div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span> <span class="comment"></span> </div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span> <span class="comment"></span> </div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span> <span class="comment"> } // else</span></div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span> <span class="comment"></span> </div>
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="comment"> return;</span></div>
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="comment">} // bTree::saveNode </span></div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span> <span class="comment"></span> </div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span> <span class="comment">bool </span></div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span> <span class="comment">bTree::Save(const char * filename) {</span></div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="comment"> ubixfsInode * uPtr = NULL;</span></div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="comment"> if (filename == NULL) return false;</span></div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span> <span class="comment"> FILE * fd = NULL;</span></div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span> <span class="comment"> if ((fd = fopen(filename, "wb+")) == NULL) return false;</span></div>
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span> <span class="comment"></span> </div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="comment">cout << "tags: " << tag << endl;</span></div>
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> lseek(fileno(fd), tag * sizeof(bNode), SEEK_END);</span></div>
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment"></span> </div>
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment"> header->firstNodeOffset = sizeof(bNode);</span></div>
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="comment"> header->firstDeleted = -1;</span></div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="comment"> void * tmpPtr = malloc(sizeof(bNode));</span></div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="comment"> assert(tmpPtr);</span></div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="comment"> uPtr = (ubixfsInode *)tmpPtr;</span></div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="comment"> memset(tmpPtr, 0, sizeof(bNode));</span></div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="comment"> fwrite(header, sizeof(bTreeHeader), 1, fd); </span></div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment"> saveNode(fd, root, tmpPtr);</span></div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment"> </span></div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment"> fclose(fd);</span></div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment"> free(tmpPtr);</span></div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="comment"> return true;</span></div>
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="comment">} // bTree::Save</span></div>
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="comment"></span> </div>
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment">bool</span></div>
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment">bTree::Load(const char * filename) {</span></div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment"> if (filename == NULL) return false;</span></div>
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="comment"> return true;</span></div>
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span> <span class="comment">} // bTree::Load</span></div>
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="comment"></span> </div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="comment">bool</span></div>
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="comment">bTree::Delete(const char * key) {</span></div>
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="comment"></span> </div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span> <span class="comment"> if (key == NULL) return false;</span></div>
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="comment"> return true;</span></div>
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span> <span class="comment">} // bTree::Delete</span></div>
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span> <span class="comment"></span> </div>
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span> <span class="comment">bool</span></div>
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="comment">bTree::Verify(void) {</span></div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="comment"> ubixfsInode * node = GetFirstNode();</span></div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span> <span class="comment"> if (node == NULL) return true;</span></div>
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span> <span class="comment"> </span></div>
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="comment"> while (node != NULL) {</span></div>
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="comment"> ubixfsInode * next = node->next.iPtr;</span></div>
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"> if (next != NULL) {</span></div>
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> // cout << node->name << "::" << node->next->name << ":::" << strcmp(node->name, node->next->name) << endl;</span></div>
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"> if (strcmp(node->name, next->name) > 0) return false;</span></div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="comment"> }</span></div>
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="comment"> node = next;</span></div>
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span> <span class="comment"> } // while</span></div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span> <span class="comment"> return true;</span></div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span> <span class="comment">} // bTree::Verify</span></div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span> <span class="comment"></span> </div>
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="comment">void </span></div>
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="comment">bTree::Print(bNode * node) {</span></div>
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="comment"> if (node == NULL) return;</span></div>
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span> <span class="comment"> Info(node);</span></div>
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span> <span class="comment"> if (!node->leaf)</span></div>
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment"> for (unsigned int i = 0; i <= node->used; i++) {</span></div>
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment"> Print(node->head[i].bPtr);</span></div>
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment"> } // for i</span></div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="comment">} // bTree::Print</span></div>
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="comment"></span> </div>
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span> <span class="comment">void</span></div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment">bTree::PrintWholeTree(void) {</span></div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment"> Print(root);</span></div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment">} // bTree::PrintWholeTree;</span></div>
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment"></span> </div>
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment">bTree::~bTree(void) {</span></div>
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"> cout << "tree depth: " << header->treeDepth << endl;</span></div>
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment"> cout << "tree width: " << header->treeWidth << endl;</span></div>
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"> cout << "tree leaf count: " << header->treeLeafCount << endl;</span></div>
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment">} // bTree::~bTree</span></div>
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment"></span> </div>
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment">*/</span></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_97b3d2b63ac216821c2d7a22ee0ab2b0.html">fs</a></li><li class="navelem"><a class="el" href="../../dir_722d6d0a205f707e3dce7dd06d62a189.html">ubixfsv2</a></li><li class="navelem"><a class="el" href="../../de/d00/btree_8cpp.html">btree.cpp</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
</ul>
</div>
</body>
</html>
