mirror of
https://github.com/amadvance/snapraid.git
synced 2026-11-19 14:36:38 -05:00
489 lines
45 KiB
HTML
489 lines
45 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/tommylist.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> - tommylist.h<span style="font-size: 80%;"> (source / <a href="tommylist.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">72</td>
|
|
<td class="headerCovTableEntry">72</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">12</td>
|
|
<td class="headerCovTableEntry">12</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> : * Double linked list for collisions into hashtables.</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : *</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : * This list is a **doubly** linked list mainly targeted for handling collisions</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : * into an hashtable, but **usable** also as a generic list.</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : *</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : * The main feature of this list is to require only one pointer to represent the</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : * list, compared to a classic implementation requiring a head **and** a tail pointers.</a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : * This reduces the memory usage in hashtables.</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : *</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : * Another feature is to support the insertion at the end of the list. This **allows** to store</a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : * collisions in a stable order. Where for stable order we mean that equal elements keep</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : * their insertion order.</a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : *</a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : * To initialize the list, you have to call tommy_list_init(), or to simply assign</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : * to it NULL, as an empty list is represented by the NULL value.</a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : *</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : * \code</a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : * tommy_list list;</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : *</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : * tommy_list_init(&list); // initializes the list</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : * \endcode</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : *</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : * To insert elements in the list you have to call tommy_list_insert_tail()</a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : * or tommy_list_insert_head() for each element.</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : * In the insertion call you have to specify the address of the node and the</a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : * address of the object.</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : * The address of the object is used to initialize the tommy_node::data field</a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : * of the node.</a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : *</a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : * \code</a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : * struct object {</a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : * int value;</a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : * // other fields</a>
|
|
<a name="38"><span class="lineNum"> 38 </span> : * tommy_node node;</a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : * };</a>
|
|
<a name="40"><span class="lineNum"> 40 </span> : *</a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : * struct object* obj = malloc(sizeof(struct object)); // creates the object</a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : *</a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : * obj->value = ...; // initializes the object</a>
|
|
<a name="44"><span class="lineNum"> 44 </span> : *</a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : * tommy_list_insert_tail(&list, &obj->node, obj); // inserts the object</a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : * \endcode</a>
|
|
<a name="47"><span class="lineNum"> 47 </span> : *</a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : * To iterate over all the elements in the list you have to call</a>
|
|
<a name="49"><span class="lineNum"> 49 </span> : * tommy_list_head() to get the head of the list and follow the</a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : * tommy_node::next pointer until NULL.</a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : *</a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : * \code</a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : * tommy_node* i = tommy_list_head(&list);</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : * while (i) {</a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : * struct object* obj = i->data; // gets the object pointer</a>
|
|
<a name="56"><span class="lineNum"> 56 </span> : *</a>
|
|
<a name="57"><span class="lineNum"> 57 </span> : * printf("%d\n", obj->value); // process the object</a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : *</a>
|
|
<a name="59"><span class="lineNum"> 59 </span> : * i = i->next; // go to the next element</a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : * }</a>
|
|
<a name="61"><span class="lineNum"> 61 </span> : * \endcode</a>
|
|
<a name="62"><span class="lineNum"> 62 </span> : *</a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : * To destroy the list you have to remove all the elements,</a>
|
|
<a name="64"><span class="lineNum"> 64 </span> : * as the list is completely inplace and it doesn't allocate memory.</a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : * This can be done with the tommy_list_foreach() function.</a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : *</a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : * \code</a>
|
|
<a name="68"><span class="lineNum"> 68 </span> : * // deallocates all the objects iterating the list</a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : * tommy_list_foreach(&list, free);</a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : * \endcode</a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : */</a>
|
|
<a name="72"><span class="lineNum"> 72 </span> : </a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : #ifndef __TOMMYLIST_H</a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : #define __TOMMYLIST_H</a>
|
|
<a name="75"><span class="lineNum"> 75 </span> : </a>
|
|
<a name="76"><span class="lineNum"> 76 </span> : #include "tommytypes.h"</a>
|
|
<a name="77"><span class="lineNum"> 77 </span> : </a>
|
|
<a name="78"><span class="lineNum"> 78 </span> : /******************************************************************************/</a>
|
|
<a name="79"><span class="lineNum"> 79 </span> : /* list */</a>
|
|
<a name="80"><span class="lineNum"> 80 </span> : </a>
|
|
<a name="81"><span class="lineNum"> 81 </span> : /**</a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : * Doubly linked list type.</a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : */</a>
|
|
<a name="84"><span class="lineNum"> 84 </span> : typedef tommy_node* tommy_list;</a>
|
|
<a name="85"><span class="lineNum"> 85 </span> : </a>
|
|
<a name="86"><span class="lineNum"> 86 </span> : /**</a>
|
|
<a name="87"><span class="lineNum"> 87 </span> : * Initializes the list.</a>
|
|
<a name="88"><span class="lineNum"> 88 </span> : * The list is completely inplace, so it doesn't need to be deinitialized.</a>
|
|
<a name="89"><span class="lineNum"> 89 </span> : */</a>
|
|
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 23403 : tommy_inline void tommy_list_init(tommy_list* list)</span></a>
|
|
<a name="91"><span class="lineNum"> 91 </span> : {</a>
|
|
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 23403 : *list = 0;</span></a>
|
|
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 23403 : }</span></a>
|
|
<a name="94"><span class="lineNum"> 94 </span> : </a>
|
|
<a name="95"><span class="lineNum"> 95 </span> : /**</a>
|
|
<a name="96"><span class="lineNum"> 96 </span> : * Gets the head of the list.</a>
|
|
<a name="97"><span class="lineNum"> 97 </span> : * \return The head node. For empty lists 0 is returned.</a>
|
|
<a name="98"><span class="lineNum"> 98 </span> : */</a>
|
|
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 28869531 : tommy_inline tommy_node* tommy_list_head(tommy_list* list)</span></a>
|
|
<a name="100"><span class="lineNum"> 100 </span> : {</a>
|
|
<a name="101"><span class="lineNum"> 101 </span><span class="lineCov"> 28869531 : return *list;</span></a>
|
|
<a name="102"><span class="lineNum"> 102 </span> : }</a>
|
|
<a name="103"><span class="lineNum"> 103 </span> : </a>
|
|
<a name="104"><span class="lineNum"> 104 </span> : /**</a>
|
|
<a name="105"><span class="lineNum"> 105 </span> : * Gets the tail of the list.</a>
|
|
<a name="106"><span class="lineNum"> 106 </span> : * \return The tail node. For empty lists 0 is returned.</a>
|
|
<a name="107"><span class="lineNum"> 107 </span> : */</a>
|
|
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 2 : tommy_inline tommy_node* tommy_list_tail(tommy_list* list)</span></a>
|
|
<a name="109"><span class="lineNum"> 109 </span> : {</a>
|
|
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 2 : tommy_node* head = tommy_list_head(list);</span></a>
|
|
<a name="111"><span class="lineNum"> 111 </span> : </a>
|
|
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 2 : if (!head)</span></a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 1 : return 0;</span></a>
|
|
<a name="114"><span class="lineNum"> 114 </span> : </a>
|
|
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 1 : return head->prev;</span></a>
|
|
<a name="116"><span class="lineNum"> 116 </span> : }</a>
|
|
<a name="117"><span class="lineNum"> 117 </span> : </a>
|
|
<a name="118"><span class="lineNum"> 118 </span> : /** \internal</a>
|
|
<a name="119"><span class="lineNum"> 119 </span> : * Creates a new list with a single element.</a>
|
|
<a name="120"><span class="lineNum"> 120 </span> : * \param list The list to initialize.</a>
|
|
<a name="121"><span class="lineNum"> 121 </span> : * \param node The node to insert.</a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : */</a>
|
|
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 25182043 : tommy_inline void tommy_list_insert_first(tommy_list* list, tommy_node* node)</span></a>
|
|
<a name="124"><span class="lineNum"> 124 </span> : {</a>
|
|
<a name="125"><span class="lineNum"> 125 </span> : /* one element "circular" prev list */</a>
|
|
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 25182043 : node->prev = node;</span></a>
|
|
<a name="127"><span class="lineNum"> 127 </span> : </a>
|
|
<a name="128"><span class="lineNum"> 128 </span> : /* one element "0 terminated" next list */</a>
|
|
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 25182043 : node->next = 0;</span></a>
|
|
<a name="130"><span class="lineNum"> 130 </span> : </a>
|
|
<a name="131"><span class="lineNum"> 131 </span><span class="lineCov"> 25182043 : *list = node;</span></a>
|
|
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 25182043 : }</span></a>
|
|
<a name="133"><span class="lineNum"> 133 </span> : </a>
|
|
<a name="134"><span class="lineNum"> 134 </span> : /** \internal</a>
|
|
<a name="135"><span class="lineNum"> 135 </span> : * Inserts an element at the head of a non-empty list.</a>
|
|
<a name="136"><span class="lineNum"> 136 </span> : * The element is inserted at the head of the list. The list cannot be empty.</a>
|
|
<a name="137"><span class="lineNum"> 137 </span> : * \param list The list. The list cannot be empty.</a>
|
|
<a name="138"><span class="lineNum"> 138 </span> : * \param node The node to insert.</a>
|
|
<a name="139"><span class="lineNum"> 139 </span> : */</a>
|
|
<a name="140"><span class="lineNum"> 140 </span> : tommy_inline void tommy_list_insert_head_not_empty(tommy_list* list, tommy_node* node)</a>
|
|
<a name="141"><span class="lineNum"> 141 </span> : {</a>
|
|
<a name="142"><span class="lineNum"> 142 </span> : tommy_node* head = tommy_list_head(list);</a>
|
|
<a name="143"><span class="lineNum"> 143 </span> : </a>
|
|
<a name="144"><span class="lineNum"> 144 </span> : /* insert in the "circular" prev list */</a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : node->prev = head->prev;</a>
|
|
<a name="146"><span class="lineNum"> 146 </span> : head->prev = node;</a>
|
|
<a name="147"><span class="lineNum"> 147 </span> : </a>
|
|
<a name="148"><span class="lineNum"> 148 </span> : /* insert in the "0 terminated" next list */</a>
|
|
<a name="149"><span class="lineNum"> 149 </span> : node->next = head;</a>
|
|
<a name="150"><span class="lineNum"> 150 </span> : </a>
|
|
<a name="151"><span class="lineNum"> 151 </span> : *list = node;</a>
|
|
<a name="152"><span class="lineNum"> 152 </span> : }</a>
|
|
<a name="153"><span class="lineNum"> 153 </span> : </a>
|
|
<a name="154"><span class="lineNum"> 154 </span> : /** \internal</a>
|
|
<a name="155"><span class="lineNum"> 155 </span> : * Inserts an element at the tail of a non-empty list.</a>
|
|
<a name="156"><span class="lineNum"> 156 </span> : * The element is inserted at the tail of the list. The list cannot be empty.</a>
|
|
<a name="157"><span class="lineNum"> 157 </span> : * \param head The node at the list head. It cannot be 0.</a>
|
|
<a name="158"><span class="lineNum"> 158 </span> : * \param node The node to insert.</a>
|
|
<a name="159"><span class="lineNum"> 159 </span> : */</a>
|
|
<a name="160"><span class="lineNum"> 160 </span><span class="lineCov"> 12207710 : tommy_inline void tommy_list_insert_tail_not_empty(tommy_node* head, tommy_node* node)</span></a>
|
|
<a name="161"><span class="lineNum"> 161 </span> : {</a>
|
|
<a name="162"><span class="lineNum"> 162 </span> : /* insert in the "circular" prev list */</a>
|
|
<a name="163"><span class="lineNum"> 163 </span><span class="lineCov"> 12207710 : node->prev = head->prev;</span></a>
|
|
<a name="164"><span class="lineNum"> 164 </span><span class="lineCov"> 12207710 : head->prev = node;</span></a>
|
|
<a name="165"><span class="lineNum"> 165 </span> : </a>
|
|
<a name="166"><span class="lineNum"> 166 </span> : /* insert in the "0 terminated" next list */</a>
|
|
<a name="167"><span class="lineNum"> 167 </span><span class="lineCov"> 12207710 : node->next = 0;</span></a>
|
|
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 12207710 : node->prev->next = node;</span></a>
|
|
<a name="169"><span class="lineNum"> 169 </span><span class="lineCov"> 12207710 : }</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> : * Inserts an element at the head of a list.</a>
|
|
<a name="173"><span class="lineNum"> 173 </span> : * \param list The list.</a>
|
|
<a name="174"><span class="lineNum"> 174 </span> : * \param node The node to insert.</a>
|
|
<a name="175"><span class="lineNum"> 175 </span> : * \param data The object containing the node. It's used to set the tommy_node::data field of the node.</a>
|
|
<a name="176"><span class="lineNum"> 176 </span> : */</a>
|
|
<a name="177"><span class="lineNum"> 177 </span> : tommy_inline void tommy_list_insert_head(tommy_list* list, tommy_node* node, void* data)</a>
|
|
<a name="178"><span class="lineNum"> 178 </span> : {</a>
|
|
<a name="179"><span class="lineNum"> 179 </span> : tommy_node* head = tommy_list_head(list);</a>
|
|
<a name="180"><span class="lineNum"> 180 </span> : </a>
|
|
<a name="181"><span class="lineNum"> 181 </span> : if (head)</a>
|
|
<a name="182"><span class="lineNum"> 182 </span> : tommy_list_insert_head_not_empty(list, node);</a>
|
|
<a name="183"><span class="lineNum"> 183 </span> : else</a>
|
|
<a name="184"><span class="lineNum"> 184 </span> : tommy_list_insert_first(list, node);</a>
|
|
<a name="185"><span class="lineNum"> 185 </span> : </a>
|
|
<a name="186"><span class="lineNum"> 186 </span> : node->data = data;</a>
|
|
<a name="187"><span class="lineNum"> 187 </span> : }</a>
|
|
<a name="188"><span class="lineNum"> 188 </span> : </a>
|
|
<a name="189"><span class="lineNum"> 189 </span> : /**</a>
|
|
<a name="190"><span class="lineNum"> 190 </span> : * Inserts an element at the tail of a list.</a>
|
|
<a name="191"><span class="lineNum"> 191 </span> : * \param list The list.</a>
|
|
<a name="192"><span class="lineNum"> 192 </span> : * \param node The node to insert.</a>
|
|
<a name="193"><span class="lineNum"> 193 </span> : * \param data The object containing the node. It's used to set the tommy_node::data field of the node.</a>
|
|
<a name="194"><span class="lineNum"> 194 </span> : */</a>
|
|
<a name="195"><span class="lineNum"> 195 </span><span class="lineCov"> 20056001 : tommy_inline void tommy_list_insert_tail(tommy_list* list, tommy_node* node, void* data)</span></a>
|
|
<a name="196"><span class="lineNum"> 196 </span> : {</a>
|
|
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 20056001 : tommy_node* head = tommy_list_head(list);</span></a>
|
|
<a name="198"><span class="lineNum"> 198 </span> : </a>
|
|
<a name="199"><span class="lineNum"> 199 </span><span class="lineCov"> 20056001 : if (head)</span></a>
|
|
<a name="200"><span class="lineNum"> 200 </span><span class="lineCov"> 10139409 : tommy_list_insert_tail_not_empty(head, node);</span></a>
|
|
<a name="201"><span class="lineNum"> 201 </span> : else</a>
|
|
<a name="202"><span class="lineNum"> 202 </span><span class="lineCov"> 9916592 : tommy_list_insert_first(list, node);</span></a>
|
|
<a name="203"><span class="lineNum"> 203 </span> : </a>
|
|
<a name="204"><span class="lineNum"> 204 </span><span class="lineCov"> 20056001 : node->data = data;</span></a>
|
|
<a name="205"><span class="lineNum"> 205 </span><span class="lineCov"> 20056001 : }</span></a>
|
|
<a name="206"><span class="lineNum"> 206 </span> : </a>
|
|
<a name="207"><span class="lineNum"> 207 </span> : /**</a>
|
|
<a name="208"><span class="lineNum"> 208 </span> : * Inserts an element before the specified reference node.</a>
|
|
<a name="209"><span class="lineNum"> 209 </span> : * \param list The list.</a>
|
|
<a name="210"><span class="lineNum"> 210 </span> : * \param reference The reference node. The new node will be inserted before this node. The reference node must be in the list.</a>
|
|
<a name="211"><span class="lineNum"> 211 </span> : * \param node The node to insert.</a>
|
|
<a name="212"><span class="lineNum"> 212 </span> : * \param data The object containing the node. It's used to set the tommy_node::data field of the node.</a>
|
|
<a name="213"><span class="lineNum"> 213 </span> : */</a>
|
|
<a name="214"><span class="lineNum"> 214 </span> : tommy_inline void tommy_list_insert_before(tommy_list* list, tommy_node* reference, tommy_node* node, void* data)</a>
|
|
<a name="215"><span class="lineNum"> 215 </span> : {</a>
|
|
<a name="216"><span class="lineNum"> 216 </span> : tommy_node* head = tommy_list_head(list);</a>
|
|
<a name="217"><span class="lineNum"> 217 </span> : </a>
|
|
<a name="218"><span class="lineNum"> 218 </span> : /* if inserting before the head, update the list pointer */</a>
|
|
<a name="219"><span class="lineNum"> 219 </span> : if (head == reference) {</a>
|
|
<a name="220"><span class="lineNum"> 220 </span> : tommy_list_insert_head_not_empty(list, node);</a>
|
|
<a name="221"><span class="lineNum"> 221 </span> : } else {</a>
|
|
<a name="222"><span class="lineNum"> 222 </span> : /* insert in the "circular" prev list */</a>
|
|
<a name="223"><span class="lineNum"> 223 </span> : node->prev = reference->prev;</a>
|
|
<a name="224"><span class="lineNum"> 224 </span> : reference->prev = node;</a>
|
|
<a name="225"><span class="lineNum"> 225 </span> : </a>
|
|
<a name="226"><span class="lineNum"> 226 </span> : /* insert in the "0 terminated" next list */</a>
|
|
<a name="227"><span class="lineNum"> 227 </span> : node->next = reference;</a>
|
|
<a name="228"><span class="lineNum"> 228 </span> : node->prev->next = node;</a>
|
|
<a name="229"><span class="lineNum"> 229 </span> : }</a>
|
|
<a name="230"><span class="lineNum"> 230 </span> : </a>
|
|
<a name="231"><span class="lineNum"> 231 </span> : node->data = data;</a>
|
|
<a name="232"><span class="lineNum"> 232 </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> : * Inserts an element after the specified reference node.</a>
|
|
<a name="236"><span class="lineNum"> 236 </span> : * \param list The list.</a>
|
|
<a name="237"><span class="lineNum"> 237 </span> : * \param reference The reference node. The new node will be inserted after this node. The reference node must be in the list.</a>
|
|
<a name="238"><span class="lineNum"> 238 </span> : * \param node The node to insert.</a>
|
|
<a name="239"><span class="lineNum"> 239 </span> : * \param data The object containing the node. It's used to set the tommy_node::data field of the node.</a>
|
|
<a name="240"><span class="lineNum"> 240 </span> : */</a>
|
|
<a name="241"><span class="lineNum"> 241 </span> : tommy_inline void tommy_list_insert_after(tommy_list* list, tommy_node* reference, tommy_node* node, void* data)</a>
|
|
<a name="242"><span class="lineNum"> 242 </span> : {</a>
|
|
<a name="243"><span class="lineNum"> 243 </span> : tommy_node* head = tommy_list_head(list);</a>
|
|
<a name="244"><span class="lineNum"> 244 </span> : </a>
|
|
<a name="245"><span class="lineNum"> 245 </span> : /* if inserting after the tail (reference->next == 0), handle specially */</a>
|
|
<a name="246"><span class="lineNum"> 246 </span> : if (reference->next == 0) {</a>
|
|
<a name="247"><span class="lineNum"> 247 </span> : tommy_list_insert_tail_not_empty(head, node);</a>
|
|
<a name="248"><span class="lineNum"> 248 </span> : } else {</a>
|
|
<a name="249"><span class="lineNum"> 249 </span> : /* insert in the "circular" prev list */</a>
|
|
<a name="250"><span class="lineNum"> 250 </span> : node->prev = reference;</a>
|
|
<a name="251"><span class="lineNum"> 251 </span> : reference->next->prev = node;</a>
|
|
<a name="252"><span class="lineNum"> 252 </span> : </a>
|
|
<a name="253"><span class="lineNum"> 253 </span> : /* insert in the "0 terminated" next list */</a>
|
|
<a name="254"><span class="lineNum"> 254 </span> : node->next = reference->next;</a>
|
|
<a name="255"><span class="lineNum"> 255 </span> : reference->next = node;</a>
|
|
<a name="256"><span class="lineNum"> 256 </span> : }</a>
|
|
<a name="257"><span class="lineNum"> 257 </span> : </a>
|
|
<a name="258"><span class="lineNum"> 258 </span> : node->data = data;</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> : /**</a>
|
|
<a name="262"><span class="lineNum"> 262 </span> : * Removes an element from the list.</a>
|
|
<a name="263"><span class="lineNum"> 263 </span> : * You must already have the address of the element to remove.</a>
|
|
<a name="264"><span class="lineNum"> 264 </span> : * \note The node content is left unchanged, including the tommy_node::next</a>
|
|
<a name="265"><span class="lineNum"> 265 </span> : * and tommy_node::prev fields that still contain pointers **in** the list.</a>
|
|
<a name="266"><span class="lineNum"> 266 </span> : * \param list The list.</a>
|
|
<a name="267"><span class="lineNum"> 267 </span> : * \param node The node to remove. The node must be in the list.</a>
|
|
<a name="268"><span class="lineNum"> 268 </span> : * \return The tommy_node::data field of the node removed.</a>
|
|
<a name="269"><span class="lineNum"> 269 </span> : */</a>
|
|
<a name="270"><span class="lineNum"> 270 </span><span class="lineCov"> 365000 : tommy_inline void* tommy_list_remove_existing(tommy_list* list, tommy_node* node)</span></a>
|
|
<a name="271"><span class="lineNum"> 271 </span> : {</a>
|
|
<a name="272"><span class="lineNum"> 272 </span><span class="lineCov"> 365000 : tommy_node* head = tommy_list_head(list);</span></a>
|
|
<a name="273"><span class="lineNum"> 273 </span> : </a>
|
|
<a name="274"><span class="lineNum"> 274 </span> : /* remove from the "circular" prev list */</a>
|
|
<a name="275"><span class="lineNum"> 275 </span><span class="lineCov"> 365000 : if (node->next)</span></a>
|
|
<a name="276"><span class="lineNum"> 276 </span><span class="lineCov"> 123294 : node->next->prev = node->prev;</span></a>
|
|
<a name="277"><span class="lineNum"> 277 </span> : else</a>
|
|
<a name="278"><span class="lineNum"> 278 </span><span class="lineCov"> 241706 : head->prev = node->prev; /* the last */</span></a>
|
|
<a name="279"><span class="lineNum"> 279 </span> : </a>
|
|
<a name="280"><span class="lineNum"> 280 </span> : /* remove from the "0 terminated" next list */</a>
|
|
<a name="281"><span class="lineNum"> 281 </span><span class="lineCov"> 365000 : if (head == node)</span></a>
|
|
<a name="282"><span class="lineNum"> 282 </span><span class="lineCov"> 260765 : *list = node->next; /* the new head, in case 0 */</span></a>
|
|
<a name="283"><span class="lineNum"> 283 </span> : else</a>
|
|
<a name="284"><span class="lineNum"> 284 </span><span class="lineCov"> 104235 : node->prev->next = node->next;</span></a>
|
|
<a name="285"><span class="lineNum"> 285 </span> : </a>
|
|
<a name="286"><span class="lineNum"> 286 </span><span class="lineCov"> 365000 : return node->data;</span></a>
|
|
<a name="287"><span class="lineNum"> 287 </span> : }</a>
|
|
<a name="288"><span class="lineNum"> 288 </span> : </a>
|
|
<a name="289"><span class="lineNum"> 289 </span> : /**</a>
|
|
<a name="290"><span class="lineNum"> 290 </span> : * Concats two lists.</a>
|
|
<a name="291"><span class="lineNum"> 291 </span> : * The second list is concatenated at the first list.</a>
|
|
<a name="292"><span class="lineNum"> 292 </span> : * \param first The first list.</a>
|
|
<a name="293"><span class="lineNum"> 293 </span> : * \param second The second list. After this call the list content is undefined,</a>
|
|
<a name="294"><span class="lineNum"> 294 </span> : * and you should not use it anymore.</a>
|
|
<a name="295"><span class="lineNum"> 295 </span> : */</a>
|
|
<a name="296"><span class="lineNum"> 296 </span><span class="lineCov"> 79280 : tommy_inline void tommy_list_concat(tommy_list* first, tommy_list* second)</span></a>
|
|
<a name="297"><span class="lineNum"> 297 </span> : {</a>
|
|
<a name="298"><span class="lineNum"> 298 </span> : tommy_node* first_head;</a>
|
|
<a name="299"><span class="lineNum"> 299 </span> : tommy_node* first_tail;</a>
|
|
<a name="300"><span class="lineNum"> 300 </span> : tommy_node* second_head;</a>
|
|
<a name="301"><span class="lineNum"> 301 </span> : </a>
|
|
<a name="302"><span class="lineNum"> 302 </span> : /* if the second is empty, nothing to do */</a>
|
|
<a name="303"><span class="lineNum"> 303 </span><span class="lineCov"> 79280 : second_head = tommy_list_head(second);</span></a>
|
|
<a name="304"><span class="lineNum"> 304 </span><span class="lineCov"> 79280 : if (second_head == 0)</span></a>
|
|
<a name="305"><span class="lineNum"> 305 </span><span class="lineCov"> 70191 : return;</span></a>
|
|
<a name="306"><span class="lineNum"> 306 </span> : </a>
|
|
<a name="307"><span class="lineNum"> 307 </span> : /* if the first is empty, copy the second */</a>
|
|
<a name="308"><span class="lineNum"> 308 </span><span class="lineCov"> 9089 : first_head = tommy_list_head(first);</span></a>
|
|
<a name="309"><span class="lineNum"> 309 </span><span class="lineCov"> 9089 : if (first_head == 0) {</span></a>
|
|
<a name="310"><span class="lineNum"> 310 </span><span class="lineCov"> 8045 : *first = *second;</span></a>
|
|
<a name="311"><span class="lineNum"> 311 </span><span class="lineCov"> 8045 : return;</span></a>
|
|
<a name="312"><span class="lineNum"> 312 </span> : }</a>
|
|
<a name="313"><span class="lineNum"> 313 </span> : </a>
|
|
<a name="314"><span class="lineNum"> 314 </span> : /* tail of the first list */</a>
|
|
<a name="315"><span class="lineNum"> 315 </span><span class="lineCov"> 1044 : first_tail = first_head->prev;</span></a>
|
|
<a name="316"><span class="lineNum"> 316 </span> : </a>
|
|
<a name="317"><span class="lineNum"> 317 </span> : /* set the "circular" prev list */</a>
|
|
<a name="318"><span class="lineNum"> 318 </span><span class="lineCov"> 1044 : first_head->prev = second_head->prev;</span></a>
|
|
<a name="319"><span class="lineNum"> 319 </span><span class="lineCov"> 1044 : second_head->prev = first_tail;</span></a>
|
|
<a name="320"><span class="lineNum"> 320 </span> : </a>
|
|
<a name="321"><span class="lineNum"> 321 </span> : /* set the "0 terminated" next list */</a>
|
|
<a name="322"><span class="lineNum"> 322 </span><span class="lineCov"> 1044 : first_tail->next = second_head;</span></a>
|
|
<a name="323"><span class="lineNum"> 323 </span> : }</a>
|
|
<a name="324"><span class="lineNum"> 324 </span> : </a>
|
|
<a name="325"><span class="lineNum"> 325 </span> : /**</a>
|
|
<a name="326"><span class="lineNum"> 326 </span> : * Sorts a list.</a>
|
|
<a name="327"><span class="lineNum"> 327 </span> : * It's a stable merge sort with O(N*log(N)) worst complexity.</a>
|
|
<a name="328"><span class="lineNum"> 328 </span> : * It's faster on degenerated cases like partially ordered lists.</a>
|
|
<a name="329"><span class="lineNum"> 329 </span> : * \param cmp Compare function called with two elements.</a>
|
|
<a name="330"><span class="lineNum"> 330 </span> : * The function should return <0 if the first element is less than the second, ==0 if equal, and >0 if greater.</a>
|
|
<a name="331"><span class="lineNum"> 331 </span> : */</a>
|
|
<a name="332"><span class="lineNum"> 332 </span> : TOMMY_API void tommy_list_sort(tommy_list* list, tommy_compare_func* cmp);</a>
|
|
<a name="333"><span class="lineNum"> 333 </span> : </a>
|
|
<a name="334"><span class="lineNum"> 334 </span> : /**</a>
|
|
<a name="335"><span class="lineNum"> 335 </span> : * Checks if empty.</a>
|
|
<a name="336"><span class="lineNum"> 336 </span> : * \return If the list is empty.</a>
|
|
<a name="337"><span class="lineNum"> 337 </span> : */</a>
|
|
<a name="338"><span class="lineNum"> 338 </span><span class="lineCov"> 9685 : tommy_inline tommy_bool_t tommy_list_empty(tommy_list* list)</span></a>
|
|
<a name="339"><span class="lineNum"> 339 </span> : {</a>
|
|
<a name="340"><span class="lineNum"> 340 </span><span class="lineCov"> 9685 : return tommy_list_head(list) == 0;</span></a>
|
|
<a name="341"><span class="lineNum"> 341 </span> : }</a>
|
|
<a name="342"><span class="lineNum"> 342 </span> : </a>
|
|
<a name="343"><span class="lineNum"> 343 </span> : /**</a>
|
|
<a name="344"><span class="lineNum"> 344 </span> : * Gets the number of elements.</a>
|
|
<a name="345"><span class="lineNum"> 345 </span> : * \note This operation is O(n).</a>
|
|
<a name="346"><span class="lineNum"> 346 </span> : */</a>
|
|
<a name="347"><span class="lineNum"> 347 </span><span class="lineCov"> 491 : tommy_inline tommy_size_t tommy_list_count(tommy_list* list)</span></a>
|
|
<a name="348"><span class="lineNum"> 348 </span> : {</a>
|
|
<a name="349"><span class="lineNum"> 349 </span><span class="lineCov"> 491 : tommy_size_t count = 0;</span></a>
|
|
<a name="350"><span class="lineNum"> 350 </span><span class="lineCov"> 491 : tommy_node* i = tommy_list_head(list);</span></a>
|
|
<a name="351"><span class="lineNum"> 351 </span> : </a>
|
|
<a name="352"><span class="lineNum"> 352 </span><span class="lineCov"> 72005 : while (i) {</span></a>
|
|
<a name="353"><span class="lineNum"> 353 </span><span class="lineCov"> 71514 : ++count;</span></a>
|
|
<a name="354"><span class="lineNum"> 354 </span><span class="lineCov"> 71514 : i = i->next;</span></a>
|
|
<a name="355"><span class="lineNum"> 355 </span> : }</a>
|
|
<a name="356"><span class="lineNum"> 356 </span> : </a>
|
|
<a name="357"><span class="lineNum"> 357 </span><span class="lineCov"> 491 : return count;</span></a>
|
|
<a name="358"><span class="lineNum"> 358 </span> : }</a>
|
|
<a name="359"><span class="lineNum"> 359 </span> : </a>
|
|
<a name="360"><span class="lineNum"> 360 </span> : /**</a>
|
|
<a name="361"><span class="lineNum"> 361 </span> : * Calls the specified function for each element in the list.</a>
|
|
<a name="362"><span class="lineNum"> 362 </span> : *</a>
|
|
<a name="363"><span class="lineNum"> 363 </span> : * You cannot add or remove elements from the inside of the callback,</a>
|
|
<a name="364"><span class="lineNum"> 364 </span> : * but can use it to deallocate them.</a>
|
|
<a name="365"><span class="lineNum"> 365 </span> : *</a>
|
|
<a name="366"><span class="lineNum"> 366 </span> : * \code</a>
|
|
<a name="367"><span class="lineNum"> 367 </span> : * tommy_list list;</a>
|
|
<a name="368"><span class="lineNum"> 368 </span> : *</a>
|
|
<a name="369"><span class="lineNum"> 369 </span> : * // initializes the list</a>
|
|
<a name="370"><span class="lineNum"> 370 </span> : * tommy_list_init(&list);</a>
|
|
<a name="371"><span class="lineNum"> 371 </span> : *</a>
|
|
<a name="372"><span class="lineNum"> 372 </span> : * ...</a>
|
|
<a name="373"><span class="lineNum"> 373 </span> : *</a>
|
|
<a name="374"><span class="lineNum"> 374 </span> : * // creates an object</a>
|
|
<a name="375"><span class="lineNum"> 375 </span> : * struct object* obj = malloc(sizeof(struct object));</a>
|
|
<a name="376"><span class="lineNum"> 376 </span> : *</a>
|
|
<a name="377"><span class="lineNum"> 377 </span> : * ...</a>
|
|
<a name="378"><span class="lineNum"> 378 </span> : *</a>
|
|
<a name="379"><span class="lineNum"> 379 </span> : * // insert it in the list</a>
|
|
<a name="380"><span class="lineNum"> 380 </span> : * tommy_list_insert_tail(&list, &obj->node, obj);</a>
|
|
<a name="381"><span class="lineNum"> 381 </span> : *</a>
|
|
<a name="382"><span class="lineNum"> 382 </span> : * ...</a>
|
|
<a name="383"><span class="lineNum"> 383 </span> : *</a>
|
|
<a name="384"><span class="lineNum"> 384 </span> : * // deallocates all the objects iterating the list</a>
|
|
<a name="385"><span class="lineNum"> 385 </span> : * tommy_list_foreach(&list, free);</a>
|
|
<a name="386"><span class="lineNum"> 386 </span> : * \endcode</a>
|
|
<a name="387"><span class="lineNum"> 387 </span> : */</a>
|
|
<a name="388"><span class="lineNum"> 388 </span><span class="lineCov"> 18348 : tommy_inline void tommy_list_foreach(tommy_list* list, tommy_foreach_func* func)</span></a>
|
|
<a name="389"><span class="lineNum"> 389 </span> : {</a>
|
|
<a name="390"><span class="lineNum"> 390 </span><span class="lineCov"> 18348 : tommy_node* node = tommy_list_head(list);</span></a>
|
|
<a name="391"><span class="lineNum"> 391 </span> : </a>
|
|
<a name="392"><span class="lineNum"> 392 </span><span class="lineCov"> 4146369 : while (node) {</span></a>
|
|
<a name="393"><span class="lineNum"> 393 </span><span class="lineCov"> 4128021 : void* data = node->data;</span></a>
|
|
<a name="394"><span class="lineNum"> 394 </span><span class="lineCov"> 4128021 : node = node->next;</span></a>
|
|
<a name="395"><span class="lineNum"> 395 </span><span class="lineCov"> 4128021 : func(data);</span></a>
|
|
<a name="396"><span class="lineNum"> 396 </span> : }</a>
|
|
<a name="397"><span class="lineNum"> 397 </span><span class="lineCov"> 18348 : }</span></a>
|
|
<a name="398"><span class="lineNum"> 398 </span> : </a>
|
|
<a name="399"><span class="lineNum"> 399 </span> : /**</a>
|
|
<a name="400"><span class="lineNum"> 400 </span> : * Calls the specified function with an argument for each element in the list.</a>
|
|
<a name="401"><span class="lineNum"> 401 </span> : */</a>
|
|
<a name="402"><span class="lineNum"> 402 </span><span class="lineCov"> 5 : tommy_inline void tommy_list_foreach_arg(tommy_list* list, tommy_foreach_arg_func* func, void* arg)</span></a>
|
|
<a name="403"><span class="lineNum"> 403 </span> : {</a>
|
|
<a name="404"><span class="lineNum"> 404 </span><span class="lineCov"> 5 : tommy_node* node = tommy_list_head(list);</span></a>
|
|
<a name="405"><span class="lineNum"> 405 </span> : </a>
|
|
<a name="406"><span class="lineNum"> 406 </span><span class="lineCov"> 11272 : while (node) {</span></a>
|
|
<a name="407"><span class="lineNum"> 407 </span><span class="lineCov"> 11267 : void* data = node->data;</span></a>
|
|
<a name="408"><span class="lineNum"> 408 </span><span class="lineCov"> 11267 : node = node->next;</span></a>
|
|
<a name="409"><span class="lineNum"> 409 </span><span class="lineCov"> 11267 : func(arg, data);</span></a>
|
|
<a name="410"><span class="lineNum"> 410 </span> : }</a>
|
|
<a name="411"><span class="lineNum"> 411 </span><span class="lineCov"> 5 : }</span></a>
|
|
<a name="412"><span class="lineNum"> 412 </span> : </a>
|
|
<a name="413"><span class="lineNum"> 413 </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>
|