Auto update

This commit is contained in:
Andrea Mazzoleni 2015-11-13 22:48:15 +01:00
parent b030db8c57
commit 4d3f40da5f
207 changed files with 24318 additions and 23015 deletions

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">3</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">3</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">3</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>
@ -170,10 +170,10 @@
<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"> 211353 : assert(0 &lt; r &amp;&amp; r &lt;= n);</span>
<span class="lineNum"> 111 </span><span class="lineCov"> 215892 : assert(0 &lt; r &amp;&amp; r &lt;= n);</span>
<span class="lineNum"> 112 </span> :
<span class="lineNum"> 113 </span><span class="lineCov"> 704541 : for (i = 0; i &lt; r; ++i)</span>
<span class="lineNum"> 114 </span><span class="lineCov"> 493188 : c[i] = i;</span>
<span class="lineNum"> 113 </span><span class="lineCov"> 713955 : for (i = 0; i &lt; r; ++i)</span>
<span class="lineNum"> 114 </span><span class="lineCov"> 498063 : c[i] = i;</span>
<span class="lineNum"> 115 </span> : }
<span class="lineNum"> 116 </span> :
<span class="lineNum"> 117 </span> : /**
@ -182,19 +182,19 @@
<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"> 51703 : int i = r - 1; /* present position */</span>
<span class="lineNum"> 124 </span><span class="lineCov"> 51703 : int h = n; /* high limit for this position */</span>
<span class="lineNum"> 123 </span><span class="lineCov"> 51682 : int i = r - 1; /* present position */</span>
<span class="lineNum"> 124 </span><span class="lineCov"> 51682 : 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"> 84576 : ++c[i];</span>
<span class="lineNum"> 128 </span><span class="lineCov"> 84555 : ++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"> 84576 : if (c[i] &gt;= h) {</span>
<span class="lineNum"> 131 </span><span class="lineCov"> 84555 : if (c[i] &gt;= 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"> 44868 : if (i == 0)</span>
<span class="lineNum"> 135 </span><span class="lineCov"> 11995 : return 0;</span>
<span class="lineNum"> 134 </span><span class="lineCov"> 44861 : if (i == 0)</span>
<span class="lineNum"> 135 </span><span class="lineCov"> 11988 : 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>
@ -202,16 +202,16 @@
<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"> 39708 : ++i;</span>
<span class="lineNum"> 143 </span><span class="lineCov"> 39694 : ++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"> 62253 : while (i &lt; r) {</span>
<span class="lineNum"> 146 </span><span class="lineCov"> 62239 : while (i &lt; 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"> 39708 : return 1;</span>
<span class="lineNum"> 152 </span><span class="lineCov"> 39694 : return 1;</span>
<span class="lineNum"> 153 </span> : }
<span class="lineNum"> 154 </span> : #endif
<span class="lineNum"> 155 </span> :

View file

@ -31,17 +31,17 @@
<td class="headerValue">lcov.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">55</td>
<td class="headerCovTableEntry">66</td>
<td class="headerCovTableEntryMed">83.3 %</td>
<td class="headerCovTableEntry">64</td>
<td class="headerCovTableEntry">76</td>
<td class="headerCovTableEntryMed">84.2 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>
<td class="headerCovTableEntry">11</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
@ -61,46 +61,50 @@
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#18">raid_cpuid</a></td>
<td class="coverFnHi">1879</td>
<td class="coverFnHi">1960</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#84">raid_cpu_match_sse</a></td>
<td class="coverFnHi">1070</td>
<td class="coverFnHi">1117</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#135">raid_cpu_has_ssse3</a></td>
<td class="coverFnHi">530</td>
<td class="coverFnHi">553</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#97">raid_cpu_match_avx</a></td>
<td class="coverFnHi">288</td>
<td class="coverFnHi">300</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#168">raid_cpu_has_avx2</a></td>
<td class="coverFnHi">288</td>
<td class="coverFnHi">300</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#116">raid_cpu_has_sse2</a></td>
<td class="coverFnHi">276</td>
<td class="coverFnHi">288</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#152">raid_cpu_has_crc32</a></td>
<td class="coverFnHi">264</td>
<td class="coverFnHi">276</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#51">raid_cpu_info</a></td>
<td class="coverFnHi">249</td>
<td class="coverFnHi">260</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#217">raid_cpu_has_slowmult</a></td>
<td class="coverFnHi">241</td>
<td class="coverFn"><a href="cpu.h.gcov.html#216">raid_cpu_is_atom</a></td>
<td class="coverFnHi">256</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#249">raid_cpu_has_slowmult</a></td>
<td class="coverFnHi">252</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#36">raid_xgetbv</a></td>
<td class="coverFnHi">23</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#243">raid_cpu_has_slowextendedreg</a></td>
<td class="coverFn"><a href="cpu.h.gcov.html#280">raid_cpu_has_slowextendedreg</a></td>
<td class="coverFnHi">4</td>
</tr>
</table>

View file

@ -31,17 +31,17 @@
<td class="headerValue">lcov.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">55</td>
<td class="headerCovTableEntry">66</td>
<td class="headerCovTableEntryMed">83.3 %</td>
<td class="headerCovTableEntry">64</td>
<td class="headerCovTableEntry">76</td>
<td class="headerCovTableEntryMed">84.2 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>
<td class="headerCovTableEntry">11</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
@ -61,43 +61,47 @@
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#168">raid_cpu_has_avx2</a></td>
<td class="coverFnHi">288</td>
<td class="coverFnHi">300</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#152">raid_cpu_has_crc32</a></td>
<td class="coverFnHi">264</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#243">raid_cpu_has_slowextendedreg</a></td>
<td class="coverFnHi">4</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#217">raid_cpu_has_slowmult</a></td>
<td class="coverFnHi">241</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#116">raid_cpu_has_sse2</a></td>
<td class="coverFnHi">276</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#135">raid_cpu_has_ssse3</a></td>
<td class="coverFnHi">530</td>
<td class="coverFn"><a href="cpu.h.gcov.html#280">raid_cpu_has_slowextendedreg</a></td>
<td class="coverFnHi">4</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#51">raid_cpu_info</a></td>
<td class="coverFnHi">249</td>
<td class="coverFn"><a href="cpu.h.gcov.html#249">raid_cpu_has_slowmult</a></td>
<td class="coverFnHi">252</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#97">raid_cpu_match_avx</a></td>
<td class="coverFn"><a href="cpu.h.gcov.html#116">raid_cpu_has_sse2</a></td>
<td class="coverFnHi">288</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#135">raid_cpu_has_ssse3</a></td>
<td class="coverFnHi">553</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#51">raid_cpu_info</a></td>
<td class="coverFnHi">260</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#216">raid_cpu_is_atom</a></td>
<td class="coverFnHi">256</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#97">raid_cpu_match_avx</a></td>
<td class="coverFnHi">300</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#84">raid_cpu_match_sse</a></td>
<td class="coverFnHi">1070</td>
<td class="coverFnHi">1117</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#18">raid_cpuid</a></td>
<td class="coverFnHi">1879</td>
<td class="coverFnHi">1960</td>
</tr>
<tr>
<td class="coverFn"><a href="cpu.h.gcov.html#36">raid_xgetbv</a></td>

View file

@ -31,17 +31,17 @@
<td class="headerValue">lcov.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">55</td>
<td class="headerCovTableEntry">66</td>
<td class="headerCovTableEntryMed">83.3 %</td>
<td class="headerCovTableEntry">64</td>
<td class="headerCovTableEntry">76</td>
<td class="headerCovTableEntryMed">84.2 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>
<td class="headerCovTableEntry">11</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
@ -79,9 +79,9 @@
<span class="lineNum"> 17 </span> :
<a name="18"><span class="lineNum"> 18 </span> : #ifdef CONFIG_X86</a>
<span class="lineNum"> 19 </span> :
<span class="lineNum"> 20 </span><span class="lineCov"> 1879 : static inline void raid_cpuid(uint32_t func_eax, uint32_t sub_ecx, uint32_t *reg)</span>
<span class="lineNum"> 20 </span><span class="lineCov"> 1960 : static inline void raid_cpuid(uint32_t func_eax, uint32_t sub_ecx, uint32_t *reg)</span>
<span class="lineNum"> 21 </span> : {
<span class="lineNum"> 22 </span><span class="lineCov"> 1879 : asm volatile (</span>
<span class="lineNum"> 22 </span><span class="lineCov"> 1960 : asm volatile (</span>
<span class="lineNum"> 23 </span> : #if defined(__i386__) &amp;&amp; defined(__PIC__)
<span class="lineNum"> 24 </span> : /* allow compilation in PIC mode saving ebx */
<span class="lineNum"> 25 </span> : &quot;xchgl %%ebx, %1\n&quot;
@ -91,11 +91,11 @@
<span class="lineNum"> 29 </span> : : &quot;0&quot; (func_eax), &quot;2&quot; (sub_ecx)
<span class="lineNum"> 30 </span> : #else
<span class="lineNum"> 31 </span> : &quot;cpuid\n&quot;
<span class="lineNum"> 32 </span><span class="lineCov"> 1879 : : &quot;=a&quot; (reg[0]), &quot;=b&quot; (reg[1]), &quot;=c&quot; (reg[2]), &quot;=d&quot; (reg[3])</span>
<span class="lineNum"> 32 </span><span class="lineCov"> 1960 : : &quot;=a&quot; (reg[0]), &quot;=b&quot; (reg[1]), &quot;=c&quot; (reg[2]), &quot;=d&quot; (reg[3])</span>
<span class="lineNum"> 33 </span> : : &quot;0&quot; (func_eax), &quot;2&quot; (sub_ecx)
<span class="lineNum"> 34 </span> : #endif
<span class="lineNum"> 35 </span> : );
<a name="36"><span class="lineNum"> 36 </span><span class="lineCov"> 1879 : }</span></a>
<a name="36"><span class="lineNum"> 36 </span><span class="lineCov"> 1960 : }</span></a>
<span class="lineNum"> 37 </span> :
<span class="lineNum"> 38 </span><span class="lineCov"> 23 : static inline void raid_xgetbv(uint32_t* reg)</span>
<span class="lineNum"> 39 </span> : {
@ -112,26 +112,26 @@
<span class="lineNum"> 50 </span> :
<a name="51"><span class="lineNum"> 51 </span> : #define CPU_VENDOR_MAX 13</a>
<span class="lineNum"> 52 </span> :
<span class="lineNum"> 53 </span><span class="lineCov"> 249 : static inline void raid_cpu_info(char *vendor, unsigned *family, unsigned *model)</span>
<span class="lineNum"> 53 </span><span class="lineCov"> 260 : static inline void raid_cpu_info(char *vendor, unsigned *family, unsigned *model)</span>
<span class="lineNum"> 54 </span> : {
<span class="lineNum"> 55 </span> : uint32_t reg[4];
<span class="lineNum"> 56 </span> : unsigned f, ef, m, em;
<span class="lineNum"> 57 </span> :
<span class="lineNum"> 58 </span><span class="lineCov"> 249 : raid_cpuid(0, 0, reg);</span>
<span class="lineNum"> 58 </span><span class="lineCov"> 260 : raid_cpuid(0, 0, reg);</span>
<span class="lineNum"> 59 </span> :
<span class="lineNum"> 60 </span><span class="lineCov"> 249 : ((uint32_t*)vendor)[0] = reg[1];</span>
<span class="lineNum"> 61 </span><span class="lineCov"> 249 : ((uint32_t*)vendor)[1] = reg[3];</span>
<span class="lineNum"> 62 </span><span class="lineCov"> 249 : ((uint32_t*)vendor)[2] = reg[2];</span>
<span class="lineNum"> 63 </span><span class="lineCov"> 249 : vendor[12] = 0;</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 260 : ((uint32_t*)vendor)[0] = reg[1];</span>
<span class="lineNum"> 61 </span><span class="lineCov"> 260 : ((uint32_t*)vendor)[1] = reg[3];</span>
<span class="lineNum"> 62 </span><span class="lineCov"> 260 : ((uint32_t*)vendor)[2] = reg[2];</span>
<span class="lineNum"> 63 </span><span class="lineCov"> 260 : vendor[12] = 0;</span>
<span class="lineNum"> 64 </span> :
<span class="lineNum"> 65 </span><span class="lineCov"> 249 : raid_cpuid(1, 0, reg);</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 260 : raid_cpuid(1, 0, reg);</span>
<span class="lineNum"> 66 </span> :
<span class="lineNum"> 67 </span><span class="lineCov"> 249 : f = (reg[0] &gt;&gt; 8) &amp; 0xF;</span>
<span class="lineNum"> 68 </span><span class="lineCov"> 249 : ef = (reg[0] &gt;&gt; 20) &amp; 0xFF;</span>
<span class="lineNum"> 69 </span><span class="lineCov"> 249 : m = (reg[0] &gt;&gt; 4) &amp; 0xF;</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 249 : em = (reg[0] &gt;&gt; 16) &amp; 0xF;</span>
<span class="lineNum"> 67 </span><span class="lineCov"> 260 : f = (reg[0] &gt;&gt; 8) &amp; 0xF;</span>
<span class="lineNum"> 68 </span><span class="lineCov"> 260 : ef = (reg[0] &gt;&gt; 20) &amp; 0xFF;</span>
<span class="lineNum"> 69 </span><span class="lineCov"> 260 : m = (reg[0] &gt;&gt; 4) &amp; 0xF;</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 260 : em = (reg[0] &gt;&gt; 16) &amp; 0xF;</span>
<span class="lineNum"> 71 </span> :
<span class="lineNum"> 72 </span><span class="lineCov"> 249 : if (strcmp(vendor, &quot;AuthenticAMD&quot;) == 0) {</span>
<span class="lineNum"> 72 </span><span class="lineCov"> 260 : if (strcmp(vendor, &quot;AuthenticAMD&quot;) == 0) {</span>
<span class="lineNum"> 73 </span><span class="lineNoCov"> 0 : if (f &lt; 15) {</span>
<span class="lineNum"> 74 </span><span class="lineNoCov"> 0 : *family = f;</span>
<span class="lineNum"> 75 </span><span class="lineNoCov"> 0 : *model = m;</span>
@ -140,31 +140,31 @@
<span class="lineNum"> 78 </span><span class="lineNoCov"> 0 : *model = m + (em &lt;&lt; 4);</span>
<span class="lineNum"> 79 </span> : }
<span class="lineNum"> 80 </span> : } else {
<span class="lineNum"> 81 </span><span class="lineCov"> 249 : *family = f + ef;</span>
<span class="lineNum"> 82 </span><span class="lineCov"> 249 : *model = m + (em &lt;&lt; 4);</span>
<span class="lineNum"> 81 </span><span class="lineCov"> 260 : *family = f + ef;</span>
<span class="lineNum"> 82 </span><span class="lineCov"> 260 : *model = m + (em &lt;&lt; 4);</span>
<span class="lineNum"> 83 </span> : }
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 249 : }</span></a>
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 260 : }</span></a>
<span class="lineNum"> 85 </span> :
<span class="lineNum"> 86 </span><span class="lineCov"> 1070 : static inline int raid_cpu_match_sse(uint32_t cpuid_1_ecx, uint32_t cpuid_1_edx)</span>
<span class="lineNum"> 86 </span><span class="lineCov"> 1117 : static inline int raid_cpu_match_sse(uint32_t cpuid_1_ecx, uint32_t cpuid_1_edx)</span>
<span class="lineNum"> 87 </span> : {
<span class="lineNum"> 88 </span> : uint32_t reg[4];
<span class="lineNum"> 89 </span> :
<span class="lineNum"> 90 </span><span class="lineCov"> 1070 : raid_cpuid(1, 0, reg);</span>
<span class="lineNum"> 91 </span><span class="lineCov"> 1070 : if ((reg[2] &amp; cpuid_1_ecx) != cpuid_1_ecx)</span>
<span class="lineNum"> 90 </span><span class="lineCov"> 1117 : raid_cpuid(1, 0, reg);</span>
<span class="lineNum"> 91 </span><span class="lineCov"> 1117 : if ((reg[2] &amp; cpuid_1_ecx) != cpuid_1_ecx)</span>
<span class="lineNum"> 92 </span><span class="lineCov"> 18 : return 0;</span>
<span class="lineNum"> 93 </span><span class="lineCov"> 1052 : if ((reg[3] &amp; cpuid_1_edx) != cpuid_1_edx)</span>
<span class="lineNum"> 93 </span><span class="lineCov"> 1099 : if ((reg[3] &amp; cpuid_1_edx) != cpuid_1_edx)</span>
<span class="lineNum"> 94 </span><span class="lineNoCov"> 0 : return 0;</span>
<span class="lineNum"> 95 </span> :
<span class="lineNum"> 96 </span><span class="lineCov"> 1052 : return 1;</span>
<span class="lineNum"> 96 </span><span class="lineCov"> 1099 : return 1;</span>
<a name="97"><span class="lineNum"> 97 </span> : }</a>
<span class="lineNum"> 98 </span> :
<span class="lineNum"> 99 </span><span class="lineCov"> 288 : static inline int raid_cpu_match_avx(uint32_t cpuid_1_ecx, uint32_t cpuid_7_ebx, uint32_t xcr0)</span>
<span class="lineNum"> 99 </span><span class="lineCov"> 300 : static inline int raid_cpu_match_avx(uint32_t cpuid_1_ecx, uint32_t cpuid_7_ebx, uint32_t xcr0)</span>
<span class="lineNum"> 100 </span> : {
<span class="lineNum"> 101 </span> : uint32_t reg[4];
<span class="lineNum"> 102 </span> :
<span class="lineNum"> 103 </span><span class="lineCov"> 288 : raid_cpuid(1, 0, reg);</span>
<span class="lineNum"> 104 </span><span class="lineCov"> 288 : if ((reg[2] &amp; cpuid_1_ecx) != cpuid_1_ecx)</span>
<span class="lineNum"> 105 </span><span class="lineCov"> 265 : return 0;</span>
<span class="lineNum"> 103 </span><span class="lineCov"> 300 : raid_cpuid(1, 0, reg);</span>
<span class="lineNum"> 104 </span><span class="lineCov"> 300 : if ((reg[2] &amp; cpuid_1_ecx) != cpuid_1_ecx)</span>
<span class="lineNum"> 105 </span><span class="lineCov"> 277 : return 0;</span>
<span class="lineNum"> 106 </span> :
<span class="lineNum"> 107 </span><span class="lineCov"> 23 : raid_xgetbv(reg);</span>
<span class="lineNum"> 108 </span><span class="lineCov"> 23 : if ((reg[0] &amp; xcr0) != xcr0)</span>
@ -177,7 +177,7 @@
<span class="lineNum"> 115 </span><span class="lineCov"> 23 : return 1;</span>
<a name="116"><span class="lineNum"> 116 </span> : }</a>
<span class="lineNum"> 117 </span> :
<span class="lineNum"> 118 </span><span class="lineCov"> 276 : static inline int raid_cpu_has_sse2(void)</span>
<span class="lineNum"> 118 </span><span class="lineCov"> 288 : static inline int raid_cpu_has_sse2(void)</span>
<span class="lineNum"> 119 </span> : {
<span class="lineNum"> 120 </span> : /*
<span class="lineNum"> 121 </span> : * Intel® 64 and IA-32 Architectures Software Developer's Manual
@ -191,12 +191,12 @@
<span class="lineNum"> 129 </span> : * 2. Check that the processor supports the SSE and/or SSE2 extensions (true if
<span class="lineNum"> 130 </span> : * CPUID.01H:EDX.SSE[bit 25] = 1 and/or CPUID.01H:EDX.SSE2[bit 26] = 1).
<span class="lineNum"> 131 </span> : */
<span class="lineNum"> 132 </span><span class="lineCov"> 276 : return raid_cpu_match_sse(</span>
<span class="lineNum"> 132 </span><span class="lineCov"> 288 : return raid_cpu_match_sse(</span>
<span class="lineNum"> 133 </span> : 0,
<span class="lineNum"> 134 </span> : 1 &lt;&lt; 26); /* SSE2 */
<a name="135"><span class="lineNum"> 135 </span> : }</a>
<span class="lineNum"> 136 </span> :
<span class="lineNum"> 137 </span><span class="lineCov"> 530 : static inline int raid_cpu_has_ssse3(void)</span>
<span class="lineNum"> 137 </span><span class="lineCov"> 553 : static inline int raid_cpu_has_ssse3(void)</span>
<span class="lineNum"> 138 </span> : {
<span class="lineNum"> 139 </span> : /*
<span class="lineNum"> 140 </span> : * Intel® 64 and IA-32 Architectures Software Developer's Manual
@ -208,12 +208,12 @@
<span class="lineNum"> 146 </span> : * Next, use the additional step provided below:
<span class="lineNum"> 147 </span> : * Check that the processor supports SSSE3 (if CPUID.01H:ECX.SSSE3[bit 9] = 1).
<span class="lineNum"> 148 </span> : */
<span class="lineNum"> 149 </span><span class="lineCov"> 530 : return raid_cpu_match_sse(</span>
<span class="lineNum"> 149 </span><span class="lineCov"> 553 : return raid_cpu_match_sse(</span>
<span class="lineNum"> 150 </span> : 1 &lt;&lt; 9, /* SSSE3 */
<span class="lineNum"> 151 </span> : 1 &lt;&lt; 26); /* SSE2 */
<a name="152"><span class="lineNum"> 152 </span> : }</a>
<span class="lineNum"> 153 </span> :
<span class="lineNum"> 154 </span><span class="lineCov"> 264 : static inline int raid_cpu_has_crc32(void)</span>
<span class="lineNum"> 154 </span><span class="lineCov"> 276 : static inline int raid_cpu_has_crc32(void)</span>
<span class="lineNum"> 155 </span> : {
<span class="lineNum"> 156 </span> : /*
<span class="lineNum"> 157 </span> : * Intel® 64 and IA-32 Architectures Software Developer's Manual
@ -224,12 +224,12 @@
<span class="lineNum"> 162 </span> : * Before an application attempts to use the CRC32 instruction, it must check
<span class="lineNum"> 163 </span> : * that the processor supports SSE4.2 (if CPUID.01H:ECX.SSE4_2[bit 20] = 1).
<span class="lineNum"> 164 </span> : */
<span class="lineNum"> 165 </span><span class="lineCov"> 264 : return raid_cpu_match_sse(</span>
<span class="lineNum"> 165 </span><span class="lineCov"> 276 : return raid_cpu_match_sse(</span>
<span class="lineNum"> 166 </span> : 1 &lt;&lt; 20, /* CRC32 */
<span class="lineNum"> 167 </span> : 0);
<a name="168"><span class="lineNum"> 168 </span> : }</a>
<span class="lineNum"> 169 </span> :
<span class="lineNum"> 170 </span><span class="lineCov"> 288 : static inline int raid_cpu_has_avx2(void)</span>
<span class="lineNum"> 170 </span><span class="lineCov"> 300 : static inline int raid_cpu_has_avx2(void)</span>
<span class="lineNum"> 171 </span> : {
<span class="lineNum"> 172 </span> : /*
<span class="lineNum"> 173 </span> : * Intel Architecture Instruction Set Extensions Programming Reference
@ -246,7 +246,7 @@
<span class="lineNum"> 184 </span> : * Application Software must identify that hardware supports AVX, after that it must
<span class="lineNum"> 185 </span> : * also detect support for AVX2 by checking CPUID.(EAX=07H, ECX=0H):EBX.AVX2[bit 5].
<span class="lineNum"> 186 </span> : */
<span class="lineNum"> 187 </span><span class="lineCov"> 288 : return raid_cpu_match_avx(</span>
<span class="lineNum"> 187 </span><span class="lineCov"> 300 : return raid_cpu_match_avx(</span>
<span class="lineNum"> 188 </span> : (1 &lt;&lt; 27) | (1 &lt;&lt; 28), /* OSXSAVE and AVX */
<span class="lineNum"> 189 </span> : 1 &lt;&lt; 5, /* AVX2 */
<span class="lineNum"> 190 </span> : 3 &lt;&lt; 1); /* OS saves XMM and YMM registers */
@ -275,60 +275,110 @@
<span class="lineNum"> 213 </span> : }
<span class="lineNum"> 214 </span> :
<span class="lineNum"> 215 </span> : /**
<span class="lineNum"> 216 </span> : * Check if the processor has a slow MULT implementation.
<a name="217"><span class="lineNum"> 217 </span> : * If yes, it's better to use a hash not based on multiplication.</a>
<span class="lineNum"> 218 </span> : */
<span class="lineNum"> 219 </span><span class="lineCov"> 241 : static inline int raid_cpu_has_slowmult(void)</span>
<span class="lineNum"> 220 </span> : {
<span class="lineNum"> 221 </span> : char vendor[CPU_VENDOR_MAX];
<span class="lineNum"> 222 </span> : unsigned family;
<span class="lineNum"> 223 </span> : unsigned model;
<span class="lineNum"> 224 </span> :
<span class="lineNum"> 225 </span><span class="lineCov"> 241 : raid_cpu_info(vendor, &amp;family, &amp;model);</span>
<span class="lineNum"> 226 </span> :
<span class="lineNum"> 227 </span><span class="lineCov"> 241 : if (strcmp(vendor, &quot;GenuineIntel&quot;) == 0) {</span>
<span class="lineNum"> 228 </span> : /*
<span class="lineNum"> 229 </span> : * Intel Atom
<span class="lineNum"> 230 </span> : * Murmur3 based on MUL instruction, is a lot slower
<span class="lineNum"> 231 </span> : * than Spooky2 based on SHIFTs.
<span class="lineNum"> 232 </span> : * Like: 378 MB/s vs 3413 MB/s
<span class="lineNum"> 233 </span> : */
<span class="lineNum"> 234 </span><span class="lineCov"> 241 : if (family == 6 &amp;&amp; model == 28)</span>
<span class="lineNum"> 235 </span><span class="lineNoCov"> 0 : return 1;</span>
<span class="lineNum"> 236 </span> : }
<span class="lineNum"> 237 </span> :
<span class="lineNum"> 238 </span><span class="lineCov"> 241 : return 0;</span>
<span class="lineNum"> 239 </span> : }
<span class="lineNum"> 240 </span> :
<span class="lineNum"> 241 </span> : /**
<span class="lineNum"> 242 </span> : * Check if the processor has a slow extended set of SSE registers.
<a name="243"><span class="lineNum"> 243 </span> : * If yes, it's better to limit the unroll to the firsrt 8 registers.</a>
<span class="lineNum"> 244 </span> : */
<span class="lineNum"> 245 </span><span class="lineCov"> 4 : static inline int raid_cpu_has_slowextendedreg(void)</span>
<span class="lineNum"> 246 </span> : {
<span class="lineNum"> 247 </span> : char vendor[CPU_VENDOR_MAX];
<span class="lineNum"> 248 </span> : unsigned family;
<span class="lineNum"> 249 </span> : unsigned model;
<span class="lineNum"> 250 </span> :
<span class="lineNum"> 251 </span><span class="lineCov"> 4 : raid_cpu_info(vendor, &amp;family, &amp;model);</span>
<span class="lineNum"> 252 </span> :
<span class="lineNum"> 253 </span><span class="lineCov"> 4 : if (strcmp(vendor, &quot;AuthenticAMD&quot;) == 0) {</span>
<span class="lineNum"> 254 </span> : /*
<span class="lineNum"> 255 </span> : * AMD Bulldozer
<span class="lineNum"> 256 </span> : * PAR1/PAR2 implementations using 16 SSE registers are slower
<span class="lineNum"> 257 </span> : * than ones using only the first 8 registers.
<span class="lineNum"> 258 </span> : * Like: 4465 MB/s vs 4922 MB/s.
<span class="lineNum"> 259 </span> : */
<span class="lineNum"> 260 </span><span class="lineNoCov"> 0 : if (family == 21)</span>
<span class="lineNum"> 261 </span><span class="lineNoCov"> 0 : return 1;</span>
<span class="lineNum"> 262 </span> : }
<span class="lineNum"> 263 </span> :
<span class="lineNum"> 264 </span><span class="lineCov"> 4 : return 0;</span>
<span class="lineNum"> 265 </span> : }
<span class="lineNum"> 266 </span> : #endif
<span class="lineNum"> 267 </span> :
<span class="lineNum"> 268 </span> : #endif
<span class="lineNum"> 269 </span> :
<a name="216"><span class="lineNum"> 216 </span> : * Check if it's an Intel Atom CPU.</a>
<span class="lineNum"> 217 </span> : */
<span class="lineNum"> 218 </span><span class="lineCov"> 256 : static inline int raid_cpu_is_atom(unsigned family, unsigned model)</span>
<span class="lineNum"> 219 </span> : {
<span class="lineNum"> 220 </span><span class="lineCov"> 256 : if (family != 6)</span>
<span class="lineNum"> 221 </span><span class="lineCov"> 3 : return 0;</span>
<span class="lineNum"> 222 </span> :
<span class="lineNum"> 223 </span> : /*
<span class="lineNum"> 224 </span> : * x86 Architecture CPUID
<span class="lineNum"> 225 </span> : * http://www.sandpile.org/x86/cpuid.htm
<span class="lineNum"> 226 </span> : *
<span class="lineNum"> 227 </span> : * Intel Atom
<span class="lineNum"> 228 </span> : * 1C (28) Atom (45 nm) with 512 KB on-die L2
<span class="lineNum"> 229 </span> : * 26 (38) Atom (45 nm) with 512 KB on-die L2
<span class="lineNum"> 230 </span> : * 36 (54) Atom (32 nm) with 512 KB on-die L2
<span class="lineNum"> 231 </span> : * 27 (39) Atom (32 nm) with 512 KB on-die L2
<span class="lineNum"> 232 </span> : * 35 (53) Atom (?? nm) with ??? KB on-die L2
<span class="lineNum"> 233 </span> : * 4A (74) Atom 2C (22 nm) 1 MB L2 + PowerVR (TGR)
<span class="lineNum"> 234 </span> : * 5A (90) Atom 4C (22 nm) 2 MB L2 + PowerVR (ANN)
<span class="lineNum"> 235 </span> : * 37 (55) Atom 4C (22 nm) 2 MB L2 + Intel Gen7 (BYT)
<span class="lineNum"> 236 </span> : * 4C (76) Atom 4C (14 nm) 2 MB L2 + Intel Gen8 (BSW)
<span class="lineNum"> 237 </span> : * 5D (93) Atom 4C (28 nm TSMC) 1 MB L2 + Mali (SoFIA)
<span class="lineNum"> 238 </span> : * 4D (77) Atom 8C (22 nm) 4 MB L2 (AVN)
<span class="lineNum"> 239 </span> : * ?? Atom ?C (14 nm) ? MB L2 (DVN)
<span class="lineNum"> 240 </span> : */
<span class="lineNum"> 241 </span><span class="lineCov"> 506 : return model == 28 || model == 38 || model == 54</span>
<span class="lineNum"> 242 </span><span class="lineCov"> 253 : || model == 39 || model == 53 || model == 74</span>
<span class="lineNum"> 243 </span><span class="lineCov"> 253 : || model == 90 || model == 55 || model == 76</span>
<span class="lineNum"> 244 </span><span class="lineCov"> 506 : || model == 93 || model == 77;</span>
<span class="lineNum"> 245 </span> : }
<span class="lineNum"> 246 </span> :
<span class="lineNum"> 247 </span> : /**
<span class="lineNum"> 248 </span> : * Check if the processor has a slow MULT implementation.
<a name="249"><span class="lineNum"> 249 </span> : * If yes, it's better to use a hash not based on multiplication.</a>
<span class="lineNum"> 250 </span> : */
<span class="lineNum"> 251 </span><span class="lineCov"> 252 : static inline int raid_cpu_has_slowmult(void)</span>
<span class="lineNum"> 252 </span> : {
<span class="lineNum"> 253 </span> : char vendor[CPU_VENDOR_MAX];
<span class="lineNum"> 254 </span> : unsigned family;
<span class="lineNum"> 255 </span> : unsigned model;
<span class="lineNum"> 256 </span> :
<span class="lineNum"> 257 </span> : /*
<span class="lineNum"> 258 </span> : * In some cases Murmur3 based on MUL instruction,
<span class="lineNum"> 259 </span> : * is a LOT slower than Spooky2 based on SHIFTs.
<span class="lineNum"> 260 </span> : */
<span class="lineNum"> 261 </span><span class="lineCov"> 252 : raid_cpu_info(vendor, &amp;family, &amp;model);</span>
<span class="lineNum"> 262 </span> :
<span class="lineNum"> 263 </span><span class="lineCov"> 252 : if (strcmp(vendor, &quot;GenuineIntel&quot;) == 0) {</span>
<span class="lineNum"> 264 </span> : /*
<span class="lineNum"> 265 </span> : * Intel Atom (Model 28)
<span class="lineNum"> 266 </span> : * murmur3:378 MB/s, spooky2:3413 MB/s (x86)
<span class="lineNum"> 267 </span> : *
<span class="lineNum"> 268 </span> : * Intel Atom (Model 77)
<span class="lineNum"> 269 </span> : * murmur3:1311 MB/s, spooky2:4056 MB/s (x64)
<span class="lineNum"> 270 </span> : */
<span class="lineNum"> 271 </span><span class="lineCov"> 252 : if (raid_cpu_is_atom(family, model))</span>
<span class="lineNum"> 272 </span><span class="lineNoCov"> 0 : return 1;</span>
<span class="lineNum"> 273 </span> : }
<span class="lineNum"> 274 </span> :
<span class="lineNum"> 275 </span><span class="lineCov"> 252 : return 0;</span>
<span class="lineNum"> 276 </span> : }
<span class="lineNum"> 277 </span> :
<span class="lineNum"> 278 </span> : /**
<span class="lineNum"> 279 </span> : * Check if the processor has a slow extended set of SSE registers.
<a name="280"><span class="lineNum"> 280 </span> : * If yes, it's better to limit the unroll to the firsrt 8 registers.</a>
<span class="lineNum"> 281 </span> : */
<span class="lineNum"> 282 </span><span class="lineCov"> 4 : static inline int raid_cpu_has_slowextendedreg(void)</span>
<span class="lineNum"> 283 </span> : {
<span class="lineNum"> 284 </span> : char vendor[CPU_VENDOR_MAX];
<span class="lineNum"> 285 </span> : unsigned family;
<span class="lineNum"> 286 </span> : unsigned model;
<span class="lineNum"> 287 </span> :
<span class="lineNum"> 288 </span> : /*
<span class="lineNum"> 289 </span> : * In some cases the PAR2 implementation using 16 SSE registers
<span class="lineNum"> 290 </span> : * is a LITTLE slower than the one using only the first 8 registers.
<span class="lineNum"> 291 </span> : * This doesn't happen for PARZ.
<span class="lineNum"> 292 </span> : */
<span class="lineNum"> 293 </span><span class="lineCov"> 4 : raid_cpu_info(vendor, &amp;family, &amp;model);</span>
<span class="lineNum"> 294 </span> :
<span class="lineNum"> 295 </span><span class="lineCov"> 4 : if (strcmp(vendor, &quot;AuthenticAMD&quot;) == 0) {</span>
<span class="lineNum"> 296 </span> : /*
<span class="lineNum"> 297 </span> : * AMD Bulldozer
<span class="lineNum"> 298 </span> : * par2_sse2:4922 MB/s, par2_sse2e:4465 MB/s
<span class="lineNum"> 299 </span> : */
<span class="lineNum"> 300 </span><span class="lineNoCov"> 0 : if (family == 21)</span>
<span class="lineNum"> 301 </span><span class="lineNoCov"> 0 : return 1;</span>
<span class="lineNum"> 302 </span> : }
<span class="lineNum"> 303 </span> :
<span class="lineNum"> 304 </span><span class="lineCov"> 4 : if (strcmp(vendor, &quot;GenuineIntel&quot;) == 0) {</span>
<span class="lineNum"> 305 </span> : /*
<span class="lineNum"> 306 </span> : * Intel Atom (Model 77)
<span class="lineNum"> 307 </span> : * par2_sse2:5686 MB/s, par2_sse2e:5250 MB/s
<span class="lineNum"> 308 </span> : * parz_sse2:3100 MB/s, parz_sse2e:3400 MB/s
<span class="lineNum"> 309 </span> : */
<span class="lineNum"> 310 </span><span class="lineCov"> 4 : if (raid_cpu_is_atom(family, model))</span>
<span class="lineNum"> 311 </span><span class="lineNoCov"> 0 : return 1;</span>
<span class="lineNum"> 312 </span> : }
<span class="lineNum"> 313 </span> :
<span class="lineNum"> 314 </span><span class="lineCov"> 4 : return 0;</span>
<span class="lineNum"> 315 </span> : }
<span class="lineNum"> 316 </span> : #endif
<span class="lineNum"> 317 </span> :
<span class="lineNum"> 318 </span> : #endif
<span class="lineNum"> 319 </span> :
</pre>
</td>
</tr>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>
@ -88,7 +88,7 @@
<span class="lineNum"> 26 </span> : */
<span class="lineNum"> 27 </span> : static __always_inline uint8_t mul(uint8_t a, uint8_t b)
<span class="lineNum"> 28 </span> : {
<span class="lineNum"> 29 </span><span class="lineCov"> 23811482 : return gfmul[a][b];</span>
<span class="lineNum"> 29 </span><span class="lineCov"> 23816594 : return gfmul[a][b];</span>
<span class="lineNum"> 30 </span> : }
<span class="lineNum"> 31 </span> :
<span class="lineNum"> 32 </span> : /*
@ -97,9 +97,9 @@
<span class="lineNum"> 35 </span> : */
<span class="lineNum"> 36 </span> : static __always_inline uint8_t inv(uint8_t v)
<span class="lineNum"> 37 </span> : {
<span class="lineNum"> 38 </span><span class="lineCov"> 635202 : BUG_ON(v == 0); /* division by zero */</span>
<span class="lineNum"> 38 </span><span class="lineCov"> 635932 : BUG_ON(v == 0); /* division by zero */</span>
<span class="lineNum"> 39 </span> :
<span class="lineNum"> 40 </span><span class="lineCov"> 635202 : return gfinv[v];</span>
<span class="lineNum"> 40 </span><span class="lineCov"> 635932 : return gfinv[v];</span>
<span class="lineNum"> 41 </span> : }
<span class="lineNum"> 42 </span> :
<span class="lineNum"> 43 </span> : /*
@ -125,7 +125,7 @@
<span class="lineNum"> 63 </span> : */
<span class="lineNum"> 64 </span> : static __always_inline uint8_t A(int p, int d)
<span class="lineNum"> 65 </span> : {
<span class="lineNum"> 66 </span><span class="lineCov"> 2605268 : return gfgen[p][d];</span>
<span class="lineNum"> 66 </span><span class="lineCov"> 2606682 : return gfgen[p][d];</span>
<span class="lineNum"> 67 </span> : }
<span class="lineNum"> 68 </span> :
<span class="lineNum"> 69 </span> : /*

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">2</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">2</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">2</td>

View file

@ -31,17 +31,17 @@
<td class="headerValue">lcov.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">1737</td>
<td class="headerCovTableEntry">1748</td>
<td class="headerCovTableEntryHi">99.4 %</td>
<td class="headerCovTableEntry">1746</td>
<td class="headerCovTableEntry">1758</td>
<td class="headerCovTableEntryHi">99.3 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">82</td>
<td class="headerCovTableEntry">82</td>
<td class="headerCovTableEntry">83</td>
<td class="headerCovTableEntry">83</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
@ -179,16 +179,6 @@
<td class="coverPerHi">100.0&nbsp;%</td>
<td class="coverNumHi">9 / 9</td>
</tr>
<tr>
<td class="coverFile"><a href="cpu.h.gcov.html">cpu.h</a></td>
<td class="coverBar" align="center">
<table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../amber.png" width=83 height=10 alt="83.3%"><img src="../snow.png" width=17 height=10 alt="83.3%"></td></tr></table>
</td>
<td class="coverPerMed">83.3&nbsp;%</td>
<td class="coverNumMed">55 / 66</td>
<td class="coverPerHi">100.0&nbsp;%</td>
<td class="coverNumHi">11 / 11</td>
</tr>
<tr>
<td class="coverFile"><a href="tag.c.gcov.html">tag.c</a></td>
<td class="coverBar" align="center">
@ -209,6 +199,16 @@
<td class="coverPerHi">100.0&nbsp;%</td>
<td class="coverNumHi">11 / 11</td>
</tr>
<tr>
<td class="coverFile"><a href="cpu.h.gcov.html">cpu.h</a></td>
<td class="coverBar" align="center">
<table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../amber.png" width=84 height=10 alt="84.2%"><img src="../snow.png" width=16 height=10 alt="84.2%"></td></tr></table>
</td>
<td class="coverPerMed">84.2&nbsp;%</td>
<td class="coverNumMed">64 / 76</td>
<td class="coverPerHi">100.0&nbsp;%</td>
<td class="coverNumHi">12 / 12</td>
</tr>
<tr>
<td class="coverFile"><a href="x86.c.gcov.html">x86.c</a></td>
<td class="coverBar" align="center">

View file

@ -31,17 +31,17 @@
<td class="headerValue">lcov.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">1737</td>
<td class="headerCovTableEntry">1748</td>
<td class="headerCovTableEntryHi">99.4 %</td>
<td class="headerCovTableEntry">1746</td>
<td class="headerCovTableEntry">1758</td>
<td class="headerCovTableEntryHi">99.3 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">82</td>
<td class="headerCovTableEntry">82</td>
<td class="headerCovTableEntry">83</td>
<td class="headerCovTableEntry">83</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
@ -72,12 +72,12 @@
<tr>
<td class="coverFile"><a href="cpu.h.gcov.html">cpu.h</a></td>
<td class="coverBar" align="center">
<table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../amber.png" width=83 height=10 alt="83.3%"><img src="../snow.png" width=17 height=10 alt="83.3%"></td></tr></table>
<table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../amber.png" width=84 height=10 alt="84.2%"><img src="../snow.png" width=16 height=10 alt="84.2%"></td></tr></table>
</td>
<td class="coverPerMed">83.3&nbsp;%</td>
<td class="coverNumMed">55 / 66</td>
<td class="coverPerMed">84.2&nbsp;%</td>
<td class="coverNumMed">64 / 76</td>
<td class="coverPerHi">100.0&nbsp;%</td>
<td class="coverNumHi">11 / 11</td>
<td class="coverNumHi">12 / 12</td>
</tr>
<tr>
<td class="coverFile"><a href="internal.h.gcov.html">internal.h</a></td>

View file

@ -31,17 +31,17 @@
<td class="headerValue">lcov.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">1737</td>
<td class="headerCovTableEntry">1748</td>
<td class="headerCovTableEntryHi">99.4 %</td>
<td class="headerCovTableEntry">1746</td>
<td class="headerCovTableEntry">1758</td>
<td class="headerCovTableEntryHi">99.3 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">82</td>
<td class="headerCovTableEntry">82</td>
<td class="headerCovTableEntry">83</td>
<td class="headerCovTableEntry">83</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
@ -92,12 +92,12 @@
<tr>
<td class="coverFile"><a href="cpu.h.gcov.html">cpu.h</a></td>
<td class="coverBar" align="center">
<table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../amber.png" width=83 height=10 alt="83.3%"><img src="../snow.png" width=17 height=10 alt="83.3%"></td></tr></table>
<table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../amber.png" width=84 height=10 alt="84.2%"><img src="../snow.png" width=16 height=10 alt="84.2%"></td></tr></table>
</td>
<td class="coverPerMed">83.3&nbsp;%</td>
<td class="coverNumMed">55 / 66</td>
<td class="coverPerMed">84.2&nbsp;%</td>
<td class="coverNumMed">64 / 76</td>
<td class="coverPerHi">100.0&nbsp;%</td>
<td class="coverNumHi">11 / 11</td>
<td class="coverNumHi">12 / 12</td>
</tr>
<tr>
<td class="coverFile"><a href="gf.h.gcov.html">gf.h</a></td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>
@ -69,7 +69,7 @@
</tr>
<tr>
<td class="coverFn"><a href="int.c.gcov.html#47">raid_gen1_int64</a></td>
<td class="coverFnHi">187</td>
<td class="coverFnHi">188</td>
</tr>
<tr>
<td class="coverFn"><a href="int.c.gcov.html#384">raid_rec1_int8</a></td>
@ -77,7 +77,7 @@
</tr>
<tr>
<td class="coverFn"><a href="int.c.gcov.html#19">raid_gen1_int32</a></td>
<td class="coverFnHi">116</td>
<td class="coverFnHi">117</td>
</tr>
<tr>
<td class="coverFn"><a href="int.c.gcov.html#116">raid_gen2_int64</a></td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>
@ -61,11 +61,11 @@
</tr>
<tr>
<td class="coverFn"><a href="int.c.gcov.html#19">raid_gen1_int32</a></td>
<td class="coverFnHi">116</td>
<td class="coverFnHi">117</td>
</tr>
<tr>
<td class="coverFn"><a href="int.c.gcov.html#47">raid_gen1_int64</a></td>
<td class="coverFnHi">187</td>
<td class="coverFnHi">188</td>
</tr>
<tr>
<td class="coverFn"><a href="int.c.gcov.html#75">raid_gen2_int32</a></td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>
@ -80,9 +80,9 @@
<span class="lineNum"> 18 </span> : /*
<a name="19"><span class="lineNum"> 19 </span> : * GEN1 (RAID5 with xor) 32bit C implementation</a>
<span class="lineNum"> 20 </span> : */
<span class="lineNum"> 21 </span><span class="lineCov"> 116 : void raid_gen1_int32(int nd, size_t size, void **vv)</span>
<span class="lineNum"> 21 </span><span class="lineCov"> 117 : void raid_gen1_int32(int nd, size_t size, void **vv)</span>
<span class="lineNum"> 22 </span> : {
<span class="lineNum"> 23 </span><span class="lineCov"> 116 : uint8_t **v = (uint8_t **)vv;</span>
<span class="lineNum"> 23 </span><span class="lineCov"> 117 : uint8_t **v = (uint8_t **)vv;</span>
<span class="lineNum"> 24 </span> : uint8_t *p;
<span class="lineNum"> 25 </span> : int d, l;
<span class="lineNum"> 26 </span> : size_t i;
@ -90,27 +90,27 @@
<span class="lineNum"> 28 </span> : uint32_t p0;
<span class="lineNum"> 29 </span> : uint32_t p1;
<span class="lineNum"> 30 </span> :
<span class="lineNum"> 31 </span><span class="lineCov"> 116 : l = nd - 1;</span>
<span class="lineNum"> 32 </span><span class="lineCov"> 116 : p = v[nd];</span>
<span class="lineNum"> 31 </span><span class="lineCov"> 117 : l = nd - 1;</span>
<span class="lineNum"> 32 </span><span class="lineCov"> 117 : p = v[nd];</span>
<span class="lineNum"> 33 </span> :
<span class="lineNum"> 34 </span><span class="lineCov"> 3702996 : for (i = 0; i &lt; size; i += 8) {</span>
<span class="lineNum"> 35 </span><span class="lineCov"> 3702880 : p0 = v_32(v[l][i]);</span>
<span class="lineNum"> 36 </span><span class="lineCov"> 3702880 : p1 = v_32(v[l][i + 4]);</span>
<span class="lineNum"> 37 </span><span class="lineCov"> 29624352 : for (d = l - 1; d &gt;= 0; --d) {</span>
<span class="lineNum"> 38 </span><span class="lineCov"> 25921472 : p0 ^= v_32(v[d][i]);</span>
<span class="lineNum"> 39 </span><span class="lineCov"> 25921472 : p1 ^= v_32(v[d][i + 4]);</span>
<span class="lineNum"> 34 </span><span class="lineCov"> 3735765 : for (i = 0; i &lt; size; i += 8) {</span>
<span class="lineNum"> 35 </span><span class="lineCov"> 3735648 : p0 = v_32(v[l][i]);</span>
<span class="lineNum"> 36 </span><span class="lineCov"> 3735648 : p1 = v_32(v[l][i + 4]);</span>
<span class="lineNum"> 37 </span><span class="lineCov"> 29886496 : for (d = l - 1; d &gt;= 0; --d) {</span>
<span class="lineNum"> 38 </span><span class="lineCov"> 26150848 : p0 ^= v_32(v[d][i]);</span>
<span class="lineNum"> 39 </span><span class="lineCov"> 26150848 : p1 ^= v_32(v[d][i + 4]);</span>
<span class="lineNum"> 40 </span> : }
<span class="lineNum"> 41 </span><span class="lineCov"> 3702880 : v_32(p[i]) = p0;</span>
<span class="lineNum"> 42 </span><span class="lineCov"> 3702880 : v_32(p[i + 4]) = p1;</span>
<span class="lineNum"> 41 </span><span class="lineCov"> 3735648 : v_32(p[i]) = p0;</span>
<span class="lineNum"> 42 </span><span class="lineCov"> 3735648 : v_32(p[i + 4]) = p1;</span>
<span class="lineNum"> 43 </span> : }
<span class="lineNum"> 44 </span><span class="lineCov"> 116 : }</span>
<span class="lineNum"> 44 </span><span class="lineCov"> 117 : }</span>
<span class="lineNum"> 45 </span> :
<span class="lineNum"> 46 </span> : /*
<a name="47"><span class="lineNum"> 47 </span> : * GEN1 (RAID5 with xor) 64bit C implementation</a>
<span class="lineNum"> 48 </span> : */
<span class="lineNum"> 49 </span><span class="lineCov"> 187 : void raid_gen1_int64(int nd, size_t size, void **vv)</span>
<span class="lineNum"> 49 </span><span class="lineCov"> 188 : void raid_gen1_int64(int nd, size_t size, void **vv)</span>
<span class="lineNum"> 50 </span> : {
<span class="lineNum"> 51 </span><span class="lineCov"> 187 : uint8_t **v = (uint8_t **)vv;</span>
<span class="lineNum"> 51 </span><span class="lineCov"> 188 : uint8_t **v = (uint8_t **)vv;</span>
<span class="lineNum"> 52 </span> : uint8_t *p;
<span class="lineNum"> 53 </span> : int d, l;
<span class="lineNum"> 54 </span> : size_t i;
@ -118,20 +118,20 @@
<span class="lineNum"> 56 </span> : uint64_t p0;
<span class="lineNum"> 57 </span> : uint64_t p1;
<span class="lineNum"> 58 </span> :
<span class="lineNum"> 59 </span><span class="lineCov"> 187 : l = nd - 1;</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 187 : p = v[nd];</span>
<span class="lineNum"> 59 </span><span class="lineCov"> 188 : l = nd - 1;</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 188 : p = v[nd];</span>
<span class="lineNum"> 61 </span> :
<span class="lineNum"> 62 </span><span class="lineCov"> 3014891 : for (i = 0; i &lt; size; i += 16) {</span>
<span class="lineNum"> 63 </span><span class="lineCov"> 3014704 : p0 = v_64(v[l][i]);</span>
<span class="lineNum"> 64 </span><span class="lineCov"> 3014704 : p1 = v_64(v[l][i + 8]);</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 24118288 : for (d = l - 1; d &gt;= 0; --d) {</span>
<span class="lineNum"> 66 </span><span class="lineCov"> 21103584 : p0 ^= v_64(v[d][i]);</span>
<span class="lineNum"> 67 </span><span class="lineCov"> 21103584 : p1 ^= v_64(v[d][i + 8]);</span>
<span class="lineNum"> 62 </span><span class="lineCov"> 3031276 : for (i = 0; i &lt; size; i += 16) {</span>
<span class="lineNum"> 63 </span><span class="lineCov"> 3031088 : p0 = v_64(v[l][i]);</span>
<span class="lineNum"> 64 </span><span class="lineCov"> 3031088 : p1 = v_64(v[l][i + 8]);</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 24249360 : for (d = l - 1; d &gt;= 0; --d) {</span>
<span class="lineNum"> 66 </span><span class="lineCov"> 21218272 : p0 ^= v_64(v[d][i]);</span>
<span class="lineNum"> 67 </span><span class="lineCov"> 21218272 : p1 ^= v_64(v[d][i + 8]);</span>
<span class="lineNum"> 68 </span> : }
<span class="lineNum"> 69 </span><span class="lineCov"> 3014704 : v_64(p[i]) = p0;</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 3014704 : v_64(p[i + 8]) = p1;</span>
<span class="lineNum"> 69 </span><span class="lineCov"> 3031088 : v_64(p[i]) = p0;</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 3031088 : v_64(p[i + 8]) = p1;</span>
<span class="lineNum"> 71 </span> : }
<span class="lineNum"> 72 </span><span class="lineCov"> 187 : }</span>
<span class="lineNum"> 72 </span><span class="lineCov"> 188 : }</span>
<span class="lineNum"> 73 </span> :
<span class="lineNum"> 74 </span> : /*
<a name="75"><span class="lineNum"> 75 </span> : * GEN2 (RAID6 with powers of 2) 32bit C implementation</a>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">0</td>
@ -159,11 +159,11 @@
<span class="lineNum"> 97 </span> : */
<span class="lineNum"> 98 </span> : static __always_inline void *__align_ptr(void *ptr, uintptr_t size)
<span class="lineNum"> 99 </span> : {
<span class="lineNum"> 100 </span><span class="lineCov"> 680589 : uintptr_t offset = (uintptr_t)ptr;</span>
<span class="lineNum"> 100 </span><span class="lineCov"> 696867 : uintptr_t offset = (uintptr_t)ptr;</span>
<span class="lineNum"> 101 </span> :
<span class="lineNum"> 102 </span><span class="lineCov"> 680589 : offset = (offset + size - 1U) &amp; ~(size - 1U);</span>
<span class="lineNum"> 102 </span><span class="lineCov"> 696867 : offset = (offset + size - 1U) &amp; ~(size - 1U);</span>
<span class="lineNum"> 103 </span> :
<span class="lineNum"> 104 </span><span class="lineCov"> 680589 : return (void *)offset;</span>
<span class="lineNum"> 104 </span><span class="lineCov"> 696867 : return (void *)offset;</span>
<span class="lineNum"> 105 </span> : }
<span class="lineNum"> 106 </span> :
<span class="lineNum"> 107 </span> : /*
@ -284,7 +284,7 @@
<span class="lineNum"> 222 </span> : /* that use a weak memory model. To ensure that other processors */
<span class="lineNum"> 223 </span> : /* see correctly the data written, we use a store-store memory */
<span class="lineNum"> 224 </span> : /* barrier at the end of the asm code */
<span class="lineNum"> 225 </span><span class="lineCov"> 1349399 : asm volatile (&quot;sfence&quot; : : : &quot;memory&quot;);</span>
<span class="lineNum"> 225 </span><span class="lineCov"> 1365600 : asm volatile (&quot;sfence&quot; : : : &quot;memory&quot;);</span>
<span class="lineNum"> 226 </span> :
<span class="lineNum"> 227 </span> : /* clobbers registers used in the asm code */
<span class="lineNum"> 228 </span> : /* this is required because in the Windows ABI, */

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">2</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">2</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">2</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">4</td>
@ -61,15 +61,15 @@
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#93">raid_mtest_vector</a></td>
<td class="coverFnHi">726</td>
<td class="coverFnHi">2583</td>
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#16">raid_malloc_align</a></td>
<td class="coverFnHi">274</td>
<td class="coverFnHi">290</td>
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#38">raid_malloc_vector</a></td>
<td class="coverFnHi">199</td>
<td class="coverFnHi">207</td>
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#78">raid_mrand_vector</a></td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">4</td>
@ -61,11 +61,11 @@
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#16">raid_malloc_align</a></td>
<td class="coverFnHi">274</td>
<td class="coverFnHi">290</td>
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#38">raid_malloc_vector</a></td>
<td class="coverFnHi">199</td>
<td class="coverFnHi">207</td>
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#78">raid_mrand_vector</a></td>
@ -73,7 +73,7 @@
</tr>
<tr>
<td class="coverFn"><a href="memory.c.gcov.html#93">raid_mtest_vector</a></td>
<td class="coverFnHi">726</td>
<td class="coverFnHi">2583</td>
</tr>
</table>
<br>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">4</td>
@ -77,66 +77,66 @@
<span class="lineNum"> 15 </span> : #include &quot;internal.h&quot;
<a name="16"><span class="lineNum"> 16 </span> : #include &quot;memory.h&quot;</a>
<span class="lineNum"> 17 </span> :
<span class="lineNum"> 18 </span><span class="lineCov"> 274 : void *raid_malloc_align(size_t size, void **freeptr)</span>
<span class="lineNum"> 18 </span><span class="lineCov"> 290 : void *raid_malloc_align(size_t size, void **freeptr)</span>
<span class="lineNum"> 19 </span> : {
<span class="lineNum"> 20 </span> : unsigned char *ptr;
<span class="lineNum"> 21 </span> : uintptr_t offset;
<span class="lineNum"> 22 </span> :
<span class="lineNum"> 23 </span><span class="lineCov"> 274 : ptr = malloc(size + RAID_MALLOC_ALIGN);</span>
<span class="lineNum"> 24 </span><span class="lineCov"> 274 : if (!ptr) {</span>
<span class="lineNum"> 23 </span><span class="lineCov"> 290 : ptr = malloc(size + RAID_MALLOC_ALIGN);</span>
<span class="lineNum"> 24 </span><span class="lineCov"> 290 : if (!ptr) {</span>
<span class="lineNum"> 25 </span> : /* LCOV_EXCL_START */
<span class="lineNum"> 26 </span> : return 0;
<span class="lineNum"> 27 </span> : /* LCOV_EXCL_STOP */
<span class="lineNum"> 28 </span> : }
<span class="lineNum"> 29 </span> :
<span class="lineNum"> 30 </span><span class="lineCov"> 274 : *freeptr = ptr;</span>
<span class="lineNum"> 30 </span><span class="lineCov"> 290 : *freeptr = ptr;</span>
<span class="lineNum"> 31 </span> :
<span class="lineNum"> 32 </span><span class="lineCov"> 274 : offset = ((uintptr_t)ptr) % RAID_MALLOC_ALIGN;</span>
<span class="lineNum"> 32 </span><span class="lineCov"> 290 : offset = ((uintptr_t)ptr) % RAID_MALLOC_ALIGN;</span>
<span class="lineNum"> 33 </span> :
<span class="lineNum"> 34 </span><span class="lineCov"> 274 : if (offset != 0)</span>
<span class="lineNum"> 35 </span><span class="lineCov"> 268 : ptr += RAID_MALLOC_ALIGN - offset;</span>
<span class="lineNum"> 34 </span><span class="lineCov"> 290 : if (offset != 0)</span>
<span class="lineNum"> 35 </span><span class="lineCov"> 284 : ptr += RAID_MALLOC_ALIGN - offset;</span>
<span class="lineNum"> 36 </span> :
<span class="lineNum"> 37 </span><span class="lineCov"> 274 : return ptr;</span>
<span class="lineNum"> 37 </span><span class="lineCov"> 290 : return ptr;</span>
<a name="38"><span class="lineNum"> 38 </span> : }</a>
<span class="lineNum"> 39 </span> :
<span class="lineNum"> 40 </span><span class="lineCov"> 199 : void **raid_malloc_vector(int nd, int n, size_t size, void **freeptr)</span>
<span class="lineNum"> 40 </span><span class="lineCov"> 207 : void **raid_malloc_vector(int nd, int n, size_t size, void **freeptr)</span>
<span class="lineNum"> 41 </span> : {
<span class="lineNum"> 42 </span> : void **v;
<span class="lineNum"> 43 </span> : unsigned char *va;
<span class="lineNum"> 44 </span> : int i;
<span class="lineNum"> 45 </span> :
<span class="lineNum"> 46 </span><span class="lineCov"> 199 : BUG_ON(n &lt;= 0 || nd &lt; 0);</span>
<span class="lineNum"> 46 </span><span class="lineCov"> 207 : BUG_ON(n &lt;= 0 || nd &lt; 0);</span>
<span class="lineNum"> 47 </span> :
<span class="lineNum"> 48 </span><span class="lineCov"> 199 : v = malloc(n * sizeof(void *));</span>
<span class="lineNum"> 49 </span><span class="lineCov"> 199 : if (!v) {</span>
<span class="lineNum"> 48 </span><span class="lineCov"> 207 : v = malloc(n * sizeof(void *));</span>
<span class="lineNum"> 49 </span><span class="lineCov"> 207 : if (!v) {</span>
<span class="lineNum"> 50 </span> : /* LCOV_EXCL_START */
<span class="lineNum"> 51 </span> : return 0;
<span class="lineNum"> 52 </span> : /* LCOV_EXCL_STOP */
<span class="lineNum"> 53 </span> : }
<span class="lineNum"> 54 </span> :
<span class="lineNum"> 55 </span><span class="lineCov"> 199 : va = raid_malloc_align(n * (size + RAID_MALLOC_DISPLACEMENT), freeptr);</span>
<span class="lineNum"> 56 </span><span class="lineCov"> 199 : if (!va) {</span>
<span class="lineNum"> 55 </span><span class="lineCov"> 207 : va = raid_malloc_align(n * (size + RAID_MALLOC_DISPLACEMENT), freeptr);</span>
<span class="lineNum"> 56 </span><span class="lineCov"> 207 : if (!va) {</span>
<span class="lineNum"> 57 </span> : /* LCOV_EXCL_START */
<span class="lineNum"> 58 </span> : free(v);
<span class="lineNum"> 59 </span> : return 0;
<span class="lineNum"> 60 </span> : /* LCOV_EXCL_STOP */
<span class="lineNum"> 61 </span> : }
<span class="lineNum"> 62 </span> :
<span class="lineNum"> 63 </span><span class="lineCov"> 3513 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 64 </span><span class="lineCov"> 3314 : v[i] = va;</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 3314 : va += size + RAID_MALLOC_DISPLACEMENT;</span>
<span class="lineNum"> 63 </span><span class="lineCov"> 3676 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 64 </span><span class="lineCov"> 3469 : v[i] = va;</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 3469 : va += size + RAID_MALLOC_DISPLACEMENT;</span>
<span class="lineNum"> 66 </span> : }
<span class="lineNum"> 67 </span> :
<span class="lineNum"> 68 </span> : /* reverse order of the data blocks */
<span class="lineNum"> 69 </span> : /* because they are usually accessed from the last one */
<span class="lineNum"> 70 </span><span class="lineCov"> 834 : for (i = 0; i &lt; nd / 2; ++i) {</span>
<span class="lineNum"> 71 </span><span class="lineCov"> 635 : void *ptr = v[i];</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 866 : for (i = 0; i &lt; nd / 2; ++i) {</span>
<span class="lineNum"> 71 </span><span class="lineCov"> 659 : void *ptr = v[i];</span>
<span class="lineNum"> 72 </span> :
<span class="lineNum"> 73 </span><span class="lineCov"> 635 : v[i] = v[nd - 1 - i];</span>
<span class="lineNum"> 74 </span><span class="lineCov"> 635 : v[nd - 1 - i] = ptr;</span>
<span class="lineNum"> 73 </span><span class="lineCov"> 659 : v[i] = v[nd - 1 - i];</span>
<span class="lineNum"> 74 </span><span class="lineCov"> 659 : v[nd - 1 - i] = ptr;</span>
<span class="lineNum"> 75 </span> : }
<span class="lineNum"> 76 </span> :
<span class="lineNum"> 77 </span><span class="lineCov"> 199 : return v;</span>
<span class="lineNum"> 77 </span><span class="lineCov"> 207 : return v;</span>
<a name="78"><span class="lineNum"> 78 </span> : }</a>
<span class="lineNum"> 79 </span> :
<span class="lineNum"> 80 </span><span class="lineCov"> 5 : void raid_mrand_vector(unsigned seed, int n, size_t size, void **vv)</span>
@ -154,9 +154,9 @@
<span class="lineNum"> 92 </span> : }
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 5 : }</span></a>
<span class="lineNum"> 94 </span> :
<span class="lineNum"> 95 </span><span class="lineCov"> 726 : int raid_mtest_vector(int n, size_t size, void **vv)</span>
<span class="lineNum"> 95 </span><span class="lineCov"> 2583 : int raid_mtest_vector(int n, size_t size, void **vv)</span>
<span class="lineNum"> 96 </span> : {
<span class="lineNum"> 97 </span><span class="lineCov"> 726 : unsigned char **v = (unsigned char **)vv;</span>
<span class="lineNum"> 97 </span><span class="lineCov"> 2583 : unsigned char **v = (unsigned char **)vv;</span>
<span class="lineNum"> 98 </span> : int i;
<span class="lineNum"> 99 </span> : size_t j;
<span class="lineNum"> 100 </span> : unsigned k;
@ -164,44 +164,44 @@
<span class="lineNum"> 102 </span> : unsigned char p;
<span class="lineNum"> 103 </span> :
<span class="lineNum"> 104 </span> : /* fill with 0 */
<span class="lineNum"> 105 </span><span class="lineCov"> 726 : d = 0;</span>
<span class="lineNum"> 106 </span><span class="lineCov"> 1544 : for (i = 0; i &lt; n; ++i)</span>
<span class="lineNum"> 107 </span><span class="lineCov"> 37971706 : for (j = 0; j &lt; size; ++j)</span>
<span class="lineNum"> 108 </span><span class="lineCov"> 37970888 : v[i][j] = d;</span>
<span class="lineNum"> 105 </span><span class="lineCov"> 2583 : d = 0;</span>
<span class="lineNum"> 106 </span><span class="lineCov"> 5257 : for (i = 0; i &lt; n; ++i)</span>
<span class="lineNum"> 107 </span><span class="lineCov"> 136288434 : for (j = 0; j &lt; size; ++j)</span>
<span class="lineNum"> 108 </span><span class="lineCov"> 136285760 : v[i][j] = d;</span>
<span class="lineNum"> 109 </span> :
<span class="lineNum"> 110 </span> : /* test with all the byte patterns */
<span class="lineNum"> 111 </span><span class="lineCov"> 185856 : for (k = 1; k &lt; 256; ++k) {</span>
<span class="lineNum"> 112 </span><span class="lineCov"> 185130 : p = d;</span>
<span class="lineNum"> 113 </span><span class="lineCov"> 185130 : d = k;</span>
<span class="lineNum"> 111 </span><span class="lineCov"> 661234 : for (k = 1; k &lt; 256; ++k) {</span>
<span class="lineNum"> 112 </span><span class="lineCov"> 658651 : p = d;</span>
<span class="lineNum"> 113 </span><span class="lineCov"> 658651 : d = k;</span>
<span class="lineNum"> 114 </span> :
<span class="lineNum"> 115 </span> : /* forward fill */
<span class="lineNum"> 116 </span><span class="lineCov"> 393720 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 117 </span><span class="lineCov"> 9682785030 : for (j = 0; j &lt; size; ++j) {</span>
<span class="lineNum"> 118 </span><span class="lineCov"> 9682576440 : if (v[i][j] != p) {</span>
<span class="lineNum"> 116 </span><span class="lineCov"> 1340760 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 117 </span><span class="lineCov">24240075844 : for (j = 0; j &lt; size; ++j) {</span>
<span class="lineNum"> 118 </span><span class="lineCov">24239393735 : if (v[i][j] != p) {</span>
<span class="lineNum"> 119 </span> : /* LCOV_EXCL_START */
<span class="lineNum"> 120 </span> : return -1;
<span class="lineNum"> 121 </span> : /* LCOV_EXCL_STOP */
<span class="lineNum"> 122 </span> : }
<span class="lineNum"> 123 </span><span class="lineCov"> 9682576440 : v[i][j] = d;</span>
<span class="lineNum"> 123 </span><span class="lineCov">24239393729 : v[i][j] = d;</span>
<span class="lineNum"> 124 </span> : }
<span class="lineNum"> 125 </span> : }
<span class="lineNum"> 126 </span> :
<span class="lineNum"> 127 </span><span class="lineCov"> 185130 : p = d;</span>
<span class="lineNum"> 128 </span><span class="lineCov"> 185130 : d = ~p;</span>
<span class="lineNum"> 127 </span><span class="lineCov"> 658645 : p = d;</span>
<span class="lineNum"> 128 </span><span class="lineCov"> 658645 : d = ~p;</span>
<span class="lineNum"> 129 </span> : /* backward fill with complement */
<span class="lineNum"> 130 </span><span class="lineCov"> 393720 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 131 </span><span class="lineCov"> 9682785030 : for (j = size; j &gt; 0; --j) {</span>
<span class="lineNum"> 132 </span><span class="lineCov"> 9682576440 : if (v[i][j - 1] != p) {</span>
<span class="lineNum"> 130 </span><span class="lineCov"> 1340755 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 131 </span><span class="lineCov">23878874802 : for (j = size; j &gt; 0; --j) {</span>
<span class="lineNum"> 132 </span><span class="lineCov">23878192692 : if (v[i][j - 1] != p) {</span>
<span class="lineNum"> 133 </span> : /* LCOV_EXCL_START */
<span class="lineNum"> 134 </span> : return -1;
<span class="lineNum"> 135 </span> : /* LCOV_EXCL_STOP */
<span class="lineNum"> 136 </span> : }
<span class="lineNum"> 137 </span><span class="lineCov"> 9682576440 : v[i][j - 1] = d;</span>
<span class="lineNum"> 137 </span><span class="lineCov">23878192698 : v[i][j - 1] = d;</span>
<span class="lineNum"> 138 </span> : }
<span class="lineNum"> 139 </span> : }
<span class="lineNum"> 140 </span> : }
<span class="lineNum"> 141 </span> :
<span class="lineNum"> 142 </span><span class="lineCov"> 726 : return 0;</span>
<span class="lineNum"> 142 </span><span class="lineCov"> 2583 : return 0;</span>
<span class="lineNum"> 143 </span> : }
<span class="lineNum"> 144 </span> :
</pre>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">7</td>
@ -61,7 +61,7 @@
</tr>
<tr>
<td class="coverFn"><a href="module.c.gcov.html#20">raid_init</a></td>
<td class="coverFnHi">240</td>
<td class="coverFnHi">252</td>
</tr>
<tr>
<td class="coverFn"><a href="module.c.gcov.html#180">raid_test_rec</a></td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">7</td>
@ -65,7 +65,7 @@
</tr>
<tr>
<td class="coverFn"><a href="module.c.gcov.html#20">raid_init</a></td>
<td class="coverFnHi">240</td>
<td class="coverFnHi">252</td>
</tr>
<tr>
<td class="coverFn"><a href="module.c.gcov.html#300">raid_selftest</a></td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">7</td>
@ -81,73 +81,73 @@
<span class="lineNum"> 19 </span> : /*
<a name="20"><span class="lineNum"> 20 </span> : * Initializes and selects the best algorithm.</a>
<span class="lineNum"> 21 </span> : */
<span class="lineNum"> 22 </span><span class="lineCov"> 240 : void raid_init(void)</span>
<span class="lineNum"> 22 </span><span class="lineCov"> 252 : void raid_init(void)</span>
<span class="lineNum"> 23 </span> : {
<span class="lineNum"> 24 </span><span class="lineCov"> 240 : raid_gen3_ptr = raid_gen3_int8;</span>
<span class="lineNum"> 25 </span><span class="lineCov"> 240 : raid_gen_ptr[3] = raid_gen4_int8;</span>
<span class="lineNum"> 26 </span><span class="lineCov"> 240 : raid_gen_ptr[4] = raid_gen5_int8;</span>
<span class="lineNum"> 27 </span><span class="lineCov"> 240 : raid_gen_ptr[5] = raid_gen6_int8;</span>
<span class="lineNum"> 24 </span><span class="lineCov"> 252 : raid_gen3_ptr = raid_gen3_int8;</span>
<span class="lineNum"> 25 </span><span class="lineCov"> 252 : raid_gen_ptr[3] = raid_gen4_int8;</span>
<span class="lineNum"> 26 </span><span class="lineCov"> 252 : raid_gen_ptr[4] = raid_gen5_int8;</span>
<span class="lineNum"> 27 </span><span class="lineCov"> 252 : raid_gen_ptr[5] = raid_gen6_int8;</span>
<span class="lineNum"> 28 </span> :
<span class="lineNum"> 29 </span> : if (sizeof(void *) == 4) {
<span class="lineNum"> 30 </span><span class="lineCov"> 240 : raid_gen_ptr[0] = raid_gen1_int32;</span>
<span class="lineNum"> 31 </span><span class="lineCov"> 240 : raid_gen_ptr[1] = raid_gen2_int32;</span>
<span class="lineNum"> 32 </span><span class="lineCov"> 240 : raid_genz_ptr = raid_genz_int32;</span>
<span class="lineNum"> 30 </span><span class="lineCov"> 252 : raid_gen_ptr[0] = raid_gen1_int32;</span>
<span class="lineNum"> 31 </span><span class="lineCov"> 252 : raid_gen_ptr[1] = raid_gen2_int32;</span>
<span class="lineNum"> 32 </span><span class="lineCov"> 252 : raid_genz_ptr = raid_genz_int32;</span>
<span class="lineNum"> 33 </span> : } else {
<span class="lineNum"> 34 </span> : raid_gen_ptr[0] = raid_gen1_int64;
<span class="lineNum"> 35 </span> : raid_gen_ptr[1] = raid_gen2_int64;
<span class="lineNum"> 36 </span> : raid_genz_ptr = raid_genz_int64;
<span class="lineNum"> 37 </span> : }
<span class="lineNum"> 38 </span> :
<span class="lineNum"> 39 </span><span class="lineCov"> 240 : raid_rec_ptr[0] = raid_rec1_int8;</span>
<span class="lineNum"> 40 </span><span class="lineCov"> 240 : raid_rec_ptr[1] = raid_rec2_int8;</span>
<span class="lineNum"> 41 </span><span class="lineCov"> 240 : raid_rec_ptr[2] = raid_recX_int8;</span>
<span class="lineNum"> 42 </span><span class="lineCov"> 240 : raid_rec_ptr[3] = raid_recX_int8;</span>
<span class="lineNum"> 43 </span><span class="lineCov"> 240 : raid_rec_ptr[4] = raid_recX_int8;</span>
<span class="lineNum"> 44 </span><span class="lineCov"> 240 : raid_rec_ptr[5] = raid_recX_int8;</span>
<span class="lineNum"> 39 </span><span class="lineCov"> 252 : raid_rec_ptr[0] = raid_rec1_int8;</span>
<span class="lineNum"> 40 </span><span class="lineCov"> 252 : raid_rec_ptr[1] = raid_rec2_int8;</span>
<span class="lineNum"> 41 </span><span class="lineCov"> 252 : raid_rec_ptr[2] = raid_recX_int8;</span>
<span class="lineNum"> 42 </span><span class="lineCov"> 252 : raid_rec_ptr[3] = raid_recX_int8;</span>
<span class="lineNum"> 43 </span><span class="lineCov"> 252 : raid_rec_ptr[4] = raid_recX_int8;</span>
<span class="lineNum"> 44 </span><span class="lineCov"> 252 : raid_rec_ptr[5] = raid_recX_int8;</span>
<span class="lineNum"> 45 </span> :
<span class="lineNum"> 46 </span> : #ifdef CONFIG_X86
<span class="lineNum"> 47 </span> : #ifdef CONFIG_SSE2
<span class="lineNum"> 48 </span><span class="lineCov"> 240 : if (raid_cpu_has_sse2()) {</span>
<span class="lineNum"> 49 </span><span class="lineCov"> 240 : raid_gen_ptr[0] = raid_gen1_sse2;</span>
<span class="lineNum"> 48 </span><span class="lineCov"> 252 : if (raid_cpu_has_sse2()) {</span>
<span class="lineNum"> 49 </span><span class="lineCov"> 252 : raid_gen_ptr[0] = raid_gen1_sse2;</span>
<span class="lineNum"> 50 </span> : #ifdef CONFIG_X86_64
<span class="lineNum"> 51 </span> : if (raid_cpu_has_slowextendedreg()) {
<span class="lineNum"> 52 </span> : raid_gen_ptr[1] = raid_gen2_sse2;
<span class="lineNum"> 53 </span> : raid_genz_ptr = raid_genz_sse2;
<span class="lineNum"> 54 </span> : } else {
<span class="lineNum"> 55 </span> : raid_gen_ptr[1] = raid_gen2_sse2ext;
<span class="lineNum"> 56 </span> : raid_genz_ptr = raid_genz_sse2ext;
<span class="lineNum"> 57 </span> : }
<span class="lineNum"> 53 </span> : } else {
<span class="lineNum"> 54 </span> : raid_gen_ptr[1] = raid_gen2_sse2ext;
<span class="lineNum"> 55 </span> : }
<span class="lineNum"> 56 </span> : /* note that raid_cpu_has_slowextendedreg() doesn't affect parz */
<span class="lineNum"> 57 </span> : raid_genz_ptr = raid_genz_sse2ext;
<span class="lineNum"> 58 </span> : #else
<span class="lineNum"> 59 </span><span class="lineCov"> 240 : raid_gen_ptr[1] = raid_gen2_sse2;</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 240 : raid_genz_ptr = raid_genz_sse2;</span>
<span class="lineNum"> 59 </span><span class="lineCov"> 252 : raid_gen_ptr[1] = raid_gen2_sse2;</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 252 : raid_genz_ptr = raid_genz_sse2;</span>
<span class="lineNum"> 61 </span> : #endif
<span class="lineNum"> 62 </span> : }
<span class="lineNum"> 63 </span> : #endif
<span class="lineNum"> 64 </span> :
<span class="lineNum"> 65 </span> : #ifdef CONFIG_SSSE3
<span class="lineNum"> 66 </span><span class="lineCov"> 240 : if (raid_cpu_has_ssse3()) {</span>
<span class="lineNum"> 66 </span><span class="lineCov"> 252 : if (raid_cpu_has_ssse3()) {</span>
<span class="lineNum"> 67 </span> : #ifdef CONFIG_X86_64
<span class="lineNum"> 68 </span> : raid_gen3_ptr = raid_gen3_ssse3ext;
<span class="lineNum"> 69 </span> : raid_gen_ptr[3] = raid_gen4_ssse3ext;
<span class="lineNum"> 70 </span> : raid_gen_ptr[4] = raid_gen5_ssse3ext;
<span class="lineNum"> 71 </span> : raid_gen_ptr[5] = raid_gen6_ssse3ext;
<span class="lineNum"> 72 </span> : #else
<span class="lineNum"> 73 </span><span class="lineCov"> 239 : raid_gen3_ptr = raid_gen3_ssse3;</span>
<span class="lineNum"> 74 </span><span class="lineCov"> 239 : raid_gen_ptr[3] = raid_gen4_ssse3;</span>
<span class="lineNum"> 75 </span><span class="lineCov"> 239 : raid_gen_ptr[4] = raid_gen5_ssse3;</span>
<span class="lineNum"> 76 </span><span class="lineCov"> 239 : raid_gen_ptr[5] = raid_gen6_ssse3;</span>
<span class="lineNum"> 73 </span><span class="lineCov"> 251 : raid_gen3_ptr = raid_gen3_ssse3;</span>
<span class="lineNum"> 74 </span><span class="lineCov"> 251 : raid_gen_ptr[3] = raid_gen4_ssse3;</span>
<span class="lineNum"> 75 </span><span class="lineCov"> 251 : raid_gen_ptr[4] = raid_gen5_ssse3;</span>
<span class="lineNum"> 76 </span><span class="lineCov"> 251 : raid_gen_ptr[5] = raid_gen6_ssse3;</span>
<span class="lineNum"> 77 </span> : #endif
<span class="lineNum"> 78 </span><span class="lineCov"> 239 : raid_rec_ptr[0] = raid_rec1_ssse3;</span>
<span class="lineNum"> 79 </span><span class="lineCov"> 239 : raid_rec_ptr[1] = raid_rec2_ssse3;</span>
<span class="lineNum"> 80 </span><span class="lineCov"> 239 : raid_rec_ptr[2] = raid_recX_ssse3;</span>
<span class="lineNum"> 81 </span><span class="lineCov"> 239 : raid_rec_ptr[3] = raid_recX_ssse3;</span>
<span class="lineNum"> 82 </span><span class="lineCov"> 239 : raid_rec_ptr[4] = raid_recX_ssse3;</span>
<span class="lineNum"> 83 </span><span class="lineCov"> 239 : raid_rec_ptr[5] = raid_recX_ssse3;</span>
<span class="lineNum"> 78 </span><span class="lineCov"> 251 : raid_rec_ptr[0] = raid_rec1_ssse3;</span>
<span class="lineNum"> 79 </span><span class="lineCov"> 251 : raid_rec_ptr[1] = raid_rec2_ssse3;</span>
<span class="lineNum"> 80 </span><span class="lineCov"> 251 : raid_rec_ptr[2] = raid_recX_ssse3;</span>
<span class="lineNum"> 81 </span><span class="lineCov"> 251 : raid_rec_ptr[3] = raid_recX_ssse3;</span>
<span class="lineNum"> 82 </span><span class="lineCov"> 251 : raid_rec_ptr[4] = raid_recX_ssse3;</span>
<span class="lineNum"> 83 </span><span class="lineCov"> 251 : raid_rec_ptr[5] = raid_recX_ssse3;</span>
<span class="lineNum"> 84 </span> : }
<span class="lineNum"> 85 </span> : #endif
<span class="lineNum"> 86 </span> :
<span class="lineNum"> 87 </span> : #ifdef CONFIG_AVX2
<span class="lineNum"> 88 </span><span class="lineCov"> 240 : if (raid_cpu_has_avx2()) {</span>
<span class="lineNum"> 88 </span><span class="lineCov"> 252 : if (raid_cpu_has_avx2()) {</span>
<span class="lineNum"> 89 </span><span class="lineCov"> 2 : raid_gen_ptr[0] = raid_gen1_avx2;</span>
<span class="lineNum"> 90 </span><span class="lineCov"> 2 : raid_gen_ptr[1] = raid_gen2_avx2;</span>
<span class="lineNum"> 91 </span> : #ifdef CONFIG_X86_64
@ -168,8 +168,8 @@
<span class="lineNum"> 106 </span> : #endif /* CONFIG_X86 */
<span class="lineNum"> 107 </span> :
<span class="lineNum"> 108 </span> : /* set the default mode */
<span class="lineNum"> 109 </span><span class="lineCov"> 240 : raid_mode(RAID_MODE_CAUCHY);</span>
<span class="lineNum"> 110 </span><span class="lineCov"> 240 : }</span>
<span class="lineNum"> 109 </span><span class="lineCov"> 252 : raid_mode(RAID_MODE_CAUCHY);</span>
<span class="lineNum"> 110 </span><span class="lineCov"> 252 : }</span>
<span class="lineNum"> 111 </span> :
<span class="lineNum"> 112 </span> : /*
<a name="113"><span class="lineNum"> 113 </span> : * Reference parity computation.</a>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">9</td>
@ -61,23 +61,23 @@
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#221">raid_gen</a></td>
<td class="coverFnHi">1196804</td>
<td class="coverFnHi">1212640</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#554">raid_data</a></td>
<td class="coverFnHi">213294</td>
<td class="coverFnHi">217819</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#244">raid_invert</a></td>
<td class="coverFnHi">172492</td>
<td class="coverFnHi">172870</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#289">raid_delta_gen</a></td>
<td class="coverFnHi">171154</td>
<td class="coverFnHi">171518</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#383">raid_rec1of1</a></td>
<td class="coverFnHi">100552</td>
<td class="coverFnHi">104713</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#493">raid_rec</a></td>
@ -85,11 +85,11 @@
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#174">raid_mode</a></td>
<td class="coverFnHi">480</td>
<td class="coverFnHi">503</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#190">raid_zero</a></td>
<td class="coverFnHi">187</td>
<td class="coverFnHi">193</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#430">raid_rec2of2_int8</a></td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">9</td>
@ -61,23 +61,23 @@
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#554">raid_data</a></td>
<td class="coverFnHi">213294</td>
<td class="coverFnHi">217819</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#289">raid_delta_gen</a></td>
<td class="coverFnHi">171154</td>
<td class="coverFnHi">171518</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#221">raid_gen</a></td>
<td class="coverFnHi">1196804</td>
<td class="coverFnHi">1212640</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#244">raid_invert</a></td>
<td class="coverFnHi">172492</td>
<td class="coverFnHi">172870</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#174">raid_mode</a></td>
<td class="coverFnHi">480</td>
<td class="coverFnHi">503</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#493">raid_rec</a></td>
@ -85,7 +85,7 @@
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#383">raid_rec1of1</a></td>
<td class="coverFnHi">100552</td>
<td class="coverFnHi">104713</td>
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#430">raid_rec2of2_int8</a></td>
@ -93,7 +93,7 @@
</tr>
<tr>
<td class="coverFn"><a href="raid.c.gcov.html#190">raid_zero</a></td>
<td class="coverFnHi">187</td>
<td class="coverFnHi">193</td>
</tr>
</table>
<br>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">9</td>
@ -235,26 +235,26 @@
<span class="lineNum"> 173 </span> : */
<a name="174"><span class="lineNum"> 174 </span> : const uint8_t (*raid_gfgen)[256];</a>
<span class="lineNum"> 175 </span> :
<span class="lineNum"> 176 </span><span class="lineCov"> 480 : void raid_mode(int mode)</span>
<span class="lineNum"> 176 </span><span class="lineCov"> 503 : void raid_mode(int mode)</span>
<span class="lineNum"> 177 </span> : {
<span class="lineNum"> 178 </span><span class="lineCov"> 480 : if (mode == RAID_MODE_VANDERMONDE) {</span>
<span class="lineNum"> 178 </span><span class="lineCov"> 503 : if (mode == RAID_MODE_VANDERMONDE) {</span>
<span class="lineNum"> 179 </span><span class="lineCov"> 2 : raid_gen_ptr[2] = raid_genz_ptr;</span>
<span class="lineNum"> 180 </span><span class="lineCov"> 2 : raid_gfgen = gfvandermonde;</span>
<span class="lineNum"> 181 </span> : } else {
<span class="lineNum"> 182 </span><span class="lineCov"> 478 : raid_gen_ptr[2] = raid_gen3_ptr;</span>
<span class="lineNum"> 183 </span><span class="lineCov"> 478 : raid_gfgen = gfcauchy;</span>
<span class="lineNum"> 182 </span><span class="lineCov"> 501 : raid_gen_ptr[2] = raid_gen3_ptr;</span>
<span class="lineNum"> 183 </span><span class="lineCov"> 501 : raid_gfgen = gfcauchy;</span>
<span class="lineNum"> 184 </span> : }
<span class="lineNum"> 185 </span><span class="lineCov"> 480 : }</span>
<span class="lineNum"> 185 </span><span class="lineCov"> 503 : }</span>
<span class="lineNum"> 186 </span> :
<span class="lineNum"> 187 </span> : /**
<span class="lineNum"> 188 </span> : * Buffer filled with 0 used in recovering.
<span class="lineNum"> 189 </span> : */
<a name="190"><span class="lineNum"> 190 </span> : static void *raid_zero_block;</a>
<span class="lineNum"> 191 </span> :
<span class="lineNum"> 192 </span><span class="lineCov"> 187 : void raid_zero(void *zero)</span>
<span class="lineNum"> 192 </span><span class="lineCov"> 193 : void raid_zero(void *zero)</span>
<span class="lineNum"> 193 </span> : {
<span class="lineNum"> 194 </span><span class="lineCov"> 187 : raid_zero_block = zero;</span>
<span class="lineNum"> 195 </span><span class="lineCov"> 187 : }</span>
<span class="lineNum"> 194 </span><span class="lineCov"> 193 : raid_zero_block = zero;</span>
<span class="lineNum"> 195 </span><span class="lineCov"> 193 : }</span>
<span class="lineNum"> 196 </span> :
<span class="lineNum"> 197 </span> : /*
<span class="lineNum"> 198 </span> : * Forwarders for parity computation.
@ -282,17 +282,17 @@
<span class="lineNum"> 220 </span> : void (*raid_gen3_ptr)(int nd, size_t size, void **vv);
<a name="221"><span class="lineNum"> 221 </span> : void (*raid_genz_ptr)(int nd, size_t size, void **vv);</a>
<span class="lineNum"> 222 </span> :
<span class="lineNum"> 223 </span><span class="lineCov"> 1196804 : void raid_gen(int nd, int np, size_t size, void **v)</span>
<span class="lineNum"> 223 </span><span class="lineCov"> 1212640 : void raid_gen(int nd, int np, size_t size, void **v)</span>
<span class="lineNum"> 224 </span> : {
<span class="lineNum"> 225 </span> : /* enforce limit on size */
<span class="lineNum"> 226 </span><span class="lineCov"> 1196804 : BUG_ON(size % 64 != 0);</span>
<span class="lineNum"> 226 </span><span class="lineCov"> 1212640 : BUG_ON(size % 64 != 0);</span>
<span class="lineNum"> 227 </span> :
<span class="lineNum"> 228 </span> : /* enforce limit on number of failures */
<span class="lineNum"> 229 </span><span class="lineCov"> 1196804 : BUG_ON(np &lt; 1);</span>
<span class="lineNum"> 230 </span><span class="lineCov"> 1196804 : BUG_ON(np &gt; RAID_PARITY_MAX);</span>
<span class="lineNum"> 229 </span><span class="lineCov"> 1212640 : BUG_ON(np &lt; 1);</span>
<span class="lineNum"> 230 </span><span class="lineCov"> 1212640 : BUG_ON(np &gt; RAID_PARITY_MAX);</span>
<span class="lineNum"> 231 </span> :
<span class="lineNum"> 232 </span><span class="lineCov"> 1196804 : raid_gen_ptr[np - 1](nd, size, v);</span>
<span class="lineNum"> 233 </span><span class="lineCov"> 1196804 : }</span>
<span class="lineNum"> 232 </span><span class="lineCov"> 1212640 : raid_gen_ptr[np - 1](nd, size, v);</span>
<span class="lineNum"> 233 </span><span class="lineCov"> 1212640 : }</span>
<span class="lineNum"> 234 </span> :
<span class="lineNum"> 235 </span> : /**
<span class="lineNum"> 236 </span> : * Inverts the square matrix M of size nxn into V.
@ -305,44 +305,44 @@
<span class="lineNum"> 243 </span> : * @V Destination matrix where the result is put.
<a name="244"><span class="lineNum"> 244 </span> : * @n Number of rows and columns of the matrix.</a>
<span class="lineNum"> 245 </span> : */
<span class="lineNum"> 246 </span><span class="lineCov"> 172492 : void raid_invert(uint8_t *M, uint8_t *V, int n)</span>
<span class="lineNum"> 246 </span><span class="lineCov"> 172870 : void raid_invert(uint8_t *M, uint8_t *V, int n)</span>
<span class="lineNum"> 247 </span> : {
<span class="lineNum"> 248 </span> : int i, j, k;
<span class="lineNum"> 249 </span> :
<span class="lineNum"> 250 </span> : /* set the identity matrix in V */
<span class="lineNum"> 251 </span><span class="lineCov"> 797645 : for (i = 0; i &lt; n; ++i)</span>
<span class="lineNum"> 252 </span><span class="lineCov"> 3220636 : for (j = 0; j &lt; n; ++j)</span>
<span class="lineNum"> 253 </span><span class="lineCov"> 2595483 : V[i * n + j] = i == j;</span>
<span class="lineNum"> 251 </span><span class="lineCov"> 798767 : for (i = 0; i &lt; n; ++i)</span>
<span class="lineNum"> 252 </span><span class="lineCov"> 3222808 : for (j = 0; j &lt; n; ++j)</span>
<span class="lineNum"> 253 </span><span class="lineCov"> 2596911 : V[i * n + j] = i == j;</span>
<span class="lineNum"> 254 </span> :
<span class="lineNum"> 255 </span> : /* for each element in the diagonal */
<span class="lineNum"> 256 </span><span class="lineCov"> 797645 : for (k = 0; k &lt; n; ++k) {</span>
<span class="lineNum"> 256 </span><span class="lineCov"> 798767 : for (k = 0; k &lt; n; ++k) {</span>
<span class="lineNum"> 257 </span> : uint8_t f;
<span class="lineNum"> 258 </span> :
<span class="lineNum"> 259 </span> : /* the diagonal element cannot be 0 because */
<span class="lineNum"> 260 </span> : /* we are inverting matrices with all the square */
<span class="lineNum"> 261 </span> : /* submatrices not singular */
<span class="lineNum"> 262 </span><span class="lineCov"> 625153 : BUG_ON(M[k * n + k] == 0);</span>
<span class="lineNum"> 262 </span><span class="lineCov"> 625897 : BUG_ON(M[k * n + k] == 0);</span>
<span class="lineNum"> 263 </span> :
<span class="lineNum"> 264 </span> : /* make the diagonal element to be 1 */
<span class="lineNum"> 265 </span><span class="lineCov"> 1250306 : f = inv(M[k * n + k]);</span>
<span class="lineNum"> 266 </span><span class="lineCov"> 3220636 : for (j = 0; j &lt; n; ++j) {</span>
<span class="lineNum"> 267 </span><span class="lineCov"> 5190966 : M[k * n + j] = mul(f, M[k * n + j]);</span>
<span class="lineNum"> 268 </span><span class="lineCov"> 5190966 : V[k * n + j] = mul(f, V[k * n + j]);</span>
<span class="lineNum"> 265 </span><span class="lineCov"> 1251794 : f = inv(M[k * n + k]);</span>
<span class="lineNum"> 266 </span><span class="lineCov"> 3222808 : for (j = 0; j &lt; n; ++j) {</span>
<span class="lineNum"> 267 </span><span class="lineCov"> 5193822 : M[k * n + j] = mul(f, M[k * n + j]);</span>
<span class="lineNum"> 268 </span><span class="lineCov"> 5193822 : V[k * n + j] = mul(f, V[k * n + j]);</span>
<span class="lineNum"> 269 </span> : }
<span class="lineNum"> 270 </span> :
<span class="lineNum"> 271 </span> : /* make all the elements over and under the diagonal */
<span class="lineNum"> 272 </span> : /* to be zero */
<span class="lineNum"> 273 </span><span class="lineCov"> 3220636 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 274 </span><span class="lineCov"> 2595483 : if (i == k)</span>
<span class="lineNum"> 275 </span><span class="lineCov"> 625153 : continue;</span>
<span class="lineNum"> 276 </span><span class="lineCov"> 1970330 : f = M[i * n + k];</span>
<span class="lineNum"> 277 </span><span class="lineCov"> 11280588 : for (j = 0; j &lt; n; ++j) {</span>
<span class="lineNum"> 278 </span><span class="lineCov"> 18620516 : M[i * n + j] ^= mul(f, M[k * n + j]);</span>
<span class="lineNum"> 279 </span><span class="lineCov"> 18620516 : V[i * n + j] ^= mul(f, V[k * n + j]);</span>
<span class="lineNum"> 273 </span><span class="lineCov"> 3222808 : for (i = 0; i &lt; n; ++i) {</span>
<span class="lineNum"> 274 </span><span class="lineCov"> 2596911 : if (i == k)</span>
<span class="lineNum"> 275 </span><span class="lineCov"> 625897 : continue;</span>
<span class="lineNum"> 276 </span><span class="lineCov"> 1971014 : f = M[i * n + k];</span>
<span class="lineNum"> 277 </span><span class="lineCov"> 11282400 : for (j = 0; j &lt; n; ++j) {</span>
<span class="lineNum"> 278 </span><span class="lineCov"> 18622772 : M[i * n + j] ^= mul(f, M[k * n + j]);</span>
<span class="lineNum"> 279 </span><span class="lineCov"> 18622772 : V[i * n + j] ^= mul(f, V[k * n + j]);</span>
<span class="lineNum"> 280 </span> : }
<span class="lineNum"> 281 </span> : }
<span class="lineNum"> 282 </span> : }
<span class="lineNum"> 283 </span><span class="lineCov"> 172492 : }</span>
<span class="lineNum"> 283 </span><span class="lineCov"> 172870 : }</span>
<span class="lineNum"> 284 </span> :
<span class="lineNum"> 285 </span> : /**
<span class="lineNum"> 286 </span> : * Computes the parity without the missing data blocks
@ -350,7 +350,7 @@
<span class="lineNum"> 288 </span> : *
<a name="289"><span class="lineNum"> 289 </span> : * This is the parity expressed as Pa,Qa,Ra,Sa,Ta,Ua in the equations.</a>
<span class="lineNum"> 290 </span> : */
<span class="lineNum"> 291 </span><span class="lineCov"> 171154 : void raid_delta_gen(int nr, int *id, int *ip, int nd, size_t size, void **v)</span>
<span class="lineNum"> 291 </span><span class="lineCov"> 171518 : void raid_delta_gen(int nr, int *id, int *ip, int nd, size_t size, void **v)</span>
<span class="lineNum"> 292 </span> : {
<span class="lineNum"> 293 </span> : void *p[RAID_PARITY_MAX];
<span class="lineNum"> 294 </span> : void *pa[RAID_PARITY_MAX];
@ -360,17 +360,17 @@
<span class="lineNum"> 298 </span> :
<span class="lineNum"> 299 </span> : /* total number of parities we are going to process */
<span class="lineNum"> 300 </span> : /* they are both the used and the unused ones */
<span class="lineNum"> 301 </span><span class="lineCov"> 171154 : np = ip[nr - 1] + 1;</span>
<span class="lineNum"> 301 </span><span class="lineCov"> 171518 : np = ip[nr - 1] + 1;</span>
<span class="lineNum"> 302 </span> :
<span class="lineNum"> 303 </span> : /* latest missing data block */
<span class="lineNum"> 304 </span><span class="lineCov"> 171154 : latest = v[id[nr - 1]];</span>
<span class="lineNum"> 304 </span><span class="lineCov"> 171518 : latest = v[id[nr - 1]];</span>
<span class="lineNum"> 305 </span> :
<span class="lineNum"> 306 </span> : /* setup pointers for delta computation */
<span class="lineNum"> 307 </span><span class="lineCov"> 872118 : for (i = 0, j = 0; i &lt; np; ++i) {</span>
<span class="lineNum"> 307 </span><span class="lineCov"> 873198 : for (i = 0, j = 0; i &lt; np; ++i) {</span>
<span class="lineNum"> 308 </span> : /* keep a copy of the original parity vector */
<span class="lineNum"> 309 </span><span class="lineCov"> 700964 : p[i] = v[nd + i];</span>
<span class="lineNum"> 309 </span><span class="lineCov"> 701680 : p[i] = v[nd + i];</span>
<span class="lineNum"> 310 </span> :
<span class="lineNum"> 311 </span><span class="lineCov"> 700964 : if (ip[j] == i) {</span>
<span class="lineNum"> 311 </span><span class="lineCov"> 701680 : if (ip[j] == i) {</span>
<span class="lineNum"> 312 </span> : /*
<span class="lineNum"> 313 </span> : * Set used parities to point to the missing
<span class="lineNum"> 314 </span> : * data blocks.
@ -381,19 +381,19 @@
<span class="lineNum"> 319 </span> :
<span class="lineNum"> 320 </span> : /* the latest parity to use ends the for loop and */
<span class="lineNum"> 321 </span> : /* then it cannot happen to process more of them */
<span class="lineNum"> 322 </span><span class="lineCov"> 605141 : BUG_ON(j &gt;= nr);</span>
<span class="lineNum"> 322 </span><span class="lineCov"> 605871 : BUG_ON(j &gt;= nr);</span>
<span class="lineNum"> 323 </span> :
<span class="lineNum"> 324 </span> : /* buffer for missing data blocks */
<span class="lineNum"> 325 </span><span class="lineCov"> 605141 : pa[j] = v[id[j]];</span>
<span class="lineNum"> 325 </span><span class="lineCov"> 605871 : pa[j] = v[id[j]];</span>
<span class="lineNum"> 326 </span> :
<span class="lineNum"> 327 </span> : /* set at zero the missing data blocks */
<span class="lineNum"> 328 </span><span class="lineCov"> 605141 : v[id[j]] = raid_zero_block;</span>
<span class="lineNum"> 328 </span><span class="lineCov"> 605871 : v[id[j]] = raid_zero_block;</span>
<span class="lineNum"> 329 </span> :
<span class="lineNum"> 330 </span> : /* compute the parity over the missing data blocks */
<span class="lineNum"> 331 </span><span class="lineCov"> 605141 : v[nd + i] = pa[j];</span>
<span class="lineNum"> 331 </span><span class="lineCov"> 605871 : v[nd + i] = pa[j];</span>
<span class="lineNum"> 332 </span> :
<span class="lineNum"> 333 </span> : /* check for the next used entry */
<span class="lineNum"> 334 </span><span class="lineCov"> 605141 : ++j;</span>
<span class="lineNum"> 334 </span><span class="lineCov"> 605871 : ++j;</span>
<span class="lineNum"> 335 </span> : } else {
<span class="lineNum"> 336 </span> : /*
<span class="lineNum"> 337 </span> : * Unused parities are going to be rewritten with
@ -413,25 +413,25 @@
<span class="lineNum"> 351 </span> : * multiple times and only the latest write will
<span class="lineNum"> 352 </span> : * contain the correct data.
<span class="lineNum"> 353 </span> : */
<span class="lineNum"> 354 </span><span class="lineCov"> 95823 : v[nd + i] = latest;</span>
<span class="lineNum"> 354 </span><span class="lineCov"> 95809 : v[nd + i] = latest;</span>
<span class="lineNum"> 355 </span> : }
<span class="lineNum"> 356 </span> : }
<span class="lineNum"> 357 </span> :
<span class="lineNum"> 358 </span> : /* all the parities have to be processed */
<span class="lineNum"> 359 </span><span class="lineCov"> 171154 : BUG_ON(j != nr);</span>
<span class="lineNum"> 359 </span><span class="lineCov"> 171518 : BUG_ON(j != nr);</span>
<span class="lineNum"> 360 </span> :
<span class="lineNum"> 361 </span> : /* recompute the parity, note that np may be smaller than the */
<span class="lineNum"> 362 </span> : /* total number of parities available */
<span class="lineNum"> 363 </span><span class="lineCov"> 171154 : raid_gen(nd, np, size, v);</span>
<span class="lineNum"> 363 </span><span class="lineCov"> 171518 : raid_gen(nd, np, size, v);</span>
<span class="lineNum"> 364 </span> :
<span class="lineNum"> 365 </span> : /* restore data buffers as before */
<span class="lineNum"> 366 </span><span class="lineCov"> 776295 : for (j = 0; j &lt; nr; ++j)</span>
<span class="lineNum"> 367 </span><span class="lineCov"> 605141 : v[id[j]] = pa[j];</span>
<span class="lineNum"> 366 </span><span class="lineCov"> 777389 : for (j = 0; j &lt; nr; ++j)</span>
<span class="lineNum"> 367 </span><span class="lineCov"> 605871 : v[id[j]] = pa[j];</span>
<span class="lineNum"> 368 </span> :
<span class="lineNum"> 369 </span> : /* restore parity buffers as before */
<span class="lineNum"> 370 </span><span class="lineCov"> 872118 : for (i = 0; i &lt; np; ++i)</span>
<span class="lineNum"> 371 </span><span class="lineCov"> 700964 : v[nd + i] = p[i];</span>
<span class="lineNum"> 372 </span><span class="lineCov"> 171154 : }</span>
<span class="lineNum"> 370 </span><span class="lineCov"> 873198 : for (i = 0; i &lt; np; ++i)</span>
<span class="lineNum"> 371 </span><span class="lineCov"> 701680 : v[nd + i] = p[i];</span>
<span class="lineNum"> 372 </span><span class="lineCov"> 171518 : }</span>
<span class="lineNum"> 373 </span> :
<span class="lineNum"> 374 </span> : /**
<span class="lineNum"> 375 </span> : * Recover failure of one data block for PAR1.
@ -444,29 +444,29 @@
<span class="lineNum"> 382 </span> : *
<a name="383"><span class="lineNum"> 383 </span> : * Dx = Pd</a>
<span class="lineNum"> 384 </span> : */
<span class="lineNum"> 385 </span><span class="lineCov"> 100552 : void raid_rec1of1(int *id, int nd, size_t size, void **v)</span>
<span class="lineNum"> 385 </span><span class="lineCov"> 104713 : void raid_rec1of1(int *id, int nd, size_t size, void **v)</span>
<span class="lineNum"> 386 </span> : {
<span class="lineNum"> 387 </span> : void *p;
<span class="lineNum"> 388 </span> : void *pa;
<span class="lineNum"> 389 </span> :
<span class="lineNum"> 390 </span> : /* for PAR1 we can directly compute the missing block */
<span class="lineNum"> 391 </span> : /* and we don't need to use the zero buffer */
<span class="lineNum"> 392 </span><span class="lineCov"> 100552 : p = v[nd];</span>
<span class="lineNum"> 393 </span><span class="lineCov"> 100552 : pa = v[id[0]];</span>
<span class="lineNum"> 392 </span><span class="lineCov"> 104713 : p = v[nd];</span>
<span class="lineNum"> 393 </span><span class="lineCov"> 104713 : pa = v[id[0]];</span>
<span class="lineNum"> 394 </span> :
<span class="lineNum"> 395 </span> : /* use the parity as missing data block */
<span class="lineNum"> 396 </span><span class="lineCov"> 100552 : v[id[0]] = p;</span>
<span class="lineNum"> 396 </span><span class="lineCov"> 104713 : v[id[0]] = p;</span>
<span class="lineNum"> 397 </span> :
<span class="lineNum"> 398 </span> : /* compute the parity over the missing data block */
<span class="lineNum"> 399 </span><span class="lineCov"> 100552 : v[nd] = pa;</span>
<span class="lineNum"> 399 </span><span class="lineCov"> 104713 : v[nd] = pa;</span>
<span class="lineNum"> 400 </span> :
<span class="lineNum"> 401 </span> : /* compute */
<span class="lineNum"> 402 </span><span class="lineCov"> 100552 : raid_gen(nd, 1, size, v);</span>
<span class="lineNum"> 402 </span><span class="lineCov"> 104713 : raid_gen(nd, 1, size, v);</span>
<span class="lineNum"> 403 </span> :
<span class="lineNum"> 404 </span> : /* restore as before */
<span class="lineNum"> 405 </span><span class="lineCov"> 100552 : v[id[0]] = pa;</span>
<span class="lineNum"> 406 </span><span class="lineCov"> 100552 : v[nd] = p;</span>
<span class="lineNum"> 407 </span><span class="lineCov"> 100552 : }</span>
<span class="lineNum"> 405 </span><span class="lineCov"> 104713 : v[id[0]] = pa;</span>
<span class="lineNum"> 406 </span><span class="lineCov"> 104713 : v[nd] = p;</span>
<span class="lineNum"> 407 </span><span class="lineCov"> 104713 : }</span>
<span class="lineNum"> 408 </span> :
<span class="lineNum"> 409 </span> : /**
<span class="lineNum"> 410 </span> : * Recover failure of two data blocks for PAR2.
@ -615,36 +615,36 @@
<span class="lineNum"> 553 </span><span class="lineCov"> 12 : raid_gen(nd, ir[nr - 1] - nd + 1, size, v);</span>
<a name="554"><span class="lineNum"> 554 </span><span class="lineCov"> 901 : }</span></a>
<span class="lineNum"> 555 </span> :
<span class="lineNum"> 556 </span><span class="lineCov"> 213294 : void raid_data(int nr, int *id, int *ip, int nd, size_t size, void **v)</span>
<span class="lineNum"> 556 </span><span class="lineCov"> 217819 : void raid_data(int nr, int *id, int *ip, int nd, size_t size, void **v)</span>
<span class="lineNum"> 557 </span> : {
<span class="lineNum"> 558 </span> : /* enforce limit on size */
<span class="lineNum"> 559 </span><span class="lineCov"> 213294 : BUG_ON(size % 64 != 0);</span>
<span class="lineNum"> 559 </span><span class="lineCov"> 217819 : BUG_ON(size % 64 != 0);</span>
<span class="lineNum"> 560 </span> :
<span class="lineNum"> 561 </span> : /* enforce limit on number of failures */
<span class="lineNum"> 562 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt; nd);</span>
<span class="lineNum"> 563 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt; RAID_PARITY_MAX);</span>
<span class="lineNum"> 562 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt; nd);</span>
<span class="lineNum"> 563 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt; RAID_PARITY_MAX);</span>
<span class="lineNum"> 564 </span> :
<span class="lineNum"> 565 </span> : /* enforce order in index vector for data */
<span class="lineNum"> 566 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 2 &amp;&amp; id[0] &gt;= id[1]);</span>
<span class="lineNum"> 567 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 3 &amp;&amp; id[1] &gt;= id[2]);</span>
<span class="lineNum"> 568 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 4 &amp;&amp; id[2] &gt;= id[3]);</span>
<span class="lineNum"> 569 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 5 &amp;&amp; id[3] &gt;= id[4]);</span>
<span class="lineNum"> 570 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 6 &amp;&amp; id[4] &gt;= id[5]);</span>
<span class="lineNum"> 566 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 2 &amp;&amp; id[0] &gt;= id[1]);</span>
<span class="lineNum"> 567 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 3 &amp;&amp; id[1] &gt;= id[2]);</span>
<span class="lineNum"> 568 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 4 &amp;&amp; id[2] &gt;= id[3]);</span>
<span class="lineNum"> 569 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 5 &amp;&amp; id[3] &gt;= id[4]);</span>
<span class="lineNum"> 570 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 6 &amp;&amp; id[4] &gt;= id[5]);</span>
<span class="lineNum"> 571 </span> :
<span class="lineNum"> 572 </span> : /* enforce limit on index vector for data */
<span class="lineNum"> 573 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt; 0 &amp;&amp; id[nr-1] &gt;= nd);</span>
<span class="lineNum"> 573 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt; 0 &amp;&amp; id[nr-1] &gt;= nd);</span>
<span class="lineNum"> 574 </span> :
<span class="lineNum"> 575 </span> : /* enforce order in index vector for parity */
<span class="lineNum"> 576 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 2 &amp;&amp; ip[0] &gt;= ip[1]);</span>
<span class="lineNum"> 577 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 3 &amp;&amp; ip[1] &gt;= ip[2]);</span>
<span class="lineNum"> 578 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 4 &amp;&amp; ip[2] &gt;= ip[3]);</span>
<span class="lineNum"> 579 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 5 &amp;&amp; ip[3] &gt;= ip[4]);</span>
<span class="lineNum"> 580 </span><span class="lineCov"> 213294 : BUG_ON(nr &gt;= 6 &amp;&amp; ip[4] &gt;= ip[5]);</span>
<span class="lineNum"> 576 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 2 &amp;&amp; ip[0] &gt;= ip[1]);</span>
<span class="lineNum"> 577 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 3 &amp;&amp; ip[1] &gt;= ip[2]);</span>
<span class="lineNum"> 578 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 4 &amp;&amp; ip[2] &gt;= ip[3]);</span>
<span class="lineNum"> 579 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 5 &amp;&amp; ip[3] &gt;= ip[4]);</span>
<span class="lineNum"> 580 </span><span class="lineCov"> 217819 : BUG_ON(nr &gt;= 6 &amp;&amp; ip[4] &gt;= ip[5]);</span>
<span class="lineNum"> 581 </span> :
<span class="lineNum"> 582 </span> : /* if failed data is present */
<span class="lineNum"> 583 </span><span class="lineCov"> 213294 : if (nr != 0)</span>
<span class="lineNum"> 584 </span><span class="lineCov"> 213292 : raid_rec_ptr[nr - 1](nr, id, ip, nd, size, v);</span>
<span class="lineNum"> 585 </span><span class="lineCov"> 213294 : }</span>
<span class="lineNum"> 583 </span><span class="lineCov"> 217819 : if (nr != 0)</span>
<span class="lineNum"> 584 </span><span class="lineCov"> 217817 : raid_rec_ptr[nr - 1](nr, id, ip, nd, size, v);</span>
<span class="lineNum"> 585 </span><span class="lineCov"> 217819 : }</span>
<span class="lineNum"> 586 </span> :
</pre>
</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">11</td>
@ -78,7 +78,7 @@
<span class="lineNum"> 16 </span> :
<span class="lineNum"> 17 </span> : static struct raid_func {
<span class="lineNum"> 18 </span> : const char *name;
<span class="lineNum"> 19 </span> : void *p;
<span class="lineNum"> 19 </span> : void (*p)();
<span class="lineNum"> 20 </span> : } RAID_FUNC[] = {
<span class="lineNum"> 21 </span> : { &quot;int8&quot;, raid_gen3_int8 },
<span class="lineNum"> 22 </span> : { &quot;int8&quot;, raid_gen4_int8 },
@ -140,7 +140,7 @@
<span class="lineNum"> 78 </span> : { 0, 0 }
<a name="79"><span class="lineNum"> 79 </span> : };</a>
<span class="lineNum"> 80 </span> :
<span class="lineNum"> 81 </span><span class="lineCov"> 52 : static const char *raid_tag(void *func)</span>
<span class="lineNum"> 81 </span><span class="lineCov"> 52 : static const char *raid_tag(void (*func)())</span>
<span class="lineNum"> 82 </span> : {
<span class="lineNum"> 83 </span><span class="lineCov"> 52 : struct raid_func *i = RAID_FUNC;</span>
<span class="lineNum"> 84 </span> :

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">7</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">7</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">7</td>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">14</td>
@ -60,59 +60,59 @@
<td width="20%" class="tableHead">Hit count <span class="tableHeadSort"><img src="../glass.png" width=10 height=14 alt="Sort by hit count" title="Sort by hit count" border=0></span></td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#1520">raid_gen6_ssse3</a></td>
<td class="coverFnHi">533272</td>
<td class="coverFn"><a href="x86.c.gcov.html#1530">raid_gen6_ssse3</a></td>
<td class="coverFnHi">549547</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#112">raid_gen2_sse2</a></td>
<td class="coverFnHi">276362</td>
<td class="coverFn"><a href="x86.c.gcov.html#122">raid_gen2_sse2</a></td>
<td class="coverFnHi">276700</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#24">raid_gen1_sse2</a></td>
<td class="coverFnHi">273722</td>
<td class="coverFn"><a href="x86.c.gcov.html#34">raid_gen1_sse2</a></td>
<td class="coverFnHi">272945</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#1975">raid_rec1_ssse3</a></td>
<td class="coverFnHi">110047</td>
<td class="coverFn"><a href="x86.c.gcov.html#1985">raid_rec1_ssse3</a></td>
<td class="coverFnHi">114194</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2140">raid_recX_ssse3</a></td>
<td class="coverFnHi">79300</td>
<td class="coverFn"><a href="x86.c.gcov.html#2150">raid_recX_ssse3</a></td>
<td class="coverFnHi">79298</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#1120">raid_gen5_ssse3</a></td>
<td class="coverFnHi">50252</td>
<td class="coverFn"><a href="x86.c.gcov.html#1130">raid_gen5_ssse3</a></td>
<td class="coverFnHi">50257</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2034">raid_rec2_ssse3</a></td>
<td class="coverFnHi">44029</td>
<td class="coverFn"><a href="x86.c.gcov.html#2044">raid_rec2_ssse3</a></td>
<td class="coverFnHi">44409</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#670">raid_gen4_ssse3</a></td>
<td class="coverFnHi">32625</td>
<td class="coverFn"><a href="x86.c.gcov.html#680">raid_gen4_ssse3</a></td>
<td class="coverFnHi">32611</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#299">raid_gen3_ssse3</a></td>
<td class="coverFnHi">29442</td>
<td class="coverFn"><a href="x86.c.gcov.html#309">raid_gen3_ssse3</a></td>
<td class="coverFnHi">29450</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2370">raid_recX_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#2380">raid_recX_avx2</a></td>
<td class="coverFnHi">17765</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2272">raid_rec2_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#2282">raid_rec2_avx2</a></td>
<td class="coverFnHi">1206</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#166">raid_gen2_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#176">raid_gen2_avx2</a></td>
<td class="coverFnHi">510</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2216">raid_rec1_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#2226">raid_rec1_avx2</a></td>
<td class="coverFnHi">126</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#65">raid_gen1_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#75">raid_gen1_avx2</a></td>
<td class="coverFnHi">98</td>
</tr>
</table>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">14</td>
@ -60,60 +60,60 @@
<td width="20%" class="tableHead">Hit count <span class="tableHeadSort"><a href="x86.c.func-sort-c.html"><img src="../updown.png" width=10 height=14 alt="Sort by hit count" title="Sort by hit count" border=0></a></span></td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#65">raid_gen1_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#75">raid_gen1_avx2</a></td>
<td class="coverFnHi">98</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#24">raid_gen1_sse2</a></td>
<td class="coverFnHi">273722</td>
<td class="coverFn"><a href="x86.c.gcov.html#34">raid_gen1_sse2</a></td>
<td class="coverFnHi">272945</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#166">raid_gen2_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#176">raid_gen2_avx2</a></td>
<td class="coverFnHi">510</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#112">raid_gen2_sse2</a></td>
<td class="coverFnHi">276362</td>
<td class="coverFn"><a href="x86.c.gcov.html#122">raid_gen2_sse2</a></td>
<td class="coverFnHi">276700</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#299">raid_gen3_ssse3</a></td>
<td class="coverFnHi">29442</td>
<td class="coverFn"><a href="x86.c.gcov.html#309">raid_gen3_ssse3</a></td>
<td class="coverFnHi">29450</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#670">raid_gen4_ssse3</a></td>
<td class="coverFnHi">32625</td>
<td class="coverFn"><a href="x86.c.gcov.html#680">raid_gen4_ssse3</a></td>
<td class="coverFnHi">32611</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#1120">raid_gen5_ssse3</a></td>
<td class="coverFnHi">50252</td>
<td class="coverFn"><a href="x86.c.gcov.html#1130">raid_gen5_ssse3</a></td>
<td class="coverFnHi">50257</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#1520">raid_gen6_ssse3</a></td>
<td class="coverFnHi">533272</td>
<td class="coverFn"><a href="x86.c.gcov.html#1530">raid_gen6_ssse3</a></td>
<td class="coverFnHi">549547</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2216">raid_rec1_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#2226">raid_rec1_avx2</a></td>
<td class="coverFnHi">126</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#1975">raid_rec1_ssse3</a></td>
<td class="coverFnHi">110047</td>
<td class="coverFn"><a href="x86.c.gcov.html#1985">raid_rec1_ssse3</a></td>
<td class="coverFnHi">114194</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2272">raid_rec2_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#2282">raid_rec2_avx2</a></td>
<td class="coverFnHi">1206</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2034">raid_rec2_ssse3</a></td>
<td class="coverFnHi">44029</td>
<td class="coverFn"><a href="x86.c.gcov.html#2044">raid_rec2_ssse3</a></td>
<td class="coverFnHi">44409</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2370">raid_recX_avx2</a></td>
<td class="coverFn"><a href="x86.c.gcov.html#2380">raid_recX_avx2</a></td>
<td class="coverFnHi">17765</td>
</tr>
<tr>
<td class="coverFn"><a href="x86.c.gcov.html#2140">raid_recX_ssse3</a></td>
<td class="coverFnHi">79300</td>
<td class="coverFn"><a href="x86.c.gcov.html#2150">raid_recX_ssse3</a></td>
<td class="coverFnHi">79298</td>
</tr>
</table>
<br>

File diff suppressed because it is too large Load diff

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">1</td>
@ -61,7 +61,7 @@
</tr>
<tr>
<td class="coverFn"><a href="x86z.c.gcov.html#41">raid_genz_sse2</a></td>
<td class="coverFnHi">1175</td>
<td class="coverFnHi">1177</td>
</tr>
</table>
<br>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">1</td>
@ -61,7 +61,7 @@
</tr>
<tr>
<td class="coverFn"><a href="x86z.c.gcov.html#41">raid_genz_sse2</a></td>
<td class="coverFnHi">1175</td>
<td class="coverFnHi">1177</td>
</tr>
</table>
<br>

View file

@ -37,7 +37,7 @@
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td class="headerValue">2015-11-13</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">1</td>
@ -102,58 +102,58 @@
<span class="lineNum"> 40 </span> : /*
<a name="41"><span class="lineNum"> 41 </span> : * GENz (triple parity with powers of 2^-1) SSE2 implementation</a>
<span class="lineNum"> 42 </span> : */
<span class="lineNum"> 43 </span><span class="lineCov"> 1175 : void raid_genz_sse2(int nd, size_t size, void **vv)</span>
<span class="lineNum"> 43 </span><span class="lineCov"> 1177 : void raid_genz_sse2(int nd, size_t size, void **vv)</span>
<span class="lineNum"> 44 </span> : {
<span class="lineNum"> 45 </span><span class="lineCov"> 1175 : uint8_t **v = (uint8_t**)vv;</span>
<span class="lineNum"> 45 </span><span class="lineCov"> 1177 : uint8_t **v = (uint8_t**)vv;</span>
<span class="lineNum"> 46 </span> : uint8_t *p;
<span class="lineNum"> 47 </span> : uint8_t *q;
<span class="lineNum"> 48 </span> : uint8_t *r;
<span class="lineNum"> 49 </span> : int d, l;
<span class="lineNum"> 50 </span> : size_t i;
<span class="lineNum"> 51 </span> :
<span class="lineNum"> 52 </span><span class="lineCov"> 1175 : l = nd - 1;</span>
<span class="lineNum"> 53 </span><span class="lineCov"> 1175 : p = v[nd];</span>
<span class="lineNum"> 54 </span><span class="lineCov"> 1175 : q = v[nd + 1];</span>
<span class="lineNum"> 55 </span><span class="lineCov"> 1175 : r = v[nd + 2];</span>
<span class="lineNum"> 52 </span><span class="lineCov"> 1177 : l = nd - 1;</span>
<span class="lineNum"> 53 </span><span class="lineCov"> 1177 : p = v[nd];</span>
<span class="lineNum"> 54 </span><span class="lineCov"> 1177 : q = v[nd + 1];</span>
<span class="lineNum"> 55 </span><span class="lineCov"> 1177 : r = v[nd + 2];</span>
<span class="lineNum"> 56 </span> :
<span class="lineNum"> 57 </span> : raid_sse_begin();
<span class="lineNum"> 58 </span> :
<span class="lineNum"> 59 </span><span class="lineCov"> 1175 : asm volatile (&quot;movdqa %0,%%xmm7&quot; : : &quot;m&quot; (gfzconst16.poly[0]));</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 1175 : asm volatile (&quot;movdqa %0,%%xmm3&quot; : : &quot;m&quot; (gfzconst16.half[0]));</span>
<span class="lineNum"> 61 </span><span class="lineCov"> 1175 : asm volatile (&quot;movdqa %0,%%xmm6&quot; : : &quot;m&quot; (gfzconst16.low7[0]));</span>
<span class="lineNum"> 59 </span><span class="lineCov"> 1177 : asm volatile (&quot;movdqa %0,%%xmm7&quot; : : &quot;m&quot; (gfzconst16.poly[0]));</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 1177 : asm volatile (&quot;movdqa %0,%%xmm3&quot; : : &quot;m&quot; (gfzconst16.half[0]));</span>
<span class="lineNum"> 61 </span><span class="lineCov"> 1177 : asm volatile (&quot;movdqa %0,%%xmm6&quot; : : &quot;m&quot; (gfzconst16.low7[0]));</span>
<span class="lineNum"> 62 </span> :
<span class="lineNum"> 63 </span><span class="lineCov"> 1362151 : for (i = 0; i &lt; size; i += 16) {</span>
<span class="lineNum"> 64 </span><span class="lineCov"> 1360976 : asm volatile (&quot;movdqa %0,%%xmm0&quot; : : &quot;m&quot; (v[l][i]));</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 1360976 : asm volatile (&quot;movdqa %xmm0,%xmm1&quot;);</span>
<span class="lineNum"> 66 </span><span class="lineCov"> 1360976 : asm volatile (&quot;movdqa %xmm0,%xmm2&quot;);</span>
<span class="lineNum"> 67 </span><span class="lineCov"> 10958080 : for (d = l - 1; d &gt;= 0; --d) {</span>
<span class="lineNum"> 68 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pxor %xmm4,%xmm4&quot;);</span>
<span class="lineNum"> 69 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pcmpgtb %xmm1,%xmm4&quot;);</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 9597104 : asm volatile (&quot;paddb %xmm1,%xmm1&quot;);</span>
<span class="lineNum"> 71 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pand %xmm7,%xmm4&quot;);</span>
<span class="lineNum"> 72 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pxor %xmm4,%xmm1&quot;);</span>
<span class="lineNum"> 63 </span><span class="lineCov"> 1394921 : for (i = 0; i &lt; size; i += 16) {</span>
<span class="lineNum"> 64 </span><span class="lineCov"> 1393744 : asm volatile (&quot;movdqa %0,%%xmm0&quot; : : &quot;m&quot; (v[l][i]));</span>
<span class="lineNum"> 65 </span><span class="lineCov"> 1393744 : asm volatile (&quot;movdqa %xmm0,%xmm1&quot;);</span>
<span class="lineNum"> 66 </span><span class="lineCov"> 1393744 : asm volatile (&quot;movdqa %xmm0,%xmm2&quot;);</span>
<span class="lineNum"> 67 </span><span class="lineCov"> 11220224 : for (d = l - 1; d &gt;= 0; --d) {</span>
<span class="lineNum"> 68 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pxor %xmm4,%xmm4&quot;);</span>
<span class="lineNum"> 69 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pcmpgtb %xmm1,%xmm4&quot;);</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 9826480 : asm volatile (&quot;paddb %xmm1,%xmm1&quot;);</span>
<span class="lineNum"> 71 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pand %xmm7,%xmm4&quot;);</span>
<span class="lineNum"> 72 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pxor %xmm4,%xmm1&quot;);</span>
<span class="lineNum"> 73 </span> :
<span class="lineNum"> 74 </span><span class="lineCov"> 9597104 : asm volatile (&quot;movdqa %xmm2,%xmm4&quot;);</span>
<span class="lineNum"> 75 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pxor %xmm5,%xmm5&quot;);</span>
<span class="lineNum"> 76 </span><span class="lineCov"> 9597104 : asm volatile (&quot;psllw $7,%xmm4&quot;);</span>
<span class="lineNum"> 77 </span><span class="lineCov"> 9597104 : asm volatile (&quot;psrlw $1,%xmm2&quot;);</span>
<span class="lineNum"> 78 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pcmpgtb %xmm4,%xmm5&quot;);</span>
<span class="lineNum"> 79 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pand %xmm6,%xmm2&quot;);</span>
<span class="lineNum"> 80 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pand %xmm3,%xmm5&quot;);</span>
<span class="lineNum"> 81 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pxor %xmm5,%xmm2&quot;);</span>
<span class="lineNum"> 74 </span><span class="lineCov"> 9826480 : asm volatile (&quot;movdqa %xmm2,%xmm4&quot;);</span>
<span class="lineNum"> 75 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pxor %xmm5,%xmm5&quot;);</span>
<span class="lineNum"> 76 </span><span class="lineCov"> 9826480 : asm volatile (&quot;psllw $7,%xmm4&quot;);</span>
<span class="lineNum"> 77 </span><span class="lineCov"> 9826480 : asm volatile (&quot;psrlw $1,%xmm2&quot;);</span>
<span class="lineNum"> 78 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pcmpgtb %xmm4,%xmm5&quot;);</span>
<span class="lineNum"> 79 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pand %xmm6,%xmm2&quot;);</span>
<span class="lineNum"> 80 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pand %xmm3,%xmm5&quot;);</span>
<span class="lineNum"> 81 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pxor %xmm5,%xmm2&quot;);</span>
<span class="lineNum"> 82 </span> :
<span class="lineNum"> 83 </span><span class="lineCov"> 9597104 : asm volatile (&quot;movdqa %0,%%xmm4&quot; : : &quot;m&quot; (v[d][i]));</span>
<span class="lineNum"> 84 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pxor %xmm4,%xmm0&quot;);</span>
<span class="lineNum"> 85 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pxor %xmm4,%xmm1&quot;);</span>
<span class="lineNum"> 86 </span><span class="lineCov"> 9597104 : asm volatile (&quot;pxor %xmm4,%xmm2&quot;);</span>
<span class="lineNum"> 83 </span><span class="lineCov"> 9826480 : asm volatile (&quot;movdqa %0,%%xmm4&quot; : : &quot;m&quot; (v[d][i]));</span>
<span class="lineNum"> 84 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pxor %xmm4,%xmm0&quot;);</span>
<span class="lineNum"> 85 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pxor %xmm4,%xmm1&quot;);</span>
<span class="lineNum"> 86 </span><span class="lineCov"> 9826480 : asm volatile (&quot;pxor %xmm4,%xmm2&quot;);</span>
<span class="lineNum"> 87 </span> : }
<span class="lineNum"> 88 </span><span class="lineCov"> 1360976 : asm volatile (&quot;movntdq %%xmm0,%0&quot; : &quot;=m&quot; (p[i]));</span>
<span class="lineNum"> 89 </span><span class="lineCov"> 1360976 : asm volatile (&quot;movntdq %%xmm1,%0&quot; : &quot;=m&quot; (q[i]));</span>
<span class="lineNum"> 90 </span><span class="lineCov"> 1360976 : asm volatile (&quot;movntdq %%xmm2,%0&quot; : &quot;=m&quot; (r[i]));</span>
<span class="lineNum"> 88 </span><span class="lineCov"> 1393744 : asm volatile (&quot;movntdq %%xmm0,%0&quot; : &quot;=m&quot; (p[i]));</span>
<span class="lineNum"> 89 </span><span class="lineCov"> 1393744 : asm volatile (&quot;movntdq %%xmm1,%0&quot; : &quot;=m&quot; (q[i]));</span>
<span class="lineNum"> 90 </span><span class="lineCov"> 1393744 : asm volatile (&quot;movntdq %%xmm2,%0&quot; : &quot;=m&quot; (r[i]));</span>
<span class="lineNum"> 91 </span> : }
<span class="lineNum"> 92 </span> :
<span class="lineNum"> 93 </span> : raid_sse_end();
<span class="lineNum"> 94 </span><span class="lineCov"> 1175 : }</span>
<span class="lineNum"> 94 </span><span class="lineCov"> 1177 : }</span>
<span class="lineNum"> 95 </span> : #endif
<span class="lineNum"> 96 </span> :
<span class="lineNum"> 97 </span> : #if defined(CONFIG_X86_64) &amp;&amp; defined(CONFIG_SSE2)