mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix Makefile and README.md for 2004/omoikane

Browse Source
This commit is contained in:
Landon Curt Noll committed 2023-03-21 21:55:20 -07:00
1 parent 3b238069e4
commit afc233f95b
2 files changed
+380 -405
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2004/omoikane/Makefile
+265 -300
View File
@@ -1,362 +1,327 @@
#!/bin/make #!/usr/bin/env make
# #
# 2004 makefile # IOCCC 2004 winning entry - omoikane
################################################################################
# #
# Copyright (C) 2004, Landon Curt Noll, Simon Cooper, Peter Seebach # Regarding individual entries:
# and Leonid A. Broukhis. All Rights Reserved. Permission for personal, #
# educational or non-profit use is granted provided this copyright and # IOCCC winning entry code may not work on your system. Even with standards,
# notice are included in its entirety and remains unaltered. All other # conditions and build environments change, especially when it comes to more
# uses must receive prior permission from the contest judges. # extreme code such you might find in an IOCCC winner. Moreover, what was
# allowed and liked in one IOCCC contest may no longer be liked/allowed in
# later IOCCC years.
#
# Corrections on winning author and fixing typos in remarks are VERY WELCOME.
#
# GitHub pull requests are welcome:
#
# If you have a patch that might make running an entry work in modern Unix-like
# environments, please create a GitHub pull request for the IOCCC judges to
# consider.
#
# Suggestions and corrections regarding Makefiles, winning author information,
# fixing typos in remarks, and code patches are welcome via opening a GitHub
# issue or better yet, by creating a GitHub pull request for the IOCCC judges
# to consider. To form a GitHub issue or GitHub pull, please visit:
#
# https://github.com/ioccc-src/winner
#
################################################################################
# This work by Landon Curt Noll and Leonid A. Broukhis is licensed under:
#
# Creative Commons Attribution-ShareAlike 3.0 Unported License.
#
# See: http://creativecommons.org/licenses/by-sa/3.0/
# tool locations #############################
# shell used by this Makefile
#############################
# #
SHELL= /bin/sh SHELL= bash
CP= cp
CPP= cpp
GUNZIP= gunzip
LD= ld
MAKE= make
RM= rm
SED= sed
TAR= tar
TRUE= true
#######################
# Special flags for the gavin entry # common tool locations
#######################
# #
# FYI: Older versions of GCC have a bug in -O2 optimization, hence -O1 include ../../var.mk
#
GAVIN_OPT= -O1
GAVIN_FLAGS=\
'-DY(m)=*((int*)(m))'\
'-DE(f,a,b,c)=((G((*)))(f))(a,b,c)'\
'-DM=for(D=0;D<786432;D++)'\
'-DZ=int i=0,j=0,h,n,p=393728,s=26739,C,D'\
'-DV=0x90200'\
'-DK=0'\
'-DR=while((C=E(V-8,100,0,0))&3&&(D=E(V-8,96,0,0))|3){'\
'-DL(c,d)=E(V+8,100,c,0);R}E(V+8,96,d,0);R}'
# Set X11_LIBDIR to the directory where the X11 library resides # Set X11_LIBDIR to the directory where the X11 library resides
# #
X11_LIBDIR= /usr/X11R6/lib #X11_LIBDIR= /usr/X11R6/lib
#X11_LIBDIR= /usr/X11/lib
X11_LIBDIR= /opt/X11/lib
#CINCLUDE= -I ${HOMEBREW_PREFIX}/include/SDL2 # Set X11_INCLUDEDIR to the directory where the X11 include files reside
#
#X11_INCDIR= /usr/X11R6/include
#X11_INCDIR= /usr/X11/include
X11_INCDIR= /opt/X11/include
# optimization # Common C compiler warnings to silence
#
#CSILENCE=
CSILENCE= -Wno-empty-body -Wno-int-conversion -Wno-unused-value
# Common C compiler warning flags
#
#CWARN= ${CSILENCE}
#CWARN= -Wall ${CSILENCE}
#CWARN= -Wall -Wextra ${CSILENCE}
CWARN= -Wall -Wextra -pedantic ${CSILENCE}
# Compiler standard
#
#CSTD=
#CSTD= -ansi
CSTD= -std=gnu99
# Compiler bit architecture
#
# Some entries require 32-bitness:
# ARCH= -m32
#
# Some entries require 64-bitness:
# ARCH= -m64
#
# By default we assume nothing:
#
ARCH=
# Defines that are needed to compile
#
CDEFINE=
#CDEFINE= -DIOCCC
# Include files that are needed to compile
#
CINCLUDE=
#CINCLUDE= -include stdlib.h
#CINCLUDE= -include stdio.h
#CINCLUDE= -include stdlib.h -include stdio.h
#CINCLUDE= -I ${X11_INCDIR} -I ${X11_INCDIR}/X11
#CINCLUDE= `${SDL2_CONFIG} --cflags`
# Optimization
# #
# Most compiles will safely use -O2. Some can use only -O1 or -O. # Most compiles will safely use -O2. Some can use only -O1 or -O.
# A few compilers have broken optimizers and thus you may # A few compilers have broken optimizers or this entry make break
# not want anything. # under those buggy optimizers and thus you may not want anything.
# Reasonable compilers will allow for -O3.
# #
#OPT= #OPT=
#OPT= -O #OPT= -O
#OPT= -O1 #OPT= -O1
OPT= -O2 #OPT= -O2
OPT= -O3
# Default flags for ANSI C compilation
#
CFLAGS= ${CSTD} ${CWARN} ${ARCH} ${CDEFINE} ${CINCLUDE} ${OPT}
# flags for ANSI compiles # Libraries needed to build
# #
# NOTE: Some ANSI compilers make use of -Xa to turn on ANSI mode, LIBS=
# others such as gcc may want -ansi, others (Compaq Tru64 Unix) #LIBS= -lm
# want -std1, and others may want nothing at all. #LIBS= -L ${X11_LIBDIR} -lX11
# Adjust the CFLAGS line as needed. #LIBS= `${SDL2_CONFIG} --libs`
#
# NOTE: Some compilers cannot optimize, or optimize some entries
# incorrectly. You might want to turn on -O to see if your
# compiler can handle them.
#
#
#CFLAGS= -Xa ${OPT}
#CFLAGS= -std1 $(OPT)
CFLAGS= -ansi ${OPT}
# C compiler to use
# ANSI compiler
#
# Set CC to the name of your ANSI compiler.
#
# Some entries seem to need gcc. If you have gcc, set
# both CC and MAY_NEED_GCC to gcc.
#
# If you do not have gcc, set CC to the name of your ANSI compiler, and
# set MAY_NEED_GCC to either ${CC} (and hope for the best) or to just :
# to disable such programs.
# #
CC= cc CC= cc
MAY_NEED_GCC= gcc #CC=clang
#CC=gcc
# Compiler add-ons or replacements for clang only
# 2004 winners
# #
WINNERS= anonymous arachnid burley gavare gavin hibachi hoyle jdalbec \ ifeq ($(CC),clang)
kopczynski newbern omoikane schnitzi sds vik1 vik2
CLEAN= anonymous_clean arachnid_clean burley_clean gavare_clean gavin_clean \
hibachi_clean hoyle_clean jdalbec_clean kopczynski_clean \
newbern_clean omoikane_clean schnitzi_clean sds_clean vik1_clean \
vik2_clean
CLOBBER= anonymous_clobber arachnid_clobber burley_clobber gavare_clobber \
gavin_clobber hibachi_clobber hoyle_clobber jdalbec_clobber \
kopczynski_clobber newbern_clobber omoikane_clobber schnitzi_clobber \
sds_clobber vik1_clobber vik2_clobber
ALT_NAMES= hoyle.orig kopczynski.orig
DATA_FILES= arachnid_files gavin_files hibachi_files kopczynski_files \
newbern_files omoikane_files schnitzi_files
# default build
# #
all: ${WINNERS} CSILENCE+= -Wno-missing-prototypes -Wno-missing-variable-declarations \
-Wno-poison-system-directories -Wno-shorten-64-to-32 -Wno-sign-conversion \
-Wno-strict-prototypes
# Best use of "Precious" Lines
# #
anonymous: anonymous.c CWARN+= -Weverything
${CC} anonymous.c -o anonymous
anonymous_clean:
${RM} -f anonymous.o
anonymous_clobber: anonymous_clean
${RM} -f anonymous
# Best use of Vision
# #
arachnid: arachnid.c endif
${CC} -o arachnid -DL=LINES -DS=COLS \
-DW=mvwaddch\(w,v,u,acs_map\[l\[m\[u arachnid.c -lncurses
arachnid_clean: # Specific add-ons or replacements for gcc only
${RM} -f arachnid.o
arachnid_clobber: arachnid_clean
${RM} -f arachnid
arachnid_files: arachnid.info
# Best Calculated Risk
# #
burley: burley.c ifeq ($(CC),gcc)
${CC} -ansi burley.c -o burley
burley_clean:
${RM} -f burley.o
burley_clobber: burley_clean
${RM} -f burley
# Best Use of Light and Spheres
# #
gavare: gavare.c #CSILENCE+=
${CC} -O3 gavare.c -o gavare
gavare_clean:
${RM} -f gavare.o
gavare_clobber: gavare_clean
${RM} -f gavare
# Best of Show
# #
gavin: gavin.c #CWARN+=
${CC} ${GAVIN_OPT} -o gavin ${GAVIN_FLAGS} gavin.c
${RM} -f kernel
./gavin > kernel
${CC} ${GAVIN_OPT} -c ${GAVIN_FLAGS} -DB=_start '-Dputchar(a)=' gavin.c
${RM} -f sh
${LD} -s -o sh gavin.o
${RM} -f vi
${CP} sh vi
${RM} -f fs.tar
${TAR} -cvf fs.tar sh vi gavin.c gavin.hint prim
gavin_clean:
${RM} -f sh vi kernel gavin.o
gavin_clobber: gavin_clean
${RM} -f gavin fs.tar
gavin_files: boot.b lilo.conf prim gavin_install.txt
# Best Abuse of the Guidelines
# #
hibachi: hibachi.tar.gz endif
${RM} -f hibachi.tar
${GUNZIP} < hibachi.tar.gz > hibachi.tar
${TAR} -xvf hibachi.tar
${RM} -f hibachi.tar
(cd hibachi && ${SHELL} ./configure)
([ -f hibachi/makefile ] && cd hibachi && $(MAKE) -f makefile || true)
hibachi_clean:
${RM} -f hibachi/hibachi.o hibachi.tar
hibachi_clobber: hibachi_clean
${RM} -rf hibachi
hibachi_files: hibachi.tar.gz
# Most Functional Output ##############################
# Special flags for this entry
##############################
# #
hoyle: hoyle.c ENTRY= omoikane
${CC} hoyle.c -o hoyle -lm PROG= ${ENTRY}
hoyle.orig: hoyle.orig.c
${CC} hoyle.orig.c -o hoyle.orig -lm
hoyle_clean:
${RM} -f hoyle.o hoyle.orig.o
hoyle_clobber: hoyle_clean
${RM} -f hoyle hoyle.orig
# Best Abuse of the Periodic Table
# #
jdalbec: jdalbec.c OBJ= ${PROG}.o
@${RM} -f jdalbec2.c DATA= omoikane.info
-${CC} -E jdalbec.c > jdalbec2.c TARGET= ${PROG}
@${RM} -f jdalbec3.c
${SED} -e 's/ (/(/g' < jdalbec2.c > jdalbec3.c
${CC} -ansi jdalbec3.c -o jdalbec
jdalbec_clean:
${RM} -f jdalbec2.c jdalbec3.c jdalbec.o
jdalbec_clobber: jdalbec_clean
${RM} -f jdalbec
# Best one-liner
# #
kopczynski: kopczynski.c ALT_OBJ=
${CC} -Dif=while kopczynski.c -o kopczynski ALT_TARGET=
kopczynski.orig: kopczynski.orig.c
${CC} -Dif=while kopczynski.orig.c -o kopczynski.orig
kopczynski_clean:
${RM} -f kopczynski.o kopczynski.orig.o
kopczynski_clobber: kopczynski_clean
${RM} -f kopczynski kopczynski.orig
kopczynski_files: kopczynski-10 kopczynski-11 kopczynski-8a kopczynski-8b \
kopczynski-8c kopczynski-9
# Best Font Engine #################
# build the entry
#################
# #
newbern: newbern.c all: data ${TARGET}
${CC} newbern.c -o newbern @${TRUE}
newbern_clean: .PHONY: all alt data everything clean clobber install \
${RM} -f newbern.o love haste waste maker easter_egg sandwich \
supernova deep_magic magic charon pluto
newbern_clobber: newbern_clean ${PROG}: ${PROG}.c
${RM} -f newbern ${CC} ${CFLAGS} $< -o $@ ${LIBS}
newbern_files: newbern.dat # alternative executable
# Best Utility
# #
omoikane: omoikane.c alt: data ${ALT_TARGET}
${CC} -O omoikane.c -o omoikane @${TRUE}
omoikane_clean: # data files
${RM} -f omoikane.o
omoikane_clobber: omoikane_clean
${RM} -f omoikane
omoikane_files: omoikane.info
# Best Non-Use of Curses
# #
schnitzi: schnitzi.c data: ${DATA}
${CC} schnitzi.c -o schnitzi @${TRUE}
schnitzi_clean: # both all and alt
${RM} -f schnitzi.o
schnitzi_clobber: schnitzi_clean
${RM} -f schnitzi
schnitzi_files: schnitzi.inp0 schnitzi.inp1
# Best Abuse of Indentation
# #
sds: sds.c everything: all alt
${CC} -o sds sds.c
sds_clean:
${RM} -f sds_encoder.c sds_encoder.o sds.o
sds_clobber: sds_clean
${RM} -f sds sds_encoder
# Best X11 Game
#
vik1: vik1.c
${CC} -ansi -O2 -o vik1 vik1.c -L${X11_LIBDIR} -lX11
vik1_clean:
${RM} -f vik1.o
vik1_clobber: vik1_clean
${RM} -f vik1
# Best Abuse of CPP
#
vik2: vik2.c
@${RM} -f vik2_1.c
${CC} -E '-DSTOP=_5' '-DFNAME="vik2_1.c"' vik2.c > vik2_1.c
@${RM} -f vik2_2.c
${CC} -E vik2_1.c > vik2_2.c
${CC} -O vik2_2.c -o vik2
vik2_clean:
${RM} -f vik2_1.c vik2_2.c vik2.o
vik2_clobber: vik2_clean
${RM} -f vik2
###############
# utility rules # utility rules
###############
# #
everything: ${WINNERS} ${ALT_NAMES} ${DATA_FILES} clean:
${RM} -f ${OBJ} ${ALT_OBJ}
@-if [ -f indent.c ]; then \
echo ${RM} -f indent.c; \
${RM} -f indent.c; \
fi
clobber: clean
${RM} -f ${TARGET} ${ALT_TARGET}
@-if [ -e sandwich ]; then \
${RM} -f sandwich; \
echo 'ate sandwich'; \
fi
install:
@echo "Dr. Spock says that is not logical!"
@${TRUE}
# you may be able to misunderstand the source by reading indent.c
#
indent.c: ${PROG}.c
@if which "${GINDENT}" >/dev/null 2>&1; then \
echo ${RM} -f $@; \
${RM} -f $@; \
echo "${GINDENT} < $< > $@"; \
${GINDENT} < $< > $@; \
elif which "${INDENT}" >/dev/null 2>&1; then \
echo ${RM} -f $@; \
${RM} -f $@; \
echo "${INDENT} < $< > $@"; \
${INDENT} < $< > $@; \
else \
echo "no intent tool found, ident $< yourself, sorry"; \
echo "exit 1"; \
exit 1; \
fi
##################
# 133t hacker rulz
##################
#
love: love:
@echo 'not war?' @echo 'not war?'
@${TRUE}
haste: haste:
$(MAKE) waste $(MAKE) waste
waste:
@echo 'waste'
clean: ${CLEAN}
${RM} -f a.out core
clobber: ${CLOBBER}
${RM} -f ${WINNERS}
${RM} -f ${ALT_NAMES}
nuke: clobber
@${TRUE} @${TRUE}
install: all waste:
${CAT} ${WINNERS} ${ALT_NAMES} > /dev/null @echo 'haste'
@${TRUE}
maker:
@echo 'Participate in a maker faire'
@${TRUE}
easter_egg:
@echo "you expected to often misunderstand this $${RANDOM} magic"
@echo "chongo '<was here>' /\\oo/\\"
@echo "Eggy"
sandwich: easter_egg
@if [ `id -u` -eq 0 ]; then \
echo 'Okay.'; \
echo "$${RANDOM}`date +%s`$${RANDOM}" > $@; \
else \
echo 'What? Make it yourself.'; \
exit 1; \
fi
# Understand the history of the Homebrew Computer Club
# as well as the West Coast Computer Faire and
# you might be confused different. :-)
#
supernova: sandwich
@-if [ -r .code_anal ]; then \
${RM} -f .code_anal_v6; \
else \
echo "planet deniers, like some members of the IAU, are so cute when they try to defend their logic"; \
fi
@echo "A $@ helps ${MAKE} the elements that help form planets"
@${TRUE}
deep_magic: supernova
@-if [ -r .code_anal ]; then \
ccode_analysis --deep_magic 7889066cdbdf09b0408021754586e895be641cc9be29e7eafd3ca65359541f17 \
--FNV1a_hash_512_bit -v2 "${PROG}" "${PROG}.c"; \
else \
echo "Wrong! Do it again!"; \
sleep 2; \
echo "Wrong! Do it again!"; \
sleep 2; \
echo "Wrong! Do it again!"; \
fi
@${TRUE}
magic: deep_magic
@-if [ -r .code_anal ]; then \
ccode_analysis --level 20003 --mode 5717175 --FNV1a_hash_512_bit -v2 "${PROG}" "${PROG}.c"; \
else \
echo "If you don't eat yer meat, you can't have any pudding!"; \
echo "How can you have any pudding if you don't eat yer meat?!"; \
fi
@${TRUE}
# The IOCCC resident astronomer states
#
charon: magic
@echo "$@ is a dwarf planet"
@echo "dwarf is a type of planet"
@echo "therefore IAU, $@ is a planet"
pluto: charon
${MAKE} charon
@echo "$@ is a dwarf planet"
@echo "dwarf is a type of planet"
@echo "therefore, $@ is a planet"
@echo "having lots of planets is good feature because supernovae can help ${MAKE} a lot of them"
2004/omoikane/README.md
+115 -105
View File
@@ -1,4 +1,4 @@
Best Utility: # Best Utility:
Don Yang Don Yang
259 E. Bellbrook St. 259 E. Bellbrook St.
@@ -7,151 +7,161 @@ Best Utility:
http://uguu.org/ http://uguu.org/
# To build:
Judges' Comments: ```sh
make
```
To build: ### To run:
make omoikane ```sh
./omoikane infile layout outfile
```
Try: ### Try:
./omoikane omoikane.info omoikane.info omoikane.output ```
./omoikane omoikane.info omoikane.info omoikane.output
```
For extra credit, spot the checksum in the source file itself. ## Judges' comments:
What makes this one particularly interesting is that the checksum,
strictly speaking, isn't being computed at all. Rather, the file
is modified to have the desired checksum! This does, we suppose,
solve the problem that inserting a checksum would change the file's
checksum; if you have to change it, you might as well change it!
This program was submitted under the name "Rinia", so the Author's For extra credit, spot the checksum in the source file itself.
Comments refer to it as such. What makes this one particularly interesting is that the checksum,
strictly speaking, isn't being computed at all. Rather, the file
is modified to have the desired checksum! This does, we suppose,
solve the problem that inserting a checksum would change the file's
checksum; if you have to change it, you might as well change it!
This program was submitted under the name "Rinia", so the Author's
Comments refer to it as such.
Selected Author's Comments: ## Author's comments:
Rinia (1/14/04) Rinia (1/14/04)
Rinia is a tool for embedding CRCs in text files. No need to assign Rinia is a tool for embedding CRCs in text files. No need to assign
strange file names or package .SFVs with your files! Rinia will strange file names or package .SFVs with your files! Rinia will
insert a human-readable checksum string in the text itself! ^_^ insert a human-readable checksum string in the text itself! ^_^
0. Usage ` 0. Usage `
rinia <infile> <layout> <outfile> ```sh
rinia <infile> <layout> <outfile>
```
All three arguments may reference the same file. All files is All three arguments may reference the same file. All files is
assumed to be of ASCII character set. assumed to be of ASCII character set.
1. Input % 1. Input %
Any file larger than 8 bytes is valid. Upper limit on file size is Any file larger than 8 bytes is valid. Upper limit on file size is
limited by memory. limited by memory.
If input file can't be loaded for any reason, Rinia will say "bad If input file can't be loaded for any reason, Rinia will say "bad
input" and exit immediately. input" and exit immediately.
2. Layout _ 2. Layout _
The layout file contains a map of where Rinia can patch. The The layout file contains a map of where Rinia can patch. The
content consists of marker characters (where Rinia is allowed to content consists of marker characters (where Rinia is allowed to
change in the original text) and other characters (where the change in the original text) and other characters (where the
original text will stay as is). Rinia will select the marker original text will stay as is). Rinia will select the marker
character using these heuristics: character using these heuristics:
1. Ignore all space/control/extended characters. 1. Ignore all space/control/extended characters.
2. Select characters that appeared 8 times in a row. 2. Select characters that appeared 8 times in a row.
3. Of those selected characters, pick one with the lowest 3. Of those selected characters, pick one with the lowest
frequency. frequency.
One way to create the layout file is to make a copy of the original One way to create the layout file is to make a copy of the original
file, replace where you want Rinia to match with a rare character, file, replace where you want Rinia to match with a rare character,
then replace the remaining ones with space. Often it's possible to then replace the remaining ones with space. Often it's possible to
write the original file in such a way that it can be used as a write the original file in such a way that it can be used as a
layout. layout.
Example file/layout: Example file/layout:
file: layout: file: layout:
crc = ######## ... . XXXXXXXX crc = ######## ... . XXXXXXXX
patch = ###### ..... . XXXXXX patch = ###### ..... . XXXXXX
other text here ..... .... .... other text here ..... .... ....
And Rinia may generate a file similar to this: And Rinia may generate a file similar to this:
crc = 1bad73cf crc = 1bad73cf
patch = #FR-QQ patch = #FR-QQ
other text here other text here
Note that the original file by itself is a valid layout file, since Note that the original file by itself is a valid layout file, since
Rinia will recognize that only # marks enough space to hold the Rinia will recognize that only # marks enough space to hold the
checksum, and has the lowest frequency. checksum, and has the lowest frequency.
If layout file can't be used for any reason, Rinia will say "bad If layout file can't be used for any reason, Rinia will say "bad
layout" and exit immediately. layout" and exit immediately.
3. Output m 3. Output m
If Rinia finds a usuable checksum, she will say "OK." and write to If Rinia finds a usuable checksum, she will say "OK." and write to
the specified output file. Otherwise the exit message is "fail" the specified output file. Otherwise the exit message is "fail"
and nothing is written. and nothing is written.
Chances of success and how long it takes to run to completion is Chances of success and how long it takes to run to completion is
completely dominated by the layout file design. In general, Rinia completely dominated by the layout file design. In general, Rinia
runs faster if the checksum is placed before the other marker runs faster if the checksum is placed before the other marker
characters rather than after, e.g.: characters rather than after, e.g.:
a: X X XXX b: XXXXXXXX c: XXXXXXXX a: X X XXX b: XXXXXXXX c: XXXXXXXX
XXXXXXXX X X XXX XXXXX XXXXXXXX X X XXX XXXXX
"a" usually takes the longest time, while "c" usually is the "a" usually takes the longest time, while "c" usually is the
fastest. fastest.
That said, each run is randomized with respect to system time, so That said, each run is randomized with respect to system time, so
it's not always certain whether Rinia will succeed in a short time it's not always certain whether Rinia will succeed in a short time
or not. In general, 5 marker characters is sufficient, and takes or not. In general, 5 marker characters is sufficient, and takes
a few minutes. a few minutes.
For reference, rinia.c was produced on a 1.7GHz machine (the For reference, rinia.c was produced on a 1.7GHz machine (the
checksum is at line 17). Out of 25 runs, the shortest was 2 checksum is at line 17). Out of 25 runs, the shortest was 2
seconds while the longest took 5 minutes. Average was about a seconds while the longest took 5 minutes. Average was about a
minute. Checksum for this file (b7a81524) took about 4 minutes. minute. Checksum for this file (b7a81524) took about 4 minutes.
4. Algorithm 3 4. Algorithm 3
Inserting a checksum in the file you are computing the checksum of Inserting a checksum in the file you are computing the checksum of
isn't quite trivial, since changing the file content would change isn't quite trivial, since changing the file content would change
the final checksum value. the final checksum value.
To insert the checksum, Rinia first assumes a random final To insert the checksum, Rinia first assumes a random final
checksum, insert that string, then modify other parts to compensate checksum, insert that string, then modify other parts to compensate
for the change in content. for the change in content.
The compensation bytes are very easy to compute for binary files The compensation bytes are very easy to compute for binary files
with enough consecutive scratch areas, but for text files with with enough consecutive scratch areas, but for text files with
non-consecutive areas and limited degrees of freedom, Rinia has to non-consecutive areas and limited degrees of freedom, Rinia has to
try out all character combinations. This is done in a hierarchical try out all character combinations. This is done in a hierarchical
fashion, computing only smallest partial checksum after each fashion, computing only smallest partial checksum after each
change. change.
For computers few years ago, this is probably still too slow to be For computers few years ago, this is probably still too slow to be
acceptible... but at the speed the IOCCC judges run the contest acceptible... but at the speed the IOCCC judges run the contest
these days, I am sure you have enough patience for it ^_^; these days, I am sure you have enough patience for it ^_^;
5. Source code = 5. Source code =
rinia.c should compile anywhere (but with a few warnings). I don't rinia.c should compile anywhere (but with a few warnings). I don't
have a big-endian machine to test but Rinia should work there as have a big-endian machine to test but Rinia should work there as
well. ASCII character set required though. well. ASCII character set required though.
Code is formatted to the shape of "Rinia" from the anime/game Code is formatted to the shape of "Rinia" from the anime/game
"Moekko Company". Of course at 90x50 it's hard to recognize anything "Moekko Company". Of course at 90x50 it's hard to recognize anything
^_^; ^_^;
Rinia is the slow but hardworking android. On some jobs she does Rinia is the slow but hardworking android. On some jobs she does
very well, on others she would spend lots of time and effort but very well, on others she would spend lots of time and effort but
still fail... still fail...
(text above is also included as an info file, so that the checksum (text above is also included as an info file, so that the checksum
would match) would match)