mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
231 lines
18 KiB
HTML
231 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 - raid/combo.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">raid</a> - combo.h<span style="font-size: 80%;"> (source / <a href="combo.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">36</td>
|
|
<td class="headerCovTableEntry">36</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">0</td>
|
|
<td class="headerCovTableEntry">0</td>
|
|
<td class="headerCovTableEntryHi">-</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) 2013 Andrea Mazzoleni</a>
|
|
<a name="3"><span class="lineNum"> 3 </span> : *</a>
|
|
<a name="4"><span class="lineNum"> 4 </span> : * This program is free software: you can redistribute it and/or modify</a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : * it under the terms of the GNU General Public License as published by</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : * the Free Software Foundation, either version 2 of the License, or</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : * (at your option) any later version.</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : *</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : * This program is distributed in the hope that it will be useful,</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : * GNU General Public License for more details.</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : */</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : </a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : #ifndef __RAID_COMBO_H</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : #define __RAID_COMBO_H</a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : </a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : #include <assert.h></a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : </a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : /**</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : * Get the first permutation with repetition of r of n elements.</a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : *</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : * Typical use is with permutation_next() in the form :</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : *</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : * int i[R];</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : * permutation_first(R, N, i);</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : * do {</a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : * code using i[0], i[1], ..., i[R-1]</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : * } while (permutation_next(R, N, i));</a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : *</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : * It's equivalent at the code :</a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : *</a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : * for(i[0]=0;i[0]<N;++i[0])</a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : * for(i[1]=0;i[1]<N;++i[1])</a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : * ...</a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : * for(i[R-2]=0;i[R-2]<N;++i[R-2])</a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : * for(i[R-1]=0;i[R-1]<N;++i[R-1])</a>
|
|
<a name="38"><span class="lineNum"> 38 </span> : * code using i[0], i[1], ..., i[R-1]</a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : */</a>
|
|
<a name="40"><span class="lineNum"> 40 </span> : static __always_inline void permutation_first(int r, int n, int *c)</a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : {</a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : int i;</a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : </a>
|
|
<a name="44"><span class="lineNum"> 44 </span> : (void)n; /* unused, but kept for clarity */</a>
|
|
<a name="45"><span class="lineNum"> 45 </span><span class="lineCov"> 18 : assert(0 < r && r <= n);</span></a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : </a>
|
|
<a name="47"><span class="lineNum"> 47 </span><span class="lineCov"> 81 : for (i = 0; i < r; ++i)</span></a>
|
|
<a name="48"><span class="lineNum"> 48 </span><span class="lineCov"> 63 : c[i] = 0;</span></a>
|
|
<a name="49"><span class="lineNum"> 49 </span><span class="lineCov"> 18 : }</span></a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : </a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : /**</a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : * Get the next permutation with repetition of r of n elements.</a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : * Return ==0 when finished.</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : */</a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : static __always_inline int permutation_next(int r, int n, int *c)</a>
|
|
<a name="56"><span class="lineNum"> 56 </span> : {</a>
|
|
<a name="57"><span class="lineNum"> 57 </span><span class="lineCov"> 167958 : int i = r - 1; /* present position */</span></a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : </a>
|
|
<a name="59"><span class="lineNum"> 59 </span><span class="lineCov"> 201528 : recurse:</span></a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : /* next element at position i */</a>
|
|
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov"> 201528 : ++c[i];</span></a>
|
|
<a name="62"><span class="lineNum"> 62 </span> : </a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : /* if the position has reached the max */</a>
|
|
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 201528 : if (c[i] >= n) {</span></a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : </a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : /* if we are at the first level, we have finished */</a>
|
|
<a name="67"><span class="lineNum"> 67 </span><span class="lineCov"> 33588 : if (i == 0)</span></a>
|
|
<a name="68"><span class="lineNum"> 68 </span><span class="lineCov"> 18 : return 0;</span></a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : </a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : /* increase the previous position */</a>
|
|
<a name="71"><span class="lineNum"> 71 </span><span class="lineCov"> 33570 : --i;</span></a>
|
|
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 33570 : goto recurse;</span></a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : }</a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : </a>
|
|
<a name="75"><span class="lineNum"> 75 </span><span class="lineCov"> 167940 : ++i;</span></a>
|
|
<a name="76"><span class="lineNum"> 76 </span> : </a>
|
|
<a name="77"><span class="lineNum"> 77 </span> : /* initialize all the next positions, if any */</a>
|
|
<a name="78"><span class="lineNum"> 78 </span><span class="lineCov"> 201465 : while (i < r) {</span></a>
|
|
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 33525 : c[i] = 0;</span></a>
|
|
<a name="80"><span class="lineNum"> 80 </span><span class="lineCov"> 33525 : ++i;</span></a>
|
|
<a name="81"><span class="lineNum"> 81 </span> : }</a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : </a>
|
|
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 167940 : return 1;</span></a>
|
|
<a name="84"><span class="lineNum"> 84 </span> : }</a>
|
|
<a name="85"><span class="lineNum"> 85 </span> : </a>
|
|
<a name="86"><span class="lineNum"> 86 </span> : /**</a>
|
|
<a name="87"><span class="lineNum"> 87 </span> : * Get the first combination without repetition of r of n elements.</a>
|
|
<a name="88"><span class="lineNum"> 88 </span> : *</a>
|
|
<a name="89"><span class="lineNum"> 89 </span> : * Typical use is with combination_next() in the form :</a>
|
|
<a name="90"><span class="lineNum"> 90 </span> : *</a>
|
|
<a name="91"><span class="lineNum"> 91 </span> : * int i[R];</a>
|
|
<a name="92"><span class="lineNum"> 92 </span> : * combination_first(R, N, i);</a>
|
|
<a name="93"><span class="lineNum"> 93 </span> : * do {</a>
|
|
<a name="94"><span class="lineNum"> 94 </span> : * code using i[0], i[1], ..., i[R-1]</a>
|
|
<a name="95"><span class="lineNum"> 95 </span> : * } while (combination_next(R, N, i));</a>
|
|
<a name="96"><span class="lineNum"> 96 </span> : *</a>
|
|
<a name="97"><span class="lineNum"> 97 </span> : * It's equivalent at the code :</a>
|
|
<a name="98"><span class="lineNum"> 98 </span> : *</a>
|
|
<a name="99"><span class="lineNum"> 99 </span> : * for(i[0]=0;i[0]<N-(R-1);++i[0])</a>
|
|
<a name="100"><span class="lineNum"> 100 </span> : * for(i[1]=i[0]+1;i[1]<N-(R-2);++i[1])</a>
|
|
<a name="101"><span class="lineNum"> 101 </span> : * ...</a>
|
|
<a name="102"><span class="lineNum"> 102 </span> : * for(i[R-2]=i[R-3]+1;i[R-2]<N-1;++i[R-2])</a>
|
|
<a name="103"><span class="lineNum"> 103 </span> : * for(i[R-1]=i[R-2]+1;i[R-1]<N;++i[R-1])</a>
|
|
<a name="104"><span class="lineNum"> 104 </span> : * code using i[0], i[1], ..., i[R-1]</a>
|
|
<a name="105"><span class="lineNum"> 105 </span> : */</a>
|
|
<a name="106"><span class="lineNum"> 106 </span> : static __always_inline void combination_first(int r, int n, int *c)</a>
|
|
<a name="107"><span class="lineNum"> 107 </span> : {</a>
|
|
<a name="108"><span class="lineNum"> 108 </span> : int i;</a>
|
|
<a name="109"><span class="lineNum"> 109 </span> : </a>
|
|
<a name="110"><span class="lineNum"> 110 </span> : (void)n; /* unused, but kept for clarity */</a>
|
|
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 220485 : assert(0 < r && r <= n);</span></a>
|
|
<a name="112"><span class="lineNum"> 112 </span> : </a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 740248 : for (i = 0; i < r; ++i)</span></a>
|
|
<a name="114"><span class="lineNum"> 114 </span><span class="lineCov"> 519763 : c[i] = i;</span></a>
|
|
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 220485 : }</span></a>
|
|
<a name="116"><span class="lineNum"> 116 </span> : </a>
|
|
<a name="117"><span class="lineNum"> 117 </span> : /**</a>
|
|
<a name="118"><span class="lineNum"> 118 </span> : * Get the next combination without repetition of r of n elements.</a>
|
|
<a name="119"><span class="lineNum"> 119 </span> : * Return ==0 when finished.</a>
|
|
<a name="120"><span class="lineNum"> 120 </span> : */</a>
|
|
<a name="121"><span class="lineNum"> 121 </span> : static __always_inline int combination_next(int r, int n, int *c)</a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : {</a>
|
|
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 52536 : int i = r - 1; /* present position */</span></a>
|
|
<a name="124"><span class="lineNum"> 124 </span><span class="lineCov"> 52536 : int h = n; /* high limit for this position */</span></a>
|
|
<a name="125"><span class="lineNum"> 125 </span> : </a>
|
|
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 85409 : recurse:</span></a>
|
|
<a name="127"><span class="lineNum"> 127 </span> : /* next element at position i */</a>
|
|
<a name="128"><span class="lineNum"> 128 </span><span class="lineCov"> 85409 : ++c[i];</span></a>
|
|
<a name="129"><span class="lineNum"> 129 </span> : </a>
|
|
<a name="130"><span class="lineNum"> 130 </span> : /* if the position has reached the max */</a>
|
|
<a name="131"><span class="lineNum"> 131 </span><span class="lineCov"> 85409 : if (c[i] >= h) {</span></a>
|
|
<a name="132"><span class="lineNum"> 132 </span> : </a>
|
|
<a name="133"><span class="lineNum"> 133 </span> : /* if we are at the first level, we have finished */</a>
|
|
<a name="134"><span class="lineNum"> 134 </span><span class="lineCov"> 45152 : if (i == 0)</span></a>
|
|
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 12279 : return 0;</span></a>
|
|
<a name="136"><span class="lineNum"> 136 </span> : </a>
|
|
<a name="137"><span class="lineNum"> 137 </span> : /* increase the previous position */</a>
|
|
<a name="138"><span class="lineNum"> 138 </span><span class="lineCov"> 32873 : --i;</span></a>
|
|
<a name="139"><span class="lineNum"> 139 </span><span class="lineCov"> 32873 : --h;</span></a>
|
|
<a name="140"><span class="lineNum"> 140 </span><span class="lineCov"> 32873 : goto recurse;</span></a>
|
|
<a name="141"><span class="lineNum"> 141 </span> : }</a>
|
|
<a name="142"><span class="lineNum"> 142 </span> : </a>
|
|
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 40257 : ++i;</span></a>
|
|
<a name="144"><span class="lineNum"> 144 </span> : </a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : /* initialize all the next positions, if any */</a>
|
|
<a name="146"><span class="lineNum"> 146 </span><span class="lineCov"> 62802 : while (i < r) {</span></a>
|
|
<a name="147"><span class="lineNum"> 147 </span> : /* each position start at the next value of the previous one */</a>
|
|
<a name="148"><span class="lineNum"> 148 </span><span class="lineCov"> 22545 : c[i] = c[i - 1] + 1;</span></a>
|
|
<a name="149"><span class="lineNum"> 149 </span><span class="lineCov"> 22545 : ++i;</span></a>
|
|
<a name="150"><span class="lineNum"> 150 </span> : }</a>
|
|
<a name="151"><span class="lineNum"> 151 </span> : </a>
|
|
<a name="152"><span class="lineNum"> 152 </span><span class="lineCov"> 40257 : return 1;</span></a>
|
|
<a name="153"><span class="lineNum"> 153 </span> : }</a>
|
|
<a name="154"><span class="lineNum"> 154 </span> : #endif</a>
|
|
<a name="155"><span class="lineNum"> 155 </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>
|