Files
ioccc/2020/yang
Landon Curt Noll 96e0f2b966 move some rules into 1337.mk
A number of rules have been moved from entry `Makefile`s into the
`1337.mk` include file to make it easier for these common rules to be
updated or modified globally (by modifying the `1337.mk` include file).

The entry level `Makefile`s are now similar in form to the
/Makefile.example](https://github.com/ioccc-src/mkiocccentry/blob/master/Makefile.example)
file from the other repo.

The following make rules were moved into the `1337.mk` include file:

- `make indent.c`
- `make install`
- `make diff_orig_prog`
- `make diff_prog_orig`
- `make diff_alt_prog`
- `make diff_prog_alt`

This simplifies the entry level `Makefile`s so that they mostly reflect
the specifics of the particular entry.

Mentioned in FAQ 4.2, that the make diff rules are in the `1337.mk` include file.

Fixed invalid TAB character in `faq.md`.

Removed `make clean` directives that removed `indent.c`.  This file is now
removed via `make indent_clean`, a clean rule that also removes `indent.c`.

Removed `make clobber` directives that removed sandwich,  This file is now
removed via `make indent_clobber`, a clean rule that also removes `sandwich`.

Added `make indent_clean` and `make indent_clobber` rules into the top level
`Makefile` and the year level `YYYY/Makefile`.

Performed `make quick_www` to accomplish the above and to test under macOS.
2024-08-21 23:42:28 -07:00
..
2020-12-31 18:34:17 -08:00
2024-08-21 23:42:28 -07:00
2020-12-31 18:34:17 -08:00
2023-07-06 21:49:38 -07:00

To build:

    make

To use:

    ./prog [PIN] < input.txt > output.c

Try:

    ./try.sh

The author provided the file cppp.cc which can preprocess the generated output to make them more acceptable to typical compilers. To build:

    make cppp

See the author's remarks for more details.

Judges' remarks:

You might think of this entry as code obfuscater with a code. If you use the wrong code, you're gonna have a bad time. What is compiling this entry about? Having a good .. time!

This winning entry also comes with a JavaScript time-lapse obfuscation that shows how this entry was written.

Author's remarks:

Synopsis

    echo "Hello world" | ./prog 12345 > encoded.c

    gcc -DPIN=12345 encoded.c -o ./decoded && ./decoded

Details

Mile is a C code generator. Run without arguments for the help message below:

    usage: [PIN] < input.txt > output.c

    where [PIN] is an integer in the range of 1..65535

When run with an encoding PIN (first command line argument), Mile will read bytes from stdin and generate C code on stdout. Example:

    echo "Hello, world!" | ./prog 56789 > encoded.c

This generated code will reproduce the same input bytes on stdout when executed, if it was compiled with the same encoding PIN.

    gcc -DPIN=56789 encoded.c -o decoded

The generated code reconstructs all data at compile time by seeding a random number generator with the given PIN to reproduce the input bytes, and simply does one fwrite(3) call at run time to print those bytes. Not specifying a PIN is a compile time error. Specify the wrong PIN and output code will still compile, but will likely produce garbage instead of the input bytes. If the original input was empty then any PIN works, but you might get a compile time warning complaining about empty arrays.

Because all data is reconstructed at compile time, expect the compile time to be excruciatingly long if you try to encode too much data. Code generated by encoding a haiku will probably compile in seconds, a limerick may require tens of seconds, a sonnet will take minutes. Give Mile an epic poem and you can probably write a faster preprocessor before GCC is done (Clang probably already failed long before then).

I see that there is a lack of preprocessor abuse in recent years, probably because programming in preprocessor is too tedious. Mile is meant to help with that by producing C code filled with at least 98% preprocessor lines for any input. Now you too can enjoy long compile times with minimal effort.

Features

  • Output is randomized using system clock, so if you wait a second between runs, you should get a different generated code even for the same encoding PIN.

  • Customized bytecode encoding of preprocessor boilerplates, mostly for compression but should also make reverse engineering more fun.

  • CRC32 of the source code is embedded in the source code itself.

  • Code layout shaped to resemble "Mile" from "Didn't I Say to Make My Abilities Average in the Next Life?!". Mile is known to be able to talk to nanomachines directly, which is exactly what programming in preprocessor feels like.

Compatibility

Mile has been verified to work in these environments (also, compiles without warnings on all of these):

  • gcc 9.2.0 on Cygwin
  • gcc 8.3.0 on Linux
  • gcc 7.4.0 on Cygwin
  • gcc 6.1.0 on JSLinux
  • gcc 5.4.0 on Linux
  • clang 8.0.1 on Linux
  • clang 8.0.1 on Cygwin
  • tcc 0.9.27 on Linux
  • tcc 0.9.25 on JSLinux

Output of Mile is a bit more taxing, and only works with a subset of the above:

  • gcc: works just fine when using 8.3.0 and below, but may trigger warning for large files. gcc 9.2.0 and above may crash with large files.
  • clang: works fine for small files, fails on large files due to preprocessor bug.
  • tcc: works just fine on Linux. Fails silently on JSLinux.

For people eager to encode large files, an extra utility has been packaged with this entry to preprocess the generated output to make them more acceptable to typical compilers. View the cppp.cc source and then compile it with a c++ compiler of your choice.