mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
727 lines
73 KiB
HTML
727 lines
73 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/module.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> - module.c<span style="font-size: 80%;"> (source / <a href="module.c.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">227</td>
|
|
<td class="headerCovTableEntry">228</td>
|
|
<td class="headerCovTableEntryHi">99.6 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2026-04-29 15:04:44</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">16</td>
|
|
<td class="headerCovTableEntry">16</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> : // SPDX-License-Identifier: GPL-2.0-or-later</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> : #include "internal.h"</a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : #include "memory.h"</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : #include "cpu.h"</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : </a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : /**</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : * Forwarders for parity generation.</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : *</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : * Set by the raid_mode() call.</a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : * </a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : * Index 0 is for one parity, 1 for the two parities, and so on.</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : */</a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : static raid_gen_fn* raid_gen_ptr[RAID_PARITY_MAX];</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : </a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : struct raid_gen_algo {</a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : raid_gen_fn *gen;</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : const char *tag; /**< Hardware descriptive tag. */</a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : };</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : </a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : /**</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : * Registered algorithms for parity generation.</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : *</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : * Set by the raid_gen_register() calls.</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : * </a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : * Indexes are the RAID_ALGO_* constants</a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : */</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : static struct raid_gen_algo raid_gen_algo[RAID_ALGO_MAX];</a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : </a>
|
|
<a name="31"><span class="lineNum"> 31 </span><span class="lineCov"> 1327991 : void raid_gen(int nd, int np, size_t size, void **v)</span></a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : {</a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : /* enforce limit on size */</a>
|
|
<a name="34"><span class="lineNum"> 34 </span><span class="lineCov"> 1327991 : BUG_ON(size % 64 != 0);</span></a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : </a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : /* enforce limit on number of failures */</a>
|
|
<a name="37"><span class="lineNum"> 37 </span><span class="lineCov"> 1327991 : BUG_ON(np < 1);</span></a>
|
|
<a name="38"><span class="lineNum"> 38 </span><span class="lineCov"> 1327991 : BUG_ON(np > RAID_PARITY_MAX);</span></a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : </a>
|
|
<a name="40"><span class="lineNum"> 40 </span><span class="lineCov"> 1327991 : raid_gen_ptr[np - 1](nd, size, v);</span></a>
|
|
<a name="41"><span class="lineNum"> 41 </span><span class="lineCov"> 1327991 : }</span></a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : </a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : /**</a>
|
|
<a name="44"><span class="lineNum"> 44 </span> : * Forwarders for data recovery.</a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : *</a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : * Set by the raid_mode() call.</a>
|
|
<a name="47"><span class="lineNum"> 47 </span> : * </a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : * Index 0 is for one parity, 1 for the two parities, and so on.</a>
|
|
<a name="49"><span class="lineNum"> 49 </span> : */</a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : static raid_rec_fn* raid_rec_ptr[RAID_PARITY_MAX]; </a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : </a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : struct raid_rec_algo {</a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : raid_rec_fn *rec;</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : const char *tag; /**< Hardware descriptive tag. */</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> : /**</a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : * Registered algorithms for data recovery.</a>
|
|
<a name="59"><span class="lineNum"> 59 </span> : *</a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : * Set by the raid_rec_register() calls.</a>
|
|
<a name="61"><span class="lineNum"> 61 </span> : * </a>
|
|
<a name="62"><span class="lineNum"> 62 </span> : * Indexes are the RAID_ALGO_* constants</a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : */</a>
|
|
<a name="64"><span class="lineNum"> 64 </span> : static struct raid_rec_algo raid_rec_algo[RAID_PARITY_MAX];</a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : </a>
|
|
<a name="66"><span class="lineNum"> 66 </span><span class="lineCov"> 870 : void raid_rec(int nr, int *ir, int nd, int np, size_t size, void **v)</span></a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : {</a>
|
|
<a name="68"><span class="lineNum"> 68 </span> : int nrd; /* number of data blocks to recover */</a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : int nrp; /* number of parity blocks to recover */</a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : </a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : /* enforce limit on size */</a>
|
|
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 870 : BUG_ON(size % 64 != 0);</span></a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : </a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : /* enforce limit on number of failures */</a>
|
|
<a name="75"><span class="lineNum"> 75 </span><span class="lineCov"> 870 : BUG_ON(nr > np);</span></a>
|
|
<a name="76"><span class="lineNum"> 76 </span><span class="lineCov"> 870 : BUG_ON(np > RAID_PARITY_MAX);</span></a>
|
|
<a name="77"><span class="lineNum"> 77 </span> : </a>
|
|
<a name="78"><span class="lineNum"> 78 </span> : /* enforce order in index vector */</a>
|
|
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 870 : BUG_ON(nr >= 2 && ir[0] >= ir[1]);</span></a>
|
|
<a name="80"><span class="lineNum"> 80 </span><span class="lineCov"> 870 : BUG_ON(nr >= 3 && ir[1] >= ir[2]);</span></a>
|
|
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 870 : BUG_ON(nr >= 4 && ir[2] >= ir[3]);</span></a>
|
|
<a name="82"><span class="lineNum"> 82 </span><span class="lineCov"> 870 : BUG_ON(nr >= 5 && ir[3] >= ir[4]);</span></a>
|
|
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 870 : BUG_ON(nr >= 6 && ir[4] >= ir[5]);</span></a>
|
|
<a name="84"><span class="lineNum"> 84 </span> : </a>
|
|
<a name="85"><span class="lineNum"> 85 </span> : /* enforce limit on index vector */</a>
|
|
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 870 : BUG_ON(nr > 0 && ir[nr-1] >= nd + np);</span></a>
|
|
<a name="87"><span class="lineNum"> 87 </span> : </a>
|
|
<a name="88"><span class="lineNum"> 88 </span> : /* count the number of data blocks to recover */</a>
|
|
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 870 : nrd = 0;</span></a>
|
|
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 2613 : while (nrd < nr && ir[nrd] < nd)</span></a>
|
|
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 1743 : ++nrd;</span></a>
|
|
<a name="92"><span class="lineNum"> 92 </span> : </a>
|
|
<a name="93"><span class="lineNum"> 93 </span> : /* all the remaining are parity */</a>
|
|
<a name="94"><span class="lineNum"> 94 </span><span class="lineCov"> 870 : nrp = nr - nrd;</span></a>
|
|
<a name="95"><span class="lineNum"> 95 </span> : </a>
|
|
<a name="96"><span class="lineNum"> 96 </span> : /* enforce limit on number of failures */</a>
|
|
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 870 : BUG_ON(nrd > nd);</span></a>
|
|
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 870 : BUG_ON(nrp > np);</span></a>
|
|
<a name="99"><span class="lineNum"> 99 </span> : </a>
|
|
<a name="100"><span class="lineNum"> 100 </span> : /* if failed data is present */</a>
|
|
<a name="101"><span class="lineNum"> 101 </span><span class="lineCov"> 870 : if (nrd != 0) {</span></a>
|
|
<a name="102"><span class="lineNum"> 102 </span> : int ip[RAID_PARITY_MAX];</a>
|
|
<a name="103"><span class="lineNum"> 103 </span> : int i, j, k;</a>
|
|
<a name="104"><span class="lineNum"> 104 </span> : </a>
|
|
<a name="105"><span class="lineNum"> 105 </span> : /* setup the vector of parities to use */</a>
|
|
<a name="106"><span class="lineNum"> 106 </span><span class="lineCov"> 6041 : for (i = 0, j = 0, k = 0; i < np; ++i) {</span></a>
|
|
<a name="107"><span class="lineNum"> 107 </span><span class="lineCov"> 5173 : if (j < nrp && ir[nrd + j] == nd + i) {</span></a>
|
|
<a name="108"><span class="lineNum"> 108 </span> : /* this parity has to be recovered */</a>
|
|
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 22 : ++j;</span></a>
|
|
<a name="110"><span class="lineNum"> 110 </span> : } else {</a>
|
|
<a name="111"><span class="lineNum"> 111 </span> : /* this parity is used for recovering */</a>
|
|
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 5151 : ip[k] = i;</span></a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 5151 : ++k;</span></a>
|
|
<a name="114"><span class="lineNum"> 114 </span> : }</a>
|
|
<a name="115"><span class="lineNum"> 115 </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> : * Recover the nrd data blocks specified in ir[],</a>
|
|
<a name="119"><span class="lineNum"> 119 </span> : * using the first nrd parity in ip[] for recovering</a>
|
|
<a name="120"><span class="lineNum"> 120 </span> : */</a>
|
|
<a name="121"><span class="lineNum"> 121 </span><span class="lineCov"> 868 : raid_rec_ptr[nrd - 1](nrd, ir, ip, nd, size, v);</span></a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : }</a>
|
|
<a name="123"><span class="lineNum"> 123 </span> : </a>
|
|
<a name="124"><span class="lineNum"> 124 </span> : /* recompute all the parities up to the last bad one */</a>
|
|
<a name="125"><span class="lineNum"> 125 </span><span class="lineCov"> 870 : if (nrp != 0)</span></a>
|
|
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 12 : raid_gen(nd, ir[nr - 1] - nd + 1, size, v);</span></a>
|
|
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 870 : }</span></a>
|
|
<a name="128"><span class="lineNum"> 128 </span> : </a>
|
|
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 227485 : void raid_data(int nr, int *id, int *ip, int nd, size_t size, void **v)</span></a>
|
|
<a name="130"><span class="lineNum"> 130 </span> : {</a>
|
|
<a name="131"><span class="lineNum"> 131 </span> : /* enforce limit on size */</a>
|
|
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 227485 : BUG_ON(size % 64 != 0);</span></a>
|
|
<a name="133"><span class="lineNum"> 133 </span> : </a>
|
|
<a name="134"><span class="lineNum"> 134 </span> : /* enforce limit on number of failures */</a>
|
|
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 227485 : BUG_ON(nr > nd);</span></a>
|
|
<a name="136"><span class="lineNum"> 136 </span><span class="lineCov"> 227485 : BUG_ON(nr > RAID_PARITY_MAX);</span></a>
|
|
<a name="137"><span class="lineNum"> 137 </span> : </a>
|
|
<a name="138"><span class="lineNum"> 138 </span> : /* enforce order in index vector for data */</a>
|
|
<a name="139"><span class="lineNum"> 139 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 2 && id[0] >= id[1]);</span></a>
|
|
<a name="140"><span class="lineNum"> 140 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 3 && id[1] >= id[2]);</span></a>
|
|
<a name="141"><span class="lineNum"> 141 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 4 && id[2] >= id[3]);</span></a>
|
|
<a name="142"><span class="lineNum"> 142 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 5 && id[3] >= id[4]);</span></a>
|
|
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 6 && id[4] >= id[5]);</span></a>
|
|
<a name="144"><span class="lineNum"> 144 </span> : </a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : /* enforce limit on index vector for data */</a>
|
|
<a name="146"><span class="lineNum"> 146 </span><span class="lineCov"> 227485 : BUG_ON(nr > 0 && id[nr-1] >= nd);</span></a>
|
|
<a name="147"><span class="lineNum"> 147 </span> : </a>
|
|
<a name="148"><span class="lineNum"> 148 </span> : /* enforce order in index vector for parity */</a>
|
|
<a name="149"><span class="lineNum"> 149 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 2 && ip[0] >= ip[1]);</span></a>
|
|
<a name="150"><span class="lineNum"> 150 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 3 && ip[1] >= ip[2]);</span></a>
|
|
<a name="151"><span class="lineNum"> 151 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 4 && ip[2] >= ip[3]);</span></a>
|
|
<a name="152"><span class="lineNum"> 152 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 5 && ip[3] >= ip[4]);</span></a>
|
|
<a name="153"><span class="lineNum"> 153 </span><span class="lineCov"> 227485 : BUG_ON(nr >= 6 && ip[4] >= ip[5]);</span></a>
|
|
<a name="154"><span class="lineNum"> 154 </span> : </a>
|
|
<a name="155"><span class="lineNum"> 155 </span> : /* if failed data is present */</a>
|
|
<a name="156"><span class="lineNum"> 156 </span><span class="lineCov"> 227485 : if (nr != 0)</span></a>
|
|
<a name="157"><span class="lineNum"> 157 </span><span class="lineCov"> 227483 : raid_rec_algo[nr - 1].rec(nr, id, ip, nd, size, v);</span></a>
|
|
<a name="158"><span class="lineNum"> 158 </span><span class="lineCov"> 227485 : }</span></a>
|
|
<a name="159"><span class="lineNum"> 159 </span> : </a>
|
|
<a name="160"><span class="lineNum"> 160 </span><span class="lineCov"> 35 : const char *raid_gen_tag(int na)</span></a>
|
|
<a name="161"><span class="lineNum"> 161 </span> : {</a>
|
|
<a name="162"><span class="lineNum"> 162 </span><span class="lineCov"> 35 : BUG_ON(na < 0 || na >= RAID_ALGO_MAX);</span></a>
|
|
<a name="163"><span class="lineNum"> 163 </span> : </a>
|
|
<a name="164"><span class="lineNum"> 164 </span><span class="lineCov"> 35 : return raid_gen_algo[na].tag;</span></a>
|
|
<a name="165"><span class="lineNum"> 165 </span> : }</a>
|
|
<a name="166"><span class="lineNum"> 166 </span> : </a>
|
|
<a name="167"><span class="lineNum"> 167 </span><span class="lineCov"> 30 : const char *raid_rec_tag(int na)</span></a>
|
|
<a name="168"><span class="lineNum"> 168 </span> : {</a>
|
|
<a name="169"><span class="lineNum"> 169 </span> : /* there is no custom recover for vandermonde */</a>
|
|
<a name="170"><span class="lineNum"> 170 </span><span class="lineCov"> 30 : if (na == RAID_ALGO_VANDERMONDE_PAR3)</span></a>
|
|
<a name="171"><span class="lineNum"> 171 </span><span class="lineNoCov"> 0 : na = RAID_ALGO_CAUCHY_PAR3;</span></a>
|
|
<a name="172"><span class="lineNum"> 172 </span> : </a>
|
|
<a name="173"><span class="lineNum"> 173 </span><span class="lineCov"> 30 : BUG_ON(na < 0 || na >= RAID_PARITY_MAX);</span></a>
|
|
<a name="174"><span class="lineNum"> 174 </span> : </a>
|
|
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 30 : return raid_rec_algo[na].tag;</span></a>
|
|
<a name="176"><span class="lineNum"> 176 </span> : }</a>
|
|
<a name="177"><span class="lineNum"> 177 </span> : </a>
|
|
<a name="178"><span class="lineNum"> 178 </span> : /**</a>
|
|
<a name="179"><span class="lineNum"> 179 </span> : * Generator matrix currently used.</a>
|
|
<a name="180"><span class="lineNum"> 180 </span> : */</a>
|
|
<a name="181"><span class="lineNum"> 181 </span> : const uint8_t (*raid_gfgen)[256];</a>
|
|
<a name="182"><span class="lineNum"> 182 </span> : </a>
|
|
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 642 : void raid_mode(int mode)</span></a>
|
|
<a name="184"><span class="lineNum"> 184 </span> : {</a>
|
|
<a name="185"><span class="lineNum"> 185 </span><span class="lineCov"> 642 : BUG_ON(mode != RAID_MODE_VANDERMONDE && mode != RAID_MODE_CAUCHY);</span></a>
|
|
<a name="186"><span class="lineNum"> 186 </span> : </a>
|
|
<a name="187"><span class="lineNum"> 187 </span><span class="lineCov"> 642 : if (mode == RAID_MODE_VANDERMONDE) {</span></a>
|
|
<a name="188"><span class="lineNum"> 188 </span><span class="lineCov"> 5 : raid_gen_ptr[0] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR1].gen;</span></a>
|
|
<a name="189"><span class="lineNum"> 189 </span><span class="lineCov"> 5 : raid_gen_ptr[1] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR2].gen;</span></a>
|
|
<a name="190"><span class="lineNum"> 190 </span><span class="lineCov"> 5 : raid_gen_ptr[2] = raid_gen_algo[RAID_ALGO_VANDERMONDE_PAR3].gen;</span></a>
|
|
<a name="191"><span class="lineNum"> 191 </span><span class="lineCov"> 5 : raid_gen_ptr[3] = 0;</span></a>
|
|
<a name="192"><span class="lineNum"> 192 </span><span class="lineCov"> 5 : raid_gen_ptr[4] = 0;</span></a>
|
|
<a name="193"><span class="lineNum"> 193 </span><span class="lineCov"> 5 : raid_gen_ptr[5] = 0;</span></a>
|
|
<a name="194"><span class="lineNum"> 194 </span><span class="lineCov"> 5 : raid_rec_ptr[0] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR1].rec;</span></a>
|
|
<a name="195"><span class="lineNum"> 195 </span><span class="lineCov"> 5 : raid_rec_ptr[1] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR2].rec;</span></a>
|
|
<a name="196"><span class="lineNum"> 196 </span><span class="lineCov"> 5 : raid_rec_ptr[2] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR3].rec;</span></a>
|
|
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 5 : raid_rec_ptr[3] = 0;</span></a>
|
|
<a name="198"><span class="lineNum"> 198 </span><span class="lineCov"> 5 : raid_rec_ptr[4] = 0;</span></a>
|
|
<a name="199"><span class="lineNum"> 199 </span><span class="lineCov"> 5 : raid_rec_ptr[5] = 0;</span></a>
|
|
<a name="200"><span class="lineNum"> 200 </span><span class="lineCov"> 5 : raid_gfgen = gfvandermonde;</span></a>
|
|
<a name="201"><span class="lineNum"> 201 </span> : } else {</a>
|
|
<a name="202"><span class="lineNum"> 202 </span><span class="lineCov"> 637 : raid_gen_ptr[0] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR1].gen;</span></a>
|
|
<a name="203"><span class="lineNum"> 203 </span><span class="lineCov"> 637 : raid_gen_ptr[1] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR2].gen;</span></a>
|
|
<a name="204"><span class="lineNum"> 204 </span><span class="lineCov"> 637 : raid_gen_ptr[2] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR3].gen;</span></a>
|
|
<a name="205"><span class="lineNum"> 205 </span><span class="lineCov"> 637 : raid_gen_ptr[3] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR4].gen;</span></a>
|
|
<a name="206"><span class="lineNum"> 206 </span><span class="lineCov"> 637 : raid_gen_ptr[4] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR5].gen;</span></a>
|
|
<a name="207"><span class="lineNum"> 207 </span><span class="lineCov"> 637 : raid_gen_ptr[5] = raid_gen_algo[RAID_ALGO_CAUCHY_PAR6].gen;</span></a>
|
|
<a name="208"><span class="lineNum"> 208 </span><span class="lineCov"> 637 : raid_rec_ptr[0] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR1].rec;</span></a>
|
|
<a name="209"><span class="lineNum"> 209 </span><span class="lineCov"> 637 : raid_rec_ptr[1] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR2].rec;</span></a>
|
|
<a name="210"><span class="lineNum"> 210 </span><span class="lineCov"> 637 : raid_rec_ptr[2] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR3].rec;</span></a>
|
|
<a name="211"><span class="lineNum"> 211 </span><span class="lineCov"> 637 : raid_rec_ptr[3] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR4].rec;</span></a>
|
|
<a name="212"><span class="lineNum"> 212 </span><span class="lineCov"> 637 : raid_rec_ptr[4] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR5].rec;</span></a>
|
|
<a name="213"><span class="lineNum"> 213 </span><span class="lineCov"> 637 : raid_rec_ptr[5] = raid_rec_algo[RAID_ALGO_CAUCHY_PAR6].rec;</span></a>
|
|
<a name="214"><span class="lineNum"> 214 </span><span class="lineCov"> 637 : raid_gfgen = gfcauchy;</span></a>
|
|
<a name="215"><span class="lineNum"> 215 </span> : }</a>
|
|
<a name="216"><span class="lineNum"> 216 </span><span class="lineCov"> 642 : }</span></a>
|
|
<a name="217"><span class="lineNum"> 217 </span> : </a>
|
|
<a name="218"><span class="lineNum"> 218 </span><span class="lineCov"> 119 : void raid_gen_force(int np, raid_gen_fn *fn)</span></a>
|
|
<a name="219"><span class="lineNum"> 219 </span> : {</a>
|
|
<a name="220"><span class="lineNum"> 220 </span><span class="lineCov"> 119 : BUG_ON(np < 1 || np > RAID_PARITY_MAX);</span></a>
|
|
<a name="221"><span class="lineNum"> 221 </span> : </a>
|
|
<a name="222"><span class="lineNum"> 222 </span><span class="lineCov"> 119 : raid_gen_ptr[np - 1] = fn;</span></a>
|
|
<a name="223"><span class="lineNum"> 223 </span><span class="lineCov"> 119 : }</span></a>
|
|
<a name="224"><span class="lineNum"> 224 </span> : </a>
|
|
<a name="225"><span class="lineNum"> 225 </span><span class="lineCov"> 6143 : void raid_gen_register(int na, const char *tag, raid_gen_fn *gen)</span></a>
|
|
<a name="226"><span class="lineNum"> 226 </span> : {</a>
|
|
<a name="227"><span class="lineNum"> 227 </span><span class="lineCov"> 6143 : BUG_ON(na < 0 || na >= RAID_ALGO_MAX);</span></a>
|
|
<a name="228"><span class="lineNum"> 228 </span> : </a>
|
|
<a name="229"><span class="lineNum"> 229 </span><span class="lineCov"> 6143 : raid_gen_algo[na].tag = tag;</span></a>
|
|
<a name="230"><span class="lineNum"> 230 </span><span class="lineCov"> 6143 : raid_gen_algo[na].gen = gen;</span></a>
|
|
<a name="231"><span class="lineNum"> 231 </span><span class="lineCov"> 6143 : }</span></a>
|
|
<a name="232"><span class="lineNum"> 232 </span> : </a>
|
|
<a name="233"><span class="lineNum"> 233 </span><span class="lineCov"> 3888 : void raid_rec_register(int na, const char *tag, raid_rec_fn *rec)</span></a>
|
|
<a name="234"><span class="lineNum"> 234 </span> : {</a>
|
|
<a name="235"><span class="lineNum"> 235 </span><span class="lineCov"> 3888 : BUG_ON(na < 0 || na >= RAID_PARITY_MAX);</span></a>
|
|
<a name="236"><span class="lineNum"> 236 </span> : </a>
|
|
<a name="237"><span class="lineNum"> 237 </span><span class="lineCov"> 3888 : raid_rec_algo[na].tag = tag;</span></a>
|
|
<a name="238"><span class="lineNum"> 238 </span><span class="lineCov"> 3888 : raid_rec_algo[na].rec = rec;</span></a>
|
|
<a name="239"><span class="lineNum"> 239 </span><span class="lineCov"> 3888 : }</span></a>
|
|
<a name="240"><span class="lineNum"> 240 </span> : </a>
|
|
<a name="241"><span class="lineNum"> 241 </span> : /*</a>
|
|
<a name="242"><span class="lineNum"> 242 </span> : * Initializes and selects the best algorithm.</a>
|
|
<a name="243"><span class="lineNum"> 243 </span> : */</a>
|
|
<a name="244"><span class="lineNum"> 244 </span><span class="lineCov"> 322 : void raid_init(void)</span></a>
|
|
<a name="245"><span class="lineNum"> 245 </span> : {</a>
|
|
<a name="246"><span class="lineNum"> 246 </span><span class="lineCov"> 322 : raid_register_int();</span></a>
|
|
<a name="247"><span class="lineNum"> 247 </span> : #if defined(CONFIG_X86) && defined(CONFIG_SSE2)</a>
|
|
<a name="248"><span class="lineNum"> 248 </span><span class="lineCov"> 322 : raid_register_x86();</span></a>
|
|
<a name="249"><span class="lineNum"> 249 </span> : #endif</a>
|
|
<a name="250"><span class="lineNum"> 250 </span> : </a>
|
|
<a name="251"><span class="lineNum"> 251 </span> : /* set the default mode */</a>
|
|
<a name="252"><span class="lineNum"> 252 </span><span class="lineCov"> 322 : raid_mode(RAID_MODE_CAUCHY);</span></a>
|
|
<a name="253"><span class="lineNum"> 253 </span><span class="lineCov"> 322 : }</span></a>
|
|
<a name="254"><span class="lineNum"> 254 </span> : </a>
|
|
<a name="255"><span class="lineNum"> 255 </span> : /*</a>
|
|
<a name="256"><span class="lineNum"> 256 </span> : * Reference parity computation.</a>
|
|
<a name="257"><span class="lineNum"> 257 </span> : */</a>
|
|
<a name="258"><span class="lineNum"> 258 </span><span class="lineCov"> 6 : void raid_gen_ref(int nd, int np, size_t size, void **vv)</span></a>
|
|
<a name="259"><span class="lineNum"> 259 </span> : {</a>
|
|
<a name="260"><span class="lineNum"> 260 </span><span class="lineCov"> 6 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="261"><span class="lineNum"> 261 </span> : size_t i;</a>
|
|
<a name="262"><span class="lineNum"> 262 </span> : </a>
|
|
<a name="263"><span class="lineNum"> 263 </span><span class="lineCov"> 5382 : for (i = 0; i < size; ++i) {</span></a>
|
|
<a name="264"><span class="lineNum"> 264 </span> : uint8_t p[RAID_PARITY_MAX];</a>
|
|
<a name="265"><span class="lineNum"> 265 </span> : int j, d;</a>
|
|
<a name="266"><span class="lineNum"> 266 </span> : </a>
|
|
<a name="267"><span class="lineNum"> 267 </span><span class="lineCov"> 36096 : for (j = 0; j < np; ++j)</span></a>
|
|
<a name="268"><span class="lineNum"> 268 </span><span class="lineCov"> 30720 : p[j] = 0;</span></a>
|
|
<a name="269"><span class="lineNum"> 269 </span> : </a>
|
|
<a name="270"><span class="lineNum"> 270 </span><span class="lineCov"> 93696 : for (d = 0; d < nd; ++d) {</span></a>
|
|
<a name="271"><span class="lineNum"> 271 </span><span class="lineCov"> 88320 : uint8_t b = v[d][i];</span></a>
|
|
<a name="272"><span class="lineNum"> 272 </span> : </a>
|
|
<a name="273"><span class="lineNum"> 273 </span><span class="lineCov"> 584448 : for (j = 0; j < np; ++j)</span></a>
|
|
<a name="274"><span class="lineNum"> 274 </span><span class="lineCov"> 496128 : p[j] ^= gfmul[b][gfgen[j][d]];</span></a>
|
|
<a name="275"><span class="lineNum"> 275 </span> : }</a>
|
|
<a name="276"><span class="lineNum"> 276 </span> : </a>
|
|
<a name="277"><span class="lineNum"> 277 </span><span class="lineCov"> 36096 : for (j = 0; j < np; ++j)</span></a>
|
|
<a name="278"><span class="lineNum"> 278 </span><span class="lineCov"> 30720 : v[nd + j][i] = p[j];</span></a>
|
|
<a name="279"><span class="lineNum"> 279 </span> : }</a>
|
|
<a name="280"><span class="lineNum"> 280 </span><span class="lineCov"> 6 : }</span></a>
|
|
<a name="281"><span class="lineNum"> 281 </span> : </a>
|
|
<a name="282"><span class="lineNum"> 282 </span> : /*</a>
|
|
<a name="283"><span class="lineNum"> 283 </span> : * Size of the blocks to test.</a>
|
|
<a name="284"><span class="lineNum"> 284 </span> : */</a>
|
|
<a name="285"><span class="lineNum"> 285 </span> : #define TEST_SIZE 4096</a>
|
|
<a name="286"><span class="lineNum"> 286 </span> : </a>
|
|
<a name="287"><span class="lineNum"> 287 </span> : /*</a>
|
|
<a name="288"><span class="lineNum"> 288 </span> : * Number of data blocks to test.</a>
|
|
<a name="289"><span class="lineNum"> 289 </span> : */</a>
|
|
<a name="290"><span class="lineNum"> 290 </span> : #define TEST_COUNT (65536 / TEST_SIZE)</a>
|
|
<a name="291"><span class="lineNum"> 291 </span> : </a>
|
|
<a name="292"><span class="lineNum"> 292 </span> : /*</a>
|
|
<a name="293"><span class="lineNum"> 293 </span> : * Parity generation test.</a>
|
|
<a name="294"><span class="lineNum"> 294 </span> : */</a>
|
|
<a name="295"><span class="lineNum"> 295 </span><span class="lineCov"> 6 : static int raid_test_par(int nd, int np, size_t size, void **v, void **ref)</span></a>
|
|
<a name="296"><span class="lineNum"> 296 </span> : {</a>
|
|
<a name="297"><span class="lineNum"> 297 </span> : int i;</a>
|
|
<a name="298"><span class="lineNum"> 298 </span> : void *t[TEST_COUNT + RAID_PARITY_MAX];</a>
|
|
<a name="299"><span class="lineNum"> 299 </span> : </a>
|
|
<a name="300"><span class="lineNum"> 300 </span> : /* setup data */</a>
|
|
<a name="301"><span class="lineNum"> 301 </span><span class="lineCov"> 102 : for (i = 0; i < nd; ++i)</span></a>
|
|
<a name="302"><span class="lineNum"> 302 </span><span class="lineCov"> 96 : t[i] = ref[i];</span></a>
|
|
<a name="303"><span class="lineNum"> 303 </span> : </a>
|
|
<a name="304"><span class="lineNum"> 304 </span> : /* setup parity */</a>
|
|
<a name="305"><span class="lineNum"> 305 </span><span class="lineCov"> 27 : for (i = 0; i < np; ++i)</span></a>
|
|
<a name="306"><span class="lineNum"> 306 </span><span class="lineCov"> 21 : t[nd + i] = v[nd + i];</span></a>
|
|
<a name="307"><span class="lineNum"> 307 </span> : </a>
|
|
<a name="308"><span class="lineNum"> 308 </span><span class="lineCov"> 6 : raid_gen(nd, np, size, t);</span></a>
|
|
<a name="309"><span class="lineNum"> 309 </span> : </a>
|
|
<a name="310"><span class="lineNum"> 310 </span> : /* compare parity */</a>
|
|
<a name="311"><span class="lineNum"> 311 </span><span class="lineCov"> 27 : for (i = 0; i < np; ++i) {</span></a>
|
|
<a name="312"><span class="lineNum"> 312 </span><span class="lineCov"> 21 : if (memcmp(t[nd + i], ref[nd + i], size) != 0) {</span></a>
|
|
<a name="313"><span class="lineNum"> 313 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="314"><span class="lineNum"> 314 </span> : return -1;</a>
|
|
<a name="315"><span class="lineNum"> 315 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="316"><span class="lineNum"> 316 </span> : }</a>
|
|
<a name="317"><span class="lineNum"> 317 </span> : }</a>
|
|
<a name="318"><span class="lineNum"> 318 </span> : </a>
|
|
<a name="319"><span class="lineNum"> 319 </span><span class="lineCov"> 6 : return 0;</span></a>
|
|
<a name="320"><span class="lineNum"> 320 </span> : }</a>
|
|
<a name="321"><span class="lineNum"> 321 </span> : </a>
|
|
<a name="322"><span class="lineNum"> 322 </span> : /*</a>
|
|
<a name="323"><span class="lineNum"> 323 </span> : * Recovering test.</a>
|
|
<a name="324"><span class="lineNum"> 324 </span> : */</a>
|
|
<a name="325"><span class="lineNum"> 325 </span><span class="lineCov"> 18 : static int raid_test_rec(int nr, int *ir, int nd, int np, size_t size, void **v, void **ref)</span></a>
|
|
<a name="326"><span class="lineNum"> 326 </span> : {</a>
|
|
<a name="327"><span class="lineNum"> 327 </span> : int i, j;</a>
|
|
<a name="328"><span class="lineNum"> 328 </span> : void *t[TEST_COUNT + RAID_PARITY_MAX];</a>
|
|
<a name="329"><span class="lineNum"> 329 </span> : </a>
|
|
<a name="330"><span class="lineNum"> 330 </span> : /* setup data and parity vector */</a>
|
|
<a name="331"><span class="lineNum"> 331 </span><span class="lineCov"> 369 : for (i = 0, j = 0; i < nd + np; ++i) {</span></a>
|
|
<a name="332"><span class="lineNum"> 332 </span><span class="lineCov"> 351 : if (j < nr && ir[j] == i) {</span></a>
|
|
<a name="333"><span class="lineNum"> 333 </span> : /* this block has to be recovered */</a>
|
|
<a name="334"><span class="lineNum"> 334 </span><span class="lineCov"> 63 : t[i] = v[i];</span></a>
|
|
<a name="335"><span class="lineNum"> 335 </span><span class="lineCov"> 63 : ++j;</span></a>
|
|
<a name="336"><span class="lineNum"> 336 </span> : } else {</a>
|
|
<a name="337"><span class="lineNum"> 337 </span> : /* this block is used for recovering */</a>
|
|
<a name="338"><span class="lineNum"> 338 </span><span class="lineCov"> 288 : t[i] = ref[i];</span></a>
|
|
<a name="339"><span class="lineNum"> 339 </span> : }</a>
|
|
<a name="340"><span class="lineNum"> 340 </span> : }</a>
|
|
<a name="341"><span class="lineNum"> 341 </span> : </a>
|
|
<a name="342"><span class="lineNum"> 342 </span><span class="lineCov"> 18 : raid_rec(nr, ir, nd, np, size, t);</span></a>
|
|
<a name="343"><span class="lineNum"> 343 </span> : </a>
|
|
<a name="344"><span class="lineNum"> 344 </span> : /* compare all data and parity */</a>
|
|
<a name="345"><span class="lineNum"> 345 </span><span class="lineCov"> 369 : for (i = 0; i < nd + np; ++i) {</span></a>
|
|
<a name="346"><span class="lineNum"> 346 </span><span class="lineCov"> 351 : if (t[i] != ref[i]</span></a>
|
|
<a name="347"><span class="lineNum"> 347 </span><span class="lineCov"> 63 : && memcmp(t[i], ref[i], size) != 0) {</span></a>
|
|
<a name="348"><span class="lineNum"> 348 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="349"><span class="lineNum"> 349 </span> : return -1;</a>
|
|
<a name="350"><span class="lineNum"> 350 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="351"><span class="lineNum"> 351 </span> : }</a>
|
|
<a name="352"><span class="lineNum"> 352 </span> : }</a>
|
|
<a name="353"><span class="lineNum"> 353 </span> : </a>
|
|
<a name="354"><span class="lineNum"> 354 </span><span class="lineCov"> 18 : return 0;</span></a>
|
|
<a name="355"><span class="lineNum"> 355 </span> : }</a>
|
|
<a name="356"><span class="lineNum"> 356 </span> : </a>
|
|
<a name="357"><span class="lineNum"> 357 </span> : /*</a>
|
|
<a name="358"><span class="lineNum"> 358 </span> : * Recovering test for data.</a>
|
|
<a name="359"><span class="lineNum"> 359 </span> : */</a>
|
|
<a name="360"><span class="lineNum"> 360 </span><span class="lineCov"> 18 : static int raid_test_data(int nr, int *id, int *ip, int nd, int np, size_t size, void **v, void **ref)</span></a>
|
|
<a name="361"><span class="lineNum"> 361 </span> : {</a>
|
|
<a name="362"><span class="lineNum"> 362 </span> : int i, j;</a>
|
|
<a name="363"><span class="lineNum"> 363 </span> : void *t[TEST_COUNT + RAID_PARITY_MAX];</a>
|
|
<a name="364"><span class="lineNum"> 364 </span> : </a>
|
|
<a name="365"><span class="lineNum"> 365 </span> : /* setup data vector */</a>
|
|
<a name="366"><span class="lineNum"> 366 </span><span class="lineCov"> 306 : for (i = 0, j = 0; i < nd; ++i) {</span></a>
|
|
<a name="367"><span class="lineNum"> 367 </span><span class="lineCov"> 288 : if (j < nr && id[j] == i) {</span></a>
|
|
<a name="368"><span class="lineNum"> 368 </span> : /* this block has to be recovered */</a>
|
|
<a name="369"><span class="lineNum"> 369 </span><span class="lineCov"> 39 : t[i] = v[i];</span></a>
|
|
<a name="370"><span class="lineNum"> 370 </span><span class="lineCov"> 39 : ++j;</span></a>
|
|
<a name="371"><span class="lineNum"> 371 </span> : } else {</a>
|
|
<a name="372"><span class="lineNum"> 372 </span> : /* this block is left unchanged */</a>
|
|
<a name="373"><span class="lineNum"> 373 </span><span class="lineCov"> 249 : t[i] = ref[i];</span></a>
|
|
<a name="374"><span class="lineNum"> 374 </span> : }</a>
|
|
<a name="375"><span class="lineNum"> 375 </span> : }</a>
|
|
<a name="376"><span class="lineNum"> 376 </span> : </a>
|
|
<a name="377"><span class="lineNum"> 377 </span> : /* setup parity vector */</a>
|
|
<a name="378"><span class="lineNum"> 378 </span><span class="lineCov"> 81 : for (i = 0, j = 0; i < np; ++i) {</span></a>
|
|
<a name="379"><span class="lineNum"> 379 </span><span class="lineCov"> 63 : if (j < nr && ip[j] == i) {</span></a>
|
|
<a name="380"><span class="lineNum"> 380 </span> : /* this block is used for recovering */</a>
|
|
<a name="381"><span class="lineNum"> 381 </span><span class="lineCov"> 39 : t[nd + i] = ref[nd + i];</span></a>
|
|
<a name="382"><span class="lineNum"> 382 </span><span class="lineCov"> 39 : ++j;</span></a>
|
|
<a name="383"><span class="lineNum"> 383 </span> : } else {</a>
|
|
<a name="384"><span class="lineNum"> 384 </span> : /* this block should not be read or written */</a>
|
|
<a name="385"><span class="lineNum"> 385 </span><span class="lineCov"> 24 : t[nd + i] = 0;</span></a>
|
|
<a name="386"><span class="lineNum"> 386 </span> : }</a>
|
|
<a name="387"><span class="lineNum"> 387 </span> : }</a>
|
|
<a name="388"><span class="lineNum"> 388 </span> : </a>
|
|
<a name="389"><span class="lineNum"> 389 </span><span class="lineCov"> 18 : raid_data(nr, id, ip, nd, size, t);</span></a>
|
|
<a name="390"><span class="lineNum"> 390 </span> : </a>
|
|
<a name="391"><span class="lineNum"> 391 </span> : /* compare all data and parity */</a>
|
|
<a name="392"><span class="lineNum"> 392 </span><span class="lineCov"> 306 : for (i = 0; i < nd; ++i) {</span></a>
|
|
<a name="393"><span class="lineNum"> 393 </span><span class="lineCov"> 288 : if (t[i] != ref[i]</span></a>
|
|
<a name="394"><span class="lineNum"> 394 </span><span class="lineCov"> 39 : && t[i] != 0</span></a>
|
|
<a name="395"><span class="lineNum"> 395 </span><span class="lineCov"> 39 : && memcmp(t[i], ref[i], size) != 0) {</span></a>
|
|
<a name="396"><span class="lineNum"> 396 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="397"><span class="lineNum"> 397 </span> : return -1;</a>
|
|
<a name="398"><span class="lineNum"> 398 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="399"><span class="lineNum"> 399 </span> : }</a>
|
|
<a name="400"><span class="lineNum"> 400 </span> : }</a>
|
|
<a name="401"><span class="lineNum"> 401 </span> : </a>
|
|
<a name="402"><span class="lineNum"> 402 </span><span class="lineCov"> 18 : return 0;</span></a>
|
|
<a name="403"><span class="lineNum"> 403 </span> : }</a>
|
|
<a name="404"><span class="lineNum"> 404 </span> : </a>
|
|
<a name="405"><span class="lineNum"> 405 </span> : /*</a>
|
|
<a name="406"><span class="lineNum"> 406 </span> : * Scan test.</a>
|
|
<a name="407"><span class="lineNum"> 407 </span> : */</a>
|
|
<a name="408"><span class="lineNum"> 408 </span><span class="lineCov"> 7 : static int raid_test_scan(int nr, int *ir, int nd, int np, size_t size, void **v, void **ref)</span></a>
|
|
<a name="409"><span class="lineNum"> 409 </span> : {</a>
|
|
<a name="410"><span class="lineNum"> 410 </span> : int i, j, ret;</a>
|
|
<a name="411"><span class="lineNum"> 411 </span> : void *t[TEST_COUNT + RAID_PARITY_MAX];</a>
|
|
<a name="412"><span class="lineNum"> 412 </span> : int is[RAID_PARITY_MAX];</a>
|
|
<a name="413"><span class="lineNum"> 413 </span> : </a>
|
|
<a name="414"><span class="lineNum"> 414 </span> : /* setup data and parity vector */</a>
|
|
<a name="415"><span class="lineNum"> 415 </span><span class="lineCov"> 140 : for (i = 0, j = 0; i < nd + np; ++i) {</span></a>
|
|
<a name="416"><span class="lineNum"> 416 </span><span class="lineCov"> 133 : if (j < nr && ir[j] == i) {</span></a>
|
|
<a name="417"><span class="lineNum"> 417 </span> : /* this block is bad */</a>
|
|
<a name="418"><span class="lineNum"> 418 </span><span class="lineCov"> 15 : t[i] = v[i];</span></a>
|
|
<a name="419"><span class="lineNum"> 419 </span><span class="lineCov"> 15 : ++j;</span></a>
|
|
<a name="420"><span class="lineNum"> 420 </span> : } else {</a>
|
|
<a name="421"><span class="lineNum"> 421 </span> : /* this block is used for recovering */</a>
|
|
<a name="422"><span class="lineNum"> 422 </span><span class="lineCov"> 118 : t[i] = ref[i];</span></a>
|
|
<a name="423"><span class="lineNum"> 423 </span> : }</a>
|
|
<a name="424"><span class="lineNum"> 424 </span> : }</a>
|
|
<a name="425"><span class="lineNum"> 425 </span> : </a>
|
|
<a name="426"><span class="lineNum"> 426 </span><span class="lineCov"> 7 : ret = raid_scan(is, nd, np, size, t);</span></a>
|
|
<a name="427"><span class="lineNum"> 427 </span> : </a>
|
|
<a name="428"><span class="lineNum"> 428 </span> : /* compare identified bad blocks */</a>
|
|
<a name="429"><span class="lineNum"> 429 </span><span class="lineCov"> 7 : if (ret != nr)</span></a>
|
|
<a name="430"><span class="lineNum"> 430 </span><span class="lineCov"> 1 : return -1;</span></a>
|
|
<a name="431"><span class="lineNum"> 431 </span><span class="lineCov"> 21 : for (i = 0; i < nr; ++i) {</span></a>
|
|
<a name="432"><span class="lineNum"> 432 </span><span class="lineCov"> 15 : if (ir[i] != is[i]) {</span></a>
|
|
<a name="433"><span class="lineNum"> 433 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="434"><span class="lineNum"> 434 </span> : return -1;</a>
|
|
<a name="435"><span class="lineNum"> 435 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="436"><span class="lineNum"> 436 </span> : }</a>
|
|
<a name="437"><span class="lineNum"> 437 </span> : }</a>
|
|
<a name="438"><span class="lineNum"> 438 </span> : </a>
|
|
<a name="439"><span class="lineNum"> 439 </span><span class="lineCov"> 6 : return 0;</span></a>
|
|
<a name="440"><span class="lineNum"> 440 </span> : }</a>
|
|
<a name="441"><span class="lineNum"> 441 </span> : </a>
|
|
<a name="442"><span class="lineNum"> 442 </span><span class="lineCov"> 1 : int raid_selftest(void)</span></a>
|
|
<a name="443"><span class="lineNum"> 443 </span><span class="lineCov"> 1 : {</span></a>
|
|
<a name="444"><span class="lineNum"> 444 </span><span class="lineCov"> 1 : const int nd = TEST_COUNT;</span></a>
|
|
<a name="445"><span class="lineNum"> 445 </span><span class="lineCov"> 1 : const size_t size = TEST_SIZE;</span></a>
|
|
<a name="446"><span class="lineNum"> 446 </span><span class="lineCov"> 1 : const int nv = nd + RAID_PARITY_MAX * 2 + 1;</span></a>
|
|
<a name="447"><span class="lineNum"> 447 </span> : void *v_alloc;</a>
|
|
<a name="448"><span class="lineNum"> 448 </span> : void **v;</a>
|
|
<a name="449"><span class="lineNum"> 449 </span><span class="lineCov"> 1 : void *ref[nd + RAID_PARITY_MAX];</span></a>
|
|
<a name="450"><span class="lineNum"> 450 </span> : int ir[RAID_PARITY_MAX];</a>
|
|
<a name="451"><span class="lineNum"> 451 </span> : int ip[RAID_PARITY_MAX];</a>
|
|
<a name="452"><span class="lineNum"> 452 </span> : int i, np;</a>
|
|
<a name="453"><span class="lineNum"> 453 </span><span class="lineCov"> 1 : int ret = 0;</span></a>
|
|
<a name="454"><span class="lineNum"> 454 </span> : </a>
|
|
<a name="455"><span class="lineNum"> 455 </span> : /* ensure to have enough space for data */</a>
|
|
<a name="456"><span class="lineNum"> 456 </span><span class="lineCov"> 1 : BUG_ON(nd * size > 65536);</span></a>
|
|
<a name="457"><span class="lineNum"> 457 </span> : </a>
|
|
<a name="458"><span class="lineNum"> 458 </span><span class="lineCov"> 1 : v = raid_malloc_vector(nd, nv, size, &v_alloc);</span></a>
|
|
<a name="459"><span class="lineNum"> 459 </span><span class="lineCov"> 1 : if (!v) {</span></a>
|
|
<a name="460"><span class="lineNum"> 460 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="461"><span class="lineNum"> 461 </span> : return -1;</a>
|
|
<a name="462"><span class="lineNum"> 462 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="463"><span class="lineNum"> 463 </span> : }</a>
|
|
<a name="464"><span class="lineNum"> 464 </span> : </a>
|
|
<a name="465"><span class="lineNum"> 465 </span><span class="lineCov"> 1 : memset(v[nv - 1], 0, size);</span></a>
|
|
<a name="466"><span class="lineNum"> 466 </span><span class="lineCov"> 1 : raid_zero(v[nv - 1]);</span></a>
|
|
<a name="467"><span class="lineNum"> 467 </span> : </a>
|
|
<a name="468"><span class="lineNum"> 468 </span> : /* use the multiplication table as data */</a>
|
|
<a name="469"><span class="lineNum"> 469 </span><span class="lineCov"> 17 : for (i = 0; i < nd; ++i)</span></a>
|
|
<a name="470"><span class="lineNum"> 470 </span><span class="lineCov"> 16 : ref[i] = ((uint8_t *)gfmul) + size * i;</span></a>
|
|
<a name="471"><span class="lineNum"> 471 </span> : </a>
|
|
<a name="472"><span class="lineNum"> 472 </span> : /* setup reference parity */</a>
|
|
<a name="473"><span class="lineNum"> 473 </span><span class="lineCov"> 7 : for (i = 0; i < RAID_PARITY_MAX; ++i)</span></a>
|
|
<a name="474"><span class="lineNum"> 474 </span><span class="lineCov"> 6 : ref[nd + i] = v[nd + RAID_PARITY_MAX + i];</span></a>
|
|
<a name="475"><span class="lineNum"> 475 </span> : </a>
|
|
<a name="476"><span class="lineNum"> 476 </span> : /* compute reference parity */</a>
|
|
<a name="477"><span class="lineNum"> 477 </span><span class="lineCov"> 1 : raid_gen_ref(nd, RAID_PARITY_MAX, size, ref);</span></a>
|
|
<a name="478"><span class="lineNum"> 478 </span> : </a>
|
|
<a name="479"><span class="lineNum"> 479 </span> : /* test for each parity level */</a>
|
|
<a name="480"><span class="lineNum"> 480 </span><span class="lineCov"> 7 : for (np = 1; np <= RAID_PARITY_MAX; ++np) {</span></a>
|
|
<a name="481"><span class="lineNum"> 481 </span> : /* test parity generation */</a>
|
|
<a name="482"><span class="lineNum"> 482 </span><span class="lineCov"> 6 : ret = raid_test_par(nd, np, size, v, ref);</span></a>
|
|
<a name="483"><span class="lineNum"> 483 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="484"><span class="lineNum"> 484 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="485"><span class="lineNum"> 485 </span> : goto bail;</a>
|
|
<a name="486"><span class="lineNum"> 486 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="487"><span class="lineNum"> 487 </span> : }</a>
|
|
<a name="488"><span class="lineNum"> 488 </span> : </a>
|
|
<a name="489"><span class="lineNum"> 489 </span> : /* test recovering with broken ending data disks */</a>
|
|
<a name="490"><span class="lineNum"> 490 </span><span class="lineCov"> 27 : for (i = 0; i < np; ++i) {</span></a>
|
|
<a name="491"><span class="lineNum"> 491 </span> : /* bad data */</a>
|
|
<a name="492"><span class="lineNum"> 492 </span><span class="lineCov"> 21 : ir[i] = nd - np + i;</span></a>
|
|
<a name="493"><span class="lineNum"> 493 </span> : </a>
|
|
<a name="494"><span class="lineNum"> 494 </span> : /* good parity */</a>
|
|
<a name="495"><span class="lineNum"> 495 </span><span class="lineCov"> 21 : ip[i] = i;</span></a>
|
|
<a name="496"><span class="lineNum"> 496 </span> : }</a>
|
|
<a name="497"><span class="lineNum"> 497 </span> : </a>
|
|
<a name="498"><span class="lineNum"> 498 </span><span class="lineCov"> 6 : ret = raid_test_rec(np, ir, nd, np, size, v, ref);</span></a>
|
|
<a name="499"><span class="lineNum"> 499 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="500"><span class="lineNum"> 500 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="501"><span class="lineNum"> 501 </span> : goto bail;</a>
|
|
<a name="502"><span class="lineNum"> 502 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="503"><span class="lineNum"> 503 </span> : }</a>
|
|
<a name="504"><span class="lineNum"> 504 </span> : </a>
|
|
<a name="505"><span class="lineNum"> 505 </span><span class="lineCov"> 6 : ret = raid_test_data(np, ir, ip, nd, np, size, v, ref);</span></a>
|
|
<a name="506"><span class="lineNum"> 506 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="507"><span class="lineNum"> 507 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="508"><span class="lineNum"> 508 </span> : goto bail;</a>
|
|
<a name="509"><span class="lineNum"> 509 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="510"><span class="lineNum"> 510 </span> : }</a>
|
|
<a name="511"><span class="lineNum"> 511 </span> : </a>
|
|
<a name="512"><span class="lineNum"> 512 </span> : /* test recovering with broken leading data and broken leading parity */</a>
|
|
<a name="513"><span class="lineNum"> 513 </span><span class="lineCov"> 15 : for (i = 0; i < np / 2; ++i) {</span></a>
|
|
<a name="514"><span class="lineNum"> 514 </span> : /* bad data */</a>
|
|
<a name="515"><span class="lineNum"> 515 </span><span class="lineCov"> 9 : ir[i] = i;</span></a>
|
|
<a name="516"><span class="lineNum"> 516 </span> : </a>
|
|
<a name="517"><span class="lineNum"> 517 </span> : /* good parity */</a>
|
|
<a name="518"><span class="lineNum"> 518 </span><span class="lineCov"> 9 : ip[i] = (np + 1) / 2 + i;</span></a>
|
|
<a name="519"><span class="lineNum"> 519 </span> : }</a>
|
|
<a name="520"><span class="lineNum"> 520 </span> : </a>
|
|
<a name="521"><span class="lineNum"> 521 </span> : /* bad parity */</a>
|
|
<a name="522"><span class="lineNum"> 522 </span><span class="lineCov"> 18 : for (i = 0; i < (np + 1) / 2; ++i)</span></a>
|
|
<a name="523"><span class="lineNum"> 523 </span><span class="lineCov"> 12 : ir[np / 2 + i] = nd + i;</span></a>
|
|
<a name="524"><span class="lineNum"> 524 </span> : </a>
|
|
<a name="525"><span class="lineNum"> 525 </span><span class="lineCov"> 6 : ret = raid_test_rec(np, ir, nd, np, size, v, ref);</span></a>
|
|
<a name="526"><span class="lineNum"> 526 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="527"><span class="lineNum"> 527 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="528"><span class="lineNum"> 528 </span> : goto bail;</a>
|
|
<a name="529"><span class="lineNum"> 529 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="530"><span class="lineNum"> 530 </span> : }</a>
|
|
<a name="531"><span class="lineNum"> 531 </span> : </a>
|
|
<a name="532"><span class="lineNum"> 532 </span><span class="lineCov"> 6 : ret = raid_test_data(np / 2, ir, ip, nd, np, size, v, ref);</span></a>
|
|
<a name="533"><span class="lineNum"> 533 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="534"><span class="lineNum"> 534 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="535"><span class="lineNum"> 535 </span> : goto bail;</a>
|
|
<a name="536"><span class="lineNum"> 536 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="537"><span class="lineNum"> 537 </span> : }</a>
|
|
<a name="538"><span class="lineNum"> 538 </span> : </a>
|
|
<a name="539"><span class="lineNum"> 539 </span> : /* test recovering with broken leading data and broken ending parity */</a>
|
|
<a name="540"><span class="lineNum"> 540 </span><span class="lineCov"> 15 : for (i = 0; i < np / 2; ++i) {</span></a>
|
|
<a name="541"><span class="lineNum"> 541 </span> : /* bad data */</a>
|
|
<a name="542"><span class="lineNum"> 542 </span><span class="lineCov"> 9 : ir[i] = i;</span></a>
|
|
<a name="543"><span class="lineNum"> 543 </span> : </a>
|
|
<a name="544"><span class="lineNum"> 544 </span> : /* good parity */</a>
|
|
<a name="545"><span class="lineNum"> 545 </span><span class="lineCov"> 9 : ip[i] = i;</span></a>
|
|
<a name="546"><span class="lineNum"> 546 </span> : }</a>
|
|
<a name="547"><span class="lineNum"> 547 </span> : </a>
|
|
<a name="548"><span class="lineNum"> 548 </span> : /* bad parity */</a>
|
|
<a name="549"><span class="lineNum"> 549 </span><span class="lineCov"> 18 : for (i = 0; i < (np + 1) / 2; ++i)</span></a>
|
|
<a name="550"><span class="lineNum"> 550 </span><span class="lineCov"> 12 : ir[np / 2 + i] = nd + np - (np + 1) / 2 + i;</span></a>
|
|
<a name="551"><span class="lineNum"> 551 </span> : </a>
|
|
<a name="552"><span class="lineNum"> 552 </span><span class="lineCov"> 6 : ret = raid_test_rec(np, ir, nd, np, size, v, ref);</span></a>
|
|
<a name="553"><span class="lineNum"> 553 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="554"><span class="lineNum"> 554 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="555"><span class="lineNum"> 555 </span> : goto bail;</a>
|
|
<a name="556"><span class="lineNum"> 556 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="557"><span class="lineNum"> 557 </span> : }</a>
|
|
<a name="558"><span class="lineNum"> 558 </span> : </a>
|
|
<a name="559"><span class="lineNum"> 559 </span><span class="lineCov"> 6 : ret = raid_test_data(np / 2, ir, ip, nd, np, size, v, ref);</span></a>
|
|
<a name="560"><span class="lineNum"> 560 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="561"><span class="lineNum"> 561 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="562"><span class="lineNum"> 562 </span> : goto bail;</a>
|
|
<a name="563"><span class="lineNum"> 563 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="564"><span class="lineNum"> 564 </span> : }</a>
|
|
<a name="565"><span class="lineNum"> 565 </span> : </a>
|
|
<a name="566"><span class="lineNum"> 566 </span> : /* scan test with broken data and parity */</a>
|
|
<a name="567"><span class="lineNum"> 567 </span><span class="lineCov"> 15 : for (i = 0; i < np / 2; ++i) {</span></a>
|
|
<a name="568"><span class="lineNum"> 568 </span> : /* bad data */</a>
|
|
<a name="569"><span class="lineNum"> 569 </span><span class="lineCov"> 9 : ir[i] = i;</span></a>
|
|
<a name="570"><span class="lineNum"> 570 </span> : }</a>
|
|
<a name="571"><span class="lineNum"> 571 </span><span class="lineCov"> 12 : for (i = 0; i < (np - 1) / 2; ++i) {</span></a>
|
|
<a name="572"><span class="lineNum"> 572 </span> : /* bad parity */</a>
|
|
<a name="573"><span class="lineNum"> 573 </span><span class="lineCov"> 6 : ir[np / 2 + i] = nd + i;</span></a>
|
|
<a name="574"><span class="lineNum"> 574 </span> : }</a>
|
|
<a name="575"><span class="lineNum"> 575 </span><span class="lineCov"> 21 : for (i = 0; i < np - 1; ++i) {</span></a>
|
|
<a name="576"><span class="lineNum"> 576 </span> : /*</a>
|
|
<a name="577"><span class="lineNum"> 577 </span> : * Make blocks bad</a>
|
|
<a name="578"><span class="lineNum"> 578 </span> : * we cannot fill them with 0, because the original</a>
|
|
<a name="579"><span class="lineNum"> 579 </span> : * data may be already filled with 0</a>
|
|
<a name="580"><span class="lineNum"> 580 </span> : */</a>
|
|
<a name="581"><span class="lineNum"> 581 </span><span class="lineCov"> 15 : memset(v[ir[i]], 0x55, size);</span></a>
|
|
<a name="582"><span class="lineNum"> 582 </span> : }</a>
|
|
<a name="583"><span class="lineNum"> 583 </span> : </a>
|
|
<a name="584"><span class="lineNum"> 584 </span><span class="lineCov"> 6 : ret = raid_test_scan(np - 1, ir, nd, np, size, v, ref);</span></a>
|
|
<a name="585"><span class="lineNum"> 585 </span><span class="lineCov"> 6 : if (ret != 0) {</span></a>
|
|
<a name="586"><span class="lineNum"> 586 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="587"><span class="lineNum"> 587 </span> : goto bail;</a>
|
|
<a name="588"><span class="lineNum"> 588 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="589"><span class="lineNum"> 589 </span> : }</a>
|
|
<a name="590"><span class="lineNum"> 590 </span> : }</a>
|
|
<a name="591"><span class="lineNum"> 591 </span> : </a>
|
|
<a name="592"><span class="lineNum"> 592 </span> : /* scan test with no parity */</a>
|
|
<a name="593"><span class="lineNum"> 593 </span><span class="lineCov"> 1 : ret = raid_test_scan(0, 0, nd, 0, size, v, ref);</span></a>
|
|
<a name="594"><span class="lineNum"> 594 </span><span class="lineCov"> 1 : if (ret != -1) {</span></a>
|
|
<a name="595"><span class="lineNum"> 595 </span> : /* LCOV_EXCL_START */</a>
|
|
<a name="596"><span class="lineNum"> 596 </span> : goto bail;</a>
|
|
<a name="597"><span class="lineNum"> 597 </span> : /* LCOV_EXCL_STOP */</a>
|
|
<a name="598"><span class="lineNum"> 598 </span> : }</a>
|
|
<a name="599"><span class="lineNum"> 599 </span> : </a>
|
|
<a name="600"><span class="lineNum"> 600 </span><span class="lineCov"> 1 : ret = 0;</span></a>
|
|
<a name="601"><span class="lineNum"> 601 </span> : </a>
|
|
<a name="602"><span class="lineNum"> 602 </span><span class="lineCov"> 1 : bail:</span></a>
|
|
<a name="603"><span class="lineNum"> 603 </span><span class="lineCov"> 1 : free(v);</span></a>
|
|
<a name="604"><span class="lineNum"> 604 </span><span class="lineCov"> 1 : free(v_alloc);</span></a>
|
|
<a name="605"><span class="lineNum"> 605 </span> : </a>
|
|
<a name="606"><span class="lineNum"> 606 </span><span class="lineCov"> 1 : return ret;</span></a>
|
|
<a name="607"><span class="lineNum"> 607 </span> : }</a>
|
|
<a name="608"><span class="lineNum"> 608 </span> : </a>
|
|
<a name="609"><span class="lineNum"> 609 </span> : #ifdef __KERNEL__ /* to build the user mode test */</a>
|
|
<a name="610"><span class="lineNum"> 610 </span> : static int speedtest = 1;</a>
|
|
<a name="611"><span class="lineNum"> 611 </span> : </a>
|
|
<a name="612"><span class="lineNum"> 612 </span> : static int __init raid_cauchy_init(void)</a>
|
|
<a name="613"><span class="lineNum"> 613 </span> : {</a>
|
|
<a name="614"><span class="lineNum"> 614 </span> : int ret;</a>
|
|
<a name="615"><span class="lineNum"> 615 </span> : </a>
|
|
<a name="616"><span class="lineNum"> 616 </span> : raid_init();</a>
|
|
<a name="617"><span class="lineNum"> 617 </span> : </a>
|
|
<a name="618"><span class="lineNum"> 618 </span> : pr_info("raid: Using xor_blocks\n");</a>
|
|
<a name="619"><span class="lineNum"> 619 </span> : #ifdef RAID_USE_RAID6_PQ</a>
|
|
<a name="620"><span class="lineNum"> 620 </span> : pr_info("raid: Using raid6\n");</a>
|
|
<a name="621"><span class="lineNum"> 621 </span> : #endif</a>
|
|
<a name="622"><span class="lineNum"> 622 </span> : </a>
|
|
<a name="623"><span class="lineNum"> 623 </span> : ret = raid_selftest();</a>
|
|
<a name="624"><span class="lineNum"> 624 </span> : if (ret != 0)</a>
|
|
<a name="625"><span class="lineNum"> 625 </span> : return ret;</a>
|
|
<a name="626"><span class="lineNum"> 626 </span> : </a>
|
|
<a name="627"><span class="lineNum"> 627 </span> : pr_info("raid: Self test passed\n");</a>
|
|
<a name="628"><span class="lineNum"> 628 </span> : </a>
|
|
<a name="629"><span class="lineNum"> 629 </span> : if (speedtest) {</a>
|
|
<a name="630"><span class="lineNum"> 630 </span> : pr_info("raid: Speed test\n");</a>
|
|
<a name="631"><span class="lineNum"> 631 </span> : raid_speedtest(0);</a>
|
|
<a name="632"><span class="lineNum"> 632 </span> : pr_info("raid: Speed test with optimized memory layout\n");</a>
|
|
<a name="633"><span class="lineNum"> 633 </span> : raid_speedtest(64); /* 64 is the typical cache line size */</a>
|
|
<a name="634"><span class="lineNum"> 634 </span> : }</a>
|
|
<a name="635"><span class="lineNum"> 635 </span> : </a>
|
|
<a name="636"><span class="lineNum"> 636 </span> : return 0;</a>
|
|
<a name="637"><span class="lineNum"> 637 </span> : }</a>
|
|
<a name="638"><span class="lineNum"> 638 </span> : </a>
|
|
<a name="639"><span class="lineNum"> 639 </span> : static void raid_cauchy_exit(void)</a>
|
|
<a name="640"><span class="lineNum"> 640 </span> : {</a>
|
|
<a name="641"><span class="lineNum"> 641 </span> : }</a>
|
|
<a name="642"><span class="lineNum"> 642 </span> : </a>
|
|
<a name="643"><span class="lineNum"> 643 </span> : subsys_initcall(raid_cauchy_init);</a>
|
|
<a name="644"><span class="lineNum"> 644 </span> : module_exit(raid_cauchy_exit);</a>
|
|
<a name="645"><span class="lineNum"> 645 </span> : module_param(speedtest, int, 0);</a>
|
|
<a name="646"><span class="lineNum"> 646 </span> : MODULE_PARM_DESC(speedtest, "Runs a startup speed test");</a>
|
|
<a name="647"><span class="lineNum"> 647 </span> : MODULE_AUTHOR("Andrea Mazzoleni <amadvance@gmail.com>");</a>
|
|
<a name="648"><span class="lineNum"> 648 </span> : MODULE_LICENSE("GPL");</a>
|
|
<a name="649"><span class="lineNum"> 649 </span> : MODULE_DESCRIPTION("RAID Cauchy functions");</a>
|
|
<a name="650"><span class="lineNum"> 650 </span> : #endif</a>
|
|
<a name="651"><span class="lineNum"> 651 </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>
|