mirror of
https://github.com/amadvance/snapraid.git
synced 2026-11-21 15:36:33 -05:00
368 lines
34 KiB
HTML
368 lines
34 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - lcov.info - tommyds/tommytree.c</title>
|
|
<link rel="stylesheet" type="text/css" href="../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">tommyds</a> - tommytree.c<span style="font-size: 80%;"> (source / <a href="tommytree.c.func-sort-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="15%"></td>
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">lcov.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntry">127</td>
|
|
<td class="headerCovTableEntry">127</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2026-03-15 15:58:19</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">19</td>
|
|
<td class="headerCovTableEntry">19</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</a>
|
|
<a name="2"><span class="lineNum"> 2 </span> : * Copyright (c) 2015, Andrea Mazzoleni. All rights reserved.</a>
|
|
<a name="3"><span class="lineNum"> 3 </span> : *</a>
|
|
<a name="4"><span class="lineNum"> 4 </span> : * Redistribution and use in source and binary forms, with or without</a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : * modification, are permitted provided that the following conditions</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : * are met:</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : *</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : * 1. Redistributions of source code must retain the above copyright</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : * notice, this list of conditions and the following disclaimer.</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : *</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : * 2. Redistributions in binary form must reproduce the above copyright</a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : * notice, this list of conditions and the following disclaimer in the</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : * documentation and/or other materials provided with the distribution.</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : *</a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR</a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS</a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : * POSSIBILITY OF SUCH DAMAGE.</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : */</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : </a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : #include "tommytree.h"</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : </a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : #include <assert.h> /* for assert */</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : </a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : /******************************************************************************/</a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : /* tree */</a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : </a>
|
|
<a name="35"><span class="lineNum"> 35 </span><span class="lineCov"> 3543 : TOMMY_API void tommy_tree_init(tommy_tree* tree, tommy_compare_func* cmp)</span></a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : {</a>
|
|
<a name="37"><span class="lineNum"> 37 </span><span class="lineCov"> 3543 : tree->root = 0;</span></a>
|
|
<a name="38"><span class="lineNum"> 38 </span><span class="lineCov"> 3543 : tree->count = 0;</span></a>
|
|
<a name="39"><span class="lineNum"> 39 </span><span class="lineCov"> 3543 : tree->cmp = cmp;</span></a>
|
|
<a name="40"><span class="lineNum"> 40 </span><span class="lineCov"> 3543 : }</span></a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : </a>
|
|
<a name="42"><span class="lineNum"> 42 </span><span class="lineCov"> 119009252 : static tommy_ssize_t tommy_tree_delta(tommy_tree_node* root)</span></a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : {</a>
|
|
<a name="44"><span class="lineNum"> 44 </span><span class="lineCov"> 119009252 : tommy_ssize_t left_height = root->prev ? root->prev->index : 0;</span></a>
|
|
<a name="45"><span class="lineNum"> 45 </span><span class="lineCov"> 119009252 : tommy_ssize_t right_height = root->next ? root->next->index : 0;</span></a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : </a>
|
|
<a name="47"><span class="lineNum"> 47 </span><span class="lineCov"> 119009252 : return left_height - right_height;</span></a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : }</a>
|
|
<a name="49"><span class="lineNum"> 49 </span> : </a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : /* AVL tree operations */</a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : static tommy_tree_node* tommy_tree_balance(tommy_tree_node*);</a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : </a>
|
|
<a name="53"><span class="lineNum"> 53 </span><span class="lineCov"> 7951362 : static tommy_tree_node* tommy_tree_rotate_left(tommy_tree_node* root)</span></a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : {</a>
|
|
<a name="55"><span class="lineNum"> 55 </span><span class="lineCov"> 7951362 : tommy_tree_node* next = root->next;</span></a>
|
|
<a name="56"><span class="lineNum"> 56 </span> : </a>
|
|
<a name="57"><span class="lineNum"> 57 </span><span class="lineCov"> 7951362 : root->next = next->prev;</span></a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : </a>
|
|
<a name="59"><span class="lineNum"> 59 </span><span class="lineCov"> 7951362 : next->prev = tommy_tree_balance(root);</span></a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : </a>
|
|
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov"> 7951362 : return tommy_tree_balance(next);</span></a>
|
|
<a name="62"><span class="lineNum"> 62 </span> : }</a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : </a>
|
|
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 184325 : static tommy_tree_node* tommy_tree_rotate_right(tommy_tree_node* root)</span></a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : {</a>
|
|
<a name="66"><span class="lineNum"> 66 </span><span class="lineCov"> 184325 : tommy_tree_node* prev = root->prev;</span></a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : </a>
|
|
<a name="68"><span class="lineNum"> 68 </span><span class="lineCov"> 184325 : root->prev = prev->next;</span></a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : </a>
|
|
<a name="70"><span class="lineNum"> 70 </span><span class="lineCov"> 184325 : prev->next = tommy_tree_balance(root);</span></a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : </a>
|
|
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 184325 : return tommy_tree_balance(prev);</span></a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : }</a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : </a>
|
|
<a name="75"><span class="lineNum"> 75 </span><span class="lineCov"> 178930 : static tommy_tree_node* tommy_tree_move_right(tommy_tree_node* root, tommy_tree_node* node)</span></a>
|
|
<a name="76"><span class="lineNum"> 76 </span> : {</a>
|
|
<a name="77"><span class="lineNum"> 77 </span><span class="lineCov"> 178930 : if (!root)</span></a>
|
|
<a name="78"><span class="lineNum"> 78 </span><span class="lineCov"> 76640 : return node;</span></a>
|
|
<a name="79"><span class="lineNum"> 79 </span> : </a>
|
|
<a name="80"><span class="lineNum"> 80 </span><span class="lineCov"> 102290 : root->next = tommy_tree_move_right(root->next, node);</span></a>
|
|
<a name="81"><span class="lineNum"> 81 </span> : </a>
|
|
<a name="82"><span class="lineNum"> 82 </span><span class="lineCov"> 102290 : return tommy_tree_balance(root);</span></a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : }</a>
|
|
<a name="84"><span class="lineNum"> 84 </span> : </a>
|
|
<a name="85"><span class="lineNum"> 85 </span><span class="lineCov"> 111041265 : static tommy_tree_node* tommy_tree_balance(tommy_tree_node* root)</span></a>
|
|
<a name="86"><span class="lineNum"> 86 </span> : {</a>
|
|
<a name="87"><span class="lineNum"> 87 </span><span class="lineCov"> 111041265 : tommy_ssize_t delta = tommy_tree_delta(root);</span></a>
|
|
<a name="88"><span class="lineNum"> 88 </span> : </a>
|
|
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 111041265 : if (delta < -1) {</span></a>
|
|
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 7828801 : if (tommy_tree_delta(root->next) > 0)</span></a>
|
|
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 45139 : root->next = tommy_tree_rotate_right(root->next);</span></a>
|
|
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 7828801 : return tommy_tree_rotate_left(root);</span></a>
|
|
<a name="93"><span class="lineNum"> 93 </span> : }</a>
|
|
<a name="94"><span class="lineNum"> 94 </span> : </a>
|
|
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 103212464 : if (delta > 1) {</span></a>
|
|
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 139186 : if (tommy_tree_delta(root->prev) < 0)</span></a>
|
|
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 122561 : root->prev = tommy_tree_rotate_left(root->prev);</span></a>
|
|
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 139186 : return tommy_tree_rotate_right(root);</span></a>
|
|
<a name="99"><span class="lineNum"> 99 </span> : }</a>
|
|
<a name="100"><span class="lineNum"> 100 </span> : </a>
|
|
<a name="101"><span class="lineNum"> 101 </span> : /* recompute key */</a>
|
|
<a name="102"><span class="lineNum"> 102 </span><span class="lineCov"> 103073278 : root->index = 0;</span></a>
|
|
<a name="103"><span class="lineNum"> 103 </span> : </a>
|
|
<a name="104"><span class="lineNum"> 104 </span><span class="lineCov"> 103073278 : if (root->prev && root->prev->index > root->index)</span></a>
|
|
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 83313158 : root->index = root->prev->index;</span></a>
|
|
<a name="106"><span class="lineNum"> 106 </span> : </a>
|
|
<a name="107"><span class="lineNum"> 107 </span><span class="lineCov"> 103073278 : if (root->next && root->next->index > root->index)</span></a>
|
|
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 47473770 : root->index = root->next->index;</span></a>
|
|
<a name="109"><span class="lineNum"> 109 </span> : </a>
|
|
<a name="110"><span class="lineNum"> 110 </span> : /* count itself */</a>
|
|
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 103073278 : root->index += 1;</span></a>
|
|
<a name="112"><span class="lineNum"> 112 </span> : </a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 103073278 : return root;</span></a>
|
|
<a name="114"><span class="lineNum"> 114 </span> : }</a>
|
|
<a name="115"><span class="lineNum"> 115 </span> : </a>
|
|
<a name="116"><span class="lineNum"> 116 </span><span class="lineCov"> 101920055 : static tommy_tree_node* tommy_tree_insert_node(tommy_compare_func* cmp, tommy_tree_node* root, tommy_tree_node** let)</span></a>
|
|
<a name="117"><span class="lineNum"> 117 </span> : {</a>
|
|
<a name="118"><span class="lineNum"> 118 </span> : int c;</a>
|
|
<a name="119"><span class="lineNum"> 119 </span> : </a>
|
|
<a name="120"><span class="lineNum"> 120 </span><span class="lineCov"> 101920055 : if (!root)</span></a>
|
|
<a name="121"><span class="lineNum"> 121 </span><span class="lineCov"> 7939460 : return *let;</span></a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : </a>
|
|
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 93980595 : c = cmp((*let)->data, root->data);</span></a>
|
|
<a name="124"><span class="lineNum"> 124 </span> : </a>
|
|
<a name="125"><span class="lineNum"> 125 </span><span class="lineCov"> 93980595 : if (c < 0) {</span></a>
|
|
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 1719825 : root->prev = tommy_tree_insert_node(cmp, root->prev, let);</span></a>
|
|
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 1719825 : return tommy_tree_balance(root);</span></a>
|
|
<a name="128"><span class="lineNum"> 128 </span> : }</a>
|
|
<a name="129"><span class="lineNum"> 129 </span> : </a>
|
|
<a name="130"><span class="lineNum"> 130 </span><span class="lineCov"> 92260770 : if (c > 0) {</span></a>
|
|
<a name="131"><span class="lineNum"> 131 </span><span class="lineCov"> 92260769 : root->next = tommy_tree_insert_node(cmp, root->next, let);</span></a>
|
|
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 92260769 : return tommy_tree_balance(root);</span></a>
|
|
<a name="133"><span class="lineNum"> 133 </span> : }</a>
|
|
<a name="134"><span class="lineNum"> 134 </span> : </a>
|
|
<a name="135"><span class="lineNum"> 135 </span> : /* already present, set the return pointer */</a>
|
|
<a name="136"><span class="lineNum"> 136 </span><span class="lineCov"> 1 : *let = root;</span></a>
|
|
<a name="137"><span class="lineNum"> 137 </span> : </a>
|
|
<a name="138"><span class="lineNum"> 138 </span><span class="lineCov"> 1 : return root;</span></a>
|
|
<a name="139"><span class="lineNum"> 139 </span> : }</a>
|
|
<a name="140"><span class="lineNum"> 140 </span> : </a>
|
|
<a name="141"><span class="lineNum"> 141 </span><span class="lineCov"> 7939461 : TOMMY_API void* tommy_tree_insert(tommy_tree* tree, tommy_tree_node* node, void* data)</span></a>
|
|
<a name="142"><span class="lineNum"> 142 </span> : {</a>
|
|
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 7939461 : tommy_tree_node* insert = node;</span></a>
|
|
<a name="144"><span class="lineNum"> 144 </span> : </a>
|
|
<a name="145"><span class="lineNum"> 145 </span><span class="lineCov"> 7939461 : insert->data = data;</span></a>
|
|
<a name="146"><span class="lineNum"> 146 </span><span class="lineCov"> 7939461 : insert->prev = 0;</span></a>
|
|
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 7939461 : insert->next = 0;</span></a>
|
|
<a name="148"><span class="lineNum"> 148 </span><span class="lineCov"> 7939461 : insert->index = 0;</span></a>
|
|
<a name="149"><span class="lineNum"> 149 </span> : </a>
|
|
<a name="150"><span class="lineNum"> 150 </span><span class="lineCov"> 7939461 : tree->root = tommy_tree_insert_node(tree->cmp, tree->root, &insert);</span></a>
|
|
<a name="151"><span class="lineNum"> 151 </span> : </a>
|
|
<a name="152"><span class="lineNum"> 152 </span><span class="lineCov"> 7939461 : if (insert == node)</span></a>
|
|
<a name="153"><span class="lineNum"> 153 </span><span class="lineCov"> 7939460 : ++tree->count;</span></a>
|
|
<a name="154"><span class="lineNum"> 154 </span> : </a>
|
|
<a name="155"><span class="lineNum"> 155 </span><span class="lineCov"> 7939461 : return insert->data;</span></a>
|
|
<a name="156"><span class="lineNum"> 156 </span> : }</a>
|
|
<a name="157"><span class="lineNum"> 157 </span> : </a>
|
|
<a name="158"><span class="lineNum"> 158 </span><span class="lineCov"> 763775 : static tommy_tree_node* tommy_tree_remove_node(tommy_compare_func* cmp, tommy_tree_node* root, void* data, tommy_tree_node** let)</span></a>
|
|
<a name="159"><span class="lineNum"> 159 </span> : {</a>
|
|
<a name="160"><span class="lineNum"> 160 </span> : int c;</a>
|
|
<a name="161"><span class="lineNum"> 161 </span> : </a>
|
|
<a name="162"><span class="lineNum"> 162 </span><span class="lineCov"> 763775 : if (!root)</span></a>
|
|
<a name="163"><span class="lineNum"> 163 </span><span class="lineCov"> 128 : return 0;</span></a>
|
|
<a name="164"><span class="lineNum"> 164 </span> : </a>
|
|
<a name="165"><span class="lineNum"> 165 </span><span class="lineCov"> 763647 : c = cmp(data, root->data);</span></a>
|
|
<a name="166"><span class="lineNum"> 166 </span> : </a>
|
|
<a name="167"><span class="lineNum"> 167 </span><span class="lineCov"> 763647 : if (c < 0) {</span></a>
|
|
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 309129 : root->prev = tommy_tree_remove_node(cmp, root->prev, data, let);</span></a>
|
|
<a name="169"><span class="lineNum"> 169 </span><span class="lineCov"> 309129 : return tommy_tree_balance(root);</span></a>
|
|
<a name="170"><span class="lineNum"> 170 </span> : }</a>
|
|
<a name="171"><span class="lineNum"> 171 </span> : </a>
|
|
<a name="172"><span class="lineNum"> 172 </span><span class="lineCov"> 454518 : if (c > 0) {</span></a>
|
|
<a name="173"><span class="lineNum"> 173 </span><span class="lineCov"> 377878 : root->next = tommy_tree_remove_node(cmp, root->next, data, let);</span></a>
|
|
<a name="174"><span class="lineNum"> 174 </span><span class="lineCov"> 377878 : return tommy_tree_balance(root);</span></a>
|
|
<a name="175"><span class="lineNum"> 175 </span> : }</a>
|
|
<a name="176"><span class="lineNum"> 176 </span> : </a>
|
|
<a name="177"><span class="lineNum"> 177 </span> : /* found */</a>
|
|
<a name="178"><span class="lineNum"> 178 </span><span class="lineCov"> 76640 : *let = root;</span></a>
|
|
<a name="179"><span class="lineNum"> 179 </span> : </a>
|
|
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 76640 : return tommy_tree_move_right(root->prev, root->next);</span></a>
|
|
<a name="181"><span class="lineNum"> 181 </span> : }</a>
|
|
<a name="182"><span class="lineNum"> 182 </span> : </a>
|
|
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 76768 : TOMMY_API void* tommy_tree_remove(tommy_tree* tree, void* data)</span></a>
|
|
<a name="184"><span class="lineNum"> 184 </span> : {</a>
|
|
<a name="185"><span class="lineNum"> 185 </span><span class="lineCov"> 76768 : tommy_tree_node* node = 0;</span></a>
|
|
<a name="186"><span class="lineNum"> 186 </span> : </a>
|
|
<a name="187"><span class="lineNum"> 187 </span><span class="lineCov"> 76768 : tree->root = tommy_tree_remove_node(tree->cmp, tree->root, data, &node);</span></a>
|
|
<a name="188"><span class="lineNum"> 188 </span> : </a>
|
|
<a name="189"><span class="lineNum"> 189 </span><span class="lineCov"> 76768 : if (!node)</span></a>
|
|
<a name="190"><span class="lineNum"> 190 </span><span class="lineCov"> 128 : return 0;</span></a>
|
|
<a name="191"><span class="lineNum"> 191 </span> : </a>
|
|
<a name="192"><span class="lineNum"> 192 </span><span class="lineCov"> 76640 : --tree->count;</span></a>
|
|
<a name="193"><span class="lineNum"> 193 </span> : </a>
|
|
<a name="194"><span class="lineNum"> 194 </span><span class="lineCov"> 76640 : return node->data;</span></a>
|
|
<a name="195"><span class="lineNum"> 195 </span> : }</a>
|
|
<a name="196"><span class="lineNum"> 196 </span> : </a>
|
|
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 191538520 : static tommy_tree_node* tommy_tree_search_node(tommy_compare_func* cmp, tommy_tree_node* root, void* data)</span></a>
|
|
<a name="198"><span class="lineNum"> 198 </span> : {</a>
|
|
<a name="199"><span class="lineNum"> 199 </span> : int c;</a>
|
|
<a name="200"><span class="lineNum"> 200 </span> : </a>
|
|
<a name="201"><span class="lineNum"> 201 </span><span class="lineCov"> 191538520 : if (!root)</span></a>
|
|
<a name="202"><span class="lineNum"> 202 </span><span class="lineCov"> 2133992 : return 0;</span></a>
|
|
<a name="203"><span class="lineNum"> 203 </span> : </a>
|
|
<a name="204"><span class="lineNum"> 204 </span><span class="lineCov"> 189404528 : c = cmp(data, root->data);</span></a>
|
|
<a name="205"><span class="lineNum"> 205 </span> : </a>
|
|
<a name="206"><span class="lineNum"> 206 </span><span class="lineCov"> 189404528 : if (c < 0)</span></a>
|
|
<a name="207"><span class="lineNum"> 207 </span><span class="lineCov"> 69779458 : return tommy_tree_search_node(cmp, root->prev, data);</span></a>
|
|
<a name="208"><span class="lineNum"> 208 </span> : </a>
|
|
<a name="209"><span class="lineNum"> 209 </span><span class="lineCov"> 119625070 : if (c > 0)</span></a>
|
|
<a name="210"><span class="lineNum"> 210 </span><span class="lineCov"> 104426160 : return tommy_tree_search_node(cmp, root->next, data);</span></a>
|
|
<a name="211"><span class="lineNum"> 211 </span> : </a>
|
|
<a name="212"><span class="lineNum"> 212 </span><span class="lineCov"> 15198910 : return root;</span></a>
|
|
<a name="213"><span class="lineNum"> 213 </span> : }</a>
|
|
<a name="214"><span class="lineNum"> 214 </span> : </a>
|
|
<a name="215"><span class="lineNum"> 215 </span><span class="lineCov"> 2 : TOMMY_API void* tommy_tree_search(tommy_tree* tree, void* data)</span></a>
|
|
<a name="216"><span class="lineNum"> 216 </span> : {</a>
|
|
<a name="217"><span class="lineNum"> 217 </span><span class="lineCov"> 2 : tommy_tree_node* node = tommy_tree_search_node(tree->cmp, tree->root, data);</span></a>
|
|
<a name="218"><span class="lineNum"> 218 </span> : </a>
|
|
<a name="219"><span class="lineNum"> 219 </span><span class="lineCov"> 2 : if (!node)</span></a>
|
|
<a name="220"><span class="lineNum"> 220 </span><span class="lineCov"> 1 : return 0;</span></a>
|
|
<a name="221"><span class="lineNum"> 221 </span> : </a>
|
|
<a name="222"><span class="lineNum"> 222 </span><span class="lineCov"> 1 : return node->data;</span></a>
|
|
<a name="223"><span class="lineNum"> 223 </span> : }</a>
|
|
<a name="224"><span class="lineNum"> 224 </span> : </a>
|
|
<a name="225"><span class="lineNum"> 225 </span><span class="lineCov"> 17332900 : TOMMY_API void* tommy_tree_search_compare(tommy_tree* tree, tommy_compare_func* cmp, void* cmp_arg)</span></a>
|
|
<a name="226"><span class="lineNum"> 226 </span> : {</a>
|
|
<a name="227"><span class="lineNum"> 227 </span><span class="lineCov"> 17332900 : tommy_tree_node* node = tommy_tree_search_node(cmp, tree->root, cmp_arg);</span></a>
|
|
<a name="228"><span class="lineNum"> 228 </span> : </a>
|
|
<a name="229"><span class="lineNum"> 229 </span><span class="lineCov"> 17332900 : if (!node)</span></a>
|
|
<a name="230"><span class="lineNum"> 230 </span><span class="lineCov"> 2133991 : return 0;</span></a>
|
|
<a name="231"><span class="lineNum"> 231 </span> : </a>
|
|
<a name="232"><span class="lineNum"> 232 </span><span class="lineCov"> 15198909 : return node->data;</span></a>
|
|
<a name="233"><span class="lineNum"> 233 </span> : }</a>
|
|
<a name="234"><span class="lineNum"> 234 </span> : </a>
|
|
<a name="235"><span class="lineNum"> 235 </span><span class="lineCov"> 128 : TOMMY_API void* tommy_tree_remove_existing(tommy_tree* tree, tommy_tree_node* node)</span></a>
|
|
<a name="236"><span class="lineNum"> 236 </span> : {</a>
|
|
<a name="237"><span class="lineNum"> 237 </span><span class="lineCov"> 128 : void* data = tommy_tree_remove(tree, node->data);</span></a>
|
|
<a name="238"><span class="lineNum"> 238 </span> : </a>
|
|
<a name="239"><span class="lineNum"> 239 </span><span class="lineCov"> 128 : assert(data != 0);</span></a>
|
|
<a name="240"><span class="lineNum"> 240 </span> : </a>
|
|
<a name="241"><span class="lineNum"> 241 </span><span class="lineCov"> 128 : return data;</span></a>
|
|
<a name="242"><span class="lineNum"> 242 </span> : }</a>
|
|
<a name="243"><span class="lineNum"> 243 </span> : </a>
|
|
<a name="244"><span class="lineNum"> 244 </span><span class="lineCov"> 7773174 : static void tommy_tree_foreach_node(tommy_tree_node* root, tommy_foreach_func* func)</span></a>
|
|
<a name="245"><span class="lineNum"> 245 </span> : {</a>
|
|
<a name="246"><span class="lineNum"> 246 </span> : tommy_tree_node* next;</a>
|
|
<a name="247"><span class="lineNum"> 247 </span> : </a>
|
|
<a name="248"><span class="lineNum"> 248 </span><span class="lineCov"> 7773174 : if (!root)</span></a>
|
|
<a name="249"><span class="lineNum"> 249 </span><span class="lineCov"> 3887443 : return;</span></a>
|
|
<a name="250"><span class="lineNum"> 250 </span> : </a>
|
|
<a name="251"><span class="lineNum"> 251 </span><span class="lineCov"> 3885731 : tommy_tree_foreach_node(root->prev, func);</span></a>
|
|
<a name="252"><span class="lineNum"> 252 </span> : </a>
|
|
<a name="253"><span class="lineNum"> 253 </span> : /* make a copy in case func is free() */</a>
|
|
<a name="254"><span class="lineNum"> 254 </span><span class="lineCov"> 3885731 : next = root->next;</span></a>
|
|
<a name="255"><span class="lineNum"> 255 </span> : </a>
|
|
<a name="256"><span class="lineNum"> 256 </span><span class="lineCov"> 3885731 : func(root->data);</span></a>
|
|
<a name="257"><span class="lineNum"> 257 </span> : </a>
|
|
<a name="258"><span class="lineNum"> 258 </span><span class="lineCov"> 3885731 : tommy_tree_foreach_node(next, func);</span></a>
|
|
<a name="259"><span class="lineNum"> 259 </span> : }</a>
|
|
<a name="260"><span class="lineNum"> 260 </span> : </a>
|
|
<a name="261"><span class="lineNum"> 261 </span><span class="lineCov"> 1712 : TOMMY_API void tommy_tree_foreach(tommy_tree* tree, tommy_foreach_func* func)</span></a>
|
|
<a name="262"><span class="lineNum"> 262 </span> : {</a>
|
|
<a name="263"><span class="lineNum"> 263 </span><span class="lineCov"> 1712 : tommy_tree_foreach_node(tree->root, func);</span></a>
|
|
<a name="264"><span class="lineNum"> 264 </span><span class="lineCov"> 1712 : }</span></a>
|
|
<a name="265"><span class="lineNum"> 265 </span> : </a>
|
|
<a name="266"><span class="lineNum"> 266 </span><span class="lineCov"> 28259877 : static void tommy_tree_foreach_arg_node(tommy_tree_node* root, tommy_foreach_arg_func* func, void* arg)</span></a>
|
|
<a name="267"><span class="lineNum"> 267 </span> : {</a>
|
|
<a name="268"><span class="lineNum"> 268 </span> : tommy_tree_node* next;</a>
|
|
<a name="269"><span class="lineNum"> 269 </span> : </a>
|
|
<a name="270"><span class="lineNum"> 270 </span><span class="lineCov"> 28259877 : if (!root)</span></a>
|
|
<a name="271"><span class="lineNum"> 271 </span><span class="lineCov"> 14133155 : return;</span></a>
|
|
<a name="272"><span class="lineNum"> 272 </span> : </a>
|
|
<a name="273"><span class="lineNum"> 273 </span><span class="lineCov"> 14126722 : tommy_tree_foreach_arg_node(root->prev, func, arg);</span></a>
|
|
<a name="274"><span class="lineNum"> 274 </span> : </a>
|
|
<a name="275"><span class="lineNum"> 275 </span> : /* make a copy in case func is free() */</a>
|
|
<a name="276"><span class="lineNum"> 276 </span><span class="lineCov"> 14126722 : next = root->next;</span></a>
|
|
<a name="277"><span class="lineNum"> 277 </span> : </a>
|
|
<a name="278"><span class="lineNum"> 278 </span><span class="lineCov"> 14126722 : func(arg, root->data);</span></a>
|
|
<a name="279"><span class="lineNum"> 279 </span> : </a>
|
|
<a name="280"><span class="lineNum"> 280 </span><span class="lineCov"> 14126722 : tommy_tree_foreach_arg_node(next, func, arg);</span></a>
|
|
<a name="281"><span class="lineNum"> 281 </span> : }</a>
|
|
<a name="282"><span class="lineNum"> 282 </span> : </a>
|
|
<a name="283"><span class="lineNum"> 283 </span><span class="lineCov"> 6433 : TOMMY_API void tommy_tree_foreach_arg(tommy_tree* tree, tommy_foreach_arg_func* func, void* arg)</span></a>
|
|
<a name="284"><span class="lineNum"> 284 </span> : {</a>
|
|
<a name="285"><span class="lineNum"> 285 </span><span class="lineCov"> 6433 : tommy_tree_foreach_arg_node(tree->root, func, arg);</span></a>
|
|
<a name="286"><span class="lineNum"> 286 </span><span class="lineCov"> 6433 : }</span></a>
|
|
<a name="287"><span class="lineNum"> 287 </span> : </a>
|
|
<a name="288"><span class="lineNum"> 288 </span><span class="lineCov"> 1 : TOMMY_API tommy_size_t tommy_tree_memory_usage(tommy_tree* tree)</span></a>
|
|
<a name="289"><span class="lineNum"> 289 </span> : {</a>
|
|
<a name="290"><span class="lineNum"> 290 </span><span class="lineCov"> 1 : return tommy_tree_count(tree) * sizeof(tommy_tree_node);</span></a>
|
|
<a name="291"><span class="lineNum"> 291 </span> : }</a>
|
|
<a name="292"><span class="lineNum"> 292 </span> : </a>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com/linux-test-project/lcov" target="_parent">LCOV version 1.0</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|