mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
230 lines
16 KiB
HTML
230 lines
16 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - lcov.info - raid/memory.c</title>
|
|
<link rel="stylesheet" type="text/css" href="../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">raid</a> - memory.c<span style="font-size: 80%;"> (source / <a href="memory.c.func.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="15%"></td>
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">lcov.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntry">53</td>
|
|
<td class="headerCovTableEntry">53</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2016-11-21</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">6</td>
|
|
<td class="headerCovTableEntry">6</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</a>
|
|
<span class="lineNum"> 2 </span> : * Copyright (C) 2013 Andrea Mazzoleni
|
|
<span class="lineNum"> 3 </span> : *
|
|
<span class="lineNum"> 4 </span> : * This program is free software: you can redistribute it and/or modify
|
|
<span class="lineNum"> 5 </span> : * it under the terms of the GNU General Public License as published by
|
|
<span class="lineNum"> 6 </span> : * the Free Software Foundation, either version 2 of the License, or
|
|
<span class="lineNum"> 7 </span> : * (at your option) any later version.
|
|
<span class="lineNum"> 8 </span> : *
|
|
<span class="lineNum"> 9 </span> : * This program is distributed in the hope that it will be useful,
|
|
<span class="lineNum"> 10 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
<span class="lineNum"> 11 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
<span class="lineNum"> 12 </span> : * GNU General Public License for more details.
|
|
<span class="lineNum"> 13 </span> : */
|
|
<span class="lineNum"> 14 </span> :
|
|
<span class="lineNum"> 15 </span> : #include "internal.h"
|
|
<a name="16"><span class="lineNum"> 16 </span> : #include "memory.h"</a>
|
|
<span class="lineNum"> 17 </span> :
|
|
<span class="lineNum"> 18 </span><span class="lineCov"> 12558 : void *raid_malloc_align(size_t size, size_t align_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"> 12558 : ptr = malloc(size + align_size);</span>
|
|
<span class="lineNum"> 24 </span><span class="lineCov"> 12558 : 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"> 12558 : *freeptr = ptr;</span>
|
|
<span class="lineNum"> 31 </span> :
|
|
<span class="lineNum"> 32 </span><span class="lineCov"> 12558 : offset = ((uintptr_t)ptr) % align_size;</span>
|
|
<span class="lineNum"> 33 </span> :
|
|
<span class="lineNum"> 34 </span><span class="lineCov"> 12558 : if (offset != 0)</span>
|
|
<span class="lineNum"> 35 </span><span class="lineCov"> 12172 : ptr += align_size - offset;</span>
|
|
<span class="lineNum"> 36 </span> :
|
|
<span class="lineNum"> 37 </span><span class="lineCov"> 12558 : 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"> 179 : void *raid_malloc(size_t size, void **freeptr)</span>
|
|
<span class="lineNum"> 41 </span> : {
|
|
<span class="lineNum"> 42 </span><span class="lineCov"> 179 : return raid_malloc_align(size, RAID_MALLOC_ALIGN, freeptr);</span>
|
|
<a name="43"><span class="lineNum"> 43 </span> : }</a>
|
|
<span class="lineNum"> 44 </span> :
|
|
<span class="lineNum"> 45 </span><span class="lineCov"> 12372 : void **raid_malloc_vector_align(int nd, int n, size_t size, size_t align_size, size_t displacement_size, void **freeptr)</span>
|
|
<span class="lineNum"> 46 </span> : {
|
|
<span class="lineNum"> 47 </span> : void **v;
|
|
<span class="lineNum"> 48 </span> : unsigned char *va;
|
|
<span class="lineNum"> 49 </span> : int i;
|
|
<span class="lineNum"> 50 </span> :
|
|
<span class="lineNum"> 51 </span><span class="lineCov"> 12372 : BUG_ON(n <= 0 || nd < 0);</span>
|
|
<span class="lineNum"> 52 </span> :
|
|
<span class="lineNum"> 53 </span><span class="lineCov"> 12372 : v = malloc(n * sizeof(void *));</span>
|
|
<span class="lineNum"> 54 </span><span class="lineCov"> 12372 : if (!v) {</span>
|
|
<span class="lineNum"> 55 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 56 </span> : return 0;
|
|
<span class="lineNum"> 57 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 58 </span> : }
|
|
<span class="lineNum"> 59 </span> :
|
|
<span class="lineNum"> 60 </span><span class="lineCov"> 12372 : va = raid_malloc_align(n * (size + displacement_size), align_size, freeptr);</span>
|
|
<span class="lineNum"> 61 </span><span class="lineCov"> 12372 : if (!va) {</span>
|
|
<span class="lineNum"> 62 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 63 </span> : free(v);
|
|
<span class="lineNum"> 64 </span> : return 0;
|
|
<span class="lineNum"> 65 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 66 </span> : }
|
|
<span class="lineNum"> 67 </span> :
|
|
<span class="lineNum"> 68 </span><span class="lineCov"> 166935 : for (i = 0; i < n; ++i) {</span>
|
|
<span class="lineNum"> 69 </span><span class="lineCov"> 154563 : v[i] = va;</span>
|
|
<span class="lineNum"> 70 </span><span class="lineCov"> 154563 : va += size + displacement_size;</span>
|
|
<span class="lineNum"> 71 </span> : }
|
|
<span class="lineNum"> 72 </span> :
|
|
<span class="lineNum"> 73 </span> : /* reverse order of the data blocks */
|
|
<span class="lineNum"> 74 </span> : /* because they are usually accessed from the last one */
|
|
<span class="lineNum"> 75 </span><span class="lineCov"> 49526 : for (i = 0; i < nd / 2; ++i) {</span>
|
|
<span class="lineNum"> 76 </span><span class="lineCov"> 37154 : void *ptr = v[i];</span>
|
|
<span class="lineNum"> 77 </span> :
|
|
<span class="lineNum"> 78 </span><span class="lineCov"> 37154 : v[i] = v[nd - 1 - i];</span>
|
|
<span class="lineNum"> 79 </span><span class="lineCov"> 37154 : v[nd - 1 - i] = ptr;</span>
|
|
<span class="lineNum"> 80 </span> : }
|
|
<span class="lineNum"> 81 </span> :
|
|
<span class="lineNum"> 82 </span><span class="lineCov"> 12372 : return v;</span>
|
|
<a name="83"><span class="lineNum"> 83 </span> : }</a>
|
|
<span class="lineNum"> 84 </span> :
|
|
<span class="lineNum"> 85 </span><span class="lineCov"> 12372 : void **raid_malloc_vector(int nd, int n, size_t size, void **freeptr)</span>
|
|
<span class="lineNum"> 86 </span> : {
|
|
<span class="lineNum"> 87 </span><span class="lineCov"> 12372 : return raid_malloc_vector_align(nd, n, size, RAID_MALLOC_ALIGN, RAID_MALLOC_DISPLACEMENT, freeptr);</span>
|
|
<a name="88"><span class="lineNum"> 88 </span> : }</a>
|
|
<span class="lineNum"> 89 </span> :
|
|
<span class="lineNum"> 90 </span><span class="lineCov"> 5 : void raid_mrand_vector(unsigned seed, int n, size_t size, void **vv)</span>
|
|
<span class="lineNum"> 91 </span> : {
|
|
<span class="lineNum"> 92 </span><span class="lineCov"> 5 : unsigned char **v = (unsigned char **)vv;</span>
|
|
<span class="lineNum"> 93 </span> : int i;
|
|
<span class="lineNum"> 94 </span> : size_t j;
|
|
<span class="lineNum"> 95 </span> :
|
|
<span class="lineNum"> 96 </span><span class="lineCov"> 124 : for (i = 0; i < n; ++i)</span>
|
|
<span class="lineNum"> 97 </span><span class="lineCov"> 30583 : for (j = 0; j < size; ++j) {</span>
|
|
<span class="lineNum"> 98 </span> : /* basic C99/C11 linear congruential generator */
|
|
<span class="lineNum"> 99 </span><span class="lineCov"> 30464 : seed = seed * 1103515245U + 12345U;</span>
|
|
<span class="lineNum"> 100 </span> :
|
|
<span class="lineNum"> 101 </span><span class="lineCov"> 30464 : v[i][j] = seed >> 16;</span>
|
|
<span class="lineNum"> 102 </span> : }
|
|
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 5 : }</span></a>
|
|
<span class="lineNum"> 104 </span> :
|
|
<span class="lineNum"> 105 </span><span class="lineCov"> 3 : int raid_mtest_vector(int n, size_t size, void **vv)</span>
|
|
<span class="lineNum"> 106 </span> : {
|
|
<span class="lineNum"> 107 </span><span class="lineCov"> 3 : unsigned char **v = (unsigned char **)vv;</span>
|
|
<span class="lineNum"> 108 </span> : int i;
|
|
<span class="lineNum"> 109 </span> : size_t j;
|
|
<span class="lineNum"> 110 </span> : unsigned k;
|
|
<span class="lineNum"> 111 </span> : unsigned char d;
|
|
<span class="lineNum"> 112 </span> : unsigned char p;
|
|
<span class="lineNum"> 113 </span> :
|
|
<span class="lineNum"> 114 </span> : /* fill with 0 */
|
|
<span class="lineNum"> 115 </span><span class="lineCov"> 3 : d = 0;</span>
|
|
<span class="lineNum"> 116 </span><span class="lineCov"> 98 : for (i = 0; i < n; ++i)</span>
|
|
<span class="lineNum"> 117 </span><span class="lineCov"> 24415 : for (j = 0; j < size; ++j)</span>
|
|
<span class="lineNum"> 118 </span><span class="lineCov"> 24320 : v[i][j] = d;</span>
|
|
<span class="lineNum"> 119 </span> :
|
|
<span class="lineNum"> 120 </span> : /* test with all the byte patterns */
|
|
<span class="lineNum"> 121 </span><span class="lineCov"> 768 : for (k = 1; k < 256; ++k) {</span>
|
|
<span class="lineNum"> 122 </span><span class="lineCov"> 765 : p = d;</span>
|
|
<span class="lineNum"> 123 </span><span class="lineCov"> 765 : d = k;</span>
|
|
<span class="lineNum"> 124 </span> :
|
|
<span class="lineNum"> 125 </span> : /* forward fill */
|
|
<span class="lineNum"> 126 </span><span class="lineCov"> 24990 : for (i = 0; i < n; ++i) {</span>
|
|
<span class="lineNum"> 127 </span><span class="lineCov"> 6225825 : for (j = 0; j < size; ++j) {</span>
|
|
<span class="lineNum"> 128 </span><span class="lineCov"> 6201600 : if (v[i][j] != p) {</span>
|
|
<span class="lineNum"> 129 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 130 </span> : return -1;
|
|
<span class="lineNum"> 131 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 132 </span> : }
|
|
<span class="lineNum"> 133 </span><span class="lineCov"> 6201600 : v[i][j] = d;</span>
|
|
<span class="lineNum"> 134 </span> : }
|
|
<span class="lineNum"> 135 </span> : }
|
|
<span class="lineNum"> 136 </span> :
|
|
<span class="lineNum"> 137 </span><span class="lineCov"> 765 : p = d;</span>
|
|
<span class="lineNum"> 138 </span><span class="lineCov"> 765 : d = ~p;</span>
|
|
<span class="lineNum"> 139 </span> : /* backward fill with complement */
|
|
<span class="lineNum"> 140 </span><span class="lineCov"> 24990 : for (i = 0; i < n; ++i) {</span>
|
|
<span class="lineNum"> 141 </span><span class="lineCov"> 6225825 : for (j = size; j > 0; --j) {</span>
|
|
<span class="lineNum"> 142 </span><span class="lineCov"> 6201600 : if (v[i][j - 1] != p) {</span>
|
|
<span class="lineNum"> 143 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 144 </span> : return -1;
|
|
<span class="lineNum"> 145 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 146 </span> : }
|
|
<span class="lineNum"> 147 </span><span class="lineCov"> 6201600 : v[i][j - 1] = d;</span>
|
|
<span class="lineNum"> 148 </span> : }
|
|
<span class="lineNum"> 149 </span> : }
|
|
<span class="lineNum"> 150 </span> : }
|
|
<span class="lineNum"> 151 </span> :
|
|
<span class="lineNum"> 152 </span><span class="lineCov"> 3 : return 0;</span>
|
|
<span class="lineNum"> 153 </span> : }
|
|
<span class="lineNum"> 154 </span> :
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.10</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|