mirror of
https://github.com/seigler/dash-docs
synced 2025-07-27 09:46:12 +00:00
115 lines
26 KiB
HTML
115 lines
26 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.14"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Dash Core: src/secp256k1/contrib/lax_der_parsing.c 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>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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 style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="bitcoin_logo_doxygen.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Dash Core
|
|
 <span id="projectnumber">0.12.2.1</span>
|
|
</div>
|
|
<div id="projectbrief">P2P Digital Currency</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.14 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</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">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('lax__der__parsing_8c_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<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">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">lax_der_parsing.c</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="lax__der__parsing_8c.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/**********************************************************************</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2015 Pieter Wuille *</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * Distributed under the MIT software license, see the accompanying *</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * file COPYING or http://www.opensource.org/licenses/mit-license.php.*</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> **********************************************************************/</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include <string.h></span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include <<a class="code" href="secp256k1_8h.html">secp256k1.h</a>></span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "<a class="code" href="lax__der__parsing_8h.html">lax_der_parsing.h</a>"</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div><div class="line"><a name="l00012"></a><span class="lineno"><a class="line" href="lax__der__parsing_8h.html#a8c6e1225540c46bf7080cabde2c4e691"> 12</a></span> <span class="keywordtype">int</span> <a class="code" href="lax__der__parsing_8c.html#aebc754e4d7457c16a922ea14977974a4">ecdsa_signature_parse_der_lax</a>(<span class="keyword">const</span> <a class="code" href="structsecp256k1__context__struct.html">secp256k1_context</a>* <a class="code" href="tests_8c.html#a06a3e29ada83211a695a49e8f7405842">ctx</a>, <a class="code" href="structsecp256k1__ecdsa__signature.html">secp256k1_ecdsa_signature</a>* sig, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *input, <span class="keywordtype">size_t</span> inputlen) {</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  <span class="keywordtype">size_t</span> rpos, rlen, spos, slen;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>  <span class="keywordtype">size_t</span> pos = 0;</div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  <span class="keywordtype">size_t</span> lenbyte;</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> tmpsig[64] = {0};</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  <span class="keywordtype">int</span> overflow = 0;</div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  <span class="comment">/* Hack to initialize sig with a correctly-parsed but invalid signature. */</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <a class="code" href="secp256k1_8h.html#a2aff2802eca3d15ec54298e879579897">secp256k1_ecdsa_signature_parse_compact</a>(<a class="code" href="tests_8c.html#a06a3e29ada83211a695a49e8f7405842">ctx</a>, sig, tmpsig);</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <span class="comment">/* Sequence tag byte */</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordflow">if</span> (pos == inputlen || input[pos] != 0x30) {</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  }</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  pos++;</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="comment">/* Sequence length bytes */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">if</span> (pos == inputlen) {</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  }</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  lenbyte = input[pos++];</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">if</span> (lenbyte & 0x80) {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  lenbyte -= 0x80;</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">if</span> (pos + lenbyte > inputlen) {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  }</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  pos += lenbyte;</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  }</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">/* Integer tag byte for R */</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">if</span> (pos == inputlen || input[pos] != 0x02) {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  }</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  pos++;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">/* Integer length for R */</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">if</span> (pos == inputlen) {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  lenbyte = input[pos++];</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (lenbyte & 0x80) {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  lenbyte -= 0x80;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">if</span> (pos + lenbyte > inputlen) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">while</span> (lenbyte > 0 && input[pos] == 0) {</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  pos++;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  lenbyte--;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (lenbyte >= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)) {</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  rlen = 0;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">while</span> (lenbyte > 0) {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  rlen = (rlen << 8) + input[pos];</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  pos++;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  lenbyte--;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  rlen = lenbyte;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (rlen > inputlen - pos) {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  rpos = pos;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  pos += rlen;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">/* Integer tag byte for S */</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (pos == inputlen || input[pos] != 0x02) {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  pos++;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">/* Integer length for S */</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> (pos == inputlen) {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  lenbyte = input[pos++];</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (lenbyte & 0x80) {</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  lenbyte -= 0x80;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">if</span> (pos + lenbyte > inputlen) {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">while</span> (lenbyte > 0 && input[pos] == 0) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  pos++;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  lenbyte--;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (lenbyte >= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  slen = 0;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">while</span> (lenbyte > 0) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  slen = (slen << 8) + input[pos];</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  pos++;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  lenbyte--;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  slen = lenbyte;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (slen > inputlen - pos) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  spos = pos;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  pos += slen;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">/* Ignore leading zeroes in R */</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">while</span> (rlen > 0 && input[rpos] == 0) {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  rlen--;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  rpos++;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">/* Copy R value */</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span> (rlen > 32) {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  overflow = 1;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="glibc__compat_8cpp.html#a0f46826ab0466591e136db24394923cf">memcpy</a>(tmpsig + 32 - rlen, input + rpos, rlen);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">/* Ignore leading zeroes in S */</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">while</span> (slen > 0 && input[spos] == 0) {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  slen--;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  spos++;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">/* Copy S value */</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (slen > 32) {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  overflow = 1;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="glibc__compat_8cpp.html#a0f46826ab0466591e136db24394923cf">memcpy</a>(tmpsig + 64 - slen, input + spos, slen);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (!overflow) {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  overflow = !<a class="code" href="secp256k1_8h.html#a2aff2802eca3d15ec54298e879579897">secp256k1_ecdsa_signature_parse_compact</a>(<a class="code" href="tests_8c.html#a06a3e29ada83211a695a49e8f7405842">ctx</a>, sig, tmpsig);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">if</span> (overflow) {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  memset(tmpsig, 0, 64);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="secp256k1_8h.html#a2aff2802eca3d15ec54298e879579897">secp256k1_ecdsa_signature_parse_compact</a>(<a class="code" href="tests_8c.html#a06a3e29ada83211a695a49e8f7405842">ctx</a>, sig, tmpsig);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="ttc" id="structsecp256k1__context__struct_html"><div class="ttname"><a href="structsecp256k1__context__struct.html">secp256k1_context_struct</a></div><div class="ttdef"><b>Definition:</b> <a href="secp256k1_8c_source.html#l00053">secp256k1.c:53</a></div></div>
|
|
<div class="ttc" id="lax__der__parsing_8h_html"><div class="ttname"><a href="lax__der__parsing_8h.html">lax_der_parsing.h</a></div></div>
|
|
<div class="ttc" id="tests_8c_html_a06a3e29ada83211a695a49e8f7405842"><div class="ttname"><a href="tests_8c.html#a06a3e29ada83211a695a49e8f7405842">ctx</a></div><div class="ttdeci">static secp256k1_context * ctx</div><div class="ttdef"><b>Definition:</b> <a href="tests_8c_source.html#l00042">tests.c:42</a></div></div>
|
|
<div class="ttc" id="lax__der__parsing_8c_html_aebc754e4d7457c16a922ea14977974a4"><div class="ttname"><a href="lax__der__parsing_8c.html#aebc754e4d7457c16a922ea14977974a4">ecdsa_signature_parse_der_lax</a></div><div class="ttdeci">int ecdsa_signature_parse_der_lax(const secp256k1_context *ctx, secp256k1_ecdsa_signature *sig, const unsigned char *input, size_t inputlen)</div><div class="ttdef"><b>Definition:</b> <a href="lax__der__parsing_8c_source.html#l00012">lax_der_parsing.c:12</a></div></div>
|
|
<div class="ttc" id="structsecp256k1__ecdsa__signature_html"><div class="ttname"><a href="structsecp256k1__ecdsa__signature.html">secp256k1_ecdsa_signature</a></div><div class="ttdef"><b>Definition:</b> <a href="secp256k1_8h_source.html#l00072">secp256k1.h:72</a></div></div>
|
|
<div class="ttc" id="secp256k1_8h_html"><div class="ttname"><a href="secp256k1_8h.html">secp256k1.h</a></div></div>
|
|
<div class="ttc" id="secp256k1_8h_html_a2aff2802eca3d15ec54298e879579897"><div class="ttname"><a href="secp256k1_8h.html#a2aff2802eca3d15ec54298e879579897">secp256k1_ecdsa_signature_parse_compact</a></div><div class="ttdeci">SECP256K1_API int secp256k1_ecdsa_signature_parse_compact(const secp256k1_context *ctx, secp256k1_ecdsa_signature *sig, const unsigned char *input64) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3)</div><div class="ttdef"><b>Definition:</b> <a href="secp256k1_8c_source.html#l00232">secp256k1.c:232</a></div></div>
|
|
<div class="ttc" id="glibc__compat_8cpp_html_a0f46826ab0466591e136db24394923cf"><div class="ttname"><a href="glibc__compat_8cpp.html#a0f46826ab0466591e136db24394923cf">memcpy</a></div><div class="ttdeci">void * memcpy(void *a, const void *b, size_t c)</div><div class="ttdef"><b>Definition:</b> <a href="glibc__compat_8cpp_source.html#l00017">glibc_compat.cpp:17</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_44f34d1e62fda08bdb4ca69ab2d205ae.html">secp256k1</a></li><li class="navelem"><a class="el" href="dir_b0f147e0d78dd6f743f7b009c9930b03.html">contrib</a></li><li class="navelem"><a class="el" href="lax__der__parsing_8c.html">lax_der_parsing.c</a></li>
|
|
<li class="footer">Generated on Thu Dec 14 2017 13:15:08 for Dash Core by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|