mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
221 lines
18 KiB
HTML
221 lines
18 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.h</title>
|
|
<link rel="stylesheet" type="text/css" href="../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">tommyds</a> - tommyarray.h<span style="font-size: 80%;"> (source / <a href="tommyarray.h.func-sort-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="15%"></td>
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">lcov.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntry">16</td>
|
|
<td class="headerCovTableEntry">16</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">5</td>
|
|
<td class="headerCovTableEntry">5</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</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> : /** \file</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : * Dynamic array based on segments of exponentially growing size.</a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : *</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : * This array is able to grow dynamically upon request, without any reallocation.</a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : *</a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : * The grow operation involves an allocation of a new array segment, without reallocating</a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : * the already used memory, and thus **not increasing** the heap fragmentation.</a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : * This also implies that the address of the stored elements never change.</a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : *</a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : * Allocated segments grow in size exponentially.</a>
|
|
<a name="38"><span class="lineNum"> 38 </span> : */</a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : </a>
|
|
<a name="40"><span class="lineNum"> 40 </span> : #ifndef __TOMMYARRAY_H</a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : #define __TOMMYARRAY_H</a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : </a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : #include "tommytypes.h"</a>
|
|
<a name="44"><span class="lineNum"> 44 </span> : </a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : #include <assert.h> /* for assert */</a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : </a>
|
|
<a name="47"><span class="lineNum"> 47 </span> : /******************************************************************************/</a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : /* array */</a>
|
|
<a name="49"><span class="lineNum"> 49 </span> : </a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : /**</a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : * Initial and minimal size of the array expressed as a power of 2.</a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : * The initial size is 2^TOMMY_ARRAY_BIT.</a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : */</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : #define TOMMY_ARRAY_BIT 6</a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : </a>
|
|
<a name="56"><span class="lineNum"> 56 </span> : /**</a>
|
|
<a name="57"><span class="lineNum"> 57 </span> : * Array container type.</a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : * \note Don't use internal fields directly, but access the container only using functions.</a>
|
|
<a name="59"><span class="lineNum"> 59 </span> : */</a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : typedef struct tommy_array_struct {</a>
|
|
<a name="61"><span class="lineNum"> 61 </span> : void** bucket[TOMMY_SIZE_BIT]; /**< Dynamic array of buckets. */</a>
|
|
<a name="62"><span class="lineNum"> 62 </span> : tommy_size_t bucket_max; /**< Number of buckets. */</a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : tommy_size_t count; /**< Number of initialized elements in the array. */</a>
|
|
<a name="64"><span class="lineNum"> 64 </span> : tommy_uint_t bucket_bit; /**< Bits used in the bit mask. */</a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : } tommy_array;</a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : </a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : /**</a>
|
|
<a name="68"><span class="lineNum"> 68 </span> : * Initializes the array.</a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : */</a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : TOMMY_API void tommy_array_init(tommy_array* array);</a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : </a>
|
|
<a name="72"><span class="lineNum"> 72 </span> : /**</a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : * Deinitializes the array.</a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : */</a>
|
|
<a name="75"><span class="lineNum"> 75 </span> : TOMMY_API void tommy_array_done(tommy_array* array);</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> : * Grows the size up to the specified value.</a>
|
|
<a name="79"><span class="lineNum"> 79 </span> : * All the new elements in the array are initialized with the 0 value.</a>
|
|
<a name="80"><span class="lineNum"> 80 </span> : */</a>
|
|
<a name="81"><span class="lineNum"> 81 </span> : TOMMY_API void tommy_array_grow(tommy_array* array, tommy_size_t size);</a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : </a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : /**</a>
|
|
<a name="84"><span class="lineNum"> 84 </span> : * Gets a reference of the element at the specified position.</a>
|
|
<a name="85"><span class="lineNum"> 85 </span> : * You must be sure that space for this position is already</a>
|
|
<a name="86"><span class="lineNum"> 86 </span> : * allocated calling tommy_array_grow().</a>
|
|
<a name="87"><span class="lineNum"> 87 </span> : */</a>
|
|
<a name="88"><span class="lineNum"> 88 </span><span class="lineCov"> 8788686 : tommy_inline void** tommy_array_ref(tommy_array* array, tommy_size_t pos)</span></a>
|
|
<a name="89"><span class="lineNum"> 89 </span> : {</a>
|
|
<a name="90"><span class="lineNum"> 90 </span> : tommy_uint_t bsr;</a>
|
|
<a name="91"><span class="lineNum"> 91 </span> : </a>
|
|
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 8788686 : assert(pos < array->count);</span></a>
|
|
<a name="93"><span class="lineNum"> 93 </span> : </a>
|
|
<a name="94"><span class="lineNum"> 94 </span> : /* get the highest bit set, in case of all 0, return 0 */</a>
|
|
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 8788686 : bsr = tommy_ilog2(pos | 1);</span></a>
|
|
<a name="96"><span class="lineNum"> 96 </span> : </a>
|
|
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 8788686 : return &array->bucket[bsr][pos];</span></a>
|
|
<a name="98"><span class="lineNum"> 98 </span> : }</a>
|
|
<a name="99"><span class="lineNum"> 99 </span> : </a>
|
|
<a name="100"><span class="lineNum"> 100 </span> : /**</a>
|
|
<a name="101"><span class="lineNum"> 101 </span> : * Sets the element at the specified position.</a>
|
|
<a name="102"><span class="lineNum"> 102 </span> : * You must be sure that space for this position is already</a>
|
|
<a name="103"><span class="lineNum"> 103 </span> : * allocated calling tommy_array_grow().</a>
|
|
<a name="104"><span class="lineNum"> 104 </span> : */</a>
|
|
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 2365 : tommy_inline void tommy_array_set(tommy_array* array, tommy_size_t pos, void* element)</span></a>
|
|
<a name="106"><span class="lineNum"> 106 </span> : {</a>
|
|
<a name="107"><span class="lineNum"> 107 </span><span class="lineCov"> 2365 : *tommy_array_ref(array, pos) = element;</span></a>
|
|
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 2365 : }</span></a>
|
|
<a name="109"><span class="lineNum"> 109 </span> : </a>
|
|
<a name="110"><span class="lineNum"> 110 </span> : /**</a>
|
|
<a name="111"><span class="lineNum"> 111 </span> : * Gets the element at the specified position.</a>
|
|
<a name="112"><span class="lineNum"> 112 </span> : * You must be sure that space for this position is already</a>
|
|
<a name="113"><span class="lineNum"> 113 </span> : * allocated calling tommy_array_grow().</a>
|
|
<a name="114"><span class="lineNum"> 114 </span> : */</a>
|
|
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 8786321 : tommy_inline void* tommy_array_get(tommy_array* array, tommy_size_t pos)</span></a>
|
|
<a name="116"><span class="lineNum"> 116 </span> : {</a>
|
|
<a name="117"><span class="lineNum"> 117 </span><span class="lineCov"> 8786321 : return *tommy_array_ref(array, pos);</span></a>
|
|
<a name="118"><span class="lineNum"> 118 </span> : }</a>
|
|
<a name="119"><span class="lineNum"> 119 </span> : </a>
|
|
<a name="120"><span class="lineNum"> 120 </span> : /**</a>
|
|
<a name="121"><span class="lineNum"> 121 </span> : * Grows and inserts a new element at the end of the array.</a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : */</a>
|
|
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 256 : tommy_inline void tommy_array_insert(tommy_array* array, void* element)</span></a>
|
|
<a name="124"><span class="lineNum"> 124 </span> : {</a>
|
|
<a name="125"><span class="lineNum"> 125 </span><span class="lineCov"> 256 : tommy_size_t pos = array->count;</span></a>
|
|
<a name="126"><span class="lineNum"> 126 </span> : </a>
|
|
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 256 : tommy_array_grow(array, pos + 1);</span></a>
|
|
<a name="128"><span class="lineNum"> 128 </span> : </a>
|
|
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 256 : tommy_array_set(array, pos, element);</span></a>
|
|
<a name="130"><span class="lineNum"> 130 </span><span class="lineCov"> 256 : }</span></a>
|
|
<a name="131"><span class="lineNum"> 131 </span> : </a>
|
|
<a name="132"><span class="lineNum"> 132 </span> : /**</a>
|
|
<a name="133"><span class="lineNum"> 133 </span> : * Gets the initialized size of the array.</a>
|
|
<a name="134"><span class="lineNum"> 134 </span> : */</a>
|
|
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 1689854 : tommy_inline tommy_size_t tommy_array_size(tommy_array* array)</span></a>
|
|
<a name="136"><span class="lineNum"> 136 </span> : {</a>
|
|
<a name="137"><span class="lineNum"> 137 </span><span class="lineCov"> 1689854 : return array->count;</span></a>
|
|
<a name="138"><span class="lineNum"> 138 </span> : }</a>
|
|
<a name="139"><span class="lineNum"> 139 </span> : </a>
|
|
<a name="140"><span class="lineNum"> 140 </span> : /**</a>
|
|
<a name="141"><span class="lineNum"> 141 </span> : * Gets the size of allocated memory.</a>
|
|
<a name="142"><span class="lineNum"> 142 </span> : */</a>
|
|
<a name="143"><span class="lineNum"> 143 </span> : TOMMY_API tommy_size_t tommy_array_memory_usage(tommy_array* array);</a>
|
|
<a name="144"><span class="lineNum"> 144 </span> : </a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : #endif</a>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com/linux-test-project/lcov" target="_parent">LCOV version 1.0</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|