mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
227 lines
16 KiB
HTML
227 lines
16 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.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">2016-11-21</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>
|
|
<span class="lineNum"> 2 </span> : * Copyright (c) 2011, Andrea Mazzoleni. All rights reserved.
|
|
<span class="lineNum"> 3 </span> : *
|
|
<span class="lineNum"> 4 </span> : * Redistribution and use in source and binary forms, with or without
|
|
<span class="lineNum"> 5 </span> : * modification, are permitted provided that the following conditions
|
|
<span class="lineNum"> 6 </span> : * are met:
|
|
<span class="lineNum"> 7 </span> : *
|
|
<span class="lineNum"> 8 </span> : * 1. Redistributions of source code must retain the above copyright
|
|
<span class="lineNum"> 9 </span> : * notice, this list of conditions and the following disclaimer.
|
|
<span class="lineNum"> 10 </span> : *
|
|
<span class="lineNum"> 11 </span> : * 2. Redistributions in binary form must reproduce the above copyright
|
|
<span class="lineNum"> 12 </span> : * notice, this list of conditions and the following disclaimer in the
|
|
<span class="lineNum"> 13 </span> : * documentation and/or other materials provided with the distribution.
|
|
<span class="lineNum"> 14 </span> : *
|
|
<span class="lineNum"> 15 </span> : * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
<span class="lineNum"> 16 </span> : * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
<span class="lineNum"> 17 </span> : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
<span class="lineNum"> 18 </span> : * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
<span class="lineNum"> 19 </span> : * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
<span class="lineNum"> 20 </span> : * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
<span class="lineNum"> 21 </span> : * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
<span class="lineNum"> 22 </span> : * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
<span class="lineNum"> 23 </span> : * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
<span class="lineNum"> 24 </span> : * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
<span class="lineNum"> 25 </span> : * POSSIBILITY OF SUCH DAMAGE.
|
|
<span class="lineNum"> 26 </span> : */
|
|
<span class="lineNum"> 27 </span> :
|
|
<span class="lineNum"> 28 </span> : /** \file
|
|
<span class="lineNum"> 29 </span> : * Dynamic array based on segments of exponential growing size.
|
|
<span class="lineNum"> 30 </span> : *
|
|
<span class="lineNum"> 31 </span> : * This array is able to grow dynamically upon request, without any reallocation.
|
|
<span class="lineNum"> 32 </span> : *
|
|
<span class="lineNum"> 33 </span> : * The grow operation involves an allocation of a new array segment, without reallocating
|
|
<span class="lineNum"> 34 </span> : * the already used memory, and then not increasing the heap fragmentation.
|
|
<span class="lineNum"> 35 </span> : * This also implies that the address of the stored elements never change.
|
|
<span class="lineNum"> 36 </span> : *
|
|
<span class="lineNum"> 37 </span> : * Allocated segments grow in size exponentially.
|
|
<span class="lineNum"> 38 </span> : */
|
|
<span class="lineNum"> 39 </span> :
|
|
<span class="lineNum"> 40 </span> : #ifndef __TOMMYARRAY_H
|
|
<span class="lineNum"> 41 </span> : #define __TOMMYARRAY_H
|
|
<span class="lineNum"> 42 </span> :
|
|
<span class="lineNum"> 43 </span> : #include "tommytypes.h"
|
|
<span class="lineNum"> 44 </span> :
|
|
<span class="lineNum"> 45 </span> : #include <assert.h> /* for assert */
|
|
<span class="lineNum"> 46 </span> :
|
|
<span class="lineNum"> 47 </span> : /******************************************************************************/
|
|
<span class="lineNum"> 48 </span> : /* array */
|
|
<span class="lineNum"> 49 </span> :
|
|
<span class="lineNum"> 50 </span> : /**
|
|
<span class="lineNum"> 51 </span> : * Initial and minimal size of the array expressed as a power of 2.
|
|
<span class="lineNum"> 52 </span> : * The initial size is 2^TOMMY_ARRAY_BIT.
|
|
<span class="lineNum"> 53 </span> : */
|
|
<span class="lineNum"> 54 </span> : #define TOMMY_ARRAY_BIT 6
|
|
<span class="lineNum"> 55 </span> :
|
|
<span class="lineNum"> 56 </span> : /** \internal
|
|
<span class="lineNum"> 57 </span> : * Max number of elements as a power of 2.
|
|
<span class="lineNum"> 58 </span> : */
|
|
<span class="lineNum"> 59 </span> : #define TOMMY_ARRAY_BIT_MAX 32
|
|
<span class="lineNum"> 60 </span> :
|
|
<span class="lineNum"> 61 </span> : /**
|
|
<span class="lineNum"> 62 </span> : * Array container type.
|
|
<span class="lineNum"> 63 </span> : * \note Don't use internal fields directly, but access the container only using functions.
|
|
<span class="lineNum"> 64 </span> : */
|
|
<span class="lineNum"> 65 </span> : typedef struct tommy_array_struct {
|
|
<span class="lineNum"> 66 </span> : void** bucket[TOMMY_ARRAY_BIT_MAX]; /**< Dynamic array of buckets. */
|
|
<span class="lineNum"> 67 </span> : tommy_uint_t bucket_bit; /**< Bits used in the bit mask. */
|
|
<span class="lineNum"> 68 </span> : tommy_count_t bucket_max; /**< Number of buckets. */
|
|
<span class="lineNum"> 69 </span> : tommy_count_t count; /**< Number of initialized elements in the array. */
|
|
<span class="lineNum"> 70 </span> : } tommy_array;
|
|
<span class="lineNum"> 71 </span> :
|
|
<span class="lineNum"> 72 </span> : /**
|
|
<span class="lineNum"> 73 </span> : * Initializes the array.
|
|
<span class="lineNum"> 74 </span> : */
|
|
<span class="lineNum"> 75 </span> : void tommy_array_init(tommy_array* array);
|
|
<span class="lineNum"> 76 </span> :
|
|
<span class="lineNum"> 77 </span> : /**
|
|
<span class="lineNum"> 78 </span> : * Deinitializes the array.
|
|
<span class="lineNum"> 79 </span> : */
|
|
<span class="lineNum"> 80 </span> : void tommy_array_done(tommy_array* array);
|
|
<span class="lineNum"> 81 </span> :
|
|
<span class="lineNum"> 82 </span> : /**
|
|
<span class="lineNum"> 83 </span> : * Grows the size up to the specified value.
|
|
<span class="lineNum"> 84 </span> : * All the new elements in the array are initialized with the 0 value.
|
|
<span class="lineNum"> 85 </span> : */
|
|
<span class="lineNum"> 86 </span> : void tommy_array_grow(tommy_array* array, tommy_count_t size);
|
|
<span class="lineNum"> 87 </span> :
|
|
<span class="lineNum"> 88 </span> : /**
|
|
<span class="lineNum"> 89 </span> : * Gets a reference of the element at the specified position.
|
|
<span class="lineNum"> 90 </span> : * You must be sure that space for this position is already
|
|
<a name="91"><span class="lineNum"> 91 </span> : * allocated calling tommy_array_grow().</a>
|
|
<span class="lineNum"> 92 </span> : */
|
|
<span class="lineNum"> 93 </span><span class="lineCov"> 10268668 : tommy_inline void** tommy_array_ref(tommy_array* array, tommy_count_t pos)</span>
|
|
<span class="lineNum"> 94 </span> : {
|
|
<span class="lineNum"> 95 </span> : tommy_uint_t bsr;
|
|
<span class="lineNum"> 96 </span> :
|
|
<span class="lineNum"> 97 </span><span class="lineCov"> 10268668 : assert(pos < array->count);</span>
|
|
<span class="lineNum"> 98 </span> :
|
|
<span class="lineNum"> 99 </span> : /* get the highest bit set, in case of all 0, return 0 */
|
|
<span class="lineNum"> 100 </span><span class="lineCov"> 10268668 : bsr = tommy_ilog2_u32(pos | 1);</span>
|
|
<span class="lineNum"> 101 </span> :
|
|
<span class="lineNum"> 102 </span><span class="lineCov"> 10268668 : return &array->bucket[bsr][pos];</span>
|
|
<span class="lineNum"> 103 </span> : }
|
|
<span class="lineNum"> 104 </span> :
|
|
<span class="lineNum"> 105 </span> : /**
|
|
<span class="lineNum"> 106 </span> : * Sets the element at the specified position.
|
|
<span class="lineNum"> 107 </span> : * You must be sure that space for this position is already
|
|
<a name="108"><span class="lineNum"> 108 </span> : * allocated calling tommy_array_grow().</a>
|
|
<span class="lineNum"> 109 </span> : */
|
|
<span class="lineNum"> 110 </span><span class="lineCov"> 2214 : tommy_inline void tommy_array_set(tommy_array* array, tommy_count_t pos, void* element)</span>
|
|
<span class="lineNum"> 111 </span> : {
|
|
<span class="lineNum"> 112 </span><span class="lineCov"> 2214 : *tommy_array_ref(array, pos) = element;</span>
|
|
<span class="lineNum"> 113 </span><span class="lineCov"> 2214 : }</span>
|
|
<span class="lineNum"> 114 </span> :
|
|
<span class="lineNum"> 115 </span> : /**
|
|
<span class="lineNum"> 116 </span> : * Gets the element at the specified position.
|
|
<span class="lineNum"> 117 </span> : * You must be sure that space for this position is already
|
|
<a name="118"><span class="lineNum"> 118 </span> : * allocated calling tommy_array_grow().</a>
|
|
<span class="lineNum"> 119 </span> : */
|
|
<span class="lineNum"> 120 </span><span class="lineCov"> 10266454 : tommy_inline void* tommy_array_get(tommy_array* array, tommy_count_t pos)</span>
|
|
<span class="lineNum"> 121 </span> : {
|
|
<span class="lineNum"> 122 </span><span class="lineCov"> 10266454 : return *tommy_array_ref(array, pos);</span>
|
|
<span class="lineNum"> 123 </span> : }
|
|
<span class="lineNum"> 124 </span> :
|
|
<span class="lineNum"> 125 </span> : /**
|
|
<a name="126"><span class="lineNum"> 126 </span> : * Grows and inserts a new element at the end of the array.</a>
|
|
<span class="lineNum"> 127 </span> : */
|
|
<span class="lineNum"> 128 </span><span class="lineCov"> 256 : tommy_inline void tommy_array_insert(tommy_array* array, void* element)</span>
|
|
<span class="lineNum"> 129 </span> : {
|
|
<span class="lineNum"> 130 </span><span class="lineCov"> 256 : tommy_count_t pos = array->count;</span>
|
|
<span class="lineNum"> 131 </span> :
|
|
<span class="lineNum"> 132 </span><span class="lineCov"> 256 : tommy_array_grow(array, pos + 1);</span>
|
|
<span class="lineNum"> 133 </span> :
|
|
<span class="lineNum"> 134 </span><span class="lineCov"> 256 : tommy_array_set(array, pos, element);</span>
|
|
<span class="lineNum"> 135 </span><span class="lineCov"> 256 : }</span>
|
|
<span class="lineNum"> 136 </span> :
|
|
<span class="lineNum"> 137 </span> : /**
|
|
<a name="138"><span class="lineNum"> 138 </span> : * Gets the initialized size of the array.</a>
|
|
<span class="lineNum"> 139 </span> : */
|
|
<span class="lineNum"> 140 </span><span class="lineCov"> 1575778 : tommy_inline tommy_count_t tommy_array_size(tommy_array* array)</span>
|
|
<span class="lineNum"> 141 </span> : {
|
|
<span class="lineNum"> 142 </span><span class="lineCov"> 1575778 : return array->count;</span>
|
|
<span class="lineNum"> 143 </span> : }
|
|
<span class="lineNum"> 144 </span> :
|
|
<span class="lineNum"> 145 </span> : /**
|
|
<span class="lineNum"> 146 </span> : * Gets the size of allocated memory.
|
|
<span class="lineNum"> 147 </span> : */
|
|
<span class="lineNum"> 148 </span> : tommy_size_t tommy_array_memory_usage(tommy_array* array);
|
|
<span class="lineNum"> 149 </span> :
|
|
<span class="lineNum"> 150 </span> : #endif
|
|
<span class="lineNum"> 151 </span> :
|
|
</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="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.10</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|