build index.html for all winners

Updated manifest as per recent file changes.

Updated winner `.winner.json` to reflect the manifest changes.

Added [bin/all_run.sh](bin/all_run.sh) tool to run a command over
all winning entries.

These tools had slight improvements in the help usage message:

* bin/gen-author.sh VERSION="1.3.1 2024-01-16"
* bin/gen-inventory.sh VERSION="1.0.1 2024-01-16"
* bin/pandoc_wrapper.sh VERSION="1.3.1 2024-01-16"
* bin/subst.default.sh VERSION="1.1.1 2024-01-16"
* bin/subst.winner-index.sh VERSION="1.1.1 2024-01-16"

The `bin/readme2index.sh` tool was improved so that
if the `index.html` file exists and the tool forms
the exact same content, then the file `index.html`
file is NOT touched.

* bin/readme2index.sh VERSION="1.1 2024-01-16"

We used the following command to generate `index.html` files
for all winning entries:

```sh
bin/all_run.sh -v 3 bin/readme2index.sh
```

NOTE: We have not (yet) built HTML files above the winner directory
level (e.g., no year level nor top level HTML), nor have be built
non-index HTML files for winners.

NOTE: By default we are running `pandoc(1)` with:

```
--fail-if-warnings=true
```

This means that any problems with markdown to HTML
generates an error.  This is done to be sure that
the HTML conversion is clean.

We had to fix the following `README.md` files:

* `2000/rince/README.md`

The reference [^2] was never used.  We made a guess that [^2] applies
to the same spot as [^1].  Perhaps there is a better spot where
[^2] applies?

NOTE: For every reference, there MUST be some place where that
reference is used.

* 2012/vik/README.md

The string "$...$" is assumed to be a TeX encoded string.

NOTE: Every "$..$" needs to be backslashed as in "\$..\$".

* 2018/burton1/README.md

The reference [2] was duplicated.  We changed the
second [2] to [3].

NOTE: Every reference needs to have a unique number.

* 2020/carlini/README.md

The string "$...$" is assumed to be a TeX encoded string.

NOTE: Every "$..$" needs to be backslashed as in "\$..\$".

We also found 2 errors in the `author/author_handle.json` file set:

* author/Anonymous_2001.json

The `author/Anonymous_2001.json` file was missing.

* author/Jari_Arkko.json

The winner ID for `1989_jar.1` had a typo.
This commit is contained in:
Landon Curt Noll committed 2024-01-17 00:32:39 -08:00
1 parent 893cd915b6
commit c1466f5165
350 files changed
+95242 -4217

No files matched your search

