mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
159 lines
12 KiB
HTML
159 lines
12 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - lcov.info - tommyds/tommyarray.c</title>
|
|
<link rel="stylesheet" type="text/css" href="../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">tommyds</a> - tommyarray.c<span style="font-size: 80%;"> (source / <a href="tommyarray.c.func-sort-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="15%"></td>
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">lcov.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntry">25</td>
|
|
<td class="headerCovTableEntry">25</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2026-03-15 15:58:19</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">4</td>
|
|
<td class="headerCovTableEntry">4</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</a>
|
|
<a name="2"><span class="lineNum"> 2 </span> : * Copyright (c) 2011, Andrea Mazzoleni. All rights reserved.</a>
|
|
<a name="3"><span class="lineNum"> 3 </span> : *</a>
|
|
<a name="4"><span class="lineNum"> 4 </span> : * Redistribution and use in source and binary forms, with or without</a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : * modification, are permitted provided that the following conditions</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : * are met:</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : *</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : * 1. Redistributions of source code must retain the above copyright</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : * notice, this list of conditions and the following disclaimer.</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : *</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : * 2. Redistributions in binary form must reproduce the above copyright</a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : * notice, this list of conditions and the following disclaimer in the</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : * documentation and/or other materials provided with the distribution.</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : *</a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR</a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS</a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : * POSSIBILITY OF SUCH DAMAGE.</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : */</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : </a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : #include "tommyarray.h"</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : </a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : /******************************************************************************/</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : /* array */</a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : </a>
|
|
<a name="33"><span class="lineNum"> 33 </span><span class="lineCov"> 568 : TOMMY_API void tommy_array_init(tommy_array* array)</span></a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : {</a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : tommy_uint_t i;</a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : </a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : /* fixed initial size */</a>
|
|
<a name="38"><span class="lineNum"> 38 </span><span class="lineCov"> 568 : array->bucket_bit = TOMMY_ARRAY_BIT;</span></a>
|
|
<a name="39"><span class="lineNum"> 39 </span><span class="lineCov"> 568 : array->bucket_max = (tommy_size_t)1 << array->bucket_bit;</span></a>
|
|
<a name="40"><span class="lineNum"> 40 </span><span class="lineCov"> 568 : array->bucket[0] = tommy_cast(void**, tommy_calloc(array->bucket_max, sizeof(void*)));</span></a>
|
|
<a name="41"><span class="lineNum"> 41 </span><span class="lineCov"> 3408 : for (i = 1; i < TOMMY_ARRAY_BIT; ++i)</span></a>
|
|
<a name="42"><span class="lineNum"> 42 </span><span class="lineCov"> 2840 : array->bucket[i] = array->bucket[0];</span></a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : </a>
|
|
<a name="44"><span class="lineNum"> 44 </span><span class="lineCov"> 568 : array->count = 0;</span></a>
|
|
<a name="45"><span class="lineNum"> 45 </span><span class="lineCov"> 568 : }</span></a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : </a>
|
|
<a name="47"><span class="lineNum"> 47 </span><span class="lineCov"> 556 : TOMMY_API void tommy_array_done(tommy_array* array)</span></a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : {</a>
|
|
<a name="49"><span class="lineNum"> 49 </span> : tommy_uint_t i;</a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : </a>
|
|
<a name="51"><span class="lineNum"> 51 </span><span class="lineCov"> 556 : tommy_free(array->bucket[0]);</span></a>
|
|
<a name="52"><span class="lineNum"> 52 </span><span class="lineCov"> 558 : for (i = TOMMY_ARRAY_BIT; i < array->bucket_bit; ++i) {</span></a>
|
|
<a name="53"><span class="lineNum"> 53 </span><span class="lineCov"> 2 : void** segment = array->bucket[i];</span></a>
|
|
<a name="54"><span class="lineNum"> 54 </span><span class="lineCov"> 2 : tommy_free(&segment[(tommy_ptrdiff_t)1 << i]);</span></a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : }</a>
|
|
<a name="56"><span class="lineNum"> 56 </span><span class="lineCov"> 556 : }</span></a>
|
|
<a name="57"><span class="lineNum"> 57 </span> : </a>
|
|
<a name="58"><span class="lineNum"> 58 </span><span class="lineCov"> 2366 : TOMMY_API void tommy_array_grow(tommy_array* array, tommy_size_t count)</span></a>
|
|
<a name="59"><span class="lineNum"> 59 </span> : {</a>
|
|
<a name="60"><span class="lineNum"> 60 </span><span class="lineCov"> 2366 : if (array->count >= count)</span></a>
|
|
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov"> 1 : return;</span></a>
|
|
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov"> 2365 : array->count = count;</span></a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : </a>
|
|
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 2367 : while (count > array->bucket_max) {</span></a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : void** segment;</a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : </a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : /* allocate one more segment */</a>
|
|
<a name="68"><span class="lineNum"> 68 </span><span class="lineCov"> 2 : segment = tommy_cast(void**, tommy_calloc(array->bucket_max, sizeof(void*)));</span></a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : </a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : /* store it adjusting the offset */</a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : /* cast to ptrdiff_t to ensure to get a negative value */</a>
|
|
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 2 : array->bucket[array->bucket_bit] = &segment[-(tommy_ptrdiff_t)array->bucket_max];</span></a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : </a>
|
|
<a name="74"><span class="lineNum"> 74 </span><span class="lineCov"> 2 : ++array->bucket_bit;</span></a>
|
|
<a name="75"><span class="lineNum"> 75 </span><span class="lineCov"> 2 : array->bucket_max = (tommy_size_t)1 << array->bucket_bit;</span></a>
|
|
<a name="76"><span class="lineNum"> 76 </span> : }</a>
|
|
<a name="77"><span class="lineNum"> 77 </span> : }</a>
|
|
<a name="78"><span class="lineNum"> 78 </span> : </a>
|
|
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 2 : TOMMY_API tommy_size_t tommy_array_memory_usage(tommy_array* array)</span></a>
|
|
<a name="80"><span class="lineNum"> 80 </span> : {</a>
|
|
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 2 : return array->bucket_max * (tommy_size_t)sizeof(void*);</span></a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : }</a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : </a>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com/linux-test-project/lcov" target="_parent">LCOV version 1.0</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|