aaru-dps/libaaruformat
1
0
Fork 0
mirror of https://github.com/aaru-dps/libaaruformat.git synced 2026-07-09 10:26:23 +00:00
Code Issues 3 Packages Projects Releases Wiki Activity
Files
devel
libaaruformat/docs/html/gf256_8h_source.html

147 lines
12 KiB
HTML
Raw Permalink Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.16.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libaaruformat: src/lib/gf256.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">libaaruformat<span id="projectnumber">&#160;1.0</span>
</div>
<div id="projectbrief">Aaru Data Preservation Suite - Format Library</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.16.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('gf256_8h_source.html','',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">gf256.h</div></div>
</div><!--header-->
<div class="contents">
<a href="gf256_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">/*</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment"> * This file is part of the Aaru Data Preservation Suite.</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment"> * Copyright (c) 2019-2026 Natalia Portillo.</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment"> *</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment"> * This library is free software; you can redistribute it and/or modify</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment"> * it under the terms of the GNU Lesser General Public License as</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment"> * published by the Free Software Foundation; either version 2.1 of the</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment"> * License, or (at your option) any later version.</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment"> *</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment"> * This library is distributed in the hope that it will be useful, but</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment"> * WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment"> * Lesser General Public License for more details.</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment"> *</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment"> * You should have received a copy of the GNU Lesser General Public</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment"> * License along with this library; if not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment"> */</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#ifndef LIBAARUFORMAT_GF256_H</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#define LIBAARUFORMAT_GF256_H</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include &lt;stddef.h&gt;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span>uint8_t <a class="code hl_function" href="gf256_8h.html#af1afff8141cfc915bb37fc01dab39995">gf256_mul</a>(uint8_t a, uint8_t b);</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span>uint8_t <a class="code hl_function" href="gf256_8h.html#a1f0071a2ea261bdd2a59cc757a3ce13c">gf256_div</a>(uint8_t a, uint8_t b);</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span>uint8_t <a class="code hl_function" href="gf256_8h.html#a43b3c7a9e2c10d25670fd961ae2916ca">gf256_inv</a>(uint8_t a);</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="keywordtype">void</span> <a class="code hl_function" href="gf256_8h.html#ad9ea1dd38b7a45e2c9f967c26d7b05df">gf256_mul_region</a>(uint8_t *dst, <span class="keyword">const</span> uint8_t *src, uint8_t coeff, <span class="keywordtype">size_t</span> len);</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="keywordtype">void</span> <a class="code hl_function" href="gf256_8h.html#a2e7b136d97e3214ff718f46542e276da">gf256_xor_region</a>(uint8_t *dst, <span class="keyword">const</span> uint8_t *src, <span class="keywordtype">size_t</span> len);</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="preprocessor">#endif </span><span class="comment">/* LIBAARUFORMAT_GF256_H */</span><span class="preprocessor"></span></div>
<div class="ttc" id="agf256_8h_html_a1f0071a2ea261bdd2a59cc757a3ce13c"><div class="ttname"><a href="gf256_8h.html#a1f0071a2ea261bdd2a59cc757a3ce13c">gf256_div</a></div><div class="ttdeci">uint8_t gf256_div(uint8_t a, uint8_t b)</div><div class="ttdoc">Divide two elements in GF(2^8).</div><div class="ttdef"><b>Definition</b> <a href="gf256_8c_source.html#l00084">gf256.c:84</a></div></div>
<div class="ttc" id="agf256_8h_html_a2e7b136d97e3214ff718f46542e276da"><div class="ttname"><a href="gf256_8h.html#a2e7b136d97e3214ff718f46542e276da">gf256_xor_region</a></div><div class="ttdeci">void gf256_xor_region(uint8_t *dst, const uint8_t *src, size_t len)</div><div class="ttdoc">XOR a region: dst[i] ^= src[i] for all i.</div><div class="ttdef"><b>Definition</b> <a href="gf256_8c_source.html#l00344">gf256.c:344</a></div></div>
<div class="ttc" id="agf256_8h_html_a43b3c7a9e2c10d25670fd961ae2916ca"><div class="ttname"><a href="gf256_8h.html#a43b3c7a9e2c10d25670fd961ae2916ca">gf256_inv</a></div><div class="ttdeci">uint8_t gf256_inv(uint8_t a)</div><div class="ttdoc">Compute multiplicative inverse in GF(2^8).</div><div class="ttdef"><b>Definition</b> <a href="gf256_8c_source.html#l00092">gf256.c:92</a></div></div>
<div class="ttc" id="agf256_8h_html_ad9ea1dd38b7a45e2c9f967c26d7b05df"><div class="ttname"><a href="gf256_8h.html#ad9ea1dd38b7a45e2c9f967c26d7b05df">gf256_mul_region</a></div><div class="ttdeci">void gf256_mul_region(uint8_t *dst, const uint8_t *src, uint8_t coeff, size_t len)</div><div class="ttdoc">Multiply-accumulate a region: dst[i] ^= GF_mul(src[i], coeff) for all i.</div><div class="ttdef"><b>Definition</b> <a href="gf256_8c_source.html#l00324">gf256.c:324</a></div></div>
<div class="ttc" id="agf256_8h_html_af1afff8141cfc915bb37fc01dab39995"><div class="ttname"><a href="gf256_8h.html#af1afff8141cfc915bb37fc01dab39995">gf256_mul</a></div><div class="ttdeci">uint8_t gf256_mul(uint8_t a, uint8_t b)</div><div class="ttdoc">Multiply two elements in GF(2^8) with polynomial 0x11D.</div><div class="ttdef"><b>Definition</b> <a href="gf256_8c_source.html#l00077">gf256.c:77</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a href="dir_c85d3e3c5052e9ad9ce18c6863244a25.html">lib</a></li><li class="navelem"><a href="gf256_8h.html">gf256.h</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.16.1 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink