Skip to content

Commit

Permalink
Coverage upload
Browse files Browse the repository at this point in the history
  • Loading branch information
CIFuzz committed Jul 23, 2024
1 parent 8ce3be5 commit f853fd7
Show file tree
Hide file tree
Showing 32 changed files with 3,645 additions and 3,645 deletions.
Binary file modified coverage/latest/dumps/app-stellar-fuzz-tx.profdata
View file
Binary file not shown.
Binary file modified coverage/latest/dumps/merged.profdata
View file
Binary file not shown.
24 changes: 12 additions & 12 deletions coverage/latest/logs/app-stellar-fuzz-tx.log
View file
Original file line number Diff line number Diff line change
@@ -1,16 +1,16 @@
INFO: Running with entropic power schedule (0xFF, 100).
INFO: Seed: 3565082366
INFO: Loaded 1 modules (20 inline 8-bit counters): 20 [0x55bbfb224d10, 0x55bbfb224d24),
INFO: Loaded 1 PC tables (20 PCs): 20 [0x55bbfb224d28,0x55bbfb224e68),
MERGE-OUTER: 26083 files, 0 in the initial corpus, 0 processed earlier
INFO: Seed: 4177050639
INFO: Loaded 1 modules (20 inline 8-bit counters): 20 [0x563d6f946d10, 0x563d6f946d24),
INFO: Loaded 1 PC tables (20 PCs): 20 [0x563d6f946d28,0x563d6f946e68),
MERGE-OUTER: 26164 files, 0 in the initial corpus, 0 processed earlier
MERGE-OUTER: attempt 1
INFO: Running with entropic power schedule (0xFF, 100).
INFO: Seed: 3565215867
INFO: Loaded 1 modules (20 inline 8-bit counters): 20 [0x56402f584d10, 0x56402f584d24),
INFO: Loaded 1 PC tables (20 PCs): 20 [0x56402f584d28,0x56402f584e68),
INFO: Seed: 4177184955
INFO: Loaded 1 modules (20 inline 8-bit counters): 20 [0x55704d56cd10, 0x55704d56cd24),
INFO: Loaded 1 PC tables (20 PCs): 20 [0x55704d56cd28,0x55704d56ce68),
INFO: -max_len is not provided; libFuzzer will not generate inputs larger than 1048576 bytes
MERGE-INNER: using the control file '/tmp/libFuzzerTemp.Merge117.txt'
MERGE-INNER: 26083 total files; 0 processed earlier; will process 26083 files now
MERGE-INNER: using the control file '/tmp/libFuzzerTemp.Merge115.txt'
MERGE-INNER: 26164 total files; 0 processed earlier; will process 26164 files now
#1 pulse cov: 3 ft: 3 exec/s: 0 rss: 32Mb
#2 pulse cov: 3 ft: 3 exec/s: 0 rss: 32Mb
#4 pulse cov: 3 ft: 3 exec/s: 0 rss: 32Mb
Expand All @@ -26,8 +26,8 @@ MERGE-INNER: 26083 total files; 0 processed earlier; will process 26083 files no
#4096 pulse cov: 16 ft: 30 exec/s: 0 rss: 32Mb
#8192 pulse cov: 16 ft: 38 exec/s: 0 rss: 32Mb
#16384 pulse cov: 16 ft: 54 exec/s: 0 rss: 32Mb
#26083 DONE cov: 16 ft: 60 exec/s: 8694 rss: 36Mb
#26164 DONE cov: 16 ft: 60 exec/s: 8721 rss: 36Mb
MERGE-OUTER: successful in 1 attempt(s)
MERGE-OUTER: the control file has 3369521 bytes
MERGE-OUTER: the control file has 3380105 bytes
MERGE-OUTER: consumed 1Mb (36Mb rss) to parse the control file
MERGE-OUTER: 21 new files with 60 new features added; 16 new coverage edges
MERGE-OUTER: 23 new files with 60 new features added; 16 new coverage edges
2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/bip32.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/bip32.h.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/buffer.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/format.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/read.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/varint.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/write.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/fuzz/fuzz_tx.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/libstellar/base32.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/libstellar/base64.c.html
View file
Original file line number Diff line number Diff line change
@@ -1 +1 @@
<!doctype html><html><head><meta name='viewport' content='width=device-width,initial-scale=1'><meta charset='UTF-8'><link rel='stylesheet' type='text/css' href='../../../../style.css'></head><body><h2>Coverage Report</h2><h4>Created: 2024-07-23 01:10</h4><div class='centered'><table><div class='source-name-title'><pre>/src/app-stellar/libstellar/base64.c</pre></div><tr><td><pre>Line</pre></td><td><pre>Count</pre></td><td><pre>Source (<a href='#L13'>jump to first uncovered line</a>)</pre></td></tr><tr><td class='line-number'><a name='L1' href='#L1'><pre>1</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &lt;stdint.h&gt;</pre></td></tr><tr><td class='line-number'><a name='L2' href='#L2'><pre>2</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &lt;stddef.h&gt;</pre></td></tr><tr><td class='line-number'><a name='L3' href='#L3'><pre>3</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &lt;stdbool.h&gt;</pre></td></tr><tr><td class='line-number'><a name='L4' href='#L4'><pre>4</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L5' href='#L5'><pre>5</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &quot;base64.h&quot;</pre></td></tr><tr><td class='line-number'><a name='L6' href='#L6'><pre>6</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L7' href='#L7'><pre>7</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>static const char BASE64_ALPHABET[] =</pre></td></tr><tr><td class='line-number'><a name='L8' href='#L8'><pre>8</pre></a></td><td class='uncovered-line'></td><td class='code'><pre> &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/&quot;;</pre></td></tr><tr><td class='line-number'><a name='L9' href='#L9'><pre>9</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>static int BASE64_MOD_TABLE[] = {0, 2, 1};</pre></td></tr><tr><td class='line-number'><a name='L10' href='#L10'><pre>10</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L11' href='#L11'><pre>11</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre>bool base64_encode(const uint8_t *data, size_t in_len, char *out, size_t out_len) {</pre></td></tr><tr><td class='line-number'><a name='L12' href='#L12'><pre>12</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> size_t encoded_len = 4 * ((in_len + 2) / 3);</pre></td></tr><tr><td class='line-number'><a name='L13' href='#L13'><pre>13</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> if (encoded_len &gt; out_len) <span class='red'>{</span></pre></td></tr><tr><td class='line-number'><a name='L14' href='#L14'><pre>14</pre></a></td><td class='uncovered-line'><pre>0</pre></td><td class='code'><pre><span class='red'> return false;</span></pre></td></tr><tr><td class='line-number'><a name='L15' href='#L15'><pre>15</pre></a></td><td class='uncovered-line'><pre>0</pre></td><td class='code'><pre><span class='red'> }</span></pre></td></tr><tr><td class='line-number'><a name='L16' href='#L16'><pre>16</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L17' href='#L17'><pre>17</pre></a></td><td class='covered-line'><pre>891</pre></td><td class='code'><pre> for (unsigned int i = 0, j = 0; i &lt; in_len;) {</pre></td></tr><tr><td class='line-number'><a name='L18' href='#L18'><pre>18</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t octet_a = i &lt; in_len ? data[i++] : <span class='red'>0</span>;</pre></td></tr><tr><td class='line-number'><a name='L19' href='#L19'><pre>19</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t octet_b = i &lt; in_len ? data[i++] : 0;</pre></td></tr><tr><td class='line-number'><a name='L20' href='#L20'><pre>20</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t octet_c = i &lt; in_len ? data[i++] : 0;</pre></td></tr><tr><td class='line-number'><a name='L21' href='#L21'><pre>21</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L22' href='#L22'><pre>22</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t triple = (octet_a &lt;&lt; 0x10) + (octet_b &lt;&lt; 0x08) + octet_c;</pre></td></tr><tr><td class='line-number'><a name='L23' href='#L23'><pre>23</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L24' href='#L24'><pre>24</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 3 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L25' href='#L25'><pre>25</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 2 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L26' href='#L26'><pre>26</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 1 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L27' href='#L27'><pre>27</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 0 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L28' href='#L28'><pre>28</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> }</pre></td></tr><tr><td class='line-number'><a name='L29' href='#L29'><pre>29</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L30' href='#L30'><pre>30</pre></a></td><td class='covered-line'><pre>339</pre></td><td class='code'><pre> for (int i = 0; i &lt; BASE64_MOD_TABLE[in_len % 3]; i++) {</pre></td></tr><tr><td class='line-number'><a name='L31' href='#L31'><pre>31</pre></a></td><td class='covered-line'><pre>179</pre></td><td class='code'><pre> out[encoded_len - 1 - i] = &apos;=&apos;;</pre></td></tr><tr><td class='line-number'><a name='L32' href='#L32'><pre>32</pre></a></td><td class='covered-line'><pre>179</pre></td><td class='code'><pre> }</pre></td></tr><tr><td class='line-number'><a name='L33' href='#L33'><pre>33</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L34' href='#L34'><pre>34</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> out[encoded_len] = &apos;\0&apos;;</pre></td></tr><tr><td class='line-number'><a name='L35' href='#L35'><pre>35</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> return true;</pre></td></tr><tr><td class='line-number'><a name='L36' href='#L36'><pre>36</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre>}</pre></td></tr></table></div></body></html>
<!doctype html><html><head><meta name='viewport' content='width=device-width,initial-scale=1'><meta charset='UTF-8'><link rel='stylesheet' type='text/css' href='../../../../style.css'></head><body><h2>Coverage Report</h2><h4>Created: 2024-07-23 02:32</h4><div class='centered'><table><div class='source-name-title'><pre>/src/app-stellar/libstellar/base64.c</pre></div><tr><td><pre>Line</pre></td><td><pre>Count</pre></td><td><pre>Source (<a href='#L13'>jump to first uncovered line</a>)</pre></td></tr><tr><td class='line-number'><a name='L1' href='#L1'><pre>1</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &lt;stdint.h&gt;</pre></td></tr><tr><td class='line-number'><a name='L2' href='#L2'><pre>2</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &lt;stddef.h&gt;</pre></td></tr><tr><td class='line-number'><a name='L3' href='#L3'><pre>3</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &lt;stdbool.h&gt;</pre></td></tr><tr><td class='line-number'><a name='L4' href='#L4'><pre>4</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L5' href='#L5'><pre>5</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>#include &quot;base64.h&quot;</pre></td></tr><tr><td class='line-number'><a name='L6' href='#L6'><pre>6</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L7' href='#L7'><pre>7</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>static const char BASE64_ALPHABET[] =</pre></td></tr><tr><td class='line-number'><a name='L8' href='#L8'><pre>8</pre></a></td><td class='uncovered-line'></td><td class='code'><pre> &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/&quot;;</pre></td></tr><tr><td class='line-number'><a name='L9' href='#L9'><pre>9</pre></a></td><td class='uncovered-line'></td><td class='code'><pre>static int BASE64_MOD_TABLE[] = {0, 2, 1};</pre></td></tr><tr><td class='line-number'><a name='L10' href='#L10'><pre>10</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L11' href='#L11'><pre>11</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre>bool base64_encode(const uint8_t *data, size_t in_len, char *out, size_t out_len) {</pre></td></tr><tr><td class='line-number'><a name='L12' href='#L12'><pre>12</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> size_t encoded_len = 4 * ((in_len + 2) / 3);</pre></td></tr><tr><td class='line-number'><a name='L13' href='#L13'><pre>13</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> if (encoded_len &gt; out_len) <span class='red'>{</span></pre></td></tr><tr><td class='line-number'><a name='L14' href='#L14'><pre>14</pre></a></td><td class='uncovered-line'><pre>0</pre></td><td class='code'><pre><span class='red'> return false;</span></pre></td></tr><tr><td class='line-number'><a name='L15' href='#L15'><pre>15</pre></a></td><td class='uncovered-line'><pre>0</pre></td><td class='code'><pre><span class='red'> }</span></pre></td></tr><tr><td class='line-number'><a name='L16' href='#L16'><pre>16</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L17' href='#L17'><pre>17</pre></a></td><td class='covered-line'><pre>891</pre></td><td class='code'><pre> for (unsigned int i = 0, j = 0; i &lt; in_len;) {</pre></td></tr><tr><td class='line-number'><a name='L18' href='#L18'><pre>18</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t octet_a = i &lt; in_len ? data[i++] : <span class='red'>0</span>;</pre></td></tr><tr><td class='line-number'><a name='L19' href='#L19'><pre>19</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t octet_b = i &lt; in_len ? data[i++] : 0;</pre></td></tr><tr><td class='line-number'><a name='L20' href='#L20'><pre>20</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t octet_c = i &lt; in_len ? data[i++] : 0;</pre></td></tr><tr><td class='line-number'><a name='L21' href='#L21'><pre>21</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L22' href='#L22'><pre>22</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> uint32_t triple = (octet_a &lt;&lt; 0x10) + (octet_b &lt;&lt; 0x08) + octet_c;</pre></td></tr><tr><td class='line-number'><a name='L23' href='#L23'><pre>23</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L24' href='#L24'><pre>24</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 3 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L25' href='#L25'><pre>25</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 2 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L26' href='#L26'><pre>26</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 1 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L27' href='#L27'><pre>27</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> out[j++] = BASE64_ALPHABET[(triple &gt;&gt; 0 * 6) &amp; 0x3F];</pre></td></tr><tr><td class='line-number'><a name='L28' href='#L28'><pre>28</pre></a></td><td class='covered-line'><pre>731</pre></td><td class='code'><pre> }</pre></td></tr><tr><td class='line-number'><a name='L29' href='#L29'><pre>29</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L30' href='#L30'><pre>30</pre></a></td><td class='covered-line'><pre>339</pre></td><td class='code'><pre> for (int i = 0; i &lt; BASE64_MOD_TABLE[in_len % 3]; i++) {</pre></td></tr><tr><td class='line-number'><a name='L31' href='#L31'><pre>31</pre></a></td><td class='covered-line'><pre>179</pre></td><td class='code'><pre> out[encoded_len - 1 - i] = &apos;=&apos;;</pre></td></tr><tr><td class='line-number'><a name='L32' href='#L32'><pre>32</pre></a></td><td class='covered-line'><pre>179</pre></td><td class='code'><pre> }</pre></td></tr><tr><td class='line-number'><a name='L33' href='#L33'><pre>33</pre></a></td><td class='uncovered-line'></td><td class='code'><pre></pre></td></tr><tr><td class='line-number'><a name='L34' href='#L34'><pre>34</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> out[encoded_len] = &apos;\0&apos;;</pre></td></tr><tr><td class='line-number'><a name='L35' href='#L35'><pre>35</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre> return true;</pre></td></tr><tr><td class='line-number'><a name='L36' href='#L36'><pre>36</pre></a></td><td class='covered-line'><pre>160</pre></td><td class='code'><pre>}</pre></td></tr></table></div></body></html>
2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/libstellar/formatter.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/libstellar/include/stellar/types.h.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/libstellar/parser.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion coverage/latest/report/linux/src/app-stellar/libstellar/printer.c.html
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion ..._target/app-stellar-fuzz-tx/linux/src/app-stellar/BOLOS_SDK/lib_standard_app/bip32.c.html
View file

Large diffs are not rendered by default.

Loading

0 comments on commit f853fd7

Please sign in to comment.