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