<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>pcsc-lite: simclist.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">pcsc-lite
 <span id="projectnumber">1.8.26</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">simclist.c</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2007,2008,2009,2010,2011 Mij <mij@bitchx.it></span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * Permission to use, copy, modify, and distribute this software for any</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * purpose with or without fee is hereby granted, provided that the above</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * copyright notice and this permission notice appear in all copies.</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> *</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> */</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">/*</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * SimCList library. See http://mij.oltrelinux.com/devel/simclist</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> */</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">/* SimCList implementation, version 1.6 */</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <stdlib.h></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <string.h></span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <errno.h></span> <span class="comment">/* for setting errno */</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <sys/types.h></span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#ifndef _WIN32</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="comment">/* not in Windows! */</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor"># include <unistd.h></span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor"># include <stdint.h></span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef SIMCLIST_NO_DUMPRESTORE</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">/* includes for dump/restore */</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor"># include <time.h></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor"># include <sys/uio.h></span> <span class="comment">/* for READ_ERRCHECK() and write() */</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor"># include <fcntl.h></span> <span class="comment">/* for open() etc */</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor"># ifndef _WIN32</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor"># include <arpa/inet.h></span> <span class="comment">/* for htons() on UNIX */</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor"># else</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor"># include <winsock2.h></span> <span class="comment">/* for htons() on Windows */</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">/* disable asserts */</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#ifndef SIMCLIST_DEBUG</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#ifndef NDEBUG</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#define NDEBUG</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#include <assert.h></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#include <sys/stat.h></span> <span class="comment">/* for open()'s access modes S_IRUSR etc */</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#include <limits.h></span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#if defined(_MSC_VER) || defined(__MINGW32__)</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">/* provide gettimeofday() missing in Windows */</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="keywordtype">int</span> gettimeofday(<span class="keyword">struct</span> timeval *tp, <span class="keywordtype">void</span> *tzp) {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  DWORD t;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">/* XSI says: "If tzp is not a null pointer, the behavior is unspecified" */</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  assert(tzp == NULL);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  t = timeGetTime();</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  tp->tv_sec = t / 1000;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  tp->tv_usec = t % 1000;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> }</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">/* work around lack of inttypes.h support in broken Microsoft Visual Studio compilers */</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor">#if !defined(_WIN32) || !defined(_MSC_VER)</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor"># include <inttypes.h></span> <span class="comment">/* (u)int*_t */</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"># include <basetsd.h></span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="keyword">typedef</span> UINT8 uint8_t;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="keyword">typedef</span> UINT16 uint16_t;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">typedef</span> ULONG32 uint32_t;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">typedef</span> UINT64 uint64_t;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">typedef</span> INT8 int8_t;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">typedef</span> INT16 int16_t;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">typedef</span> LONG32 int32_t;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">typedef</span> INT64 int64_t;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">/* define some commodity macros for Dump/Restore functionality */</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="preprocessor">#ifndef SIMCLIST_NO_DUMPRESTORE</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">/* write() decorated with error checking logic */</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor">#define WRITE_ERRCHECK(fd, msgbuf, msglen) do { \</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor"> if (write(fd, msgbuf, msglen) < 0) return -1; \</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor"> } while (0);</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">/* READ_ERRCHECK() decorated with error checking logic */</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#define READ_ERRCHECK(fd, msgbuf, msglen) do { \</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor"> if (read(fd, msgbuf, msglen) != msglen) { \</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor"> </span><span class="comment">/*errno = EPROTO;*/</span><span class="preprocessor"> \</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="preprocessor"> return -1; \</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="preprocessor"> } while (0);</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">/* convert 64bit integers from host to network format */</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor">#define hton64(x) (\</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="preprocessor"> htons(1) == 1 ? \</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="preprocessor"> (uint64_t)x </span><span class="comment">/* big endian */</span><span class="preprocessor"> \</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="preprocessor"> : </span><span class="comment">/* little endian */</span><span class="preprocessor"> \</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="preprocessor"> ((uint64_t)((((uint64_t)(x) & 0xff00000000000000ULL) >> 56) | \</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor"> (((uint64_t)(x) & 0x00ff000000000000ULL) >> 40) | \</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="preprocessor"> (((uint64_t)(x) & 0x0000ff0000000000ULL) >> 24) | \</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor"> (((uint64_t)(x) & 0x000000ff00000000ULL) >> 8) | \</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor"> (((uint64_t)(x) & 0x00000000ff000000ULL) << 8) | \</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor"> (((uint64_t)(x) & 0x0000000000ff0000ULL) << 24) | \</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor"> (((uint64_t)(x) & 0x000000000000ff00ULL) << 40) | \</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor"> (((uint64_t)(x) & 0x00000000000000ffULL) << 56))) \</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"> )</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">/* convert 64bit integers from network to host format */</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="preprocessor">#define ntoh64(x) (hton64(x))</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">/* some OSes don't have EPROTO (eg OpenBSD) */</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor">#ifndef EPROTO</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor">#define EPROTO EIO</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="preprocessor">#ifdef SIMCLIST_WITH_THREADS</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">/* limit (approx) to the number of threads running</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> * for threaded operations. Only meant when</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> * SIMCLIST_WITH_THREADS is defined */</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor">#define SIMCLIST_MAXTHREADS 2</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment">/*</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> * how many elems to keep as spare. During a deletion, an element</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> * can be saved in a "free-list", not free()d immediately. When</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> * latter insertions are performed, spare elems can be used instead</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> * of malloc()ing new elems.</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> *</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> * about this param, some values for appending</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> * 10 million elems into an empty list:</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> * (#, time[sec], gain[%], gain/no[%])</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"> * 0 2,164 0,00 0,00 <-- feature disabled</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"> * 1 1,815 34,9 34,9</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> * 2 1,446 71,8 35,9 <-- MAX gain/no</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> * 3 1,347 81,7 27,23</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"> * 5 1,213 95,1 19,02</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"> * 8 1,064 110,0 13,75</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"> * 10 1,015 114,9 11,49 <-- MAX gain w/ likely sol</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"> * 15 1,019 114,5 7,63</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> * 25 0,985 117,9 4,72</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> * 50 1,088 107,6 2,15</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> * 75 1,016 114,8 1,53</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> * 100 0,988 117,6 1,18</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> * 150 1,022 114,2 0,76</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> * 200 0,939 122,5 0,61 <-- MIN time</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> */</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor">#ifndef SIMCLIST_MAX_SPARE_ELEMS</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="preprocessor">#define SIMCLIST_MAX_SPARE_ELEMS 5</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="preprocessor">#ifdef SIMCLIST_WITH_THREADS</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="preprocessor">#include <pthread.h></span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor">#include "simclist.h"</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment">/* minumum number of elements for sorting with quicksort instead of insertion */</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="preprocessor">#define SIMCLIST_MINQUICKSORTELS 24</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment">/* list dump declarations */</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor">#define SIMCLIST_DUMPFORMAT_VERSION 1 </span><span class="comment">/* (short integer) version of fileformat managed by _dump* and _restore* functions */</span><span class="preprocessor"></span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="preprocessor">#define SIMCLIST_DUMPFORMAT_HEADERLEN 30 </span><span class="comment">/* length of the header */</span><span class="preprocessor"></span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment">/* header for a list dump */</span></div><div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="structlist__dump__header__s.html"> 181</a></span> <span class="keyword">struct </span><a class="code" href="structlist__dump__header__s.html">list_dump_header_s</a> {</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  uint16_t ver; <span class="comment">/* version */</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  int32_t timestamp_sec; <span class="comment">/* dump timestamp, seconds since UNIX Epoch */</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  int32_t timestamp_usec; <span class="comment">/* dump timestamp, microseconds since timestamp_sec */</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  int32_t rndterm; <span class="comment">/* random value terminator -- terminates the data sequence */</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  uint32_t totlistlen; <span class="comment">/* sum of every element' size, bytes */</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  uint32_t numels; <span class="comment">/* number of elements */</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  uint32_t elemlen; <span class="comment">/* bytes length of an element, for constant-size lists, <= 0 otherwise */</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  int32_t listhash; <span class="comment">/* hash of the list at the time of dumping, or 0 if to be ignored */</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> };</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment">/* deletes tmp from list, with care wrt its position (head, tail, middle) */</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="keyword">static</span> <span class="keywordtype">int</span> list_drop_elem(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *tmp, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment">/* set default values for initialized lists */</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="keyword">static</span> <span class="keywordtype">int</span> list_attributes_setdefaults(<a class="code" href="structlist__t.html">list_t</a> *restrict l);</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="preprocessor">#ifndef NDEBUG</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment">/* check whether the list internal REPresentation is valid -- Costs O(n) */</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="keyword">static</span> <span class="keywordtype">int</span> list_repOk(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment">/* check whether the list attribute set is valid -- Costs O(1) */</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="keyword">static</span> <span class="keywordtype">int</span> list_attrOk(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment">/* do not inline, this is recursive */</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="keyword">static</span> <span class="keywordtype">void</span> list_sort_quicksort(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> versus,</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> first, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *fel,</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> last, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *lel);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> list_sort_selectionsort(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> versus,</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> first, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *fel,</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> last, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *lel);</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="keyword">static</span> <span class="keywordtype">void</span> *list_get_minmax(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> versus);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *list_findpos(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> posstart);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment">/*</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> * Random Number Generator</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> *</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> * The user is expected to seed the RNG (ie call srand()) if</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> * SIMCLIST_SYSTEM_RNG is defined.</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> *</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> * Otherwise, a self-contained RNG based on LCG is used; see</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> * http://en.wikipedia.org/wiki/Linear_congruential_generator .</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> *</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"> * Facts pro local RNG:</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"> * 1. no need for the user to call srand() on his own</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> * 2. very fast, possibly faster than OS</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"> * 3. avoid interference with user's RNG</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"> *</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> * Facts pro system RNG:</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"> * 1. may be more accurate (irrelevant for SimCList randno purposes)</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> * 2. why reinvent the wheel</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"> *</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment"> * Default to local RNG for user's ease of use.</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"> */</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="preprocessor">#ifdef SIMCLIST_SYSTEM_RNG</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment">/* keep track whether we initialized already (non-0) or not (0) */</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="keyword">static</span> <span class="keywordtype">unsigned</span> random_seed = 0;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment">/* use local RNG */</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> seed_random(<span class="keywordtype">void</span>) {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (random_seed == 0)</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  random_seed = (unsigned)getpid() ^ (unsigned)time(NULL);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> </div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">long</span> get_random(<span class="keywordtype">void</span>) {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  random_seed = (1664525 * random_seed + 1013904223);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">return</span> random_seed;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> }</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> </div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment">/* use OS's random generator */</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="preprocessor"># define seed_random()</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="preprocessor"># define get_random() (rand())</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> </div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment">/* list initialization */</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="keywordtype">int</span> list_init(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span> (l == NULL) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  memset(l, 0, <span class="keyword">sizeof</span> *l);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  seed_random();</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  l->numels = 0;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> </div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">/* head/tail sentinels and mid pointer */</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  l->head_sentinel = (<span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *)malloc(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a>));</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  l->tail_sentinel = (<span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *)malloc(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a>));</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (NULL == l->tail_sentinel || NULL == l->head_sentinel)</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  l->head_sentinel->next = l->tail_sentinel;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  l->tail_sentinel->prev = l->head_sentinel;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  l->head_sentinel->prev = l->tail_sentinel->next = l->mid = NULL;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  l->head_sentinel->data = l->tail_sentinel->data = NULL;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">/* iteration attributes */</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  l->iter_active = 0;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  l->iter_pos = 0;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  l->iter_curentry = NULL;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">/* free-list attributes */</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  l->spareels = (<span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> **)malloc(SIMCLIST_MAX_SPARE_ELEMS * <span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *));</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  l->spareelsnum = 0;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (NULL == l->spareels)</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="preprocessor">#ifdef SIMCLIST_WITH_THREADS</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  l->threadcount = 0;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">if</span> (list_attributes_setdefaults(l))</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  assert(list_repOk(l));</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> </div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="keywordtype">void</span> list_destroy(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  list_clear(l);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span> (i = 0; i < l->spareelsnum; i++) {</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  free(l->spareels[i]);</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  }</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  free(l->spareels);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  free(l->head_sentinel);</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  free(l->tail_sentinel);</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="keywordtype">int</span> list_attributes_setdefaults(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  l->attrs.comparator = NULL;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  l->attrs.seeker = NULL;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">/* also free() element data when removing and element from the list */</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  l->attrs.meter = NULL;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  l->attrs.copy_data = 0;</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  l->attrs.hasher = NULL;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">/* serializer/unserializer */</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  l->attrs.serializer = NULL;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  l->attrs.unserializer = NULL;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment">/* setting list properties */</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="keywordtype">int</span> list_attributes_comparator(<a class="code" href="structlist__t.html">list_t</a> *restrict l, element_comparator comparator_fun) {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">if</span> (l == NULL) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  l->attrs.comparator = comparator_fun;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="keywordtype">int</span> list_attributes_seeker(<a class="code" href="structlist__t.html">list_t</a> *restrict l, element_seeker seeker_fun) {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">if</span> (l == NULL) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  l->attrs.seeker = seeker_fun;</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="keywordtype">int</span> list_attributes_copy(<a class="code" href="structlist__t.html">list_t</a> *restrict l, element_meter metric_fun, <span class="keywordtype">int</span> copy_data) {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">if</span> (l == NULL || (metric_fun == NULL && copy_data != 0)) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> </div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  l->attrs.meter = metric_fun;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  l->attrs.copy_data = copy_data;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> }</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="keywordtype">int</span> list_attributes_hash_computer(<a class="code" href="structlist__t.html">list_t</a> *restrict l, element_hash_computer hash_computer_fun) {</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> (l == NULL) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  l->attrs.hasher = hash_computer_fun;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> }</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> </div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="keywordtype">int</span> list_attributes_serializer(<a class="code" href="structlist__t.html">list_t</a> *restrict l, element_serializer serializer_fun) {</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">if</span> (l == NULL) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  l->attrs.serializer = serializer_fun;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="keywordtype">int</span> list_attributes_unserializer(<a class="code" href="structlist__t.html">list_t</a> *restrict l, element_unserializer unserializer_fun) {</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (l == NULL) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> </div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  l->attrs.unserializer = unserializer_fun;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  assert(list_attrOk(l));</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="keywordtype">int</span> list_append(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">void</span> *data) {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">return</span> list_insert_at(l, data, l->numels);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="keywordtype">int</span> list_prepend(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">void</span> *data) {</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">return</span> list_insert_at(l, data, 0);</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="keywordtype">void</span> *list_fetch(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">return</span> list_extract_at(l, 0);</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> }</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> </div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="keywordtype">void</span> *list_get_at(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos) {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *tmp;</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> </div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  tmp = list_findpos(l, pos);</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">return</span> (tmp != NULL ? tmp->data : NULL);</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="keywordtype">void</span> *list_get_max(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">return</span> list_get_minmax(l, +1);</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> }</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="keywordtype">void</span> *list_get_min(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">return</span> list_get_minmax(l, -1);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> }</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment">/* REQUIRES {list->numels >= 1}</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment"> * return the min (versus < 0) or max value (v > 0) in l */</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="keyword">static</span> <span class="keywordtype">void</span> *list_get_minmax(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> versus) {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordtype">void</span> *curminmax;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *s;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">if</span> (l->attrs.comparator == NULL || l->numels == 0)</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> </div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  curminmax = l->head_sentinel->next->data;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordflow">for</span> (s = l->head_sentinel->next->next; s != l->tail_sentinel; s = s->next) {</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">if</span> (l->attrs.comparator(curminmax, s->data) * versus > 0)</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  curminmax = s->data;</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  }</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> </div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">return</span> curminmax;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> }</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> </div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment">/* set tmp to point to element at index posstart in l */</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *list_findpos(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> posstart) {</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *ptr;</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordtype">float</span> x;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">if</span> (NULL == l->head_sentinel || NULL == l->tail_sentinel)</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">/* accept 1 slot overflow for fetching head and tail sentinels */</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">if</span> (posstart < -1 || posstart > (<span class="keywordtype">int</span>)l->numels) <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">if</span>( l->numels != 0 )</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  x = (float)(posstart+1) / l->numels;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  x = 1;</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">if</span> (x <= 0.25) {</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">/* first quarter: get to posstart from head */</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">for</span> (i = -1, ptr = l->head_sentinel; i < posstart; ptr = ptr->next, i++);</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x < 0.5) {</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">/* second quarter: get to posstart from mid */</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">for</span> (i = (l->numels-1)/2, ptr = l->mid; i > posstart; ptr = ptr->prev, i--);</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x <= 0.75) {</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">/* third quarter: get to posstart from mid */</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">for</span> (i = (l->numels-1)/2, ptr = l->mid; i < posstart; ptr = ptr->next, i++);</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">/* fourth quarter: get to posstart from tail */</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (i = l->numels, ptr = l->tail_sentinel; i > posstart; ptr = ptr->prev, i--);</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> </div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">return</span> ptr;</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> }</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> </div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="keywordtype">void</span> *list_extract_at(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos) {</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *tmp;</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordtype">void</span> *data;</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> </div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">if</span> (l->iter_active || pos >= l->numels) <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> </div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  tmp = list_findpos(l, pos);</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">if</span> (NULL == tmp)</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  data = tmp->data;</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> </div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  tmp->data = NULL; <span class="comment">/* save data from list_drop_elem() free() */</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  list_drop_elem(l, tmp, pos);</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  l->numels--;</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  assert(list_repOk(l));</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">return</span> data;</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> }</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> </div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="keywordtype">int</span> list_insert_at(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">void</span> *data, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos) {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *lent, *succ, *prec;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (l->iter_active || pos > l->numels) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> </div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">/* this code optimizes malloc() with a free-list */</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (l->spareelsnum > 0) {</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  lent = l->spareels[l->spareelsnum-1];</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  l->spareelsnum--;</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  lent = (<span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *)malloc(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a>));</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">if</span> (lent == NULL)</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">if</span> (l->attrs.copy_data) {</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="comment">/* make room for user' data (has to be copied) */</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordtype">size_t</span> datalen = l->attrs.meter(data);</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  lent->data = (<span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *)malloc(datalen);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">if</span> (NULL == lent->data)</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  {</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  free(lent);</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  memcpy(lent->data, data, datalen);</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  lent->data = (<span class="keywordtype">void</span>*)data;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">/* actually append element */</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  prec = list_findpos(l, pos-1);</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">if</span> (NULL == prec)</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  free(lent->data);</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  free(lent);</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  }</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  succ = prec->next;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> </div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  prec->next = lent;</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  lent->prev = prec;</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  lent->next = succ;</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  succ->prev = lent;</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  l->numels++;</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> </div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">/* fix mid pointer */</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">if</span> (l->numels == 1) { <span class="comment">/* first element, set pointer */</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  l->mid = lent;</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (l->numels % 2) { <span class="comment">/* now odd */</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">if</span> (pos >= (l->numels-1)/2) l->mid = l->mid->next;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  } <span class="keywordflow">else</span> { <span class="comment">/* now even */</span></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">if</span> (pos <= (l->numels-1)/2) l->mid = l->mid->prev;</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> </div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  assert(list_repOk(l));</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> }</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="keywordtype">int</span> list_delete(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">void</span> *data) {</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordtype">int</span> pos, r;</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> </div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  pos = list_locate(l, data);</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">if</span> (pos < 0)</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> </div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  r = list_delete_at(l, pos);</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">if</span> (r < 0)</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  assert(list_repOk(l));</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> </div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> }</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> </div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="keywordtype">int</span> list_delete_at(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos) {</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *delendo;</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> </div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> </div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">if</span> (l->iter_active || pos >= l->numels) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  delendo = list_findpos(l, pos);</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  list_drop_elem(l, delendo, pos);</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  l->numels--;</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> </div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> </div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  assert(list_repOk(l));</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> }</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> </div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="keywordtype">int</span> list_delete_range(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> posstart, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> posend) {</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *lastvalid, *tmp, *tmp2;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> numdel, midposafter, i;</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordtype">int</span> movedx;</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> </div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">if</span> (l->iter_active || posend < posstart || posend >= l->numels) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  numdel = posend - posstart + 1;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">if</span> (numdel == l->numels) <span class="keywordflow">return</span> list_clear(l);</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> </div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  tmp = list_findpos(l, posstart); <span class="comment">/* first el to be deleted */</span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  lastvalid = tmp->prev; <span class="comment">/* last valid element */</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> </div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  midposafter = (l->numels-1-numdel)/2;</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> </div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  midposafter = midposafter < posstart ? midposafter : midposafter+numdel;</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  movedx = midposafter - (l->numels-1)/2;</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordflow">if</span> (movedx > 0) { <span class="comment">/* move right */</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordflow">for</span> (i = 0; i < (<span class="keywordtype">unsigned</span> int)movedx; l->mid = l->mid->next, i++);</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  } <span class="keywordflow">else</span> { <span class="comment">/* move left */</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  movedx = -movedx;</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keywordflow">for</span> (i = 0; i < (<span class="keywordtype">unsigned</span> int)movedx; l->mid = l->mid->prev, i++);</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  assert(posstart == 0 || lastvalid != l->head_sentinel);</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  i = posstart;</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (l->attrs.copy_data) {</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">/* also free element data */</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordflow">for</span> (; i <= posend; i++) {</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  tmp2 = tmp;</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  tmp = tmp->next;</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">if</span> (tmp2->data != NULL) free(tmp2->data);</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">if</span> (l->spareelsnum < SIMCLIST_MAX_SPARE_ELEMS) {</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  l->spareels[l->spareelsnum++] = tmp2;</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  free(tmp2);</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  }</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  }</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">/* only free containers */</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">for</span> (; i <= posend; i++) {</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  tmp2 = tmp;</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  tmp = tmp->next;</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keywordflow">if</span> (l->spareelsnum < SIMCLIST_MAX_SPARE_ELEMS) {</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  l->spareels[l->spareelsnum++] = tmp2;</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  free(tmp2);</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  }</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  }</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  assert(i == posend+1 && (posend != l->numels || tmp == l->tail_sentinel));</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> </div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  lastvalid->next = tmp;</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  tmp->prev = lastvalid;</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> </div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  l->numels -= posend - posstart + 1;</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> </div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  assert(list_repOk(l));</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> </div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">return</span> numdel;</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> }</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> </div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="keywordtype">int</span> list_clear(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *s;</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> numels;</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> </div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="comment">/* will be returned */</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  numels = l->numels;</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> </div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">if</span> (l->iter_active) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> </div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span> (l->head_sentinel && l->tail_sentinel) {</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">if</span> (l->attrs.copy_data) { <span class="comment">/* also free user data */</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">/* spare a loop conditional with two loops: spareing elems and freeing elems */</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">for</span> (s = l->head_sentinel->next; l->spareelsnum < SIMCLIST_MAX_SPARE_ELEMS && s != l->tail_sentinel; s = s->next) {</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="comment">/* move elements as spares as long as there is room */</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">if</span> (s->data != NULL) free(s->data);</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  l->spareels[l->spareelsnum++] = s;</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  }</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">while</span> (s != l->tail_sentinel) {</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="comment">/* free the remaining elems */</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordflow">if</span> (s->data != NULL) free(s->data);</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  s = s->next;</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  free(s->prev);</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  }</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  l->head_sentinel->next = l->tail_sentinel;</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  l->tail_sentinel->prev = l->head_sentinel;</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  } <span class="keywordflow">else</span> { <span class="comment">/* only free element containers */</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">/* spare a loop conditional with two loops: spareing elems and freeing elems */</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">for</span> (s = l->head_sentinel->next; l->spareelsnum < SIMCLIST_MAX_SPARE_ELEMS && s != l->tail_sentinel; s = s->next) {</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">/* move elements as spares as long as there is room */</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  l->spareels[l->spareelsnum++] = s;</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  }</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordflow">while</span> (s != l->tail_sentinel) {</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">/* free the remaining elems */</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  s = s->next;</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  free(s->prev);</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  l->head_sentinel->next = l->tail_sentinel;</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  l->tail_sentinel->prev = l->head_sentinel;</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  }</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  }</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  l->numels = 0;</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  l->mid = NULL;</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> </div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  assert(list_repOk(l));</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> </div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordflow">return</span> numels;</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> }</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> </div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> list_size(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">return</span> l->numels;</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> }</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> </div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="keywordtype">int</span> list_empty(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">return</span> (l->numels == 0);</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> </div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="keywordtype">int</span> list_locate(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">void</span> *data) {</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *el;</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordtype">int</span> pos = 0;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> </div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">if</span> (NULL == l->head_sentinel || NULL == l->tail_sentinel)</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> </div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">if</span> (l->attrs.comparator != NULL) {</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="comment">/* use comparator */</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">for</span> (el = l->head_sentinel->next; el != l->tail_sentinel; el = el->next, pos++) {</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">if</span> (l->attrs.comparator(data, el->data) == 0) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  }</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">/* compare references */</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordflow">for</span> (el = l->head_sentinel->next; el != l->tail_sentinel; el = el->next, pos++) {</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keywordflow">if</span> (el->data == data) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  }</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  }</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">if</span> (el == l->tail_sentinel) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> </div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">return</span> pos;</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> }</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> </div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="keywordtype">void</span> *list_seek(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">void</span> *indicator) {</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keyword">const</span> <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *iter;</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordflow">if</span> (l->attrs.seeker == NULL) <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> </div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">if</span> (NULL == l->head_sentinel || NULL == l->tail_sentinel)</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> </div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">for</span> (iter = l->head_sentinel->next; iter != l->tail_sentinel; iter = iter->next) {</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordflow">if</span> (l->attrs.seeker(iter->data, indicator) != 0) <span class="keywordflow">return</span> iter->data;</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> </div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> }</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> </div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="keywordtype">int</span> list_contains(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">void</span> *data) {</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">return</span> (list_locate(l, data) >= 0);</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> }</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> </div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="keywordtype">int</span> list_concat(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *l1, <span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *l2, <a class="code" href="structlist__t.html">list_t</a> *restrict dest) {</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *el, *srcel;</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> cnt;</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordtype">int</span> err;</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> </div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> </div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">if</span> (l1 == NULL || l2 == NULL || dest == NULL || l1 == dest || l2 == dest)</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> </div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">if</span> (NULL == l1->head_sentinel || NULL == l1->tail_sentinel</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  || NULL == l2->head_sentinel || NULL == l2->tail_sentinel)</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> </div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">if</span> (list_init(dest))</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> </div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  dest->numels = l1->numels + l2->numels;</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">if</span> (dest->numels == 0)</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> </div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">/* copy list1 */</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  srcel = l1->head_sentinel->next;</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  el = dest->head_sentinel;</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">while</span> (srcel != l1->tail_sentinel) {</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  el->next = (<span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *)malloc(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a>));</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">if</span> (NULL == el->next)</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  el->next->prev = el;</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  el = el->next;</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  el->data = srcel->data;</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  srcel = srcel->next;</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  }</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  dest->mid = el; <span class="comment">/* approximate position (adjust later) */</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="comment">/* copy list 2 */</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  srcel = l2->head_sentinel->next;</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">while</span> (srcel != l2->tail_sentinel) {</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  el->next = (<span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *)malloc(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a>));</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keywordflow">if</span> (NULL == el->next)</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  el->next->prev = el;</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  el = el->next;</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  el->data = srcel->data;</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  srcel = srcel->next;</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  }</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  el->next = dest->tail_sentinel;</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  dest->tail_sentinel->prev = el;</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span> </div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="comment">/* fix mid pointer */</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  err = l2->numels - l1->numels;</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">if</span> ((err+1)/2 > 0) { <span class="comment">/* correct pos RIGHT (err-1)/2 moves */</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  err = (err+1)/2;</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">for</span> (cnt = 0; cnt < (<span class="keywordtype">unsigned</span> int)err; cnt++) dest->mid = dest->mid->next;</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (err/2 < 0) { <span class="comment">/* correct pos LEFT (err/2)-1 moves */</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  err = -err/2;</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordflow">for</span> (cnt = 0; cnt < (<span class="keywordtype">unsigned</span> int)err; cnt++) dest->mid = dest->mid->prev;</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  }</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> </div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  assert(!(list_repOk(l1) && list_repOk(l2)) || list_repOk(dest));</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span> </div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span> }</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> </div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> <span class="keywordtype">int</span> list_sort(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> versus) {</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordflow">if</span> (l->iter_active || l->attrs.comparator == NULL) <span class="comment">/* cannot modify list in the middle of an iteration */</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> </div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordflow">if</span> (l->numels <= 1)</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> </div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">if</span> (NULL == l->head_sentinel || NULL == l->tail_sentinel)</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> </div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  list_sort_quicksort(l, versus, 0, l->head_sentinel->next, l->numels-1, l->tail_sentinel->prev);</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  assert(list_repOk(l));</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span> }</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span> </div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="preprocessor">#ifdef SIMCLIST_WITH_THREADS</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="keyword">struct </span>list_sort_wrappedparams {</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <a class="code" href="structlist__t.html">list_t</a> *restrict l;</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordtype">int</span> versus;</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> first, last;</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *fel, *lel;</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> };</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> </div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="keyword">static</span> <span class="keywordtype">void</span> *list_sort_quicksort_threadwrapper(<span class="keywordtype">void</span> *wrapped_params) {</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keyword">struct </span>list_sort_wrappedparams *wp = (<span class="keyword">struct </span>list_sort_wrappedparams *)wrapped_params;</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  list_sort_quicksort(wp->l, wp->versus, wp->first, wp->fel, wp->last, wp->lel);</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  free(wp);</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  pthread_exit(NULL);</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span> }</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> </div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> list_sort_selectionsort(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> versus,</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> first, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *fel,</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> last, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *lel) {</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *cursor, *toswap, *firstunsorted;</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordtype">void</span> *tmpdata;</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span> </div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">if</span> (last <= first) <span class="comment">/* <= 1-element lists are always sorted */</span></div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> </div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">for</span> (firstunsorted = fel; firstunsorted != lel; firstunsorted = firstunsorted->next) {</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="comment">/* find min or max in the remainder of the list */</span></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">for</span> (toswap = firstunsorted, cursor = firstunsorted->next; cursor != lel->next; cursor = cursor->next)</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">if</span> (l->attrs.comparator(toswap->data, cursor->data) * -versus > 0) toswap = cursor;</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">if</span> (toswap != firstunsorted) { <span class="comment">/* swap firstunsorted with toswap */</span></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  tmpdata = firstunsorted->data;</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  firstunsorted->data = toswap->data;</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  toswap->data = tmpdata;</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  }</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> }</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span> </div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span> <span class="keyword">static</span> <span class="keywordtype">void</span> list_sort_quicksort(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> versus,</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> first, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *fel,</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> last, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *lel) {</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pivotid;</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keyword">register</span> <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *pivot;</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *left, *right;</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keywordtype">void</span> *tmpdata;</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> <span class="preprocessor">#ifdef SIMCLIST_WITH_THREADS</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  pthread_t tid;</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordtype">int</span> traised;</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span> </div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> </div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">if</span> (last <= first) <span class="comment">/* <= 1-element lists are always sorted */</span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> </div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keywordflow">if</span> (last - first+1 <= SIMCLIST_MINQUICKSORTELS) {</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  list_sort_selectionsort(l, versus, first, fel, last, lel);</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  }</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> </div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">/* base of iteration: one element list */</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordflow">if</span> (! (last > first)) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> </div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  pivotid = (get_random() % (last - first + 1));</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">/* pivotid = (last - first + 1) / 2; */</span></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span> </div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="comment">/* find pivot */</span></div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordflow">if</span> (pivotid < (last - first + 1)/2) {</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">for</span> (i = 0, pivot = fel; i < pivotid; pivot = pivot->next, i++);</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordflow">for</span> (i = last - first, pivot = lel; i > pivotid; pivot = pivot->prev, i--);</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  }</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> </div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">/* smaller PIVOT bigger */</span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  left = fel;</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  right = lel;</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="comment">/* iterate --- left ---> PIV <--- right --- */</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordflow">while</span> (left != pivot && right != pivot) {</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">for</span> (; left != pivot && (l->attrs.comparator(left->data, pivot->data) * -versus <= 0); left = left->next);</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="comment">/* left points to a smaller element, or to pivot */</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keywordflow">for</span> (; right != pivot && (l->attrs.comparator(right->data, pivot->data) * -versus >= 0); right = right->prev);</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="comment">/* right points to a bigger element, or to pivot */</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordflow">if</span> (left != pivot && right != pivot) {</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">/* swap, then move iterators */</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  tmpdata = left->data;</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  left->data = right->data;</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  right->data = tmpdata;</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> </div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  left = left->next;</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  right = right->prev;</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  }</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  }</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span> </div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="comment">/* now either left points to pivot (end run), or right */</span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">if</span> (right == pivot) { <span class="comment">/* left part longer */</span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keywordflow">while</span> (left != pivot) {</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">if</span> (l->attrs.comparator(left->data, pivot->data) * -versus > 0) {</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  tmpdata = left->data;</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  left->data = pivot->prev->data;</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  pivot->prev->data = pivot->data;</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  pivot->data = tmpdata;</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  pivot = pivot->prev;</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  pivotid--;</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordflow">if</span> (pivot == left) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  left = left->next;</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  }</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  }</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  } <span class="keywordflow">else</span> { <span class="comment">/* right part longer */</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordflow">while</span> (right != pivot) {</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">if</span> (l->attrs.comparator(right->data, pivot->data) * -versus < 0) {</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="comment">/* move current right before pivot */</span></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  tmpdata = right->data;</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  right->data = pivot->next->data;</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  pivot->next->data = pivot->data;</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  pivot->data = tmpdata;</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  pivot = pivot->next;</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  pivotid++;</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keywordflow">if</span> (pivot == right) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  right = right->prev;</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  }</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  }</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  }</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> </div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="comment">/* sort sublists A and B : |---A---| pivot |---B---| */</span></div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span> </div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="preprocessor">#ifdef SIMCLIST_WITH_THREADS</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  traised = 0;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keywordflow">if</span> (pivotid > 0) {</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="comment">/* prepare wrapped args, then start thread */</span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordflow">if</span> (l->threadcount < SIMCLIST_MAXTHREADS-1) {</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keyword">struct </span>list_sort_wrappedparams *wp = (<span class="keyword">struct </span>list_sort_wrappedparams *)malloc(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> list_sort_wrappedparams));</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keywordflow">if</span> (NULL == wp)</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  l->threadcount++;</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  traised = 1;</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  wp->l = l;</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  wp->versus = versus;</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  wp->first = first;</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  wp->fel = fel;</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  wp->last = first+pivotid-1;</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  wp->lel = pivot->prev;</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keywordflow">if</span> (pthread_create(&tid, NULL, list_sort_quicksort_threadwrapper, wp) != 0) {</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  free(wp);</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  traised = 0;</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  list_sort_quicksort(l, versus, first, fel, first+pivotid-1, pivot->prev);</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  }</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  list_sort_quicksort(l, versus, first, fel, first+pivotid-1, pivot->prev);</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  }</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  }</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">if</span> (first + pivotid < last) list_sort_quicksort(l, versus, first+pivotid+1, pivot->next, last, lel);</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keywordflow">if</span> (traised) {</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  pthread_join(tid, (<span class="keywordtype">void</span> **)NULL);</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  l->threadcount--;</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  }</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordflow">if</span> (pivotid > 0) list_sort_quicksort(l, versus, first, fel, first+pivotid-1, pivot->prev);</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">if</span> (first + pivotid < last) list_sort_quicksort(l, versus, first+pivotid+1, pivot->next, last, lel);</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span> }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> </div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="keywordtype">int</span> list_iterator_start(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keywordflow">if</span> (l->iter_active) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">if</span> (NULL == l->head_sentinel)</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  l->iter_pos = 0;</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  l->iter_active = 1;</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  l->iter_curentry = l->head_sentinel->next;</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span> }</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> </div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="keywordtype">void</span> *list_iterator_next(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keywordtype">void</span> *toret;</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> </div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">if</span> (! l->iter_active) <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> </div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  toret = l->iter_curentry->data;</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  l->iter_curentry = l->iter_curentry->next;</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  l->iter_pos++;</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span> </div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordflow">return</span> toret;</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> }</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> </div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> <span class="keywordtype">int</span> list_iterator_hasnext(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keywordflow">if</span> (! l->iter_active) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordflow">return</span> (l->iter_pos < l->numels);</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> }</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> </div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> <span class="keywordtype">int</span> list_iterator_stop(<a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">if</span> (! l->iter_active) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  l->iter_pos = 0;</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  l->iter_active = 0;</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> }</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> </div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="keywordtype">int</span> list_hash(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, list_hash_t *restrict hash) {</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *x;</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  list_hash_t tmphash;</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> </div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  assert(hash != NULL);</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> </div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  tmphash = l->numels * 2 + 100;</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">if</span> (l->attrs.hasher == NULL) {</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="preprocessor">#ifdef SIMCLIST_ALLOW_LOCATIONBASED_HASHES</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="comment">/* ENABLE WITH CARE !! */</span></div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> <span class="preprocessor">#warning "Memlocation-based hash is consistent only for testing modification in the same program run."</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> </div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="comment">/* only use element references */</span></div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordflow">for</span> (x = l->head_sentinel->next; x != l->tail_sentinel; x = x->next) {</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordflow">for</span> (i = 0; i < <span class="keyword">sizeof</span>(x->data); i++) {</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  tmphash += (tmphash ^ (uintptr_t)x->data);</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  }</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  tmphash += tmphash % l->numels;</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="comment">/* hash each element with the user-given function */</span></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordflow">for</span> (x = l->head_sentinel->next; x != l->tail_sentinel; x = x->next) {</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  tmphash += tmphash ^ l->attrs.hasher(x->data);</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  tmphash += tmphash % l->numels;</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  }</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  }</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> </div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  *hash = tmphash;</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> </div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> }</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> </div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="preprocessor">#ifndef SIMCLIST_NO_DUMPRESTORE</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> <span class="keywordtype">int</span> list_dump_getinfo_filedescriptor(<span class="keywordtype">int</span> fd, <a class="code" href="structlist__dump__info__t.html">list_dump_info_t</a> *restrict info) {</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  int32_t terminator_head, terminator_tail;</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  uint32_t elemlen;</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  off_t hop;</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> </div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> </div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="comment">/* version */</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  READ_ERRCHECK(fd, & info->version, <span class="keyword">sizeof</span>(info->version));</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  info->version = ntohs(info->version);</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">if</span> (info->version > SIMCLIST_DUMPFORMAT_VERSION) {</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  errno = EILSEQ;</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> </div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="comment">/* timestamp.tv_sec and timestamp.tv_usec */</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  READ_ERRCHECK(fd, & info->timestamp.tv_sec, <span class="keyword">sizeof</span>(info->timestamp.tv_sec));</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  info->timestamp.tv_sec = ntohl(info->timestamp.tv_sec);</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  READ_ERRCHECK(fd, & info->timestamp.tv_usec, <span class="keyword">sizeof</span>(info->timestamp.tv_usec));</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  info->timestamp.tv_usec = ntohl(info->timestamp.tv_usec);</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> </div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="comment">/* list terminator (to check thereafter) */</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  READ_ERRCHECK(fd, & terminator_head, <span class="keyword">sizeof</span>(terminator_head));</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  terminator_head = ntohl(terminator_head);</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> </div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="comment">/* list size */</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  READ_ERRCHECK(fd, & info->list_size, <span class="keyword">sizeof</span>(info->list_size));</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  info->list_size = ntohl(info->list_size);</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> </div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="comment">/* number of elements */</span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  READ_ERRCHECK(fd, & info->list_numels, <span class="keyword">sizeof</span>(info->list_numels));</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  info->list_numels = ntohl(info->list_numels);</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> </div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="comment">/* length of each element (for checking for consistency) */</span></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  READ_ERRCHECK(fd, & elemlen, <span class="keyword">sizeof</span>(elemlen));</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  elemlen = ntohl(elemlen);</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span> </div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="comment">/* list hash */</span></div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  READ_ERRCHECK(fd, & info->list_hash, <span class="keyword">sizeof</span>(info->list_hash));</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  info->list_hash = ntohl(info->list_hash);</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span> </div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="comment">/* check consistency */</span></div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keywordflow">if</span> (elemlen > 0) {</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="comment">/* constant length, hop by size only */</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  hop = info->list_size;</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="comment">/* non-constant length, hop by size + all element length blocks */</span></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  hop = info->list_size + elemlen*info->list_numels;</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  }</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordflow">if</span> (lseek(fd, hop, SEEK_CUR) == -1) {</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  }</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> </div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="comment">/* read the trailing value and compare with terminator_head */</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  READ_ERRCHECK(fd, & terminator_tail, <span class="keyword">sizeof</span>(terminator_tail));</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  terminator_tail = ntohl(terminator_tail);</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span> </div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordflow">if</span> (terminator_head == terminator_tail)</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  info->consistent = 1;</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  info->consistent = 0;</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> </div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> }</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> </div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span> <span class="keywordtype">int</span> list_dump_getinfo_file(<span class="keyword">const</span> <span class="keywordtype">char</span> *restrict filename, <a class="code" href="structlist__dump__info__t.html">list_dump_info_t</a> *restrict info) {</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keywordtype">int</span> fd, ret;</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> </div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  fd = open(filename, O_RDONLY, 0);</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keywordflow">if</span> (fd < 0) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> </div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  ret = list_dump_getinfo_filedescriptor(fd, info);</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  close(fd);</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span> </div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keywordflow">return</span> ret;</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> }</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> </div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span> <span class="keywordtype">int</span> list_dump_filedescriptor(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> fd, <span class="keywordtype">size_t</span> *restrict len) {</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *x;</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordtype">void</span> *ser_buf;</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  uint32_t bufsize;</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="keyword">struct </span>timeval timeofday;</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keyword">struct </span><a class="code" href="structlist__dump__header__s.html">list_dump_header_s</a> header;</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> </div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordflow">if</span> (l->attrs.meter == NULL && l->attrs.serializer == NULL) {</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  errno = ENOTTY;</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  }</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> </div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="comment">/**** DUMP FORMAT ****</span></div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span> <span class="comment"></span></div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> <span class="comment"> [ ver timestamp | totlen numels elemlen hash | DATA ]</span></div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> <span class="comment"></span></div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span> <span class="comment"> where DATA can be:</span></div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="comment"> @ for constant-size list (element size is constant; elemlen > 0)</span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> <span class="comment"> [ elem elem ... elem ]</span></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span> <span class="comment"> @ for other lists (element size dictated by element_meter each time; elemlen <= 0)</span></div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> <span class="comment"> [ size elem size elem ... size elem ]</span></div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="comment"></span></div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> <span class="comment"> all integers are encoded in NETWORK BYTE FORMAT</span></div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> <span class="comment"> *****/</span></div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> </div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> </div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="comment">/* prepare HEADER */</span></div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="comment">/* version */</span></div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  header.ver = htons( SIMCLIST_DUMPFORMAT_VERSION );</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> </div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="comment">/* timestamp */</span></div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  gettimeofday(&timeofday, NULL);</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  header.timestamp_sec = htonl(timeofday.tv_sec);</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  header.timestamp_usec = htonl(timeofday.tv_usec);</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> </div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  header.rndterm = htonl((int32_t)get_random());</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> </div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="comment">/* total list size is postprocessed afterwards */</span></div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span> </div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="comment">/* number of elements */</span></div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  header.numels = htonl(l->numels);</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> </div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="comment">/* include an hash, if possible */</span></div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">if</span> (l->attrs.hasher != NULL) {</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> (htonl(list_hash(l, & header.listhash)) != 0) {</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="comment">/* could not compute list hash! */</span></div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  }</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  header.listhash = htonl(0);</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  }</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span> </div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  header.totlistlen = header.elemlen = 0;</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> </div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="comment">/* leave room for the header at the beginning of the file */</span></div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordflow">if</span> (lseek(fd, SIMCLIST_DUMPFORMAT_HEADERLEN, SEEK_SET) < 0) {</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="comment">/* errno set by lseek() */</span></div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  }</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> </div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="comment">/* write CONTENT */</span></div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keywordflow">if</span> (l->numels > 0) {</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="comment">/* SPECULATE that the list has constant element size */</span></div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span> </div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keywordflow">if</span> (l->attrs.serializer != NULL) { <span class="comment">/* user user-specified serializer */</span></div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="comment">/* get preliminary length of serialized element in header.elemlen */</span></div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  ser_buf = l->attrs.serializer(l->head_sentinel->next->data, & header.elemlen);</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  free(ser_buf);</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="comment">/* request custom serialization of each element */</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keywordflow">for</span> (x = l->head_sentinel->next; x != l->tail_sentinel; x = x->next) {</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  ser_buf = l->attrs.serializer(x->data, &bufsize);</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  header.totlistlen += bufsize;</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="keywordflow">if</span> (header.elemlen != 0) { <span class="comment">/* continue on speculation */</span></div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">if</span> (header.elemlen != bufsize) {</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  free(ser_buf);</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="comment">/* constant element length speculation broken! */</span></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  header.elemlen = 0;</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  header.totlistlen = 0;</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  x = l->head_sentinel;</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordflow">if</span> (lseek(fd, SIMCLIST_DUMPFORMAT_HEADERLEN, SEEK_SET) < 0) {</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="comment">/* errno set by lseek() */</span></div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  }</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="comment">/* restart from the beginning */</span></div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  }</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="comment">/* speculation confirmed */</span></div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  WRITE_ERRCHECK(fd, ser_buf, bufsize);</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  } <span class="keywordflow">else</span> { <span class="comment">/* speculation found broken */</span></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  WRITE_ERRCHECK(fd, &bufsize, <span class="keyword">sizeof</span>(bufsize));</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  WRITE_ERRCHECK(fd, ser_buf, bufsize);</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  }</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  free(ser_buf);</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  }</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (l->attrs.meter != NULL) {</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  header.elemlen = (uint32_t)l->attrs.meter(l->head_sentinel->next->data);</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span> </div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="comment">/* serialize the element straight from its data */</span></div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordflow">for</span> (x = l->head_sentinel->next; x != l->tail_sentinel; x = x->next) {</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  bufsize = l->attrs.meter(x->data);</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  header.totlistlen += bufsize;</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <span class="keywordflow">if</span> (header.elemlen != 0) {</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="keywordflow">if</span> (header.elemlen != bufsize) {</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="comment">/* constant element length speculation broken! */</span></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  header.elemlen = 0;</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  header.totlistlen = 0;</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  x = l->head_sentinel;</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="comment">/* restart from the beginning */</span></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  }</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  WRITE_ERRCHECK(fd, x->data, bufsize);</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  WRITE_ERRCHECK(fd, &bufsize, <span class="keyword">sizeof</span>(bufsize));</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  WRITE_ERRCHECK(fd, x->data, bufsize);</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  }</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  }</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  }</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="comment">/* adjust endianness */</span></div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  header.elemlen = htonl(header.elemlen);</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  header.totlistlen = htonl(header.totlistlen);</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  }</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> </div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="comment">/* write random terminator */</span></div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  WRITE_ERRCHECK(fd, & header.rndterm, <span class="keyword">sizeof</span>(header.rndterm)); <span class="comment">/* list terminator */</span></div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> </div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span> </div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="comment">/* write header */</span></div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  lseek(fd, 0, SEEK_SET);</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span> </div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  WRITE_ERRCHECK(fd, & header.ver, <span class="keyword">sizeof</span>(header.ver)); <span class="comment">/* version */</span></div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  WRITE_ERRCHECK(fd, & header.timestamp_sec, <span class="keyword">sizeof</span>(header.timestamp_sec)); <span class="comment">/* timestamp seconds */</span></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  WRITE_ERRCHECK(fd, & header.timestamp_usec, <span class="keyword">sizeof</span>(header.timestamp_usec)); <span class="comment">/* timestamp microseconds */</span></div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  WRITE_ERRCHECK(fd, & header.rndterm, <span class="keyword">sizeof</span>(header.rndterm)); <span class="comment">/* random terminator */</span></div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> </div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  WRITE_ERRCHECK(fd, & header.totlistlen, <span class="keyword">sizeof</span>(header.totlistlen)); <span class="comment">/* total length of elements */</span></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  WRITE_ERRCHECK(fd, & header.numels, <span class="keyword">sizeof</span>(header.numels)); <span class="comment">/* number of elements */</span></div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  WRITE_ERRCHECK(fd, & header.elemlen, <span class="keyword">sizeof</span>(header.elemlen)); <span class="comment">/* size of each element, or 0 for independent */</span></div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  WRITE_ERRCHECK(fd, & header.listhash, <span class="keyword">sizeof</span>(header.listhash)); <span class="comment">/* list hash, or 0 for "ignore" */</span></div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> </div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> </div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="comment">/* possibly store total written length in "len" */</span></div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="keywordflow">if</span> (len != NULL) {</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  *len = <span class="keyword">sizeof</span>(header) + ntohl(header.totlistlen);</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  }</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> </div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> }</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span> </div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> <span class="keywordtype">int</span> list_restore_filedescriptor(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keywordtype">int</span> fd, <span class="keywordtype">size_t</span> *restrict len) {</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="keyword">struct </span><a class="code" href="structlist__dump__header__s.html">list_dump_header_s</a> header;</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> cnt;</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  <span class="keywordtype">void</span> *buf;</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  uint32_t elsize, totreadlen, totmemorylen;</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> </div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  memset(& header, 0, <span class="keyword">sizeof</span>(header));</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> </div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="comment">/* read header */</span></div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> </div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="comment">/* version */</span></div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  READ_ERRCHECK(fd, &header.ver, <span class="keyword">sizeof</span>(header.ver));</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  header.ver = ntohs(header.ver);</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keywordflow">if</span> (header.ver != SIMCLIST_DUMPFORMAT_VERSION) {</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  errno = EILSEQ;</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  }</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span> </div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="comment">/* timestamp */</span></div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  READ_ERRCHECK(fd, & header.timestamp_sec, <span class="keyword">sizeof</span>(header.timestamp_sec));</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  header.timestamp_sec = ntohl(header.timestamp_sec);</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  READ_ERRCHECK(fd, & header.timestamp_usec, <span class="keyword">sizeof</span>(header.timestamp_usec));</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  header.timestamp_usec = ntohl(header.timestamp_usec);</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> </div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="comment">/* list terminator */</span></div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  READ_ERRCHECK(fd, & header.rndterm, <span class="keyword">sizeof</span>(header.rndterm));</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> </div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  header.rndterm = ntohl(header.rndterm);</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> </div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <span class="comment">/* total list size */</span></div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  READ_ERRCHECK(fd, & header.totlistlen, <span class="keyword">sizeof</span>(header.totlistlen));</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  header.totlistlen = ntohl(header.totlistlen);</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> </div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="comment">/* number of elements */</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  READ_ERRCHECK(fd, & header.numels, <span class="keyword">sizeof</span>(header.numels));</div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  header.numels = ntohl(header.numels);</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> </div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="comment">/* length of every element, or '0' = variable */</span></div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  READ_ERRCHECK(fd, & header.elemlen, <span class="keyword">sizeof</span>(header.elemlen));</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  header.elemlen = ntohl(header.elemlen);</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> </div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="comment">/* list hash, or 0 = 'ignore' */</span></div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  READ_ERRCHECK(fd, & header.listhash, <span class="keyword">sizeof</span>(header.listhash));</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  header.listhash = ntohl(header.listhash);</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> </div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> </div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="comment">/* read content */</span></div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  totreadlen = totmemorylen = 0;</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="keywordflow">if</span> (header.elemlen > 0) {</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="comment">/* elements have constant size = header.elemlen */</span></div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keywordflow">if</span> (l->attrs.unserializer != NULL) {</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="comment">/* use unserializer */</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  buf = malloc(header.elemlen);</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keywordflow">if</span> (NULL == buf)</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">for</span> (cnt = 0; cnt < header.numels; cnt++) {</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  READ_ERRCHECK(fd, buf, (ssize_t) header.elemlen);</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  list_append(l, l->attrs.unserializer(buf, & elsize));</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  totmemorylen += elsize;</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  }</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="comment">/* copy verbatim into memory */</span></div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keywordflow">for</span> (cnt = 0; cnt < header.numels; cnt++) {</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  buf = malloc(header.elemlen);</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  <span class="keywordflow">if</span> (NULL == buf)</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  READ_ERRCHECK(fd, buf, (ssize_t) header.elemlen);</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  list_append(l, buf);</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  }</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  totmemorylen = header.numels * header.elemlen;</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  }</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  totreadlen = header.numels * header.elemlen;</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="comment">/* elements have variable size. Each element is preceded by its size */</span></div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="keywordflow">if</span> (l->attrs.unserializer != NULL) {</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">/* use unserializer */</span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="keywordflow">for</span> (cnt = 0; cnt < header.numels; cnt++) {</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  READ_ERRCHECK(fd, & elsize, <span class="keyword">sizeof</span>(elsize));</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  buf = malloc((<span class="keywordtype">size_t</span>)elsize);</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <span class="keywordflow">if</span> (NULL == buf)</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  READ_ERRCHECK(fd, buf, (ssize_t) elsize);</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  totreadlen += elsize;</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  list_append(l, l->attrs.unserializer(buf, & elsize));</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  totmemorylen += elsize;</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  }</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="comment">/* copy verbatim into memory */</span></div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <span class="keywordflow">for</span> (cnt = 0; cnt < header.numels; cnt++) {</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  READ_ERRCHECK(fd, & elsize, <span class="keyword">sizeof</span>(elsize));</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  buf = malloc(elsize);</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="keywordflow">if</span> (NULL == buf)</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  READ_ERRCHECK(fd, buf, (ssize_t) elsize);</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  totreadlen += elsize;</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  list_append(l, buf);</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  }</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  totmemorylen = totreadlen;</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  }</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  }</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span> </div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  READ_ERRCHECK(fd, &elsize, <span class="keyword">sizeof</span>(elsize)); <span class="comment">/* read list terminator */</span></div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  elsize = ntohl(elsize);</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span> </div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="comment">/* possibly verify the list consistency */</span></div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="comment">/* wrt hash */</span></div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="comment">/* don't do that</span></div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span> <span class="comment"> if (header.listhash != 0 && header.listhash != list_hash(l)) {</span></div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span> <span class="comment"> errno = ECANCELED;</span></div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span> <span class="comment"> return -1;</span></div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> <span class="comment"> }</span></div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> <span class="comment"> */</span></div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span> </div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  <span class="comment">/* wrt header */</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  <span class="keywordflow">if</span> (totreadlen != header.totlistlen && (int32_t)elsize == header.rndterm) {</div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  errno = EPROTO;</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  }</div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> </div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="comment">/* wrt file */</span></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="keywordflow">if</span> (lseek(fd, 0, SEEK_CUR) != lseek(fd, 0, SEEK_END)) {</div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  errno = EPROTO;</div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  }</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> </div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="keywordflow">if</span> (len != NULL) {</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  *len = totmemorylen;</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  }</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span> </div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span> }</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span> </div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span> <span class="keywordtype">int</span> list_dump_file(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">char</span> *restrict filename, <span class="keywordtype">size_t</span> *restrict len) {</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordtype">int</span> fd, oflag, mode;</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> </div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span> <span class="preprocessor">#ifndef _WIN32</span></div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  oflag = O_RDWR | O_CREAT | O_TRUNC;</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  mode = S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH;</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  oflag = _O_RDWR | _O_CREAT | _O_TRUNC;</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  mode = _S_IRUSR | _S_IWUSR | _S_IRGRP | _S_IROTH;</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  fd = open(filename, oflag, mode);</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="keywordflow">if</span> (fd < 0) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span> </div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  list_dump_filedescriptor(l, fd, len);</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  close(fd);</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span> </div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span> }</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span> </div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span> <span class="keywordtype">int</span> list_restore_file(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">const</span> <span class="keywordtype">char</span> *restrict filename, <span class="keywordtype">size_t</span> *restrict len) {</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  <span class="keywordtype">int</span> fd;</div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span> </div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  fd = open(filename, O_RDONLY, 0);</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  <span class="keywordflow">if</span> (fd < 0) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> </div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  list_restore_filedescriptor(l, fd, len);</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  close(fd);</div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span> </div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> }</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> <span class="preprocessor">#endif </span><span class="comment">/* ifndef SIMCLIST_NO_DUMPRESTORE */</span><span class="preprocessor"></span></div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span> </div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span> </div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span> <span class="keyword">static</span> <span class="keywordtype">int</span> list_drop_elem(<a class="code" href="structlist__t.html">list_t</a> *restrict l, <span class="keyword">struct</span> <a class="code" href="structlist__entry__s.html">list_entry_s</a> *tmp, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos) {</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  <span class="keywordflow">if</span> (tmp == NULL) <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span> </div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="comment">/* fix mid pointer. This is wrt the PRE situation */</span></div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="keywordflow">if</span> (l->numels % 2) { <span class="comment">/* now odd */</span></div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="comment">/* sort out the base case by hand */</span></div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keywordflow">if</span> (l->numels == 1) l->mid = NULL;</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (pos >= l->numels/2) l->mid = l->mid->prev;</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  } <span class="keywordflow">else</span> { <span class="comment">/* now even */</span></div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  <span class="keywordflow">if</span> (pos < l->numels/2) l->mid = l->mid->next;</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  }</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span> </div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  tmp->prev->next = tmp->next;</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  tmp->next->prev = tmp->prev;</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span> </div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="comment">/* free what's to be freed */</span></div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="keywordflow">if</span> (l->attrs.copy_data && tmp->data != NULL)</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  free(tmp->data);</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span> </div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  <span class="keywordflow">if</span> (l->spareels != NULL && l->spareelsnum < SIMCLIST_MAX_SPARE_ELEMS) {</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  l->spareels[l->spareelsnum++] = tmp;</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  free(tmp);</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  }</div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span> </div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span> }</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> </div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> <span class="comment">/* ready-made comparators and meters */</span></div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> <span class="preprocessor">#define SIMCLIST_NUMBER_COMPARATOR(type) int list_comparator_##type(const void *a, const void *b) { return( *(type *)a < *(type *)b) - (*(type *)a > *(type *)b); }</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span> </div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> SIMCLIST_NUMBER_COMPARATOR(int8_t)</div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span> SIMCLIST_NUMBER_COMPARATOR(int16_t)</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span> SIMCLIST_NUMBER_COMPARATOR(int32_t)</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span> SIMCLIST_NUMBER_COMPARATOR(int64_t)</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span> </div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span> SIMCLIST_NUMBER_COMPARATOR(uint8_t)</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span> SIMCLIST_NUMBER_COMPARATOR(uint16_t)</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> SIMCLIST_NUMBER_COMPARATOR(uint32_t)</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span> SIMCLIST_NUMBER_COMPARATOR(uint64_t)</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span> </div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> SIMCLIST_NUMBER_COMPARATOR(<span class="keywordtype">float</span>)</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span> SIMCLIST_NUMBER_COMPARATOR(<span class="keywordtype">double</span>)</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span> </div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span> <span class="keywordtype">int</span> list_comparator_string(<span class="keyword">const</span> <span class="keywordtype">void</span> *a, <span class="keyword">const</span> <span class="keywordtype">void</span> *b) { <span class="keywordflow">return</span> strcmp((<span class="keyword">const</span> <span class="keywordtype">char</span> *)b, (<span class="keyword">const</span> <span class="keywordtype">char</span> *)a); }</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span> </div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span> <span class="comment">/* ready-made metric functions */</span></div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> <span class="preprocessor">#define SIMCLIST_METER(type) size_t list_meter_##type(const void *el) { if (el) { </span><span class="comment">/* kill compiler whinge */</span><span class="preprocessor"> } return sizeof(type); }</span></div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> </div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> SIMCLIST_METER(int8_t)</div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span> SIMCLIST_METER(int16_t)</div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span> SIMCLIST_METER(int32_t)</div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span> SIMCLIST_METER(int64_t)</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span> </div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span> SIMCLIST_METER(uint8_t)</div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span> SIMCLIST_METER(uint16_t)</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span> SIMCLIST_METER(uint32_t)</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span> SIMCLIST_METER(uint64_t)</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span> </div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span> SIMCLIST_METER(<span class="keywordtype">float</span>)</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span> SIMCLIST_METER(<span class="keywordtype">double</span>)</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span> </div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span> <span class="keywordtype">size_t</span> list_meter_string(<span class="keyword">const</span> <span class="keywordtype">void</span> *el) { <span class="keywordflow">return</span> strlen((<span class="keyword">const</span> <span class="keywordtype">char</span> *)el) + 1; }</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span> </div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span> <span class="comment">/* ready-made hashing functions */</span></div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> <span class="preprocessor">#define SIMCLIST_HASHCOMPUTER(type) list_hash_t list_hashcomputer_##type(const void *el) { return (list_hash_t)(*(type *)el); }</span></div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span> </div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span> SIMCLIST_HASHCOMPUTER(int8_t)</div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span> SIMCLIST_HASHCOMPUTER(int16_t)</div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> SIMCLIST_HASHCOMPUTER(int32_t)</div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> SIMCLIST_HASHCOMPUTER(int64_t)</div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span> </div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span> SIMCLIST_HASHCOMPUTER(uint8_t)</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span> SIMCLIST_HASHCOMPUTER(uint16_t)</div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span> SIMCLIST_HASHCOMPUTER(uint32_t)</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span> SIMCLIST_HASHCOMPUTER(uint64_t)</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span> </div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> SIMCLIST_HASHCOMPUTER(<span class="keywordtype">float</span>)</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span> SIMCLIST_HASHCOMPUTER(<span class="keywordtype">double</span>)</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span> </div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span> list_hash_t list_hashcomputer_string(<span class="keyword">const</span> <span class="keywordtype">void</span> *el) {</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keywordtype">size_t</span> l;</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  list_hash_t hash = 123;</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="keyword">const</span> <span class="keywordtype">char</span> *str = (<span class="keyword">const</span> <span class="keywordtype">char</span> *)el;</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  <span class="keywordtype">char</span> plus;</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span> </div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordflow">for</span> (l = 0; str[l] != <span class="charliteral">'\0'</span>; l++) {</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <span class="keywordflow">if</span> (l) plus = hash ^ str[l];</div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  <span class="keywordflow">else</span> plus = hash ^ (str[l] - str[0]);</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  hash += (plus << (CHAR_BIT * (l % <span class="keyword">sizeof</span>(list_hash_t))));</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  }</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span> </div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="keywordflow">return</span> hash;</div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span> }</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span> </div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> </div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span> <span class="preprocessor">#ifndef NDEBUG</span></div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span> <span class="keyword">static</span> <span class="keywordtype">int</span> list_repOk(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  <span class="keywordtype">int</span> ok, i;</div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="keyword">struct </span><a class="code" href="structlist__entry__s.html">list_entry_s</a> *s;</div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> </div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  ok = (l != NULL) && (</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  <span class="comment">/* head/tail checks */</span></div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  (l->head_sentinel != NULL && l->tail_sentinel != NULL) &&</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  (l->head_sentinel != l->tail_sentinel) && (l->head_sentinel->prev == NULL && l->tail_sentinel->next == NULL) &&</div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <span class="comment">/* empty list */</span></div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  (l->numels > 0 || (l->mid == NULL && l->head_sentinel->next == l->tail_sentinel && l->tail_sentinel->prev == l->head_sentinel)) &&</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="comment">/* spare elements checks */</span></div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  l->spareelsnum <= SIMCLIST_MAX_SPARE_ELEMS</div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  );</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span> </div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <span class="keywordflow">if</span> (!ok) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span> </div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  <span class="keywordflow">if</span> (l->numels >= 1) {</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <span class="comment">/* correct referencing */</span></div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  <span class="keywordflow">for</span> (i = -1, s = l->head_sentinel; i < (<span class="keywordtype">int</span>)(l->numels-1)/2 && s->next != NULL; i++, s = s->next) {</div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="keywordflow">if</span> (s->next->prev != s) <span class="keywordflow">break</span>;</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  }</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  ok = (i == (int)(l->numels-1)/2 && l->mid == s);</div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="keywordflow">if</span> (!ok) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="keywordflow">for</span> (; s->next != NULL; i++, s = s->next) {</div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  <span class="keywordflow">if</span> (s->next->prev != s) <span class="keywordflow">break</span>;</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  }</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  ok = (i == (int)l->numels && s == l->tail_sentinel);</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  }</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span> </div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  <span class="keywordflow">return</span> ok;</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span> }</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span> </div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span> <span class="keyword">static</span> <span class="keywordtype">int</span> list_attrOk(<span class="keyword">const</span> <a class="code" href="structlist__t.html">list_t</a> *restrict l) {</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="keywordtype">int</span> ok;</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span> </div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  ok = (l->attrs.copy_data == 0 || l->attrs.meter != NULL);</div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <span class="keywordflow">return</span> ok;</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> }</div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> </div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span> </div><div class="ttc" id="structlist__t_html"><div class="ttname"><a href="structlist__t.html">list_t</a></div><div class="ttdoc">list object</div><div class="ttdef"><b>Definition:</b> <a href="simclist_8h_source.html#l00181">simclist.h:181</a></div></div>
<div class="ttc" id="structlist__dump__header__s_html"><div class="ttname"><a href="structlist__dump__header__s.html">list_dump_header_s</a></div><div class="ttdef"><b>Definition:</b> <a href="simclist_8c_source.html#l00181">simclist.c:181</a></div></div>
<div class="ttc" id="structlist__dump__info__t_html"><div class="ttname"><a href="structlist__dump__info__t.html">list_dump_info_t</a></div><div class="ttdef"><b>Definition:</b> <a href="simclist_8h_source.html#l00060">simclist.h:60</a></div></div>
<div class="ttc" id="structlist__entry__s_html"><div class="ttname"><a href="structlist__entry__s.html">list_entry_s</a></div><div class="ttdef"><b>Definition:</b> <a href="simclist_8h_source.html#l00155">simclist.h:155</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Jan 8 2020 17:42:33 for pcsc-lite by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.15
</small></address>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
c875c5048f444faf6c3a434137f1088a
>
files
>
140
