mirror of
https://github.com/amadvance/snapraid.git
synced 2026-11-19 14:36:38 -05:00
285 lines
26 KiB
HTML
285 lines
26 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/tommychain.h</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> - tommychain.h<span style="font-size: 80%;"> (source / <a href="tommychain.h.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">69</td>
|
|
<td class="headerCovTableEntry">69</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2026-04-29 15:04:44</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">5</td>
|
|
<td class="headerCovTableEntry">5</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> : // SPDX-License-Identifier: BSD-2-Clause</a>
|
|
<a name="2"><span class="lineNum"> 2 </span> : // Copyright (C) 2010 Andrea Mazzoleni</a>
|
|
<a name="3"><span class="lineNum"> 3 </span> : </a>
|
|
<a name="4"><span class="lineNum"> 4 </span> : /** \file</a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : * Chain of nodes.</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : * A chain of nodes is an abstraction used to implement complex list operations</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : * like sorting.</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : *</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : * Do not use this directly. Use lists instead.</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : */</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : </a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : #ifndef __TOMMYCHAIN_H</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : #define __TOMMYCHAIN_H</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : </a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : #include "tommytypes.h"</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : </a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : /******************************************************************************/</a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : /* chain */</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : </a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : /**</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : * Chain of nodes.</a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : * A chain of nodes is a sequence of nodes with the following properties:</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : * - It contains at least one node. A chain of zero nodes cannot exist.</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : * - The next field of the tail is of *undefined* value.</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : * - The prev field of the head is of *undefined* value.</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : * - All the other inner prev and next fields are correctly set.</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : */</a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : typedef struct tommy_chain_struct {</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : tommy_node* head; /**< Pointer to the head of the chain. */</a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : tommy_node* tail; /**< Pointer to the tail of the chain. */</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : } tommy_chain;</a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : </a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : /**</a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : * Splices a chain in the middle of another chain.</a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : * \param first_before Node before the splice point.</a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : * \param first_after Node after the splice point.</a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : * \param second_head Head of the chain to splice in.</a>
|
|
<a name="38"><span class="lineNum"> 38 </span> : * \param second_tail Tail of the chain to splice in.</a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : */</a>
|
|
<a name="40"><span class="lineNum"> 40 </span><span class="lineCov"> 5001488 : tommy_inline void tommy_chain_splice(tommy_node* first_before, tommy_node* first_after, tommy_node* second_head, tommy_node* second_tail)</span></a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : {</a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : /* set the prev list */</a>
|
|
<a name="43"><span class="lineNum"> 43 </span><span class="lineCov"> 5001488 : first_after->prev = second_tail;</span></a>
|
|
<a name="44"><span class="lineNum"> 44 </span><span class="lineCov"> 5001488 : second_head->prev = first_before;</span></a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : </a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : /* set the next list */</a>
|
|
<a name="47"><span class="lineNum"> 47 </span><span class="lineCov"> 5001488 : first_before->next = second_head;</span></a>
|
|
<a name="48"><span class="lineNum"> 48 </span><span class="lineCov"> 5001488 : second_tail->next = first_after;</span></a>
|
|
<a name="49"><span class="lineNum"> 49 </span><span class="lineCov"> 5001488 : }</span></a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : </a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : /**</a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : * Concatenates two chains.</a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : * \param first_tail Tail of the first chain.</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : * \param second_head Head of the second chain.</a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : */</a>
|
|
<a name="56"><span class="lineNum"> 56 </span><span class="lineCov"> 1441395 : tommy_inline void tommy_chain_concat(tommy_node* first_tail, tommy_node* second_head)</span></a>
|
|
<a name="57"><span class="lineNum"> 57 </span> : {</a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : /* set the prev list */</a>
|
|
<a name="59"><span class="lineNum"> 59 </span><span class="lineCov"> 1441395 : second_head->prev = first_tail;</span></a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : </a>
|
|
<a name="61"><span class="lineNum"> 61 </span> : /* set the next list */</a>
|
|
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov"> 1441395 : first_tail->next = second_head;</span></a>
|
|
<a name="63"><span class="lineNum"> 63 </span><span class="lineCov"> 1441395 : }</span></a>
|
|
<a name="64"><span class="lineNum"> 64 </span> : </a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : /**</a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : * Merges two chains.</a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : * \param first First chain (will contain the result).</a>
|
|
<a name="68"><span class="lineNum"> 68 </span> : * \param second Second chain (will be empty after the merge).</a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : * \param cmp Comparison function.</a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : */</a>
|
|
<a name="71"><span class="lineNum"> 71 </span><span class="lineCov"> 527839 : tommy_inline void tommy_chain_merge(tommy_chain* first, tommy_chain* second, tommy_compare_func* cmp)</span></a>
|
|
<a name="72"><span class="lineNum"> 72 </span> : {</a>
|
|
<a name="73"><span class="lineNum"> 73 </span><span class="lineCov"> 527839 : tommy_node* first_i = first->head;</span></a>
|
|
<a name="74"><span class="lineNum"> 74 </span><span class="lineCov"> 527839 : tommy_node* second_i = second->head;</span></a>
|
|
<a name="75"><span class="lineNum"> 75 </span> : </a>
|
|
<a name="76"><span class="lineNum"> 76 </span> : /* merge */</a>
|
|
<a name="77"><span class="lineNum"> 77 </span> : while (1) {</a>
|
|
<a name="78"><span class="lineNum"> 78 </span><span class="lineCov"> 10934182 : if (cmp(first_i->data, second_i->data) > 0) {</span></a>
|
|
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 5267884 : tommy_node* next = second_i->next;</span></a>
|
|
<a name="80"><span class="lineNum"> 80 </span><span class="lineCov"> 5267884 : if (first_i == first->head) {</span></a>
|
|
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 266396 : tommy_chain_concat(second_i, first_i);</span></a>
|
|
<a name="82"><span class="lineNum"> 82 </span><span class="lineCov"> 266396 : first->head = second_i;</span></a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : } else {</a>
|
|
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 5001488 : tommy_chain_splice(first_i->prev, first_i, second_i, second_i);</span></a>
|
|
<a name="85"><span class="lineNum"> 85 </span> : }</a>
|
|
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 5267884 : if (second_i == second->tail)</span></a>
|
|
<a name="87"><span class="lineNum"> 87 </span><span class="lineCov"> 264306 : break;</span></a>
|
|
<a name="88"><span class="lineNum"> 88 </span><span class="lineCov"> 5003578 : second_i = next;</span></a>
|
|
<a name="89"><span class="lineNum"> 89 </span> : } else {</a>
|
|
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 5666298 : if (first_i == first->tail) {</span></a>
|
|
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 263533 : tommy_chain_concat(first_i, second_i);</span></a>
|
|
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 263533 : first->tail = second->tail;</span></a>
|
|
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 263533 : break;</span></a>
|
|
<a name="94"><span class="lineNum"> 94 </span> : }</a>
|
|
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 5402765 : first_i = first_i->next;</span></a>
|
|
<a name="96"><span class="lineNum"> 96 </span> : }</a>
|
|
<a name="97"><span class="lineNum"> 97 </span> : }</a>
|
|
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 527839 : }</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> : * Merges two chains managing special degenerated cases.</a>
|
|
<a name="102"><span class="lineNum"> 102 </span> : * It's functionally equivalent to tommy_chain_merge() but faster with already ordered chains.</a>
|
|
<a name="103"><span class="lineNum"> 103 </span> : * \param first First chain (will contain the result).</a>
|
|
<a name="104"><span class="lineNum"> 104 </span> : * \param second Second chain (will be empty after the merge).</a>
|
|
<a name="105"><span class="lineNum"> 105 </span> : * \param cmp Comparison function.</a>
|
|
<a name="106"><span class="lineNum"> 106 </span> : */</a>
|
|
<a name="107"><span class="lineNum"> 107 </span><span class="lineCov"> 1439305 : tommy_inline void tommy_chain_merge_degenerated(tommy_chain* first, tommy_chain* second, tommy_compare_func* cmp)</span></a>
|
|
<a name="108"><span class="lineNum"> 108 </span> : {</a>
|
|
<a name="109"><span class="lineNum"> 109 </span> : /* identify the condition first <= second */</a>
|
|
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 1439305 : if (cmp(first->tail->data, second->head->data) <= 0) {</span></a>
|
|
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 533313 : tommy_chain_concat(first->tail, second->head);</span></a>
|
|
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 533313 : first->tail = second->tail;</span></a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 533313 : return;</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> : /* identify the condition second < first */</a>
|
|
<a name="117"><span class="lineNum"> 117 </span> : /* here we must be strict on comparison to keep the sort stable */</a>
|
|
<a name="118"><span class="lineNum"> 118 </span><span class="lineCov"> 905992 : if (cmp(second->tail->data, first->head->data) < 0) {</span></a>
|
|
<a name="119"><span class="lineNum"> 119 </span><span class="lineCov"> 378153 : tommy_chain_concat(second->tail, first->head);</span></a>
|
|
<a name="120"><span class="lineNum"> 120 </span><span class="lineCov"> 378153 : first->head = second->head;</span></a>
|
|
<a name="121"><span class="lineNum"> 121 </span><span class="lineCov"> 378153 : return;</span></a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : }</a>
|
|
<a name="123"><span class="lineNum"> 123 </span> : </a>
|
|
<a name="124"><span class="lineNum"> 124 </span><span class="lineCov"> 527839 : tommy_chain_merge(first, second, cmp);</span></a>
|
|
<a name="125"><span class="lineNum"> 125 </span> : }</a>
|
|
<a name="126"><span class="lineNum"> 126 </span> : </a>
|
|
<a name="127"><span class="lineNum"> 127 </span> : /**</a>
|
|
<a name="128"><span class="lineNum"> 128 </span> : * Sorts a chain.</a>
|
|
<a name="129"><span class="lineNum"> 129 </span> : * It's a stable merge sort using power of 2 buckets, with O(N*log(N)) complexity,</a>
|
|
<a name="130"><span class="lineNum"> 130 </span> : * similar to the one used in the SGI STL libraries and in the Linux Kernel,</a>
|
|
<a name="131"><span class="lineNum"> 131 </span> : * but faster on degenerated cases like already ordered lists.</a>
|
|
<a name="132"><span class="lineNum"> 132 </span> : *</a>
|
|
<a name="133"><span class="lineNum"> 133 </span> : * SGI STL stl_list.h</a>
|
|
<a name="134"><span class="lineNum"> 134 </span> : * http://www.sgi.com/tech/stl/stl_list.h</a>
|
|
<a name="135"><span class="lineNum"> 135 </span> : *</a>
|
|
<a name="136"><span class="lineNum"> 136 </span> : * Linux Kernel lib/list_sort.c</a>
|
|
<a name="137"><span class="lineNum"> 137 </span> : * http://lxr.linux.no/#linux+v2.6.36/lib/list_sort.c</a>
|
|
<a name="138"><span class="lineNum"> 138 </span> : *</a>
|
|
<a name="139"><span class="lineNum"> 139 </span> : * \param chain Chain to sort.</a>
|
|
<a name="140"><span class="lineNum"> 140 </span> : * \param cmp Comparison function.</a>
|
|
<a name="141"><span class="lineNum"> 141 </span> : */</a>
|
|
<a name="142"><span class="lineNum"> 142 </span><span class="lineCov"> 2427 : tommy_inline void tommy_chain_mergesort(tommy_chain* chain, tommy_compare_func* cmp)</span></a>
|
|
<a name="143"><span class="lineNum"> 143 </span> : {</a>
|
|
<a name="144"><span class="lineNum"> 144 </span> : /*</a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : * Bit buckets of chains.</a>
|
|
<a name="146"><span class="lineNum"> 146 </span> : * Each bucket contains 2^i nodes or it's empty.</a>
|
|
<a name="147"><span class="lineNum"> 147 </span> : * The chain at address TOMMY_BIT_MAX is an independent variable operating as "carry".</a>
|
|
<a name="148"><span class="lineNum"> 148 </span> : * We keep it in the same "bit" vector to avoid reports from the valgrind tool sgcheck.</a>
|
|
<a name="149"><span class="lineNum"> 149 </span> : */</a>
|
|
<a name="150"><span class="lineNum"> 150 </span> : tommy_chain bit[TOMMY_SIZE_BIT + 1];</a>
|
|
<a name="151"><span class="lineNum"> 151 </span> : </a>
|
|
<a name="152"><span class="lineNum"> 152 </span> : /**</a>
|
|
<a name="153"><span class="lineNum"> 153 </span> : * Value stored inside the bit bucket.</a>
|
|
<a name="154"><span class="lineNum"> 154 </span> : * It's used to know which bucket is empty or full.</a>
|
|
<a name="155"><span class="lineNum"> 155 </span> : */</a>
|
|
<a name="156"><span class="lineNum"> 156 </span> : tommy_size_t counter;</a>
|
|
<a name="157"><span class="lineNum"> 157 </span><span class="lineCov"> 2427 : tommy_node* node = chain->head;</span></a>
|
|
<a name="158"><span class="lineNum"> 158 </span><span class="lineCov"> 2427 : tommy_node* tail = chain->tail;</span></a>
|
|
<a name="159"><span class="lineNum"> 159 </span> : tommy_size_t mask;</a>
|
|
<a name="160"><span class="lineNum"> 160 </span> : tommy_size_t i;</a>
|
|
<a name="161"><span class="lineNum"> 161 </span> : </a>
|
|
<a name="162"><span class="lineNum"> 162 </span><span class="lineCov"> 2427 : counter = 0;</span></a>
|
|
<a name="163"><span class="lineNum"> 163 </span><span class="lineCov"> 1439305 : while (1) {</span></a>
|
|
<a name="164"><span class="lineNum"> 164 </span> : tommy_node* next;</a>
|
|
<a name="165"><span class="lineNum"> 165 </span> : tommy_chain* last;</a>
|
|
<a name="166"><span class="lineNum"> 166 </span> : </a>
|
|
<a name="167"><span class="lineNum"> 167 </span> : /* carry bit to add */</a>
|
|
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 1441732 : last = &bit[TOMMY_SIZE_BIT];</span></a>
|
|
<a name="169"><span class="lineNum"> 169 </span><span class="lineCov"> 1441732 : bit[TOMMY_SIZE_BIT].head = node;</span></a>
|
|
<a name="170"><span class="lineNum"> 170 </span><span class="lineCov"> 1441732 : bit[TOMMY_SIZE_BIT].tail = node;</span></a>
|
|
<a name="171"><span class="lineNum"> 171 </span><span class="lineCov"> 1441732 : next = node->next;</span></a>
|
|
<a name="172"><span class="lineNum"> 172 </span> : </a>
|
|
<a name="173"><span class="lineNum"> 173 </span> : /* add the bit, propagating the carry */</a>
|
|
<a name="174"><span class="lineNum"> 174 </span><span class="lineCov"> 1441732 : i = 0;</span></a>
|
|
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 1441732 : mask = counter;</span></a>
|
|
<a name="176"><span class="lineNum"> 176 </span><span class="lineCov"> 2873997 : while ((mask & 1) != 0) {</span></a>
|
|
<a name="177"><span class="lineNum"> 177 </span><span class="lineCov"> 1432265 : tommy_chain_merge_degenerated(&bit[i], last, cmp);</span></a>
|
|
<a name="178"><span class="lineNum"> 178 </span><span class="lineCov"> 1432265 : mask >>= 1;</span></a>
|
|
<a name="179"><span class="lineNum"> 179 </span><span class="lineCov"> 1432265 : last = &bit[i];</span></a>
|
|
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 1432265 : ++i;</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> : /* copy the carry in the first empty bit */</a>
|
|
<a name="184"><span class="lineNum"> 184 </span><span class="lineCov"> 1441732 : bit[i] = *last;</span></a>
|
|
<a name="185"><span class="lineNum"> 185 </span> : </a>
|
|
<a name="186"><span class="lineNum"> 186 </span> : /* add the carry in the counter */</a>
|
|
<a name="187"><span class="lineNum"> 187 </span><span class="lineCov"> 1441732 : ++counter;</span></a>
|
|
<a name="188"><span class="lineNum"> 188 </span> : </a>
|
|
<a name="189"><span class="lineNum"> 189 </span><span class="lineCov"> 1441732 : if (node == tail)</span></a>
|
|
<a name="190"><span class="lineNum"> 190 </span><span class="lineCov"> 2427 : break;</span></a>
|
|
<a name="191"><span class="lineNum"> 191 </span><span class="lineCov"> 1439305 : node = next;</span></a>
|
|
<a name="192"><span class="lineNum"> 192 </span> : }</a>
|
|
<a name="193"><span class="lineNum"> 193 </span> : </a>
|
|
<a name="194"><span class="lineNum"> 194 </span> : /* merge the buckets */</a>
|
|
<a name="195"><span class="lineNum"> 195 </span><span class="lineCov"> 2427 : i = tommy_ctz(counter);</span></a>
|
|
<a name="196"><span class="lineNum"> 196 </span><span class="lineCov"> 2427 : mask = counter >> i;</span></a>
|
|
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 13101 : while (mask != 1) {</span></a>
|
|
<a name="198"><span class="lineNum"> 198 </span><span class="lineCov"> 10674 : mask >>= 1;</span></a>
|
|
<a name="199"><span class="lineNum"> 199 </span><span class="lineCov"> 10674 : if (mask & 1)</span></a>
|
|
<a name="200"><span class="lineNum"> 200 </span><span class="lineCov"> 7040 : tommy_chain_merge_degenerated(&bit[i + 1], &bit[i], cmp);</span></a>
|
|
<a name="201"><span class="lineNum"> 201 </span> : else</a>
|
|
<a name="202"><span class="lineNum"> 202 </span><span class="lineCov"> 3634 : bit[i + 1] = bit[i];</span></a>
|
|
<a name="203"><span class="lineNum"> 203 </span><span class="lineCov"> 10674 : ++i;</span></a>
|
|
<a name="204"><span class="lineNum"> 204 </span> : }</a>
|
|
<a name="205"><span class="lineNum"> 205 </span> : </a>
|
|
<a name="206"><span class="lineNum"> 206 </span><span class="lineCov"> 2427 : *chain = bit[i];</span></a>
|
|
<a name="207"><span class="lineNum"> 207 </span><span class="lineCov"> 2427 : }</span></a>
|
|
<a name="208"><span class="lineNum"> 208 </span> : </a>
|
|
<a name="209"><span class="lineNum"> 209 </span> : #endif</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>
|