rt/snapraid
1
0
Fork 0
mirror of https://github.com/amadvance/snapraid.git synced 2026-10-26 19:01:57 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions
snapraid/cov/raid/helper.c.gcov.html
Andrea Mazzoleni e01ca1e0fa Auto update
2016-11-21 19:48:21 +01:00

170 lines
11 KiB
HTML
Raw Blame History

<!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/helper.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">raid</a> - helper.c<span style="font-size: 80%;"> (source / <a href="helper.c.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">46</td>
<td class="headerCovTableEntry">46</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">2</td>
<td class="headerCovTableEntry">2</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) 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> : #include &quot;internal.h&quot;
<span class="lineNum"> 16 </span> :
<span class="lineNum"> 17 </span> : #define RAID_SWAP(a, b) \
<span class="lineNum"> 18 </span> : do { \
<span class="lineNum"> 19 </span> : if (v[a] &gt; v[b]) { \
<span class="lineNum"> 20 </span> : int t = v[a]; \
<span class="lineNum"> 21 </span> : v[a] = v[b]; \
<span class="lineNum"> 22 </span> : v[b] = t; \
<span class="lineNum"> 23 </span> : } \
<a name="24"><span class="lineNum"> 24 </span> : } while (0)</a>
<span class="lineNum"> 25 </span> :
<span class="lineNum"> 26 </span><span class="lineCov"> 55986 : void raid_sort(int n, int *v)</span>
<span class="lineNum"> 27 </span> : {
<span class="lineNum"> 28 </span> : /* sorting networks generated with Batcher's Merge-Exchange */
<span class="lineNum"> 29 </span><span class="lineCov"> 55986 : switch (n) {</span>
<span class="lineNum"> 30 </span> : case 2:
<span class="lineNum"> 31 </span><span class="lineCov"> 36 : RAID_SWAP(0, 1);</span>
<span class="lineNum"> 32 </span><span class="lineCov"> 36 : break;</span>
<span class="lineNum"> 33 </span> : case 3:
<span class="lineNum"> 34 </span><span class="lineCov"> 216 : RAID_SWAP(0, 2);</span>
<span class="lineNum"> 35 </span><span class="lineCov"> 216 : RAID_SWAP(0, 1);</span>
<span class="lineNum"> 36 </span><span class="lineCov"> 216 : RAID_SWAP(1, 2);</span>
<span class="lineNum"> 37 </span><span class="lineCov"> 216 : break;</span>
<span class="lineNum"> 38 </span> : case 4:
<span class="lineNum"> 39 </span><span class="lineCov"> 1296 : RAID_SWAP(0, 2);</span>
<span class="lineNum"> 40 </span><span class="lineCov"> 1296 : RAID_SWAP(1, 3);</span>
<span class="lineNum"> 41 </span><span class="lineCov"> 1296 : RAID_SWAP(0, 1);</span>
<span class="lineNum"> 42 </span><span class="lineCov"> 1296 : RAID_SWAP(2, 3);</span>
<span class="lineNum"> 43 </span><span class="lineCov"> 1296 : RAID_SWAP(1, 2);</span>
<span class="lineNum"> 44 </span><span class="lineCov"> 1296 : break;</span>
<span class="lineNum"> 45 </span> : case 5:
<span class="lineNum"> 46 </span><span class="lineCov"> 7776 : RAID_SWAP(0, 4);</span>
<span class="lineNum"> 47 </span><span class="lineCov"> 7776 : RAID_SWAP(0, 2);</span>
<span class="lineNum"> 48 </span><span class="lineCov"> 7776 : RAID_SWAP(1, 3);</span>
<span class="lineNum"> 49 </span><span class="lineCov"> 7776 : RAID_SWAP(2, 4);</span>
<span class="lineNum"> 50 </span><span class="lineCov"> 7776 : RAID_SWAP(0, 1);</span>
<span class="lineNum"> 51 </span><span class="lineCov"> 7776 : RAID_SWAP(2, 3);</span>
<span class="lineNum"> 52 </span><span class="lineCov"> 7776 : RAID_SWAP(1, 4);</span>
<span class="lineNum"> 53 </span><span class="lineCov"> 7776 : RAID_SWAP(1, 2);</span>
<span class="lineNum"> 54 </span><span class="lineCov"> 7776 : RAID_SWAP(3, 4);</span>
<span class="lineNum"> 55 </span><span class="lineCov"> 7776 : break;</span>
<span class="lineNum"> 56 </span> : case 6:
<span class="lineNum"> 57 </span><span class="lineCov"> 46656 : RAID_SWAP(0, 4);</span>
<span class="lineNum"> 58 </span><span class="lineCov"> 46656 : RAID_SWAP(1, 5);</span>
<span class="lineNum"> 59 </span><span class="lineCov"> 46656 : RAID_SWAP(0, 2);</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 46656 : RAID_SWAP(1, 3);</span>
<span class="lineNum"> 61 </span><span class="lineCov"> 46656 : RAID_SWAP(2, 4);</span>
<span class="lineNum"> 62 </span><span class="lineCov"> 46656 : RAID_SWAP(3, 5);</span>
<span class="lineNum"> 63 </span><span class="lineCov"> 46656 : RAID_SWAP(0, 1);</span>
<span class="lineNum"> 64 </span><span class="lineCov"> 46656 : RAID_SWAP(2, 3);</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 46656 : RAID_SWAP(4, 5);</span>
<span class="lineNum"> 66 </span><span class="lineCov"> 46656 : RAID_SWAP(1, 4);</span>
<span class="lineNum"> 67 </span><span class="lineCov"> 46656 : RAID_SWAP(1, 2);</span>
<span class="lineNum"> 68 </span><span class="lineCov"> 46656 : RAID_SWAP(3, 4);</span>
<span class="lineNum"> 69 </span><span class="lineCov"> 46656 : break;</span>
<span class="lineNum"> 70 </span> : }
<a name="71"><span class="lineNum"> 71 </span><span class="lineCov"> 55986 : }</span></a>
<span class="lineNum"> 72 </span> :
<span class="lineNum"> 73 </span><span class="lineCov"> 324726 : void raid_insert(int n, int *v, int i)</span>
<span class="lineNum"> 74 </span> : {
<span class="lineNum"> 75 </span> : /* we don't use binary search because this is intended */
<span class="lineNum"> 76 </span> : /* for very small vectors and we want to optimize the case */
<span class="lineNum"> 77 </span> : /* of elements inserted already in order */
<span class="lineNum"> 78 </span> :
<span class="lineNum"> 79 </span> : /* insert at the end */
<span class="lineNum"> 80 </span><span class="lineCov"> 324726 : v[n] = i;</span>
<span class="lineNum"> 81 </span> :
<span class="lineNum"> 82 </span> : /* swap until in the correct position */
<span class="lineNum"> 83 </span><span class="lineCov"> 976977 : while (n &gt; 0 &amp;&amp; v[n - 1] &gt; v[n]) {</span>
<span class="lineNum"> 84 </span> : /* swap */
<span class="lineNum"> 85 </span><span class="lineCov"> 327525 : int t = v[n - 1];</span>
<span class="lineNum"> 86 </span> :
<span class="lineNum"> 87 </span><span class="lineCov"> 327525 : v[n - 1] = v[n];</span>
<span class="lineNum"> 88 </span><span class="lineCov"> 327525 : v[n] = t;</span>
<span class="lineNum"> 89 </span> :
<span class="lineNum"> 90 </span> : /* previous position */
<span class="lineNum"> 91 </span><span class="lineCov"> 327525 : --n;</span>
<span class="lineNum"> 92 </span> : }
<span class="lineNum"> 93 </span><span class="lineCov"> 324726 : }</span>
<span class="lineNum"> 94 </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>
Reference in a new issue View git blame Copy permalink