+370 -13
View File
@@ -1,4 +1,6 @@
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<!-- START: two lines up starts content from: inc/top.default.html -->
<!-- -->
<!-- !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! -->
<!-- !!! DO NOT MODIFY THIS FILE - This file is generated by a tool !!! -->
@@ -6,27 +8,382 @@
<!-- !!! DO NOT MODIFY THIS FILE - This file is generated by a tool !!! -->
<!-- !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! -->
<!-- -->
<!-- file: 2018/vokes/index.html created by: fake.gen_index.sh version: 1.0.5 2023-10-31 -->
<html lang="en">
<!-- END: this line ends content from: inc/top.default.html -->
<!-- -->
<!-- This file was formed by the tool: bin/readme2index.sh version: 1.1 2024-01-16 -->
<!-- -->
<!-- START: this line starts content from: inc/head.default.html -->
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>2018 vokes</title>
<meta name="description" content="IOCCC year: 2018 IOCCC winner: vokes winner index page">
<meta name="keywords" content="IOCCC,2018,vokes,winner index page">
<link rel="stylesheet" href="/temp-test-ioccc/ioccc.css">
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes">
<title>2018/vokes</title>
<meta name="description" content="2018 IOCCC winner vokes">
<meta name="keywords" content="IOCCC, 2018, IOCCC 2018, IOCCC winner, vokes">
</head>
<!-- END: this line ends content from: inc/head.default.html -->
<!-- START: this line starts content from: inc/body.default.html -->
<body>
<h1>2018 vokes</h1>
<!-- END: this line ends content from: inc/body.default.html -->
<!-- START: this line starts content from: inc/header.default.html -->
<p>XXX - fake content until readme2index is working - XXX</p>
<div class="header">
<img src="/temp-test-ioccc/png/ioccc.png" alt="IOCCC image by Matt Zucker" width=300 height=110>
<h1>The International Obfuscated C Code Contest</h1>
<h2>2018/vokes</h2>
</div>
<hr style="width:50%;text-align:left;margin-left:0">
<!-- END: this line ends content from: inc/header.default.html -->
<!-- START: this line starts content from: inc/topnav.mid.html -->
<!-- Start Nu Html Checker -->
<p><a href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fioccc-src.github.io%2Ftemp-test-ioccc%2F2018%2Fvokes%2Findex.html">Nu Html check https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/index.html</a></p>
<!-- End Nu Html Checker -->
<div class="topnav">
<a class="Left" href="../poikola/index.html">&larr; poikola</a>
<a class="Left" href="../index.html">&uarr; 2018 &uarr;</a>
<a class="Left" href="../yang/index.html">yang &rarr;</a>
<a class="Right" href="#inventory">Inventory</a>
</div>
<!-- END: this line ends content from: inc/topnav.mid.html -->
<!-- START: this line starts content from: inc/begin-row.default.html -->
<div class="row">
<!-- END: this line ends content from: inc/begin-row.default.html -->
<!-- START: this line starts content from: inc/begin-leftcolumn.default.html -->
<div class="leftcolumn">
<!-- END: this line ends content from: inc/begin-leftcolumn.default.html -->
<!-- START: this line starts content from: inc/sidenav.default.html -->
<div class="sidenav">
<a href="#content">Jump to contents</a>
</div>
<hr>
<div class="sidenav">
<a href="/temp-test-ioccc/index.html">IOCCC Home</a>
<a href="/temp-test-ioccc/years.html">Winning Entries</a>
<a href="/temp-test-ioccc/winners.html">People who have won</a>
</div>
<hr>
<div class="sidenav">
<a href="/temp-test-ioccc/news.html">IOCCC News</a>
<a href="/temp-test-ioccc/faq.html#submit">How to enter the IOCCC</a>
<a href="/temp-test-ioccc/faq.html">FAQ</a>
</div>
<hr>
<div class="sidenav">
<a href="/temp-test-ioccc/bugs.html">Bugs &amp; (mis)features</a>
<a href="/temp-test-ioccc/faq.html#fix_a_winner">Fixing IOCCC winners</a>
<a href="/temp-test-ioccc/faq.html#fix_web_site">Fixing the web site</a>
<a href="/temp-test-ioccc/faq.html#fix_author">Fixing winner info</a>
<a href="/temp-test-ioccc/thanks-for-help.html">Thanks for the help</a>
</div>
<hr>
<div class="sidenav">
<a href="/temp-test-ioccc/judges.html">The IOCCC Judges</a>
<a href="/temp-test-ioccc/contact.html">Contacting the IOCCC</a>
</div>
<hr>
<div class="sidenav">
<a href="#top">Jump to top</a>
</div>
<!-- END: this line ends content from: inc/sidenav.default.html -->
<!-- START: this line starts content from: inc/end-leftcolumn.default.html -->
</div>
<!-- END: this line ends content from: inc/end-leftcolumn.default.html -->
<!-- START: this line starts content from: inc/begin-rightcolumn.default.html -->
<div class="rightcolumn">
<!-- END: this line ends content from: inc/begin-rightcolumn.default.html -->
<!-- START: this line starts content from: inc/before-content.default.html -->
<a name="content"></a>
<!-- END: this line ends content from: inc/before-content.default.html -->
<!-- START: this line starts content generated by: bin/gen-author.sh -->
<p><a name="author"><strong>Author:</strong></a> <br><br>Name: <a
href="/temp-test-ioccc/winners.html#Scott_Vokes">Scott Vokes</a><br>
Location: <a href="/temp-test-ioccc/location.html#US">US</a></p>
<!-- END: next line ends content generated by: bin/gen-author.sh -->
<h2 id="to-build">To build:</h2>
<div class="sourceCode" id="cb1"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb1-1"><a href="#cb1-1" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span></span></code></pre></div>
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code>STATUS: INABIAF - please **DO NOT** fix</code></pre>
<p>For more detailed information see <a href="/bugs.md#2018-vokes">2018
vokes in bugs.md</a>.</p>
<h2 id="to-use">To use:</h2>
<div class="sourceCode" id="cb3"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb3-1"><a href="#cb3-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./prog</span> <span class="op">&lt;</span> file.txt</span></code></pre></div>
<h2 id="try">Try:</h2>
<div class="sourceCode" id="cb4"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb4-1"><a href="#cb4-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./try.sh</span></span></code></pre></div>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>What this program does is not witchcraft and there are no spectres,
but you might have a meltdown trying to work it all out (look at the
source code to understand this better).</p>
<p>This entry is designed to mislead in many ways. However, if you find
yourself wanting to know the possibilities for navigating a graph, you
will get the answer you seek with no hocus pocus.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<h3 id="introduction">Introduction:</h3>
<p>This program reads a directed graph (as lines with integer node IDs),
and prints the graph’s nodes in reverse-topologically sorted order,
grouped into strongly connected components. Given a set of nodes
representing targets and edges representing dependencies between them,
it produces a build order with any dependency cycles gathered.</p>
<p>For example, the following input (provided as <a
href="example-1.txt">example-1.txt</a>):</p>
<pre><code>0 4 8
1 0
2 1 3
3 2
4 1
5 4 6
6 5 2
7 3 6 7</code></pre>
<p>would be interpreted as:</p>
<pre><code>0 -&gt; 4, 8
1 -&gt; 0
2 -&gt; 1, 3
3 -&gt; 2
4 -&gt; 1
5 -&gt; 4, 6
6 -&gt; 5, 2
7 -&gt; 3, 6, 7</code></pre>
<p>So, node 0 has edges to / depends on nodes 4 and 8, node 1 depends on
node 0, and so on. Then, it groups the graph’s nodes into strongly
connected components and prints them in reverse-topologically sorted
order:</p>
<pre><code>0: 8
1: 0 1 4
2: 2 3
3: 5 6
4: 7</code></pre>
<p>It uses <a
href="https://en.wikipedia.org/wiki/Tarjan&#39;s_strongly_connected_components_algorithm">Tarjan’s
strongly connected components algorithm</a> for the grouping and
reverse-topological sorting, along with a bonus hidden implementation of
counting sort, which sorts each group.</p>
<p>For other details about the input format, see <a
href="#issues-and-limitations">Issues and Limitations</a>.</p>
<h3 id="building">Building:</h3>
<p>To build:</p>
<pre><code> ${CC} -o prog prog.c -std=c11 -O3 \
-Wall -Wextra -pedantic -Wno-missing-prototypes</code></pre>
<p><code>-Wno-missing-prototypes</code> is necessary because there
aren’t any prototypes. (They would put the program well over the size
limit.)</p>
<p>Note: The program can also be built with <code>-std=c99</code> or
<code>-std=c89</code>.</p>
<p>If building with <code>-Weverything</code>, then
<code>-Wno-strict-prototypes</code> may also be necessary – the function
pointer declarations for <code>_</code> and <code>B</code> may get
warnings otherwise, for reasons described next in <a
href="#obfuscations">Obfuscations</a>.</p>
<h3 id="obfuscations">Obfuscations:</h3>
<ul>
<li><p>This entry uses functions that have a variable number of
arguments, but despite what the rules say, there is no need to be
careful about <code>va_list</code> implementation differences. :) .
There are several references to a function pointer, <code>_</code>, but
it’s called with different numbers of arguments in different places. (In
particular, look at <code>spell</code>.) Because the function pointer
declaration has an empty list of parameters, the argument count and
types are unconstrained. <code>_</code> is set to different functions in
several places, but it is always called with appropriate argument(s) for
its possible current functions. This is allowed by the standard – The
section on
<code>F</code>,<code>I</code>,<code>N</code>,<code>D</code>,<code>M</code>,<code>Y</code>,<code>C</code>,<code>L</code>,<code>U</code>,<code>E</code>
has further details.</p></li>
<li><p>It uses <code>_</code> in three different scopes: as a
<code>goto</code> label (function scope), as an <code>enum</code> name,
and a <code>_</code> function pointer (which is required to have file
scope, since it starts with <code>_</code>). There are also other
<code>_</code>s: it appears in a string, obscured by a hexadecimal
escape sequence (<code>\x5f</code>), and the cauldron is supported by a
giant underscore. (Does this program qualify for Best One
Liner?)</p></li>
<li><p>Most of the variables are not only global, but used for unrelated
purposes at different times, so just renaming them while studying the
program should make it even more confusing. The few variables local to
functions have their names reused for different things in other
functions.</p></li>
<li><p>There is an enum early on that defines several single-letter
identifiers:
<code>F</code>,<code>I</code>,<code>N</code>,<code>D</code>,<code>M</code>,<code>Y</code>,<code>C</code>,<code>L</code>,<code>U</code>,<code>E</code>.
These are used for array offsets, both individually and in combination.
The first several values are also a clue: ISO/IEC 9899:1999 chapter
6.7.5.3 verse 14 describes how function declarators with an empty
parameter list behave. (As does 3.5.4.3 for ANSI C, which explains the
<code>0x3543</code> that appears soon after.)</p></li>
<li><p>Several parts of the program’s state are stashed in otherwise
unused offsets of the node arrays. These locations are accessed in
multiple ways, such as using <code>I[p]</code> (where
<code>I == 7</code>) as well as <code>p[F+L]</code> (6+1), or
<code>b[M-N]</code> (14-5) and <code>U[b]</code> (where
<code>U == 9</code>).</p></li>
<li><p>The other identifiers are misleading, punny, or both.
<code>spectre</code> does not exploit CVE-2017-5753 or CVE-2017-5715,
for example – it just fits the witch theme. <code>cast</code> doesn’t
cast, <code>hex</code> has nothing to do with hexadecimal,
<code>bubble</code> is not bubble sort, there is no undefined behavior
in <code>nasal_demons</code>, and <code>main()</code> has absolutely
nothing to do with a hand.</p></li>
<li><p>For well-formed input, how the program determines when to exit is
a bit obscure. <code>main()</code> ends with a <code>goto</code> leading
back to an earlier <code>_</code> label, so it just loops forever, and
<code>exit</code> only appears in code paths related to error-handling.
It looks like <code>cast</code> calls <code>meltdown</code> with its
second argument set to 0, which would call <code>exit</code>, but
running in <code>gdb(1)</code> with a breakpoint on <code>cast</code>
reveals that it isn’t being called…</p></li>
<li><p>Instead of using <code>isdigit(3)</code>, the program checks the
numeric value of each <code>char</code>, and literals that would suggest
comparing against e.g. <code>'0'</code> are specified in octal in one
place, and produced by arithmetic using the <code>enum</code>
elsewhere.</p></li>
<li><p>Common conventions are subverted: <code>i</code> is not a loop
index, <code>argv</code> and <code>argc</code>’s names are
swapped.</p></li>
<li><p><code>NULL</code> does not appear in the program. Instead,
<code>argc[argv]</code> (which is required to be a NULL pointer) is
saved and passed to where its value is needed.</p></li>
<li><p>Oh, and the program is squashed into the shape of a bubbling
cauldron, on top of a giant underscore, so there’s that.</p></li>
</ul>
<h3 id="issues-and-limitations">Issues and Limitations:</h3>
<ul>
<li><p>Despite appearances, it does not handle numbers in hex, or
provide a <code>curses(3)</code>-based interface.</p></li>
<li><p>The expected input format is zero or more lines of
space-separated integers. If other characters appear in the input, it
will either reject the input entirely and exit with a non-zero status,
or skip number(s) adjacent to the non-digit characters, depending on
where the characters appear. Tabs and multiple consecutive spaces are
handled correctly, however.</p></li>
<li><p>Individual lines of input longer than <code>0x3543 - 1</code>
bytes will be split and processed as if they were multiple lines of
input, which can produce incorrect results. This magic number’s
significance is described earlier.</p></li>
<li><p>The algorithm expects its input to represent a fully connected
graph. While the output is otherwise topologically sorted, if there are
nodes completely unconnected to the rest of the graph (with or without
self-cycles), they will be output as soon as they are processed – this
means that, when there are disconnected nodes, reordering the input
lines can produce different output. Addressing this by adding another
pass is would put the program over the size limit.</p></li>
<li><p>While the node IDs don’t need to be consecutive or start at 0,
the implementation doesn’t have special handling for sparse graphs. If
you give it a graph with nodes numbered 0 and 2147483647, it will
attempt to allocate sufficient memory (potentially around 32 GB) for the
entire range of graph nodes, even if those are the only ones. If memory
allocation returns NULL, it will gracefully exit, otherwise it will
succeed, eventually, perhaps after a great deal of swapping.</p></li>
<li><p>Node IDs &gt;= 2147483648 will cause the program to print an
error message and exit with a non-zero status. This shrinks the code
that detects overflowing the array size by a bit.</p></li>
<li><p>A very large group of nodes in a cycle can cause a stack
overflow. This typically takes over 100,000 nodes, and depends on the
order the nodes are visited. Addressing this would put the program over
the size limit.</p></li>
<li><p>The implementation depends on the characters <code>'0'</code>,
<code>'1'</code>, … <code>'9'</code> having the values <code>48</code>
through <code>57</code>, rather than using <code>isdigit(3)</code>. As
noted above, this program has nothing to do with a hand.</p></li>
</ul>
<h2 id="copyright-and-cc-by-sa-4.0-license">Copyright and CC BY-SA 4.0
License:</h2>
<p>This file is Copyright (c) 2023 by Landon Curt Noll. All Rights
Reserved. You are free to share and adapt this file under the terms of
this license:</p>
<pre><code>Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)</code></pre>
<p>For more information, see:
https://creativecommons.org/licenses/by-sa/4.0/</p>
<!-- START: this line starts content generated by: bin/gen-inventory.sh -->
<h1 id="inventory-for-2018vokes"><a name="inventory"></a>Inventory for
2018/vokes</h1>
<h2 id="primary-files">Primary files</h2>
<ul>
<li><a href="index.html">index.html</a> - winner home page</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/prog.c">prog.c</a>
- winning source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/Makefile">Makefile</a>
- winner Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/prog.orig.c">prog.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/example-1.txt">example-1.txt</a>
- sample input</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/example-2.txt">example-2.txt</a>
- sample input</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/example-tab.txt">example-tab.txt</a>
- sample input</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/ioccc.txt">ioccc.txt</a>
- sample input</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/try.sh">try.sh</a>
- how to run</li>
<li><a href="2018_vokes.tar.bz2">2018_vokes.tar.bz2</a> - download
winning source</li>
</ul>
<h2 id="secondary-files">Secondary files</h2>
<ul>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/.gitignore">.gitignore</a>
- list of files that should not be committed under git</li>
<li><a href=".path">.path</a> - directory path from top directory</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/.winner.json">.winner.json</a>
- description of winner in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/vokes/README.md">README.md</a>
- markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/gen-inventory.sh -->
<!-- START: this line starts content from: inc/after-content.default.html -->
<!-- END: this line ends content from: inc/after-content.default.html -->
<!-- START: this line starts content from: inc/end-rightcolumn.default.html -->
</div>
<!-- END: this line ends content from: inc/end-rightcolumn.default.html -->
<!-- START: this line starts content from: inc/end-row.default.html -->
</div>
<!-- END: this line ends content from: inc/end-row.default.html -->
<!-- START: this line starts content from: inc/footer.default.html -->
<div class="footer">
<hr>
<h2>Coda</h2>
<p><a href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fioccc-src.github.io%2Ftemp-test-ioccc%2F2018%2Fvokes%2Findex.html">Nu HTML check this web page</a></p>
<p><a href="#top">Jump to top</a> <a href="#content">Jump to Content</a> <a href="#inventory">Jump to Inventory</a></p>
</div>
<!-- END: this line ends content from: inc/footer.default.html -->
<!-- START: this line starts content from: inc/bottom.default.html -->
</body>
</html>
<!-- END: this line ends content from: inc/bottom.default.html -->