<!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 V2: C:/Dev/git/UbixOS/sys/lib/kern_trie.c 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="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></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 V2
 <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">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<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('',true,false,'search.php','Search');
$(document).ready(function() { init_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('kern__trie_8c_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">kern_trie.c</div> </div>
</div><!--header-->
<div class="contents">
<a href="kern__trie_8c.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">/*-</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2018 The UbixOS Project.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * All rights reserved.</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"> * This was developed by Christopher W. Olsen for the UbixOS Project.</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * Redistribution and use in source and binary forms, with or without modification, are permitted</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * provided that the following conditions are met:</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * 1) Redistributions of source code must retain the above copyright notice, this list of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * conditions, the following disclaimer and the list of authors.</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * 2) Redistributions in binary form must reproduce the above copyright notice, this list of</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * conditions, the following disclaimer and the list of authors in the documentation and/or</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * other materials provided with the distribution.</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * 3) Neither the name of the UbixOS Project nor the names of its contributors may be used to</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * endorse or promote products derived from this software without specific prior written</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * permission.</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <<a class="code" href="include_2sys_2types_8h.html">sys/types.h</a>></span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <<a class="code" href="kmalloc_8h.html">lib/kmalloc.h</a>></span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <<a class="code" href="kern__trie_8h.html">lib/kern_trie.h</a>></span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="kern__trie_8c.html#afadb3489e5ff24f80e606d9651ec59fc"> 33</a></span> <span class="keyword">struct </span><a class="code" href="structTrie.html">Trie</a> *<a class="code" href="kern__trie_8c.html#afadb3489e5ff24f80e606d9651ec59fc">new_trieNode</a>() {</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">struct </span><a class="code" href="structTrie.html">Trie</a> *node = (<span class="keyword">struct </span><a class="code" href="structTrie.html">Trie</a> *) <a class="code" href="kmalloc_8h.html#a150eab2ac4ce4553e21ca10e7f441762">kmalloc</a>(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structTrie.html">Trie</a>));</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  </div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  node-><a class="code" href="structTrie.html#ac64f365c3bbfe79362504d1580dc90aa">isLeaf</a> = 0;</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="kern__trie_8h.html#a22c7f61c2f0fa6b1943548e838055cec">CHAR_SIZE</a>; i++)</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  node-><a class="code" href="structTrie.html#afd70d2d6861cb0fc6574f554dabbd56d">character</a>[i] = <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  return (node);</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> }</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  </div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// Insert Trie</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="kern__trie_8c.html#a07e8f86b54a5cef01d03eddada7dbaef"> 46</a></span> <span class="keywordtype">void</span> <a class="code" href="kern__trie_8c.html#a07e8f86b54a5cef01d03eddada7dbaef">insert_trieNode</a>(<span class="keyword">struct</span> <a class="code" href="structTrie.html">Trie</a> **head, <span class="keywordtype">char</span>* str, <span class="keywordtype">void</span> *<a class="code" href="structTrie.html#a0d43a2b490ad3501ae54366f674ed726">e</a>) {</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// start from root node</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">struct </span><a class="code" href="structTrie.html">Trie</a>* curr = *head;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">while</span> (*str) {</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// create a new node if path doesn't exists</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">if</span> (curr-><a class="code" href="structTrie.html#afd70d2d6861cb0fc6574f554dabbd56d">character</a>[*str - <span class="charliteral">'a'</span>] == <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) {</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  curr-><a class="code" href="structTrie.html#afd70d2d6861cb0fc6574f554dabbd56d">character</a>[*str - <span class="charliteral">'a'</span>] = <a class="code" href="kern__trie_8c.html#afadb3489e5ff24f80e606d9651ec59fc">new_trieNode</a>();</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// go to next node</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  curr = curr-><a class="code" href="structTrie.html#afd70d2d6861cb0fc6574f554dabbd56d">character</a>[*str - <span class="charliteral">'a'</span>];</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// move to next character</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  str++;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  curr-><a class="code" href="structTrie.html#a0d43a2b490ad3501ae54366f674ed726">e</a> = <a class="code" href="structTrie.html#a0d43a2b490ad3501ae54366f674ed726">e</a>;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// mark current node as leaf</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  curr-><a class="code" href="structTrie.html#ac64f365c3bbfe79362504d1580dc90aa">isLeaf</a> = 1;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> }</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="kern__trie_8c.html#a180f49543d31feac873622e189efc064"> 70</a></span> <span class="keyword">struct </span><a class="code" href="structTrie.html">Trie</a> *<a class="code" href="kern__trie_8c.html#a180f49543d31feac873622e189efc064">search_trieNode</a>(<span class="keyword">struct</span> <a class="code" href="structTrie.html">Trie</a> *head, <span class="keywordtype">char</span> *str) {</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  </div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// return 0 if Trie is empty</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (head == <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> || str == <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> (0);</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">struct </span><a class="code" href="structTrie.html">Trie</a> *curr = head;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">while</span> (*str) {</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// go to next node</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  curr = curr-><a class="code" href="structTrie.html#afd70d2d6861cb0fc6574f554dabbd56d">character</a>[*str - <span class="charliteral">'a'</span>];</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// if string is invalid (reached end of path in Trie)</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (curr == <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> (0);</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  </div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// move to next character</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  str++;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// if current node is a leaf and we have reached the</span></div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// end of the string, return 1</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">return</span> (curr);</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> }</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// Recursive function to delete a string in Trie</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="kern__trie_8c.html#aa95aaef1b2b8618a937ae88913a88866"> 99</a></span> <span class="keywordtype">int</span> <a class="code" href="kern__trie_8c.html#aa95aaef1b2b8618a937ae88913a88866">delete_trieNode</a>(<span class="keyword">struct</span> <a class="code" href="structTrie.html">Trie</a> **curr, <span class="keywordtype">char</span> *str) {</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// return if Trie is empty</span></div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">if</span> (*curr == <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> (0);</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// if we have not reached the end of the string</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (*str) {</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// recurse for the node corresponding to next character in</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// the string and if it returns 1, delete current node</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// (if it is non-leaf)</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (*curr != <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> && (*curr)->character[*str - <span class="charliteral">'a'</span>] != <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> && deletion(&((*curr)->character[*str - <span class="charliteral">'a'</span>]), str + 1) && (*curr)->isLeaf == 0) {</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (!<a class="code" href="kern__trie_8c.html#a0d5e94a35ef6770fd351039714381a68">haveChildren</a>(*curr)) {</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  free(*curr);</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  (*curr) = <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> (1);</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">return</span> (0);</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  </div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// if we have reached the end of the string</span></div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span> (*str == <span class="charliteral">'\0'</span> && (*curr)->isLeaf) {</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// if current node is a leaf node and don't have any children</span></div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">if</span> (!<a class="code" href="kern__trie_8c.html#a0d5e94a35ef6770fd351039714381a68">haveChildren</a>(*curr)) {</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  free(*curr); <span class="comment">// delete current node</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  (*curr) = <a class="code" href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">return</span> (1); <span class="comment">// delete non-leaf parent nodes</span></div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  </div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// if current node is a leaf node and have children</span></div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// mark current node as non-leaf node (DON'T DELETE IT)</span></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  (*curr)->isLeaf = 0;</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">return</span> (0); <span class="comment">// don't delete its parent nodes</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">return</span> (0);</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> }</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// returns 1 if given node has any children</span></div>
<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="kern__trie_8c.html#a0d5e94a35ef6770fd351039714381a68"> 143</a></span> <span class="keywordtype">int</span> <a class="code" href="kern__trie_8c.html#a0d5e94a35ef6770fd351039714381a68">haveChildren</a>(<span class="keyword">struct</span> <a class="code" href="structTrie.html">Trie</a>* curr) {</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="kern__trie_8h.html#a22c7f61c2f0fa6b1943548e838055cec">CHAR_SIZE</a>; i++)</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (curr-><a class="code" href="structTrie.html#afd70d2d6861cb0fc6574f554dabbd56d">character</a>[i])</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">return</span> (1); <span class="comment">// child found</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  </div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> (0);</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> }</div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="akern__trie_8c_html_aa95aaef1b2b8618a937ae88913a88866"><div class="ttname"><a href="kern__trie_8c.html#aa95aaef1b2b8618a937ae88913a88866">delete_trieNode</a></div><div class="ttdeci">int delete_trieNode(struct Trie **curr, char *str)</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8c_source.html#l00099">kern_trie.c:99</a></div></div>
<div class="ttc" id="akern__trie_8c_html_a0d5e94a35ef6770fd351039714381a68"><div class="ttname"><a href="kern__trie_8c.html#a0d5e94a35ef6770fd351039714381a68">haveChildren</a></div><div class="ttdeci">int haveChildren(struct Trie *curr)</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8c_source.html#l00143">kern_trie.c:143</a></div></div>
<div class="ttc" id="astructTrie_html_afd70d2d6861cb0fc6574f554dabbd56d"><div class="ttname"><a href="structTrie.html#afd70d2d6861cb0fc6574f554dabbd56d">Trie::character</a></div><div class="ttdeci">struct Trie * character[26]</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8h_source.html#l00038">kern_trie.h:38</a></div></div>
<div class="ttc" id="ainclude_2sys_2types_8h_html"><div class="ttname"><a href="include_2sys_2types_8h.html">types.h</a></div></div>
<div class="ttc" id="akern__trie_8c_html_a07e8f86b54a5cef01d03eddada7dbaef"><div class="ttname"><a href="kern__trie_8c.html#a07e8f86b54a5cef01d03eddada7dbaef">insert_trieNode</a></div><div class="ttdeci">void insert_trieNode(struct Trie **head, char *str, void *e)</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8c_source.html#l00046">kern_trie.c:46</a></div></div>
<div class="ttc" id="akern__trie_8c_html_a180f49543d31feac873622e189efc064"><div class="ttname"><a href="kern__trie_8c.html#a180f49543d31feac873622e189efc064">search_trieNode</a></div><div class="ttdeci">struct Trie * search_trieNode(struct Trie *head, char *str)</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8c_source.html#l00070">kern_trie.c:70</a></div></div>
<div class="ttc" id="astructTrie_html_a0d43a2b490ad3501ae54366f674ed726"><div class="ttname"><a href="structTrie.html#a0d43a2b490ad3501ae54366f674ed726">Trie::e</a></div><div class="ttdeci">void * e</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8h_source.html#l00039">kern_trie.h:39</a></div></div>
<div class="ttc" id="astructTrie_html_ac64f365c3bbfe79362504d1580dc90aa"><div class="ttname"><a href="structTrie.html#ac64f365c3bbfe79362504d1580dc90aa">Trie::isLeaf</a></div><div class="ttdeci">u_int8_t isLeaf</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8h_source.html#l00037">kern_trie.h:37</a></div></div>
<div class="ttc" id="akern__trie_8h_html"><div class="ttname"><a href="kern__trie_8h.html">kern_trie.h</a></div></div>
<div class="ttc" id="akmalloc_8h_html_a150eab2ac4ce4553e21ca10e7f441762"><div class="ttname"><a href="kmalloc_8h.html#a150eab2ac4ce4553e21ca10e7f441762">kmalloc</a></div><div class="ttdeci">void * kmalloc(uInt32 len)</div><div class="ttdef"><b>Definition:</b> <a href="kmalloc_8c_source.html#l00241">kmalloc.c:241</a></div></div>
<div class="ttc" id="astructTrie_html"><div class="ttname"><a href="structTrie.html">Trie</a></div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8h_source.html#l00036">kern_trie.h:36</a></div></div>
<div class="ttc" id="akern__trie_8h_html_a22c7f61c2f0fa6b1943548e838055cec"><div class="ttname"><a href="kern__trie_8h.html#a22c7f61c2f0fa6b1943548e838055cec">CHAR_SIZE</a></div><div class="ttdeci">#define CHAR_SIZE</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8h_source.html#l00034">kern_trie.h:34</a></div></div>
<div class="ttc" id="akmalloc_8h_html"><div class="ttname"><a href="kmalloc_8h.html">kmalloc.h</a></div></div>
<div class="ttc" id="akern__trie_8c_html_afadb3489e5ff24f80e606d9651ec59fc"><div class="ttname"><a href="kern__trie_8c.html#afadb3489e5ff24f80e606d9651ec59fc">new_trieNode</a></div><div class="ttdeci">struct Trie * new_trieNode()</div><div class="ttdef"><b>Definition:</b> <a href="kern__trie_8c_source.html#l00033">kern_trie.c:33</a></div></div>
<div class="ttc" id="afat__string_8h_html_a070d2ce7b6bb7e5c05602aa8c308d0c4"><div class="ttname"><a href="fat__string_8h.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a></div><div class="ttdeci">#define NULL</div><div class="ttdef"><b>Definition:</b> <a href="fat__string_8h_source.html#l00017">fat_string.h:17</a></div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_e6bb53534ac0e427887cf7a94c0c004e.html">C:</a></li><li class="navelem"><a class="el" href="dir_d99d5d4662bf24521eef49da6a8cd34d.html">Dev</a></li><li class="navelem"><a class="el" href="dir_474a4b306371cf7e7f6fa12cb0b77df6.html">git</a></li><li class="navelem"><a class="el" href="dir_849109bbd106d461b128d63e5babcedf.html">UbixOS</a></li><li class="navelem"><a class="el" href="dir_6ec99f6d7d5182ba8913209ab70c9f18.html">sys</a></li><li class="navelem"><a class="el" href="dir_34dbdcf62f851fc330fe234d0297df87.html">lib</a></li><li class="navelem"><a class="el" href="kern__trie_8c.html">kern_trie.c</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>
